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 size. 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 cannot assume that 32 divides the
1914 mode's bitsize (size * BITS_PER_UNIT) evenly.
1916 size * BITS_PER_UNIT is used here to make sure that padding bits
1917 (which might appear at either end of the value; real_to_target
1918 will include the padding bits in its output array) are included. */
1920 nunits
= GET_MODE_SIZE (mode
);
1921 bitsize
= nunits
* BITS_PER_UNIT
;
1922 nelts
= CEIL (bitsize
, 32);
1923 units_per
= 32 / BITS_PER_UNIT
;
1925 real_to_target (data
, &d
, mode
);
1927 /* Put out the first word with the specified alignment. */
1928 assemble_integer (GEN_INT (data
[0]), MIN (nunits
, units_per
), align
, 1);
1929 nunits
-= units_per
;
1931 /* Subsequent words need only 32-bit alignment. */
1932 align
= min_align (align
, 32);
1934 for (i
= 1; i
< nelts
; i
++)
1936 assemble_integer (GEN_INT (data
[i
]), MIN (nunits
, units_per
), align
, 1);
1937 nunits
-= units_per
;
1941 /* Given an expression EXP with a constant value,
1942 reduce it to the sum of an assembler symbol and an integer.
1943 Store them both in the structure *VALUE.
1944 Abort if EXP does not reduce. */
1946 struct addr_const
GTY(())
1949 HOST_WIDE_INT offset
;
1953 decode_addr_const (tree exp
, struct addr_const
*value
)
1955 tree target
= TREE_OPERAND (exp
, 0);
1961 if (TREE_CODE (target
) == COMPONENT_REF
1962 && host_integerp (byte_position (TREE_OPERAND (target
, 1)), 0))
1965 offset
+= int_byte_position (TREE_OPERAND (target
, 1));
1966 target
= TREE_OPERAND (target
, 0);
1968 else if (TREE_CODE (target
) == ARRAY_REF
1969 || TREE_CODE (target
) == ARRAY_RANGE_REF
)
1971 offset
+= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (target
)), 1)
1972 * tree_low_cst (TREE_OPERAND (target
, 1), 0));
1973 target
= TREE_OPERAND (target
, 0);
1979 switch (TREE_CODE (target
))
1983 x
= DECL_RTL (target
);
1987 x
= gen_rtx_MEM (FUNCTION_MODE
,
1988 gen_rtx_LABEL_REF (VOIDmode
, force_label_rtx (target
)));
1996 x
= output_constant_def (target
, 1);
2003 if (GET_CODE (x
) != MEM
)
2008 value
->offset
= offset
;
2011 /* We do RTX_UNSPEC + XINT (blah), so nothing can go after RTX_UNSPEC. */
2012 enum kind
{ RTX_UNKNOWN
, RTX_DOUBLE
, RTX_VECTOR
, RTX_INT
, RTX_UNSPEC
};
2013 struct rtx_const
GTY(())
2015 ENUM_BITFIELD(kind
) kind
: 16;
2016 ENUM_BITFIELD(machine_mode
) mode
: 16;
2017 union rtx_const_un
{
2018 REAL_VALUE_TYPE
GTY ((tag ("4"))) du
;
2019 struct rtx_const_u_addr
{
2022 HOST_WIDE_INT offset
;
2023 } GTY ((tag ("1"))) addr
;
2024 struct rtx_const_u_di
{
2027 } GTY ((tag ("0"))) di
;
2029 /* The max vector size we have is 16 wide; two variants for
2030 integral and floating point vectors. */
2031 struct rtx_const_int_vec
{
2034 } GTY ((tag ("2"))) int_vec
[16];
2036 REAL_VALUE_TYPE
GTY ((tag ("3"))) fp_vec
[8];
2038 } GTY ((desc ("%1.kind >= RTX_INT"), descbits ("1"))) un
;
2041 /* Uniquize all constants that appear in memory.
2042 Each constant in memory thus far output is recorded
2043 in `const_hash_table'. */
2045 struct constant_descriptor_tree
GTY(())
2047 /* A MEM for the constant. */
2050 /* The value of the constant. */
2054 static GTY((param_is (struct constant_descriptor_tree
)))
2055 htab_t const_desc_htab
;
2057 static struct constant_descriptor_tree
* build_constant_desc (tree
);
2058 static void maybe_output_constant_def_contents (struct constant_descriptor_tree
*, int);
2060 /* Compute a hash code for a constant expression. */
2063 const_desc_hash (const void *ptr
)
2065 return const_hash_1 (((struct constant_descriptor_tree
*)ptr
)->value
);
2069 const_hash_1 (const tree exp
)
2074 enum tree_code code
= TREE_CODE (exp
);
2076 /* Either set P and LEN to the address and len of something to hash and
2077 exit the switch or return a value. */
2082 p
= (char *) &TREE_INT_CST (exp
);
2083 len
= sizeof TREE_INT_CST (exp
);
2087 return real_hash (TREE_REAL_CST_PTR (exp
));
2090 p
= TREE_STRING_POINTER (exp
);
2091 len
= TREE_STRING_LENGTH (exp
);
2094 return (const_hash_1 (TREE_REALPART (exp
)) * 5
2095 + const_hash_1 (TREE_IMAGPART (exp
)));
2098 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2102 len
= int_size_in_bytes (TREE_TYPE (exp
));
2104 get_set_constructor_bytes (exp
, (unsigned char *) tmp
, len
);
2112 hi
= 5 + int_size_in_bytes (TREE_TYPE (exp
));
2114 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2115 if (TREE_VALUE (link
))
2116 hi
= hi
* 603 + const_hash_1 (TREE_VALUE (link
));
2124 struct addr_const value
;
2126 decode_addr_const (exp
, &value
);
2127 if (GET_CODE (value
.base
) == SYMBOL_REF
)
2129 /* Don't hash the address of the SYMBOL_REF;
2130 only use the offset and the symbol name. */
2132 p
= XSTR (value
.base
, 0);
2133 for (i
= 0; p
[i
] != 0; i
++)
2134 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2136 else if (GET_CODE (value
.base
) == LABEL_REF
)
2137 hi
= value
.offset
+ CODE_LABEL_NUMBER (XEXP (value
.base
, 0)) * 13;
2145 return (const_hash_1 (TREE_OPERAND (exp
, 0)) * 9
2146 + const_hash_1 (TREE_OPERAND (exp
, 1)));
2150 case NON_LVALUE_EXPR
:
2151 return const_hash_1 (TREE_OPERAND (exp
, 0)) * 7 + 2;
2154 /* A language specific constant. Just hash the code. */
2158 /* Compute hashing function. */
2160 for (i
= 0; i
< len
; i
++)
2161 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2166 /* Wrapper of compare_constant, for the htab interface. */
2168 const_desc_eq (const void *p1
, const void *p2
)
2170 return compare_constant (((struct constant_descriptor_tree
*)p1
)->value
,
2171 ((struct constant_descriptor_tree
*)p2
)->value
);
2174 /* Compare t1 and t2, and return 1 only if they are known to result in
2175 the same bit pattern on output. */
2178 compare_constant (const tree t1
, const tree t2
)
2180 enum tree_code typecode
;
2182 if (t1
== NULL_TREE
)
2183 return t2
== NULL_TREE
;
2184 if (t2
== NULL_TREE
)
2187 if (TREE_CODE (t1
) != TREE_CODE (t2
))
2190 switch (TREE_CODE (t1
))
2193 /* Integer constants are the same only if the same width of type. */
2194 if (TYPE_PRECISION (TREE_TYPE (t1
)) != TYPE_PRECISION (TREE_TYPE (t2
)))
2196 return tree_int_cst_equal (t1
, t2
);
2199 /* Real constants are the same only if the same width of type. */
2200 if (TYPE_PRECISION (TREE_TYPE (t1
)) != TYPE_PRECISION (TREE_TYPE (t2
)))
2203 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
2206 if (flag_writable_strings
)
2209 if (TYPE_MODE (TREE_TYPE (t1
)) != TYPE_MODE (TREE_TYPE (t2
)))
2212 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
2213 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
2214 TREE_STRING_LENGTH (t1
)));
2217 return (compare_constant (TREE_REALPART (t1
), TREE_REALPART (t2
))
2218 && compare_constant (TREE_IMAGPART (t1
), TREE_IMAGPART (t2
)));
2221 typecode
= TREE_CODE (TREE_TYPE (t1
));
2222 if (typecode
!= TREE_CODE (TREE_TYPE (t2
)))
2225 if (typecode
== SET_TYPE
)
2227 int len
= int_size_in_bytes (TREE_TYPE (t2
));
2228 unsigned char *tmp1
, *tmp2
;
2230 if (int_size_in_bytes (TREE_TYPE (t1
)) != len
)
2233 tmp1
= alloca (len
);
2234 tmp2
= alloca (len
);
2236 if (get_set_constructor_bytes (t1
, tmp1
, len
) != NULL_TREE
)
2238 if (get_set_constructor_bytes (t2
, tmp2
, len
) != NULL_TREE
)
2241 return memcmp (tmp1
, tmp2
, len
) == 0;
2247 if (typecode
== ARRAY_TYPE
)
2249 HOST_WIDE_INT size_1
= int_size_in_bytes (TREE_TYPE (t1
));
2250 /* For arrays, check that the sizes all match. */
2251 if (TYPE_MODE (TREE_TYPE (t1
)) != TYPE_MODE (TREE_TYPE (t2
))
2253 || size_1
!= int_size_in_bytes (TREE_TYPE (t2
)))
2258 /* For record and union constructors, require exact type
2260 if (TREE_TYPE (t1
) != TREE_TYPE (t2
))
2264 for (l1
= CONSTRUCTOR_ELTS (t1
), l2
= CONSTRUCTOR_ELTS (t2
);
2266 l1
= TREE_CHAIN (l1
), l2
= TREE_CHAIN (l2
))
2268 /* Check that each value is the same... */
2269 if (! compare_constant (TREE_VALUE (l1
), TREE_VALUE (l2
)))
2271 /* ... and that they apply to the same fields! */
2272 if (typecode
== ARRAY_TYPE
)
2274 if (! compare_constant (TREE_PURPOSE (l1
),
2280 if (TREE_PURPOSE (l1
) != TREE_PURPOSE (l2
))
2285 return l1
== NULL_TREE
&& l2
== NULL_TREE
;
2291 struct addr_const value1
, value2
;
2293 decode_addr_const (t1
, &value1
);
2294 decode_addr_const (t2
, &value2
);
2295 return (value1
.offset
== value2
.offset
2296 && strcmp (XSTR (value1
.base
, 0), XSTR (value2
.base
, 0)) == 0);
2302 return (compare_constant (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0))
2303 && compare_constant(TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1)));
2307 case NON_LVALUE_EXPR
:
2308 return compare_constant (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
2313 nt1
= (*lang_hooks
.expand_constant
) (t1
);
2314 nt2
= (*lang_hooks
.expand_constant
) (t2
);
2315 if (nt1
!= t1
|| nt2
!= t2
)
2316 return compare_constant (nt1
, nt2
);
2322 /* Should not get here. */
2326 /* Make a copy of the whole tree structure for a constant. This
2327 handles the same types of nodes that compare_constant handles. */
2330 copy_constant (tree exp
)
2332 switch (TREE_CODE (exp
))
2335 /* For ADDR_EXPR, we do not want to copy the decl whose address
2336 is requested. We do want to copy constants though. */
2337 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, 0))) == 'c')
2338 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2339 copy_constant (TREE_OPERAND (exp
, 0)));
2341 return copy_node (exp
);
2346 return copy_node (exp
);
2349 return build_complex (TREE_TYPE (exp
),
2350 copy_constant (TREE_REALPART (exp
)),
2351 copy_constant (TREE_IMAGPART (exp
)));
2355 return build (TREE_CODE (exp
), TREE_TYPE (exp
),
2356 copy_constant (TREE_OPERAND (exp
, 0)),
2357 copy_constant (TREE_OPERAND (exp
, 1)));
2361 case NON_LVALUE_EXPR
:
2362 case VIEW_CONVERT_EXPR
:
2363 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2364 copy_constant (TREE_OPERAND (exp
, 0)));
2368 tree copy
= copy_node (exp
);
2369 tree list
= copy_list (CONSTRUCTOR_ELTS (exp
));
2372 CONSTRUCTOR_ELTS (copy
) = list
;
2373 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
2374 TREE_VALUE (tail
) = copy_constant (TREE_VALUE (tail
));
2375 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2376 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
2377 TREE_PURPOSE (tail
) = copy_constant (TREE_PURPOSE (tail
));
2385 t
= (*lang_hooks
.expand_constant
) (exp
);
2387 return copy_constant (t
);
2394 /* Subroutine of output_constant_def:
2395 No constant equal to EXP is known to have been output.
2396 Make a constant descriptor to enter EXP in the hash table.
2397 Assign the label number and construct RTL to refer to the
2398 constant's location in memory.
2399 Caller is responsible for updating the hash table. */
2401 static struct constant_descriptor_tree
*
2402 build_constant_desc (tree exp
)
2408 struct constant_descriptor_tree
*desc
;
2410 desc
= ggc_alloc (sizeof (*desc
));
2411 desc
->value
= copy_constant (exp
);
2413 /* Create a string containing the label name, in LABEL. */
2414 labelno
= const_labelno
++;
2415 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", labelno
);
2417 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
2418 symbol
= gen_rtx_SYMBOL_REF (Pmode
, ggc_strdup (label
));
2419 SYMBOL_REF_FLAGS (symbol
) = SYMBOL_FLAG_LOCAL
;
2420 SYMBOL_REF_DECL (symbol
) = desc
->value
;
2421 TREE_CONSTANT_POOL_ADDRESS_P (symbol
) = 1;
2423 rtl
= gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp
)), symbol
);
2424 set_mem_attributes (rtl
, exp
, 1);
2425 set_mem_alias_set (rtl
, 0);
2426 set_mem_alias_set (rtl
, const_alias_set
);
2428 /* Set flags or add text to the name to record information, such as
2429 that it is a local symbol. If the name is changed, the macro
2430 ASM_OUTPUT_LABELREF will have to know how to strip this
2431 information. This call might invalidate our local variable
2432 SYMBOL; we can't use it afterward. */
2434 (*targetm
.encode_section_info
) (exp
, rtl
, true);
2441 /* Return an rtx representing a reference to constant data in memory
2442 for the constant expression EXP.
2444 If assembler code for such a constant has already been output,
2445 return an rtx to refer to it.
2446 Otherwise, output such a constant in memory
2447 and generate an rtx for it.
2449 If DEFER is nonzero, this constant can be deferred and output only
2450 if referenced in the function after all optimizations.
2452 The const_hash_table records which constants already have label strings. */
2455 output_constant_def (tree exp
, int defer
)
2457 struct constant_descriptor_tree
*desc
;
2458 struct constant_descriptor_tree key
;
2461 /* Look up EXP in the table of constant descriptors. If we didn't find
2462 it, create a new one. */
2464 loc
= htab_find_slot (const_desc_htab
, &key
, INSERT
);
2469 desc
= build_constant_desc (exp
);
2473 maybe_output_constant_def_contents (desc
, defer
);
2477 /* Subroutine of output_constant_def: Decide whether or not we need to
2478 output the constant DESC now, and if so, do it. */
2480 maybe_output_constant_def_contents (struct constant_descriptor_tree
*desc
,
2483 rtx symbol
= XEXP (desc
->rtl
, 0);
2484 tree exp
= desc
->value
;
2486 if (flag_syntax_only
)
2489 if (TREE_ASM_WRITTEN (exp
))
2490 /* Already output; don't do it again. */
2493 /* The only constants that cannot safely be deferred, assuming the
2494 context allows it, are strings under flag_writable_strings. */
2495 if (defer
&& (TREE_CODE (exp
) != STRING_CST
|| !flag_writable_strings
))
2497 /* Increment n_deferred_constants if it exists. It needs to be at
2498 least as large as the number of constants actually referred to
2499 by the function. If it's too small we'll stop looking too early
2500 and fail to emit constants; if it's too large we'll only look
2501 through the entire function when we could have stopped earlier. */
2503 n_deferred_constants
++;
2507 output_constant_def_contents (symbol
);
2510 /* We must output the constant data referred to by SYMBOL; do so. */
2513 output_constant_def_contents (rtx symbol
)
2515 tree exp
= SYMBOL_REF_DECL (symbol
);
2516 const char *label
= XSTR (symbol
, 0);
2519 /* Make sure any other constants whose addresses appear in EXP
2520 are assigned label numbers. */
2521 int reloc
= compute_reloc_for_constant (exp
);
2523 /* Align the location counter as required by EXP's data type. */
2524 int align
= TYPE_ALIGN (TREE_TYPE (exp
));
2525 #ifdef CONSTANT_ALIGNMENT
2526 align
= CONSTANT_ALIGNMENT (exp
, align
);
2529 output_addressed_constants (exp
);
2531 /* We are no longer deferring this constant. */
2532 TREE_ASM_WRITTEN (exp
) = 1;
2534 if (IN_NAMED_SECTION (exp
))
2535 named_section (exp
, NULL
, reloc
);
2537 (*targetm
.asm_out
.select_section
) (exp
, reloc
, align
);
2539 if (align
> BITS_PER_UNIT
)
2541 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
2544 size
= int_size_in_bytes (TREE_TYPE (exp
));
2545 if (TREE_CODE (exp
) == STRING_CST
)
2546 size
= MAX (TREE_STRING_LENGTH (exp
), size
);
2548 /* Do any machine/system dependent processing of the constant. */
2549 #ifdef ASM_DECLARE_CONSTANT_NAME
2550 ASM_DECLARE_CONSTANT_NAME (asm_out_file
, label
, exp
, size
);
2552 /* Standard thing is just output label for the constant. */
2553 ASM_OUTPUT_LABEL (asm_out_file
, label
);
2554 #endif /* ASM_DECLARE_CONSTANT_NAME */
2556 /* Output the value of EXP. */
2557 output_constant (exp
, size
, align
);
2560 /* A constant which was deferred in its original location has been
2561 inserted by the RTL inliner into a different function. The
2562 current function's deferred constant count must be incremented. */
2564 notice_rtl_inlining_of_deferred_constant (void)
2566 n_deferred_constants
++;
2569 /* Look up EXP in the table of constant descriptors. Return the rtl
2570 if it has been emitted, else null. */
2573 lookup_constant_def (tree exp
)
2575 struct constant_descriptor_tree
*desc
;
2576 struct constant_descriptor_tree key
;
2579 desc
= htab_find (const_desc_htab
, &key
);
2581 return (desc
? desc
->rtl
: NULL_RTX
);
2584 /* Used in the hash tables to avoid outputting the same constant
2585 twice. Unlike 'struct constant_descriptor_tree', RTX constants
2586 are output once per function, not once per file; there seems
2587 to be no reason for the difference. */
2589 struct constant_descriptor_rtx
GTY(())
2591 /* More constant_descriptors with the same hash code. */
2592 struct constant_descriptor_rtx
*next
;
2594 /* A MEM for the constant. */
2597 /* The value of the constant. */
2598 struct rtx_const value
;
2601 /* Structure to represent sufficient information about a constant so that
2602 it can be output when the constant pool is output, so that function
2603 integration can be done, and to simplify handling on machines that reference
2604 constant pool as base+displacement. */
2606 struct pool_constant
GTY(())
2608 struct constant_descriptor_rtx
*desc
;
2609 struct pool_constant
*next
;
2610 struct pool_constant
*next_sym
;
2612 enum machine_mode mode
;
2615 HOST_WIDE_INT offset
;
2619 /* Hash code for a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true.
2620 The argument is XSTR (... , 0) */
2622 #define SYMHASH(LABEL) (((unsigned long) (LABEL)) % MAX_RTX_HASH_TABLE)
2624 /* Initialize constant pool hashing for a new function. */
2627 init_varasm_status (struct function
*f
)
2629 struct varasm_status
*p
;
2630 p
= ggc_alloc (sizeof (struct varasm_status
));
2632 p
->x_const_rtx_hash_table
2633 = ggc_alloc_cleared (MAX_RTX_HASH_TABLE
2634 * sizeof (struct constant_descriptor_rtx
*));
2635 p
->x_const_rtx_sym_hash_table
2636 = ggc_alloc_cleared (MAX_RTX_HASH_TABLE
2637 * sizeof (struct pool_constant
*));
2639 p
->x_first_pool
= p
->x_last_pool
= 0;
2640 p
->x_pool_offset
= 0;
2641 p
->deferred_constants
= 0;
2645 /* Express an rtx for a constant integer (perhaps symbolic)
2646 as the sum of a symbol or label plus an explicit integer.
2647 They are stored into VALUE. */
2650 decode_rtx_const (enum machine_mode mode
, rtx x
, struct rtx_const
*value
)
2652 /* Clear the whole structure, including any gaps. */
2653 memset (value
, 0, sizeof (struct rtx_const
));
2655 value
->kind
= RTX_INT
; /* Most usual kind. */
2658 switch (GET_CODE (x
))
2661 value
->kind
= RTX_DOUBLE
;
2662 if (GET_MODE (x
) != VOIDmode
)
2664 const REAL_VALUE_TYPE
*r
= CONST_DOUBLE_REAL_VALUE (x
);
2666 value
->mode
= GET_MODE (x
);
2668 /* Copy the REAL_VALUE_TYPE by members so that we don't
2669 copy garbage from the original structure into our
2670 carefully cleaned hashing structure. */
2671 value
->un
.du
.class = r
->class;
2672 value
->un
.du
.sign
= r
->sign
;
2679 value
->un
.du
.exp
= r
->exp
;
2682 memcpy (value
->un
.du
.sig
, r
->sig
, sizeof (r
->sig
));
2690 value
->un
.di
.low
= CONST_DOUBLE_LOW (x
);
2691 value
->un
.di
.high
= CONST_DOUBLE_HIGH (x
);
2699 units
= CONST_VECTOR_NUNITS (x
);
2700 value
->kind
= RTX_VECTOR
;
2703 if (GET_MODE_CLASS (mode
) == MODE_VECTOR_INT
)
2705 for (i
= 0; i
< units
; ++i
)
2707 rtx elt
= CONST_VECTOR_ELT (x
, i
);
2708 if (GET_CODE (elt
) == CONST_INT
)
2710 value
->un
.int_vec
[i
].low
= INTVAL (elt
);
2711 value
->un
.int_vec
[i
].high
= 0;
2715 value
->un
.int_vec
[i
].low
= CONST_DOUBLE_LOW (elt
);
2716 value
->un
.int_vec
[i
].high
= CONST_DOUBLE_HIGH (elt
);
2720 else if (GET_MODE_CLASS (mode
) == MODE_VECTOR_FLOAT
)
2722 for (i
= 0; i
< units
; ++i
)
2724 const REAL_VALUE_TYPE
*r
2725 = CONST_DOUBLE_REAL_VALUE (CONST_VECTOR_ELT (x
, i
));
2726 REAL_VALUE_TYPE
*d
= &value
->un
.fp_vec
[i
];
2728 /* Copy the REAL_VALUE_TYPE by members so that we don't
2729 copy garbage from the original structure into our
2730 carefully cleaned hashing structure. */
2731 d
->class = r
->class;
2742 memcpy (d
->sig
, r
->sig
, sizeof (r
->sig
));
2755 value
->un
.addr
.offset
= INTVAL (x
);
2761 value
->un
.addr
.base
= x
;
2766 if (GET_CODE (x
) == PLUS
&& GET_CODE (XEXP (x
, 1)) == CONST_INT
)
2768 value
->un
.addr
.base
= XEXP (x
, 0);
2769 value
->un
.addr
.offset
= INTVAL (XEXP (x
, 1));
2771 else if (GET_CODE (x
) == MINUS
&& GET_CODE (XEXP (x
, 1)) == CONST_INT
)
2773 value
->un
.addr
.base
= XEXP (x
, 0);
2774 value
->un
.addr
.offset
= - INTVAL (XEXP (x
, 1));
2778 value
->un
.addr
.base
= x
;
2779 value
->un
.addr
.offset
= 0;
2784 value
->kind
= RTX_UNKNOWN
;
2788 if (value
->kind
== RTX_INT
&& value
->un
.addr
.base
!= 0
2789 && GET_CODE (value
->un
.addr
.base
) == UNSPEC
)
2791 /* For a simple UNSPEC, the base is set to the
2792 operand, the kind field is set to the index of
2793 the unspec expression.
2794 Together with the code below, in case that
2795 the operand is a SYMBOL_REF or LABEL_REF,
2796 the address of the string or the code_label
2797 is taken as base. */
2798 if (XVECLEN (value
->un
.addr
.base
, 0) == 1)
2800 value
->kind
= RTX_UNSPEC
+ XINT (value
->un
.addr
.base
, 1);
2801 value
->un
.addr
.base
= XVECEXP (value
->un
.addr
.base
, 0, 0);
2805 if (value
->kind
>= RTX_INT
&& value
->un
.addr
.base
!= 0)
2806 switch (GET_CODE (value
->un
.addr
.base
))
2809 /* Use the string's address, not the SYMBOL_REF's address,
2810 for the sake of addresses of library routines. */
2811 value
->un
.addr
.symbol
= XSTR (value
->un
.addr
.base
, 0);
2812 value
->un
.addr
.base
= NULL_RTX
;
2816 /* For a LABEL_REF, compare labels. */
2817 value
->un
.addr
.base
= XEXP (value
->un
.addr
.base
, 0);
2824 /* Given a MINUS expression, simplify it if both sides
2825 include the same symbol. */
2828 simplify_subtraction (rtx x
)
2830 struct rtx_const val0
, val1
;
2832 decode_rtx_const (GET_MODE (x
), XEXP (x
, 0), &val0
);
2833 decode_rtx_const (GET_MODE (x
), XEXP (x
, 1), &val1
);
2835 if (val0
.kind
>= RTX_INT
2836 && val0
.kind
== val1
.kind
2837 && val0
.un
.addr
.base
== val1
.un
.addr
.base
2838 && val0
.un
.addr
.symbol
== val1
.un
.addr
.symbol
)
2839 return GEN_INT (val0
.un
.addr
.offset
- val1
.un
.addr
.offset
);
2844 /* Compute a hash code for a constant RTL expression. */
2847 const_hash_rtx (enum machine_mode mode
, rtx x
)
2850 struct rtx_const value
;
2851 unsigned int data
[sizeof(struct rtx_const
) / sizeof (unsigned int)];
2857 decode_rtx_const (mode
, x
, &u
.value
);
2859 /* Compute hashing function. */
2861 for (i
= 0; i
< ARRAY_SIZE (u
.data
); i
++)
2862 hi
= hi
* 613 + u
.data
[i
];
2864 return hi
% MAX_RTX_HASH_TABLE
;
2867 /* Compare a constant rtl object X with a constant-descriptor DESC.
2868 Return 1 if DESC describes a constant with the same value as X. */
2871 compare_constant_rtx (enum machine_mode mode
, rtx x
,
2872 struct constant_descriptor_rtx
*desc
)
2874 struct rtx_const value
;
2876 decode_rtx_const (mode
, x
, &value
);
2878 /* Compare constant contents. */
2879 return memcmp (&value
, &desc
->value
, sizeof (struct rtx_const
)) == 0;
2882 /* Construct a constant descriptor for the rtl-expression X.
2883 It is up to the caller to enter the descriptor in the hash table. */
2885 static struct constant_descriptor_rtx
*
2886 record_constant_rtx (enum machine_mode mode
, rtx x
)
2888 struct constant_descriptor_rtx
*ptr
;
2890 ptr
= ggc_alloc (sizeof (*ptr
));
2891 decode_rtx_const (mode
, x
, &ptr
->value
);
2896 /* Given a constant rtx X, make (or find) a memory constant for its value
2897 and return a MEM rtx to refer to it in memory. */
2900 force_const_mem (enum machine_mode mode
, rtx x
)
2903 struct constant_descriptor_rtx
*desc
;
2906 struct pool_constant
*pool
;
2909 /* If we're not allowed to drop X into the constant pool, don't. */
2910 if ((*targetm
.cannot_force_const_mem
) (x
))
2913 /* Compute hash code of X. Search the descriptors for that hash code
2914 to see if any of them describes X. If yes, we have an rtx to use. */
2915 hash
= const_hash_rtx (mode
, x
);
2916 for (desc
= const_rtx_hash_table
[hash
]; desc
; desc
= desc
->next
)
2917 if (compare_constant_rtx (mode
, x
, desc
))
2918 return copy_rtx (desc
->rtl
);
2920 /* No constant equal to X is known to have been output.
2921 Make a constant descriptor to enter X in the hash table
2922 and make a MEM for it. */
2923 desc
= record_constant_rtx (mode
, x
);
2924 desc
->next
= const_rtx_hash_table
[hash
];
2925 const_rtx_hash_table
[hash
] = desc
;
2927 /* Align the location counter as required by EXP's data type. */
2928 align
= GET_MODE_ALIGNMENT (mode
== VOIDmode
? word_mode
: mode
);
2929 #ifdef CONSTANT_ALIGNMENT
2931 tree type
= (*lang_hooks
.types
.type_for_mode
) (mode
, 0);
2932 if (type
!= NULL_TREE
)
2933 align
= CONSTANT_ALIGNMENT (make_tree (type
, x
), align
);
2937 pool_offset
+= (align
/ BITS_PER_UNIT
) - 1;
2938 pool_offset
&= ~ ((align
/ BITS_PER_UNIT
) - 1);
2940 if (GET_CODE (x
) == LABEL_REF
)
2941 LABEL_PRESERVE_P (XEXP (x
, 0)) = 1;
2943 /* Allocate a pool constant descriptor, fill it in, and chain it in. */
2944 pool
= ggc_alloc (sizeof (struct pool_constant
));
2948 pool
->labelno
= const_labelno
;
2949 pool
->align
= align
;
2950 pool
->offset
= pool_offset
;
2957 last_pool
->next
= pool
;
2960 pool_offset
+= GET_MODE_SIZE (mode
);
2962 /* Create a string containing the label name, in LABEL. */
2963 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
2967 /* Construct the SYMBOL_REF and the MEM. */
2969 symbol
= gen_rtx_SYMBOL_REF (Pmode
, ggc_strdup (label
));
2970 SYMBOL_REF_FLAGS (symbol
) = SYMBOL_FLAG_LOCAL
;
2972 pool
->desc
->rtl
= def
= gen_rtx_MEM (mode
, symbol
);
2973 set_mem_attributes (def
, (*lang_hooks
.types
.type_for_mode
) (mode
, 0), 1);
2974 RTX_UNCHANGING_P (def
) = 1;
2976 /* Add label to symbol hash table. */
2977 hash
= SYMHASH (XSTR (symbol
, 0));
2978 pool
->next_sym
= const_rtx_sym_hash_table
[hash
];
2979 const_rtx_sym_hash_table
[hash
] = pool
;
2981 /* Mark the symbol_ref as belonging to this constants pool. */
2982 CONSTANT_POOL_ADDRESS_P (symbol
) = 1;
2983 SYMBOL_REF_FLAGS (symbol
) = SYMBOL_FLAG_LOCAL
;
2984 current_function_uses_const_pool
= 1;
2986 return copy_rtx (def
);
2989 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
2990 the corresponding pool_constant structure. */
2992 static struct pool_constant
*
2993 find_pool_constant (struct function
*f
, rtx addr
)
2995 struct pool_constant
*pool
;
2996 const char *label
= XSTR (addr
, 0);
2998 for (pool
= f
->varasm
->x_const_rtx_sym_hash_table
[SYMHASH (label
)]; pool
;
2999 pool
= pool
->next_sym
)
3000 if (XSTR (XEXP (pool
->desc
->rtl
, 0), 0) == label
)
3006 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
3009 get_pool_constant (rtx addr
)
3011 return (find_pool_constant (cfun
, addr
))->constant
;
3014 /* Given a constant pool SYMBOL_REF, return the corresponding constant
3015 and whether it has been output or not. */
3018 get_pool_constant_mark (rtx addr
, bool *pmarked
)
3020 struct pool_constant
*pool
= find_pool_constant (cfun
, addr
);
3021 *pmarked
= (pool
->mark
!= 0);
3022 return pool
->constant
;
3025 /* Likewise, but for the constant pool of a specific function. */
3028 get_pool_constant_for_function (struct function
*f
, rtx addr
)
3030 return (find_pool_constant (f
, addr
))->constant
;
3033 /* Similar, return the mode. */
3036 get_pool_mode (rtx addr
)
3038 return (find_pool_constant (cfun
, addr
))->mode
;
3042 get_pool_mode_for_function (struct function
*f
, rtx addr
)
3044 return (find_pool_constant (f
, addr
))->mode
;
3047 /* Similar, return the offset in the constant pool. */
3050 get_pool_offset (rtx addr
)
3052 return (find_pool_constant (cfun
, addr
))->offset
;
3055 /* Return the size of the constant pool. */
3058 get_pool_size (void)
3063 /* Write all the constants in the constant pool. */
3066 output_constant_pool (const char *fnname ATTRIBUTE_UNUSED
,
3067 tree fndecl ATTRIBUTE_UNUSED
)
3069 struct pool_constant
*pool
;
3073 /* It is possible for gcc to call force_const_mem and then to later
3074 discard the instructions which refer to the constant. In such a
3075 case we do not need to output the constant. */
3076 mark_constant_pool ();
3078 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3079 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3082 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3091 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3092 whose CODE_LABEL has been deleted. This can occur if a jump table
3093 is eliminated by optimization. If so, write a constant of zero
3094 instead. Note that this can also happen by turning the
3095 CODE_LABEL into a NOTE. */
3096 /* ??? This seems completely and utterly wrong. Certainly it's
3097 not true for NOTE_INSN_DELETED_LABEL, but I disbelieve proper
3098 functioning even with INSN_DELETED_P and friends. */
3101 switch (GET_CODE (x
))
3104 if (GET_CODE (XEXP (x
, 0)) != PLUS
3105 || GET_CODE (XEXP (XEXP (x
, 0), 0)) != LABEL_REF
)
3107 tmp
= XEXP (XEXP (x
, 0), 0);
3112 if (INSN_DELETED_P (tmp
)
3113 || (GET_CODE (tmp
) == NOTE
3114 && NOTE_LINE_NUMBER (tmp
) == NOTE_INSN_DELETED
))
3125 /* First switch to correct section. */
3126 (*targetm
.asm_out
.select_rtx_section
) (pool
->mode
, x
, pool
->align
);
3128 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3129 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file
, x
, pool
->mode
,
3130 pool
->align
, pool
->labelno
, done
);
3133 assemble_align (pool
->align
);
3135 /* Output the label. */
3136 (*targetm
.asm_out
.internal_label
) (asm_out_file
, "LC", pool
->labelno
);
3138 /* Output the value of the constant itself. */
3139 switch (GET_MODE_CLASS (pool
->mode
))
3142 if (GET_CODE (x
) != CONST_DOUBLE
)
3145 REAL_VALUE_FROM_CONST_DOUBLE (r
, x
);
3146 assemble_real (r
, pool
->mode
, pool
->align
);
3150 case MODE_PARTIAL_INT
:
3151 assemble_integer (x
, GET_MODE_SIZE (pool
->mode
), pool
->align
, 1);
3154 case MODE_VECTOR_FLOAT
:
3159 if (GET_CODE (x
) != CONST_VECTOR
)
3162 units
= CONST_VECTOR_NUNITS (x
);
3164 for (i
= 0; i
< units
; i
++)
3166 elt
= CONST_VECTOR_ELT (x
, i
);
3167 REAL_VALUE_FROM_CONST_DOUBLE (r
, elt
);
3168 assemble_real (r
, GET_MODE_INNER (pool
->mode
), pool
->align
);
3173 case MODE_VECTOR_INT
:
3178 if (GET_CODE (x
) != CONST_VECTOR
)
3181 units
= CONST_VECTOR_NUNITS (x
);
3183 for (i
= 0; i
< units
; i
++)
3185 elt
= CONST_VECTOR_ELT (x
, i
);
3186 assemble_integer (elt
, GET_MODE_UNIT_SIZE (pool
->mode
),
3196 /* Make sure all constants in SECTION_MERGE and not SECTION_STRINGS
3197 sections have proper size. */
3198 if (pool
->align
> GET_MODE_BITSIZE (pool
->mode
)
3199 && in_section
== in_named
3200 && get_named_section_flags (in_named_name
) & SECTION_MERGE
)
3201 assemble_align (pool
->align
);
3203 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3208 #ifdef ASM_OUTPUT_POOL_EPILOGUE
3209 ASM_OUTPUT_POOL_EPILOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3212 /* Done with this pool. */
3213 first_pool
= last_pool
= 0;
3216 /* Look through the instructions for this function, and mark all the
3217 entries in the constant pool which are actually being used. Emit
3218 deferred constants which have indeed been used. */
3221 mark_constant_pool (void)
3225 struct pool_constant
*pool
;
3227 if (first_pool
== 0 && n_deferred_constants
== 0)
3230 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3233 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
3235 mark_constants (PATTERN (insn
));
3237 for (link
= current_function_epilogue_delay_list
;
3239 link
= XEXP (link
, 1))
3241 insn
= XEXP (link
, 0);
3244 mark_constants (PATTERN (insn
));
3248 /* Look through appropriate parts of X, marking all entries in the
3249 constant pool which are actually being used. Entries that are only
3250 referenced by other constants are also marked as used. Emit
3251 deferred strings that are used. */
3254 mark_constants (rtx x
)
3257 const char *format_ptr
;
3262 if (GET_CODE (x
) == SYMBOL_REF
)
3264 mark_constant (&x
, NULL
);
3268 /* Insns may appear inside a SEQUENCE. Only check the patterns of
3269 insns, not any notes that may be attached. We don't want to mark
3270 a constant just because it happens to appear in a REG_EQUIV note. */
3273 mark_constants (PATTERN (x
));
3277 format_ptr
= GET_RTX_FORMAT (GET_CODE (x
));
3279 for (i
= 0; i
< GET_RTX_LENGTH (GET_CODE (x
)); i
++)
3281 switch (*format_ptr
++)
3284 mark_constants (XEXP (x
, i
));
3288 if (XVEC (x
, i
) != 0)
3292 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
3293 mark_constants (XVECEXP (x
, i
, j
));
3313 /* Given a SYMBOL_REF CURRENT_RTX, mark it and all constants it refers
3314 to as used. Emit referenced deferred strings. This function can
3315 be used with for_each_rtx to mark all SYMBOL_REFs in an rtx. */
3318 mark_constant (rtx
*current_rtx
, void *data ATTRIBUTE_UNUSED
)
3320 rtx x
= *current_rtx
;
3325 else if (GET_CODE (x
) == SYMBOL_REF
)
3327 if (CONSTANT_POOL_ADDRESS_P (x
))
3329 struct pool_constant
*pool
= find_pool_constant (cfun
, x
);
3330 if (pool
->mark
== 0)
3333 for_each_rtx (&(pool
->constant
), &mark_constant
, NULL
);
3338 else if (TREE_CONSTANT_POOL_ADDRESS_P (x
))
3340 tree exp
= SYMBOL_REF_DECL (x
);
3341 if (!TREE_ASM_WRITTEN (exp
))
3343 n_deferred_constants
--;
3344 output_constant_def_contents (x
);
3351 /* Determine what kind of relocations EXP may need. */
3354 compute_reloc_for_constant (tree exp
)
3356 int reloc
= 0, reloc2
;
3359 /* Give the front-end a chance to convert VALUE to something that
3360 looks more like a constant to the back-end. */
3361 exp
= (*lang_hooks
.expand_constant
) (exp
);
3363 switch (TREE_CODE (exp
))
3367 /* Go inside any operations that get_inner_reference can handle and see
3368 if what's inside is a constant: no need to do anything here for
3369 addresses of variables or functions. */
3370 for (tem
= TREE_OPERAND (exp
, 0); handled_component_p (tem
);
3371 tem
= TREE_OPERAND (tem
, 0))
3374 if (TREE_PUBLIC (tem
))
3381 reloc
= compute_reloc_for_constant (TREE_OPERAND (exp
, 0));
3382 reloc
|= compute_reloc_for_constant (TREE_OPERAND (exp
, 1));
3386 reloc
= compute_reloc_for_constant (TREE_OPERAND (exp
, 0));
3387 reloc2
= compute_reloc_for_constant (TREE_OPERAND (exp
, 1));
3388 /* The difference of two local labels is computable at link time. */
3389 if (reloc
== 1 && reloc2
== 1)
3397 case NON_LVALUE_EXPR
:
3398 reloc
= compute_reloc_for_constant (TREE_OPERAND (exp
, 0));
3402 for (tem
= CONSTRUCTOR_ELTS (exp
); tem
; tem
= TREE_CHAIN (tem
))
3403 if (TREE_VALUE (tem
) != 0)
3404 reloc
|= compute_reloc_for_constant (TREE_VALUE (tem
));
3414 /* Find all the constants whose addresses are referenced inside of EXP,
3415 and make sure assembler code with a label has been output for each one.
3416 Indicate whether an ADDR_EXPR has been encountered. */
3419 output_addressed_constants (tree exp
)
3423 /* Give the front-end a chance to convert VALUE to something that
3424 looks more like a constant to the back-end. */
3425 exp
= (*lang_hooks
.expand_constant
) (exp
);
3427 switch (TREE_CODE (exp
))
3431 /* Go inside any operations that get_inner_reference can handle and see
3432 if what's inside is a constant: no need to do anything here for
3433 addresses of variables or functions. */
3434 for (tem
= TREE_OPERAND (exp
, 0); handled_component_p (tem
);
3435 tem
= TREE_OPERAND (tem
, 0))
3438 if (TREE_CODE_CLASS (TREE_CODE (tem
)) == 'c'
3439 || TREE_CODE (tem
) == CONSTRUCTOR
)
3440 output_constant_def (tem
, 0);
3445 output_addressed_constants (TREE_OPERAND (exp
, 1));
3450 case NON_LVALUE_EXPR
:
3451 output_addressed_constants (TREE_OPERAND (exp
, 0));
3455 for (tem
= CONSTRUCTOR_ELTS (exp
); tem
; tem
= TREE_CHAIN (tem
))
3456 if (TREE_VALUE (tem
) != 0)
3457 output_addressed_constants (TREE_VALUE (tem
));
3466 /* Return nonzero if VALUE is a valid constant-valued expression
3467 for use in initializing a static variable; one that can be an
3468 element of a "constant" initializer.
3470 Return null_pointer_node if the value is absolute;
3471 if it is relocatable, return the variable that determines the relocation.
3472 We assume that VALUE has been folded as much as possible;
3473 therefore, we do not need to check for such things as
3474 arithmetic-combinations of integers. */
3477 initializer_constant_valid_p (tree value
, tree endtype
)
3479 /* Give the front-end a chance to convert VALUE to something that
3480 looks more like a constant to the back-end. */
3481 value
= (*lang_hooks
.expand_constant
) (value
);
3483 switch (TREE_CODE (value
))
3486 if ((TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
3487 || TREE_CODE (TREE_TYPE (value
)) == RECORD_TYPE
)
3488 && TREE_CONSTANT (value
)
3489 && CONSTRUCTOR_ELTS (value
))
3492 bool absolute
= true;
3494 for (elt
= CONSTRUCTOR_ELTS (value
); elt
; elt
= TREE_CHAIN (elt
))
3497 value
= TREE_VALUE (elt
);
3498 reloc
= initializer_constant_valid_p (value
, TREE_TYPE (value
));
3501 if (reloc
!= null_pointer_node
)
3504 /* For a non-absolute relocation, there is no single
3505 variable that can be "the variable that determines the
3507 return absolute
? null_pointer_node
: error_mark_node
;
3510 return TREE_STATIC (value
) ? null_pointer_node
: NULL_TREE
;
3517 return null_pointer_node
;
3521 return staticp (TREE_OPERAND (value
, 0)) ? TREE_OPERAND (value
, 0) : 0;
3523 case VIEW_CONVERT_EXPR
:
3524 case NON_LVALUE_EXPR
:
3525 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3529 /* Allow conversions between pointer types. */
3530 if (POINTER_TYPE_P (TREE_TYPE (value
))
3531 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3532 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3534 /* Allow conversions between real types. */
3535 if (FLOAT_TYPE_P (TREE_TYPE (value
))
3536 && FLOAT_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3537 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3539 /* Allow length-preserving conversions between integer types. */
3540 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
3541 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
3542 && (TYPE_PRECISION (TREE_TYPE (value
))
3543 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
3544 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3546 /* Allow conversions between other integer types only if
3548 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
3549 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3551 tree inner
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3553 if (inner
== null_pointer_node
)
3554 return null_pointer_node
;
3558 /* Allow (int) &foo provided int is as wide as a pointer. */
3559 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
3560 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
3561 && (TYPE_PRECISION (TREE_TYPE (value
))
3562 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
3563 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3566 /* Likewise conversions from int to pointers, but also allow
3567 conversions from 0. */
3568 if (POINTER_TYPE_P (TREE_TYPE (value
))
3569 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3571 if (integer_zerop (TREE_OPERAND (value
, 0)))
3572 return null_pointer_node
;
3573 else if (TYPE_PRECISION (TREE_TYPE (value
))
3574 <= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0))))
3575 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3579 /* Allow conversions to union types if the value inside is okay. */
3580 if (TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
)
3581 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3586 if (! INTEGRAL_TYPE_P (endtype
)
3587 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
3589 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3591 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
3593 /* If either term is absolute, use the other terms relocation. */
3594 if (valid0
== null_pointer_node
)
3596 if (valid1
== null_pointer_node
)
3602 if (! INTEGRAL_TYPE_P (endtype
)
3603 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
3605 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3607 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
3609 /* Win if second argument is absolute. */
3610 if (valid1
== null_pointer_node
)
3612 /* Win if both arguments have the same relocation.
3613 Then the value is absolute. */
3614 if (valid0
== valid1
&& valid0
!= 0)
3615 return null_pointer_node
;
3617 /* Since GCC guarantees that string constants are unique in the
3618 generated code, a subtraction between two copies of the same
3619 constant string is absolute. */
3620 if (valid0
&& TREE_CODE (valid0
) == STRING_CST
&&
3621 valid1
&& TREE_CODE (valid1
) == STRING_CST
&&
3622 TREE_STRING_POINTER (valid0
) == TREE_STRING_POINTER (valid1
))
3623 return null_pointer_node
;
3626 /* Support differences between labels. */
3627 if (INTEGRAL_TYPE_P (endtype
))
3630 op0
= TREE_OPERAND (value
, 0);
3631 op1
= TREE_OPERAND (value
, 1);
3633 /* Like STRIP_NOPS except allow the operand mode to widen.
3634 This works around a feature of fold that simplifies
3635 (int)(p1 - p2) to ((int)p1 - (int)p2) under the theory
3636 that the narrower operation is cheaper. */
3638 while (TREE_CODE (op0
) == NOP_EXPR
3639 || TREE_CODE (op0
) == CONVERT_EXPR
3640 || TREE_CODE (op0
) == NON_LVALUE_EXPR
)
3642 tree inner
= TREE_OPERAND (op0
, 0);
3643 if (inner
== error_mark_node
3644 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner
)))
3645 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op0
)))
3646 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner
)))))
3651 while (TREE_CODE (op1
) == NOP_EXPR
3652 || TREE_CODE (op1
) == CONVERT_EXPR
3653 || TREE_CODE (op1
) == NON_LVALUE_EXPR
)
3655 tree inner
= TREE_OPERAND (op1
, 0);
3656 if (inner
== error_mark_node
3657 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner
)))
3658 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op1
)))
3659 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner
)))))
3664 if (TREE_CODE (op0
) == ADDR_EXPR
3665 && TREE_CODE (TREE_OPERAND (op0
, 0)) == LABEL_DECL
3666 && TREE_CODE (op1
) == ADDR_EXPR
3667 && TREE_CODE (TREE_OPERAND (op1
, 0)) == LABEL_DECL
)
3668 return null_pointer_node
;
3679 /* Output assembler code for constant EXP to FILE, with no label.
3680 This includes the pseudo-op such as ".int" or ".byte", and a newline.
3681 Assumes output_addressed_constants has been done on EXP already.
3683 Generate exactly SIZE bytes of assembler data, padding at the end
3684 with zeros if necessary. SIZE must always be specified.
3686 SIZE is important for structure constructors,
3687 since trailing members may have been omitted from the constructor.
3688 It is also important for initialization of arrays from string constants
3689 since the full length of the string constant might not be wanted.
3690 It is also needed for initialization of unions, where the initializer's
3691 type is just one member, and that may not be as long as the union.
3693 There a case in which we would fail to output exactly SIZE bytes:
3694 for a structure constructor that wants to produce more than SIZE bytes.
3695 But such constructors will never be generated for any possible input.
3697 ALIGN is the alignment of the data in bits. */
3700 output_constant (tree exp
, unsigned HOST_WIDE_INT size
, unsigned int align
)
3702 enum tree_code code
;
3703 unsigned HOST_WIDE_INT thissize
;
3705 /* Some front-ends use constants other than the standard language-independent
3706 varieties, but which may still be output directly. Give the front-end a
3707 chance to convert EXP to a language-independent representation. */
3708 exp
= (*lang_hooks
.expand_constant
) (exp
);
3710 if (size
== 0 || flag_syntax_only
)
3713 /* Eliminate any conversions since we'll be outputting the underlying
3715 while (TREE_CODE (exp
) == NOP_EXPR
|| TREE_CODE (exp
) == CONVERT_EXPR
3716 || TREE_CODE (exp
) == NON_LVALUE_EXPR
3717 || TREE_CODE (exp
) == VIEW_CONVERT_EXPR
)
3718 exp
= TREE_OPERAND (exp
, 0);
3720 code
= TREE_CODE (TREE_TYPE (exp
));
3721 thissize
= int_size_in_bytes (TREE_TYPE (exp
));
3723 /* Allow a constructor with no elements for any data type.
3724 This means to fill the space with zeros. */
3725 if (TREE_CODE (exp
) == CONSTRUCTOR
&& CONSTRUCTOR_ELTS (exp
) == 0)
3727 assemble_zeros (size
);
3731 if (TREE_CODE (exp
) == FDESC_EXPR
)
3733 #ifdef ASM_OUTPUT_FDESC
3734 HOST_WIDE_INT part
= tree_low_cst (TREE_OPERAND (exp
, 1), 0);
3735 tree decl
= TREE_OPERAND (exp
, 0);
3736 ASM_OUTPUT_FDESC (asm_out_file
, decl
, part
);
3743 /* Now output the underlying data. If we've handling the padding, return.
3744 Otherwise, break and ensure THISSIZE is the size written. */
3752 case REFERENCE_TYPE
:
3754 if (! assemble_integer (expand_expr (exp
, NULL_RTX
, VOIDmode
,
3755 EXPAND_INITIALIZER
),
3757 error ("initializer for integer value is too complicated");
3761 if (TREE_CODE (exp
) != REAL_CST
)
3762 error ("initializer for floating value is not a floating constant");
3764 assemble_real (TREE_REAL_CST (exp
), TYPE_MODE (TREE_TYPE (exp
)), align
);
3768 output_constant (TREE_REALPART (exp
), thissize
/ 2, align
);
3769 output_constant (TREE_IMAGPART (exp
), thissize
/ 2,
3770 min_align (align
, BITS_PER_UNIT
* (thissize
/ 2)));
3775 if (TREE_CODE (exp
) == CONSTRUCTOR
)
3777 output_constructor (exp
, size
, align
);
3780 else if (TREE_CODE (exp
) == STRING_CST
)
3782 thissize
= MIN ((unsigned HOST_WIDE_INT
)TREE_STRING_LENGTH (exp
),
3784 assemble_string (TREE_STRING_POINTER (exp
), thissize
);
3786 else if (TREE_CODE (exp
) == VECTOR_CST
)
3790 unsigned int nalign
;
3791 enum machine_mode inner
;
3793 inner
= GET_MODE_INNER (TYPE_MODE (TREE_TYPE (exp
)));
3794 nalign
= MIN (align
, GET_MODE_ALIGNMENT (inner
));
3796 elt_size
= GET_MODE_UNIT_SIZE (TYPE_MODE (TREE_TYPE (exp
)));
3798 link
= TREE_VECTOR_CST_ELTS (exp
);
3799 output_constant (TREE_VALUE (link
), elt_size
, align
);
3800 while ((link
= TREE_CHAIN (link
)) != NULL
)
3801 output_constant (TREE_VALUE (link
), elt_size
, nalign
);
3809 if (TREE_CODE (exp
) == CONSTRUCTOR
)
3810 output_constructor (exp
, size
, align
);
3816 if (TREE_CODE (exp
) == INTEGER_CST
)
3817 assemble_integer (expand_expr (exp
, NULL_RTX
,
3818 VOIDmode
, EXPAND_INITIALIZER
),
3819 thissize
, align
, 1);
3820 else if (TREE_CODE (exp
) == CONSTRUCTOR
)
3822 unsigned char *buffer
= alloca (thissize
);
3823 if (get_set_constructor_bytes (exp
, buffer
, thissize
))
3825 assemble_string ((char *) buffer
, thissize
);
3828 error ("unknown set constructor type");
3838 if (size
> thissize
)
3839 assemble_zeros (size
- thissize
);
3843 /* Subroutine of output_constructor, used for computing the size of
3844 arrays of unspecified length. VAL must be a CONSTRUCTOR of an array
3845 type with an unspecified upper bound. */
3847 static unsigned HOST_WIDE_INT
3848 array_size_for_constructor (tree val
)
3852 /* This code used to attempt to handle string constants that are not
3853 arrays of single-bytes, but nothing else does, so there's no point in
3855 if (TREE_CODE (val
) == STRING_CST
)
3856 return TREE_STRING_LENGTH (val
);
3858 max_index
= NULL_TREE
;
3859 for (i
= CONSTRUCTOR_ELTS (val
); i
; i
= TREE_CHAIN (i
))
3861 tree index
= TREE_PURPOSE (i
);
3863 if (TREE_CODE (index
) == RANGE_EXPR
)
3864 index
= TREE_OPERAND (index
, 1);
3865 if (max_index
== NULL_TREE
|| tree_int_cst_lt (max_index
, index
))
3869 if (max_index
== NULL_TREE
)
3872 /* Compute the total number of array elements. */
3873 i
= size_binop (MINUS_EXPR
, convert (sizetype
, max_index
),
3875 TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (val
)))));
3876 i
= size_binop (PLUS_EXPR
, i
, convert (sizetype
, integer_one_node
));
3878 /* Multiply by the array element unit size to find number of bytes. */
3879 i
= size_binop (MULT_EXPR
, i
, TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (val
))));
3881 return tree_low_cst (i
, 1);
3884 /* Subroutine of output_constant, used for CONSTRUCTORs (aggregate constants).
3885 Generate at least SIZE bytes, padding if necessary. */
3888 output_constructor (tree exp
, unsigned HOST_WIDE_INT size
,
3891 tree type
= TREE_TYPE (exp
);
3892 tree link
, field
= 0;
3894 /* Number of bytes output or skipped so far.
3895 In other words, current position within the constructor. */
3896 HOST_WIDE_INT total_bytes
= 0;
3897 /* Nonzero means BYTE contains part of a byte, to be output. */
3898 int byte_buffer_in_use
= 0;
3901 if (HOST_BITS_PER_WIDE_INT
< BITS_PER_UNIT
)
3904 if (TREE_CODE (type
) == RECORD_TYPE
)
3905 field
= TYPE_FIELDS (type
);
3907 if (TREE_CODE (type
) == ARRAY_TYPE
3908 && TYPE_DOMAIN (type
) != 0)
3909 min_index
= TYPE_MIN_VALUE (TYPE_DOMAIN (type
));
3911 /* As LINK goes through the elements of the constant,
3912 FIELD goes through the structure fields, if the constant is a structure.
3913 if the constant is a union, then we override this,
3914 by getting the field from the TREE_LIST element.
3915 But the constant could also be an array. Then FIELD is zero.
3917 There is always a maximum of one element in the chain LINK for unions
3918 (even if the initializer in a source program incorrectly contains
3920 for (link
= CONSTRUCTOR_ELTS (exp
);
3922 link
= TREE_CHAIN (link
),
3923 field
= field
? TREE_CHAIN (field
) : 0)
3925 tree val
= TREE_VALUE (link
);
3928 /* The element in a union constructor specifies the proper field
3930 if ((TREE_CODE (type
) == RECORD_TYPE
|| TREE_CODE (type
) == UNION_TYPE
3931 || TREE_CODE (type
) == QUAL_UNION_TYPE
)
3932 && TREE_PURPOSE (link
) != 0)
3933 field
= TREE_PURPOSE (link
);
3935 else if (TREE_CODE (type
) == ARRAY_TYPE
)
3936 index
= TREE_PURPOSE (link
);
3938 #ifdef ASM_COMMENT_START
3939 if (field
&& flag_verbose_asm
)
3940 fprintf (asm_out_file
, "%s %s:\n",
3943 ? IDENTIFIER_POINTER (DECL_NAME (field
))
3947 /* Eliminate the marker that makes a cast not be an lvalue. */
3951 if (index
&& TREE_CODE (index
) == RANGE_EXPR
)
3953 unsigned HOST_WIDE_INT fieldsize
3954 = int_size_in_bytes (TREE_TYPE (type
));
3955 HOST_WIDE_INT lo_index
= tree_low_cst (TREE_OPERAND (index
, 0), 0);
3956 HOST_WIDE_INT hi_index
= tree_low_cst (TREE_OPERAND (index
, 1), 0);
3957 HOST_WIDE_INT index
;
3958 unsigned int align2
= min_align (align
, fieldsize
* BITS_PER_UNIT
);
3960 for (index
= lo_index
; index
<= hi_index
; index
++)
3962 /* Output the element's initial value. */
3964 assemble_zeros (fieldsize
);
3966 output_constant (val
, fieldsize
, align2
);
3968 /* Count its size. */
3969 total_bytes
+= fieldsize
;
3972 else if (field
== 0 || !DECL_BIT_FIELD (field
))
3974 /* An element that is not a bit-field. */
3976 unsigned HOST_WIDE_INT fieldsize
;
3977 /* Since this structure is static,
3978 we know the positions are constant. */
3979 HOST_WIDE_INT pos
= field
? int_byte_position (field
) : 0;
3980 unsigned int align2
;
3983 pos
= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (val
)), 1)
3984 * (tree_low_cst (index
, 0) - tree_low_cst (min_index
, 0)));
3986 /* Output any buffered-up bit-fields preceding this element. */
3987 if (byte_buffer_in_use
)
3989 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
3991 byte_buffer_in_use
= 0;
3994 /* Advance to offset of this element.
3995 Note no alignment needed in an array, since that is guaranteed
3996 if each element has the proper size. */
3997 if ((field
!= 0 || index
!= 0) && pos
!= total_bytes
)
3999 assemble_zeros (pos
- total_bytes
);
4003 /* Find the alignment of this element. */
4004 align2
= min_align (align
, BITS_PER_UNIT
* pos
);
4006 /* Determine size this element should occupy. */
4011 /* If this is an array with an unspecified upper bound,
4012 the initializer determines the size. */
4013 /* ??? This ought to only checked if DECL_SIZE_UNIT is NULL,
4014 but we cannot do this until the deprecated support for
4015 initializing zero-length array members is removed. */
4016 if (TREE_CODE (TREE_TYPE (field
)) == ARRAY_TYPE
4017 && TYPE_DOMAIN (TREE_TYPE (field
))
4018 && ! TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (field
))))
4020 fieldsize
= array_size_for_constructor (val
);
4021 /* Given a non-empty initialization, this field had
4023 if (fieldsize
!= 0 && TREE_CHAIN (field
) != NULL_TREE
)
4026 else if (DECL_SIZE_UNIT (field
))
4028 /* ??? This can't be right. If the decl size overflows
4029 a host integer we will silently emit no data. */
4030 if (host_integerp (DECL_SIZE_UNIT (field
), 1))
4031 fieldsize
= tree_low_cst (DECL_SIZE_UNIT (field
), 1);
4035 fieldsize
= int_size_in_bytes (TREE_TYPE (type
));
4037 /* Output the element's initial value. */
4039 assemble_zeros (fieldsize
);
4041 output_constant (val
, fieldsize
, align2
);
4043 /* Count its size. */
4044 total_bytes
+= fieldsize
;
4046 else if (val
!= 0 && TREE_CODE (val
) != INTEGER_CST
)
4047 error ("invalid initial value for member `%s'",
4048 IDENTIFIER_POINTER (DECL_NAME (field
)));
4051 /* Element that is a bit-field. */
4053 HOST_WIDE_INT next_offset
= int_bit_position (field
);
4054 HOST_WIDE_INT end_offset
4055 = (next_offset
+ tree_low_cst (DECL_SIZE (field
), 1));
4058 val
= integer_zero_node
;
4060 /* If this field does not start in this (or, next) byte,
4062 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4064 /* Output remnant of any bit field in previous bytes. */
4065 if (byte_buffer_in_use
)
4067 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4069 byte_buffer_in_use
= 0;
4072 /* If still not at proper byte, advance to there. */
4073 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4075 assemble_zeros (next_offset
/ BITS_PER_UNIT
- total_bytes
);
4076 total_bytes
= next_offset
/ BITS_PER_UNIT
;
4080 if (! byte_buffer_in_use
)
4083 /* We must split the element into pieces that fall within
4084 separate bytes, and combine each byte with previous or
4085 following bit-fields. */
4087 /* next_offset is the offset n fbits from the beginning of
4088 the structure to the next bit of this element to be processed.
4089 end_offset is the offset of the first bit past the end of
4091 while (next_offset
< end_offset
)
4095 HOST_WIDE_INT value
;
4096 HOST_WIDE_INT next_byte
= next_offset
/ BITS_PER_UNIT
;
4097 HOST_WIDE_INT next_bit
= next_offset
% BITS_PER_UNIT
;
4099 /* Advance from byte to byte
4100 within this element when necessary. */
4101 while (next_byte
!= total_bytes
)
4103 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4108 /* Number of bits we can process at once
4109 (all part of the same byte). */
4110 this_time
= MIN (end_offset
- next_offset
,
4111 BITS_PER_UNIT
- next_bit
);
4112 if (BYTES_BIG_ENDIAN
)
4114 /* On big-endian machine, take the most significant bits
4115 first (of the bits that are significant)
4116 and put them into bytes from the most significant end. */
4117 shift
= end_offset
- next_offset
- this_time
;
4119 /* Don't try to take a bunch of bits that cross
4120 the word boundary in the INTEGER_CST. We can
4121 only select bits from the LOW or HIGH part
4123 if (shift
< HOST_BITS_PER_WIDE_INT
4124 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4126 this_time
= shift
+ this_time
- HOST_BITS_PER_WIDE_INT
;
4127 shift
= HOST_BITS_PER_WIDE_INT
;
4130 /* Now get the bits from the appropriate constant word. */
4131 if (shift
< HOST_BITS_PER_WIDE_INT
)
4132 value
= TREE_INT_CST_LOW (val
);
4133 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4135 value
= TREE_INT_CST_HIGH (val
);
4136 shift
-= HOST_BITS_PER_WIDE_INT
;
4141 /* Get the result. This works only when:
4142 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4143 byte
|= (((value
>> shift
)
4144 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4145 << (BITS_PER_UNIT
- this_time
- next_bit
));
4149 /* On little-endian machines,
4150 take first the least significant bits of the value
4151 and pack them starting at the least significant
4152 bits of the bytes. */
4153 shift
= next_offset
- int_bit_position (field
);
4155 /* Don't try to take a bunch of bits that cross
4156 the word boundary in the INTEGER_CST. We can
4157 only select bits from the LOW or HIGH part
4159 if (shift
< HOST_BITS_PER_WIDE_INT
4160 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4161 this_time
= (HOST_BITS_PER_WIDE_INT
- shift
);
4163 /* Now get the bits from the appropriate constant word. */
4164 if (shift
< HOST_BITS_PER_WIDE_INT
)
4165 value
= TREE_INT_CST_LOW (val
);
4166 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4168 value
= TREE_INT_CST_HIGH (val
);
4169 shift
-= HOST_BITS_PER_WIDE_INT
;
4174 /* Get the result. This works only when:
4175 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4176 byte
|= (((value
>> shift
)
4177 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4181 next_offset
+= this_time
;
4182 byte_buffer_in_use
= 1;
4187 if (byte_buffer_in_use
)
4189 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4193 if ((unsigned HOST_WIDE_INT
)total_bytes
< size
)
4194 assemble_zeros (size
- total_bytes
);
4197 /* This TREE_LIST contains any weak symbol declarations waiting
4199 static GTY(()) tree weak_decls
;
4201 /* Mark DECL as weak. */
4204 mark_weak (tree decl
)
4206 DECL_WEAK (decl
) = 1;
4208 if (DECL_RTL_SET_P (decl
)
4209 && GET_CODE (DECL_RTL (decl
)) == MEM
4210 && XEXP (DECL_RTL (decl
), 0)
4211 && GET_CODE (XEXP (DECL_RTL (decl
), 0)) == SYMBOL_REF
)
4212 SYMBOL_REF_WEAK (XEXP (DECL_RTL (decl
), 0)) = 1;
4215 /* Merge weak status between NEWDECL and OLDDECL. */
4218 merge_weak (tree newdecl
, tree olddecl
)
4220 if (DECL_WEAK (newdecl
) == DECL_WEAK (olddecl
))
4223 if (DECL_WEAK (newdecl
))
4227 /* NEWDECL is weak, but OLDDECL is not. */
4229 /* If we already output the OLDDECL, we're in trouble; we can't
4230 go back and make it weak. This error cannot caught in
4231 declare_weak because the NEWDECL and OLDDECL was not yet
4232 been merged; therefore, TREE_ASM_WRITTEN was not set. */
4233 if (TREE_ASM_WRITTEN (olddecl
))
4234 error ("%Jweak declaration of '%D' must precede definition",
4237 /* If we've already generated rtl referencing OLDDECL, we may
4238 have done so in a way that will not function properly with
4240 else if (TREE_USED (olddecl
)
4241 && TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (olddecl
)))
4242 warning ("%Jweak declaration of '%D' after first use results "
4243 "in unspecified behavior", newdecl
, newdecl
);
4247 /* We put the NEWDECL on the weak_decls list at some point.
4248 Replace it with the OLDDECL. */
4249 for (wd
= weak_decls
; wd
; wd
= TREE_CHAIN (wd
))
4250 if (TREE_VALUE (wd
) == newdecl
)
4252 TREE_VALUE (wd
) = olddecl
;
4255 /* We may not find the entry on the list. If NEWDECL is a
4256 weak alias, then we will have already called
4257 globalize_decl to remove the entry; in that case, we do
4258 not need to do anything. */
4261 /* Make the OLDDECL weak; it's OLDDECL that we'll be keeping. */
4262 mark_weak (olddecl
);
4265 /* OLDDECL was weak, but NEWDECL was not explicitly marked as
4266 weak. Just update NEWDECL to indicate that it's weak too. */
4267 mark_weak (newdecl
);
4270 /* Declare DECL to be a weak symbol. */
4273 declare_weak (tree decl
)
4275 if (! TREE_PUBLIC (decl
))
4276 error ("%Jweak declaration of '%D' must be public", decl
, decl
);
4277 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& TREE_ASM_WRITTEN (decl
))
4278 error ("%Jweak declaration of '%D' must precede definition", decl
, decl
);
4279 else if (SUPPORTS_WEAK
)
4281 if (! DECL_WEAK (decl
))
4282 weak_decls
= tree_cons (NULL
, decl
, weak_decls
);
4285 warning ("%Jweak declaration of '%D' not supported", decl
, decl
);
4290 /* Emit any pending weak declarations. */
4297 for (t
= weak_decls
; t
; t
= TREE_CHAIN (t
))
4299 tree decl
= TREE_VALUE (t
);
4300 #if defined (ASM_WEAKEN_DECL) || defined (ASM_WEAKEN_LABEL)
4301 const char *const name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
4304 if (! TREE_USED (decl
))
4307 #ifdef ASM_WEAKEN_DECL
4308 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, NULL
);
4310 #ifdef ASM_WEAKEN_LABEL
4311 ASM_WEAKEN_LABEL (asm_out_file
, name
);
4313 #ifdef ASM_OUTPUT_WEAK_ALIAS
4314 warning ("only weak aliases are supported in this configuration");
4322 /* Emit the assembly bits to indicate that DECL is globally visible. */
4325 globalize_decl (tree decl
)
4327 const char *name
= XSTR (XEXP (DECL_RTL (decl
), 0), 0);
4329 #if defined (ASM_WEAKEN_LABEL) || defined (ASM_WEAKEN_DECL)
4330 if (DECL_WEAK (decl
))
4334 #ifdef ASM_WEAKEN_DECL
4335 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, 0);
4337 ASM_WEAKEN_LABEL (asm_out_file
, name
);
4340 /* Remove this function from the pending weak list so that
4341 we do not emit multiple .weak directives for it. */
4342 for (p
= &weak_decls
; (t
= *p
) ; )
4344 if (DECL_ASSEMBLER_NAME (decl
) == DECL_ASSEMBLER_NAME (TREE_VALUE (t
)))
4345 *p
= TREE_CHAIN (t
);
4347 p
= &TREE_CHAIN (t
);
4353 (*targetm
.asm_out
.globalize_label
) (asm_out_file
, name
);
4356 /* Emit an assembler directive to make the symbol for DECL an alias to
4357 the symbol for TARGET. */
4360 assemble_alias (tree decl
, tree target ATTRIBUTE_UNUSED
)
4364 /* We must force creation of DECL_RTL for debug info generation, even though
4365 we don't use it here. */
4366 make_decl_rtl (decl
, NULL
);
4368 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
4370 #ifdef ASM_OUTPUT_DEF
4371 /* Make name accessible from other files, if appropriate. */
4373 if (TREE_PUBLIC (decl
))
4375 globalize_decl (decl
);
4376 maybe_assemble_visibility (decl
);
4379 #ifdef ASM_OUTPUT_DEF_FROM_DECLS
4380 ASM_OUTPUT_DEF_FROM_DECLS (asm_out_file
, decl
, target
);
4382 ASM_OUTPUT_DEF (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4384 #else /* !ASM_OUTPUT_DEF */
4385 #if defined (ASM_OUTPUT_WEAK_ALIAS) || defined (ASM_WEAKEN_DECL)
4386 if (! DECL_WEAK (decl
))
4387 warning ("only weak aliases are supported in this configuration");
4389 #ifdef ASM_WEAKEN_DECL
4390 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, IDENTIFIER_POINTER (target
));
4392 ASM_OUTPUT_WEAK_ALIAS (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4395 warning ("alias definitions not supported in this configuration; ignored");
4399 TREE_USED (decl
) = 1;
4400 TREE_ASM_WRITTEN (decl
) = 1;
4401 TREE_ASM_WRITTEN (DECL_ASSEMBLER_NAME (decl
)) = 1;
4404 /* Emit an assembler directive to set symbol for DECL visibility to
4405 the visibility type VIS, which must not be VISIBILITY_DEFAULT. */
4408 default_assemble_visibility (tree decl
, int vis
)
4410 static const char * const visibility_types
[] = {
4411 NULL
, "internal", "hidden", "protected"
4414 const char *name
, *type
;
4416 name
= (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
4417 type
= visibility_types
[vis
];
4419 #ifdef HAVE_GAS_HIDDEN
4420 fprintf (asm_out_file
, "\t.%s\t", type
);
4421 assemble_name (asm_out_file
, name
);
4422 fprintf (asm_out_file
, "\n");
4424 warning ("visibility attribute not supported in this configuration; ignored");
4428 /* A helper function to call assemble_visibility when needed for a decl. */
4431 maybe_assemble_visibility (tree decl
)
4433 enum symbol_visibility vis
= decl_visibility (decl
);
4435 if (vis
!= VISIBILITY_DEFAULT
)
4436 (* targetm
.asm_out
.visibility
) (decl
, vis
);
4439 /* Returns 1 if the target configuration supports defining public symbols
4440 so that one of them will be chosen at link time instead of generating a
4441 multiply-defined symbol error, whether through the use of weak symbols or
4442 a target-specific mechanism for having duplicates discarded. */
4445 supports_one_only (void)
4447 if (SUPPORTS_ONE_ONLY
)
4449 return SUPPORTS_WEAK
;
4452 /* Set up DECL as a public symbol that can be defined in multiple
4453 translation units without generating a linker error. */
4456 make_decl_one_only (tree decl
)
4458 if (TREE_CODE (decl
) != VAR_DECL
&& TREE_CODE (decl
) != FUNCTION_DECL
)
4461 TREE_PUBLIC (decl
) = 1;
4463 if (TREE_CODE (decl
) == VAR_DECL
4464 && (DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
))
4465 DECL_COMMON (decl
) = 1;
4466 else if (SUPPORTS_ONE_ONLY
)
4468 #ifdef MAKE_DECL_ONE_ONLY
4469 MAKE_DECL_ONE_ONLY (decl
);
4471 DECL_ONE_ONLY (decl
) = 1;
4473 else if (SUPPORTS_WEAK
)
4474 DECL_WEAK (decl
) = 1;
4480 init_varasm_once (void)
4482 in_named_htab
= htab_create_ggc (31, in_named_entry_hash
,
4483 in_named_entry_eq
, NULL
);
4484 const_desc_htab
= htab_create_ggc (1009, const_desc_hash
,
4485 const_desc_eq
, NULL
);
4487 const_alias_set
= new_alias_set ();
4491 decl_tls_model (tree decl
)
4493 enum tls_model kind
;
4494 tree attr
= lookup_attribute ("tls_model", DECL_ATTRIBUTES (decl
));
4499 attr
= TREE_VALUE (TREE_VALUE (attr
));
4500 if (TREE_CODE (attr
) != STRING_CST
)
4502 if (!strcmp (TREE_STRING_POINTER (attr
), "local-exec"))
4503 kind
= TLS_MODEL_LOCAL_EXEC
;
4504 else if (!strcmp (TREE_STRING_POINTER (attr
), "initial-exec"))
4505 kind
= TLS_MODEL_INITIAL_EXEC
;
4506 else if (!strcmp (TREE_STRING_POINTER (attr
), "local-dynamic"))
4507 kind
= optimize
? TLS_MODEL_LOCAL_DYNAMIC
: TLS_MODEL_GLOBAL_DYNAMIC
;
4508 else if (!strcmp (TREE_STRING_POINTER (attr
), "global-dynamic"))
4509 kind
= TLS_MODEL_GLOBAL_DYNAMIC
;
4515 is_local
= (*targetm
.binds_local_p
) (decl
);
4519 kind
= TLS_MODEL_LOCAL_EXEC
;
4521 kind
= TLS_MODEL_INITIAL_EXEC
;
4523 /* Local dynamic is inefficient when we're not combining the
4524 parts of the address. */
4525 else if (optimize
&& is_local
)
4526 kind
= TLS_MODEL_LOCAL_DYNAMIC
;
4528 kind
= TLS_MODEL_GLOBAL_DYNAMIC
;
4529 if (kind
< flag_tls_default
)
4530 kind
= flag_tls_default
;
4535 enum symbol_visibility
4536 decl_visibility (tree decl
)
4538 tree attr
= lookup_attribute ("visibility", DECL_ATTRIBUTES (decl
));
4542 const char *which
= TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr
)));
4544 if (strcmp (which
, "default") == 0)
4545 return VISIBILITY_DEFAULT
;
4546 if (strcmp (which
, "internal") == 0)
4547 return VISIBILITY_INTERNAL
;
4548 if (strcmp (which
, "hidden") == 0)
4549 return VISIBILITY_HIDDEN
;
4550 if (strcmp (which
, "protected") == 0)
4551 return VISIBILITY_PROTECTED
;
4556 return VISIBILITY_DEFAULT
;
4559 /* Select a set of attributes for section NAME based on the properties
4560 of DECL and whether or not RELOC indicates that DECL's initializer
4561 might contain runtime relocations.
4563 We make the section read-only and executable for a function decl,
4564 read-only for a const data decl, and writable for a non-const data decl. */
4567 default_section_type_flags (tree decl
, const char *name
, int reloc
)
4569 return default_section_type_flags_1 (decl
, name
, reloc
, flag_pic
);
4573 default_section_type_flags_1 (tree decl
, const char *name
, int reloc
,
4578 if (decl
&& TREE_CODE (decl
) == FUNCTION_DECL
)
4579 flags
= SECTION_CODE
;
4580 else if (decl
&& decl_readonly_section_1 (decl
, reloc
, shlib
))
4583 flags
= SECTION_WRITE
;
4585 if (decl
&& DECL_ONE_ONLY (decl
))
4586 flags
|= SECTION_LINKONCE
;
4588 if (decl
&& TREE_CODE (decl
) == VAR_DECL
&& DECL_THREAD_LOCAL (decl
))
4589 flags
|= SECTION_TLS
| SECTION_WRITE
;
4591 if (strcmp (name
, ".bss") == 0
4592 || strncmp (name
, ".bss.", 5) == 0
4593 || strncmp (name
, ".gnu.linkonce.b.", 16) == 0
4594 || strcmp (name
, ".sbss") == 0
4595 || strncmp (name
, ".sbss.", 6) == 0
4596 || strncmp (name
, ".gnu.linkonce.sb.", 17) == 0
4597 || strcmp (name
, ".tbss") == 0
4598 || strncmp (name
, ".gnu.linkonce.tb.", 17) == 0)
4599 flags
|= SECTION_BSS
;
4601 if (strcmp (name
, ".tdata") == 0
4602 || strcmp (name
, ".tbss") == 0
4603 || strncmp (name
, ".gnu.linkonce.td.", 17) == 0
4604 || strncmp (name
, ".gnu.linkonce.tb.", 17) == 0)
4605 flags
|= SECTION_TLS
;
4607 /* These three sections have special ELF types. They are neither
4608 SHT_PROGBITS nor SHT_NOBITS, so when changing sections we don't
4609 want to print a section type (@progbits or @nobits). If someone
4610 is silly enough to emit code or TLS variables to one of these
4611 sections, then don't handle them specially. */
4612 if (!(flags
& (SECTION_CODE
| SECTION_BSS
| SECTION_TLS
))
4613 && (strcmp (name
, ".init_array") == 0
4614 || strcmp (name
, ".fini_array") == 0
4615 || strcmp (name
, ".preinit_array") == 0))
4616 flags
|= SECTION_NOTYPE
;
4621 /* Output assembly to switch to section NAME with attribute FLAGS.
4622 Four variants for common object file formats. */
4625 default_no_named_section (const char *name ATTRIBUTE_UNUSED
,
4626 unsigned int flags ATTRIBUTE_UNUSED
)
4628 /* Some object formats don't support named sections at all. The
4629 front-end should already have flagged this as an error. */
4634 default_elf_asm_named_section (const char *name
, unsigned int flags
)
4636 char flagchars
[10], *f
= flagchars
;
4638 if (! named_section_first_declaration (name
))
4640 fprintf (asm_out_file
, "\t.section\t%s\n", name
);
4644 if (!(flags
& SECTION_DEBUG
))
4646 if (flags
& SECTION_WRITE
)
4648 if (flags
& SECTION_CODE
)
4650 if (flags
& SECTION_SMALL
)
4652 if (flags
& SECTION_MERGE
)
4654 if (flags
& SECTION_STRINGS
)
4656 if (flags
& SECTION_TLS
)
4660 fprintf (asm_out_file
, "\t.section\t%s,\"%s\"", name
, flagchars
);
4662 if (!(flags
& SECTION_NOTYPE
))
4666 if (flags
& SECTION_BSS
)
4671 fprintf (asm_out_file
, ",@%s", type
);
4673 if (flags
& SECTION_ENTSIZE
)
4674 fprintf (asm_out_file
, ",%d", flags
& SECTION_ENTSIZE
);
4677 putc ('\n', asm_out_file
);
4681 default_coff_asm_named_section (const char *name
, unsigned int flags
)
4683 char flagchars
[8], *f
= flagchars
;
4685 if (flags
& SECTION_WRITE
)
4687 if (flags
& SECTION_CODE
)
4691 fprintf (asm_out_file
, "\t.section\t%s,\"%s\"\n", name
, flagchars
);
4695 default_pe_asm_named_section (const char *name
, unsigned int flags
)
4697 default_coff_asm_named_section (name
, flags
);
4699 if (flags
& SECTION_LINKONCE
)
4701 /* Functions may have been compiled at various levels of
4702 optimization so we can't use `same_size' here.
4703 Instead, have the linker pick one. */
4704 fprintf (asm_out_file
, "\t.linkonce %s\n",
4705 (flags
& SECTION_CODE
? "discard" : "same_size"));
4709 /* The lame default section selector. */
4712 default_select_section (tree decl
, int reloc
,
4713 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
)
4715 bool readonly
= false;
4719 if (decl_readonly_section (decl
, reloc
))
4722 else if (TREE_CODE (decl
) == CONSTRUCTOR
)
4724 if (! ((flag_pic
&& reloc
)
4725 || !TREE_READONLY (decl
)
4726 || TREE_SIDE_EFFECTS (decl
)
4727 || !TREE_CONSTANT (decl
)))
4730 else if (TREE_CODE (decl
) == STRING_CST
)
4731 readonly
= !flag_writable_strings
;
4732 else if (! (flag_pic
&& reloc
))
4736 readonly_data_section ();
4741 /* A helper function for default_elf_select_section and
4742 default_elf_unique_section. Categorizes the DECL. */
4744 enum section_category
4749 SECCAT_RODATA_MERGE_STR
,
4750 SECCAT_RODATA_MERGE_STR_INIT
,
4751 SECCAT_RODATA_MERGE_CONST
,
4756 /* To optimize loading of shared programs, define following subsections
4758 _REL Contains data that has relocations, so they get grouped
4759 together and dynamic linker will visit fewer pages in memory.
4760 _RO Contains data that is otherwise read-only. This is useful
4761 with prelinking as most relocations won't be dynamically
4762 linked and thus stay read only.
4763 _LOCAL Marks data containing relocations only to local objects.
4764 These relocations will get fully resolved by prelinking. */
4766 SECCAT_DATA_REL_LOCAL
,
4768 SECCAT_DATA_REL_RO_LOCAL
,
4778 static enum section_category
4779 categorize_decl_for_section (tree
, int, int);
4781 static enum section_category
4782 categorize_decl_for_section (tree decl
, int reloc
, int shlib
)
4784 enum section_category ret
;
4786 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4788 else if (TREE_CODE (decl
) == STRING_CST
)
4790 if (flag_writable_strings
)
4793 return SECCAT_RODATA_MERGE_STR
;
4795 else if (TREE_CODE (decl
) == VAR_DECL
)
4797 if (DECL_INITIAL (decl
) == NULL
4798 || DECL_INITIAL (decl
) == error_mark_node
)
4800 else if (! TREE_READONLY (decl
)
4801 || TREE_SIDE_EFFECTS (decl
)
4802 || ! TREE_CONSTANT (DECL_INITIAL (decl
)))
4804 if (shlib
&& (reloc
& 2))
4805 ret
= SECCAT_DATA_REL
;
4806 else if (shlib
&& reloc
)
4807 ret
= SECCAT_DATA_REL_LOCAL
;
4811 else if (shlib
&& (reloc
& 2))
4812 ret
= SECCAT_DATA_REL_RO
;
4813 else if (shlib
&& reloc
)
4814 ret
= SECCAT_DATA_REL_RO_LOCAL
;
4815 else if (reloc
|| flag_merge_constants
< 2)
4816 /* C and C++ don't allow different variables to share the same
4817 location. -fmerge-all-constants allows even that (at the
4818 expense of not conforming). */
4819 ret
= SECCAT_RODATA
;
4820 else if (TREE_CODE (DECL_INITIAL (decl
)) == STRING_CST
)
4821 ret
= SECCAT_RODATA_MERGE_STR_INIT
;
4823 ret
= SECCAT_RODATA_MERGE_CONST
;
4825 else if (TREE_CODE (decl
) == CONSTRUCTOR
)
4827 if ((shlib
&& reloc
)
4828 || TREE_SIDE_EFFECTS (decl
)
4829 || ! TREE_CONSTANT (decl
))
4832 ret
= SECCAT_RODATA
;
4835 ret
= SECCAT_RODATA
;
4837 /* There are no read-only thread-local sections. */
4838 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_THREAD_LOCAL (decl
))
4840 if (ret
== SECCAT_BSS
)
4846 /* If the target uses small data sections, select it. */
4847 else if ((*targetm
.in_small_data_p
) (decl
))
4849 if (ret
== SECCAT_BSS
)
4851 else if (targetm
.have_srodata_section
&& ret
== SECCAT_RODATA
)
4852 ret
= SECCAT_SRODATA
;
4861 decl_readonly_section (tree decl
, int reloc
)
4863 return decl_readonly_section_1 (decl
, reloc
, flag_pic
);
4867 decl_readonly_section_1 (tree decl
, int reloc
, int shlib
)
4869 switch (categorize_decl_for_section (decl
, reloc
, shlib
))
4872 case SECCAT_RODATA_MERGE_STR
:
4873 case SECCAT_RODATA_MERGE_STR_INIT
:
4874 case SECCAT_RODATA_MERGE_CONST
:
4875 case SECCAT_SRODATA
:
4884 /* Select a section based on the above categorization. */
4887 default_elf_select_section (tree decl
, int reloc
,
4888 unsigned HOST_WIDE_INT align
)
4890 default_elf_select_section_1 (decl
, reloc
, align
, flag_pic
);
4894 default_elf_select_section_1 (tree decl
, int reloc
,
4895 unsigned HOST_WIDE_INT align
, int shlib
)
4897 switch (categorize_decl_for_section (decl
, reloc
, shlib
))
4900 /* We're not supposed to be called on FUNCTION_DECLs. */
4903 readonly_data_section ();
4905 case SECCAT_RODATA_MERGE_STR
:
4906 mergeable_string_section (decl
, align
, 0);
4908 case SECCAT_RODATA_MERGE_STR_INIT
:
4909 mergeable_string_section (DECL_INITIAL (decl
), align
, 0);
4911 case SECCAT_RODATA_MERGE_CONST
:
4912 mergeable_constant_section (DECL_MODE (decl
), align
, 0);
4914 case SECCAT_SRODATA
:
4915 named_section (NULL_TREE
, ".sdata2", reloc
);
4920 case SECCAT_DATA_REL
:
4921 named_section (NULL_TREE
, ".data.rel", reloc
);
4923 case SECCAT_DATA_REL_LOCAL
:
4924 named_section (NULL_TREE
, ".data.rel.local", reloc
);
4926 case SECCAT_DATA_REL_RO
:
4927 named_section (NULL_TREE
, ".data.rel.ro", reloc
);
4929 case SECCAT_DATA_REL_RO_LOCAL
:
4930 named_section (NULL_TREE
, ".data.rel.ro.local", reloc
);
4933 named_section (NULL_TREE
, ".sdata", reloc
);
4936 named_section (NULL_TREE
, ".tdata", reloc
);
4939 #ifdef BSS_SECTION_ASM_OP
4942 named_section (NULL_TREE
, ".bss", reloc
);
4946 named_section (NULL_TREE
, ".sbss", reloc
);
4949 named_section (NULL_TREE
, ".tbss", reloc
);
4956 /* Construct a unique section name based on the decl name and the
4957 categorization performed above. */
4960 default_unique_section (tree decl
, int reloc
)
4962 default_unique_section_1 (decl
, reloc
, flag_pic
);
4966 default_unique_section_1 (tree decl
, int reloc
, int shlib
)
4968 bool one_only
= DECL_ONE_ONLY (decl
);
4969 const char *prefix
, *name
;
4973 switch (categorize_decl_for_section (decl
, reloc
, shlib
))
4976 prefix
= one_only
? ".gnu.linkonce.t." : ".text.";
4979 case SECCAT_RODATA_MERGE_STR
:
4980 case SECCAT_RODATA_MERGE_STR_INIT
:
4981 case SECCAT_RODATA_MERGE_CONST
:
4982 prefix
= one_only
? ".gnu.linkonce.r." : ".rodata.";
4984 case SECCAT_SRODATA
:
4985 prefix
= one_only
? ".gnu.linkonce.s2." : ".sdata2.";
4988 case SECCAT_DATA_REL
:
4989 case SECCAT_DATA_REL_LOCAL
:
4990 case SECCAT_DATA_REL_RO
:
4991 case SECCAT_DATA_REL_RO_LOCAL
:
4992 prefix
= one_only
? ".gnu.linkonce.d." : ".data.";
4995 prefix
= one_only
? ".gnu.linkonce.s." : ".sdata.";
4998 prefix
= one_only
? ".gnu.linkonce.b." : ".bss.";
5001 prefix
= one_only
? ".gnu.linkonce.sb." : ".sbss.";
5004 prefix
= one_only
? ".gnu.linkonce.td." : ".tdata.";
5007 prefix
= one_only
? ".gnu.linkonce.tb." : ".tbss.";
5012 plen
= strlen (prefix
);
5014 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
5015 name
= (* targetm
.strip_name_encoding
) (name
);
5016 nlen
= strlen (name
);
5018 string
= alloca (nlen
+ plen
+ 1);
5019 memcpy (string
, prefix
, plen
);
5020 memcpy (string
+ plen
, name
, nlen
+ 1);
5022 DECL_SECTION_NAME (decl
) = build_string (nlen
+ plen
, string
);
5026 default_select_rtx_section (enum machine_mode mode ATTRIBUTE_UNUSED
,
5028 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
)
5031 switch (GET_CODE (x
))
5043 readonly_data_section ();
5047 default_elf_select_rtx_section (enum machine_mode mode
, rtx x
,
5048 unsigned HOST_WIDE_INT align
)
5050 /* ??? Handle small data here somehow. */
5053 switch (GET_CODE (x
))
5057 named_section (NULL_TREE
, ".data.rel.ro", 3);
5061 named_section (NULL_TREE
, ".data.rel.ro.local", 1);
5068 mergeable_constant_section (mode
, align
, 0);
5071 /* Set the generally applicable flags on the SYMBOL_REF for EXP. */
5074 default_encode_section_info (tree decl
, rtx rtl
, int first ATTRIBUTE_UNUSED
)
5079 /* Careful not to prod global register variables. */
5080 if (GET_CODE (rtl
) != MEM
)
5082 symbol
= XEXP (rtl
, 0);
5083 if (GET_CODE (symbol
) != SYMBOL_REF
)
5087 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5088 flags
|= SYMBOL_FLAG_FUNCTION
;
5089 if ((*targetm
.binds_local_p
) (decl
))
5090 flags
|= SYMBOL_FLAG_LOCAL
;
5091 if ((*targetm
.in_small_data_p
) (decl
))
5092 flags
|= SYMBOL_FLAG_SMALL
;
5093 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_THREAD_LOCAL (decl
))
5094 flags
|= decl_tls_model (decl
) << SYMBOL_FLAG_TLS_SHIFT
;
5095 /* ??? Why is DECL_EXTERNAL ever set for non-PUBLIC names? Without
5096 being PUBLIC, the thing *must* be defined in this translation unit.
5097 Prevent this buglet from being propagated into rtl code as well. */
5098 if (DECL_P (decl
) && DECL_EXTERNAL (decl
) && TREE_PUBLIC (decl
))
5099 flags
|= SYMBOL_FLAG_EXTERNAL
;
5101 SYMBOL_REF_FLAGS (symbol
) = flags
;
5104 /* By default, we do nothing for encode_section_info, so we need not
5105 do anything but discard the '*' marker. */
5108 default_strip_name_encoding (const char *str
)
5110 return str
+ (*str
== '*');
5113 /* Assume ELF-ish defaults, since that's pretty much the most liberal
5114 wrt cross-module name binding. */
5117 default_binds_local_p (tree exp
)
5119 return default_binds_local_p_1 (exp
, flag_shlib
);
5123 default_binds_local_p_1 (tree exp
, int shlib
)
5127 /* A non-decl is an entry in the constant pool. */
5130 /* Static variables are always local. */
5131 else if (! TREE_PUBLIC (exp
))
5133 /* A variable is local if the user tells us so. */
5134 else if (decl_visibility (exp
) != VISIBILITY_DEFAULT
)
5136 /* Otherwise, variables defined outside this object may not be local. */
5137 else if (DECL_EXTERNAL (exp
))
5139 /* Linkonce and weak data are never local. */
5140 else if (DECL_ONE_ONLY (exp
) || DECL_WEAK (exp
))
5142 /* If PIC, then assume that any global name can be overridden by
5143 symbols resolved from other modules. */
5146 /* Uninitialized COMMON variable may be unified with symbols
5147 resolved from other modules. */
5148 else if (DECL_COMMON (exp
)
5149 && (DECL_INITIAL (exp
) == NULL
5150 || DECL_INITIAL (exp
) == error_mark_node
))
5152 /* Otherwise we're left with initialized (or non-common) global data
5153 which is of necessity defined locally. */
5160 /* Determine whether or not a pointer mode is valid. Assume defaults
5161 of ptr_mode or Pmode - can be overridden. */
5163 default_valid_pointer_mode (enum machine_mode mode
)
5165 return (mode
== ptr_mode
|| mode
== Pmode
);
5168 /* Default function to output code that will globalize a label. A
5169 target must define GLOBAL_ASM_OP or provide it's own function to
5170 globalize a label. */
5171 #ifdef GLOBAL_ASM_OP
5173 default_globalize_label (FILE * stream
, const char *name
)
5175 fputs (GLOBAL_ASM_OP
, stream
);
5176 assemble_name (stream
, name
);
5177 putc ('\n', stream
);
5179 #endif /* GLOBAL_ASM_OP */
5181 /* This is how to output an internal numbered label where PREFIX is
5182 the class of label and LABELNO is the number within the class. */
5185 default_internal_label (FILE *stream
, const char *prefix
,
5186 unsigned long labelno
)
5188 char *const buf
= alloca (40 + strlen (prefix
));
5189 ASM_GENERATE_INTERNAL_LABEL (buf
, prefix
, labelno
);
5190 ASM_OUTPUT_LABEL (stream
, buf
);
5193 /* This is the default behavior at the beginning of a file. It's
5194 controlled by two other target-hook toggles. */
5196 default_file_start (void)
5198 if (targetm
.file_start_app_off
&& !flag_verbose_asm
)
5199 fputs (ASM_APP_OFF
, asm_out_file
);
5201 if (targetm
.file_start_file_directive
)
5202 output_file_directive (asm_out_file
, main_input_filename
);
5205 /* This is a generic routine suitable for use as TARGET_ASM_FILE_END
5206 which emits a special section directive used to indicate whether or
5207 not this object file needs an executable stack. This is primarily
5208 a GNU extension to ELF but could be used on other targets. */
5210 file_end_indicate_exec_stack (void)
5212 unsigned int flags
= SECTION_DEBUG
;
5213 if (trampolines_created
)
5214 flags
|= SECTION_CODE
;
5216 named_section_flags (".note.GNU-stack", flags
);
5219 #include "gt-varasm.h"