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 void output_addressed_constants (tree
);
158 static unsigned HOST_WIDE_INT
array_size_for_constructor (tree
);
159 static unsigned min_align (unsigned, unsigned);
160 static void output_constructor (tree
, unsigned HOST_WIDE_INT
, unsigned int);
161 static void globalize_decl (tree
);
162 static void maybe_assemble_visibility (tree
);
163 static int in_named_entry_eq (const void *, const void *);
164 static hashval_t
in_named_entry_hash (const void *);
165 #ifdef ASM_OUTPUT_BSS
166 static void asm_output_bss (FILE *, tree
, const char *,
167 unsigned HOST_WIDE_INT
, unsigned HOST_WIDE_INT
);
169 #ifdef BSS_SECTION_ASM_OP
170 #ifdef ASM_OUTPUT_ALIGNED_BSS
171 static void asm_output_aligned_bss (FILE *, tree
, const char *,
172 unsigned HOST_WIDE_INT
, int)
175 #endif /* BSS_SECTION_ASM_OP */
176 static bool asm_emit_uninitialised (tree
, const char*,
177 unsigned HOST_WIDE_INT
,
178 unsigned HOST_WIDE_INT
);
179 static void mark_weak (tree
);
181 enum in_section
{ no_section
, in_text
, in_data
, in_named
182 #ifdef BSS_SECTION_ASM_OP
185 #ifdef CTORS_SECTION_ASM_OP
188 #ifdef DTORS_SECTION_ASM_OP
191 #ifdef READONLY_DATA_SECTION_ASM_OP
194 #ifdef EXTRA_SECTIONS
198 static GTY(()) enum in_section in_section
= no_section
;
200 /* Return a nonzero value if DECL has a section attribute. */
201 #ifndef IN_NAMED_SECTION
202 #define IN_NAMED_SECTION(DECL) \
203 ((TREE_CODE (DECL) == FUNCTION_DECL || TREE_CODE (DECL) == VAR_DECL) \
204 && DECL_SECTION_NAME (DECL) != NULL_TREE)
207 /* Text of section name when in_section == in_named. */
208 static GTY(()) const char *in_named_name
;
210 /* Hash table of flags that have been used for a particular named section. */
212 struct in_named_entry
GTY(())
219 static GTY((param_is (struct in_named_entry
))) htab_t in_named_htab
;
221 /* Define functions like text_section for any extra sections. */
222 #ifdef EXTRA_SECTION_FUNCTIONS
223 EXTRA_SECTION_FUNCTIONS
226 /* Tell assembler to switch to text section. */
231 if (in_section
!= in_text
)
233 in_section
= in_text
;
237 fprintf (asm_out_file
, "%s\n", TEXT_SECTION_ASM_OP
);
242 /* Tell assembler to switch to data section. */
247 if (in_section
!= in_data
)
249 in_section
= in_data
;
250 if (flag_shared_data
)
252 #ifdef SHARED_SECTION_ASM_OP
253 fprintf (asm_out_file
, "%s\n", SHARED_SECTION_ASM_OP
);
255 fprintf (asm_out_file
, "%s\n", DATA_SECTION_ASM_OP
);
259 fprintf (asm_out_file
, "%s\n", DATA_SECTION_ASM_OP
);
263 /* Tell assembler to switch to read-only data section. This is normally
267 readonly_data_section (void)
269 #ifdef READONLY_DATA_SECTION
270 READONLY_DATA_SECTION (); /* Note this can call data_section. */
272 #ifdef READONLY_DATA_SECTION_ASM_OP
273 if (in_section
!= in_readonly_data
)
275 in_section
= in_readonly_data
;
276 fputs (READONLY_DATA_SECTION_ASM_OP
, asm_out_file
);
277 fputc ('\n', asm_out_file
);
285 /* Determine if we're in the text section. */
288 in_text_section (void)
290 return in_section
== in_text
;
293 /* Determine if we're in the data section. */
296 in_data_section (void)
298 return in_section
== in_data
;
301 /* Helper routines for maintaining in_named_htab. */
304 in_named_entry_eq (const void *p1
, const void *p2
)
306 const struct in_named_entry
*old
= p1
;
307 const char *new = p2
;
309 return strcmp (old
->name
, new) == 0;
313 in_named_entry_hash (const void *p
)
315 const struct in_named_entry
*old
= p
;
316 return htab_hash_string (old
->name
);
319 /* If SECTION has been seen before as a named section, return the flags
320 that were used. Otherwise, return 0. Note, that 0 is a perfectly valid
321 set of flags for a section to have, so 0 does not mean that the section
322 has not been seen. */
325 get_named_section_flags (const char *section
)
327 struct in_named_entry
**slot
;
329 slot
= (struct in_named_entry
**)
330 htab_find_slot_with_hash (in_named_htab
, section
,
331 htab_hash_string (section
), NO_INSERT
);
333 return slot
? (*slot
)->flags
: 0;
336 /* Returns true if the section has been declared before. Sets internal
337 flag on this section in in_named_hash so subsequent calls on this
338 section will return false. */
341 named_section_first_declaration (const char *name
)
343 struct in_named_entry
**slot
;
345 slot
= (struct in_named_entry
**)
346 htab_find_slot_with_hash (in_named_htab
, name
,
347 htab_hash_string (name
), NO_INSERT
);
348 if (! (*slot
)->declared
)
350 (*slot
)->declared
= true;
360 /* Record FLAGS for SECTION. If SECTION was previously recorded with a
361 different set of flags, return false. */
364 set_named_section_flags (const char *section
, unsigned int flags
)
366 struct in_named_entry
**slot
, *entry
;
368 slot
= (struct in_named_entry
**)
369 htab_find_slot_with_hash (in_named_htab
, section
,
370 htab_hash_string (section
), INSERT
);
375 entry
= ggc_alloc (sizeof (*entry
));
377 entry
->name
= ggc_strdup (section
);
378 entry
->flags
= flags
;
379 entry
->declared
= false;
381 else if (entry
->flags
!= flags
)
387 /* Tell assembler to change to section NAME with attributes FLAGS. */
390 named_section_flags (const char *name
, unsigned int flags
)
392 if (in_section
!= in_named
|| strcmp (name
, in_named_name
) != 0)
394 if (! set_named_section_flags (name
, flags
))
397 (*targetm
.asm_out
.named_section
) (name
, flags
);
399 if (flags
& SECTION_FORGET
)
400 in_section
= no_section
;
403 in_named_name
= ggc_strdup (name
);
404 in_section
= in_named
;
409 /* Tell assembler to change to section NAME for DECL.
410 If DECL is NULL, just switch to section NAME.
411 If NAME is NULL, get the name from DECL.
412 If RELOC is 1, the initializer for DECL contains relocs. */
415 named_section (tree decl
, const char *name
, int reloc
)
419 if (decl
!= NULL_TREE
&& !DECL_P (decl
))
422 name
= TREE_STRING_POINTER (DECL_SECTION_NAME (decl
));
424 flags
= (* targetm
.section_type_flags
) (decl
, name
, reloc
);
426 /* Sanity check user variables for flag changes. Non-user
427 section flag changes will abort in named_section_flags.
428 However, don't complain if SECTION_OVERRIDE is set.
429 We trust that the setter knows that it is safe to ignore
430 the default flags for this decl. */
431 if (decl
&& ! set_named_section_flags (name
, flags
))
433 flags
= get_named_section_flags (name
);
434 if ((flags
& SECTION_OVERRIDE
) == 0)
435 error ("%J%D causes a section type conflict", decl
, decl
);
438 named_section_flags (name
, flags
);
441 /* If required, set DECL_SECTION_NAME to a unique name. */
444 resolve_unique_section (tree decl
, int reloc ATTRIBUTE_UNUSED
,
445 int flag_function_or_data_sections
)
447 if (DECL_SECTION_NAME (decl
) == NULL_TREE
448 && targetm
.have_named_sections
449 && (flag_function_or_data_sections
450 || DECL_ONE_ONLY (decl
)))
451 (*targetm
.asm_out
.unique_section
) (decl
, reloc
);
454 #ifdef BSS_SECTION_ASM_OP
456 /* Tell the assembler to switch to the bss section. */
461 if (in_section
!= in_bss
)
463 #ifdef SHARED_BSS_SECTION_ASM_OP
464 if (flag_shared_data
)
465 fprintf (asm_out_file
, "%s\n", SHARED_BSS_SECTION_ASM_OP
);
468 fprintf (asm_out_file
, "%s\n", BSS_SECTION_ASM_OP
);
474 #ifdef ASM_OUTPUT_BSS
476 /* Utility function for ASM_OUTPUT_BSS for targets to use if
477 they don't support alignments in .bss.
478 ??? It is believed that this function will work in most cases so such
479 support is localized here. */
482 asm_output_bss (FILE *file
, tree decl ATTRIBUTE_UNUSED
,
484 unsigned HOST_WIDE_INT size ATTRIBUTE_UNUSED
,
485 unsigned HOST_WIDE_INT rounded
)
487 (*targetm
.asm_out
.globalize_label
) (file
, name
);
489 #ifdef ASM_DECLARE_OBJECT_NAME
490 last_assemble_variable_decl
= decl
;
491 ASM_DECLARE_OBJECT_NAME (file
, name
, decl
);
493 /* Standard thing is just output label for the object. */
494 ASM_OUTPUT_LABEL (file
, name
);
495 #endif /* ASM_DECLARE_OBJECT_NAME */
496 ASM_OUTPUT_SKIP (file
, rounded
? rounded
: 1);
501 #ifdef ASM_OUTPUT_ALIGNED_BSS
503 /* Utility function for targets to use in implementing
504 ASM_OUTPUT_ALIGNED_BSS.
505 ??? It is believed that this function will work in most cases so such
506 support is localized here. */
509 asm_output_aligned_bss (FILE *file
, tree decl ATTRIBUTE_UNUSED
,
510 const char *name
, unsigned HOST_WIDE_INT size
,
514 ASM_OUTPUT_ALIGN (file
, floor_log2 (align
/ BITS_PER_UNIT
));
515 #ifdef ASM_DECLARE_OBJECT_NAME
516 last_assemble_variable_decl
= decl
;
517 ASM_DECLARE_OBJECT_NAME (file
, name
, decl
);
519 /* Standard thing is just output label for the object. */
520 ASM_OUTPUT_LABEL (file
, name
);
521 #endif /* ASM_DECLARE_OBJECT_NAME */
522 ASM_OUTPUT_SKIP (file
, size
? size
: 1);
527 #endif /* BSS_SECTION_ASM_OP */
529 /* Switch to the section for function DECL.
531 If DECL is NULL_TREE, switch to the text section.
532 ??? It's not clear that we will ever be passed NULL_TREE, but it's
533 safer to handle it. */
536 function_section (tree decl
)
538 if (decl
!= NULL_TREE
539 && DECL_SECTION_NAME (decl
) != NULL_TREE
)
540 named_section (decl
, (char *) 0, 0);
545 /* Switch to section for variable DECL. RELOC is the same as the
546 argument to SELECT_SECTION. */
549 variable_section (tree decl
, int reloc
)
551 if (IN_NAMED_SECTION (decl
))
552 named_section (decl
, NULL
, reloc
);
554 (*targetm
.asm_out
.select_section
) (decl
, reloc
, DECL_ALIGN (decl
));
557 /* Tell assembler to switch to the section for string merging. */
560 mergeable_string_section (tree decl ATTRIBUTE_UNUSED
,
561 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
,
562 unsigned int flags ATTRIBUTE_UNUSED
)
564 if (HAVE_GAS_SHF_MERGE
&& flag_merge_constants
565 && TREE_CODE (decl
) == STRING_CST
566 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
568 && TREE_STRING_LENGTH (decl
) >= int_size_in_bytes (TREE_TYPE (decl
)))
570 enum machine_mode mode
;
571 unsigned int modesize
;
576 mode
= TYPE_MODE (TREE_TYPE (TREE_TYPE (decl
)));
577 modesize
= GET_MODE_BITSIZE (mode
);
578 if (modesize
>= 8 && modesize
<= 256
579 && (modesize
& (modesize
- 1)) == 0)
581 if (align
< modesize
)
584 str
= TREE_STRING_POINTER (decl
);
585 len
= TREE_STRING_LENGTH (decl
);
586 unit
= GET_MODE_SIZE (mode
);
588 /* Check for embedded NUL characters. */
589 for (i
= 0; i
< len
; i
+= unit
)
591 for (j
= 0; j
< unit
; j
++)
592 if (str
[i
+ j
] != '\0')
599 sprintf (name
, ".rodata.str%d.%d", modesize
/ 8,
601 flags
|= (modesize
/ 8) | SECTION_MERGE
| SECTION_STRINGS
;
602 if (!i
&& modesize
< align
)
604 /* A "" string with requested alignment greater than
605 character size might cause a problem:
606 if some other string required even bigger
607 alignment than "", then linker might think the
608 "" is just part of padding after some other string
609 and not put it into the hash table initially.
610 But this means "" could have smaller alignment
612 #ifdef ASM_OUTPUT_SECTION_START
613 named_section_flags (name
, flags
);
614 ASM_OUTPUT_SECTION_START (asm_out_file
);
616 readonly_data_section ();
621 named_section_flags (name
, flags
);
627 readonly_data_section ();
630 /* Tell assembler to switch to the section for constant merging. */
633 mergeable_constant_section (enum machine_mode mode ATTRIBUTE_UNUSED
,
634 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
,
635 unsigned int flags ATTRIBUTE_UNUSED
)
637 unsigned int modesize
= GET_MODE_BITSIZE (mode
);
639 if (HAVE_GAS_SHF_MERGE
&& flag_merge_constants
645 && (align
& (align
- 1)) == 0)
649 sprintf (name
, ".rodata.cst%d", (int) (align
/ 8));
650 flags
|= (align
/ 8) | SECTION_MERGE
;
651 named_section_flags (name
, flags
);
655 readonly_data_section ();
658 /* Given NAME, a putative register name, discard any customary prefixes. */
661 strip_reg_name (const char *name
)
663 #ifdef REGISTER_PREFIX
664 if (!strncmp (name
, REGISTER_PREFIX
, strlen (REGISTER_PREFIX
)))
665 name
+= strlen (REGISTER_PREFIX
);
667 if (name
[0] == '%' || name
[0] == '#')
672 /* Decode an `asm' spec for a declaration as a register name.
673 Return the register number, or -1 if nothing specified,
674 or -2 if the ASMSPEC is not `cc' or `memory' and is not recognized,
675 or -3 if ASMSPEC is `cc' and is not recognized,
676 or -4 if ASMSPEC is `memory' and is not recognized.
677 Accept an exact spelling or a decimal number.
678 Prefixes such as % are optional. */
681 decode_reg_name (const char *asmspec
)
687 /* Get rid of confusing prefixes. */
688 asmspec
= strip_reg_name (asmspec
);
690 /* Allow a decimal number as a "register name". */
691 for (i
= strlen (asmspec
) - 1; i
>= 0; i
--)
692 if (! ISDIGIT (asmspec
[i
]))
694 if (asmspec
[0] != 0 && i
< 0)
697 if (i
< FIRST_PSEUDO_REGISTER
&& i
>= 0)
703 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
705 && ! strcmp (asmspec
, strip_reg_name (reg_names
[i
])))
708 #ifdef ADDITIONAL_REGISTER_NAMES
710 static const struct { const char *const name
; const int number
; } table
[]
711 = ADDITIONAL_REGISTER_NAMES
;
713 for (i
= 0; i
< (int) ARRAY_SIZE (table
); i
++)
714 if (! strcmp (asmspec
, table
[i
].name
))
715 return table
[i
].number
;
717 #endif /* ADDITIONAL_REGISTER_NAMES */
719 if (!strcmp (asmspec
, "memory"))
722 if (!strcmp (asmspec
, "cc"))
731 /* Create the DECL_RTL for a VAR_DECL or FUNCTION_DECL. DECL should
732 have static storage duration. In other words, it should not be an
733 automatic variable, including PARM_DECLs.
735 There is, however, one exception: this function handles variables
736 explicitly placed in a particular register by the user.
738 ASMSPEC, if not 0, is the string which the user specified as the
739 assembler symbol name.
741 This is never called for PARM_DECL nodes. */
744 make_decl_rtl (tree decl
, const char *asmspec
)
746 const char *name
= 0;
750 /* Check that we are not being given an automatic variable. */
751 /* A weak alias has TREE_PUBLIC set but not the other bits. */
752 if (TREE_CODE (decl
) == PARM_DECL
753 || TREE_CODE (decl
) == RESULT_DECL
754 || (TREE_CODE (decl
) == VAR_DECL
755 && !TREE_STATIC (decl
)
756 && !TREE_PUBLIC (decl
)
757 && !DECL_EXTERNAL (decl
)
758 && !DECL_REGISTER (decl
)))
760 /* And that we were not given a type or a label. */
761 else if (TREE_CODE (decl
) == TYPE_DECL
762 || TREE_CODE (decl
) == LABEL_DECL
)
765 /* For a duplicate declaration, we can be called twice on the
766 same DECL node. Don't discard the RTL already made. */
767 if (DECL_RTL_SET_P (decl
))
769 /* If the old RTL had the wrong mode, fix the mode. */
770 if (GET_MODE (DECL_RTL (decl
)) != DECL_MODE (decl
))
771 SET_DECL_RTL (decl
, adjust_address_nv (DECL_RTL (decl
),
772 DECL_MODE (decl
), 0));
774 /* ??? Another way to do this would be to maintain a hashed
775 table of such critters. Instead of adding stuff to a DECL
776 to give certain attributes to it, we could use an external
777 hash map from DECL to set of attributes. */
779 /* Let the target reassign the RTL if it wants.
780 This is necessary, for example, when one machine specific
781 decl attribute overrides another. */
782 (* targetm
.encode_section_info
) (decl
, DECL_RTL (decl
), false);
786 reg_number
= decode_reg_name (asmspec
);
787 if (reg_number
== -2)
789 /* ASMSPEC is given, and not the name of a register. Mark the
790 name with a star so assemble_name won't munge it. */
791 char *starred
= alloca (strlen (asmspec
) + 2);
793 strcpy (starred
+ 1, asmspec
);
794 SET_DECL_ASSEMBLER_NAME (decl
, get_identifier (starred
));
797 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
799 if (TREE_CODE (decl
) != FUNCTION_DECL
&& DECL_REGISTER (decl
))
801 /* First detect errors in declaring global registers. */
802 if (reg_number
== -1)
803 error ("%Jregister name not specified for '%D'", decl
, decl
);
804 else if (reg_number
< 0)
805 error ("%Jinvalid register name for '%D'", decl
, decl
);
806 else if (TYPE_MODE (TREE_TYPE (decl
)) == BLKmode
)
807 error ("%Jdata type of '%D' isn't suitable for a register",
809 else if (! HARD_REGNO_MODE_OK (reg_number
, TYPE_MODE (TREE_TYPE (decl
))))
810 error ("%Jregister specified for '%D' isn't suitable for data type",
812 /* Now handle properly declared static register variables. */
817 if (DECL_INITIAL (decl
) != 0 && TREE_STATIC (decl
))
819 DECL_INITIAL (decl
) = 0;
820 error ("global register variable has initial value");
822 if (TREE_THIS_VOLATILE (decl
))
823 warning ("volatile register variables don't work as you might wish");
825 /* If the user specified one of the eliminables registers here,
826 e.g., FRAME_POINTER_REGNUM, we don't want to get this variable
827 confused with that register and be eliminated. This usage is
828 somewhat suspect... */
830 SET_DECL_RTL (decl
, gen_rtx_raw_REG (DECL_MODE (decl
), reg_number
));
831 ORIGINAL_REGNO (DECL_RTL (decl
)) = reg_number
;
832 REG_USERVAR_P (DECL_RTL (decl
)) = 1;
834 if (TREE_STATIC (decl
))
836 /* Make this register global, so not usable for anything
838 #ifdef ASM_DECLARE_REGISTER_GLOBAL
839 ASM_DECLARE_REGISTER_GLOBAL (asm_out_file
, decl
, reg_number
, name
);
841 nregs
= HARD_REGNO_NREGS (reg_number
, DECL_MODE (decl
));
843 globalize_reg (reg_number
+ --nregs
);
846 /* As a register variable, it has no section. */
851 /* Now handle ordinary static variables and functions (in memory).
852 Also handle vars declared register invalidly. */
854 if (reg_number
>= 0 || reg_number
== -3)
855 error ("%Jregister name given for non-register variable '%D'", decl
, decl
);
857 /* Specifying a section attribute on a variable forces it into a
858 non-.bss section, and thus it cannot be common. */
859 if (TREE_CODE (decl
) == VAR_DECL
860 && DECL_SECTION_NAME (decl
) != NULL_TREE
861 && DECL_INITIAL (decl
) == NULL_TREE
862 && DECL_COMMON (decl
))
863 DECL_COMMON (decl
) = 0;
865 /* Variables can't be both common and weak. */
866 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_WEAK (decl
))
867 DECL_COMMON (decl
) = 0;
869 x
= gen_rtx_SYMBOL_REF (Pmode
, name
);
870 SYMBOL_REF_WEAK (x
) = DECL_WEAK (decl
);
871 SYMBOL_REF_DECL (x
) = decl
;
873 x
= gen_rtx_MEM (DECL_MODE (decl
), x
);
874 if (TREE_CODE (decl
) != FUNCTION_DECL
)
875 set_mem_attributes (x
, decl
, 1);
876 SET_DECL_RTL (decl
, x
);
878 /* Optionally set flags or add text to the name to record information
879 such as that it is a function name.
880 If the name is changed, the macro ASM_OUTPUT_LABELREF
881 will have to know how to strip this information. */
882 (* targetm
.encode_section_info
) (decl
, DECL_RTL (decl
), true);
885 /* Make the rtl for variable VAR be volatile.
886 Use this only for static variables. */
889 make_var_volatile (tree var
)
891 if (GET_CODE (DECL_RTL (var
)) != MEM
)
894 MEM_VOLATILE_P (DECL_RTL (var
)) = 1;
897 /* Output a string of literal assembler code
898 for an `asm' keyword used between functions. */
901 assemble_asm (tree string
)
905 if (TREE_CODE (string
) == ADDR_EXPR
)
906 string
= TREE_OPERAND (string
, 0);
908 fprintf (asm_out_file
, "\t%s\n", TREE_STRING_POINTER (string
));
911 /* Record an element in the table of global destructors. SYMBOL is
912 a SYMBOL_REF of the function to be called; PRIORITY is a number
913 between 0 and MAX_INIT_PRIORITY. */
916 default_stabs_asm_out_destructor (rtx symbol
, int priority ATTRIBUTE_UNUSED
)
918 /* Tell GNU LD that this is part of the static destructor set.
919 This will work for any system that uses stabs, most usefully
921 fprintf (asm_out_file
, "%s\"___DTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
922 assemble_name (asm_out_file
, XSTR (symbol
, 0));
923 fputc ('\n', asm_out_file
);
927 default_named_section_asm_out_destructor (rtx symbol
, int priority
)
929 const char *section
= ".dtors";
932 /* ??? This only works reliably with the GNU linker. */
933 if (priority
!= DEFAULT_INIT_PRIORITY
)
935 sprintf (buf
, ".dtors.%.5u",
936 /* Invert the numbering so the linker puts us in the proper
937 order; constructors are run from right to left, and the
938 linker sorts in increasing order. */
939 MAX_INIT_PRIORITY
- priority
);
943 named_section_flags (section
, SECTION_WRITE
);
944 assemble_align (POINTER_SIZE
);
945 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
948 #ifdef DTORS_SECTION_ASM_OP
952 if (in_section
!= in_dtors
)
954 in_section
= in_dtors
;
955 fputs (DTORS_SECTION_ASM_OP
, asm_out_file
);
956 fputc ('\n', asm_out_file
);
961 default_dtor_section_asm_out_destructor (rtx symbol
,
962 int priority ATTRIBUTE_UNUSED
)
965 assemble_align (POINTER_SIZE
);
966 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
970 /* Likewise for global constructors. */
973 default_stabs_asm_out_constructor (rtx symbol
, int priority ATTRIBUTE_UNUSED
)
975 /* Tell GNU LD that this is part of the static destructor set.
976 This will work for any system that uses stabs, most usefully
978 fprintf (asm_out_file
, "%s\"___CTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
979 assemble_name (asm_out_file
, XSTR (symbol
, 0));
980 fputc ('\n', asm_out_file
);
984 default_named_section_asm_out_constructor (rtx symbol
, int priority
)
986 const char *section
= ".ctors";
989 /* ??? This only works reliably with the GNU linker. */
990 if (priority
!= DEFAULT_INIT_PRIORITY
)
992 sprintf (buf
, ".ctors.%.5u",
993 /* Invert the numbering so the linker puts us in the proper
994 order; constructors are run from right to left, and the
995 linker sorts in increasing order. */
996 MAX_INIT_PRIORITY
- priority
);
1000 named_section_flags (section
, SECTION_WRITE
);
1001 assemble_align (POINTER_SIZE
);
1002 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1005 #ifdef CTORS_SECTION_ASM_OP
1007 ctors_section (void)
1009 if (in_section
!= in_ctors
)
1011 in_section
= in_ctors
;
1012 fputs (CTORS_SECTION_ASM_OP
, asm_out_file
);
1013 fputc ('\n', asm_out_file
);
1018 default_ctor_section_asm_out_constructor (rtx symbol
,
1019 int priority ATTRIBUTE_UNUSED
)
1022 assemble_align (POINTER_SIZE
);
1023 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1027 /* CONSTANT_POOL_BEFORE_FUNCTION may be defined as an expression with
1028 a nonzero value if the constant pool should be output before the
1029 start of the function, or a zero value if the pool should output
1030 after the end of the function. The default is to put it before the
1033 #ifndef CONSTANT_POOL_BEFORE_FUNCTION
1034 #define CONSTANT_POOL_BEFORE_FUNCTION 1
1037 /* DECL is an object (either VAR_DECL or FUNCTION_DECL) which is going
1038 to be output to assembler.
1039 Set first_global_object_name and weak_global_object_name as appropriate. */
1042 notice_global_symbol (tree decl
)
1044 const char **type
= &first_global_object_name
;
1046 if (first_global_object_name
1047 || !TREE_PUBLIC (decl
) || DECL_EXTERNAL (decl
)
1048 || !DECL_NAME (decl
)
1049 || (TREE_CODE (decl
) != FUNCTION_DECL
1050 && (TREE_CODE (decl
) != VAR_DECL
1051 || (DECL_COMMON (decl
)
1052 && (DECL_INITIAL (decl
) == 0
1053 || DECL_INITIAL (decl
) == error_mark_node
))))
1054 || GET_CODE (DECL_RTL (decl
)) != MEM
)
1057 /* We win when global object is found, but it is usefull to know about weak
1058 symbol as well so we can produce nicer unique names. */
1059 if (DECL_WEAK (decl
) || DECL_ONE_ONLY (decl
))
1060 type
= &weak_global_object_name
;
1066 rtx decl_rtl
= DECL_RTL (decl
);
1068 p
= (* targetm
.strip_name_encoding
) (XSTR (XEXP (decl_rtl
, 0), 0));
1075 /* Output assembler code for the constant pool of a function and associated
1076 with defining the name of the function. DECL describes the function.
1077 NAME is the function's name. For the constant pool, we use the current
1078 constant pool data. */
1081 assemble_start_function (tree decl
, const char *fnname
)
1085 /* The following code does not need preprocessing in the assembler. */
1089 if (CONSTANT_POOL_BEFORE_FUNCTION
)
1090 output_constant_pool (fnname
, decl
);
1092 resolve_unique_section (decl
, 0, flag_function_sections
);
1093 function_section (decl
);
1095 /* Tell assembler to move to target machine's alignment for functions. */
1096 align
= floor_log2 (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
1097 if (align
< force_align_functions_log
)
1098 align
= force_align_functions_log
;
1101 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1104 /* Handle a user-specified function alignment.
1105 Note that we still need to align to FUNCTION_BOUNDARY, as above,
1106 because ASM_OUTPUT_MAX_SKIP_ALIGN might not do any alignment at all. */
1107 if (align_functions_log
> align
1108 && cfun
->function_frequency
!= FUNCTION_FREQUENCY_UNLIKELY_EXECUTED
)
1110 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
1111 ASM_OUTPUT_MAX_SKIP_ALIGN (asm_out_file
,
1112 align_functions_log
, align_functions
- 1);
1114 ASM_OUTPUT_ALIGN (asm_out_file
, align_functions_log
);
1118 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
1119 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file
, fnname
);
1122 (*debug_hooks
->begin_function
) (decl
);
1124 /* Make function name accessible from other files, if appropriate. */
1126 if (TREE_PUBLIC (decl
))
1128 notice_global_symbol (decl
);
1130 globalize_decl (decl
);
1132 maybe_assemble_visibility (decl
);
1135 /* Do any machine/system dependent processing of the function name */
1136 #ifdef ASM_DECLARE_FUNCTION_NAME
1137 ASM_DECLARE_FUNCTION_NAME (asm_out_file
, fnname
, current_function_decl
);
1139 /* Standard thing is just output label for the function. */
1140 ASM_OUTPUT_LABEL (asm_out_file
, fnname
);
1141 #endif /* ASM_DECLARE_FUNCTION_NAME */
1144 /* Output assembler code associated with defining the size of the
1145 function. DECL describes the function. NAME is the function's name. */
1148 assemble_end_function (tree decl
, const char *fnname
)
1150 #ifdef ASM_DECLARE_FUNCTION_SIZE
1151 ASM_DECLARE_FUNCTION_SIZE (asm_out_file
, fnname
, decl
);
1153 if (! CONSTANT_POOL_BEFORE_FUNCTION
)
1155 output_constant_pool (fnname
, decl
);
1156 function_section (decl
); /* need to switch back */
1160 /* Assemble code to leave SIZE bytes of zeros. */
1163 assemble_zeros (unsigned HOST_WIDE_INT size
)
1165 /* Do no output if -fsyntax-only. */
1166 if (flag_syntax_only
)
1169 #ifdef ASM_NO_SKIP_IN_TEXT
1170 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
1171 so we must output 0s explicitly in the text section. */
1172 if (ASM_NO_SKIP_IN_TEXT
&& in_text_section ())
1174 unsigned HOST_WIDE_INT i
;
1175 for (i
= 0; i
< size
; i
++)
1176 assemble_integer (const0_rtx
, 1, BITS_PER_UNIT
, 1);
1181 ASM_OUTPUT_SKIP (asm_out_file
, size
);
1184 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
1187 assemble_align (int align
)
1189 if (align
> BITS_PER_UNIT
)
1191 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
1195 /* Assemble a string constant with the specified C string as contents. */
1198 assemble_string (const char *p
, int size
)
1203 /* If the string is very long, split it up. */
1207 int thissize
= size
- pos
;
1208 if (thissize
> maximum
)
1211 ASM_OUTPUT_ASCII (asm_out_file
, p
, thissize
);
1219 #if defined ASM_OUTPUT_ALIGNED_DECL_LOCAL
1220 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1221 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1223 #if defined ASM_OUTPUT_ALIGNED_LOCAL
1224 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1225 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, DECL_ALIGN (decl))
1227 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1228 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded)
1232 #if defined ASM_OUTPUT_ALIGNED_BSS
1233 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1234 ASM_OUTPUT_ALIGNED_BSS (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1236 #if defined ASM_OUTPUT_BSS
1237 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1238 ASM_OUTPUT_BSS (asm_out_file, decl, name, size, rounded)
1244 #if defined ASM_OUTPUT_ALIGNED_DECL_COMMON
1245 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1246 ASM_OUTPUT_ALIGNED_DECL_COMMON (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1248 #if defined ASM_OUTPUT_ALIGNED_COMMON
1249 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1250 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file, name, size, DECL_ALIGN (decl))
1252 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1253 ASM_OUTPUT_COMMON (asm_out_file, name, size, rounded)
1258 asm_emit_uninitialised (tree decl
, const char *name
,
1259 unsigned HOST_WIDE_INT size ATTRIBUTE_UNUSED
,
1260 unsigned HOST_WIDE_INT rounded ATTRIBUTE_UNUSED
)
1268 destination
= asm_dest_local
;
1270 /* ??? We should handle .bss via select_section mechanisms rather than
1271 via special target hooks. That would eliminate this special case. */
1272 if (TREE_PUBLIC (decl
))
1274 if (!DECL_COMMON (decl
))
1276 destination
= asm_dest_bss
;
1281 destination
= asm_dest_common
;
1284 if (destination
== asm_dest_bss
)
1285 globalize_decl (decl
);
1286 resolve_unique_section (decl
, 0, flag_data_sections
);
1288 if (flag_shared_data
)
1290 switch (destination
)
1292 #ifdef ASM_OUTPUT_SHARED_BSS
1294 ASM_OUTPUT_SHARED_BSS (asm_out_file
, decl
, name
, size
, rounded
);
1297 #ifdef ASM_OUTPUT_SHARED_COMMON
1298 case asm_dest_common
:
1299 ASM_OUTPUT_SHARED_COMMON (asm_out_file
, name
, size
, rounded
);
1302 #ifdef ASM_OUTPUT_SHARED_LOCAL
1303 case asm_dest_local
:
1304 ASM_OUTPUT_SHARED_LOCAL (asm_out_file
, name
, size
, rounded
);
1312 switch (destination
)
1316 ASM_EMIT_BSS (decl
, name
, size
, rounded
);
1319 case asm_dest_common
:
1320 ASM_EMIT_COMMON (decl
, name
, size
, rounded
);
1322 case asm_dest_local
:
1323 ASM_EMIT_LOCAL (decl
, name
, size
, rounded
);
1332 /* Assemble everything that is needed for a variable or function declaration.
1333 Not used for automatic variables, and not used for function definitions.
1334 Should not be called for variables of incomplete structure type.
1336 TOP_LEVEL is nonzero if this variable has file scope.
1337 AT_END is nonzero if this is the special handling, at end of compilation,
1338 to define things that have had only tentative definitions.
1339 DONT_OUTPUT_DATA if nonzero means don't actually output the
1340 initial value (that will be done by the caller). */
1343 assemble_variable (tree decl
, int top_level ATTRIBUTE_UNUSED
,
1344 int at_end ATTRIBUTE_UNUSED
, int dont_output_data
)
1351 if (lang_hooks
.decls
.prepare_assemble_variable
)
1352 (*lang_hooks
.decls
.prepare_assemble_variable
) (decl
);
1354 last_assemble_variable_decl
= 0;
1356 /* Normally no need to say anything here for external references,
1357 since assemble_external is called by the language-specific code
1358 when a declaration is first seen. */
1360 if (DECL_EXTERNAL (decl
))
1363 /* Output no assembler code for a function declaration.
1364 Only definitions of functions output anything. */
1366 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1369 /* Do nothing for global register variables. */
1370 if (DECL_RTL_SET_P (decl
) && GET_CODE (DECL_RTL (decl
)) == REG
)
1372 TREE_ASM_WRITTEN (decl
) = 1;
1376 /* If type was incomplete when the variable was declared,
1377 see if it is complete now. */
1379 if (DECL_SIZE (decl
) == 0)
1380 layout_decl (decl
, 0);
1382 /* Still incomplete => don't allocate it; treat the tentative defn
1383 (which is what it must have been) as an `extern' reference. */
1385 if (!dont_output_data
&& DECL_SIZE (decl
) == 0)
1387 error ("%Jstorage size of `%D' isn't known", decl
, decl
);
1388 TREE_ASM_WRITTEN (decl
) = 1;
1392 /* The first declaration of a variable that comes through this function
1393 decides whether it is global (in C, has external linkage)
1394 or local (in C, has internal linkage). So do nothing more
1395 if this function has already run. */
1397 if (TREE_ASM_WRITTEN (decl
))
1400 /* Make sure targetm.encode_section_info is invoked before we set
1402 decl_rtl
= DECL_RTL (decl
);
1404 TREE_ASM_WRITTEN (decl
) = 1;
1406 /* Do no output if -fsyntax-only. */
1407 if (flag_syntax_only
)
1412 if (! dont_output_data
1413 && ! host_integerp (DECL_SIZE_UNIT (decl
), 1))
1415 error ("%Jsize of variable '%D' is too large", decl
, decl
);
1419 name
= XSTR (XEXP (decl_rtl
, 0), 0);
1420 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
))
1421 notice_global_symbol (decl
);
1423 /* Compute the alignment of this data. */
1425 align
= DECL_ALIGN (decl
);
1427 /* In the case for initialing an array whose length isn't specified,
1428 where we have not yet been able to do the layout,
1429 figure out the proper alignment now. */
1430 if (dont_output_data
&& DECL_SIZE (decl
) == 0
1431 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
)
1432 align
= MAX (align
, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl
))));
1434 /* Some object file formats have a maximum alignment which they support.
1435 In particular, a.out format supports a maximum alignment of 4. */
1436 #ifndef MAX_OFILE_ALIGNMENT
1437 #define MAX_OFILE_ALIGNMENT BIGGEST_ALIGNMENT
1439 if (align
> MAX_OFILE_ALIGNMENT
)
1441 warning ("%Jalignment of '%D' is greater than maximum object "
1442 "file alignment. Using %d", decl
, decl
,
1443 MAX_OFILE_ALIGNMENT
/BITS_PER_UNIT
);
1444 align
= MAX_OFILE_ALIGNMENT
;
1447 /* On some machines, it is good to increase alignment sometimes. */
1448 if (! DECL_USER_ALIGN (decl
))
1450 #ifdef DATA_ALIGNMENT
1451 align
= DATA_ALIGNMENT (TREE_TYPE (decl
), align
);
1453 #ifdef CONSTANT_ALIGNMENT
1454 if (DECL_INITIAL (decl
) != 0 && DECL_INITIAL (decl
) != error_mark_node
)
1455 align
= CONSTANT_ALIGNMENT (DECL_INITIAL (decl
), align
);
1459 /* Reset the alignment in case we have made it tighter, so we can benefit
1460 from it in get_pointer_alignment. */
1461 DECL_ALIGN (decl
) = align
;
1462 set_mem_align (decl_rtl
, align
);
1464 if (TREE_PUBLIC (decl
))
1465 maybe_assemble_visibility (decl
);
1467 /* Output any data that we will need to use the address of. */
1468 if (DECL_INITIAL (decl
) == error_mark_node
)
1469 reloc
= contains_pointers_p (TREE_TYPE (decl
)) ? 3 : 0;
1470 else if (DECL_INITIAL (decl
))
1472 reloc
= compute_reloc_for_constant (DECL_INITIAL (decl
));
1473 output_addressed_constants (DECL_INITIAL (decl
));
1475 resolve_unique_section (decl
, reloc
, flag_data_sections
);
1477 /* Handle uninitialized definitions. */
1479 /* If the decl has been given an explicit section name, then it
1480 isn't common, and shouldn't be handled as such. */
1481 if (DECL_SECTION_NAME (decl
) || dont_output_data
)
1483 /* We don't implement common thread-local data at present. */
1484 else if (DECL_THREAD_LOCAL (decl
))
1486 if (DECL_COMMON (decl
))
1487 sorry ("thread-local COMMON data not implemented");
1489 else if (DECL_INITIAL (decl
) == 0
1490 || DECL_INITIAL (decl
) == error_mark_node
1491 || (flag_zero_initialized_in_bss
1492 /* Leave constant zeroes in .rodata so they can be shared. */
1493 && !TREE_READONLY (decl
)
1494 && initializer_zerop (DECL_INITIAL (decl
))))
1496 unsigned HOST_WIDE_INT size
= tree_low_cst (DECL_SIZE_UNIT (decl
), 1);
1497 unsigned HOST_WIDE_INT rounded
= size
;
1499 /* Don't allocate zero bytes of common,
1500 since that means "undefined external" in the linker. */
1504 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1505 so that each uninitialized object starts on such a boundary. */
1506 rounded
+= (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1;
1507 rounded
= (rounded
/ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1508 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1510 #if !defined(ASM_OUTPUT_ALIGNED_COMMON) && !defined(ASM_OUTPUT_ALIGNED_DECL_COMMON) && !defined(ASM_OUTPUT_ALIGNED_BSS)
1511 if ((unsigned HOST_WIDE_INT
) DECL_ALIGN (decl
) / BITS_PER_UNIT
> rounded
)
1512 warning ("%Jrequested alignment for '%D' is greater than "
1513 "implemented alignment of %d", decl
, decl
, rounded
);
1516 /* If the target cannot output uninitialized but not common global data
1517 in .bss, then we have to use .data, so fall through. */
1518 if (asm_emit_uninitialised (decl
, name
, size
, rounded
))
1522 /* Handle initialized definitions.
1523 Also handle uninitialized global definitions if -fno-common and the
1524 target doesn't support ASM_OUTPUT_BSS. */
1526 /* First make the assembler name(s) global if appropriate. */
1527 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
))
1528 globalize_decl (decl
);
1530 /* Switch to the appropriate section. */
1531 variable_section (decl
, reloc
);
1533 /* dbxout.c needs to know this. */
1534 if (in_text_section ())
1535 DECL_IN_TEXT_SECTION (decl
) = 1;
1537 /* Output the alignment of this data. */
1538 if (align
> BITS_PER_UNIT
)
1540 ASM_OUTPUT_ALIGN (asm_out_file
,
1541 floor_log2 (DECL_ALIGN (decl
) / BITS_PER_UNIT
));
1544 /* Do any machine/system dependent processing of the object. */
1545 #ifdef ASM_DECLARE_OBJECT_NAME
1546 last_assemble_variable_decl
= decl
;
1547 ASM_DECLARE_OBJECT_NAME (asm_out_file
, name
, decl
);
1549 /* Standard thing is just output label for the object. */
1550 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1551 #endif /* ASM_DECLARE_OBJECT_NAME */
1553 if (!dont_output_data
)
1555 if (DECL_INITIAL (decl
) && DECL_INITIAL (decl
) != error_mark_node
)
1556 /* Output the actual data. */
1557 output_constant (DECL_INITIAL (decl
),
1558 tree_low_cst (DECL_SIZE_UNIT (decl
), 1),
1561 /* Leave space for it. */
1562 assemble_zeros (tree_low_cst (DECL_SIZE_UNIT (decl
), 1));
1566 /* Return 1 if type TYPE contains any pointers. */
1569 contains_pointers_p (tree type
)
1571 switch (TREE_CODE (type
))
1574 case REFERENCE_TYPE
:
1575 /* I'm not sure whether OFFSET_TYPE needs this treatment,
1576 so I'll play safe and return 1. */
1582 case QUAL_UNION_TYPE
:
1585 /* For a type that has fields, see if the fields have pointers. */
1586 for (fields
= TYPE_FIELDS (type
); fields
; fields
= TREE_CHAIN (fields
))
1587 if (TREE_CODE (fields
) == FIELD_DECL
1588 && contains_pointers_p (TREE_TYPE (fields
)))
1594 /* An array type contains pointers if its element type does. */
1595 return contains_pointers_p (TREE_TYPE (type
));
1602 /* Output something to declare an external symbol to the assembler.
1603 (Most assemblers don't need this, so we normally output nothing.)
1604 Do nothing if DECL is not external. */
1607 assemble_external (tree decl ATTRIBUTE_UNUSED
)
1609 /* Because most platforms do not define ASM_OUTPUT_EXTERNAL, the
1610 main body of this code is only rarely exercised. To provide some
1611 testing, on all platforms, we make sure that the ASM_OUT_FILE is
1612 open. If it's not, we should not be calling this function. */
1616 #ifdef ASM_OUTPUT_EXTERNAL
1617 if (DECL_P (decl
) && DECL_EXTERNAL (decl
) && TREE_PUBLIC (decl
))
1619 rtx rtl
= DECL_RTL (decl
);
1621 if (GET_CODE (rtl
) == MEM
&& GET_CODE (XEXP (rtl
, 0)) == SYMBOL_REF
1622 && ! SYMBOL_REF_USED (XEXP (rtl
, 0)))
1624 /* Some systems do require some output. */
1625 SYMBOL_REF_USED (XEXP (rtl
, 0)) = 1;
1626 ASM_OUTPUT_EXTERNAL (asm_out_file
, decl
, XSTR (XEXP (rtl
, 0), 0));
1632 /* Similar, for calling a library function FUN. */
1635 assemble_external_libcall (rtx fun
)
1637 /* Declare library function name external when first used, if nec. */
1638 if (! SYMBOL_REF_USED (fun
))
1640 SYMBOL_REF_USED (fun
) = 1;
1641 (*targetm
.asm_out
.external_libcall
) (fun
);
1645 /* Assemble a label named NAME. */
1648 assemble_label (const char *name
)
1650 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1653 /* Set the symbol_referenced flag for ID and notify callgraph code. */
1655 mark_referenced (tree id
)
1657 if (!TREE_SYMBOL_REFERENCED (id
))
1659 struct cgraph_node
*node
;
1660 struct cgraph_varpool_node
*vnode
;
1662 if (!cgraph_global_info_ready
)
1664 node
= cgraph_node_for_identifier (id
);
1666 cgraph_mark_needed_node (node
);
1669 vnode
= cgraph_varpool_node_for_identifier (id
);
1671 cgraph_varpool_mark_needed_node (vnode
);
1673 TREE_SYMBOL_REFERENCED (id
) = 1;
1676 /* Output to FILE a reference to the assembler name of a C-level name NAME.
1677 If NAME starts with a *, the rest of NAME is output verbatim.
1678 Otherwise NAME is transformed in an implementation-defined way
1679 (usually by the addition of an underscore).
1680 Many macros in the tm file are defined to call this function. */
1683 assemble_name (FILE *file
, const char *name
)
1685 const char *real_name
;
1688 real_name
= (* targetm
.strip_name_encoding
) (name
);
1690 id
= maybe_get_identifier (real_name
);
1692 mark_referenced (id
);
1695 fputs (&name
[1], file
);
1697 ASM_OUTPUT_LABELREF (file
, name
);
1700 /* Allocate SIZE bytes writable static space with a gensym name
1701 and return an RTX to refer to its address. */
1704 assemble_static_space (unsigned HOST_WIDE_INT size
)
1707 const char *namestring
;
1711 if (flag_shared_data
)
1715 ASM_GENERATE_INTERNAL_LABEL (name
, "LF", const_labelno
);
1717 namestring
= ggc_strdup (name
);
1719 x
= gen_rtx_SYMBOL_REF (Pmode
, namestring
);
1720 SYMBOL_REF_FLAGS (x
) = SYMBOL_FLAG_LOCAL
;
1722 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
1723 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file
, NULL_TREE
, name
, size
,
1726 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1727 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file
, name
, size
, BIGGEST_ALIGNMENT
);
1730 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1731 so that each uninitialized object starts on such a boundary. */
1732 /* Variable `rounded' might or might not be used in ASM_OUTPUT_LOCAL. */
1733 unsigned HOST_WIDE_INT rounded ATTRIBUTE_UNUSED
1734 = ((size
+ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1)
1735 / (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1736 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1737 ASM_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
1744 /* Assemble the static constant template for function entry trampolines.
1745 This is done at most once per compilation.
1746 Returns an RTX for the address of the template. */
1748 #ifdef TRAMPOLINE_TEMPLATE
1750 assemble_trampoline_template (void)
1757 /* By default, put trampoline templates in read-only data section. */
1759 #ifdef TRAMPOLINE_SECTION
1760 TRAMPOLINE_SECTION ();
1762 readonly_data_section ();
1765 /* Write the assembler code to define one. */
1766 align
= floor_log2 (TRAMPOLINE_ALIGNMENT
/ BITS_PER_UNIT
);
1769 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1772 (*targetm
.asm_out
.internal_label
) (asm_out_file
, "LTRAMP", 0);
1773 TRAMPOLINE_TEMPLATE (asm_out_file
);
1775 /* Record the rtl to refer to it. */
1776 ASM_GENERATE_INTERNAL_LABEL (label
, "LTRAMP", 0);
1777 name
= ggc_strdup (label
);
1778 symbol
= gen_rtx_SYMBOL_REF (Pmode
, name
);
1779 SYMBOL_REF_FLAGS (symbol
) = SYMBOL_FLAG_LOCAL
;
1785 /* A and B are either alignments or offsets. Return the minimum alignment
1786 that may be assumed after adding the two together. */
1788 static inline unsigned
1789 min_align (unsigned int a
, unsigned int b
)
1791 return (a
| b
) & -(a
| b
);
1794 /* Return the assembler directive for creating a given kind of integer
1795 object. SIZE is the number of bytes in the object and ALIGNED_P
1796 indicates whether it is known to be aligned. Return NULL if the
1797 assembly dialect has no such directive.
1799 The returned string should be printed at the start of a new line and
1800 be followed immediately by the object's initial value. */
1803 integer_asm_op (int size
, int aligned_p
)
1805 struct asm_int_op
*ops
;
1808 ops
= &targetm
.asm_out
.aligned_op
;
1810 ops
= &targetm
.asm_out
.unaligned_op
;
1815 return targetm
.asm_out
.byte_op
;
1829 /* Use directive OP to assemble an integer object X. Print OP at the
1830 start of the line, followed immediately by the value of X. */
1833 assemble_integer_with_op (const char *op
, rtx x
)
1835 fputs (op
, asm_out_file
);
1836 output_addr_const (asm_out_file
, x
);
1837 fputc ('\n', asm_out_file
);
1840 /* The default implementation of the asm_out.integer target hook. */
1843 default_assemble_integer (rtx x ATTRIBUTE_UNUSED
,
1844 unsigned int size ATTRIBUTE_UNUSED
,
1845 int aligned_p ATTRIBUTE_UNUSED
)
1847 const char *op
= integer_asm_op (size
, aligned_p
);
1848 return op
&& (assemble_integer_with_op (op
, x
), true);
1851 /* Assemble the integer constant X into an object of SIZE bytes. ALIGN is
1852 the alignment of the integer in bits. Return 1 if we were able to output
1853 the constant, otherwise 0. If FORCE is nonzero, abort if we can't output
1857 assemble_integer (rtx x
, unsigned int size
, unsigned int align
, int force
)
1861 aligned_p
= (align
>= MIN (size
* BITS_PER_UNIT
, BIGGEST_ALIGNMENT
));
1863 /* See if the target hook can handle this kind of object. */
1864 if ((*targetm
.asm_out
.integer
) (x
, size
, aligned_p
))
1867 /* If the object is a multi-byte one, try splitting it up. Split
1868 it into words it if is multi-word, otherwise split it into bytes. */
1871 enum machine_mode omode
, imode
;
1872 unsigned int subalign
;
1873 unsigned int subsize
, i
;
1875 subsize
= size
> UNITS_PER_WORD
? UNITS_PER_WORD
: 1;
1876 subalign
= MIN (align
, subsize
* BITS_PER_UNIT
);
1877 omode
= mode_for_size (subsize
* BITS_PER_UNIT
, MODE_INT
, 0);
1878 imode
= mode_for_size (size
* BITS_PER_UNIT
, MODE_INT
, 0);
1880 for (i
= 0; i
< size
; i
+= subsize
)
1882 rtx partial
= simplify_subreg (omode
, x
, imode
, i
);
1883 if (!partial
|| !assemble_integer (partial
, subsize
, subalign
, 0))
1889 /* If we've printed some of it, but not all of it, there's no going
1902 assemble_real (REAL_VALUE_TYPE d
, enum machine_mode mode
, unsigned int align
)
1906 int bitsize
, nelts
, nunits
, units_per
;
1908 /* This is hairy. We have a quantity of known bitsize. real_to_target
1909 will put it into an array of *host* longs, 32 bits per element
1910 (even if long is more than 32 bits). We need to determine the
1911 number of array elements that are occupied (nelts) and the number
1912 of *target* min-addressable units that will be occupied in the
1913 object file (nunits). We can assume that BITS_PER_UNIT divides
1914 the mode's bitsize evenly, but we can not assume that 32 does. */
1915 bitsize
= GET_MODE_BITSIZE (mode
);
1916 nunits
= bitsize
/ BITS_PER_UNIT
;
1917 nelts
= CEIL (bitsize
, 32);
1918 units_per
= 32 / BITS_PER_UNIT
;
1920 real_to_target (data
, &d
, mode
);
1922 /* Put out the first word with the specified alignment. */
1923 assemble_integer (GEN_INT (data
[0]), MIN (nunits
, units_per
), align
, 1);
1924 nunits
-= units_per
;
1926 /* Subsequent words need only 32-bit alignment. */
1927 align
= min_align (align
, 32);
1929 for (i
= 1; i
< nelts
; i
++)
1931 assemble_integer (GEN_INT (data
[i
]), MIN (nunits
, units_per
), align
, 1);
1932 nunits
-= units_per
;
1936 /* Given an expression EXP with a constant value,
1937 reduce it to the sum of an assembler symbol and an integer.
1938 Store them both in the structure *VALUE.
1939 Abort if EXP does not reduce. */
1941 struct addr_const
GTY(())
1944 HOST_WIDE_INT offset
;
1948 decode_addr_const (tree exp
, struct addr_const
*value
)
1950 tree target
= TREE_OPERAND (exp
, 0);
1956 if (TREE_CODE (target
) == COMPONENT_REF
1957 && host_integerp (byte_position (TREE_OPERAND (target
, 1)), 0))
1960 offset
+= int_byte_position (TREE_OPERAND (target
, 1));
1961 target
= TREE_OPERAND (target
, 0);
1963 else if (TREE_CODE (target
) == ARRAY_REF
1964 || TREE_CODE (target
) == ARRAY_RANGE_REF
)
1966 offset
+= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (target
)), 1)
1967 * tree_low_cst (TREE_OPERAND (target
, 1), 0));
1968 target
= TREE_OPERAND (target
, 0);
1974 switch (TREE_CODE (target
))
1978 x
= DECL_RTL (target
);
1982 x
= gen_rtx_MEM (FUNCTION_MODE
,
1983 gen_rtx_LABEL_REF (VOIDmode
, force_label_rtx (target
)));
1991 x
= output_constant_def (target
, 1);
1998 if (GET_CODE (x
) != MEM
)
2003 value
->offset
= offset
;
2006 /* We do RTX_UNSPEC + XINT (blah), so nothing can go after RTX_UNSPEC. */
2007 enum kind
{ RTX_UNKNOWN
, RTX_DOUBLE
, RTX_VECTOR
, RTX_INT
, RTX_UNSPEC
};
2008 struct rtx_const
GTY(())
2010 ENUM_BITFIELD(kind
) kind
: 16;
2011 ENUM_BITFIELD(machine_mode
) mode
: 16;
2012 union rtx_const_un
{
2013 REAL_VALUE_TYPE
GTY ((tag ("4"))) du
;
2014 struct rtx_const_u_addr
{
2017 HOST_WIDE_INT offset
;
2018 } GTY ((tag ("1"))) addr
;
2019 struct rtx_const_u_di
{
2022 } GTY ((tag ("0"))) di
;
2024 /* The max vector size we have is 16 wide; two variants for
2025 integral and floating point vectors. */
2026 struct rtx_const_int_vec
{
2029 } GTY ((tag ("2"))) int_vec
[16];
2031 REAL_VALUE_TYPE
GTY ((tag ("3"))) fp_vec
[8];
2033 } GTY ((desc ("%1.kind >= RTX_INT"), descbits ("1"))) un
;
2036 /* Uniquize all constants that appear in memory.
2037 Each constant in memory thus far output is recorded
2038 in `const_hash_table'. */
2040 struct constant_descriptor_tree
GTY(())
2042 /* A MEM for the constant. */
2045 /* The value of the constant. */
2049 static GTY((param_is (struct constant_descriptor_tree
)))
2050 htab_t const_desc_htab
;
2052 static struct constant_descriptor_tree
* build_constant_desc (tree
);
2053 static void maybe_output_constant_def_contents (struct constant_descriptor_tree
*, int);
2055 /* Compute a hash code for a constant expression. */
2058 const_desc_hash (const void *ptr
)
2060 return const_hash_1 (((struct constant_descriptor_tree
*)ptr
)->value
);
2064 const_hash_1 (const tree exp
)
2069 enum tree_code code
= TREE_CODE (exp
);
2071 /* Either set P and LEN to the address and len of something to hash and
2072 exit the switch or return a value. */
2077 p
= (char *) &TREE_INT_CST (exp
);
2078 len
= sizeof TREE_INT_CST (exp
);
2082 return real_hash (TREE_REAL_CST_PTR (exp
));
2085 p
= TREE_STRING_POINTER (exp
);
2086 len
= TREE_STRING_LENGTH (exp
);
2089 return (const_hash_1 (TREE_REALPART (exp
)) * 5
2090 + const_hash_1 (TREE_IMAGPART (exp
)));
2093 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2097 len
= int_size_in_bytes (TREE_TYPE (exp
));
2099 get_set_constructor_bytes (exp
, (unsigned char *) tmp
, len
);
2107 hi
= 5 + int_size_in_bytes (TREE_TYPE (exp
));
2109 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2110 if (TREE_VALUE (link
))
2111 hi
= hi
* 603 + const_hash_1 (TREE_VALUE (link
));
2119 struct addr_const value
;
2121 decode_addr_const (exp
, &value
);
2122 if (GET_CODE (value
.base
) == SYMBOL_REF
)
2124 /* Don't hash the address of the SYMBOL_REF;
2125 only use the offset and the symbol name. */
2127 p
= XSTR (value
.base
, 0);
2128 for (i
= 0; p
[i
] != 0; i
++)
2129 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2131 else if (GET_CODE (value
.base
) == LABEL_REF
)
2132 hi
= value
.offset
+ CODE_LABEL_NUMBER (XEXP (value
.base
, 0)) * 13;
2140 return (const_hash_1 (TREE_OPERAND (exp
, 0)) * 9
2141 + const_hash_1 (TREE_OPERAND (exp
, 1)));
2145 case NON_LVALUE_EXPR
:
2146 return const_hash_1 (TREE_OPERAND (exp
, 0)) * 7 + 2;
2149 /* A language specific constant. Just hash the code. */
2153 /* Compute hashing function. */
2155 for (i
= 0; i
< len
; i
++)
2156 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2161 /* Wrapper of compare_constant, for the htab interface. */
2163 const_desc_eq (const void *p1
, const void *p2
)
2165 return compare_constant (((struct constant_descriptor_tree
*)p1
)->value
,
2166 ((struct constant_descriptor_tree
*)p2
)->value
);
2169 /* Compare t1 and t2, and return 1 only if they are known to result in
2170 the same bit pattern on output. */
2173 compare_constant (const tree t1
, const tree t2
)
2175 enum tree_code typecode
;
2177 if (t1
== NULL_TREE
)
2178 return t2
== NULL_TREE
;
2179 if (t2
== NULL_TREE
)
2182 if (TREE_CODE (t1
) != TREE_CODE (t2
))
2185 switch (TREE_CODE (t1
))
2188 /* Integer constants are the same only if the same width of type. */
2189 if (TYPE_PRECISION (TREE_TYPE (t1
)) != TYPE_PRECISION (TREE_TYPE (t2
)))
2191 return tree_int_cst_equal (t1
, t2
);
2194 /* Real constants are the same only if the same width of type. */
2195 if (TYPE_PRECISION (TREE_TYPE (t1
)) != TYPE_PRECISION (TREE_TYPE (t2
)))
2198 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
2201 if (flag_writable_strings
)
2204 if (TYPE_MODE (TREE_TYPE (t1
)) != TYPE_MODE (TREE_TYPE (t2
)))
2207 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
2208 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
2209 TREE_STRING_LENGTH (t1
)));
2212 return (compare_constant (TREE_REALPART (t1
), TREE_REALPART (t2
))
2213 && compare_constant (TREE_IMAGPART (t1
), TREE_IMAGPART (t2
)));
2216 typecode
= TREE_CODE (TREE_TYPE (t1
));
2217 if (typecode
!= TREE_CODE (TREE_TYPE (t2
)))
2220 if (typecode
== SET_TYPE
)
2222 int len
= int_size_in_bytes (TREE_TYPE (t2
));
2223 unsigned char *tmp1
, *tmp2
;
2225 if (int_size_in_bytes (TREE_TYPE (t1
)) != len
)
2228 tmp1
= alloca (len
);
2229 tmp2
= alloca (len
);
2231 if (get_set_constructor_bytes (t1
, tmp1
, len
) != NULL_TREE
)
2233 if (get_set_constructor_bytes (t2
, tmp2
, len
) != NULL_TREE
)
2236 return memcmp (tmp1
, tmp2
, len
) == 0;
2242 if (typecode
== ARRAY_TYPE
)
2244 HOST_WIDE_INT size_1
= int_size_in_bytes (TREE_TYPE (t1
));
2245 /* For arrays, check that the sizes all match. */
2246 if (TYPE_MODE (TREE_TYPE (t1
)) != TYPE_MODE (TREE_TYPE (t2
))
2248 || size_1
!= int_size_in_bytes (TREE_TYPE (t2
)))
2253 /* For record and union constructors, require exact type
2255 if (TREE_TYPE (t1
) != TREE_TYPE (t2
))
2259 for (l1
= CONSTRUCTOR_ELTS (t1
), l2
= CONSTRUCTOR_ELTS (t2
);
2261 l1
= TREE_CHAIN (l1
), l2
= TREE_CHAIN (l2
))
2263 /* Check that each value is the same... */
2264 if (! compare_constant (TREE_VALUE (l1
), TREE_VALUE (l2
)))
2266 /* ... and that they apply to the same fields! */
2267 if (typecode
== ARRAY_TYPE
)
2269 if (! compare_constant (TREE_PURPOSE (l1
),
2275 if (TREE_PURPOSE (l1
) != TREE_PURPOSE (l2
))
2280 return l1
== NULL_TREE
&& l2
== NULL_TREE
;
2286 struct addr_const value1
, value2
;
2288 decode_addr_const (t1
, &value1
);
2289 decode_addr_const (t2
, &value2
);
2290 return (value1
.offset
== value2
.offset
2291 && strcmp (XSTR (value1
.base
, 0), XSTR (value2
.base
, 0)) == 0);
2297 return (compare_constant (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0))
2298 && compare_constant(TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1)));
2302 case NON_LVALUE_EXPR
:
2303 return compare_constant (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
2308 nt1
= (*lang_hooks
.expand_constant
) (t1
);
2309 nt2
= (*lang_hooks
.expand_constant
) (t2
);
2310 if (nt1
!= t1
|| nt2
!= t2
)
2311 return compare_constant (nt1
, nt2
);
2317 /* Should not get here. */
2321 /* Make a copy of the whole tree structure for a constant. This
2322 handles the same types of nodes that compare_constant handles. */
2325 copy_constant (tree exp
)
2327 switch (TREE_CODE (exp
))
2330 /* For ADDR_EXPR, we do not want to copy the decl whose address
2331 is requested. We do want to copy constants though. */
2332 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, 0))) == 'c')
2333 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2334 copy_constant (TREE_OPERAND (exp
, 0)));
2336 return copy_node (exp
);
2341 return copy_node (exp
);
2344 return build_complex (TREE_TYPE (exp
),
2345 copy_constant (TREE_REALPART (exp
)),
2346 copy_constant (TREE_IMAGPART (exp
)));
2350 return build (TREE_CODE (exp
), TREE_TYPE (exp
),
2351 copy_constant (TREE_OPERAND (exp
, 0)),
2352 copy_constant (TREE_OPERAND (exp
, 1)));
2356 case NON_LVALUE_EXPR
:
2357 case VIEW_CONVERT_EXPR
:
2358 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2359 copy_constant (TREE_OPERAND (exp
, 0)));
2363 tree copy
= copy_node (exp
);
2364 tree list
= copy_list (CONSTRUCTOR_ELTS (exp
));
2367 CONSTRUCTOR_ELTS (copy
) = list
;
2368 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
2369 TREE_VALUE (tail
) = copy_constant (TREE_VALUE (tail
));
2370 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2371 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
2372 TREE_PURPOSE (tail
) = copy_constant (TREE_PURPOSE (tail
));
2380 t
= (*lang_hooks
.expand_constant
) (exp
);
2382 return copy_constant (t
);
2389 /* Subroutine of output_constant_def:
2390 No constant equal to EXP is known to have been output.
2391 Make a constant descriptor to enter EXP in the hash table.
2392 Assign the label number and construct RTL to refer to the
2393 constant's location in memory.
2394 Caller is responsible for updating the hash table. */
2396 static struct constant_descriptor_tree
*
2397 build_constant_desc (tree exp
)
2403 struct constant_descriptor_tree
*desc
;
2405 desc
= ggc_alloc (sizeof (*desc
));
2406 desc
->value
= copy_constant (exp
);
2408 /* Create a string containing the label name, in LABEL. */
2409 labelno
= const_labelno
++;
2410 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", labelno
);
2412 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
2413 symbol
= gen_rtx_SYMBOL_REF (Pmode
, ggc_strdup (label
));
2414 SYMBOL_REF_FLAGS (symbol
) = SYMBOL_FLAG_LOCAL
;
2415 SYMBOL_REF_DECL (symbol
) = desc
->value
;
2416 TREE_CONSTANT_POOL_ADDRESS_P (symbol
) = 1;
2418 rtl
= gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp
)), symbol
);
2419 set_mem_attributes (rtl
, exp
, 1);
2420 set_mem_alias_set (rtl
, 0);
2421 set_mem_alias_set (rtl
, const_alias_set
);
2423 /* Set flags or add text to the name to record information, such as
2424 that it is a local symbol. If the name is changed, the macro
2425 ASM_OUTPUT_LABELREF will have to know how to strip this
2426 information. This call might invalidate our local variable
2427 SYMBOL; we can't use it afterward. */
2429 (*targetm
.encode_section_info
) (exp
, rtl
, true);
2436 /* Return an rtx representing a reference to constant data in memory
2437 for the constant expression EXP.
2439 If assembler code for such a constant has already been output,
2440 return an rtx to refer to it.
2441 Otherwise, output such a constant in memory
2442 and generate an rtx for it.
2444 If DEFER is nonzero, this constant can be deferred and output only
2445 if referenced in the function after all optimizations.
2447 The const_hash_table records which constants already have label strings. */
2450 output_constant_def (tree exp
, int defer
)
2452 struct constant_descriptor_tree
*desc
;
2453 struct constant_descriptor_tree key
;
2456 /* Look up EXP in the table of constant descriptors. If we didn't find
2457 it, create a new one. */
2459 loc
= htab_find_slot (const_desc_htab
, &key
, INSERT
);
2464 desc
= build_constant_desc (exp
);
2468 maybe_output_constant_def_contents (desc
, defer
);
2472 /* Subroutine of output_constant_def: Decide whether or not we need to
2473 output the constant DESC now, and if so, do it. */
2475 maybe_output_constant_def_contents (struct constant_descriptor_tree
*desc
,
2478 rtx symbol
= XEXP (desc
->rtl
, 0);
2479 tree exp
= desc
->value
;
2481 if (flag_syntax_only
)
2484 if (TREE_ASM_WRITTEN (exp
))
2485 /* Already output; don't do it again. */
2488 /* The only constants that cannot safely be deferred, assuming the
2489 context allows it, are strings under flag_writable_strings. */
2490 if (defer
&& (TREE_CODE (exp
) != STRING_CST
|| !flag_writable_strings
))
2492 /* Increment n_deferred_constants if it exists. It needs to be at
2493 least as large as the number of constants actually referred to
2494 by the function. If it's too small we'll stop looking too early
2495 and fail to emit constants; if it's too large we'll only look
2496 through the entire function when we could have stopped earlier. */
2498 n_deferred_constants
++;
2502 output_constant_def_contents (symbol
);
2505 /* We must output the constant data referred to by SYMBOL; do so. */
2508 output_constant_def_contents (rtx symbol
)
2510 tree exp
= SYMBOL_REF_DECL (symbol
);
2511 const char *label
= XSTR (symbol
, 0);
2514 /* Make sure any other constants whose addresses appear in EXP
2515 are assigned label numbers. */
2516 int reloc
= compute_reloc_for_constant (exp
);
2518 /* Align the location counter as required by EXP's data type. */
2519 int align
= TYPE_ALIGN (TREE_TYPE (exp
));
2520 #ifdef CONSTANT_ALIGNMENT
2521 align
= CONSTANT_ALIGNMENT (exp
, align
);
2524 output_addressed_constants (exp
);
2526 /* We are no longer deferring this constant. */
2527 TREE_ASM_WRITTEN (exp
) = 1;
2529 if (IN_NAMED_SECTION (exp
))
2530 named_section (exp
, NULL
, reloc
);
2532 (*targetm
.asm_out
.select_section
) (exp
, reloc
, align
);
2534 if (align
> BITS_PER_UNIT
)
2536 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
2539 size
= int_size_in_bytes (TREE_TYPE (exp
));
2540 if (TREE_CODE (exp
) == STRING_CST
)
2541 size
= MAX (TREE_STRING_LENGTH (exp
), size
);
2543 /* Do any machine/system dependent processing of the constant. */
2544 #ifdef ASM_DECLARE_CONSTANT_NAME
2545 ASM_DECLARE_CONSTANT_NAME (asm_out_file
, label
, exp
, size
);
2547 /* Standard thing is just output label for the constant. */
2548 ASM_OUTPUT_LABEL (asm_out_file
, label
);
2549 #endif /* ASM_DECLARE_CONSTANT_NAME */
2551 /* Output the value of EXP. */
2552 output_constant (exp
, size
, align
);
2555 /* A constant which was deferred in its original location has been
2556 inserted by the RTL inliner into a different function. The
2557 current function's deferred constant count must be incremented. */
2559 notice_rtl_inlining_of_deferred_constant (void)
2561 n_deferred_constants
++;
2564 /* Look up EXP in the table of constant descriptors. Return the rtl
2565 if it has been emitted, else null. */
2568 lookup_constant_def (tree exp
)
2570 struct constant_descriptor_tree
*desc
;
2571 struct constant_descriptor_tree key
;
2574 desc
= htab_find (const_desc_htab
, &key
);
2576 return (desc
? desc
->rtl
: NULL_RTX
);
2579 /* Used in the hash tables to avoid outputting the same constant
2580 twice. Unlike 'struct constant_descriptor_tree', RTX constants
2581 are output once per function, not once per file; there seems
2582 to be no reason for the difference. */
2584 struct constant_descriptor_rtx
GTY(())
2586 /* More constant_descriptors with the same hash code. */
2587 struct constant_descriptor_rtx
*next
;
2589 /* A MEM for the constant. */
2592 /* The value of the constant. */
2593 struct rtx_const value
;
2596 /* Structure to represent sufficient information about a constant so that
2597 it can be output when the constant pool is output, so that function
2598 integration can be done, and to simplify handling on machines that reference
2599 constant pool as base+displacement. */
2601 struct pool_constant
GTY(())
2603 struct constant_descriptor_rtx
*desc
;
2604 struct pool_constant
*next
;
2605 struct pool_constant
*next_sym
;
2607 enum machine_mode mode
;
2610 HOST_WIDE_INT offset
;
2614 /* Hash code for a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true.
2615 The argument is XSTR (... , 0) */
2617 #define SYMHASH(LABEL) (((unsigned long) (LABEL)) % MAX_RTX_HASH_TABLE)
2619 /* Initialize constant pool hashing for a new function. */
2622 init_varasm_status (struct function
*f
)
2624 struct varasm_status
*p
;
2625 p
= ggc_alloc (sizeof (struct varasm_status
));
2627 p
->x_const_rtx_hash_table
2628 = ggc_alloc_cleared (MAX_RTX_HASH_TABLE
2629 * sizeof (struct constant_descriptor_rtx
*));
2630 p
->x_const_rtx_sym_hash_table
2631 = ggc_alloc_cleared (MAX_RTX_HASH_TABLE
2632 * sizeof (struct pool_constant
*));
2634 p
->x_first_pool
= p
->x_last_pool
= 0;
2635 p
->x_pool_offset
= 0;
2636 p
->deferred_constants
= 0;
2640 /* Express an rtx for a constant integer (perhaps symbolic)
2641 as the sum of a symbol or label plus an explicit integer.
2642 They are stored into VALUE. */
2645 decode_rtx_const (enum machine_mode mode
, rtx x
, struct rtx_const
*value
)
2647 /* Clear the whole structure, including any gaps. */
2648 memset (value
, 0, sizeof (struct rtx_const
));
2650 value
->kind
= RTX_INT
; /* Most usual kind. */
2653 switch (GET_CODE (x
))
2656 value
->kind
= RTX_DOUBLE
;
2657 if (GET_MODE (x
) != VOIDmode
)
2659 const REAL_VALUE_TYPE
*r
= CONST_DOUBLE_REAL_VALUE (x
);
2661 value
->mode
= GET_MODE (x
);
2663 /* Copy the REAL_VALUE_TYPE by members so that we don't
2664 copy garbage from the original structure into our
2665 carefully cleaned hashing structure. */
2666 value
->un
.du
.class = r
->class;
2667 value
->un
.du
.sign
= r
->sign
;
2674 value
->un
.du
.exp
= r
->exp
;
2677 memcpy (value
->un
.du
.sig
, r
->sig
, sizeof (r
->sig
));
2685 value
->un
.di
.low
= CONST_DOUBLE_LOW (x
);
2686 value
->un
.di
.high
= CONST_DOUBLE_HIGH (x
);
2694 units
= CONST_VECTOR_NUNITS (x
);
2695 value
->kind
= RTX_VECTOR
;
2698 if (GET_MODE_CLASS (mode
) == MODE_VECTOR_INT
)
2700 for (i
= 0; i
< units
; ++i
)
2702 rtx elt
= CONST_VECTOR_ELT (x
, i
);
2703 if (GET_CODE (elt
) == CONST_INT
)
2705 value
->un
.int_vec
[i
].low
= INTVAL (elt
);
2706 value
->un
.int_vec
[i
].high
= 0;
2710 value
->un
.int_vec
[i
].low
= CONST_DOUBLE_LOW (elt
);
2711 value
->un
.int_vec
[i
].high
= CONST_DOUBLE_HIGH (elt
);
2715 else if (GET_MODE_CLASS (mode
) == MODE_VECTOR_FLOAT
)
2717 for (i
= 0; i
< units
; ++i
)
2719 const REAL_VALUE_TYPE
*r
2720 = CONST_DOUBLE_REAL_VALUE (CONST_VECTOR_ELT (x
, i
));
2721 REAL_VALUE_TYPE
*d
= &value
->un
.fp_vec
[i
];
2723 /* Copy the REAL_VALUE_TYPE by members so that we don't
2724 copy garbage from the original structure into our
2725 carefully cleaned hashing structure. */
2726 d
->class = r
->class;
2737 memcpy (d
->sig
, r
->sig
, sizeof (r
->sig
));
2750 value
->un
.addr
.offset
= INTVAL (x
);
2756 value
->un
.addr
.base
= x
;
2761 if (GET_CODE (x
) == PLUS
&& GET_CODE (XEXP (x
, 1)) == CONST_INT
)
2763 value
->un
.addr
.base
= XEXP (x
, 0);
2764 value
->un
.addr
.offset
= INTVAL (XEXP (x
, 1));
2766 else if (GET_CODE (x
) == MINUS
&& GET_CODE (XEXP (x
, 1)) == CONST_INT
)
2768 value
->un
.addr
.base
= XEXP (x
, 0);
2769 value
->un
.addr
.offset
= - INTVAL (XEXP (x
, 1));
2773 value
->un
.addr
.base
= x
;
2774 value
->un
.addr
.offset
= 0;
2779 value
->kind
= RTX_UNKNOWN
;
2783 if (value
->kind
== RTX_INT
&& value
->un
.addr
.base
!= 0
2784 && GET_CODE (value
->un
.addr
.base
) == UNSPEC
)
2786 /* For a simple UNSPEC, the base is set to the
2787 operand, the kind field is set to the index of
2788 the unspec expression.
2789 Together with the code below, in case that
2790 the operand is a SYMBOL_REF or LABEL_REF,
2791 the address of the string or the code_label
2792 is taken as base. */
2793 if (XVECLEN (value
->un
.addr
.base
, 0) == 1)
2795 value
->kind
= RTX_UNSPEC
+ XINT (value
->un
.addr
.base
, 1);
2796 value
->un
.addr
.base
= XVECEXP (value
->un
.addr
.base
, 0, 0);
2800 if (value
->kind
>= RTX_INT
&& value
->un
.addr
.base
!= 0)
2801 switch (GET_CODE (value
->un
.addr
.base
))
2804 /* Use the string's address, not the SYMBOL_REF's address,
2805 for the sake of addresses of library routines. */
2806 value
->un
.addr
.symbol
= XSTR (value
->un
.addr
.base
, 0);
2807 value
->un
.addr
.base
= NULL_RTX
;
2811 /* For a LABEL_REF, compare labels. */
2812 value
->un
.addr
.base
= XEXP (value
->un
.addr
.base
, 0);
2819 /* Given a MINUS expression, simplify it if both sides
2820 include the same symbol. */
2823 simplify_subtraction (rtx x
)
2825 struct rtx_const val0
, val1
;
2827 decode_rtx_const (GET_MODE (x
), XEXP (x
, 0), &val0
);
2828 decode_rtx_const (GET_MODE (x
), XEXP (x
, 1), &val1
);
2830 if (val0
.kind
>= RTX_INT
2831 && val0
.kind
== val1
.kind
2832 && val0
.un
.addr
.base
== val1
.un
.addr
.base
2833 && val0
.un
.addr
.symbol
== val1
.un
.addr
.symbol
)
2834 return GEN_INT (val0
.un
.addr
.offset
- val1
.un
.addr
.offset
);
2839 /* Compute a hash code for a constant RTL expression. */
2842 const_hash_rtx (enum machine_mode mode
, rtx x
)
2845 struct rtx_const value
;
2846 unsigned int data
[sizeof(struct rtx_const
) / sizeof (unsigned int)];
2852 decode_rtx_const (mode
, x
, &u
.value
);
2854 /* Compute hashing function. */
2856 for (i
= 0; i
< ARRAY_SIZE (u
.data
); i
++)
2857 hi
= hi
* 613 + u
.data
[i
];
2859 return hi
% MAX_RTX_HASH_TABLE
;
2862 /* Compare a constant rtl object X with a constant-descriptor DESC.
2863 Return 1 if DESC describes a constant with the same value as X. */
2866 compare_constant_rtx (enum machine_mode mode
, rtx x
,
2867 struct constant_descriptor_rtx
*desc
)
2869 struct rtx_const value
;
2871 decode_rtx_const (mode
, x
, &value
);
2873 /* Compare constant contents. */
2874 return memcmp (&value
, &desc
->value
, sizeof (struct rtx_const
)) == 0;
2877 /* Construct a constant descriptor for the rtl-expression X.
2878 It is up to the caller to enter the descriptor in the hash table. */
2880 static struct constant_descriptor_rtx
*
2881 record_constant_rtx (enum machine_mode mode
, rtx x
)
2883 struct constant_descriptor_rtx
*ptr
;
2885 ptr
= ggc_alloc (sizeof (*ptr
));
2886 decode_rtx_const (mode
, x
, &ptr
->value
);
2891 /* Given a constant rtx X, make (or find) a memory constant for its value
2892 and return a MEM rtx to refer to it in memory. */
2895 force_const_mem (enum machine_mode mode
, rtx x
)
2898 struct constant_descriptor_rtx
*desc
;
2901 struct pool_constant
*pool
;
2904 /* If we're not allowed to drop X into the constant pool, don't. */
2905 if ((*targetm
.cannot_force_const_mem
) (x
))
2908 /* Compute hash code of X. Search the descriptors for that hash code
2909 to see if any of them describes X. If yes, we have an rtx to use. */
2910 hash
= const_hash_rtx (mode
, x
);
2911 for (desc
= const_rtx_hash_table
[hash
]; desc
; desc
= desc
->next
)
2912 if (compare_constant_rtx (mode
, x
, desc
))
2915 /* No constant equal to X is known to have been output.
2916 Make a constant descriptor to enter X in the hash table
2917 and make a MEM for it. */
2918 desc
= record_constant_rtx (mode
, x
);
2919 desc
->next
= const_rtx_hash_table
[hash
];
2920 const_rtx_hash_table
[hash
] = desc
;
2922 /* Align the location counter as required by EXP's data type. */
2923 align
= GET_MODE_ALIGNMENT (mode
== VOIDmode
? word_mode
: mode
);
2924 #ifdef CONSTANT_ALIGNMENT
2926 tree type
= (*lang_hooks
.types
.type_for_mode
) (mode
, 0);
2927 if (type
!= NULL_TREE
)
2928 align
= CONSTANT_ALIGNMENT (make_tree (type
, x
), align
);
2932 pool_offset
+= (align
/ BITS_PER_UNIT
) - 1;
2933 pool_offset
&= ~ ((align
/ BITS_PER_UNIT
) - 1);
2935 if (GET_CODE (x
) == LABEL_REF
)
2936 LABEL_PRESERVE_P (XEXP (x
, 0)) = 1;
2938 /* Allocate a pool constant descriptor, fill it in, and chain it in. */
2939 pool
= ggc_alloc (sizeof (struct pool_constant
));
2943 pool
->labelno
= const_labelno
;
2944 pool
->align
= align
;
2945 pool
->offset
= pool_offset
;
2952 last_pool
->next
= pool
;
2955 pool_offset
+= GET_MODE_SIZE (mode
);
2957 /* Create a string containing the label name, in LABEL. */
2958 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
2962 /* Construct the SYMBOL_REF and the MEM. */
2964 symbol
= gen_rtx_SYMBOL_REF (Pmode
, ggc_strdup (label
));
2965 SYMBOL_REF_FLAGS (symbol
) = SYMBOL_FLAG_LOCAL
;
2967 pool
->desc
->rtl
= def
= gen_rtx_MEM (mode
, symbol
);
2968 set_mem_attributes (def
, (*lang_hooks
.types
.type_for_mode
) (mode
, 0), 1);
2969 RTX_UNCHANGING_P (def
) = 1;
2971 /* Add label to symbol hash table. */
2972 hash
= SYMHASH (XSTR (symbol
, 0));
2973 pool
->next_sym
= const_rtx_sym_hash_table
[hash
];
2974 const_rtx_sym_hash_table
[hash
] = pool
;
2976 /* Mark the symbol_ref as belonging to this constants pool. */
2977 CONSTANT_POOL_ADDRESS_P (symbol
) = 1;
2978 SYMBOL_REF_FLAGS (symbol
) = SYMBOL_FLAG_LOCAL
;
2979 current_function_uses_const_pool
= 1;
2984 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
2985 the corresponding pool_constant structure. */
2987 static struct pool_constant
*
2988 find_pool_constant (struct function
*f
, rtx addr
)
2990 struct pool_constant
*pool
;
2991 const char *label
= XSTR (addr
, 0);
2993 for (pool
= f
->varasm
->x_const_rtx_sym_hash_table
[SYMHASH (label
)]; pool
;
2994 pool
= pool
->next_sym
)
2995 if (XSTR (XEXP (pool
->desc
->rtl
, 0), 0) == label
)
3001 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
3004 get_pool_constant (rtx addr
)
3006 return (find_pool_constant (cfun
, addr
))->constant
;
3009 /* Given a constant pool SYMBOL_REF, return the corresponding constant
3010 and whether it has been output or not. */
3013 get_pool_constant_mark (rtx addr
, bool *pmarked
)
3015 struct pool_constant
*pool
= find_pool_constant (cfun
, addr
);
3016 *pmarked
= (pool
->mark
!= 0);
3017 return pool
->constant
;
3020 /* Likewise, but for the constant pool of a specific function. */
3023 get_pool_constant_for_function (struct function
*f
, rtx addr
)
3025 return (find_pool_constant (f
, addr
))->constant
;
3028 /* Similar, return the mode. */
3031 get_pool_mode (rtx addr
)
3033 return (find_pool_constant (cfun
, addr
))->mode
;
3037 get_pool_mode_for_function (struct function
*f
, rtx addr
)
3039 return (find_pool_constant (f
, addr
))->mode
;
3042 /* Similar, return the offset in the constant pool. */
3045 get_pool_offset (rtx addr
)
3047 return (find_pool_constant (cfun
, addr
))->offset
;
3050 /* Return the size of the constant pool. */
3053 get_pool_size (void)
3058 /* Write all the constants in the constant pool. */
3061 output_constant_pool (const char *fnname ATTRIBUTE_UNUSED
,
3062 tree fndecl ATTRIBUTE_UNUSED
)
3064 struct pool_constant
*pool
;
3068 /* It is possible for gcc to call force_const_mem and then to later
3069 discard the instructions which refer to the constant. In such a
3070 case we do not need to output the constant. */
3071 mark_constant_pool ();
3073 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3074 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3077 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3086 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3087 whose CODE_LABEL has been deleted. This can occur if a jump table
3088 is eliminated by optimization. If so, write a constant of zero
3089 instead. Note that this can also happen by turning the
3090 CODE_LABEL into a NOTE. */
3091 /* ??? This seems completely and utterly wrong. Certainly it's
3092 not true for NOTE_INSN_DELETED_LABEL, but I disbelieve proper
3093 functioning even with INSN_DELETED_P and friends. */
3096 switch (GET_CODE (x
))
3099 if (GET_CODE (XEXP (x
, 0)) != PLUS
3100 || GET_CODE (XEXP (XEXP (x
, 0), 0)) != LABEL_REF
)
3102 tmp
= XEXP (XEXP (x
, 0), 0);
3107 if (INSN_DELETED_P (tmp
)
3108 || (GET_CODE (tmp
) == NOTE
3109 && NOTE_LINE_NUMBER (tmp
) == NOTE_INSN_DELETED
))
3120 /* First switch to correct section. */
3121 (*targetm
.asm_out
.select_rtx_section
) (pool
->mode
, x
, pool
->align
);
3123 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3124 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file
, x
, pool
->mode
,
3125 pool
->align
, pool
->labelno
, done
);
3128 assemble_align (pool
->align
);
3130 /* Output the label. */
3131 (*targetm
.asm_out
.internal_label
) (asm_out_file
, "LC", pool
->labelno
);
3133 /* Output the value of the constant itself. */
3134 switch (GET_MODE_CLASS (pool
->mode
))
3137 if (GET_CODE (x
) != CONST_DOUBLE
)
3140 REAL_VALUE_FROM_CONST_DOUBLE (r
, x
);
3141 assemble_real (r
, pool
->mode
, pool
->align
);
3145 case MODE_PARTIAL_INT
:
3146 assemble_integer (x
, GET_MODE_SIZE (pool
->mode
), pool
->align
, 1);
3149 case MODE_VECTOR_FLOAT
:
3154 if (GET_CODE (x
) != CONST_VECTOR
)
3157 units
= CONST_VECTOR_NUNITS (x
);
3159 for (i
= 0; i
< units
; i
++)
3161 elt
= CONST_VECTOR_ELT (x
, i
);
3162 REAL_VALUE_FROM_CONST_DOUBLE (r
, elt
);
3163 assemble_real (r
, GET_MODE_INNER (pool
->mode
), pool
->align
);
3168 case MODE_VECTOR_INT
:
3173 if (GET_CODE (x
) != CONST_VECTOR
)
3176 units
= CONST_VECTOR_NUNITS (x
);
3178 for (i
= 0; i
< units
; i
++)
3180 elt
= CONST_VECTOR_ELT (x
, i
);
3181 assemble_integer (elt
, GET_MODE_UNIT_SIZE (pool
->mode
),
3191 /* Make sure all constants in SECTION_MERGE and not SECTION_STRINGS
3192 sections have proper size. */
3193 if (pool
->align
> GET_MODE_BITSIZE (pool
->mode
)
3194 && in_section
== in_named
3195 && get_named_section_flags (in_named_name
) & SECTION_MERGE
)
3196 assemble_align (pool
->align
);
3198 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3203 #ifdef ASM_OUTPUT_POOL_EPILOGUE
3204 ASM_OUTPUT_POOL_EPILOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3207 /* Done with this pool. */
3208 first_pool
= last_pool
= 0;
3211 /* Look through the instructions for this function, and mark all the
3212 entries in the constant pool which are actually being used. Emit
3213 deferred constants which have indeed been used. */
3216 mark_constant_pool (void)
3220 struct pool_constant
*pool
;
3222 if (first_pool
== 0 && n_deferred_constants
== 0)
3225 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3228 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
3230 mark_constants (PATTERN (insn
));
3232 for (link
= current_function_epilogue_delay_list
;
3234 link
= XEXP (link
, 1))
3236 insn
= XEXP (link
, 0);
3239 mark_constants (PATTERN (insn
));
3243 /* Look through appropriate parts of X, marking all entries in the
3244 constant pool which are actually being used. Entries that are only
3245 referenced by other constants are also marked as used. Emit
3246 deferred strings that are used. */
3249 mark_constants (rtx x
)
3252 const char *format_ptr
;
3257 if (GET_CODE (x
) == SYMBOL_REF
)
3259 mark_constant (&x
, NULL
);
3263 /* Insns may appear inside a SEQUENCE. Only check the patterns of
3264 insns, not any notes that may be attached. We don't want to mark
3265 a constant just because it happens to appear in a REG_EQUIV note. */
3268 mark_constants (PATTERN (x
));
3272 format_ptr
= GET_RTX_FORMAT (GET_CODE (x
));
3274 for (i
= 0; i
< GET_RTX_LENGTH (GET_CODE (x
)); i
++)
3276 switch (*format_ptr
++)
3279 mark_constants (XEXP (x
, i
));
3283 if (XVEC (x
, i
) != 0)
3287 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
3288 mark_constants (XVECEXP (x
, i
, j
));
3308 /* Given a SYMBOL_REF CURRENT_RTX, mark it and all constants it refers
3309 to as used. Emit referenced deferred strings. This function can
3310 be used with for_each_rtx to mark all SYMBOL_REFs in an rtx. */
3313 mark_constant (rtx
*current_rtx
, void *data ATTRIBUTE_UNUSED
)
3315 rtx x
= *current_rtx
;
3320 else if (GET_CODE (x
) == SYMBOL_REF
)
3322 if (CONSTANT_POOL_ADDRESS_P (x
))
3324 struct pool_constant
*pool
= find_pool_constant (cfun
, x
);
3325 if (pool
->mark
== 0)
3328 for_each_rtx (&(pool
->constant
), &mark_constant
, NULL
);
3333 else if (TREE_CONSTANT_POOL_ADDRESS_P (x
))
3335 tree exp
= SYMBOL_REF_DECL (x
);
3336 if (!TREE_ASM_WRITTEN (exp
))
3338 n_deferred_constants
--;
3339 output_constant_def_contents (x
);
3346 /* Determine what kind of relocations EXP may need. */
3349 compute_reloc_for_constant (tree exp
)
3351 int reloc
= 0, reloc2
;
3354 /* Give the front-end a chance to convert VALUE to something that
3355 looks more like a constant to the back-end. */
3356 exp
= (*lang_hooks
.expand_constant
) (exp
);
3358 switch (TREE_CODE (exp
))
3362 /* Go inside any operations that get_inner_reference can handle and see
3363 if what's inside is a constant: no need to do anything here for
3364 addresses of variables or functions. */
3365 for (tem
= TREE_OPERAND (exp
, 0); handled_component_p (tem
);
3366 tem
= TREE_OPERAND (tem
, 0))
3369 if (TREE_PUBLIC (tem
))
3376 reloc
= compute_reloc_for_constant (TREE_OPERAND (exp
, 0));
3377 reloc
|= compute_reloc_for_constant (TREE_OPERAND (exp
, 1));
3381 reloc
= compute_reloc_for_constant (TREE_OPERAND (exp
, 0));
3382 reloc2
= compute_reloc_for_constant (TREE_OPERAND (exp
, 1));
3383 /* The difference of two local labels is computable at link time. */
3384 if (reloc
== 1 && reloc2
== 1)
3392 case NON_LVALUE_EXPR
:
3393 reloc
= compute_reloc_for_constant (TREE_OPERAND (exp
, 0));
3397 for (tem
= CONSTRUCTOR_ELTS (exp
); tem
; tem
= TREE_CHAIN (tem
))
3398 if (TREE_VALUE (tem
) != 0)
3399 reloc
|= compute_reloc_for_constant (TREE_VALUE (tem
));
3409 /* Find all the constants whose addresses are referenced inside of EXP,
3410 and make sure assembler code with a label has been output for each one.
3411 Indicate whether an ADDR_EXPR has been encountered. */
3414 output_addressed_constants (tree exp
)
3418 /* Give the front-end a chance to convert VALUE to something that
3419 looks more like a constant to the back-end. */
3420 exp
= (*lang_hooks
.expand_constant
) (exp
);
3422 switch (TREE_CODE (exp
))
3426 /* Go inside any operations that get_inner_reference can handle and see
3427 if what's inside is a constant: no need to do anything here for
3428 addresses of variables or functions. */
3429 for (tem
= TREE_OPERAND (exp
, 0); handled_component_p (tem
);
3430 tem
= TREE_OPERAND (tem
, 0))
3433 if (TREE_CODE_CLASS (TREE_CODE (tem
)) == 'c'
3434 || TREE_CODE (tem
) == CONSTRUCTOR
)
3435 output_constant_def (tem
, 0);
3440 output_addressed_constants (TREE_OPERAND (exp
, 1));
3445 case NON_LVALUE_EXPR
:
3446 output_addressed_constants (TREE_OPERAND (exp
, 0));
3450 for (tem
= CONSTRUCTOR_ELTS (exp
); tem
; tem
= TREE_CHAIN (tem
))
3451 if (TREE_VALUE (tem
) != 0)
3452 output_addressed_constants (TREE_VALUE (tem
));
3461 /* Return nonzero if VALUE is a valid constant-valued expression
3462 for use in initializing a static variable; one that can be an
3463 element of a "constant" initializer.
3465 Return null_pointer_node if the value is absolute;
3466 if it is relocatable, return the variable that determines the relocation.
3467 We assume that VALUE has been folded as much as possible;
3468 therefore, we do not need to check for such things as
3469 arithmetic-combinations of integers. */
3472 initializer_constant_valid_p (tree value
, tree endtype
)
3474 /* Give the front-end a chance to convert VALUE to something that
3475 looks more like a constant to the back-end. */
3476 value
= (*lang_hooks
.expand_constant
) (value
);
3478 switch (TREE_CODE (value
))
3481 if ((TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
3482 || TREE_CODE (TREE_TYPE (value
)) == RECORD_TYPE
)
3483 && TREE_CONSTANT (value
)
3484 && CONSTRUCTOR_ELTS (value
))
3487 bool absolute
= true;
3489 for (elt
= CONSTRUCTOR_ELTS (value
); elt
; elt
= TREE_CHAIN (elt
))
3492 value
= TREE_VALUE (elt
);
3493 reloc
= initializer_constant_valid_p (value
, TREE_TYPE (value
));
3496 if (reloc
!= null_pointer_node
)
3499 /* For a non-absolute relocation, there is no single
3500 variable that can be "the variable that determines the
3502 return absolute
? null_pointer_node
: error_mark_node
;
3505 return TREE_STATIC (value
) ? null_pointer_node
: NULL_TREE
;
3512 return null_pointer_node
;
3516 return staticp (TREE_OPERAND (value
, 0)) ? TREE_OPERAND (value
, 0) : 0;
3518 case VIEW_CONVERT_EXPR
:
3519 case NON_LVALUE_EXPR
:
3520 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3524 /* Allow conversions between pointer types. */
3525 if (POINTER_TYPE_P (TREE_TYPE (value
))
3526 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3527 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3529 /* Allow conversions between real types. */
3530 if (FLOAT_TYPE_P (TREE_TYPE (value
))
3531 && FLOAT_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3532 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3534 /* Allow length-preserving conversions between integer types. */
3535 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
3536 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
3537 && (TYPE_PRECISION (TREE_TYPE (value
))
3538 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
3539 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3541 /* Allow conversions between other integer types only if
3543 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
3544 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3546 tree inner
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3548 if (inner
== null_pointer_node
)
3549 return null_pointer_node
;
3553 /* Allow (int) &foo provided int is as wide as a pointer. */
3554 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
3555 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
3556 && (TYPE_PRECISION (TREE_TYPE (value
))
3557 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
3558 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3561 /* Likewise conversions from int to pointers, but also allow
3562 conversions from 0. */
3563 if (POINTER_TYPE_P (TREE_TYPE (value
))
3564 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3566 if (integer_zerop (TREE_OPERAND (value
, 0)))
3567 return null_pointer_node
;
3568 else if (TYPE_PRECISION (TREE_TYPE (value
))
3569 <= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0))))
3570 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3574 /* Allow conversions to union types if the value inside is okay. */
3575 if (TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
)
3576 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3581 if (! INTEGRAL_TYPE_P (endtype
)
3582 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
3584 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3586 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
3588 /* If either term is absolute, use the other terms relocation. */
3589 if (valid0
== null_pointer_node
)
3591 if (valid1
== null_pointer_node
)
3597 if (! INTEGRAL_TYPE_P (endtype
)
3598 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
3600 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3602 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
3604 /* Win if second argument is absolute. */
3605 if (valid1
== null_pointer_node
)
3607 /* Win if both arguments have the same relocation.
3608 Then the value is absolute. */
3609 if (valid0
== valid1
&& valid0
!= 0)
3610 return null_pointer_node
;
3612 /* Since GCC guarantees that string constants are unique in the
3613 generated code, a subtraction between two copies of the same
3614 constant string is absolute. */
3615 if (valid0
&& TREE_CODE (valid0
) == STRING_CST
&&
3616 valid1
&& TREE_CODE (valid1
) == STRING_CST
&&
3617 TREE_STRING_POINTER (valid0
) == TREE_STRING_POINTER (valid1
))
3618 return null_pointer_node
;
3621 /* Support differences between labels. */
3622 if (INTEGRAL_TYPE_P (endtype
))
3625 op0
= TREE_OPERAND (value
, 0);
3626 op1
= TREE_OPERAND (value
, 1);
3628 /* Like STRIP_NOPS except allow the operand mode to widen.
3629 This works around a feature of fold that simplifies
3630 (int)(p1 - p2) to ((int)p1 - (int)p2) under the theory
3631 that the narrower operation is cheaper. */
3633 while (TREE_CODE (op0
) == NOP_EXPR
3634 || TREE_CODE (op0
) == CONVERT_EXPR
3635 || TREE_CODE (op0
) == NON_LVALUE_EXPR
)
3637 tree inner
= TREE_OPERAND (op0
, 0);
3638 if (inner
== error_mark_node
3639 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner
)))
3640 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op0
)))
3641 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner
)))))
3646 while (TREE_CODE (op1
) == NOP_EXPR
3647 || TREE_CODE (op1
) == CONVERT_EXPR
3648 || TREE_CODE (op1
) == NON_LVALUE_EXPR
)
3650 tree inner
= TREE_OPERAND (op1
, 0);
3651 if (inner
== error_mark_node
3652 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner
)))
3653 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op1
)))
3654 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner
)))))
3659 if (TREE_CODE (op0
) == ADDR_EXPR
3660 && TREE_CODE (TREE_OPERAND (op0
, 0)) == LABEL_DECL
3661 && TREE_CODE (op1
) == ADDR_EXPR
3662 && TREE_CODE (TREE_OPERAND (op1
, 0)) == LABEL_DECL
)
3663 return null_pointer_node
;
3674 /* Output assembler code for constant EXP to FILE, with no label.
3675 This includes the pseudo-op such as ".int" or ".byte", and a newline.
3676 Assumes output_addressed_constants has been done on EXP already.
3678 Generate exactly SIZE bytes of assembler data, padding at the end
3679 with zeros if necessary. SIZE must always be specified.
3681 SIZE is important for structure constructors,
3682 since trailing members may have been omitted from the constructor.
3683 It is also important for initialization of arrays from string constants
3684 since the full length of the string constant might not be wanted.
3685 It is also needed for initialization of unions, where the initializer's
3686 type is just one member, and that may not be as long as the union.
3688 There a case in which we would fail to output exactly SIZE bytes:
3689 for a structure constructor that wants to produce more than SIZE bytes.
3690 But such constructors will never be generated for any possible input.
3692 ALIGN is the alignment of the data in bits. */
3695 output_constant (tree exp
, unsigned HOST_WIDE_INT size
, unsigned int align
)
3697 enum tree_code code
;
3698 unsigned HOST_WIDE_INT thissize
;
3700 /* Some front-ends use constants other than the standard language-independent
3701 varieties, but which may still be output directly. Give the front-end a
3702 chance to convert EXP to a language-independent representation. */
3703 exp
= (*lang_hooks
.expand_constant
) (exp
);
3705 if (size
== 0 || flag_syntax_only
)
3708 /* Eliminate any conversions since we'll be outputting the underlying
3710 while (TREE_CODE (exp
) == NOP_EXPR
|| TREE_CODE (exp
) == CONVERT_EXPR
3711 || TREE_CODE (exp
) == NON_LVALUE_EXPR
3712 || TREE_CODE (exp
) == VIEW_CONVERT_EXPR
)
3713 exp
= TREE_OPERAND (exp
, 0);
3715 code
= TREE_CODE (TREE_TYPE (exp
));
3716 thissize
= int_size_in_bytes (TREE_TYPE (exp
));
3718 /* Allow a constructor with no elements for any data type.
3719 This means to fill the space with zeros. */
3720 if (TREE_CODE (exp
) == CONSTRUCTOR
&& CONSTRUCTOR_ELTS (exp
) == 0)
3722 assemble_zeros (size
);
3726 if (TREE_CODE (exp
) == FDESC_EXPR
)
3728 #ifdef ASM_OUTPUT_FDESC
3729 HOST_WIDE_INT part
= tree_low_cst (TREE_OPERAND (exp
, 1), 0);
3730 tree decl
= TREE_OPERAND (exp
, 0);
3731 ASM_OUTPUT_FDESC (asm_out_file
, decl
, part
);
3738 /* Now output the underlying data. If we've handling the padding, return.
3739 Otherwise, break and ensure THISSIZE is the size written. */
3747 case REFERENCE_TYPE
:
3749 if (! assemble_integer (expand_expr (exp
, NULL_RTX
, VOIDmode
,
3750 EXPAND_INITIALIZER
),
3752 error ("initializer for integer value is too complicated");
3756 if (TREE_CODE (exp
) != REAL_CST
)
3757 error ("initializer for floating value is not a floating constant");
3759 assemble_real (TREE_REAL_CST (exp
),
3760 mode_for_size (size
* BITS_PER_UNIT
, MODE_FLOAT
, 0),
3765 output_constant (TREE_REALPART (exp
), thissize
/ 2, align
);
3766 output_constant (TREE_IMAGPART (exp
), thissize
/ 2,
3767 min_align (align
, BITS_PER_UNIT
* (thissize
/ 2)));
3772 if (TREE_CODE (exp
) == CONSTRUCTOR
)
3774 output_constructor (exp
, size
, align
);
3777 else if (TREE_CODE (exp
) == STRING_CST
)
3779 thissize
= MIN ((unsigned HOST_WIDE_INT
)TREE_STRING_LENGTH (exp
),
3781 assemble_string (TREE_STRING_POINTER (exp
), thissize
);
3783 else if (TREE_CODE (exp
) == VECTOR_CST
)
3787 unsigned int nalign
;
3788 enum machine_mode inner
;
3790 inner
= GET_MODE_INNER (TYPE_MODE (TREE_TYPE (exp
)));
3791 nalign
= MIN (align
, GET_MODE_ALIGNMENT (inner
));
3793 elt_size
= GET_MODE_UNIT_SIZE (TYPE_MODE (TREE_TYPE (exp
)));
3795 link
= TREE_VECTOR_CST_ELTS (exp
);
3796 output_constant (TREE_VALUE (link
), elt_size
, align
);
3797 while ((link
= TREE_CHAIN (link
)) != NULL
)
3798 output_constant (TREE_VALUE (link
), elt_size
, nalign
);
3806 if (TREE_CODE (exp
) == CONSTRUCTOR
)
3807 output_constructor (exp
, size
, align
);
3813 if (TREE_CODE (exp
) == INTEGER_CST
)
3814 assemble_integer (expand_expr (exp
, NULL_RTX
,
3815 VOIDmode
, EXPAND_INITIALIZER
),
3816 thissize
, align
, 1);
3817 else if (TREE_CODE (exp
) == CONSTRUCTOR
)
3819 unsigned char *buffer
= alloca (thissize
);
3820 if (get_set_constructor_bytes (exp
, buffer
, thissize
))
3822 assemble_string ((char *) buffer
, thissize
);
3825 error ("unknown set constructor type");
3835 if (size
> thissize
)
3836 assemble_zeros (size
- thissize
);
3840 /* Subroutine of output_constructor, used for computing the size of
3841 arrays of unspecified length. VAL must be a CONSTRUCTOR of an array
3842 type with an unspecified upper bound. */
3844 static unsigned HOST_WIDE_INT
3845 array_size_for_constructor (tree val
)
3849 /* This code used to attempt to handle string constants that are not
3850 arrays of single-bytes, but nothing else does, so there's no point in
3852 if (TREE_CODE (val
) == STRING_CST
)
3853 return TREE_STRING_LENGTH (val
);
3855 max_index
= NULL_TREE
;
3856 for (i
= CONSTRUCTOR_ELTS (val
); i
; i
= TREE_CHAIN (i
))
3858 tree index
= TREE_PURPOSE (i
);
3860 if (TREE_CODE (index
) == RANGE_EXPR
)
3861 index
= TREE_OPERAND (index
, 1);
3862 if (max_index
== NULL_TREE
|| tree_int_cst_lt (max_index
, index
))
3866 if (max_index
== NULL_TREE
)
3869 /* Compute the total number of array elements. */
3870 i
= size_binop (MINUS_EXPR
, convert (sizetype
, max_index
),
3872 TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (val
)))));
3873 i
= size_binop (PLUS_EXPR
, i
, convert (sizetype
, integer_one_node
));
3875 /* Multiply by the array element unit size to find number of bytes. */
3876 i
= size_binop (MULT_EXPR
, i
, TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (val
))));
3878 return tree_low_cst (i
, 1);
3881 /* Subroutine of output_constant, used for CONSTRUCTORs (aggregate constants).
3882 Generate at least SIZE bytes, padding if necessary. */
3885 output_constructor (tree exp
, unsigned HOST_WIDE_INT size
,
3888 tree type
= TREE_TYPE (exp
);
3889 tree link
, field
= 0;
3891 /* Number of bytes output or skipped so far.
3892 In other words, current position within the constructor. */
3893 HOST_WIDE_INT total_bytes
= 0;
3894 /* Nonzero means BYTE contains part of a byte, to be output. */
3895 int byte_buffer_in_use
= 0;
3898 if (HOST_BITS_PER_WIDE_INT
< BITS_PER_UNIT
)
3901 if (TREE_CODE (type
) == RECORD_TYPE
)
3902 field
= TYPE_FIELDS (type
);
3904 if (TREE_CODE (type
) == ARRAY_TYPE
3905 && TYPE_DOMAIN (type
) != 0)
3906 min_index
= TYPE_MIN_VALUE (TYPE_DOMAIN (type
));
3908 /* As LINK goes through the elements of the constant,
3909 FIELD goes through the structure fields, if the constant is a structure.
3910 if the constant is a union, then we override this,
3911 by getting the field from the TREE_LIST element.
3912 But the constant could also be an array. Then FIELD is zero.
3914 There is always a maximum of one element in the chain LINK for unions
3915 (even if the initializer in a source program incorrectly contains
3917 for (link
= CONSTRUCTOR_ELTS (exp
);
3919 link
= TREE_CHAIN (link
),
3920 field
= field
? TREE_CHAIN (field
) : 0)
3922 tree val
= TREE_VALUE (link
);
3925 /* The element in a union constructor specifies the proper field
3927 if ((TREE_CODE (type
) == RECORD_TYPE
|| TREE_CODE (type
) == UNION_TYPE
3928 || TREE_CODE (type
) == QUAL_UNION_TYPE
)
3929 && TREE_PURPOSE (link
) != 0)
3930 field
= TREE_PURPOSE (link
);
3932 else if (TREE_CODE (type
) == ARRAY_TYPE
)
3933 index
= TREE_PURPOSE (link
);
3935 #ifdef ASM_COMMENT_START
3936 if (field
&& flag_verbose_asm
)
3937 fprintf (asm_out_file
, "%s %s:\n",
3940 ? IDENTIFIER_POINTER (DECL_NAME (field
))
3944 /* Eliminate the marker that makes a cast not be an lvalue. */
3948 if (index
&& TREE_CODE (index
) == RANGE_EXPR
)
3950 unsigned HOST_WIDE_INT fieldsize
3951 = int_size_in_bytes (TREE_TYPE (type
));
3952 HOST_WIDE_INT lo_index
= tree_low_cst (TREE_OPERAND (index
, 0), 0);
3953 HOST_WIDE_INT hi_index
= tree_low_cst (TREE_OPERAND (index
, 1), 0);
3954 HOST_WIDE_INT index
;
3955 unsigned int align2
= min_align (align
, fieldsize
* BITS_PER_UNIT
);
3957 for (index
= lo_index
; index
<= hi_index
; index
++)
3959 /* Output the element's initial value. */
3961 assemble_zeros (fieldsize
);
3963 output_constant (val
, fieldsize
, align2
);
3965 /* Count its size. */
3966 total_bytes
+= fieldsize
;
3969 else if (field
== 0 || !DECL_BIT_FIELD (field
))
3971 /* An element that is not a bit-field. */
3973 unsigned HOST_WIDE_INT fieldsize
;
3974 /* Since this structure is static,
3975 we know the positions are constant. */
3976 HOST_WIDE_INT pos
= field
? int_byte_position (field
) : 0;
3977 unsigned int align2
;
3980 pos
= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (val
)), 1)
3981 * (tree_low_cst (index
, 0) - tree_low_cst (min_index
, 0)));
3983 /* Output any buffered-up bit-fields preceding this element. */
3984 if (byte_buffer_in_use
)
3986 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
3988 byte_buffer_in_use
= 0;
3991 /* Advance to offset of this element.
3992 Note no alignment needed in an array, since that is guaranteed
3993 if each element has the proper size. */
3994 if ((field
!= 0 || index
!= 0) && pos
!= total_bytes
)
3996 assemble_zeros (pos
- total_bytes
);
4000 /* Find the alignment of this element. */
4001 align2
= min_align (align
, BITS_PER_UNIT
* pos
);
4003 /* Determine size this element should occupy. */
4008 /* If this is an array with an unspecified upper bound,
4009 the initializer determines the size. */
4010 /* ??? This ought to only checked if DECL_SIZE_UNIT is NULL,
4011 but we cannot do this until the deprecated support for
4012 initializing zero-length array members is removed. */
4013 if (TREE_CODE (TREE_TYPE (field
)) == ARRAY_TYPE
4014 && TYPE_DOMAIN (TREE_TYPE (field
))
4015 && ! TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (field
))))
4017 fieldsize
= array_size_for_constructor (val
);
4018 /* Given a non-empty initialization, this field had
4020 if (fieldsize
!= 0 && TREE_CHAIN (field
) != NULL_TREE
)
4023 else if (DECL_SIZE_UNIT (field
))
4025 /* ??? This can't be right. If the decl size overflows
4026 a host integer we will silently emit no data. */
4027 if (host_integerp (DECL_SIZE_UNIT (field
), 1))
4028 fieldsize
= tree_low_cst (DECL_SIZE_UNIT (field
), 1);
4032 fieldsize
= int_size_in_bytes (TREE_TYPE (type
));
4034 /* Output the element's initial value. */
4036 assemble_zeros (fieldsize
);
4038 output_constant (val
, fieldsize
, align2
);
4040 /* Count its size. */
4041 total_bytes
+= fieldsize
;
4043 else if (val
!= 0 && TREE_CODE (val
) != INTEGER_CST
)
4044 error ("invalid initial value for member `%s'",
4045 IDENTIFIER_POINTER (DECL_NAME (field
)));
4048 /* Element that is a bit-field. */
4050 HOST_WIDE_INT next_offset
= int_bit_position (field
);
4051 HOST_WIDE_INT end_offset
4052 = (next_offset
+ tree_low_cst (DECL_SIZE (field
), 1));
4055 val
= integer_zero_node
;
4057 /* If this field does not start in this (or, next) byte,
4059 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4061 /* Output remnant of any bit field in previous bytes. */
4062 if (byte_buffer_in_use
)
4064 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4066 byte_buffer_in_use
= 0;
4069 /* If still not at proper byte, advance to there. */
4070 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4072 assemble_zeros (next_offset
/ BITS_PER_UNIT
- total_bytes
);
4073 total_bytes
= next_offset
/ BITS_PER_UNIT
;
4077 if (! byte_buffer_in_use
)
4080 /* We must split the element into pieces that fall within
4081 separate bytes, and combine each byte with previous or
4082 following bit-fields. */
4084 /* next_offset is the offset n fbits from the beginning of
4085 the structure to the next bit of this element to be processed.
4086 end_offset is the offset of the first bit past the end of
4088 while (next_offset
< end_offset
)
4092 HOST_WIDE_INT value
;
4093 HOST_WIDE_INT next_byte
= next_offset
/ BITS_PER_UNIT
;
4094 HOST_WIDE_INT next_bit
= next_offset
% BITS_PER_UNIT
;
4096 /* Advance from byte to byte
4097 within this element when necessary. */
4098 while (next_byte
!= total_bytes
)
4100 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4105 /* Number of bits we can process at once
4106 (all part of the same byte). */
4107 this_time
= MIN (end_offset
- next_offset
,
4108 BITS_PER_UNIT
- next_bit
);
4109 if (BYTES_BIG_ENDIAN
)
4111 /* On big-endian machine, take the most significant bits
4112 first (of the bits that are significant)
4113 and put them into bytes from the most significant end. */
4114 shift
= end_offset
- next_offset
- this_time
;
4116 /* Don't try to take a bunch of bits that cross
4117 the word boundary in the INTEGER_CST. We can
4118 only select bits from the LOW or HIGH part
4120 if (shift
< HOST_BITS_PER_WIDE_INT
4121 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4123 this_time
= shift
+ this_time
- HOST_BITS_PER_WIDE_INT
;
4124 shift
= HOST_BITS_PER_WIDE_INT
;
4127 /* Now get the bits from the appropriate constant word. */
4128 if (shift
< HOST_BITS_PER_WIDE_INT
)
4129 value
= TREE_INT_CST_LOW (val
);
4130 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4132 value
= TREE_INT_CST_HIGH (val
);
4133 shift
-= HOST_BITS_PER_WIDE_INT
;
4138 /* Get the result. This works only when:
4139 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4140 byte
|= (((value
>> shift
)
4141 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4142 << (BITS_PER_UNIT
- this_time
- next_bit
));
4146 /* On little-endian machines,
4147 take first the least significant bits of the value
4148 and pack them starting at the least significant
4149 bits of the bytes. */
4150 shift
= next_offset
- int_bit_position (field
);
4152 /* Don't try to take a bunch of bits that cross
4153 the word boundary in the INTEGER_CST. We can
4154 only select bits from the LOW or HIGH part
4156 if (shift
< HOST_BITS_PER_WIDE_INT
4157 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4158 this_time
= (HOST_BITS_PER_WIDE_INT
- shift
);
4160 /* Now get the bits from the appropriate constant word. */
4161 if (shift
< HOST_BITS_PER_WIDE_INT
)
4162 value
= TREE_INT_CST_LOW (val
);
4163 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4165 value
= TREE_INT_CST_HIGH (val
);
4166 shift
-= HOST_BITS_PER_WIDE_INT
;
4171 /* Get the result. This works only when:
4172 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4173 byte
|= (((value
>> shift
)
4174 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4178 next_offset
+= this_time
;
4179 byte_buffer_in_use
= 1;
4184 if (byte_buffer_in_use
)
4186 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4190 if ((unsigned HOST_WIDE_INT
)total_bytes
< size
)
4191 assemble_zeros (size
- total_bytes
);
4194 /* This TREE_LIST contains any weak symbol declarations waiting
4196 static GTY(()) tree weak_decls
;
4198 /* Mark DECL as weak. */
4201 mark_weak (tree decl
)
4203 DECL_WEAK (decl
) = 1;
4205 if (DECL_RTL_SET_P (decl
)
4206 && GET_CODE (DECL_RTL (decl
)) == MEM
4207 && XEXP (DECL_RTL (decl
), 0)
4208 && GET_CODE (XEXP (DECL_RTL (decl
), 0)) == SYMBOL_REF
)
4209 SYMBOL_REF_WEAK (XEXP (DECL_RTL (decl
), 0)) = 1;
4212 /* Merge weak status between NEWDECL and OLDDECL. */
4215 merge_weak (tree newdecl
, tree olddecl
)
4217 if (DECL_WEAK (newdecl
) == DECL_WEAK (olddecl
))
4220 if (DECL_WEAK (newdecl
))
4224 /* NEWDECL is weak, but OLDDECL is not. */
4226 /* If we already output the OLDDECL, we're in trouble; we can't
4227 go back and make it weak. This error cannot caught in
4228 declare_weak because the NEWDECL and OLDDECL was not yet
4229 been merged; therefore, TREE_ASM_WRITTEN was not set. */
4230 if (TREE_ASM_WRITTEN (olddecl
))
4231 error ("%Jweak declaration of '%D' must precede definition",
4234 /* If we've already generated rtl referencing OLDDECL, we may
4235 have done so in a way that will not function properly with
4237 else if (TREE_USED (olddecl
)
4238 && TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (olddecl
)))
4239 warning ("%Jweak declaration of '%D' after first use results "
4240 "in unspecified behavior", newdecl
, newdecl
);
4244 /* We put the NEWDECL on the weak_decls list at some point.
4245 Replace it with the OLDDECL. */
4246 for (wd
= weak_decls
; wd
; wd
= TREE_CHAIN (wd
))
4247 if (TREE_VALUE (wd
) == newdecl
)
4249 TREE_VALUE (wd
) = olddecl
;
4252 /* We may not find the entry on the list. If NEWDECL is a
4253 weak alias, then we will have already called
4254 globalize_decl to remove the entry; in that case, we do
4255 not need to do anything. */
4258 /* Make the OLDDECL weak; it's OLDDECL that we'll be keeping. */
4259 mark_weak (olddecl
);
4262 /* OLDDECL was weak, but NEWDECL was not explicitly marked as
4263 weak. Just update NEWDECL to indicate that it's weak too. */
4264 mark_weak (newdecl
);
4267 /* Declare DECL to be a weak symbol. */
4270 declare_weak (tree decl
)
4272 if (! TREE_PUBLIC (decl
))
4273 error ("%Jweak declaration of '%D' must be public", decl
, decl
);
4274 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& TREE_ASM_WRITTEN (decl
))
4275 error ("%Jweak declaration of '%D' must precede definition", decl
, decl
);
4276 else if (SUPPORTS_WEAK
)
4278 if (! DECL_WEAK (decl
))
4279 weak_decls
= tree_cons (NULL
, decl
, weak_decls
);
4282 warning ("%Jweak declaration of '%D' not supported", decl
, decl
);
4287 /* Emit any pending weak declarations. */
4294 for (t
= weak_decls
; t
; t
= TREE_CHAIN (t
))
4296 tree decl
= TREE_VALUE (t
);
4297 #if defined (ASM_WEAKEN_DECL) || defined (ASM_WEAKEN_LABEL)
4298 const char *const name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
4301 if (! TREE_USED (decl
))
4304 #ifdef ASM_WEAKEN_DECL
4305 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, NULL
);
4307 #ifdef ASM_WEAKEN_LABEL
4308 ASM_WEAKEN_LABEL (asm_out_file
, name
);
4310 #ifdef ASM_OUTPUT_WEAK_ALIAS
4311 warning ("only weak aliases are supported in this configuration");
4319 /* Emit the assembly bits to indicate that DECL is globally visible. */
4322 globalize_decl (tree decl
)
4324 const char *name
= XSTR (XEXP (DECL_RTL (decl
), 0), 0);
4326 #if defined (ASM_WEAKEN_LABEL) || defined (ASM_WEAKEN_DECL)
4327 if (DECL_WEAK (decl
))
4331 #ifdef ASM_WEAKEN_DECL
4332 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, 0);
4334 ASM_WEAKEN_LABEL (asm_out_file
, name
);
4337 /* Remove this function from the pending weak list so that
4338 we do not emit multiple .weak directives for it. */
4339 for (p
= &weak_decls
; (t
= *p
) ; )
4341 if (DECL_ASSEMBLER_NAME (decl
) == DECL_ASSEMBLER_NAME (TREE_VALUE (t
)))
4342 *p
= TREE_CHAIN (t
);
4344 p
= &TREE_CHAIN (t
);
4350 (*targetm
.asm_out
.globalize_label
) (asm_out_file
, name
);
4353 /* Emit an assembler directive to make the symbol for DECL an alias to
4354 the symbol for TARGET. */
4357 assemble_alias (tree decl
, tree target ATTRIBUTE_UNUSED
)
4361 /* We must force creation of DECL_RTL for debug info generation, even though
4362 we don't use it here. */
4363 make_decl_rtl (decl
, NULL
);
4365 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
4367 #ifdef ASM_OUTPUT_DEF
4368 /* Make name accessible from other files, if appropriate. */
4370 if (TREE_PUBLIC (decl
))
4372 globalize_decl (decl
);
4373 maybe_assemble_visibility (decl
);
4376 #ifdef ASM_OUTPUT_DEF_FROM_DECLS
4377 ASM_OUTPUT_DEF_FROM_DECLS (asm_out_file
, decl
, target
);
4379 ASM_OUTPUT_DEF (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4381 #else /* !ASM_OUTPUT_DEF */
4382 #if defined (ASM_OUTPUT_WEAK_ALIAS) || defined (ASM_WEAKEN_DECL)
4383 if (! DECL_WEAK (decl
))
4384 warning ("only weak aliases are supported in this configuration");
4386 #ifdef ASM_WEAKEN_DECL
4387 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, IDENTIFIER_POINTER (target
));
4389 ASM_OUTPUT_WEAK_ALIAS (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4392 warning ("alias definitions not supported in this configuration; ignored");
4396 TREE_USED (decl
) = 1;
4397 TREE_ASM_WRITTEN (decl
) = 1;
4398 TREE_ASM_WRITTEN (DECL_ASSEMBLER_NAME (decl
)) = 1;
4401 /* Emit an assembler directive to set symbol for DECL visibility to
4402 the visibility type VIS, which must not be VISIBILITY_DEFAULT. */
4405 default_assemble_visibility (tree decl
, int vis
)
4407 static const char * const visibility_types
[] = {
4408 NULL
, "internal", "hidden", "protected"
4411 const char *name
, *type
;
4413 name
= (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
4414 type
= visibility_types
[vis
];
4416 #ifdef HAVE_GAS_HIDDEN
4417 fprintf (asm_out_file
, "\t.%s\t", type
);
4418 assemble_name (asm_out_file
, name
);
4419 fprintf (asm_out_file
, "\n");
4421 warning ("visibility attribute not supported in this configuration; ignored");
4425 /* A helper function to call assemble_visibility when needed for a decl. */
4428 maybe_assemble_visibility (tree decl
)
4430 enum symbol_visibility vis
= decl_visibility (decl
);
4432 if (vis
!= VISIBILITY_DEFAULT
)
4433 (* targetm
.asm_out
.visibility
) (decl
, vis
);
4436 /* Returns 1 if the target configuration supports defining public symbols
4437 so that one of them will be chosen at link time instead of generating a
4438 multiply-defined symbol error, whether through the use of weak symbols or
4439 a target-specific mechanism for having duplicates discarded. */
4442 supports_one_only (void)
4444 if (SUPPORTS_ONE_ONLY
)
4446 return SUPPORTS_WEAK
;
4449 /* Set up DECL as a public symbol that can be defined in multiple
4450 translation units without generating a linker error. */
4453 make_decl_one_only (tree decl
)
4455 if (TREE_CODE (decl
) != VAR_DECL
&& TREE_CODE (decl
) != FUNCTION_DECL
)
4458 TREE_PUBLIC (decl
) = 1;
4460 if (TREE_CODE (decl
) == VAR_DECL
4461 && (DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
))
4462 DECL_COMMON (decl
) = 1;
4463 else if (SUPPORTS_ONE_ONLY
)
4465 #ifdef MAKE_DECL_ONE_ONLY
4466 MAKE_DECL_ONE_ONLY (decl
);
4468 DECL_ONE_ONLY (decl
) = 1;
4470 else if (SUPPORTS_WEAK
)
4471 DECL_WEAK (decl
) = 1;
4477 init_varasm_once (void)
4479 in_named_htab
= htab_create_ggc (31, in_named_entry_hash
,
4480 in_named_entry_eq
, NULL
);
4481 const_desc_htab
= htab_create_ggc (1009, const_desc_hash
,
4482 const_desc_eq
, NULL
);
4484 const_alias_set
= new_alias_set ();
4488 decl_tls_model (tree decl
)
4490 enum tls_model kind
;
4491 tree attr
= lookup_attribute ("tls_model", DECL_ATTRIBUTES (decl
));
4496 attr
= TREE_VALUE (TREE_VALUE (attr
));
4497 if (TREE_CODE (attr
) != STRING_CST
)
4499 if (!strcmp (TREE_STRING_POINTER (attr
), "local-exec"))
4500 kind
= TLS_MODEL_LOCAL_EXEC
;
4501 else if (!strcmp (TREE_STRING_POINTER (attr
), "initial-exec"))
4502 kind
= TLS_MODEL_INITIAL_EXEC
;
4503 else if (!strcmp (TREE_STRING_POINTER (attr
), "local-dynamic"))
4504 kind
= optimize
? TLS_MODEL_LOCAL_DYNAMIC
: TLS_MODEL_GLOBAL_DYNAMIC
;
4505 else if (!strcmp (TREE_STRING_POINTER (attr
), "global-dynamic"))
4506 kind
= TLS_MODEL_GLOBAL_DYNAMIC
;
4512 is_local
= (*targetm
.binds_local_p
) (decl
);
4516 kind
= TLS_MODEL_LOCAL_EXEC
;
4518 kind
= TLS_MODEL_INITIAL_EXEC
;
4520 /* Local dynamic is inefficient when we're not combining the
4521 parts of the address. */
4522 else if (optimize
&& is_local
)
4523 kind
= TLS_MODEL_LOCAL_DYNAMIC
;
4525 kind
= TLS_MODEL_GLOBAL_DYNAMIC
;
4526 if (kind
< flag_tls_default
)
4527 kind
= flag_tls_default
;
4532 enum symbol_visibility
4533 decl_visibility (tree decl
)
4535 tree attr
= lookup_attribute ("visibility", DECL_ATTRIBUTES (decl
));
4539 const char *which
= TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr
)));
4541 if (strcmp (which
, "default") == 0)
4542 return VISIBILITY_DEFAULT
;
4543 if (strcmp (which
, "internal") == 0)
4544 return VISIBILITY_INTERNAL
;
4545 if (strcmp (which
, "hidden") == 0)
4546 return VISIBILITY_HIDDEN
;
4547 if (strcmp (which
, "protected") == 0)
4548 return VISIBILITY_PROTECTED
;
4553 return VISIBILITY_DEFAULT
;
4556 /* Select a set of attributes for section NAME based on the properties
4557 of DECL and whether or not RELOC indicates that DECL's initializer
4558 might contain runtime relocations.
4560 We make the section read-only and executable for a function decl,
4561 read-only for a const data decl, and writable for a non-const data decl. */
4564 default_section_type_flags (tree decl
, const char *name
, int reloc
)
4566 return default_section_type_flags_1 (decl
, name
, reloc
, flag_pic
);
4570 default_section_type_flags_1 (tree decl
, const char *name
, int reloc
,
4575 if (decl
&& TREE_CODE (decl
) == FUNCTION_DECL
)
4576 flags
= SECTION_CODE
;
4577 else if (decl
&& decl_readonly_section_1 (decl
, reloc
, shlib
))
4580 flags
= SECTION_WRITE
;
4582 if (decl
&& DECL_ONE_ONLY (decl
))
4583 flags
|= SECTION_LINKONCE
;
4585 if (decl
&& TREE_CODE (decl
) == VAR_DECL
&& DECL_THREAD_LOCAL (decl
))
4586 flags
|= SECTION_TLS
| SECTION_WRITE
;
4588 if (strcmp (name
, ".bss") == 0
4589 || strncmp (name
, ".bss.", 5) == 0
4590 || strncmp (name
, ".gnu.linkonce.b.", 16) == 0
4591 || strcmp (name
, ".sbss") == 0
4592 || strncmp (name
, ".sbss.", 6) == 0
4593 || strncmp (name
, ".gnu.linkonce.sb.", 17) == 0
4594 || strcmp (name
, ".tbss") == 0
4595 || strncmp (name
, ".gnu.linkonce.tb.", 17) == 0)
4596 flags
|= SECTION_BSS
;
4598 if (strcmp (name
, ".tdata") == 0
4599 || strcmp (name
, ".tbss") == 0
4600 || strncmp (name
, ".gnu.linkonce.td.", 17) == 0
4601 || strncmp (name
, ".gnu.linkonce.tb.", 17) == 0)
4602 flags
|= SECTION_TLS
;
4604 /* These three sections have special ELF types. They are neither
4605 SHT_PROGBITS nor SHT_NOBITS, so when changing sections we don't
4606 want to print a section type (@progbits or @nobits). If someone
4607 is silly enough to emit code or TLS variables to one of these
4608 sections, then don't handle them specially. */
4609 if (!(flags
& (SECTION_CODE
| SECTION_BSS
| SECTION_TLS
))
4610 && (strcmp (name
, ".init_array") == 0
4611 || strcmp (name
, ".fini_array") == 0
4612 || strcmp (name
, ".preinit_array") == 0))
4613 flags
|= SECTION_NOTYPE
;
4618 /* Output assembly to switch to section NAME with attribute FLAGS.
4619 Four variants for common object file formats. */
4622 default_no_named_section (const char *name ATTRIBUTE_UNUSED
,
4623 unsigned int flags ATTRIBUTE_UNUSED
)
4625 /* Some object formats don't support named sections at all. The
4626 front-end should already have flagged this as an error. */
4631 default_elf_asm_named_section (const char *name
, unsigned int flags
)
4633 char flagchars
[10], *f
= flagchars
;
4635 if (! named_section_first_declaration (name
))
4637 fprintf (asm_out_file
, "\t.section\t%s\n", name
);
4641 if (!(flags
& SECTION_DEBUG
))
4643 if (flags
& SECTION_WRITE
)
4645 if (flags
& SECTION_CODE
)
4647 if (flags
& SECTION_SMALL
)
4649 if (flags
& SECTION_MERGE
)
4651 if (flags
& SECTION_STRINGS
)
4653 if (flags
& SECTION_TLS
)
4657 fprintf (asm_out_file
, "\t.section\t%s,\"%s\"", name
, flagchars
);
4659 if (!(flags
& SECTION_NOTYPE
))
4663 if (flags
& SECTION_BSS
)
4668 fprintf (asm_out_file
, ",@%s", type
);
4670 if (flags
& SECTION_ENTSIZE
)
4671 fprintf (asm_out_file
, ",%d", flags
& SECTION_ENTSIZE
);
4674 putc ('\n', asm_out_file
);
4678 default_coff_asm_named_section (const char *name
, unsigned int flags
)
4680 char flagchars
[8], *f
= flagchars
;
4682 if (flags
& SECTION_WRITE
)
4684 if (flags
& SECTION_CODE
)
4688 fprintf (asm_out_file
, "\t.section\t%s,\"%s\"\n", name
, flagchars
);
4692 default_pe_asm_named_section (const char *name
, unsigned int flags
)
4694 default_coff_asm_named_section (name
, flags
);
4696 if (flags
& SECTION_LINKONCE
)
4698 /* Functions may have been compiled at various levels of
4699 optimization so we can't use `same_size' here.
4700 Instead, have the linker pick one. */
4701 fprintf (asm_out_file
, "\t.linkonce %s\n",
4702 (flags
& SECTION_CODE
? "discard" : "same_size"));
4706 /* The lame default section selector. */
4709 default_select_section (tree decl
, int reloc
,
4710 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
)
4712 bool readonly
= false;
4716 if (decl_readonly_section (decl
, reloc
))
4719 else if (TREE_CODE (decl
) == CONSTRUCTOR
)
4721 if (! ((flag_pic
&& reloc
)
4722 || !TREE_READONLY (decl
)
4723 || TREE_SIDE_EFFECTS (decl
)
4724 || !TREE_CONSTANT (decl
)))
4727 else if (TREE_CODE (decl
) == STRING_CST
)
4728 readonly
= !flag_writable_strings
;
4729 else if (! (flag_pic
&& reloc
))
4733 readonly_data_section ();
4738 /* A helper function for default_elf_select_section and
4739 default_elf_unique_section. Categorizes the DECL. */
4741 enum section_category
4746 SECCAT_RODATA_MERGE_STR
,
4747 SECCAT_RODATA_MERGE_STR_INIT
,
4748 SECCAT_RODATA_MERGE_CONST
,
4753 /* To optimize loading of shared programs, define following subsections
4755 _REL Contains data that has relocations, so they get grouped
4756 together and dynamic linker will visit fewer pages in memory.
4757 _RO Contains data that is otherwise read-only. This is useful
4758 with prelinking as most relocations won't be dynamically
4759 linked and thus stay read only.
4760 _LOCAL Marks data containing relocations only to local objects.
4761 These relocations will get fully resolved by prelinking. */
4763 SECCAT_DATA_REL_LOCAL
,
4765 SECCAT_DATA_REL_RO_LOCAL
,
4775 static enum section_category
4776 categorize_decl_for_section (tree
, int, int);
4778 static enum section_category
4779 categorize_decl_for_section (tree decl
, int reloc
, int shlib
)
4781 enum section_category ret
;
4783 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4785 else if (TREE_CODE (decl
) == STRING_CST
)
4787 if (flag_writable_strings
)
4790 return SECCAT_RODATA_MERGE_STR
;
4792 else if (TREE_CODE (decl
) == VAR_DECL
)
4794 if (DECL_INITIAL (decl
) == NULL
4795 || DECL_INITIAL (decl
) == error_mark_node
)
4797 else if (! TREE_READONLY (decl
)
4798 || TREE_SIDE_EFFECTS (decl
)
4799 || ! TREE_CONSTANT (DECL_INITIAL (decl
)))
4801 if (shlib
&& (reloc
& 2))
4802 ret
= SECCAT_DATA_REL
;
4803 else if (shlib
&& reloc
)
4804 ret
= SECCAT_DATA_REL_LOCAL
;
4808 else if (shlib
&& (reloc
& 2))
4809 ret
= SECCAT_DATA_REL_RO
;
4810 else if (shlib
&& reloc
)
4811 ret
= SECCAT_DATA_REL_RO_LOCAL
;
4812 else if (reloc
|| flag_merge_constants
< 2)
4813 /* C and C++ don't allow different variables to share the same
4814 location. -fmerge-all-constants allows even that (at the
4815 expense of not conforming). */
4816 ret
= SECCAT_RODATA
;
4817 else if (TREE_CODE (DECL_INITIAL (decl
)) == STRING_CST
)
4818 ret
= SECCAT_RODATA_MERGE_STR_INIT
;
4820 ret
= SECCAT_RODATA_MERGE_CONST
;
4822 else if (TREE_CODE (decl
) == CONSTRUCTOR
)
4824 if ((shlib
&& reloc
)
4825 || TREE_SIDE_EFFECTS (decl
)
4826 || ! TREE_CONSTANT (decl
))
4829 ret
= SECCAT_RODATA
;
4832 ret
= SECCAT_RODATA
;
4834 /* There are no read-only thread-local sections. */
4835 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_THREAD_LOCAL (decl
))
4837 if (ret
== SECCAT_BSS
)
4843 /* If the target uses small data sections, select it. */
4844 else if ((*targetm
.in_small_data_p
) (decl
))
4846 if (ret
== SECCAT_BSS
)
4848 else if (targetm
.have_srodata_section
&& ret
== SECCAT_RODATA
)
4849 ret
= SECCAT_SRODATA
;
4858 decl_readonly_section (tree decl
, int reloc
)
4860 return decl_readonly_section_1 (decl
, reloc
, flag_pic
);
4864 decl_readonly_section_1 (tree decl
, int reloc
, int shlib
)
4866 switch (categorize_decl_for_section (decl
, reloc
, shlib
))
4869 case SECCAT_RODATA_MERGE_STR
:
4870 case SECCAT_RODATA_MERGE_STR_INIT
:
4871 case SECCAT_RODATA_MERGE_CONST
:
4872 case SECCAT_SRODATA
:
4881 /* Select a section based on the above categorization. */
4884 default_elf_select_section (tree decl
, int reloc
,
4885 unsigned HOST_WIDE_INT align
)
4887 default_elf_select_section_1 (decl
, reloc
, align
, flag_pic
);
4891 default_elf_select_section_1 (tree decl
, int reloc
,
4892 unsigned HOST_WIDE_INT align
, int shlib
)
4894 switch (categorize_decl_for_section (decl
, reloc
, shlib
))
4897 /* We're not supposed to be called on FUNCTION_DECLs. */
4900 readonly_data_section ();
4902 case SECCAT_RODATA_MERGE_STR
:
4903 mergeable_string_section (decl
, align
, 0);
4905 case SECCAT_RODATA_MERGE_STR_INIT
:
4906 mergeable_string_section (DECL_INITIAL (decl
), align
, 0);
4908 case SECCAT_RODATA_MERGE_CONST
:
4909 mergeable_constant_section (DECL_MODE (decl
), align
, 0);
4911 case SECCAT_SRODATA
:
4912 named_section (NULL_TREE
, ".sdata2", reloc
);
4917 case SECCAT_DATA_REL
:
4918 named_section (NULL_TREE
, ".data.rel", reloc
);
4920 case SECCAT_DATA_REL_LOCAL
:
4921 named_section (NULL_TREE
, ".data.rel.local", reloc
);
4923 case SECCAT_DATA_REL_RO
:
4924 named_section (NULL_TREE
, ".data.rel.ro", reloc
);
4926 case SECCAT_DATA_REL_RO_LOCAL
:
4927 named_section (NULL_TREE
, ".data.rel.ro.local", reloc
);
4930 named_section (NULL_TREE
, ".sdata", reloc
);
4933 named_section (NULL_TREE
, ".tdata", reloc
);
4936 #ifdef BSS_SECTION_ASM_OP
4939 named_section (NULL_TREE
, ".bss", reloc
);
4943 named_section (NULL_TREE
, ".sbss", reloc
);
4946 named_section (NULL_TREE
, ".tbss", reloc
);
4953 /* Construct a unique section name based on the decl name and the
4954 categorization performed above. */
4957 default_unique_section (tree decl
, int reloc
)
4959 default_unique_section_1 (decl
, reloc
, flag_pic
);
4963 default_unique_section_1 (tree decl
, int reloc
, int shlib
)
4965 bool one_only
= DECL_ONE_ONLY (decl
);
4966 const char *prefix
, *name
;
4970 switch (categorize_decl_for_section (decl
, reloc
, shlib
))
4973 prefix
= one_only
? ".gnu.linkonce.t." : ".text.";
4976 case SECCAT_RODATA_MERGE_STR
:
4977 case SECCAT_RODATA_MERGE_STR_INIT
:
4978 case SECCAT_RODATA_MERGE_CONST
:
4979 prefix
= one_only
? ".gnu.linkonce.r." : ".rodata.";
4981 case SECCAT_SRODATA
:
4982 prefix
= one_only
? ".gnu.linkonce.s2." : ".sdata2.";
4985 case SECCAT_DATA_REL
:
4986 case SECCAT_DATA_REL_LOCAL
:
4987 case SECCAT_DATA_REL_RO
:
4988 case SECCAT_DATA_REL_RO_LOCAL
:
4989 prefix
= one_only
? ".gnu.linkonce.d." : ".data.";
4992 prefix
= one_only
? ".gnu.linkonce.s." : ".sdata.";
4995 prefix
= one_only
? ".gnu.linkonce.b." : ".bss.";
4998 prefix
= one_only
? ".gnu.linkonce.sb." : ".sbss.";
5001 prefix
= one_only
? ".gnu.linkonce.td." : ".tdata.";
5004 prefix
= one_only
? ".gnu.linkonce.tb." : ".tbss.";
5009 plen
= strlen (prefix
);
5011 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
5012 name
= (* targetm
.strip_name_encoding
) (name
);
5013 nlen
= strlen (name
);
5015 string
= alloca (nlen
+ plen
+ 1);
5016 memcpy (string
, prefix
, plen
);
5017 memcpy (string
+ plen
, name
, nlen
+ 1);
5019 DECL_SECTION_NAME (decl
) = build_string (nlen
+ plen
, string
);
5023 default_select_rtx_section (enum machine_mode mode ATTRIBUTE_UNUSED
,
5025 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
)
5028 switch (GET_CODE (x
))
5040 readonly_data_section ();
5044 default_elf_select_rtx_section (enum machine_mode mode
, rtx x
,
5045 unsigned HOST_WIDE_INT align
)
5047 /* ??? Handle small data here somehow. */
5050 switch (GET_CODE (x
))
5054 named_section (NULL_TREE
, ".data.rel.ro", 3);
5058 named_section (NULL_TREE
, ".data.rel.ro.local", 1);
5065 mergeable_constant_section (mode
, align
, 0);
5068 /* Set the generally applicable flags on the SYMBOL_REF for EXP. */
5071 default_encode_section_info (tree decl
, rtx rtl
, int first ATTRIBUTE_UNUSED
)
5076 /* Careful not to prod global register variables. */
5077 if (GET_CODE (rtl
) != MEM
)
5079 symbol
= XEXP (rtl
, 0);
5080 if (GET_CODE (symbol
) != SYMBOL_REF
)
5084 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5085 flags
|= SYMBOL_FLAG_FUNCTION
;
5086 if ((*targetm
.binds_local_p
) (decl
))
5087 flags
|= SYMBOL_FLAG_LOCAL
;
5088 if ((*targetm
.in_small_data_p
) (decl
))
5089 flags
|= SYMBOL_FLAG_SMALL
;
5090 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_THREAD_LOCAL (decl
))
5091 flags
|= decl_tls_model (decl
) << SYMBOL_FLAG_TLS_SHIFT
;
5092 /* ??? Why is DECL_EXTERNAL ever set for non-PUBLIC names? Without
5093 being PUBLIC, the thing *must* be defined in this translation unit.
5094 Prevent this buglet from being propagated into rtl code as well. */
5095 if (DECL_P (decl
) && DECL_EXTERNAL (decl
) && TREE_PUBLIC (decl
))
5096 flags
|= SYMBOL_FLAG_EXTERNAL
;
5098 SYMBOL_REF_FLAGS (symbol
) = flags
;
5101 /* By default, we do nothing for encode_section_info, so we need not
5102 do anything but discard the '*' marker. */
5105 default_strip_name_encoding (const char *str
)
5107 return str
+ (*str
== '*');
5110 /* Assume ELF-ish defaults, since that's pretty much the most liberal
5111 wrt cross-module name binding. */
5114 default_binds_local_p (tree exp
)
5116 return default_binds_local_p_1 (exp
, flag_shlib
);
5120 default_binds_local_p_1 (tree exp
, int shlib
)
5124 /* A non-decl is an entry in the constant pool. */
5127 /* Static variables are always local. */
5128 else if (! TREE_PUBLIC (exp
))
5130 /* A variable is local if the user tells us so. */
5131 else if (decl_visibility (exp
) != VISIBILITY_DEFAULT
)
5133 /* Otherwise, variables defined outside this object may not be local. */
5134 else if (DECL_EXTERNAL (exp
))
5136 /* Linkonce and weak data are never local. */
5137 else if (DECL_ONE_ONLY (exp
) || DECL_WEAK (exp
))
5139 /* If PIC, then assume that any global name can be overridden by
5140 symbols resolved from other modules. */
5143 /* Uninitialized COMMON variable may be unified with symbols
5144 resolved from other modules. */
5145 else if (DECL_COMMON (exp
)
5146 && (DECL_INITIAL (exp
) == NULL
5147 || DECL_INITIAL (exp
) == error_mark_node
))
5149 /* Otherwise we're left with initialized (or non-common) global data
5150 which is of necessity defined locally. */
5157 /* Determine whether or not a pointer mode is valid. Assume defaults
5158 of ptr_mode or Pmode - can be overridden. */
5160 default_valid_pointer_mode (enum machine_mode mode
)
5162 return (mode
== ptr_mode
|| mode
== Pmode
);
5165 /* Default function to output code that will globalize a label. A
5166 target must define GLOBAL_ASM_OP or provide it's own function to
5167 globalize a label. */
5168 #ifdef GLOBAL_ASM_OP
5170 default_globalize_label (FILE * stream
, const char *name
)
5172 fputs (GLOBAL_ASM_OP
, stream
);
5173 assemble_name (stream
, name
);
5174 putc ('\n', stream
);
5176 #endif /* GLOBAL_ASM_OP */
5178 /* This is how to output an internal numbered label where PREFIX is
5179 the class of label and LABELNO is the number within the class. */
5182 default_internal_label (FILE *stream
, const char *prefix
,
5183 unsigned long labelno
)
5185 char *const buf
= alloca (40 + strlen (prefix
));
5186 ASM_GENERATE_INTERNAL_LABEL (buf
, prefix
, labelno
);
5187 ASM_OUTPUT_LABEL (stream
, buf
);
5190 /* This is the default behavior at the beginning of a file. It's
5191 controlled by two other target-hook toggles. */
5193 default_file_start (void)
5195 if (targetm
.file_start_app_off
&& !flag_verbose_asm
)
5196 fputs (ASM_APP_OFF
, asm_out_file
);
5198 if (targetm
.file_start_file_directive
)
5199 output_file_directive (asm_out_file
, main_input_filename
);
5202 /* This is a generic routine suitable for use as TARGET_ASM_FILE_END
5203 which emits a special section directive used to indicate whether or
5204 not this object file needs an executable stack. This is primarily
5205 a GNU extension to ELF but could be used on other targets. */
5207 file_end_indicate_exec_stack (void)
5209 unsigned int flags
= SECTION_DEBUG
;
5210 if (trampolines_created
)
5211 flags
|= SECTION_CODE
;
5213 named_section_flags (".note.GNU-stack", flags
);
5216 #include "gt-varasm.h"