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 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. */
37 #include "hard-reg-set.h"
46 #include "langhooks.h"
51 #ifdef XCOFF_DEBUGGING_INFO
52 #include "xcoffout.h" /* Needed for external data
53 declarations for e.g. AIX 4.x. */
56 #ifndef TRAMPOLINE_ALIGNMENT
57 #define TRAMPOLINE_ALIGNMENT FUNCTION_BOUNDARY
61 #define ASM_STABS_OP "\t.stabs\t"
64 /* The (assembler) name of the first globally-visible object output. */
65 const char *first_global_object_name
;
66 const char *weak_global_object_name
;
69 struct constant_descriptor_rtx
;
73 #define MAX_RTX_HASH_TABLE 61
75 struct varasm_status
GTY(())
77 /* Hash facility for making memory-constants
78 from constant rtl-expressions. It is used on RISC machines
79 where immediate integer arguments and constant addresses are restricted
80 so that such constants must be stored in memory.
82 This pool of constants is reinitialized for each function
83 so each function gets its own constants-pool that comes right before
85 struct constant_descriptor_rtx
** GTY ((length ("MAX_RTX_HASH_TABLE")))
86 x_const_rtx_hash_table
;
87 struct pool_constant
** GTY ((length ("MAX_RTX_HASH_TABLE")))
88 x_const_rtx_sym_hash_table
;
90 /* Pointers to first and last constant in pool. */
91 struct pool_constant
*x_first_pool
;
92 struct pool_constant
*x_last_pool
;
94 /* Current offset in constant pool (does not include any machine-specific
96 HOST_WIDE_INT x_pool_offset
;
99 #define const_rtx_hash_table (cfun->varasm->x_const_rtx_hash_table)
100 #define const_rtx_sym_hash_table (cfun->varasm->x_const_rtx_sym_hash_table)
101 #define first_pool (cfun->varasm->x_first_pool)
102 #define last_pool (cfun->varasm->x_last_pool)
103 #define pool_offset (cfun->varasm->x_pool_offset)
105 /* Number for making the label on the next
106 constant that is stored in memory. */
110 /* Number for making the label on the next
111 static variable internal to a function. */
115 /* Carry information from ASM_DECLARE_OBJECT_NAME
116 to ASM_FINISH_DECLARE_OBJECT. */
118 int size_directive_output
;
120 /* The last decl for which assemble_variable was called,
121 if it did ASM_DECLARE_OBJECT_NAME.
122 If the last call to assemble_variable didn't do that,
125 tree last_assemble_variable_decl
;
127 /* RTX_UNCHANGING_P in a MEM can mean it is stored into, for initialization.
128 So giving constant the alias set for the type will allow such
129 initializations to appear to conflict with the load of the constant. We
130 avoid this by giving all constants an alias set for just constants.
131 Since there will be no stores to that alias set, nothing will ever
132 conflict with them. */
134 static HOST_WIDE_INT const_alias_set
;
136 static const char *strip_reg_name
PARAMS ((const char *));
137 static int contains_pointers_p
PARAMS ((tree
));
138 static void decode_addr_const
PARAMS ((tree
, struct addr_const
*));
139 static unsigned int const_hash
PARAMS ((tree
));
140 static unsigned int const_hash_1
PARAMS ((tree
));
141 static int compare_constant
PARAMS ((tree
, tree
));
142 static tree copy_constant
PARAMS ((tree
));
143 static void output_constant_def_contents
PARAMS ((tree
, int, int));
144 static void decode_rtx_const
PARAMS ((enum machine_mode
, rtx
,
145 struct rtx_const
*));
146 static unsigned int const_hash_rtx
PARAMS ((enum machine_mode
, rtx
));
147 static int compare_constant_rtx
148 PARAMS ((enum machine_mode
, rtx
, struct constant_descriptor_rtx
*));
149 static struct constant_descriptor_rtx
* record_constant_rtx
150 PARAMS ((enum machine_mode
, rtx
));
151 static struct pool_constant
*find_pool_constant
PARAMS ((struct function
*, rtx
));
152 static void mark_constant_pool
PARAMS ((void));
153 static void mark_constants
PARAMS ((rtx
));
154 static int mark_constant
PARAMS ((rtx
*current_rtx
, void *data
));
155 static int output_addressed_constants
PARAMS ((tree
));
156 static void output_after_function_constants
PARAMS ((void));
157 static unsigned HOST_WIDE_INT array_size_for_constructor
PARAMS ((tree
));
158 static unsigned min_align
PARAMS ((unsigned, unsigned));
159 static void output_constructor
PARAMS ((tree
, HOST_WIDE_INT
,
161 static void globalize_decl
PARAMS ((tree
));
162 static void maybe_assemble_visibility
PARAMS ((tree
));
163 static int in_named_entry_eq
PARAMS ((const PTR
, const PTR
));
164 static hashval_t in_named_entry_hash
PARAMS ((const PTR
));
165 #ifdef ASM_OUTPUT_BSS
166 static void asm_output_bss
PARAMS ((FILE *, tree
, const char *, int, int));
168 #ifdef BSS_SECTION_ASM_OP
169 #ifdef ASM_OUTPUT_ALIGNED_BSS
170 static void asm_output_aligned_bss
PARAMS ((FILE *, tree
, const char *,
173 #endif /* BSS_SECTION_ASM_OP */
174 static hashval_t const_str_htab_hash
PARAMS ((const void *x
));
175 static int const_str_htab_eq
PARAMS ((const void *x
, const void *y
));
176 static bool asm_emit_uninitialised
PARAMS ((tree
, const char*, int, int));
177 static void resolve_unique_section
PARAMS ((tree
, int, int));
178 static void mark_weak
PARAMS ((tree
));
180 static enum in_section
{ no_section
, in_text
, in_data
, in_named
181 #ifdef BSS_SECTION_ASM_OP
184 #ifdef CTORS_SECTION_ASM_OP
187 #ifdef DTORS_SECTION_ASM_OP
190 #ifdef READONLY_DATA_SECTION_ASM_OP
193 #ifdef EXTRA_SECTIONS
196 } in_section
= no_section
;
198 /* Return a nonzero value if DECL has a section attribute. */
199 #ifndef IN_NAMED_SECTION
200 #define IN_NAMED_SECTION(DECL) \
201 ((TREE_CODE (DECL) == FUNCTION_DECL || TREE_CODE (DECL) == VAR_DECL) \
202 && DECL_SECTION_NAME (DECL) != NULL_TREE)
205 /* Text of section name when in_section == in_named. */
206 static const char *in_named_name
;
208 /* Hash table of flags that have been used for a particular named section. */
210 struct in_named_entry
217 static htab_t in_named_htab
;
219 /* Define functions like text_section for any extra sections. */
220 #ifdef EXTRA_SECTION_FUNCTIONS
221 EXTRA_SECTION_FUNCTIONS
224 /* Tell assembler to switch to text section. */
229 if (in_section
!= in_text
)
231 in_section
= in_text
;
235 fprintf (asm_out_file
, "%s\n", TEXT_SECTION_ASM_OP
);
240 /* Tell assembler to switch to data section. */
245 if (in_section
!= in_data
)
247 in_section
= in_data
;
248 if (flag_shared_data
)
250 #ifdef SHARED_SECTION_ASM_OP
251 fprintf (asm_out_file
, "%s\n", SHARED_SECTION_ASM_OP
);
253 fprintf (asm_out_file
, "%s\n", DATA_SECTION_ASM_OP
);
257 fprintf (asm_out_file
, "%s\n", DATA_SECTION_ASM_OP
);
261 /* Tell assembler to ALWAYS switch to data section, in case
262 it's not sure where it is. */
265 force_data_section ()
267 in_section
= no_section
;
271 /* Tell assembler to switch to read-only data section. This is normally
275 readonly_data_section ()
277 #ifdef READONLY_DATA_SECTION
278 READONLY_DATA_SECTION (); /* Note this can call data_section. */
280 #ifdef READONLY_DATA_SECTION_ASM_OP
281 if (in_section
!= in_readonly_data
)
283 in_section
= in_readonly_data
;
284 fputs (READONLY_DATA_SECTION_ASM_OP
, asm_out_file
);
285 fputc ('\n', asm_out_file
);
293 /* Determine if we're in the text section. */
298 return in_section
== in_text
;
301 /* Determine if we're in the data section. */
306 return in_section
== in_data
;
309 /* Helper routines for maintaining in_named_htab. */
312 in_named_entry_eq (p1
, p2
)
316 const struct in_named_entry
*old
= p1
;
317 const char *new = p2
;
319 return strcmp (old
->name
, new) == 0;
323 in_named_entry_hash (p
)
326 const struct in_named_entry
*old
= p
;
327 return htab_hash_string (old
->name
);
330 /* If SECTION has been seen before as a named section, return the flags
331 that were used. Otherwise, return 0. Note, that 0 is a perfectly valid
332 set of flags for a section to have, so 0 does not mean that the section
333 has not been seen. */
336 get_named_section_flags (section
)
339 struct in_named_entry
**slot
;
341 slot
= (struct in_named_entry
**)
342 htab_find_slot_with_hash (in_named_htab
, section
,
343 htab_hash_string (section
), NO_INSERT
);
345 return slot
? (*slot
)->flags
: 0;
348 /* Returns true if the section has been declared before. Sets internal
349 flag on this section in in_named_hash so subsequent calls on this
350 section will return false. */
353 named_section_first_declaration (name
)
356 struct in_named_entry
**slot
;
358 slot
= (struct in_named_entry
**)
359 htab_find_slot_with_hash (in_named_htab
, name
,
360 htab_hash_string (name
), NO_INSERT
);
361 if (! (*slot
)->declared
)
363 (*slot
)->declared
= true;
373 /* Record FLAGS for SECTION. If SECTION was previously recorded with a
374 different set of flags, return false. */
377 set_named_section_flags (section
, flags
)
381 struct in_named_entry
**slot
, *entry
;
383 slot
= (struct in_named_entry
**)
384 htab_find_slot_with_hash (in_named_htab
, section
,
385 htab_hash_string (section
), INSERT
);
390 entry
= (struct in_named_entry
*) xmalloc (sizeof (*entry
));
392 entry
->name
= ggc_strdup (section
);
393 entry
->flags
= flags
;
394 entry
->declared
= false;
396 else if (entry
->flags
!= flags
)
402 /* Tell assembler to change to section NAME with attributes FLAGS. */
405 named_section_flags (name
, flags
)
409 if (in_section
!= in_named
|| strcmp (name
, in_named_name
) != 0)
411 if (! set_named_section_flags (name
, flags
))
414 (*targetm
.asm_out
.named_section
) (name
, flags
);
416 if (flags
& SECTION_FORGET
)
417 in_section
= no_section
;
420 in_named_name
= ggc_strdup (name
);
421 in_section
= in_named
;
426 /* Tell assembler to change to section NAME for DECL.
427 If DECL is NULL, just switch to section NAME.
428 If NAME is NULL, get the name from DECL.
429 If RELOC is 1, the initializer for DECL contains relocs. */
432 named_section (decl
, name
, reloc
)
439 if (decl
!= NULL_TREE
&& !DECL_P (decl
))
442 name
= TREE_STRING_POINTER (DECL_SECTION_NAME (decl
));
444 flags
= (* targetm
.section_type_flags
) (decl
, name
, reloc
);
446 /* Sanity check user variables for flag changes. Non-user
447 section flag changes will abort in named_section_flags.
448 However, don't complain if SECTION_OVERRIDE is set.
449 We trust that the setter knows that it is safe to ignore
450 the default flags for this decl. */
451 if (decl
&& ! set_named_section_flags (name
, flags
))
453 flags
= get_named_section_flags (name
);
454 if ((flags
& SECTION_OVERRIDE
) == 0)
455 error_with_decl (decl
, "%s causes a section type conflict");
458 named_section_flags (name
, flags
);
461 /* If required, set DECL_SECTION_NAME to a unique name. */
464 resolve_unique_section (decl
, reloc
, flag_function_or_data_sections
)
466 int reloc ATTRIBUTE_UNUSED
;
467 int flag_function_or_data_sections
;
469 if (DECL_SECTION_NAME (decl
) == NULL_TREE
470 && targetm
.have_named_sections
471 && (flag_function_or_data_sections
472 || DECL_ONE_ONLY (decl
)))
473 (*targetm
.asm_out
.unique_section
) (decl
, reloc
);
476 #ifdef BSS_SECTION_ASM_OP
478 /* Tell the assembler to switch to the bss section. */
483 if (in_section
!= in_bss
)
485 #ifdef SHARED_BSS_SECTION_ASM_OP
486 if (flag_shared_data
)
487 fprintf (asm_out_file
, "%s\n", SHARED_BSS_SECTION_ASM_OP
);
490 fprintf (asm_out_file
, "%s\n", BSS_SECTION_ASM_OP
);
496 #ifdef ASM_OUTPUT_BSS
498 /* Utility function for ASM_OUTPUT_BSS for targets to use if
499 they don't support alignments in .bss.
500 ??? It is believed that this function will work in most cases so such
501 support is localized here. */
504 asm_output_bss (file
, decl
, name
, size
, rounded
)
506 tree decl ATTRIBUTE_UNUSED
;
508 int size ATTRIBUTE_UNUSED
, rounded
;
510 (*targetm
.asm_out
.globalize_label
) (file
, name
);
512 #ifdef ASM_DECLARE_OBJECT_NAME
513 last_assemble_variable_decl
= decl
;
514 ASM_DECLARE_OBJECT_NAME (file
, name
, decl
);
516 /* Standard thing is just output label for the object. */
517 ASM_OUTPUT_LABEL (file
, name
);
518 #endif /* ASM_DECLARE_OBJECT_NAME */
519 ASM_OUTPUT_SKIP (file
, rounded
? rounded
: 1);
524 #ifdef ASM_OUTPUT_ALIGNED_BSS
526 /* Utility function for targets to use in implementing
527 ASM_OUTPUT_ALIGNED_BSS.
528 ??? It is believed that this function will work in most cases so such
529 support is localized here. */
532 asm_output_aligned_bss (file
, decl
, name
, size
, align
)
534 tree decl ATTRIBUTE_UNUSED
;
538 (*targetm
.asm_out
.globalize_label
) (file
, name
);
540 ASM_OUTPUT_ALIGN (file
, floor_log2 (align
/ BITS_PER_UNIT
));
541 #ifdef ASM_DECLARE_OBJECT_NAME
542 last_assemble_variable_decl
= decl
;
543 ASM_DECLARE_OBJECT_NAME (file
, name
, decl
);
545 /* Standard thing is just output label for the object. */
546 ASM_OUTPUT_LABEL (file
, name
);
547 #endif /* ASM_DECLARE_OBJECT_NAME */
548 ASM_OUTPUT_SKIP (file
, size
? size
: 1);
553 #endif /* BSS_SECTION_ASM_OP */
555 /* Switch to the section for function DECL.
557 If DECL is NULL_TREE, switch to the text section.
558 ??? It's not clear that we will ever be passed NULL_TREE, but it's
559 safer to handle it. */
562 function_section (decl
)
565 if (decl
!= NULL_TREE
566 && DECL_SECTION_NAME (decl
) != NULL_TREE
)
567 named_section (decl
, (char *) 0, 0);
572 /* Switch to section for variable DECL. RELOC is the same as the
573 argument to SELECT_SECTION. */
576 variable_section (decl
, reloc
)
580 if (IN_NAMED_SECTION (decl
))
581 named_section (decl
, NULL
, reloc
);
583 (*targetm
.asm_out
.select_section
) (decl
, reloc
, DECL_ALIGN (decl
));
586 /* Tell assembler to switch to the section for the exception handling
590 default_exception_section ()
592 if (targetm
.have_named_sections
)
593 named_section (NULL_TREE
, ".gcc_except_table", 0);
597 readonly_data_section ();
600 /* Tell assembler to switch to the section for string merging. */
603 mergeable_string_section (decl
, align
, flags
)
604 tree decl ATTRIBUTE_UNUSED
;
605 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
;
606 unsigned int flags ATTRIBUTE_UNUSED
;
608 #ifdef HAVE_GAS_SHF_MERGE
609 if (flag_merge_constants
610 && TREE_CODE (decl
) == STRING_CST
611 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
613 && TREE_STRING_LENGTH (decl
) >= int_size_in_bytes (TREE_TYPE (decl
)))
615 enum machine_mode mode
;
616 unsigned int modesize
;
621 mode
= TYPE_MODE (TREE_TYPE (TREE_TYPE (decl
)));
622 modesize
= GET_MODE_BITSIZE (mode
);
623 if (modesize
>= 8 && modesize
<= 256
624 && (modesize
& (modesize
- 1)) == 0)
626 if (align
< modesize
)
629 str
= TREE_STRING_POINTER (decl
);
630 len
= TREE_STRING_LENGTH (decl
);
631 unit
= GET_MODE_SIZE (mode
);
633 /* Check for embedded NUL characters. */
634 for (i
= 0; i
< len
; i
+= unit
)
636 for (j
= 0; j
< unit
; j
++)
637 if (str
[i
+ j
] != '\0')
644 sprintf (name
, ".rodata.str%d.%d", modesize
/ 8,
646 flags
|= (modesize
/ 8) | SECTION_MERGE
| SECTION_STRINGS
;
647 if (!i
&& modesize
< align
)
649 /* A "" string with requested alignment greater than
650 character size might cause a problem:
651 if some other string required even bigger
652 alignment than "", then linker might think the
653 "" is just part of padding after some other string
654 and not put it into the hash table initially.
655 But this means "" could have smaller alignment
657 #ifdef ASM_OUTPUT_SECTION_START
658 named_section_flags (name
, flags
);
659 ASM_OUTPUT_SECTION_START (asm_out_file
);
661 readonly_data_section ();
666 named_section_flags (name
, flags
);
672 readonly_data_section ();
675 /* Tell assembler to switch to the section for constant merging. */
678 mergeable_constant_section (mode
, align
, flags
)
679 enum machine_mode mode ATTRIBUTE_UNUSED
;
680 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
;
681 unsigned int flags ATTRIBUTE_UNUSED
;
683 #ifdef HAVE_GAS_SHF_MERGE
684 unsigned int modesize
= GET_MODE_BITSIZE (mode
);
686 if (flag_merge_constants
692 && (align
& (align
- 1)) == 0)
696 sprintf (name
, ".rodata.cst%d", (int) (align
/ 8));
697 flags
|= (align
/ 8) | SECTION_MERGE
;
698 named_section_flags (name
, flags
);
702 readonly_data_section ();
705 /* Given NAME, a putative register name, discard any customary prefixes. */
708 strip_reg_name (name
)
711 #ifdef REGISTER_PREFIX
712 if (!strncmp (name
, REGISTER_PREFIX
, strlen (REGISTER_PREFIX
)))
713 name
+= strlen (REGISTER_PREFIX
);
715 if (name
[0] == '%' || name
[0] == '#')
720 /* Decode an `asm' spec for a declaration as a register name.
721 Return the register number, or -1 if nothing specified,
722 or -2 if the ASMSPEC is not `cc' or `memory' and is not recognized,
723 or -3 if ASMSPEC is `cc' and is not recognized,
724 or -4 if ASMSPEC is `memory' and is not recognized.
725 Accept an exact spelling or a decimal number.
726 Prefixes such as % are optional. */
729 decode_reg_name (asmspec
)
736 /* Get rid of confusing prefixes. */
737 asmspec
= strip_reg_name (asmspec
);
739 /* Allow a decimal number as a "register name". */
740 for (i
= strlen (asmspec
) - 1; i
>= 0; i
--)
741 if (! ISDIGIT (asmspec
[i
]))
743 if (asmspec
[0] != 0 && i
< 0)
746 if (i
< FIRST_PSEUDO_REGISTER
&& i
>= 0)
752 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
754 && ! strcmp (asmspec
, strip_reg_name (reg_names
[i
])))
757 #ifdef ADDITIONAL_REGISTER_NAMES
759 static const struct { const char *const name
; const int number
; } table
[]
760 = ADDITIONAL_REGISTER_NAMES
;
762 for (i
= 0; i
< (int) ARRAY_SIZE (table
); i
++)
763 if (! strcmp (asmspec
, table
[i
].name
))
764 return table
[i
].number
;
766 #endif /* ADDITIONAL_REGISTER_NAMES */
768 if (!strcmp (asmspec
, "memory"))
771 if (!strcmp (asmspec
, "cc"))
780 /* Create the DECL_RTL for a VAR_DECL or FUNCTION_DECL. DECL should
781 have static storage duration. In other words, it should not be an
782 automatic variable, including PARM_DECLs.
784 There is, however, one exception: this function handles variables
785 explicitly placed in a particular register by the user.
787 ASMSPEC, if not 0, is the string which the user specified as the
788 assembler symbol name.
790 This is never called for PARM_DECL nodes. */
793 make_decl_rtl (decl
, asmspec
)
797 int top_level
= (DECL_CONTEXT (decl
) == NULL_TREE
);
798 const char *name
= 0;
799 const char *new_name
= 0;
803 /* Check that we are not being given an automatic variable. */
804 /* A weak alias has TREE_PUBLIC set but not the other bits. */
805 if (TREE_CODE (decl
) == PARM_DECL
806 || TREE_CODE (decl
) == RESULT_DECL
807 || (TREE_CODE (decl
) == VAR_DECL
808 && !TREE_STATIC (decl
)
809 && !TREE_PUBLIC (decl
)
810 && !DECL_EXTERNAL (decl
)
811 && !DECL_REGISTER (decl
)))
813 /* And that we were not given a type or a label. */
814 else if (TREE_CODE (decl
) == TYPE_DECL
815 || TREE_CODE (decl
) == LABEL_DECL
)
818 /* For a duplicate declaration, we can be called twice on the
819 same DECL node. Don't discard the RTL already made. */
820 if (DECL_RTL_SET_P (decl
))
822 /* If the old RTL had the wrong mode, fix the mode. */
823 if (GET_MODE (DECL_RTL (decl
)) != DECL_MODE (decl
))
824 SET_DECL_RTL (decl
, adjust_address_nv (DECL_RTL (decl
),
825 DECL_MODE (decl
), 0));
827 /* ??? Another way to do this would be to maintain a hashed
828 table of such critters. Instead of adding stuff to a DECL
829 to give certain attributes to it, we could use an external
830 hash map from DECL to set of attributes. */
832 /* Let the target reassign the RTL if it wants.
833 This is necessary, for example, when one machine specific
834 decl attribute overrides another. */
835 (* targetm
.encode_section_info
) (decl
, false);
839 new_name
= name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
841 reg_number
= decode_reg_name (asmspec
);
842 if (reg_number
== -2)
844 /* ASMSPEC is given, and not the name of a register. Mark the
845 name with a star so assemble_name won't munge it. */
846 char *starred
= alloca (strlen (asmspec
) + 2);
848 strcpy (starred
+ 1, asmspec
);
852 if (TREE_CODE (decl
) != FUNCTION_DECL
&& DECL_REGISTER (decl
))
854 /* First detect errors in declaring global registers. */
855 if (reg_number
== -1)
856 error_with_decl (decl
, "register name not specified for `%s'");
857 else if (reg_number
< 0)
858 error_with_decl (decl
, "invalid register name for `%s'");
859 else if (TYPE_MODE (TREE_TYPE (decl
)) == BLKmode
)
860 error_with_decl (decl
,
861 "data type of `%s' isn't suitable for a register");
862 else if (! HARD_REGNO_MODE_OK (reg_number
, TYPE_MODE (TREE_TYPE (decl
))))
863 error_with_decl (decl
,
864 "register specified for `%s' isn't suitable for data type");
865 /* Now handle properly declared static register variables. */
870 if (DECL_INITIAL (decl
) != 0 && TREE_STATIC (decl
))
872 DECL_INITIAL (decl
) = 0;
873 error ("global register variable has initial value");
875 if (TREE_THIS_VOLATILE (decl
))
876 warning ("volatile register variables don't work as you might wish");
878 /* If the user specified one of the eliminables registers here,
879 e.g., FRAME_POINTER_REGNUM, we don't want to get this variable
880 confused with that register and be eliminated. This usage is
881 somewhat suspect... */
883 SET_DECL_RTL (decl
, gen_rtx_raw_REG (DECL_MODE (decl
), reg_number
));
884 ORIGINAL_REGNO (DECL_RTL (decl
)) = reg_number
;
885 REG_USERVAR_P (DECL_RTL (decl
)) = 1;
887 if (TREE_STATIC (decl
))
889 /* Make this register global, so not usable for anything
891 #ifdef ASM_DECLARE_REGISTER_GLOBAL
892 ASM_DECLARE_REGISTER_GLOBAL (asm_out_file
, decl
, reg_number
, name
);
894 nregs
= HARD_REGNO_NREGS (reg_number
, DECL_MODE (decl
));
896 globalize_reg (reg_number
+ --nregs
);
899 /* As a register variable, it has no section. */
904 /* Now handle ordinary static variables and functions (in memory).
905 Also handle vars declared register invalidly. */
907 if (reg_number
>= 0 || reg_number
== -3)
908 error_with_decl (decl
,
909 "register name given for non-register variable `%s'");
911 /* Specifying a section attribute on a variable forces it into a
912 non-.bss section, and thus it cannot be common. */
913 if (TREE_CODE (decl
) == VAR_DECL
914 && DECL_SECTION_NAME (decl
) != NULL_TREE
915 && DECL_INITIAL (decl
) == NULL_TREE
916 && DECL_COMMON (decl
))
917 DECL_COMMON (decl
) = 0;
919 /* Variables can't be both common and weak. */
920 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_WEAK (decl
))
921 DECL_COMMON (decl
) = 0;
923 /* Can't use just the variable's own name for a variable
924 whose scope is less than the whole file, unless it's a member
925 of a local class (which will already be unambiguous).
926 Concatenate a distinguishing number. */
927 if (!top_level
&& !TREE_PUBLIC (decl
)
928 && ! (DECL_CONTEXT (decl
) && TYPE_P (DECL_CONTEXT (decl
)))
930 && name
== IDENTIFIER_POINTER (DECL_NAME (decl
)))
934 ASM_FORMAT_PRIVATE_NAME (label
, name
, var_labelno
);
939 if (name
!= new_name
)
941 SET_DECL_ASSEMBLER_NAME (decl
, get_identifier (new_name
));
942 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
945 /* If this variable is to be treated as volatile, show its
946 tree node has side effects. */
947 if ((flag_volatile_global
&& TREE_CODE (decl
) == VAR_DECL
948 && TREE_PUBLIC (decl
))
949 || ((flag_volatile_static
&& TREE_CODE (decl
) == VAR_DECL
950 && (TREE_PUBLIC (decl
) || TREE_STATIC (decl
)))))
951 TREE_SIDE_EFFECTS (decl
) = 1;
953 x
= gen_rtx_MEM (DECL_MODE (decl
), gen_rtx_SYMBOL_REF (Pmode
, name
));
954 SYMBOL_REF_WEAK (XEXP (x
, 0)) = DECL_WEAK (decl
);
955 if (TREE_CODE (decl
) != FUNCTION_DECL
)
956 set_mem_attributes (x
, decl
, 1);
957 SET_DECL_RTL (decl
, x
);
959 /* Optionally set flags or add text to the name to record information
960 such as that it is a function name.
961 If the name is changed, the macro ASM_OUTPUT_LABELREF
962 will have to know how to strip this information. */
963 (* targetm
.encode_section_info
) (decl
, true);
966 /* Make the rtl for variable VAR be volatile.
967 Use this only for static variables. */
970 make_var_volatile (var
)
973 if (GET_CODE (DECL_RTL (var
)) != MEM
)
976 MEM_VOLATILE_P (DECL_RTL (var
)) = 1;
979 /* Output alignment directive to align for constant expression EXP. */
982 assemble_constant_align (exp
)
987 /* Align the location counter as required by EXP's data type. */
988 align
= TYPE_ALIGN (TREE_TYPE (exp
));
989 #ifdef CONSTANT_ALIGNMENT
990 align
= CONSTANT_ALIGNMENT (exp
, align
);
993 if (align
> BITS_PER_UNIT
)
995 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
999 /* Output a string of literal assembler code
1000 for an `asm' keyword used between functions. */
1003 assemble_asm (string
)
1008 if (TREE_CODE (string
) == ADDR_EXPR
)
1009 string
= TREE_OPERAND (string
, 0);
1011 fprintf (asm_out_file
, "\t%s\n", TREE_STRING_POINTER (string
));
1014 /* Record an element in the table of global destructors. SYMBOL is
1015 a SYMBOL_REF of the function to be called; PRIORITY is a number
1016 between 0 and MAX_INIT_PRIORITY. */
1019 default_stabs_asm_out_destructor (symbol
, priority
)
1021 int priority ATTRIBUTE_UNUSED
;
1023 /* Tell GNU LD that this is part of the static destructor set.
1024 This will work for any system that uses stabs, most usefully
1026 fprintf (asm_out_file
, "%s\"___DTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
1027 assemble_name (asm_out_file
, XSTR (symbol
, 0));
1028 fputc ('\n', asm_out_file
);
1032 default_named_section_asm_out_destructor (symbol
, priority
)
1036 const char *section
= ".dtors";
1039 /* ??? This only works reliably with the GNU linker. */
1040 if (priority
!= DEFAULT_INIT_PRIORITY
)
1042 sprintf (buf
, ".dtors.%.5u",
1043 /* Invert the numbering so the linker puts us in the proper
1044 order; constructors are run from right to left, and the
1045 linker sorts in increasing order. */
1046 MAX_INIT_PRIORITY
- priority
);
1050 named_section_flags (section
, SECTION_WRITE
);
1051 assemble_align (POINTER_SIZE
);
1052 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1055 #ifdef DTORS_SECTION_ASM_OP
1059 if (in_section
!= in_dtors
)
1061 in_section
= in_dtors
;
1062 fputs (DTORS_SECTION_ASM_OP
, asm_out_file
);
1063 fputc ('\n', asm_out_file
);
1068 default_dtor_section_asm_out_destructor (symbol
, priority
)
1070 int priority ATTRIBUTE_UNUSED
;
1073 assemble_align (POINTER_SIZE
);
1074 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1078 /* Likewise for global constructors. */
1081 default_stabs_asm_out_constructor (symbol
, priority
)
1083 int priority ATTRIBUTE_UNUSED
;
1085 /* Tell GNU LD that this is part of the static destructor set.
1086 This will work for any system that uses stabs, most usefully
1088 fprintf (asm_out_file
, "%s\"___CTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
1089 assemble_name (asm_out_file
, XSTR (symbol
, 0));
1090 fputc ('\n', asm_out_file
);
1094 default_named_section_asm_out_constructor (symbol
, priority
)
1098 const char *section
= ".ctors";
1101 /* ??? This only works reliably with the GNU linker. */
1102 if (priority
!= DEFAULT_INIT_PRIORITY
)
1104 sprintf (buf
, ".ctors.%.5u",
1105 /* Invert the numbering so the linker puts us in the proper
1106 order; constructors are run from right to left, and the
1107 linker sorts in increasing order. */
1108 MAX_INIT_PRIORITY
- priority
);
1112 named_section_flags (section
, SECTION_WRITE
);
1113 assemble_align (POINTER_SIZE
);
1114 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1117 #ifdef CTORS_SECTION_ASM_OP
1121 if (in_section
!= in_ctors
)
1123 in_section
= in_ctors
;
1124 fputs (CTORS_SECTION_ASM_OP
, asm_out_file
);
1125 fputc ('\n', asm_out_file
);
1130 default_ctor_section_asm_out_constructor (symbol
, priority
)
1132 int priority ATTRIBUTE_UNUSED
;
1135 assemble_align (POINTER_SIZE
);
1136 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1140 /* CONSTANT_POOL_BEFORE_FUNCTION may be defined as an expression with
1141 a nonzero value if the constant pool should be output before the
1142 start of the function, or a zero value if the pool should output
1143 after the end of the function. The default is to put it before the
1146 #ifndef CONSTANT_POOL_BEFORE_FUNCTION
1147 #define CONSTANT_POOL_BEFORE_FUNCTION 1
1150 /* Output assembler code for the constant pool of a function and associated
1151 with defining the name of the function. DECL describes the function.
1152 NAME is the function's name. For the constant pool, we use the current
1153 constant pool data. */
1156 assemble_start_function (decl
, fnname
)
1162 /* The following code does not need preprocessing in the assembler. */
1166 if (CONSTANT_POOL_BEFORE_FUNCTION
)
1167 output_constant_pool (fnname
, decl
);
1169 resolve_unique_section (decl
, 0, flag_function_sections
);
1170 function_section (decl
);
1172 /* Tell assembler to move to target machine's alignment for functions. */
1173 align
= floor_log2 (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
1174 if (align
< force_align_functions_log
)
1175 align
= force_align_functions_log
;
1178 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1181 /* Handle a user-specified function alignment.
1182 Note that we still need to align to FUNCTION_BOUNDARY, as above,
1183 because ASM_OUTPUT_MAX_SKIP_ALIGN might not do any alignment at all. */
1184 if (align_functions_log
> align
1185 && cfun
->function_frequency
!= FUNCTION_FREQUENCY_UNLIKELY_EXECUTED
)
1187 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
1188 ASM_OUTPUT_MAX_SKIP_ALIGN (asm_out_file
,
1189 align_functions_log
, align_functions
- 1);
1191 ASM_OUTPUT_ALIGN (asm_out_file
, align_functions_log
);
1195 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
1196 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file
, fnname
);
1199 (*debug_hooks
->begin_function
) (decl
);
1201 /* Make function name accessible from other files, if appropriate. */
1203 if (TREE_PUBLIC (decl
))
1205 if (! first_global_object_name
)
1210 p
= (* targetm
.strip_name_encoding
) (fnname
);
1213 if (! DECL_WEAK (decl
) && ! DECL_ONE_ONLY (decl
))
1214 first_global_object_name
= name
;
1216 weak_global_object_name
= name
;
1219 globalize_decl (decl
);
1221 maybe_assemble_visibility (decl
);
1224 /* Do any machine/system dependent processing of the function name */
1225 #ifdef ASM_DECLARE_FUNCTION_NAME
1226 ASM_DECLARE_FUNCTION_NAME (asm_out_file
, fnname
, current_function_decl
);
1228 /* Standard thing is just output label for the function. */
1229 ASM_OUTPUT_LABEL (asm_out_file
, fnname
);
1230 #endif /* ASM_DECLARE_FUNCTION_NAME */
1233 /* Output assembler code associated with defining the size of the
1234 function. DECL describes the function. NAME is the function's name. */
1237 assemble_end_function (decl
, fnname
)
1241 #ifdef ASM_DECLARE_FUNCTION_SIZE
1242 ASM_DECLARE_FUNCTION_SIZE (asm_out_file
, fnname
, decl
);
1244 if (! CONSTANT_POOL_BEFORE_FUNCTION
)
1246 output_constant_pool (fnname
, decl
);
1247 function_section (decl
); /* need to switch back */
1250 /* Output any constants which should appear after the function. */
1251 output_after_function_constants ();
1254 /* Assemble code to leave SIZE bytes of zeros. */
1257 assemble_zeros (size
)
1260 /* Do no output if -fsyntax-only. */
1261 if (flag_syntax_only
)
1264 #ifdef ASM_NO_SKIP_IN_TEXT
1265 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
1266 so we must output 0s explicitly in the text section. */
1267 if (ASM_NO_SKIP_IN_TEXT
&& in_text_section ())
1270 for (i
= 0; i
< size
; i
++)
1271 assemble_integer (const0_rtx
, 1, BITS_PER_UNIT
, 1);
1276 ASM_OUTPUT_SKIP (asm_out_file
, size
);
1279 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
1282 assemble_align (align
)
1285 if (align
> BITS_PER_UNIT
)
1287 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
1291 /* Assemble a string constant with the specified C string as contents. */
1294 assemble_string (p
, size
)
1301 /* If the string is very long, split it up. */
1305 int thissize
= size
- pos
;
1306 if (thissize
> maximum
)
1309 ASM_OUTPUT_ASCII (asm_out_file
, p
, thissize
);
1317 #if defined ASM_OUTPUT_ALIGNED_DECL_LOCAL
1318 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1319 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1321 #if defined ASM_OUTPUT_ALIGNED_LOCAL
1322 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1323 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, DECL_ALIGN (decl))
1325 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1326 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded)
1330 #if defined ASM_OUTPUT_ALIGNED_BSS
1331 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1332 ASM_OUTPUT_ALIGNED_BSS (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1334 #if defined ASM_OUTPUT_BSS
1335 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1336 ASM_OUTPUT_BSS (asm_out_file, decl, name, size, rounded)
1342 #if defined ASM_OUTPUT_ALIGNED_DECL_COMMON
1343 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1344 ASM_OUTPUT_ALIGNED_DECL_COMMON (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1346 #if defined ASM_OUTPUT_ALIGNED_COMMON
1347 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1348 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file, name, size, DECL_ALIGN (decl))
1350 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1351 ASM_OUTPUT_COMMON (asm_out_file, name, size, rounded)
1356 asm_emit_uninitialised (decl
, name
, size
, rounded
)
1359 int size ATTRIBUTE_UNUSED
;
1360 int rounded ATTRIBUTE_UNUSED
;
1368 destination
= asm_dest_local
;
1370 /* ??? We should handle .bss via select_section mechanisms rather than
1371 via special target hooks. That would eliminate this special case. */
1372 if (TREE_PUBLIC (decl
))
1374 if (!DECL_COMMON (decl
))
1376 destination
= asm_dest_bss
;
1381 destination
= asm_dest_common
;
1384 if (destination
== asm_dest_bss
)
1385 globalize_decl (decl
);
1386 resolve_unique_section (decl
, 0, flag_data_sections
);
1388 if (flag_shared_data
)
1390 switch (destination
)
1392 #ifdef ASM_OUTPUT_SHARED_BSS
1394 ASM_OUTPUT_SHARED_BSS (asm_out_file
, decl
, name
, size
, rounded
);
1397 #ifdef ASM_OUTPUT_SHARED_COMMON
1398 case asm_dest_common
:
1399 ASM_OUTPUT_SHARED_COMMON (asm_out_file
, name
, size
, rounded
);
1402 #ifdef ASM_OUTPUT_SHARED_LOCAL
1403 case asm_dest_local
:
1404 ASM_OUTPUT_SHARED_LOCAL (asm_out_file
, name
, size
, rounded
);
1412 switch (destination
)
1416 ASM_EMIT_BSS (decl
, name
, size
, rounded
);
1419 case asm_dest_common
:
1420 ASM_EMIT_COMMON (decl
, name
, size
, rounded
);
1422 case asm_dest_local
:
1423 ASM_EMIT_LOCAL (decl
, name
, size
, rounded
);
1432 /* Assemble everything that is needed for a variable or function declaration.
1433 Not used for automatic variables, and not used for function definitions.
1434 Should not be called for variables of incomplete structure type.
1436 TOP_LEVEL is nonzero if this variable has file scope.
1437 AT_END is nonzero if this is the special handling, at end of compilation,
1438 to define things that have had only tentative definitions.
1439 DONT_OUTPUT_DATA if nonzero means don't actually output the
1440 initial value (that will be done by the caller). */
1443 assemble_variable (decl
, top_level
, at_end
, dont_output_data
)
1445 int top_level ATTRIBUTE_UNUSED
;
1446 int at_end ATTRIBUTE_UNUSED
;
1447 int dont_output_data
;
1454 last_assemble_variable_decl
= 0;
1456 /* Normally no need to say anything here for external references,
1457 since assemble_external is called by the language-specific code
1458 when a declaration is first seen. */
1460 if (DECL_EXTERNAL (decl
))
1463 /* Output no assembler code for a function declaration.
1464 Only definitions of functions output anything. */
1466 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1469 /* Do nothing for global register variables. */
1470 if (DECL_RTL_SET_P (decl
) && GET_CODE (DECL_RTL (decl
)) == REG
)
1472 TREE_ASM_WRITTEN (decl
) = 1;
1476 /* If type was incomplete when the variable was declared,
1477 see if it is complete now. */
1479 if (DECL_SIZE (decl
) == 0)
1480 layout_decl (decl
, 0);
1482 /* Still incomplete => don't allocate it; treat the tentative defn
1483 (which is what it must have been) as an `extern' reference. */
1485 if (!dont_output_data
&& DECL_SIZE (decl
) == 0)
1487 error_with_file_and_line (DECL_SOURCE_FILE (decl
),
1488 DECL_SOURCE_LINE (decl
),
1489 "storage size of `%s' isn't known",
1490 IDENTIFIER_POINTER (DECL_NAME (decl
)));
1491 TREE_ASM_WRITTEN (decl
) = 1;
1495 /* The first declaration of a variable that comes through this function
1496 decides whether it is global (in C, has external linkage)
1497 or local (in C, has internal linkage). So do nothing more
1498 if this function has already run. */
1500 if (TREE_ASM_WRITTEN (decl
))
1503 /* Make sure targetm.encode_section_info is invoked before we set
1505 decl_rtl
= DECL_RTL (decl
);
1507 TREE_ASM_WRITTEN (decl
) = 1;
1509 /* Do no output if -fsyntax-only. */
1510 if (flag_syntax_only
)
1515 if (! dont_output_data
1516 && ! host_integerp (DECL_SIZE_UNIT (decl
), 1))
1518 error_with_decl (decl
, "size of variable `%s' is too large");
1522 name
= XSTR (XEXP (decl_rtl
, 0), 0);
1523 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
)
1524 && ! first_global_object_name
1525 && ! (DECL_COMMON (decl
) && (DECL_INITIAL (decl
) == 0
1526 || DECL_INITIAL (decl
) == error_mark_node
))
1527 && ! DECL_WEAK (decl
)
1528 && ! DECL_ONE_ONLY (decl
))
1533 p
= (* targetm
.strip_name_encoding
) (name
);
1534 xname
= xstrdup (p
);
1535 first_global_object_name
= xname
;
1538 /* Compute the alignment of this data. */
1540 align
= DECL_ALIGN (decl
);
1542 /* In the case for initialing an array whose length isn't specified,
1543 where we have not yet been able to do the layout,
1544 figure out the proper alignment now. */
1545 if (dont_output_data
&& DECL_SIZE (decl
) == 0
1546 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
)
1547 align
= MAX (align
, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl
))));
1549 /* Some object file formats have a maximum alignment which they support.
1550 In particular, a.out format supports a maximum alignment of 4. */
1551 #ifndef MAX_OFILE_ALIGNMENT
1552 #define MAX_OFILE_ALIGNMENT BIGGEST_ALIGNMENT
1554 if (align
> MAX_OFILE_ALIGNMENT
)
1556 warning_with_decl (decl
,
1557 "alignment of `%s' is greater than maximum object file alignment. Using %d",
1558 MAX_OFILE_ALIGNMENT
/BITS_PER_UNIT
);
1559 align
= MAX_OFILE_ALIGNMENT
;
1562 /* On some machines, it is good to increase alignment sometimes. */
1563 if (! DECL_USER_ALIGN (decl
))
1565 #ifdef DATA_ALIGNMENT
1566 align
= DATA_ALIGNMENT (TREE_TYPE (decl
), align
);
1568 #ifdef CONSTANT_ALIGNMENT
1569 if (DECL_INITIAL (decl
) != 0 && DECL_INITIAL (decl
) != error_mark_node
)
1570 align
= CONSTANT_ALIGNMENT (DECL_INITIAL (decl
), align
);
1574 /* Reset the alignment in case we have made it tighter, so we can benefit
1575 from it in get_pointer_alignment. */
1576 DECL_ALIGN (decl
) = align
;
1577 set_mem_align (decl_rtl
, align
);
1579 if (TREE_PUBLIC (decl
))
1580 maybe_assemble_visibility (decl
);
1582 /* Output any data that we will need to use the address of. */
1583 if (DECL_INITIAL (decl
) == error_mark_node
)
1584 reloc
= contains_pointers_p (TREE_TYPE (decl
)) ? 3 : 0;
1585 else if (DECL_INITIAL (decl
))
1586 reloc
= output_addressed_constants (DECL_INITIAL (decl
));
1587 resolve_unique_section (decl
, reloc
, flag_data_sections
);
1589 /* Handle uninitialized definitions. */
1591 /* If the decl has been given an explicit section name, then it
1592 isn't common, and shouldn't be handled as such. */
1593 if (DECL_SECTION_NAME (decl
) || dont_output_data
)
1595 /* We don't implement common thread-local data at present. */
1596 else if (DECL_THREAD_LOCAL (decl
))
1598 if (DECL_COMMON (decl
))
1599 sorry ("thread-local COMMON data not implemented");
1601 else if (DECL_INITIAL (decl
) == 0
1602 || DECL_INITIAL (decl
) == error_mark_node
1603 || (flag_zero_initialized_in_bss
1604 && initializer_zerop (DECL_INITIAL (decl
))))
1606 unsigned HOST_WIDE_INT size
= tree_low_cst (DECL_SIZE_UNIT (decl
), 1);
1607 unsigned HOST_WIDE_INT rounded
= size
;
1609 /* Don't allocate zero bytes of common,
1610 since that means "undefined external" in the linker. */
1614 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1615 so that each uninitialized object starts on such a boundary. */
1616 rounded
+= (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1;
1617 rounded
= (rounded
/ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1618 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1620 #if !defined(ASM_OUTPUT_ALIGNED_COMMON) && !defined(ASM_OUTPUT_ALIGNED_DECL_COMMON) && !defined(ASM_OUTPUT_ALIGNED_BSS)
1621 if ((unsigned HOST_WIDE_INT
) DECL_ALIGN (decl
) / BITS_PER_UNIT
> rounded
)
1623 (decl
, "requested alignment for %s is greater than implemented alignment of %d",rounded
);
1626 /* If the target cannot output uninitialized but not common global data
1627 in .bss, then we have to use .data, so fall through. */
1628 if (asm_emit_uninitialised (decl
, name
, size
, rounded
))
1632 /* Handle initialized definitions.
1633 Also handle uninitialized global definitions if -fno-common and the
1634 target doesn't support ASM_OUTPUT_BSS. */
1636 /* First make the assembler name(s) global if appropriate. */
1637 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
))
1638 globalize_decl (decl
);
1640 /* Switch to the appropriate section. */
1641 variable_section (decl
, reloc
);
1643 /* dbxout.c needs to know this. */
1644 if (in_text_section ())
1645 DECL_IN_TEXT_SECTION (decl
) = 1;
1647 /* Output the alignment of this data. */
1648 if (align
> BITS_PER_UNIT
)
1650 ASM_OUTPUT_ALIGN (asm_out_file
,
1651 floor_log2 (DECL_ALIGN (decl
) / BITS_PER_UNIT
));
1654 /* Do any machine/system dependent processing of the object. */
1655 #ifdef ASM_DECLARE_OBJECT_NAME
1656 last_assemble_variable_decl
= decl
;
1657 ASM_DECLARE_OBJECT_NAME (asm_out_file
, name
, decl
);
1659 /* Standard thing is just output label for the object. */
1660 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1661 #endif /* ASM_DECLARE_OBJECT_NAME */
1663 if (!dont_output_data
)
1665 if (DECL_INITIAL (decl
) && DECL_INITIAL (decl
) != error_mark_node
)
1666 /* Output the actual data. */
1667 output_constant (DECL_INITIAL (decl
),
1668 tree_low_cst (DECL_SIZE_UNIT (decl
), 1),
1671 /* Leave space for it. */
1672 assemble_zeros (tree_low_cst (DECL_SIZE_UNIT (decl
), 1));
1676 /* Return 1 if type TYPE contains any pointers. */
1679 contains_pointers_p (type
)
1682 switch (TREE_CODE (type
))
1685 case REFERENCE_TYPE
:
1686 /* I'm not sure whether OFFSET_TYPE needs this treatment,
1687 so I'll play safe and return 1. */
1693 case QUAL_UNION_TYPE
:
1696 /* For a type that has fields, see if the fields have pointers. */
1697 for (fields
= TYPE_FIELDS (type
); fields
; fields
= TREE_CHAIN (fields
))
1698 if (TREE_CODE (fields
) == FIELD_DECL
1699 && contains_pointers_p (TREE_TYPE (fields
)))
1705 /* An array type contains pointers if its element type does. */
1706 return contains_pointers_p (TREE_TYPE (type
));
1713 /* Output something to declare an external symbol to the assembler.
1714 (Most assemblers don't need this, so we normally output nothing.)
1715 Do nothing if DECL is not external. */
1718 assemble_external (decl
)
1719 tree decl ATTRIBUTE_UNUSED
;
1721 /* Because most platforms do not define ASM_OUTPUT_EXTERNAL, the
1722 main body of this code is only rarely exercised. To provide some
1723 testing, on all platforms, we make sure that the ASM_OUT_FILE is
1724 open. If it's not, we should not be calling this function. */
1728 #ifdef ASM_OUTPUT_EXTERNAL
1729 if (DECL_P (decl
) && DECL_EXTERNAL (decl
) && TREE_PUBLIC (decl
))
1731 rtx rtl
= DECL_RTL (decl
);
1733 if (GET_CODE (rtl
) == MEM
&& GET_CODE (XEXP (rtl
, 0)) == SYMBOL_REF
1734 && ! SYMBOL_REF_USED (XEXP (rtl
, 0)))
1736 /* Some systems do require some output. */
1737 SYMBOL_REF_USED (XEXP (rtl
, 0)) = 1;
1738 ASM_OUTPUT_EXTERNAL (asm_out_file
, decl
, XSTR (XEXP (rtl
, 0), 0));
1744 /* Similar, for calling a library function FUN. */
1747 assemble_external_libcall (fun
)
1748 rtx fun ATTRIBUTE_UNUSED
;
1750 #ifdef ASM_OUTPUT_EXTERNAL_LIBCALL
1751 /* Declare library function name external when first used, if nec. */
1752 if (! SYMBOL_REF_USED (fun
))
1754 SYMBOL_REF_USED (fun
) = 1;
1755 ASM_OUTPUT_EXTERNAL_LIBCALL (asm_out_file
, fun
);
1760 /* Assemble a label named NAME. */
1763 assemble_label (name
)
1766 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1769 /* Output to FILE a reference to the assembler name of a C-level name NAME.
1770 If NAME starts with a *, the rest of NAME is output verbatim.
1771 Otherwise NAME is transformed in an implementation-defined way
1772 (usually by the addition of an underscore).
1773 Many macros in the tm file are defined to call this function. */
1776 assemble_name (file
, name
)
1780 const char *real_name
;
1783 real_name
= (* targetm
.strip_name_encoding
) (name
);
1785 id
= maybe_get_identifier (real_name
);
1787 TREE_SYMBOL_REFERENCED (id
) = 1;
1790 fputs (&name
[1], file
);
1792 ASM_OUTPUT_LABELREF (file
, name
);
1795 /* Allocate SIZE bytes writable static space with a gensym name
1796 and return an RTX to refer to its address. */
1799 assemble_static_space (size
)
1803 const char *namestring
;
1807 if (flag_shared_data
)
1811 ASM_GENERATE_INTERNAL_LABEL (name
, "LF", const_labelno
);
1813 namestring
= ggc_strdup (name
);
1815 x
= gen_rtx_SYMBOL_REF (Pmode
, namestring
);
1817 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
1818 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file
, NULL_TREE
, name
, size
,
1821 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1822 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file
, name
, size
, BIGGEST_ALIGNMENT
);
1825 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1826 so that each uninitialized object starts on such a boundary. */
1827 /* Variable `rounded' might or might not be used in ASM_OUTPUT_LOCAL. */
1828 int rounded ATTRIBUTE_UNUSED
1829 = ((size
+ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1)
1830 / (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1831 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1832 ASM_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
1839 /* Assemble the static constant template for function entry trampolines.
1840 This is done at most once per compilation.
1841 Returns an RTX for the address of the template. */
1843 #ifdef TRAMPOLINE_TEMPLATE
1845 assemble_trampoline_template ()
1851 /* By default, put trampoline templates in read-only data section. */
1853 #ifdef TRAMPOLINE_SECTION
1854 TRAMPOLINE_SECTION ();
1856 readonly_data_section ();
1859 /* Write the assembler code to define one. */
1860 align
= floor_log2 (TRAMPOLINE_ALIGNMENT
/ BITS_PER_UNIT
);
1863 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1866 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LTRAMP", 0);
1867 TRAMPOLINE_TEMPLATE (asm_out_file
);
1869 /* Record the rtl to refer to it. */
1870 ASM_GENERATE_INTERNAL_LABEL (label
, "LTRAMP", 0);
1871 name
= ggc_strdup (label
);
1872 return gen_rtx_SYMBOL_REF (Pmode
, name
);
1876 /* A and B are either alignments or offsets. Return the minimum alignment
1877 that may be assumed after adding the two together. */
1879 static inline unsigned
1883 return (a
| b
) & -(a
| b
);
1886 /* Return the assembler directive for creating a given kind of integer
1887 object. SIZE is the number of bytes in the object and ALIGNED_P
1888 indicates whether it is known to be aligned. Return NULL if the
1889 assembly dialect has no such directive.
1891 The returned string should be printed at the start of a new line and
1892 be followed immediately by the object's initial value. */
1895 integer_asm_op (size
, aligned_p
)
1899 struct asm_int_op
*ops
;
1902 ops
= &targetm
.asm_out
.aligned_op
;
1904 ops
= &targetm
.asm_out
.unaligned_op
;
1909 return targetm
.asm_out
.byte_op
;
1923 /* Use directive OP to assemble an integer object X. Print OP at the
1924 start of the line, followed immediately by the value of X. */
1927 assemble_integer_with_op (op
, x
)
1931 fputs (op
, asm_out_file
);
1932 output_addr_const (asm_out_file
, x
);
1933 fputc ('\n', asm_out_file
);
1936 /* The default implementation of the asm_out.integer target hook. */
1939 default_assemble_integer (x
, size
, aligned_p
)
1940 rtx x ATTRIBUTE_UNUSED
;
1941 unsigned int size ATTRIBUTE_UNUSED
;
1942 int aligned_p ATTRIBUTE_UNUSED
;
1944 const char *op
= integer_asm_op (size
, aligned_p
);
1945 return op
&& (assemble_integer_with_op (op
, x
), true);
1948 /* Assemble the integer constant X into an object of SIZE bytes. ALIGN is
1949 the alignment of the integer in bits. Return 1 if we were able to output
1950 the constant, otherwise 0. If FORCE is nonzero, abort if we can't output
1954 assemble_integer (x
, size
, align
, force
)
1962 aligned_p
= (align
>= MIN (size
* BITS_PER_UNIT
, BIGGEST_ALIGNMENT
));
1964 /* See if the target hook can handle this kind of object. */
1965 if ((*targetm
.asm_out
.integer
) (x
, size
, aligned_p
))
1968 /* If the object is a multi-byte one, try splitting it up. Split
1969 it into words it if is multi-word, otherwise split it into bytes. */
1972 enum machine_mode omode
, imode
;
1973 unsigned int subalign
;
1974 unsigned int subsize
, i
;
1976 subsize
= size
> UNITS_PER_WORD
? UNITS_PER_WORD
: 1;
1977 subalign
= MIN (align
, subsize
* BITS_PER_UNIT
);
1978 omode
= mode_for_size (subsize
* BITS_PER_UNIT
, MODE_INT
, 0);
1979 imode
= mode_for_size (size
* BITS_PER_UNIT
, MODE_INT
, 0);
1981 for (i
= 0; i
< size
; i
+= subsize
)
1983 rtx partial
= simplify_subreg (omode
, x
, imode
, i
);
1984 if (!partial
|| !assemble_integer (partial
, subsize
, subalign
, 0))
1990 /* If we've printed some of it, but not all of it, there's no going
2003 assemble_real (d
, mode
, align
)
2005 enum machine_mode mode
;
2010 unsigned int nalign
= min_align (align
, 32);
2012 switch (BITS_PER_UNIT
)
2018 REAL_VALUE_TO_TARGET_SINGLE (d
, l
);
2019 assemble_integer (GEN_INT (l
), 4, align
, 1);
2022 REAL_VALUE_TO_TARGET_DOUBLE (d
, data
);
2023 assemble_integer (GEN_INT (data
[0]), 4, align
, 1);
2024 assemble_integer (GEN_INT (data
[1]), 4, nalign
, 1);
2027 REAL_VALUE_TO_TARGET_LONG_DOUBLE (d
, data
);
2028 assemble_integer (GEN_INT (data
[0]), 4, align
, 1);
2029 assemble_integer (GEN_INT (data
[1]), 4, nalign
, 1);
2030 assemble_integer (GEN_INT (data
[2]), 4, nalign
, 1);
2033 REAL_VALUE_TO_TARGET_LONG_DOUBLE (d
, data
);
2034 assemble_integer (GEN_INT (data
[0]), 4, align
, 1);
2035 assemble_integer (GEN_INT (data
[1]), 4, nalign
, 1);
2036 assemble_integer (GEN_INT (data
[2]), 4, nalign
, 1);
2037 assemble_integer (GEN_INT (data
[3]), 4, nalign
, 1);
2048 REAL_VALUE_TO_TARGET_SINGLE (d
, l
);
2049 assemble_integer (GEN_INT (l
), 2, align
, 1);
2052 REAL_VALUE_TO_TARGET_DOUBLE (d
, data
);
2053 assemble_integer (GEN_INT (data
[0]), 2, align
, 1);
2054 assemble_integer (GEN_INT (data
[1]), 1, nalign
, 1);
2065 REAL_VALUE_TO_TARGET_SINGLE (d
, l
);
2066 assemble_integer (GEN_INT (l
), 1, align
, 1);
2069 REAL_VALUE_TO_TARGET_DOUBLE (d
, data
);
2070 assemble_integer (GEN_INT (data
[0]), 1, align
, 1);
2071 assemble_integer (GEN_INT (data
[1]), 1, nalign
, 1);
2083 /* Given an expression EXP with a constant value,
2084 reduce it to the sum of an assembler symbol and an integer.
2085 Store them both in the structure *VALUE.
2086 Abort if EXP does not reduce. */
2088 struct addr_const
GTY(())
2091 HOST_WIDE_INT offset
;
2095 decode_addr_const (exp
, value
)
2097 struct addr_const
*value
;
2099 tree target
= TREE_OPERAND (exp
, 0);
2105 if (TREE_CODE (target
) == COMPONENT_REF
2106 && host_integerp (byte_position (TREE_OPERAND (target
, 1)), 0))
2109 offset
+= int_byte_position (TREE_OPERAND (target
, 1));
2110 target
= TREE_OPERAND (target
, 0);
2112 else if (TREE_CODE (target
) == ARRAY_REF
2113 || TREE_CODE (target
) == ARRAY_RANGE_REF
)
2115 offset
+= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (target
)), 1)
2116 * tree_low_cst (TREE_OPERAND (target
, 1), 0));
2117 target
= TREE_OPERAND (target
, 0);
2123 switch (TREE_CODE (target
))
2127 x
= DECL_RTL (target
);
2131 x
= gen_rtx_MEM (FUNCTION_MODE
,
2132 gen_rtx_LABEL_REF (VOIDmode
,
2133 label_rtx (TREE_OPERAND (exp
, 0))));
2141 /* This constant should have been output already, but we can't simply
2142 use TREE_CST_RTL since INTEGER_CST doesn't have one. */
2143 x
= output_constant_def (target
, 1);
2150 if (GET_CODE (x
) != MEM
)
2155 value
->offset
= offset
;
2158 /* We do RTX_UNSPEC + XINT (blah), so nothing can go after RTX_UNSPEC. */
2159 enum kind
{ RTX_UNKNOWN
, RTX_DOUBLE
, RTX_VECTOR
, RTX_INT
, RTX_UNSPEC
};
2160 struct rtx_const
GTY(())
2162 ENUM_BITFIELD(kind
) kind
: 16;
2163 ENUM_BITFIELD(machine_mode
) mode
: 16;
2164 union rtx_const_un
{
2166 struct addr_const
GTY ((tag ("1"))) addr
;
2167 struct rtx_const_u_di
{
2170 } GTY ((tag ("0"))) di
;
2172 /* The max vector size we have is 8 wide; two variants for
2173 integral and floating point vectors. */
2174 struct rtx_const_int_vec
{
2177 } GTY ((tag ("2"))) int_vec
[8];
2179 REAL_VALUE_TYPE
GTY ((tag ("3"))) fp_vec
[8];
2181 } GTY ((desc ("%1.kind >= RTX_INT"), descbits ("1"))) un
;
2184 /* Uniquize all constants that appear in memory.
2185 Each constant in memory thus far output is recorded
2186 in `const_hash_table'. */
2188 struct constant_descriptor_tree
GTY(())
2190 /* More constant_descriptors with the same hash code. */
2191 struct constant_descriptor_tree
*next
;
2193 /* The label of the constant. */
2196 /* A MEM for the constant. */
2199 /* The value of the constant. */
2203 #define MAX_HASH_TABLE 1009
2204 static GTY(()) struct constant_descriptor_tree
*
2205 const_hash_table
[MAX_HASH_TABLE
];
2207 /* We maintain a hash table of STRING_CST values. Unless we are asked to force
2208 out a string constant, we defer output of the constants until we know
2209 they are actually used. This will be if something takes its address or if
2210 there is a usage of the string in the RTL of a function. */
2212 #define STRHASH(x) htab_hash_pointer (x)
2214 struct deferred_string
GTY(())
2221 static GTY ((param_is (struct deferred_string
))) htab_t const_str_htab
;
2223 /* Returns a hash code for X (which is a really a
2224 struct deferred_string *). */
2227 const_str_htab_hash (x
)
2230 return STRHASH (((const struct deferred_string
*) x
)->label
);
2233 /* Returns nonzero if the value represented by X (which is really a
2234 struct deferred_string *) is the same as that given by Y
2235 (which is really a char *). */
2238 const_str_htab_eq (x
, y
)
2242 return (((const struct deferred_string
*) x
)->label
== (const char *) y
);
2245 /* Compute a hash code for a constant expression. */
2251 return const_hash_1 (exp
) % MAX_HASH_TABLE
;
2261 enum tree_code code
= TREE_CODE (exp
);
2263 /* Either set P and LEN to the address and len of something to hash and
2264 exit the switch or return a value. */
2269 p
= (char *) &TREE_INT_CST (exp
);
2270 len
= sizeof TREE_INT_CST (exp
);
2274 return real_hash (TREE_REAL_CST_PTR (exp
));
2277 p
= TREE_STRING_POINTER (exp
);
2278 len
= TREE_STRING_LENGTH (exp
);
2282 return (const_hash_1 (TREE_REALPART (exp
)) * 5
2283 + const_hash_1 (TREE_IMAGPART (exp
)));
2286 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2290 len
= int_size_in_bytes (TREE_TYPE (exp
));
2291 tmp
= (char *) alloca (len
);
2292 get_set_constructor_bytes (exp
, (unsigned char *) tmp
, len
);
2300 hi
= 5 + int_size_in_bytes (TREE_TYPE (exp
));
2302 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2303 if (TREE_VALUE (link
))
2304 hi
= hi
* 603 + const_hash_1 (TREE_VALUE (link
));
2312 struct addr_const value
;
2314 decode_addr_const (exp
, &value
);
2315 if (GET_CODE (value
.base
) == SYMBOL_REF
)
2317 /* Don't hash the address of the SYMBOL_REF;
2318 only use the offset and the symbol name. */
2320 p
= XSTR (value
.base
, 0);
2321 for (i
= 0; p
[i
] != 0; i
++)
2322 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2324 else if (GET_CODE (value
.base
) == LABEL_REF
)
2325 hi
= value
.offset
+ CODE_LABEL_NUMBER (XEXP (value
.base
, 0)) * 13;
2333 return (const_hash_1 (TREE_OPERAND (exp
, 0)) * 9
2334 + const_hash_1 (TREE_OPERAND (exp
, 1)));
2338 case NON_LVALUE_EXPR
:
2339 return const_hash_1 (TREE_OPERAND (exp
, 0)) * 7 + 2;
2342 /* A language specific constant. Just hash the code. */
2346 /* Compute hashing function */
2348 for (i
= 0; i
< len
; i
++)
2349 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2354 /* Compare t1 and t2, and return 1 only if they are known to result in
2355 the same bit pattern on output. */
2358 compare_constant (t1
, t2
)
2362 enum tree_code typecode
;
2364 if (t1
== NULL_TREE
)
2365 return t2
== NULL_TREE
;
2366 if (t2
== NULL_TREE
)
2369 if (TREE_CODE (t1
) != TREE_CODE (t2
))
2372 switch (TREE_CODE (t1
))
2375 /* Integer constants are the same only if the same width of type. */
2376 if (TYPE_PRECISION (TREE_TYPE (t1
)) != TYPE_PRECISION (TREE_TYPE (t2
)))
2378 return tree_int_cst_equal (t1
, t2
);
2381 /* Real constants are the same only if the same width of type. */
2382 if (TYPE_PRECISION (TREE_TYPE (t1
)) != TYPE_PRECISION (TREE_TYPE (t2
)))
2385 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
2388 if (flag_writable_strings
)
2391 if (TYPE_MODE (TREE_TYPE (t1
)) != TYPE_MODE (TREE_TYPE (t2
)))
2394 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
2395 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
2396 TREE_STRING_LENGTH (t1
)));
2399 return (compare_constant (TREE_REALPART (t1
), TREE_REALPART (t2
))
2400 && compare_constant (TREE_IMAGPART (t1
), TREE_IMAGPART (t2
)));
2403 typecode
= TREE_CODE (TREE_TYPE (t1
));
2404 if (typecode
!= TREE_CODE (TREE_TYPE (t2
)))
2407 if (typecode
== SET_TYPE
)
2409 int len
= int_size_in_bytes (TREE_TYPE (t2
));
2410 unsigned char *tmp1
, *tmp2
;
2412 if (int_size_in_bytes (TREE_TYPE (t1
)) != len
)
2415 tmp1
= (unsigned char *) alloca (len
);
2416 tmp2
= (unsigned char *) alloca (len
);
2418 if (get_set_constructor_bytes (t1
, tmp1
, len
) != NULL_TREE
)
2420 if (get_set_constructor_bytes (t2
, tmp2
, len
) != NULL_TREE
)
2423 return memcmp (tmp1
, tmp2
, len
) != 0;
2429 if (typecode
== ARRAY_TYPE
)
2431 HOST_WIDE_INT size_1
= int_size_in_bytes (TREE_TYPE (t1
));
2432 /* For arrays, check that the sizes all match. */
2433 if (TYPE_MODE (TREE_TYPE (t1
)) != TYPE_MODE (TREE_TYPE (t2
))
2435 || size_1
!= int_size_in_bytes (TREE_TYPE (t2
)))
2440 /* For record and union constructors, require exact type
2442 if (TREE_TYPE (t1
) != TREE_TYPE (t2
))
2446 for (l1
= CONSTRUCTOR_ELTS (t1
), l2
= CONSTRUCTOR_ELTS (t2
);
2448 l1
= TREE_CHAIN (l1
), l2
= TREE_CHAIN (l2
))
2450 /* Check that each value is the same... */
2451 if (! compare_constant (TREE_VALUE (l1
), TREE_VALUE (l2
)))
2453 /* ... and that they apply to the same fields! */
2454 if (typecode
== ARRAY_TYPE
)
2456 if (! compare_constant (TREE_PURPOSE (l1
),
2462 if (TREE_PURPOSE (l1
) != TREE_PURPOSE (l2
))
2467 return l1
== NULL_TREE
&& l2
== NULL_TREE
;
2473 struct addr_const value1
, value2
;
2475 decode_addr_const (t1
, &value1
);
2476 decode_addr_const (t2
, &value2
);
2477 return (value1
.offset
== value2
.offset
2478 && strcmp (XSTR (value1
.base
, 0), XSTR (value2
.base
, 0)) == 0);
2484 return (compare_constant (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0))
2485 && compare_constant(TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1)));
2489 case NON_LVALUE_EXPR
:
2490 return compare_constant (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
2495 nt1
= (*lang_hooks
.expand_constant
) (t1
);
2496 nt2
= (*lang_hooks
.expand_constant
) (t2
);
2497 if (nt1
!= t1
|| nt2
!= t2
)
2498 return compare_constant (nt1
, nt2
);
2504 /* Should not get here. */
2508 /* Record a list of constant expressions that were passed to
2509 output_constant_def but that could not be output right away. */
2511 struct deferred_constant
2513 struct deferred_constant
*next
;
2519 static struct deferred_constant
*deferred_constants
;
2521 /* Another list of constants which should be output after the
2523 static struct deferred_constant
*after_function_constants
;
2525 /* Nonzero means defer output of addressed subconstants
2526 (i.e., those for which output_constant_def is called.) */
2527 static int defer_addressed_constants_flag
;
2529 /* Start deferring output of subconstants. */
2532 defer_addressed_constants ()
2534 defer_addressed_constants_flag
++;
2537 /* Stop deferring output of subconstants,
2538 and output now all those that have been deferred. */
2541 output_deferred_addressed_constants ()
2543 struct deferred_constant
*p
, *next
;
2545 defer_addressed_constants_flag
--;
2547 if (defer_addressed_constants_flag
> 0)
2550 for (p
= deferred_constants
; p
; p
= next
)
2552 output_constant_def_contents (p
->exp
, p
->reloc
, p
->labelno
);
2557 deferred_constants
= 0;
2560 /* Output any constants which should appear after a function. */
2563 output_after_function_constants ()
2565 struct deferred_constant
*p
, *next
;
2567 for (p
= after_function_constants
; p
; p
= next
)
2569 output_constant_def_contents (p
->exp
, p
->reloc
, p
->labelno
);
2574 after_function_constants
= 0;
2577 /* Make a copy of the whole tree structure for a constant. This
2578 handles the same types of nodes that compare_constant handles. */
2584 switch (TREE_CODE (exp
))
2587 /* For ADDR_EXPR, we do not want to copy the decl whose address
2588 is requested. We do want to copy constants though. */
2589 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, 0))) == 'c')
2590 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2591 copy_constant (TREE_OPERAND (exp
, 0)));
2593 return copy_node (exp
);
2598 return copy_node (exp
);
2601 return build_complex (TREE_TYPE (exp
),
2602 copy_constant (TREE_REALPART (exp
)),
2603 copy_constant (TREE_IMAGPART (exp
)));
2607 return build (TREE_CODE (exp
), TREE_TYPE (exp
),
2608 copy_constant (TREE_OPERAND (exp
, 0)),
2609 copy_constant (TREE_OPERAND (exp
, 1)));
2613 case NON_LVALUE_EXPR
:
2614 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2615 copy_constant (TREE_OPERAND (exp
, 0)));
2619 tree copy
= copy_node (exp
);
2620 tree list
= copy_list (CONSTRUCTOR_ELTS (exp
));
2623 CONSTRUCTOR_ELTS (copy
) = list
;
2624 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
2625 TREE_VALUE (tail
) = copy_constant (TREE_VALUE (tail
));
2626 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2627 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
2628 TREE_PURPOSE (tail
) = copy_constant (TREE_PURPOSE (tail
));
2636 t
= (*lang_hooks
.expand_constant
) (exp
);
2638 return copy_constant (t
);
2645 /* Return an rtx representing a reference to constant data in memory
2646 for the constant expression EXP.
2648 If assembler code for such a constant has already been output,
2649 return an rtx to refer to it.
2650 Otherwise, output such a constant in memory (or defer it for later)
2651 and generate an rtx for it.
2653 If DEFER is nonzero, the output of string constants can be deferred
2654 and output only if referenced in the function after all optimizations.
2656 The TREE_CST_RTL of EXP is set up to point to that rtx.
2657 The const_hash_table records which constants already have label strings. */
2660 output_constant_def (exp
, defer
)
2665 struct constant_descriptor_tree
*desc
;
2666 struct deferred_string
**defstr
;
2670 int after_function
= 0;
2674 /* We can't just use the saved RTL if this is a deferred string constant
2675 and we are not to defer anymore. */
2676 if (TREE_CODE (exp
) != INTEGER_CST
&& TREE_CST_RTL (exp
)
2677 && (defer
|| !STRING_POOL_ADDRESS_P (XEXP (TREE_CST_RTL (exp
), 0))))
2678 return TREE_CST_RTL (exp
);
2680 /* Make sure any other constants whose addresses appear in EXP
2681 are assigned label numbers. */
2683 reloc
= output_addressed_constants (exp
);
2685 /* Compute hash code of EXP. Search the descriptors for that hash code
2686 to see if any of them describes EXP. If yes, the descriptor records
2687 the label number already assigned. */
2689 hash
= const_hash (exp
);
2691 for (desc
= const_hash_table
[hash
]; desc
; desc
= desc
->next
)
2692 if (compare_constant (exp
, desc
->value
))
2697 /* No constant equal to EXP is known to have been output.
2698 Make a constant descriptor to enter EXP in the hash table.
2699 Assign the label number and record it in the descriptor for
2700 future calls to this function to find. */
2702 /* Create a string containing the label name, in LABEL. */
2703 labelno
= const_labelno
++;
2704 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", labelno
);
2706 desc
= ggc_alloc (sizeof (*desc
));
2707 desc
->next
= const_hash_table
[hash
];
2708 desc
->label
= ggc_strdup (label
);
2709 desc
->value
= copy_constant (exp
);
2710 const_hash_table
[hash
] = desc
;
2712 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
2714 = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp
)),
2715 gen_rtx_SYMBOL_REF (Pmode
, desc
->label
));
2717 set_mem_attributes (rtl
, exp
, 1);
2718 set_mem_alias_set (rtl
, 0);
2719 set_mem_alias_set (rtl
, const_alias_set
);
2726 if (TREE_CODE (exp
) != INTEGER_CST
)
2727 TREE_CST_RTL (exp
) = rtl
;
2729 /* Optionally set flags or add text to the name to record information
2730 such as that it is a function name. If the name is changed, the macro
2731 ASM_OUTPUT_LABELREF will have to know how to strip this information. */
2732 /* A previously-processed constant would already have section info
2736 /* Take care not to invoke targetm.encode_section_info for
2737 constants which don't have a TREE_CST_RTL. */
2738 if (TREE_CODE (exp
) != INTEGER_CST
)
2739 (*targetm
.encode_section_info
) (exp
, true);
2742 desc
->label
= XSTR (XEXP (desc
->rtl
, 0), 0);
2745 #ifdef CONSTANT_AFTER_FUNCTION_P
2746 if (current_function_decl
!= 0
2747 && CONSTANT_AFTER_FUNCTION_P (exp
))
2752 && STRING_POOL_ADDRESS_P (XEXP (rtl
, 0))
2753 && (!defer
|| defer_addressed_constants_flag
|| after_function
))
2755 defstr
= (struct deferred_string
**)
2756 htab_find_slot_with_hash (const_str_htab
, desc
->label
,
2757 STRHASH (desc
->label
), NO_INSERT
);
2760 /* If the string is currently deferred but we need to output it now,
2761 remove it from deferred string hash table. */
2763 labelno
= (*defstr
)->labelno
;
2764 STRING_POOL_ADDRESS_P (XEXP (rtl
, 0)) = 0;
2765 htab_clear_slot (const_str_htab
, (void **) defstr
);
2769 /* If this is the first time we've seen this particular constant,
2770 output it (or defer its output for later). */
2773 if (defer_addressed_constants_flag
|| after_function
)
2775 struct deferred_constant
*p
2776 = (struct deferred_constant
*)
2777 xmalloc (sizeof (struct deferred_constant
));
2779 p
->exp
= desc
->value
;
2781 p
->labelno
= labelno
;
2784 p
->next
= after_function_constants
;
2785 after_function_constants
= p
;
2789 p
->next
= deferred_constants
;
2790 deferred_constants
= p
;
2795 /* Do no output if -fsyntax-only. */
2796 if (! flag_syntax_only
)
2798 if (TREE_CODE (exp
) != STRING_CST
2800 || flag_writable_strings
2801 || (defstr
= (struct deferred_string
**)
2802 htab_find_slot_with_hash (const_str_htab
,
2804 STRHASH (desc
->label
),
2806 output_constant_def_contents (exp
, reloc
, labelno
);
2809 struct deferred_string
*p
;
2811 p
= (struct deferred_string
*)
2812 ggc_alloc (sizeof (struct deferred_string
));
2814 p
->exp
= desc
->value
;
2815 p
->label
= desc
->label
;
2816 p
->labelno
= labelno
;
2818 STRING_POOL_ADDRESS_P (XEXP (rtl
, 0)) = 1;
2827 /* Now output assembler code to define the label for EXP,
2828 and follow it with the data of EXP. */
2831 output_constant_def_contents (exp
, reloc
, labelno
)
2838 /* Align the location counter as required by EXP's data type. */
2839 align
= TYPE_ALIGN (TREE_TYPE (exp
));
2840 #ifdef CONSTANT_ALIGNMENT
2841 align
= CONSTANT_ALIGNMENT (exp
, align
);
2844 if (IN_NAMED_SECTION (exp
))
2845 named_section (exp
, NULL
, reloc
);
2847 (*targetm
.asm_out
.select_section
) (exp
, reloc
, align
);
2849 if (align
> BITS_PER_UNIT
)
2851 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
2854 /* Output the label itself. */
2855 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LC", labelno
);
2857 /* Output the value of EXP. */
2858 output_constant (exp
,
2859 (TREE_CODE (exp
) == STRING_CST
2860 ? MAX (TREE_STRING_LENGTH (exp
),
2861 int_size_in_bytes (TREE_TYPE (exp
)))
2862 : int_size_in_bytes (TREE_TYPE (exp
))),
2867 /* Used in the hash tables to avoid outputting the same constant
2868 twice. Unlike 'struct constant_descriptor_tree', RTX constants
2869 are output once per function, not once per file; there seems
2870 to be no reason for the difference. */
2872 struct constant_descriptor_rtx
GTY(())
2874 /* More constant_descriptors with the same hash code. */
2875 struct constant_descriptor_rtx
*next
;
2877 /* The label of the constant. */
2880 /* A MEM for the constant. */
2883 /* The value of the constant. */
2884 struct rtx_const value
;
2887 /* Structure to represent sufficient information about a constant so that
2888 it can be output when the constant pool is output, so that function
2889 integration can be done, and to simplify handling on machines that reference
2890 constant pool as base+displacement. */
2892 struct pool_constant
GTY(())
2894 struct constant_descriptor_rtx
*desc
;
2895 struct pool_constant
*next
;
2896 struct pool_constant
*next_sym
;
2898 enum machine_mode mode
;
2901 HOST_WIDE_INT offset
;
2905 /* Hash code for a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true.
2906 The argument is XSTR (... , 0) */
2908 #define SYMHASH(LABEL) (((unsigned long) (LABEL)) % MAX_RTX_HASH_TABLE)
2910 /* Initialize constant pool hashing for a new function. */
2913 init_varasm_status (f
)
2916 struct varasm_status
*p
;
2917 p
= (struct varasm_status
*) ggc_alloc (sizeof (struct varasm_status
));
2919 p
->x_const_rtx_hash_table
2920 = ((struct constant_descriptor_rtx
**)
2921 ggc_alloc_cleared (MAX_RTX_HASH_TABLE
2922 * sizeof (struct constant_descriptor_rtx
*)));
2923 p
->x_const_rtx_sym_hash_table
2924 = ((struct pool_constant
**)
2925 ggc_alloc_cleared (MAX_RTX_HASH_TABLE
2926 * sizeof (struct pool_constant
*)));
2928 p
->x_first_pool
= p
->x_last_pool
= 0;
2929 p
->x_pool_offset
= 0;
2933 /* Express an rtx for a constant integer (perhaps symbolic)
2934 as the sum of a symbol or label plus an explicit integer.
2935 They are stored into VALUE. */
2938 decode_rtx_const (mode
, x
, value
)
2939 enum machine_mode mode
;
2941 struct rtx_const
*value
;
2943 /* Clear the whole structure, including any gaps. */
2944 memset (value
, 0, sizeof (struct rtx_const
));
2946 value
->kind
= RTX_INT
; /* Most usual kind. */
2949 switch (GET_CODE (x
))
2952 value
->kind
= RTX_DOUBLE
;
2953 if (GET_MODE (x
) != VOIDmode
)
2955 const REAL_VALUE_TYPE
*r
= CONST_DOUBLE_REAL_VALUE (x
);
2957 value
->mode
= GET_MODE (x
);
2959 /* Copy the REAL_VALUE_TYPE by members so that we don't
2960 copy garbage from the original structure into our
2961 carefully cleaned hashing structure. */
2962 value
->un
.du
.class = r
->class;
2963 value
->un
.du
.sign
= r
->sign
;
2970 value
->un
.du
.exp
= r
->exp
;
2973 memcpy (value
->un
.du
.sig
, r
->sig
, sizeof (r
->sig
));
2981 value
->un
.di
.low
= CONST_DOUBLE_LOW (x
);
2982 value
->un
.di
.high
= CONST_DOUBLE_HIGH (x
);
2990 units
= CONST_VECTOR_NUNITS (x
);
2991 value
->kind
= RTX_VECTOR
;
2994 if (GET_MODE_CLASS (mode
) == MODE_VECTOR_INT
)
2996 for (i
= 0; i
< units
; ++i
)
2998 rtx elt
= CONST_VECTOR_ELT (x
, i
);
2999 if (GET_CODE (elt
) == CONST_INT
)
3001 value
->un
.int_vec
[i
].low
= INTVAL (elt
);
3002 value
->un
.int_vec
[i
].high
= 0;
3006 value
->un
.int_vec
[i
].low
= CONST_DOUBLE_LOW (elt
);
3007 value
->un
.int_vec
[i
].high
= CONST_DOUBLE_HIGH (elt
);
3011 else if (GET_MODE_CLASS (mode
) == MODE_VECTOR_FLOAT
)
3013 for (i
= 0; i
< units
; ++i
)
3015 const REAL_VALUE_TYPE
*r
3016 = CONST_DOUBLE_REAL_VALUE (CONST_VECTOR_ELT (x
, i
));
3017 REAL_VALUE_TYPE
*d
= &value
->un
.fp_vec
[i
];
3019 /* Copy the REAL_VALUE_TYPE by members so that we don't
3020 copy garbage from the original structure into our
3021 carefully cleaned hashing structure. */
3022 d
->class = r
->class;
3033 memcpy (d
->sig
, r
->sig
, sizeof (r
->sig
));
3046 value
->un
.addr
.offset
= INTVAL (x
);
3052 value
->un
.addr
.base
= x
;
3057 if (GET_CODE (x
) == PLUS
&& GET_CODE (XEXP (x
, 1)) == CONST_INT
)
3059 value
->un
.addr
.base
= XEXP (x
, 0);
3060 value
->un
.addr
.offset
= INTVAL (XEXP (x
, 1));
3062 else if (GET_CODE (x
) == MINUS
&& GET_CODE (XEXP (x
, 1)) == CONST_INT
)
3064 value
->un
.addr
.base
= XEXP (x
, 0);
3065 value
->un
.addr
.offset
= - INTVAL (XEXP (x
, 1));
3069 value
->un
.addr
.base
= x
;
3070 value
->un
.addr
.offset
= 0;
3075 value
->kind
= RTX_UNKNOWN
;
3079 if (value
->kind
== RTX_INT
&& value
->un
.addr
.base
!= 0
3080 && GET_CODE (value
->un
.addr
.base
) == UNSPEC
)
3082 /* For a simple UNSPEC, the base is set to the
3083 operand, the kind field is set to the index of
3084 the unspec expression.
3085 Together with the code below, in case that
3086 the operand is a SYMBOL_REF or LABEL_REF,
3087 the address of the string or the code_label
3088 is taken as base. */
3089 if (XVECLEN (value
->un
.addr
.base
, 0) == 1)
3091 value
->kind
= RTX_UNSPEC
+ XINT (value
->un
.addr
.base
, 1);
3092 value
->un
.addr
.base
= XVECEXP (value
->un
.addr
.base
, 0, 0);
3096 if (value
->kind
>= RTX_INT
&& value
->un
.addr
.base
!= 0)
3097 switch (GET_CODE (value
->un
.addr
.base
))
3101 /* Use the string's address, not the SYMBOL_REF's address,
3102 for the sake of addresses of library routines. */
3103 value
->un
.addr
.base
= (rtx
) XSTR (value
->un
.addr
.base
, 0);
3108 /* For a LABEL_REF, compare labels. */
3109 value
->un
.addr
.base
= XEXP (value
->un
.addr
.base
, 0);
3116 /* Given a MINUS expression, simplify it if both sides
3117 include the same symbol. */
3120 simplify_subtraction (x
)
3123 struct rtx_const val0
, val1
;
3125 decode_rtx_const (GET_MODE (x
), XEXP (x
, 0), &val0
);
3126 decode_rtx_const (GET_MODE (x
), XEXP (x
, 1), &val1
);
3128 if (val0
.kind
>= RTX_INT
3129 && val0
.kind
== val1
.kind
3130 && val0
.un
.addr
.base
== val1
.un
.addr
.base
)
3131 return GEN_INT (val0
.un
.addr
.offset
- val1
.un
.addr
.offset
);
3136 /* Compute a hash code for a constant RTL expression. */
3139 const_hash_rtx (mode
, x
)
3140 enum machine_mode mode
;
3144 struct rtx_const value
;
3145 unsigned int data
[sizeof(struct rtx_const
) / sizeof (unsigned int)];
3151 decode_rtx_const (mode
, x
, &u
.value
);
3153 /* Compute hashing function */
3155 for (i
= 0; i
< ARRAY_SIZE (u
.data
); i
++)
3156 hi
= hi
* 613 + u
.data
[i
];
3158 return hi
% MAX_RTX_HASH_TABLE
;
3161 /* Compare a constant rtl object X with a constant-descriptor DESC.
3162 Return 1 if DESC describes a constant with the same value as X. */
3165 compare_constant_rtx (mode
, x
, desc
)
3166 enum machine_mode mode
;
3168 struct constant_descriptor_rtx
*desc
;
3170 struct rtx_const value
;
3172 decode_rtx_const (mode
, x
, &value
);
3174 /* Compare constant contents. */
3175 return memcmp (&value
, &desc
->value
, sizeof (struct rtx_const
)) == 0;
3178 /* Construct a constant descriptor for the rtl-expression X.
3179 It is up to the caller to enter the descriptor in the hash table. */
3181 static struct constant_descriptor_rtx
*
3182 record_constant_rtx (mode
, x
)
3183 enum machine_mode mode
;
3186 struct constant_descriptor_rtx
*ptr
;
3188 ptr
= (struct constant_descriptor_rtx
*) ggc_alloc (sizeof (*ptr
));
3189 decode_rtx_const (mode
, x
, &ptr
->value
);
3194 /* Given a constant rtx X, return a MEM for the location in memory at which
3195 this constant has been placed. Return 0 if it not has been placed yet. */
3198 mem_for_const_double (x
)
3201 enum machine_mode mode
= GET_MODE (x
);
3202 struct constant_descriptor_rtx
*desc
;
3204 for (desc
= const_rtx_hash_table
[const_hash_rtx (mode
, x
)]; desc
;
3206 if (compare_constant_rtx (mode
, x
, desc
))
3212 /* Given a constant rtx X, make (or find) a memory constant for its value
3213 and return a MEM rtx to refer to it in memory. */
3216 force_const_mem (mode
, x
)
3217 enum machine_mode mode
;
3221 struct constant_descriptor_rtx
*desc
;
3224 struct pool_constant
*pool
;
3227 /* Compute hash code of X. Search the descriptors for that hash code
3228 to see if any of them describes X. If yes, we have an rtx to use. */
3229 hash
= const_hash_rtx (mode
, x
);
3230 for (desc
= const_rtx_hash_table
[hash
]; desc
; desc
= desc
->next
)
3231 if (compare_constant_rtx (mode
, x
, desc
))
3234 /* No constant equal to X is known to have been output.
3235 Make a constant descriptor to enter X in the hash table
3236 and make a MEM for it. */
3237 desc
= record_constant_rtx (mode
, x
);
3238 desc
->next
= const_rtx_hash_table
[hash
];
3239 const_rtx_hash_table
[hash
] = desc
;
3241 /* Align the location counter as required by EXP's data type. */
3242 align
= GET_MODE_ALIGNMENT (mode
== VOIDmode
? word_mode
: mode
);
3243 #ifdef CONSTANT_ALIGNMENT
3244 align
= CONSTANT_ALIGNMENT (make_tree ((*lang_hooks
.types
.type_for_mode
)
3245 (mode
, 0), x
), align
);
3248 pool_offset
+= (align
/ BITS_PER_UNIT
) - 1;
3249 pool_offset
&= ~ ((align
/ BITS_PER_UNIT
) - 1);
3251 if (GET_CODE (x
) == LABEL_REF
)
3252 LABEL_PRESERVE_P (XEXP (x
, 0)) = 1;
3254 /* Allocate a pool constant descriptor, fill it in, and chain it in. */
3255 pool
= (struct pool_constant
*) ggc_alloc (sizeof (struct pool_constant
));
3259 pool
->labelno
= const_labelno
;
3260 pool
->align
= align
;
3261 pool
->offset
= pool_offset
;
3268 last_pool
->next
= pool
;
3271 pool_offset
+= GET_MODE_SIZE (mode
);
3273 /* Create a string containing the label name, in LABEL. */
3274 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
3278 /* Construct the SYMBOL_REF and the MEM. */
3280 pool
->desc
->rtl
= def
3281 = gen_rtx_MEM (mode
, gen_rtx_SYMBOL_REF (Pmode
, ggc_strdup (label
)));
3282 set_mem_alias_set (def
, const_alias_set
);
3283 set_mem_attributes (def
, (*lang_hooks
.types
.type_for_mode
) (mode
, 0), 1);
3284 RTX_UNCHANGING_P (def
) = 1;
3286 /* Add label to symbol hash table. */
3287 hash
= SYMHASH (XSTR (XEXP (def
, 0), 0));
3288 pool
->next_sym
= const_rtx_sym_hash_table
[hash
];
3289 const_rtx_sym_hash_table
[hash
] = pool
;
3291 /* Mark the symbol_ref as belonging to this constants pool. */
3292 CONSTANT_POOL_ADDRESS_P (XEXP (def
, 0)) = 1;
3293 current_function_uses_const_pool
= 1;
3298 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
3299 the corresponding pool_constant structure. */
3301 static struct pool_constant
*
3302 find_pool_constant (f
, addr
)
3306 struct pool_constant
*pool
;
3307 const char *label
= XSTR (addr
, 0);
3309 for (pool
= f
->varasm
->x_const_rtx_sym_hash_table
[SYMHASH (label
)]; pool
;
3310 pool
= pool
->next_sym
)
3311 if (XSTR (XEXP (pool
->desc
->rtl
, 0), 0) == label
)
3317 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
3320 get_pool_constant (addr
)
3323 return (find_pool_constant (cfun
, addr
))->constant
;
3326 /* Given a constant pool SYMBOL_REF, return the corresponding constant
3327 and whether it has been output or not. */
3330 get_pool_constant_mark (addr
, pmarked
)
3334 struct pool_constant
*pool
= find_pool_constant (cfun
, addr
);
3335 *pmarked
= (pool
->mark
!= 0);
3336 return pool
->constant
;
3339 /* Likewise, but for the constant pool of a specific function. */
3342 get_pool_constant_for_function (f
, addr
)
3346 return (find_pool_constant (f
, addr
))->constant
;
3349 /* Similar, return the mode. */
3352 get_pool_mode (addr
)
3355 return (find_pool_constant (cfun
, addr
))->mode
;
3359 get_pool_mode_for_function (f
, addr
)
3363 return (find_pool_constant (f
, addr
))->mode
;
3366 /* Similar, return the offset in the constant pool. */
3369 get_pool_offset (addr
)
3372 return (find_pool_constant (cfun
, addr
))->offset
;
3375 /* Return the size of the constant pool. */
3383 /* Write all the constants in the constant pool. */
3386 output_constant_pool (fnname
, fndecl
)
3387 const char *fnname ATTRIBUTE_UNUSED
;
3388 tree fndecl ATTRIBUTE_UNUSED
;
3390 struct pool_constant
*pool
;
3394 /* It is possible for gcc to call force_const_mem and then to later
3395 discard the instructions which refer to the constant. In such a
3396 case we do not need to output the constant. */
3397 mark_constant_pool ();
3399 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3400 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3403 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3412 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3413 whose CODE_LABEL has been deleted. This can occur if a jump table
3414 is eliminated by optimization. If so, write a constant of zero
3415 instead. Note that this can also happen by turning the
3416 CODE_LABEL into a NOTE. */
3417 /* ??? This seems completely and utterly wrong. Certainly it's
3418 not true for NOTE_INSN_DELETED_LABEL, but I disbelieve proper
3419 functioning even with INSN_DELETED_P and friends. */
3422 switch (GET_CODE (x
))
3425 if (GET_CODE (XEXP (x
, 0)) != PLUS
3426 || GET_CODE (XEXP (XEXP (x
, 0), 0)) != LABEL_REF
)
3428 tmp
= XEXP (XEXP (x
, 0), 0);
3433 if (INSN_DELETED_P (tmp
)
3434 || (GET_CODE (tmp
) == NOTE
3435 && NOTE_LINE_NUMBER (tmp
) == NOTE_INSN_DELETED
))
3446 /* First switch to correct section. */
3447 (*targetm
.asm_out
.select_rtx_section
) (pool
->mode
, x
, pool
->align
);
3449 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3450 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file
, x
, pool
->mode
,
3451 pool
->align
, pool
->labelno
, done
);
3454 assemble_align (pool
->align
);
3456 /* Output the label. */
3457 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LC", pool
->labelno
);
3459 /* Output the value of the constant itself. */
3460 switch (GET_MODE_CLASS (pool
->mode
))
3463 if (GET_CODE (x
) != CONST_DOUBLE
)
3466 REAL_VALUE_FROM_CONST_DOUBLE (r
, x
);
3467 assemble_real (r
, pool
->mode
, pool
->align
);
3471 case MODE_PARTIAL_INT
:
3472 assemble_integer (x
, GET_MODE_SIZE (pool
->mode
), pool
->align
, 1);
3475 case MODE_VECTOR_FLOAT
:
3480 if (GET_CODE (x
) != CONST_VECTOR
)
3483 units
= CONST_VECTOR_NUNITS (x
);
3485 for (i
= 0; i
< units
; i
++)
3487 elt
= CONST_VECTOR_ELT (x
, i
);
3488 REAL_VALUE_FROM_CONST_DOUBLE (r
, elt
);
3489 assemble_real (r
, GET_MODE_INNER (pool
->mode
), pool
->align
);
3494 case MODE_VECTOR_INT
:
3499 if (GET_CODE (x
) != CONST_VECTOR
)
3502 units
= CONST_VECTOR_NUNITS (x
);
3504 for (i
= 0; i
< units
; i
++)
3506 elt
= CONST_VECTOR_ELT (x
, i
);
3507 assemble_integer (elt
, GET_MODE_UNIT_SIZE (pool
->mode
),
3517 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3522 #ifdef ASM_OUTPUT_POOL_EPILOGUE
3523 ASM_OUTPUT_POOL_EPILOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3526 /* Done with this pool. */
3527 first_pool
= last_pool
= 0;
3530 /* Look through the instructions for this function, and mark all the
3531 entries in the constant pool which are actually being used.
3532 Emit used deferred strings. */
3535 mark_constant_pool ()
3539 struct pool_constant
*pool
;
3541 if (first_pool
== 0 && htab_elements (const_str_htab
) == 0)
3544 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3547 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
3549 mark_constants (PATTERN (insn
));
3551 for (link
= current_function_epilogue_delay_list
;
3553 link
= XEXP (link
, 1))
3555 insn
= XEXP (link
, 0);
3558 mark_constants (PATTERN (insn
));
3562 /* Look through appropriate parts of X, marking all entries in the
3563 constant pool which are actually being used. Entries that are only
3564 referenced by other constants are also marked as used. Emit
3565 deferred strings that are used. */
3572 const char *format_ptr
;
3577 if (GET_CODE (x
) == SYMBOL_REF
)
3579 mark_constant (&x
, NULL
);
3583 /* Insns may appear inside a SEQUENCE. Only check the patterns of
3584 insns, not any notes that may be attached. We don't want to mark
3585 a constant just because it happens to appear in a REG_EQUIV note. */
3588 mark_constants (PATTERN (x
));
3592 format_ptr
= GET_RTX_FORMAT (GET_CODE (x
));
3594 for (i
= 0; i
< GET_RTX_LENGTH (GET_CODE (x
)); i
++)
3596 switch (*format_ptr
++)
3599 mark_constants (XEXP (x
, i
));
3603 if (XVEC (x
, i
) != 0)
3607 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
3608 mark_constants (XVECEXP (x
, i
, j
));
3628 /* Given a SYMBOL_REF CURRENT_RTX, mark it and all constants it refers
3629 to as used. Emit referenced deferred strings. This function can
3630 be used with for_each_rtx to mark all SYMBOL_REFs in an rtx. */
3633 mark_constant (current_rtx
, data
)
3635 void *data ATTRIBUTE_UNUSED
;
3637 rtx x
= *current_rtx
;
3642 else if (GET_CODE (x
) == SYMBOL_REF
)
3644 if (CONSTANT_POOL_ADDRESS_P (x
))
3646 struct pool_constant
*pool
= find_pool_constant (cfun
, x
);
3647 if (pool
->mark
== 0)
3650 for_each_rtx (&(pool
->constant
), &mark_constant
, NULL
);
3655 else if (STRING_POOL_ADDRESS_P (x
))
3657 struct deferred_string
**defstr
;
3659 defstr
= (struct deferred_string
**)
3660 htab_find_slot_with_hash (const_str_htab
, XSTR (x
, 0),
3661 STRHASH (XSTR (x
, 0)), NO_INSERT
);
3664 struct deferred_string
*p
= *defstr
;
3666 STRING_POOL_ADDRESS_P (x
) = 0;
3667 output_constant_def_contents (p
->exp
, 0, p
->labelno
);
3668 htab_clear_slot (const_str_htab
, (void **) defstr
);
3675 /* Find all the constants whose addresses are referenced inside of EXP,
3676 and make sure assembler code with a label has been output for each one.
3677 Indicate whether an ADDR_EXPR has been encountered. */
3680 output_addressed_constants (exp
)
3686 /* Give the front-end a chance to convert VALUE to something that
3687 looks more like a constant to the back-end. */
3688 exp
= (*lang_hooks
.expand_constant
) (exp
);
3690 switch (TREE_CODE (exp
))
3694 /* Go inside any operations that get_inner_reference can handle and see
3695 if what's inside is a constant: no need to do anything here for
3696 addresses of variables or functions. */
3697 for (tem
= TREE_OPERAND (exp
, 0); handled_component_p (tem
);
3698 tem
= TREE_OPERAND (tem
, 0))
3701 if (TREE_CODE_CLASS (TREE_CODE (tem
)) == 'c'
3702 || TREE_CODE (tem
) == CONSTRUCTOR
)
3703 output_constant_def (tem
, 0);
3705 if (TREE_PUBLIC (tem
))
3713 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
3714 reloc
|= output_addressed_constants (TREE_OPERAND (exp
, 1));
3719 case NON_LVALUE_EXPR
:
3720 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
3724 for (tem
= CONSTRUCTOR_ELTS (exp
); tem
; tem
= TREE_CHAIN (tem
))
3725 if (TREE_VALUE (tem
) != 0)
3726 reloc
|= output_addressed_constants (TREE_VALUE (tem
));
3736 /* Return nonzero if VALUE is a valid constant-valued expression
3737 for use in initializing a static variable; one that can be an
3738 element of a "constant" initializer.
3740 Return null_pointer_node if the value is absolute;
3741 if it is relocatable, return the variable that determines the relocation.
3742 We assume that VALUE has been folded as much as possible;
3743 therefore, we do not need to check for such things as
3744 arithmetic-combinations of integers. */
3747 initializer_constant_valid_p (value
, endtype
)
3751 /* Give the front-end a chance to convert VALUE to something that
3752 looks more like a constant to the back-end. */
3753 value
= (*lang_hooks
.expand_constant
) (value
);
3755 switch (TREE_CODE (value
))
3758 if ((TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
3759 || TREE_CODE (TREE_TYPE (value
)) == RECORD_TYPE
)
3760 && TREE_CONSTANT (value
)
3761 && CONSTRUCTOR_ELTS (value
))
3763 initializer_constant_valid_p (TREE_VALUE (CONSTRUCTOR_ELTS (value
)),
3766 return TREE_STATIC (value
) ? null_pointer_node
: 0;
3773 return null_pointer_node
;
3777 return staticp (TREE_OPERAND (value
, 0)) ? TREE_OPERAND (value
, 0) : 0;
3779 case VIEW_CONVERT_EXPR
:
3780 case NON_LVALUE_EXPR
:
3781 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3785 /* Allow conversions between pointer types. */
3786 if (POINTER_TYPE_P (TREE_TYPE (value
))
3787 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3788 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3790 /* Allow conversions between real types. */
3791 if (FLOAT_TYPE_P (TREE_TYPE (value
))
3792 && FLOAT_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3793 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3795 /* Allow length-preserving conversions between integer types. */
3796 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
3797 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
3798 && (TYPE_PRECISION (TREE_TYPE (value
))
3799 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
3800 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3802 /* Allow conversions between other integer types only if
3804 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
3805 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3807 tree inner
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3809 if (inner
== null_pointer_node
)
3810 return null_pointer_node
;
3814 /* Allow (int) &foo provided int is as wide as a pointer. */
3815 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
3816 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
3817 && (TYPE_PRECISION (TREE_TYPE (value
))
3818 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
3819 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3822 /* Likewise conversions from int to pointers, but also allow
3823 conversions from 0. */
3824 if (POINTER_TYPE_P (TREE_TYPE (value
))
3825 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3827 if (integer_zerop (TREE_OPERAND (value
, 0)))
3828 return null_pointer_node
;
3829 else if (TYPE_PRECISION (TREE_TYPE (value
))
3830 <= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0))))
3831 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3835 /* Allow conversions to union types if the value inside is okay. */
3836 if (TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
)
3837 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3842 if (! INTEGRAL_TYPE_P (endtype
)
3843 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
3845 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3847 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
3849 /* If either term is absolute, use the other terms relocation. */
3850 if (valid0
== null_pointer_node
)
3852 if (valid1
== null_pointer_node
)
3858 if (! INTEGRAL_TYPE_P (endtype
)
3859 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
3861 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3863 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
3865 /* Win if second argument is absolute. */
3866 if (valid1
== null_pointer_node
)
3868 /* Win if both arguments have the same relocation.
3869 Then the value is absolute. */
3870 if (valid0
== valid1
&& valid0
!= 0)
3871 return null_pointer_node
;
3873 /* Since GCC guarantees that string constants are unique in the
3874 generated code, a subtraction between two copies of the same
3875 constant string is absolute. */
3876 if (valid0
&& TREE_CODE (valid0
) == STRING_CST
&&
3877 valid1
&& TREE_CODE (valid1
) == STRING_CST
&&
3878 TREE_STRING_POINTER (valid0
) == TREE_STRING_POINTER (valid1
))
3879 return null_pointer_node
;
3882 /* Support differences between labels. */
3883 if (INTEGRAL_TYPE_P (endtype
))
3886 op0
= TREE_OPERAND (value
, 0);
3887 op1
= TREE_OPERAND (value
, 1);
3889 /* Like STRIP_NOPS except allow the operand mode to widen.
3890 This works around a feature of fold that simplfies
3891 (int)(p1 - p2) to ((int)p1 - (int)p2) under the theory
3892 that the narrower operation is cheaper. */
3894 while (TREE_CODE (op0
) == NOP_EXPR
3895 || TREE_CODE (op0
) == CONVERT_EXPR
3896 || TREE_CODE (op0
) == NON_LVALUE_EXPR
)
3898 tree inner
= TREE_OPERAND (op0
, 0);
3899 if (inner
== error_mark_node
3900 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner
)))
3901 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op0
)))
3902 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner
)))))
3907 while (TREE_CODE (op1
) == NOP_EXPR
3908 || TREE_CODE (op1
) == CONVERT_EXPR
3909 || TREE_CODE (op1
) == NON_LVALUE_EXPR
)
3911 tree inner
= TREE_OPERAND (op1
, 0);
3912 if (inner
== error_mark_node
3913 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner
)))
3914 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op1
)))
3915 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner
)))))
3920 if (TREE_CODE (op0
) == ADDR_EXPR
3921 && TREE_CODE (TREE_OPERAND (op0
, 0)) == LABEL_DECL
3922 && TREE_CODE (op1
) == ADDR_EXPR
3923 && TREE_CODE (TREE_OPERAND (op1
, 0)) == LABEL_DECL
)
3924 return null_pointer_node
;
3935 /* Output assembler code for constant EXP to FILE, with no label.
3936 This includes the pseudo-op such as ".int" or ".byte", and a newline.
3937 Assumes output_addressed_constants has been done on EXP already.
3939 Generate exactly SIZE bytes of assembler data, padding at the end
3940 with zeros if necessary. SIZE must always be specified.
3942 SIZE is important for structure constructors,
3943 since trailing members may have been omitted from the constructor.
3944 It is also important for initialization of arrays from string constants
3945 since the full length of the string constant might not be wanted.
3946 It is also needed for initialization of unions, where the initializer's
3947 type is just one member, and that may not be as long as the union.
3949 There a case in which we would fail to output exactly SIZE bytes:
3950 for a structure constructor that wants to produce more than SIZE bytes.
3951 But such constructors will never be generated for any possible input.
3953 ALIGN is the alignment of the data in bits. */
3956 output_constant (exp
, size
, align
)
3961 enum tree_code code
;
3962 HOST_WIDE_INT thissize
;
3964 /* Some front-ends use constants other than the standard language-indepdent
3965 varieties, but which may still be output directly. Give the front-end a
3966 chance to convert EXP to a language-independent representation. */
3967 exp
= (*lang_hooks
.expand_constant
) (exp
);
3969 if (size
== 0 || flag_syntax_only
)
3972 /* Eliminate any conversions since we'll be outputting the underlying
3974 while (TREE_CODE (exp
) == NOP_EXPR
|| TREE_CODE (exp
) == CONVERT_EXPR
3975 || TREE_CODE (exp
) == NON_LVALUE_EXPR
3976 || TREE_CODE (exp
) == VIEW_CONVERT_EXPR
)
3977 exp
= TREE_OPERAND (exp
, 0);
3979 code
= TREE_CODE (TREE_TYPE (exp
));
3980 thissize
= int_size_in_bytes (TREE_TYPE (exp
));
3982 /* Allow a constructor with no elements for any data type.
3983 This means to fill the space with zeros. */
3984 if (TREE_CODE (exp
) == CONSTRUCTOR
&& CONSTRUCTOR_ELTS (exp
) == 0)
3986 assemble_zeros (size
);
3990 if (TREE_CODE (exp
) == FDESC_EXPR
)
3992 #ifdef ASM_OUTPUT_FDESC
3993 HOST_WIDE_INT part
= tree_low_cst (TREE_OPERAND (exp
, 1), 0);
3994 tree decl
= TREE_OPERAND (exp
, 0);
3995 ASM_OUTPUT_FDESC (asm_out_file
, decl
, part
);
4002 /* Now output the underlying data. If we've handling the padding, return.
4003 Otherwise, break and ensure THISSIZE is the size written. */
4011 case REFERENCE_TYPE
:
4012 if (! assemble_integer (expand_expr (exp
, NULL_RTX
, VOIDmode
,
4013 EXPAND_INITIALIZER
),
4015 error ("initializer for integer value is too complicated");
4019 if (TREE_CODE (exp
) != REAL_CST
)
4020 error ("initializer for floating value is not a floating constant");
4022 assemble_real (TREE_REAL_CST (exp
),
4023 mode_for_size (size
* BITS_PER_UNIT
, MODE_FLOAT
, 0),
4028 output_constant (TREE_REALPART (exp
), thissize
/ 2, align
);
4029 output_constant (TREE_IMAGPART (exp
), thissize
/ 2,
4030 min_align (align
, BITS_PER_UNIT
* (thissize
/ 2)));
4035 if (TREE_CODE (exp
) == CONSTRUCTOR
)
4037 output_constructor (exp
, size
, align
);
4040 else if (TREE_CODE (exp
) == STRING_CST
)
4042 thissize
= MIN (TREE_STRING_LENGTH (exp
), size
);
4043 assemble_string (TREE_STRING_POINTER (exp
), thissize
);
4051 if (TREE_CODE (exp
) == CONSTRUCTOR
)
4052 output_constructor (exp
, size
, align
);
4058 if (TREE_CODE (exp
) == INTEGER_CST
)
4059 assemble_integer (expand_expr (exp
, NULL_RTX
,
4060 VOIDmode
, EXPAND_INITIALIZER
),
4061 thissize
, align
, 1);
4062 else if (TREE_CODE (exp
) == CONSTRUCTOR
)
4064 unsigned char *buffer
= (unsigned char *) alloca (thissize
);
4065 if (get_set_constructor_bytes (exp
, buffer
, thissize
))
4067 assemble_string ((char *) buffer
, thissize
);
4070 error ("unknown set constructor type");
4082 assemble_zeros (size
);
4086 /* Subroutine of output_constructor, used for computing the size of
4087 arrays of unspecified length. VAL must be a CONSTRUCTOR of an array
4088 type with an unspecified upper bound. */
4090 static unsigned HOST_WIDE_INT
4091 array_size_for_constructor (val
)
4096 /* This code used to attempt to handle string constants that are not
4097 arrays of single-bytes, but nothing else does, so there's no point in
4099 if (TREE_CODE (val
) == STRING_CST
)
4100 return TREE_STRING_LENGTH (val
);
4102 max_index
= NULL_TREE
;
4103 for (i
= CONSTRUCTOR_ELTS (val
); i
; i
= TREE_CHAIN (i
))
4105 tree index
= TREE_PURPOSE (i
);
4107 if (TREE_CODE (index
) == RANGE_EXPR
)
4108 index
= TREE_OPERAND (index
, 1);
4109 if (max_index
== NULL_TREE
|| tree_int_cst_lt (max_index
, index
))
4113 if (max_index
== NULL_TREE
)
4116 /* Compute the total number of array elements. */
4117 i
= size_binop (MINUS_EXPR
, convert (sizetype
, max_index
),
4119 TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (val
)))));
4120 i
= size_binop (PLUS_EXPR
, i
, convert (sizetype
, integer_one_node
));
4122 /* Multiply by the array element unit size to find number of bytes. */
4123 i
= size_binop (MULT_EXPR
, i
, TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (val
))));
4125 return tree_low_cst (i
, 1);
4128 /* Subroutine of output_constant, used for CONSTRUCTORs (aggregate constants).
4129 Generate at least SIZE bytes, padding if necessary. */
4132 output_constructor (exp
, size
, align
)
4137 tree type
= TREE_TYPE (exp
);
4138 tree link
, field
= 0;
4140 /* Number of bytes output or skipped so far.
4141 In other words, current position within the constructor. */
4142 HOST_WIDE_INT total_bytes
= 0;
4143 /* Non-zero means BYTE contains part of a byte, to be output. */
4144 int byte_buffer_in_use
= 0;
4147 if (HOST_BITS_PER_WIDE_INT
< BITS_PER_UNIT
)
4150 if (TREE_CODE (type
) == RECORD_TYPE
)
4151 field
= TYPE_FIELDS (type
);
4153 if (TREE_CODE (type
) == ARRAY_TYPE
4154 && TYPE_DOMAIN (type
) != 0)
4155 min_index
= TYPE_MIN_VALUE (TYPE_DOMAIN (type
));
4157 /* As LINK goes through the elements of the constant,
4158 FIELD goes through the structure fields, if the constant is a structure.
4159 if the constant is a union, then we override this,
4160 by getting the field from the TREE_LIST element.
4161 But the constant could also be an array. Then FIELD is zero.
4163 There is always a maximum of one element in the chain LINK for unions
4164 (even if the initializer in a source program incorrectly contains
4166 for (link
= CONSTRUCTOR_ELTS (exp
);
4168 link
= TREE_CHAIN (link
),
4169 field
= field
? TREE_CHAIN (field
) : 0)
4171 tree val
= TREE_VALUE (link
);
4174 /* The element in a union constructor specifies the proper field
4176 if ((TREE_CODE (type
) == RECORD_TYPE
|| TREE_CODE (type
) == UNION_TYPE
4177 || TREE_CODE (type
) == QUAL_UNION_TYPE
)
4178 && TREE_PURPOSE (link
) != 0)
4179 field
= TREE_PURPOSE (link
);
4181 else if (TREE_CODE (type
) == ARRAY_TYPE
)
4182 index
= TREE_PURPOSE (link
);
4184 /* Eliminate the marker that makes a cast not be an lvalue. */
4188 if (index
&& TREE_CODE (index
) == RANGE_EXPR
)
4190 unsigned HOST_WIDE_INT fieldsize
4191 = int_size_in_bytes (TREE_TYPE (type
));
4192 HOST_WIDE_INT lo_index
= tree_low_cst (TREE_OPERAND (index
, 0), 0);
4193 HOST_WIDE_INT hi_index
= tree_low_cst (TREE_OPERAND (index
, 1), 0);
4194 HOST_WIDE_INT index
;
4195 unsigned int align2
= min_align (align
, fieldsize
* BITS_PER_UNIT
);
4197 for (index
= lo_index
; index
<= hi_index
; index
++)
4199 /* Output the element's initial value. */
4201 assemble_zeros (fieldsize
);
4203 output_constant (val
, fieldsize
, align2
);
4205 /* Count its size. */
4206 total_bytes
+= fieldsize
;
4209 else if (field
== 0 || !DECL_BIT_FIELD (field
))
4211 /* An element that is not a bit-field. */
4213 unsigned HOST_WIDE_INT fieldsize
;
4214 /* Since this structure is static,
4215 we know the positions are constant. */
4216 HOST_WIDE_INT pos
= field
? int_byte_position (field
) : 0;
4217 unsigned int align2
;
4220 pos
= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (val
)), 1)
4221 * (tree_low_cst (index
, 0) - tree_low_cst (min_index
, 0)));
4223 /* Output any buffered-up bit-fields preceding this element. */
4224 if (byte_buffer_in_use
)
4226 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4228 byte_buffer_in_use
= 0;
4231 /* Advance to offset of this element.
4232 Note no alignment needed in an array, since that is guaranteed
4233 if each element has the proper size. */
4234 if ((field
!= 0 || index
!= 0) && pos
!= total_bytes
)
4236 assemble_zeros (pos
- total_bytes
);
4240 /* Find the alignment of this element. */
4241 align2
= min_align (align
, BITS_PER_UNIT
* pos
);
4243 /* Determine size this element should occupy. */
4248 /* If this is an array with an unspecified upper bound,
4249 the initializer determines the size. */
4250 /* ??? This ought to only checked if DECL_SIZE_UNIT is NULL,
4251 but we cannot do this until the deprecated support for
4252 initializing zero-length array members is removed. */
4253 if (TREE_CODE (TREE_TYPE (field
)) == ARRAY_TYPE
4254 && TYPE_DOMAIN (TREE_TYPE (field
))
4255 && ! TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (field
))))
4257 fieldsize
= array_size_for_constructor (val
);
4258 /* Given a non-empty initialization, this field had
4260 if (fieldsize
!= 0 && TREE_CHAIN (field
) != NULL_TREE
)
4263 else if (DECL_SIZE_UNIT (field
))
4265 /* ??? This can't be right. If the decl size overflows
4266 a host integer we will silently emit no data. */
4267 if (host_integerp (DECL_SIZE_UNIT (field
), 1))
4268 fieldsize
= tree_low_cst (DECL_SIZE_UNIT (field
), 1);
4272 fieldsize
= int_size_in_bytes (TREE_TYPE (type
));
4274 /* Output the element's initial value. */
4276 assemble_zeros (fieldsize
);
4278 output_constant (val
, fieldsize
, align2
);
4280 /* Count its size. */
4281 total_bytes
+= fieldsize
;
4283 else if (val
!= 0 && TREE_CODE (val
) != INTEGER_CST
)
4284 error ("invalid initial value for member `%s'",
4285 IDENTIFIER_POINTER (DECL_NAME (field
)));
4288 /* Element that is a bit-field. */
4290 HOST_WIDE_INT next_offset
= int_bit_position (field
);
4291 HOST_WIDE_INT end_offset
4292 = (next_offset
+ tree_low_cst (DECL_SIZE (field
), 1));
4295 val
= integer_zero_node
;
4297 /* If this field does not start in this (or, next) byte,
4299 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4301 /* Output remnant of any bit field in previous bytes. */
4302 if (byte_buffer_in_use
)
4304 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4306 byte_buffer_in_use
= 0;
4309 /* If still not at proper byte, advance to there. */
4310 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4312 assemble_zeros (next_offset
/ BITS_PER_UNIT
- total_bytes
);
4313 total_bytes
= next_offset
/ BITS_PER_UNIT
;
4317 if (! byte_buffer_in_use
)
4320 /* We must split the element into pieces that fall within
4321 separate bytes, and combine each byte with previous or
4322 following bit-fields. */
4324 /* next_offset is the offset n fbits from the beginning of
4325 the structure to the next bit of this element to be processed.
4326 end_offset is the offset of the first bit past the end of
4328 while (next_offset
< end_offset
)
4332 HOST_WIDE_INT value
;
4333 HOST_WIDE_INT next_byte
= next_offset
/ BITS_PER_UNIT
;
4334 HOST_WIDE_INT next_bit
= next_offset
% BITS_PER_UNIT
;
4336 /* Advance from byte to byte
4337 within this element when necessary. */
4338 while (next_byte
!= total_bytes
)
4340 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4345 /* Number of bits we can process at once
4346 (all part of the same byte). */
4347 this_time
= MIN (end_offset
- next_offset
,
4348 BITS_PER_UNIT
- next_bit
);
4349 if (BYTES_BIG_ENDIAN
)
4351 /* On big-endian machine, take the most significant bits
4352 first (of the bits that are significant)
4353 and put them into bytes from the most significant end. */
4354 shift
= end_offset
- next_offset
- this_time
;
4356 /* Don't try to take a bunch of bits that cross
4357 the word boundary in the INTEGER_CST. We can
4358 only select bits from the LOW or HIGH part
4360 if (shift
< HOST_BITS_PER_WIDE_INT
4361 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4363 this_time
= shift
+ this_time
- HOST_BITS_PER_WIDE_INT
;
4364 shift
= HOST_BITS_PER_WIDE_INT
;
4367 /* Now get the bits from the appropriate constant word. */
4368 if (shift
< HOST_BITS_PER_WIDE_INT
)
4369 value
= TREE_INT_CST_LOW (val
);
4370 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4372 value
= TREE_INT_CST_HIGH (val
);
4373 shift
-= HOST_BITS_PER_WIDE_INT
;
4378 /* Get the result. This works only when:
4379 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4380 byte
|= (((value
>> shift
)
4381 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4382 << (BITS_PER_UNIT
- this_time
- next_bit
));
4386 /* On little-endian machines,
4387 take first the least significant bits of the value
4388 and pack them starting at the least significant
4389 bits of the bytes. */
4390 shift
= next_offset
- int_bit_position (field
);
4392 /* Don't try to take a bunch of bits that cross
4393 the word boundary in the INTEGER_CST. We can
4394 only select bits from the LOW or HIGH part
4396 if (shift
< HOST_BITS_PER_WIDE_INT
4397 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4398 this_time
= (HOST_BITS_PER_WIDE_INT
- shift
);
4400 /* Now get the bits from the appropriate constant word. */
4401 if (shift
< HOST_BITS_PER_WIDE_INT
)
4402 value
= TREE_INT_CST_LOW (val
);
4403 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4405 value
= TREE_INT_CST_HIGH (val
);
4406 shift
-= HOST_BITS_PER_WIDE_INT
;
4411 /* Get the result. This works only when:
4412 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4413 byte
|= (((value
>> shift
)
4414 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4418 next_offset
+= this_time
;
4419 byte_buffer_in_use
= 1;
4424 if (byte_buffer_in_use
)
4426 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4430 if (total_bytes
< size
)
4431 assemble_zeros (size
- total_bytes
);
4434 /* This TREE_LIST contains any weak symbol declarations waiting
4436 static GTY(()) tree weak_decls
;
4438 /* Mark DECL as weak. */
4444 DECL_WEAK (decl
) = 1;
4446 if (DECL_RTL_SET_P (decl
)
4447 && GET_CODE (DECL_RTL (decl
)) == MEM
4448 && XEXP (DECL_RTL (decl
), 0)
4449 && GET_CODE (XEXP (DECL_RTL (decl
), 0)) == SYMBOL_REF
)
4450 SYMBOL_REF_WEAK (XEXP (DECL_RTL (decl
), 0)) = 1;
4453 /* Merge weak status between NEWDECL and OLDDECL. */
4456 merge_weak (newdecl
, olddecl
)
4460 if (DECL_WEAK (newdecl
) == DECL_WEAK (olddecl
))
4463 if (DECL_WEAK (newdecl
))
4467 /* NEWDECL is weak, but OLDDECL is not. */
4469 /* If we already output the OLDDECL, we're in trouble; we can't
4470 go back and make it weak. This error cannot caught in
4471 declare_weak because the NEWDECL and OLDDECL was not yet
4472 been merged; therefore, TREE_ASM_WRITTEN was not set. */
4473 if (TREE_ASM_WRITTEN (olddecl
))
4474 error_with_decl (newdecl
,
4475 "weak declaration of `%s' must precede definition");
4477 /* If we've already generated rtl referencing OLDDECL, we may
4478 have done so in a way that will not function properly with
4480 else if (TREE_USED (olddecl
)
4481 && TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (olddecl
)))
4482 warning_with_decl (newdecl
, "weak declaration of `%s' after first use results in unspecified behavior");
4486 /* We put the NEWDECL on the weak_decls list at some point.
4487 Replace it with the OLDDECL. */
4488 for (wd
= weak_decls
; wd
; wd
= TREE_CHAIN (wd
))
4489 if (TREE_VALUE (wd
) == newdecl
)
4491 TREE_VALUE (wd
) = olddecl
;
4494 /* We may not find the entry on the list. If NEWDECL is a
4495 weak alias, then we will have already called
4496 globalize_decl to remove the entry; in that case, we do
4497 not need to do anything. */
4500 /* Make the OLDDECL weak; it's OLDDECL that we'll be keeping. */
4501 mark_weak (olddecl
);
4504 /* OLDDECL was weak, but NEWDECL was not explicitly marked as
4505 weak. Just update NEWDECL to indicate that it's weak too. */
4506 mark_weak (newdecl
);
4509 /* Declare DECL to be a weak symbol. */
4515 if (! TREE_PUBLIC (decl
))
4516 error_with_decl (decl
, "weak declaration of `%s' must be public");
4517 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& TREE_ASM_WRITTEN (decl
))
4518 error_with_decl (decl
, "weak declaration of `%s' must precede definition");
4519 else if (SUPPORTS_WEAK
)
4521 if (! DECL_WEAK (decl
))
4522 weak_decls
= tree_cons (NULL
, decl
, weak_decls
);
4525 warning_with_decl (decl
, "weak declaration of `%s' not supported");
4530 /* Emit any pending weak declarations. */
4537 for (t
= weak_decls
; t
; t
= TREE_CHAIN (t
))
4539 tree decl
= TREE_VALUE (t
);
4540 const char *name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
4542 if (! TREE_USED (decl
))
4545 #ifdef ASM_WEAKEN_DECL
4546 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, NULL
);
4548 #ifdef ASM_WEAKEN_LABEL
4549 ASM_WEAKEN_LABEL (asm_out_file
, name
);
4551 #ifdef ASM_OUTPUT_WEAK_ALIAS
4552 warning ("only weak aliases are supported in this configuration");
4560 /* Emit the assembly bits to indicate that DECL is globally visible. */
4563 globalize_decl (decl
)
4566 const char *name
= XSTR (XEXP (DECL_RTL (decl
), 0), 0);
4568 #if defined (ASM_WEAKEN_LABEL) || defined (ASM_WEAKEN_DECL)
4569 if (DECL_WEAK (decl
))
4573 #ifdef ASM_WEAKEN_DECL
4574 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, 0);
4576 ASM_WEAKEN_LABEL (asm_out_file
, name
);
4579 /* Remove this function from the pending weak list so that
4580 we do not emit multiple .weak directives for it. */
4581 for (p
= &weak_decls
; (t
= *p
) ; )
4583 if (DECL_ASSEMBLER_NAME (decl
) == DECL_ASSEMBLER_NAME (TREE_VALUE (t
)))
4584 *p
= TREE_CHAIN (t
);
4586 p
= &TREE_CHAIN (t
);
4592 (*targetm
.asm_out
.globalize_label
) (asm_out_file
, name
);
4595 /* Emit an assembler directive to make the symbol for DECL an alias to
4596 the symbol for TARGET. */
4599 assemble_alias (decl
, target
)
4600 tree decl
, target ATTRIBUTE_UNUSED
;
4604 /* We must force creation of DECL_RTL for debug info generation, even though
4605 we don't use it here. */
4606 make_decl_rtl (decl
, NULL
);
4608 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
4610 #ifdef ASM_OUTPUT_DEF
4611 /* Make name accessible from other files, if appropriate. */
4613 if (TREE_PUBLIC (decl
))
4615 globalize_decl (decl
);
4616 maybe_assemble_visibility (decl
);
4619 #ifdef ASM_OUTPUT_DEF_FROM_DECLS
4620 ASM_OUTPUT_DEF_FROM_DECLS (asm_out_file
, decl
, target
);
4622 ASM_OUTPUT_DEF (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4624 #else /* !ASM_OUTPUT_DEF */
4625 #if defined (ASM_OUTPUT_WEAK_ALIAS) || defined (ASM_WEAKEN_DECL)
4626 if (! DECL_WEAK (decl
))
4627 warning ("only weak aliases are supported in this configuration");
4629 #ifdef ASM_WEAKEN_DECL
4630 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, IDENTIFIER_POINTER (target
));
4632 ASM_OUTPUT_WEAK_ALIAS (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4635 warning ("alias definitions not supported in this configuration; ignored");
4639 TREE_USED (decl
) = 1;
4640 TREE_ASM_WRITTEN (decl
) = 1;
4641 TREE_ASM_WRITTEN (DECL_ASSEMBLER_NAME (decl
)) = 1;
4644 /* Emit an assembler directive to set symbol for DECL visibility to
4648 default_assemble_visibility (decl
, visibility_type
)
4650 const char *visibility_type ATTRIBUTE_UNUSED
;
4654 name
= (* targetm
.strip_name_encoding
)
4655 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
4657 #ifdef HAVE_GAS_HIDDEN
4658 fprintf (asm_out_file
, "\t.%s\t%s\n", visibility_type
, name
);
4660 warning ("visibility attribute not supported in this configuration; ignored");
4664 /* A helper function to call assemble_visibility when needed for a decl. */
4667 maybe_assemble_visibility (decl
)
4670 tree visibility
= lookup_attribute ("visibility", DECL_ATTRIBUTES (decl
));
4674 = TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (visibility
)));
4675 (* targetm
.asm_out
.visibility
) (decl
, type
);
4679 /* Returns 1 if the target configuration supports defining public symbols
4680 so that one of them will be chosen at link time instead of generating a
4681 multiply-defined symbol error, whether through the use of weak symbols or
4682 a target-specific mechanism for having duplicates discarded. */
4685 supports_one_only ()
4687 if (SUPPORTS_ONE_ONLY
)
4689 return SUPPORTS_WEAK
;
4692 /* Set up DECL as a public symbol that can be defined in multiple
4693 translation units without generating a linker error. */
4696 make_decl_one_only (decl
)
4699 if (TREE_CODE (decl
) != VAR_DECL
&& TREE_CODE (decl
) != FUNCTION_DECL
)
4702 TREE_PUBLIC (decl
) = 1;
4704 if (TREE_CODE (decl
) == VAR_DECL
4705 && (DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
))
4706 DECL_COMMON (decl
) = 1;
4707 else if (SUPPORTS_ONE_ONLY
)
4709 #ifdef MAKE_DECL_ONE_ONLY
4710 MAKE_DECL_ONE_ONLY (decl
);
4712 DECL_ONE_ONLY (decl
) = 1;
4714 else if (SUPPORTS_WEAK
)
4715 DECL_WEAK (decl
) = 1;
4723 const_str_htab
= htab_create_ggc (128, const_str_htab_hash
,
4724 const_str_htab_eq
, NULL
);
4725 in_named_htab
= htab_create (31, in_named_entry_hash
,
4726 in_named_entry_eq
, NULL
);
4728 const_alias_set
= new_alias_set ();
4732 decl_tls_model (decl
)
4735 enum tls_model kind
;
4736 tree attr
= lookup_attribute ("tls_model", DECL_ATTRIBUTES (decl
));
4741 attr
= TREE_VALUE (TREE_VALUE (attr
));
4742 if (TREE_CODE (attr
) != STRING_CST
)
4744 if (!strcmp (TREE_STRING_POINTER (attr
), "local-exec"))
4745 kind
= TLS_MODEL_LOCAL_EXEC
;
4746 else if (!strcmp (TREE_STRING_POINTER (attr
), "initial-exec"))
4747 kind
= TLS_MODEL_INITIAL_EXEC
;
4748 else if (!strcmp (TREE_STRING_POINTER (attr
), "local-dynamic"))
4749 kind
= optimize
? TLS_MODEL_LOCAL_DYNAMIC
: TLS_MODEL_GLOBAL_DYNAMIC
;
4750 else if (!strcmp (TREE_STRING_POINTER (attr
), "global-dynamic"))
4751 kind
= TLS_MODEL_GLOBAL_DYNAMIC
;
4757 is_local
= (*targetm
.binds_local_p
) (decl
);
4761 kind
= TLS_MODEL_LOCAL_EXEC
;
4763 kind
= TLS_MODEL_INITIAL_EXEC
;
4765 /* Local dynamic is inefficient when we're not combining the
4766 parts of the address. */
4767 else if (optimize
&& is_local
)
4768 kind
= TLS_MODEL_LOCAL_DYNAMIC
;
4770 kind
= TLS_MODEL_GLOBAL_DYNAMIC
;
4771 if (kind
< flag_tls_default
)
4772 kind
= flag_tls_default
;
4777 /* Select a set of attributes for section NAME based on the properties
4778 of DECL and whether or not RELOC indicates that DECL's initializer
4779 might contain runtime relocations.
4781 We make the section read-only and executable for a function decl,
4782 read-only for a const data decl, and writable for a non-const data decl. */
4785 default_section_type_flags (decl
, name
, reloc
)
4790 return default_section_type_flags_1 (decl
, name
, reloc
, flag_pic
);
4794 default_section_type_flags_1 (decl
, name
, reloc
, shlib
)
4802 if (decl
&& TREE_CODE (decl
) == FUNCTION_DECL
)
4803 flags
= SECTION_CODE
;
4804 else if (decl
&& decl_readonly_section_1 (decl
, reloc
, shlib
))
4807 flags
= SECTION_WRITE
;
4809 if (decl
&& DECL_ONE_ONLY (decl
))
4810 flags
|= SECTION_LINKONCE
;
4812 if (decl
&& TREE_CODE (decl
) == VAR_DECL
&& DECL_THREAD_LOCAL (decl
))
4813 flags
|= SECTION_TLS
| SECTION_WRITE
;
4815 if (strcmp (name
, ".bss") == 0
4816 || strncmp (name
, ".bss.", 5) == 0
4817 || strncmp (name
, ".gnu.linkonce.b.", 16) == 0
4818 || strcmp (name
, ".sbss") == 0
4819 || strncmp (name
, ".sbss.", 6) == 0
4820 || strncmp (name
, ".gnu.linkonce.sb.", 17) == 0
4821 || strcmp (name
, ".tbss") == 0
4822 || strncmp (name
, ".gnu.linkonce.tb.", 17) == 0)
4823 flags
|= SECTION_BSS
;
4825 if (strcmp (name
, ".tdata") == 0
4826 || strcmp (name
, ".tbss") == 0
4827 || strncmp (name
, ".gnu.linkonce.td.", 17) == 0
4828 || strncmp (name
, ".gnu.linkonce.tb.", 17) == 0)
4829 flags
|= SECTION_TLS
;
4834 /* Output assembly to switch to section NAME with attribute FLAGS.
4835 Four variants for common object file formats. */
4838 default_no_named_section (name
, flags
)
4839 const char *name ATTRIBUTE_UNUSED
;
4840 unsigned int flags ATTRIBUTE_UNUSED
;
4842 /* Some object formats don't support named sections at all. The
4843 front-end should already have flagged this as an error. */
4848 default_elf_asm_named_section (name
, flags
)
4852 char flagchars
[10], *f
= flagchars
;
4855 if (! named_section_first_declaration (name
))
4857 fprintf (asm_out_file
, "\t.section\t%s\n", name
);
4861 if (!(flags
& SECTION_DEBUG
))
4863 if (flags
& SECTION_WRITE
)
4865 if (flags
& SECTION_CODE
)
4867 if (flags
& SECTION_SMALL
)
4869 if (flags
& SECTION_MERGE
)
4871 if (flags
& SECTION_STRINGS
)
4873 if (flags
& SECTION_TLS
)
4877 if (flags
& SECTION_BSS
)
4882 if (flags
& SECTION_ENTSIZE
)
4883 fprintf (asm_out_file
, "\t.section\t%s,\"%s\",@%s,%d\n",
4884 name
, flagchars
, type
, flags
& SECTION_ENTSIZE
);
4886 fprintf (asm_out_file
, "\t.section\t%s,\"%s\",@%s\n",
4887 name
, flagchars
, type
);
4891 default_coff_asm_named_section (name
, flags
)
4895 char flagchars
[8], *f
= flagchars
;
4897 if (flags
& SECTION_WRITE
)
4899 if (flags
& SECTION_CODE
)
4903 fprintf (asm_out_file
, "\t.section\t%s,\"%s\"\n", name
, flagchars
);
4907 default_pe_asm_named_section (name
, flags
)
4911 default_coff_asm_named_section (name
, flags
);
4913 if (flags
& SECTION_LINKONCE
)
4915 /* Functions may have been compiled at various levels of
4916 optimization so we can't use `same_size' here.
4917 Instead, have the linker pick one. */
4918 fprintf (asm_out_file
, "\t.linkonce %s\n",
4919 (flags
& SECTION_CODE
? "discard" : "same_size"));
4923 /* Used for vtable gc in GNU binutils. Record that the pointer at OFFSET
4924 from SYMBOL is used in all classes derived from SYMBOL. */
4927 assemble_vtable_entry (symbol
, offset
)
4929 HOST_WIDE_INT offset
;
4931 fputs ("\t.vtable_entry ", asm_out_file
);
4932 output_addr_const (asm_out_file
, symbol
);
4933 fputs (", ", asm_out_file
);
4934 fprintf (asm_out_file
, HOST_WIDE_INT_PRINT_DEC
, offset
);
4935 fputc ('\n', asm_out_file
);
4938 /* Used for vtable gc in GNU binutils. Record the class hierarchy by noting
4939 that the vtable symbol CHILD is derived from the vtable symbol PARENT. */
4942 assemble_vtable_inherit (child
, parent
)
4945 fputs ("\t.vtable_inherit ", asm_out_file
);
4946 output_addr_const (asm_out_file
, child
);
4947 fputs (", ", asm_out_file
);
4948 output_addr_const (asm_out_file
, parent
);
4949 fputc ('\n', asm_out_file
);
4952 /* The lame default section selector. */
4955 default_select_section (decl
, reloc
, align
)
4958 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
;
4960 bool readonly
= false;
4964 if (decl_readonly_section (decl
, reloc
))
4967 else if (TREE_CODE (decl
) == CONSTRUCTOR
)
4969 if (! ((flag_pic
&& reloc
)
4970 || !TREE_READONLY (decl
)
4971 || TREE_SIDE_EFFECTS (decl
)
4972 || !TREE_CONSTANT (decl
)))
4975 else if (TREE_CODE (decl
) == STRING_CST
)
4976 readonly
= !flag_writable_strings
;
4977 else if (! (flag_pic
&& reloc
))
4981 readonly_data_section ();
4986 /* A helper function for default_elf_select_section and
4987 default_elf_unique_section. Categorizes the DECL. */
4989 enum section_category
4994 SECCAT_RODATA_MERGE_STR
,
4995 SECCAT_RODATA_MERGE_STR_INIT
,
4996 SECCAT_RODATA_MERGE_CONST
,
5001 /* To optimize loading of shared programs, define following subsections
5003 _REL Contains data that has relocations, so they get grouped
5004 together and dynamic linker will visit fewer pages in memory.
5005 _RO Contains data that is otherwise read-only. This is useful
5006 with prelinking as most relocations won't be dynamically
5007 linked and thus stay read only.
5008 _LOCAL Marks data containing relocations only to local objects.
5009 These relocations will get fully resolved by prelinking. */
5011 SECCAT_DATA_REL_LOCAL
,
5013 SECCAT_DATA_REL_RO_LOCAL
,
5023 static enum section_category
5024 categorize_decl_for_section
PARAMS ((tree
, int, int));
5026 static enum section_category
5027 categorize_decl_for_section (decl
, reloc
, shlib
)
5032 enum section_category ret
;
5034 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5036 else if (TREE_CODE (decl
) == STRING_CST
)
5038 if (flag_writable_strings
)
5041 return SECCAT_RODATA_MERGE_STR
;
5043 else if (TREE_CODE (decl
) == VAR_DECL
)
5045 if (DECL_INITIAL (decl
) == NULL
5046 || DECL_INITIAL (decl
) == error_mark_node
)
5048 else if (! TREE_READONLY (decl
)
5049 || TREE_SIDE_EFFECTS (decl
)
5050 || ! TREE_CONSTANT (DECL_INITIAL (decl
)))
5052 if (shlib
&& (reloc
& 2))
5053 ret
= SECCAT_DATA_REL
;
5054 else if (shlib
&& reloc
)
5055 ret
= SECCAT_DATA_REL_LOCAL
;
5059 else if (shlib
&& (reloc
& 2))
5060 ret
= SECCAT_DATA_REL_RO
;
5061 else if (shlib
&& reloc
)
5062 ret
= SECCAT_DATA_REL_RO_LOCAL
;
5063 else if (flag_merge_constants
< 2)
5064 /* C and C++ don't allow different variables to share the same
5065 location. -fmerge-all-constants allows even that (at the
5066 expense of not conforming). */
5067 ret
= SECCAT_RODATA
;
5068 else if (TREE_CODE (DECL_INITIAL (decl
)) == STRING_CST
)
5069 ret
= SECCAT_RODATA_MERGE_STR_INIT
;
5071 ret
= SECCAT_RODATA_MERGE_CONST
;
5073 else if (TREE_CODE (decl
) == CONSTRUCTOR
)
5075 if ((shlib
&& reloc
)
5076 || TREE_SIDE_EFFECTS (decl
)
5077 || ! TREE_CONSTANT (decl
))
5080 ret
= SECCAT_RODATA
;
5083 ret
= SECCAT_RODATA
;
5085 /* There are no read-only thread-local sections. */
5086 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_THREAD_LOCAL (decl
))
5088 if (ret
== SECCAT_BSS
)
5094 /* If the target uses small data sections, select it. */
5095 else if ((*targetm
.in_small_data_p
) (decl
))
5097 if (ret
== SECCAT_BSS
)
5099 else if (targetm
.have_srodata_section
&& ret
== SECCAT_RODATA
)
5100 ret
= SECCAT_SRODATA
;
5109 decl_readonly_section (decl
, reloc
)
5113 return decl_readonly_section_1 (decl
, reloc
, flag_pic
);
5117 decl_readonly_section_1 (decl
, reloc
, shlib
)
5122 switch (categorize_decl_for_section (decl
, reloc
, shlib
))
5125 case SECCAT_RODATA_MERGE_STR
:
5126 case SECCAT_RODATA_MERGE_STR_INIT
:
5127 case SECCAT_RODATA_MERGE_CONST
:
5128 case SECCAT_SRODATA
:
5137 /* Select a section based on the above categorization. */
5140 default_elf_select_section (decl
, reloc
, align
)
5143 unsigned HOST_WIDE_INT align
;
5145 default_elf_select_section_1 (decl
, reloc
, align
, flag_pic
);
5149 default_elf_select_section_1 (decl
, reloc
, align
, shlib
)
5152 unsigned HOST_WIDE_INT align
;
5155 switch (categorize_decl_for_section (decl
, reloc
, shlib
))
5158 /* We're not supposed to be called on FUNCTION_DECLs. */
5161 readonly_data_section ();
5163 case SECCAT_RODATA_MERGE_STR
:
5164 mergeable_string_section (decl
, align
, 0);
5166 case SECCAT_RODATA_MERGE_STR_INIT
:
5167 mergeable_string_section (DECL_INITIAL (decl
), align
, 0);
5169 case SECCAT_RODATA_MERGE_CONST
:
5170 mergeable_constant_section (DECL_MODE (decl
), align
, 0);
5172 case SECCAT_SRODATA
:
5173 named_section (NULL_TREE
, ".sdata2", reloc
);
5178 case SECCAT_DATA_REL
:
5179 named_section (NULL_TREE
, ".data.rel", reloc
);
5181 case SECCAT_DATA_REL_LOCAL
:
5182 named_section (NULL_TREE
, ".data.rel.local", reloc
);
5184 case SECCAT_DATA_REL_RO
:
5185 named_section (NULL_TREE
, ".data.rel.ro", reloc
);
5187 case SECCAT_DATA_REL_RO_LOCAL
:
5188 named_section (NULL_TREE
, ".data.rel.ro.local", reloc
);
5191 named_section (NULL_TREE
, ".sdata", reloc
);
5194 named_section (NULL_TREE
, ".tdata", reloc
);
5197 #ifdef BSS_SECTION_ASM_OP
5200 named_section (NULL_TREE
, ".bss", reloc
);
5204 named_section (NULL_TREE
, ".sbss", reloc
);
5207 named_section (NULL_TREE
, ".tbss", reloc
);
5214 /* Construct a unique section name based on the decl name and the
5215 categorization performed above. */
5218 default_unique_section (decl
, reloc
)
5222 default_unique_section_1 (decl
, reloc
, flag_pic
);
5226 default_unique_section_1 (decl
, reloc
, shlib
)
5231 bool one_only
= DECL_ONE_ONLY (decl
);
5232 const char *prefix
, *name
;
5236 switch (categorize_decl_for_section (decl
, reloc
, shlib
))
5239 prefix
= one_only
? ".gnu.linkonce.t." : ".text.";
5242 case SECCAT_RODATA_MERGE_STR
:
5243 case SECCAT_RODATA_MERGE_STR_INIT
:
5244 case SECCAT_RODATA_MERGE_CONST
:
5245 prefix
= one_only
? ".gnu.linkonce.r." : ".rodata.";
5247 case SECCAT_SRODATA
:
5248 prefix
= one_only
? ".gnu.linkonce.s2." : ".sdata2.";
5251 case SECCAT_DATA_REL
:
5252 case SECCAT_DATA_REL_LOCAL
:
5253 case SECCAT_DATA_REL_RO
:
5254 case SECCAT_DATA_REL_RO_LOCAL
:
5255 prefix
= one_only
? ".gnu.linkonce.d." : ".data.";
5258 prefix
= one_only
? ".gnu.linkonce.s." : ".sdata.";
5261 prefix
= one_only
? ".gnu.linkonce.b." : ".bss.";
5264 prefix
= one_only
? ".gnu.linkonce.sb." : ".sbss.";
5267 prefix
= one_only
? ".gnu.linkonce.td." : ".tdata.";
5270 prefix
= one_only
? ".gnu.linkonce.tb." : ".tbss.";
5275 plen
= strlen (prefix
);
5277 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
5278 name
= (* targetm
.strip_name_encoding
) (name
);
5279 nlen
= strlen (name
);
5281 string
= alloca (nlen
+ plen
+ 1);
5282 memcpy (string
, prefix
, plen
);
5283 memcpy (string
+ plen
, name
, nlen
+ 1);
5285 DECL_SECTION_NAME (decl
) = build_string (nlen
+ plen
, string
);
5289 default_select_rtx_section (mode
, x
, align
)
5290 enum machine_mode mode ATTRIBUTE_UNUSED
;
5292 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
;
5295 switch (GET_CODE (x
))
5307 readonly_data_section ();
5311 default_elf_select_rtx_section (mode
, x
, align
)
5312 enum machine_mode mode
;
5314 unsigned HOST_WIDE_INT align
;
5316 /* ??? Handle small data here somehow. */
5319 switch (GET_CODE (x
))
5323 named_section (NULL_TREE
, ".data.rel.ro", 3);
5327 named_section (NULL_TREE
, ".data.rel.ro.local", 1);
5334 mergeable_constant_section (mode
, align
, 0);
5337 /* By default, we do nothing for encode_section_info, so we need not
5338 do anything but discard the '*' marker. */
5341 default_strip_name_encoding (str
)
5344 return str
+ (*str
== '*');
5347 /* Assume ELF-ish defaults, since that's pretty much the most liberal
5348 wrt cross-module name binding. */
5351 default_binds_local_p (exp
)
5354 return default_binds_local_p_1 (exp
, flag_pic
);
5358 default_binds_local_p_1 (exp
, shlib
)
5364 /* A non-decl is an entry in the constant pool. */
5367 /* Static variables are always local. */
5368 else if (! TREE_PUBLIC (exp
))
5370 /* A variable is local if the user tells us so. */
5371 else if (MODULE_LOCAL_P (exp
))
5373 /* Otherwise, variables defined outside this object may not be local. */
5374 else if (DECL_EXTERNAL (exp
))
5376 /* Linkonce and weak data are never local. */
5377 else if (DECL_ONE_ONLY (exp
) || DECL_WEAK (exp
))
5379 /* If PIC, then assume that any global name can be overridden by
5380 symbols resolved from other modules. */
5383 /* Uninitialized COMMON variable may be unified with symbols
5384 resolved from other modules. */
5385 else if (DECL_COMMON (exp
)
5386 && (DECL_INITIAL (exp
) == NULL
5387 || DECL_INITIAL (exp
) == error_mark_node
))
5389 /* Otherwise we're left with initialized (or non-common) global data
5390 which is of necessity defined locally. */
5397 /* Default function to output code that will globalize a label. A
5398 target must define GLOBAL_ASM_OP or provide it's own function to
5399 globalize a label. */
5400 #ifdef GLOBAL_ASM_OP
5402 default_globalize_label (stream
, name
)
5406 fputs (GLOBAL_ASM_OP
, stream
);
5407 assemble_name (stream
, name
);
5408 putc ('\n', stream
);
5410 #endif /* GLOBAL_ASM_OP */
5412 #include "gt-varasm.h"