1 /* Output variables, constants and external declarations, for GNU compiler.
2 Copyright (C) 1987, 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997,
3 1998, 1999, 2000, 2001, 2002, 2003 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
23 /* This file handles generation of all the assembler code
24 *except* the instructions of a function.
25 This includes declarations of variables and their initial values.
27 We also output the assembler code for constants stored in memory
28 and are responsible for combining constants with the same value. */
32 #include "coretypes.h"
39 #include "hard-reg-set.h"
48 #include "langhooks.h"
53 #ifdef XCOFF_DEBUGGING_INFO
54 #include "xcoffout.h" /* Needed for external data
55 declarations for e.g. AIX 4.x. */
58 #ifndef TRAMPOLINE_ALIGNMENT
59 #define TRAMPOLINE_ALIGNMENT FUNCTION_BOUNDARY
63 #define ASM_STABS_OP "\t.stabs\t"
66 /* The (assembler) name of the first globally-visible object output. */
67 const char *first_global_object_name
;
68 const char *weak_global_object_name
;
71 struct constant_descriptor_rtx
;
75 #define MAX_RTX_HASH_TABLE 61
77 struct varasm_status
GTY(())
79 /* Hash facility for making memory-constants
80 from constant rtl-expressions. It is used on RISC machines
81 where immediate integer arguments and constant addresses are restricted
82 so that such constants must be stored in memory.
84 This pool of constants is reinitialized for each function
85 so each function gets its own constants-pool that comes right before
87 struct constant_descriptor_rtx
** GTY ((length ("MAX_RTX_HASH_TABLE")))
88 x_const_rtx_hash_table
;
89 struct pool_constant
** GTY ((length ("MAX_RTX_HASH_TABLE")))
90 x_const_rtx_sym_hash_table
;
92 /* Pointers to first and last constant in pool. */
93 struct pool_constant
*x_first_pool
;
94 struct pool_constant
*x_last_pool
;
96 /* Current offset in constant pool (does not include any machine-specific
98 HOST_WIDE_INT x_pool_offset
;
101 #define const_rtx_hash_table (cfun->varasm->x_const_rtx_hash_table)
102 #define const_rtx_sym_hash_table (cfun->varasm->x_const_rtx_sym_hash_table)
103 #define first_pool (cfun->varasm->x_first_pool)
104 #define last_pool (cfun->varasm->x_last_pool)
105 #define pool_offset (cfun->varasm->x_pool_offset)
107 /* Number for making the label on the next
108 constant that is stored in memory. */
110 static GTY(()) int const_labelno
;
112 /* Number for making the label on the next
113 static variable internal to a function. */
115 static GTY(()) int var_labelno
;
117 /* Carry information from ASM_DECLARE_OBJECT_NAME
118 to ASM_FINISH_DECLARE_OBJECT. */
120 int size_directive_output
;
122 /* The last decl for which assemble_variable was called,
123 if it did ASM_DECLARE_OBJECT_NAME.
124 If the last call to assemble_variable didn't do that,
127 tree last_assemble_variable_decl
;
129 /* RTX_UNCHANGING_P in a MEM can mean it is stored into, for initialization.
130 So giving constant the alias set for the type will allow such
131 initializations to appear to conflict with the load of the constant. We
132 avoid this by giving all constants an alias set for just constants.
133 Since there will be no stores to that alias set, nothing will ever
134 conflict with them. */
136 static HOST_WIDE_INT const_alias_set
;
138 static const char *strip_reg_name
PARAMS ((const char *));
139 static int contains_pointers_p
PARAMS ((tree
));
140 static void decode_addr_const
PARAMS ((tree
, struct addr_const
*));
141 static unsigned int const_hash
PARAMS ((tree
));
142 static unsigned int const_hash_1
PARAMS ((tree
));
143 static int compare_constant
PARAMS ((tree
, tree
));
144 static tree copy_constant
PARAMS ((tree
));
145 static void output_constant_def_contents
PARAMS ((tree
, int, int));
146 static void decode_rtx_const
PARAMS ((enum machine_mode
, rtx
,
147 struct rtx_const
*));
148 static unsigned int const_hash_rtx
PARAMS ((enum machine_mode
, rtx
));
149 static int compare_constant_rtx
150 PARAMS ((enum machine_mode
, rtx
, struct constant_descriptor_rtx
*));
151 static struct constant_descriptor_rtx
* record_constant_rtx
152 PARAMS ((enum machine_mode
, rtx
));
153 static struct pool_constant
*find_pool_constant
PARAMS ((struct function
*, rtx
));
154 static void mark_constant_pool
PARAMS ((void));
155 static void mark_constants
PARAMS ((rtx
));
156 static int mark_constant
PARAMS ((rtx
*current_rtx
, void *data
));
157 static int output_addressed_constants
PARAMS ((tree
));
158 static unsigned HOST_WIDE_INT array_size_for_constructor
PARAMS ((tree
));
159 static unsigned min_align
PARAMS ((unsigned, unsigned));
160 static void output_constructor
PARAMS ((tree
, HOST_WIDE_INT
,
162 static void globalize_decl
PARAMS ((tree
));
163 static void maybe_assemble_visibility
PARAMS ((tree
));
164 static int in_named_entry_eq
PARAMS ((const PTR
, const PTR
));
165 static hashval_t in_named_entry_hash
PARAMS ((const PTR
));
166 #ifdef ASM_OUTPUT_BSS
167 static void asm_output_bss
PARAMS ((FILE *, tree
, const char *, int, int));
169 #ifdef BSS_SECTION_ASM_OP
170 #ifdef ASM_OUTPUT_ALIGNED_BSS
171 static void asm_output_aligned_bss
172 PARAMS ((FILE *, tree
, const char *, int, int)) ATTRIBUTE_UNUSED
;
174 #endif /* BSS_SECTION_ASM_OP */
175 static hashval_t const_str_htab_hash
PARAMS ((const void *x
));
176 static int const_str_htab_eq
PARAMS ((const void *x
, const void *y
));
177 static bool asm_emit_uninitialised
PARAMS ((tree
, const char*, int, int));
178 static void resolve_unique_section
PARAMS ((tree
, int, int));
179 static void mark_weak
PARAMS ((tree
));
181 enum in_section
{ no_section
, in_text
, in_data
, in_named
182 #ifdef BSS_SECTION_ASM_OP
185 #ifdef CTORS_SECTION_ASM_OP
188 #ifdef DTORS_SECTION_ASM_OP
191 #ifdef READONLY_DATA_SECTION_ASM_OP
194 #ifdef EXTRA_SECTIONS
198 static GTY(()) enum in_section in_section
= no_section
;
200 /* Return a nonzero value if DECL has a section attribute. */
201 #ifndef IN_NAMED_SECTION
202 #define IN_NAMED_SECTION(DECL) \
203 ((TREE_CODE (DECL) == FUNCTION_DECL || TREE_CODE (DECL) == VAR_DECL) \
204 && DECL_SECTION_NAME (DECL) != NULL_TREE)
207 /* Text of section name when in_section == in_named. */
208 static GTY(()) const char *in_named_name
;
210 /* Hash table of flags that have been used for a particular named section. */
212 struct in_named_entry
GTY(())
219 static GTY((param_is (struct in_named_entry
))) htab_t in_named_htab
;
221 /* Define functions like text_section for any extra sections. */
222 #ifdef EXTRA_SECTION_FUNCTIONS
223 EXTRA_SECTION_FUNCTIONS
226 /* Tell assembler to switch to text section. */
231 if (in_section
!= in_text
)
233 in_section
= in_text
;
237 fprintf (asm_out_file
, "%s\n", TEXT_SECTION_ASM_OP
);
242 /* Tell assembler to switch to data section. */
247 if (in_section
!= in_data
)
249 in_section
= in_data
;
250 if (flag_shared_data
)
252 #ifdef SHARED_SECTION_ASM_OP
253 fprintf (asm_out_file
, "%s\n", SHARED_SECTION_ASM_OP
);
255 fprintf (asm_out_file
, "%s\n", DATA_SECTION_ASM_OP
);
259 fprintf (asm_out_file
, "%s\n", DATA_SECTION_ASM_OP
);
263 /* Tell assembler to switch to read-only data section. This is normally
267 readonly_data_section ()
269 #ifdef READONLY_DATA_SECTION
270 READONLY_DATA_SECTION (); /* Note this can call data_section. */
272 #ifdef READONLY_DATA_SECTION_ASM_OP
273 if (in_section
!= in_readonly_data
)
275 in_section
= in_readonly_data
;
276 fputs (READONLY_DATA_SECTION_ASM_OP
, asm_out_file
);
277 fputc ('\n', asm_out_file
);
285 /* Determine if we're in the text section. */
290 return in_section
== in_text
;
293 /* Determine if we're in the data section. */
298 return in_section
== in_data
;
301 /* Helper routines for maintaining in_named_htab. */
304 in_named_entry_eq (p1
, p2
)
308 const struct in_named_entry
*old
= p1
;
309 const char *new = p2
;
311 return strcmp (old
->name
, new) == 0;
315 in_named_entry_hash (p
)
318 const struct in_named_entry
*old
= p
;
319 return htab_hash_string (old
->name
);
322 /* If SECTION has been seen before as a named section, return the flags
323 that were used. Otherwise, return 0. Note, that 0 is a perfectly valid
324 set of flags for a section to have, so 0 does not mean that the section
325 has not been seen. */
328 get_named_section_flags (section
)
331 struct in_named_entry
**slot
;
333 slot
= (struct in_named_entry
**)
334 htab_find_slot_with_hash (in_named_htab
, section
,
335 htab_hash_string (section
), NO_INSERT
);
337 return slot
? (*slot
)->flags
: 0;
340 /* Returns true if the section has been declared before. Sets internal
341 flag on this section in in_named_hash so subsequent calls on this
342 section will return false. */
345 named_section_first_declaration (name
)
348 struct in_named_entry
**slot
;
350 slot
= (struct in_named_entry
**)
351 htab_find_slot_with_hash (in_named_htab
, name
,
352 htab_hash_string (name
), NO_INSERT
);
353 if (! (*slot
)->declared
)
355 (*slot
)->declared
= true;
365 /* Record FLAGS for SECTION. If SECTION was previously recorded with a
366 different set of flags, return false. */
369 set_named_section_flags (section
, flags
)
373 struct in_named_entry
**slot
, *entry
;
375 slot
= (struct in_named_entry
**)
376 htab_find_slot_with_hash (in_named_htab
, section
,
377 htab_hash_string (section
), INSERT
);
382 entry
= (struct in_named_entry
*) ggc_alloc (sizeof (*entry
));
384 entry
->name
= ggc_strdup (section
);
385 entry
->flags
= flags
;
386 entry
->declared
= false;
388 else if (entry
->flags
!= flags
)
394 /* Tell assembler to change to section NAME with attributes FLAGS. */
397 named_section_flags (name
, flags
)
401 if (in_section
!= in_named
|| strcmp (name
, in_named_name
) != 0)
403 if (! set_named_section_flags (name
, flags
))
406 (*targetm
.asm_out
.named_section
) (name
, flags
);
408 if (flags
& SECTION_FORGET
)
409 in_section
= no_section
;
412 in_named_name
= ggc_strdup (name
);
413 in_section
= in_named
;
418 /* Tell assembler to change to section NAME for DECL.
419 If DECL is NULL, just switch to section NAME.
420 If NAME is NULL, get the name from DECL.
421 If RELOC is 1, the initializer for DECL contains relocs. */
424 named_section (decl
, name
, reloc
)
431 if (decl
!= NULL_TREE
&& !DECL_P (decl
))
434 name
= TREE_STRING_POINTER (DECL_SECTION_NAME (decl
));
436 flags
= (* targetm
.section_type_flags
) (decl
, name
, reloc
);
438 /* Sanity check user variables for flag changes. Non-user
439 section flag changes will abort in named_section_flags.
440 However, don't complain if SECTION_OVERRIDE is set.
441 We trust that the setter knows that it is safe to ignore
442 the default flags for this decl. */
443 if (decl
&& ! set_named_section_flags (name
, flags
))
445 flags
= get_named_section_flags (name
);
446 if ((flags
& SECTION_OVERRIDE
) == 0)
447 error_with_decl (decl
, "%s causes a section type conflict");
450 named_section_flags (name
, flags
);
453 /* If required, set DECL_SECTION_NAME to a unique name. */
456 resolve_unique_section (decl
, reloc
, flag_function_or_data_sections
)
458 int reloc ATTRIBUTE_UNUSED
;
459 int flag_function_or_data_sections
;
461 if (DECL_SECTION_NAME (decl
) == NULL_TREE
462 && targetm
.have_named_sections
463 && (flag_function_or_data_sections
464 || DECL_ONE_ONLY (decl
)))
465 (*targetm
.asm_out
.unique_section
) (decl
, reloc
);
468 #ifdef BSS_SECTION_ASM_OP
470 /* Tell the assembler to switch to the bss section. */
475 if (in_section
!= in_bss
)
477 #ifdef SHARED_BSS_SECTION_ASM_OP
478 if (flag_shared_data
)
479 fprintf (asm_out_file
, "%s\n", SHARED_BSS_SECTION_ASM_OP
);
482 fprintf (asm_out_file
, "%s\n", BSS_SECTION_ASM_OP
);
488 #ifdef ASM_OUTPUT_BSS
490 /* Utility function for ASM_OUTPUT_BSS for targets to use if
491 they don't support alignments in .bss.
492 ??? It is believed that this function will work in most cases so such
493 support is localized here. */
496 asm_output_bss (file
, decl
, name
, size
, rounded
)
498 tree decl ATTRIBUTE_UNUSED
;
500 int size ATTRIBUTE_UNUSED
, rounded
;
502 (*targetm
.asm_out
.globalize_label
) (file
, name
);
504 #ifdef ASM_DECLARE_OBJECT_NAME
505 last_assemble_variable_decl
= decl
;
506 ASM_DECLARE_OBJECT_NAME (file
, name
, decl
);
508 /* Standard thing is just output label for the object. */
509 ASM_OUTPUT_LABEL (file
, name
);
510 #endif /* ASM_DECLARE_OBJECT_NAME */
511 ASM_OUTPUT_SKIP (file
, rounded
? rounded
: 1);
516 #ifdef ASM_OUTPUT_ALIGNED_BSS
518 /* Utility function for targets to use in implementing
519 ASM_OUTPUT_ALIGNED_BSS.
520 ??? It is believed that this function will work in most cases so such
521 support is localized here. */
524 asm_output_aligned_bss (file
, decl
, name
, size
, align
)
526 tree decl ATTRIBUTE_UNUSED
;
531 ASM_OUTPUT_ALIGN (file
, floor_log2 (align
/ BITS_PER_UNIT
));
532 #ifdef ASM_DECLARE_OBJECT_NAME
533 last_assemble_variable_decl
= decl
;
534 ASM_DECLARE_OBJECT_NAME (file
, name
, decl
);
536 /* Standard thing is just output label for the object. */
537 ASM_OUTPUT_LABEL (file
, name
);
538 #endif /* ASM_DECLARE_OBJECT_NAME */
539 ASM_OUTPUT_SKIP (file
, size
? size
: 1);
544 #endif /* BSS_SECTION_ASM_OP */
546 /* Switch to the section for function DECL.
548 If DECL is NULL_TREE, switch to the text section.
549 ??? It's not clear that we will ever be passed NULL_TREE, but it's
550 safer to handle it. */
553 function_section (decl
)
556 if (decl
!= NULL_TREE
557 && DECL_SECTION_NAME (decl
) != NULL_TREE
)
558 named_section (decl
, (char *) 0, 0);
563 /* Switch to section for variable DECL. RELOC is the same as the
564 argument to SELECT_SECTION. */
567 variable_section (decl
, reloc
)
571 if (IN_NAMED_SECTION (decl
))
572 named_section (decl
, NULL
, reloc
);
574 (*targetm
.asm_out
.select_section
) (decl
, reloc
, DECL_ALIGN (decl
));
577 /* Tell assembler to switch to the section for string merging. */
580 mergeable_string_section (decl
, align
, flags
)
581 tree decl ATTRIBUTE_UNUSED
;
582 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
;
583 unsigned int flags ATTRIBUTE_UNUSED
;
585 #ifdef HAVE_GAS_SHF_MERGE
586 if (flag_merge_constants
587 && TREE_CODE (decl
) == STRING_CST
588 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
590 && TREE_STRING_LENGTH (decl
) >= int_size_in_bytes (TREE_TYPE (decl
)))
592 enum machine_mode mode
;
593 unsigned int modesize
;
598 mode
= TYPE_MODE (TREE_TYPE (TREE_TYPE (decl
)));
599 modesize
= GET_MODE_BITSIZE (mode
);
600 if (modesize
>= 8 && modesize
<= 256
601 && (modesize
& (modesize
- 1)) == 0)
603 if (align
< modesize
)
606 str
= TREE_STRING_POINTER (decl
);
607 len
= TREE_STRING_LENGTH (decl
);
608 unit
= GET_MODE_SIZE (mode
);
610 /* Check for embedded NUL characters. */
611 for (i
= 0; i
< len
; i
+= unit
)
613 for (j
= 0; j
< unit
; j
++)
614 if (str
[i
+ j
] != '\0')
621 sprintf (name
, ".rodata.str%d.%d", modesize
/ 8,
623 flags
|= (modesize
/ 8) | SECTION_MERGE
| SECTION_STRINGS
;
624 if (!i
&& modesize
< align
)
626 /* A "" string with requested alignment greater than
627 character size might cause a problem:
628 if some other string required even bigger
629 alignment than "", then linker might think the
630 "" is just part of padding after some other string
631 and not put it into the hash table initially.
632 But this means "" could have smaller alignment
634 #ifdef ASM_OUTPUT_SECTION_START
635 named_section_flags (name
, flags
);
636 ASM_OUTPUT_SECTION_START (asm_out_file
);
638 readonly_data_section ();
643 named_section_flags (name
, flags
);
649 readonly_data_section ();
652 /* Tell assembler to switch to the section for constant merging. */
655 mergeable_constant_section (mode
, align
, flags
)
656 enum machine_mode mode ATTRIBUTE_UNUSED
;
657 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
;
658 unsigned int flags ATTRIBUTE_UNUSED
;
660 #ifdef HAVE_GAS_SHF_MERGE
661 unsigned int modesize
= GET_MODE_BITSIZE (mode
);
663 if (flag_merge_constants
669 && (align
& (align
- 1)) == 0)
673 sprintf (name
, ".rodata.cst%d", (int) (align
/ 8));
674 flags
|= (align
/ 8) | SECTION_MERGE
;
675 named_section_flags (name
, flags
);
679 readonly_data_section ();
682 /* Given NAME, a putative register name, discard any customary prefixes. */
685 strip_reg_name (name
)
688 #ifdef REGISTER_PREFIX
689 if (!strncmp (name
, REGISTER_PREFIX
, strlen (REGISTER_PREFIX
)))
690 name
+= strlen (REGISTER_PREFIX
);
692 if (name
[0] == '%' || name
[0] == '#')
697 /* Decode an `asm' spec for a declaration as a register name.
698 Return the register number, or -1 if nothing specified,
699 or -2 if the ASMSPEC is not `cc' or `memory' and is not recognized,
700 or -3 if ASMSPEC is `cc' and is not recognized,
701 or -4 if ASMSPEC is `memory' and is not recognized.
702 Accept an exact spelling or a decimal number.
703 Prefixes such as % are optional. */
706 decode_reg_name (asmspec
)
713 /* Get rid of confusing prefixes. */
714 asmspec
= strip_reg_name (asmspec
);
716 /* Allow a decimal number as a "register name". */
717 for (i
= strlen (asmspec
) - 1; i
>= 0; i
--)
718 if (! ISDIGIT (asmspec
[i
]))
720 if (asmspec
[0] != 0 && i
< 0)
723 if (i
< FIRST_PSEUDO_REGISTER
&& i
>= 0)
729 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
731 && ! strcmp (asmspec
, strip_reg_name (reg_names
[i
])))
734 #ifdef ADDITIONAL_REGISTER_NAMES
736 static const struct { const char *const name
; const int number
; } table
[]
737 = ADDITIONAL_REGISTER_NAMES
;
739 for (i
= 0; i
< (int) ARRAY_SIZE (table
); i
++)
740 if (! strcmp (asmspec
, table
[i
].name
))
741 return table
[i
].number
;
743 #endif /* ADDITIONAL_REGISTER_NAMES */
745 if (!strcmp (asmspec
, "memory"))
748 if (!strcmp (asmspec
, "cc"))
757 /* Create the DECL_RTL for a VAR_DECL or FUNCTION_DECL. DECL should
758 have static storage duration. In other words, it should not be an
759 automatic variable, including PARM_DECLs.
761 There is, however, one exception: this function handles variables
762 explicitly placed in a particular register by the user.
764 ASMSPEC, if not 0, is the string which the user specified as the
765 assembler symbol name.
767 This is never called for PARM_DECL nodes. */
770 make_decl_rtl (decl
, asmspec
)
774 int top_level
= (DECL_CONTEXT (decl
) == NULL_TREE
);
775 const char *name
= 0;
776 const char *new_name
= 0;
780 /* Check that we are not being given an automatic variable. */
781 /* A weak alias has TREE_PUBLIC set but not the other bits. */
782 if (TREE_CODE (decl
) == PARM_DECL
783 || TREE_CODE (decl
) == RESULT_DECL
784 || (TREE_CODE (decl
) == VAR_DECL
785 && !TREE_STATIC (decl
)
786 && !TREE_PUBLIC (decl
)
787 && !DECL_EXTERNAL (decl
)
788 && !DECL_REGISTER (decl
)))
790 /* And that we were not given a type or a label. */
791 else if (TREE_CODE (decl
) == TYPE_DECL
792 || TREE_CODE (decl
) == LABEL_DECL
)
795 /* For a duplicate declaration, we can be called twice on the
796 same DECL node. Don't discard the RTL already made. */
797 if (DECL_RTL_SET_P (decl
))
799 /* If the old RTL had the wrong mode, fix the mode. */
800 if (GET_MODE (DECL_RTL (decl
)) != DECL_MODE (decl
))
801 SET_DECL_RTL (decl
, adjust_address_nv (DECL_RTL (decl
),
802 DECL_MODE (decl
), 0));
804 /* ??? Another way to do this would be to maintain a hashed
805 table of such critters. Instead of adding stuff to a DECL
806 to give certain attributes to it, we could use an external
807 hash map from DECL to set of attributes. */
809 /* Let the target reassign the RTL if it wants.
810 This is necessary, for example, when one machine specific
811 decl attribute overrides another. */
812 (* targetm
.encode_section_info
) (decl
, false);
816 new_name
= name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
818 reg_number
= decode_reg_name (asmspec
);
819 if (reg_number
== -2)
821 /* ASMSPEC is given, and not the name of a register. Mark the
822 name with a star so assemble_name won't munge it. */
823 char *starred
= alloca (strlen (asmspec
) + 2);
825 strcpy (starred
+ 1, asmspec
);
829 if (TREE_CODE (decl
) != FUNCTION_DECL
&& DECL_REGISTER (decl
))
831 /* First detect errors in declaring global registers. */
832 if (reg_number
== -1)
833 error_with_decl (decl
, "register name not specified for `%s'");
834 else if (reg_number
< 0)
835 error_with_decl (decl
, "invalid register name for `%s'");
836 else if (TYPE_MODE (TREE_TYPE (decl
)) == BLKmode
)
837 error_with_decl (decl
,
838 "data type of `%s' isn't suitable for a register");
839 else if (! HARD_REGNO_MODE_OK (reg_number
, TYPE_MODE (TREE_TYPE (decl
))))
840 error_with_decl (decl
,
841 "register specified for `%s' isn't suitable for data type");
842 /* Now handle properly declared static register variables. */
847 if (DECL_INITIAL (decl
) != 0 && TREE_STATIC (decl
))
849 DECL_INITIAL (decl
) = 0;
850 error ("global register variable has initial value");
852 if (TREE_THIS_VOLATILE (decl
))
853 warning ("volatile register variables don't work as you might wish");
855 /* If the user specified one of the eliminables registers here,
856 e.g., FRAME_POINTER_REGNUM, we don't want to get this variable
857 confused with that register and be eliminated. This usage is
858 somewhat suspect... */
860 SET_DECL_RTL (decl
, gen_rtx_raw_REG (DECL_MODE (decl
), reg_number
));
861 ORIGINAL_REGNO (DECL_RTL (decl
)) = reg_number
;
862 REG_USERVAR_P (DECL_RTL (decl
)) = 1;
864 if (TREE_STATIC (decl
))
866 /* Make this register global, so not usable for anything
868 #ifdef ASM_DECLARE_REGISTER_GLOBAL
869 ASM_DECLARE_REGISTER_GLOBAL (asm_out_file
, decl
, reg_number
, name
);
871 nregs
= HARD_REGNO_NREGS (reg_number
, DECL_MODE (decl
));
873 globalize_reg (reg_number
+ --nregs
);
876 /* As a register variable, it has no section. */
881 /* Now handle ordinary static variables and functions (in memory).
882 Also handle vars declared register invalidly. */
884 if (reg_number
>= 0 || reg_number
== -3)
885 error_with_decl (decl
,
886 "register name given for non-register variable `%s'");
888 /* Specifying a section attribute on a variable forces it into a
889 non-.bss section, and thus it cannot be common. */
890 if (TREE_CODE (decl
) == VAR_DECL
891 && DECL_SECTION_NAME (decl
) != NULL_TREE
892 && DECL_INITIAL (decl
) == NULL_TREE
893 && DECL_COMMON (decl
))
894 DECL_COMMON (decl
) = 0;
896 /* Variables can't be both common and weak. */
897 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_WEAK (decl
))
898 DECL_COMMON (decl
) = 0;
900 /* Can't use just the variable's own name for a variable
901 whose scope is less than the whole file, unless it's a member
902 of a local class (which will already be unambiguous).
903 Concatenate a distinguishing number. */
904 if (!top_level
&& !TREE_PUBLIC (decl
)
905 && ! (DECL_CONTEXT (decl
) && TYPE_P (DECL_CONTEXT (decl
)))
907 && name
== IDENTIFIER_POINTER (DECL_NAME (decl
)))
911 ASM_FORMAT_PRIVATE_NAME (label
, name
, var_labelno
);
916 if (name
!= new_name
)
918 SET_DECL_ASSEMBLER_NAME (decl
, get_identifier (new_name
));
919 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
922 x
= gen_rtx_SYMBOL_REF (Pmode
, name
);
923 SYMBOL_REF_WEAK (x
) = DECL_WEAK (decl
);
924 SYMBOL_REF_DECL (x
) = decl
;
926 x
= gen_rtx_MEM (DECL_MODE (decl
), x
);
927 if (TREE_CODE (decl
) != FUNCTION_DECL
)
928 set_mem_attributes (x
, decl
, 1);
929 SET_DECL_RTL (decl
, x
);
931 /* Optionally set flags or add text to the name to record information
932 such as that it is a function name.
933 If the name is changed, the macro ASM_OUTPUT_LABELREF
934 will have to know how to strip this information. */
935 (* targetm
.encode_section_info
) (decl
, true);
938 /* Make the rtl for variable VAR be volatile.
939 Use this only for static variables. */
942 make_var_volatile (var
)
945 if (GET_CODE (DECL_RTL (var
)) != MEM
)
948 MEM_VOLATILE_P (DECL_RTL (var
)) = 1;
951 /* Output a string of literal assembler code
952 for an `asm' keyword used between functions. */
955 assemble_asm (string
)
960 if (TREE_CODE (string
) == ADDR_EXPR
)
961 string
= TREE_OPERAND (string
, 0);
963 fprintf (asm_out_file
, "\t%s\n", TREE_STRING_POINTER (string
));
966 /* Record an element in the table of global destructors. SYMBOL is
967 a SYMBOL_REF of the function to be called; PRIORITY is a number
968 between 0 and MAX_INIT_PRIORITY. */
971 default_stabs_asm_out_destructor (symbol
, priority
)
973 int priority ATTRIBUTE_UNUSED
;
975 /* Tell GNU LD that this is part of the static destructor set.
976 This will work for any system that uses stabs, most usefully
978 fprintf (asm_out_file
, "%s\"___DTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
979 assemble_name (asm_out_file
, XSTR (symbol
, 0));
980 fputc ('\n', asm_out_file
);
984 default_named_section_asm_out_destructor (symbol
, priority
)
988 const char *section
= ".dtors";
991 /* ??? This only works reliably with the GNU linker. */
992 if (priority
!= DEFAULT_INIT_PRIORITY
)
994 sprintf (buf
, ".dtors.%.5u",
995 /* Invert the numbering so the linker puts us in the proper
996 order; constructors are run from right to left, and the
997 linker sorts in increasing order. */
998 MAX_INIT_PRIORITY
- priority
);
1002 named_section_flags (section
, SECTION_WRITE
);
1003 assemble_align (POINTER_SIZE
);
1004 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1007 #ifdef DTORS_SECTION_ASM_OP
1011 if (in_section
!= in_dtors
)
1013 in_section
= in_dtors
;
1014 fputs (DTORS_SECTION_ASM_OP
, asm_out_file
);
1015 fputc ('\n', asm_out_file
);
1020 default_dtor_section_asm_out_destructor (symbol
, priority
)
1022 int priority ATTRIBUTE_UNUSED
;
1025 assemble_align (POINTER_SIZE
);
1026 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1030 /* Likewise for global constructors. */
1033 default_stabs_asm_out_constructor (symbol
, priority
)
1035 int priority ATTRIBUTE_UNUSED
;
1037 /* Tell GNU LD that this is part of the static destructor set.
1038 This will work for any system that uses stabs, most usefully
1040 fprintf (asm_out_file
, "%s\"___CTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
1041 assemble_name (asm_out_file
, XSTR (symbol
, 0));
1042 fputc ('\n', asm_out_file
);
1046 default_named_section_asm_out_constructor (symbol
, priority
)
1050 const char *section
= ".ctors";
1053 /* ??? This only works reliably with the GNU linker. */
1054 if (priority
!= DEFAULT_INIT_PRIORITY
)
1056 sprintf (buf
, ".ctors.%.5u",
1057 /* Invert the numbering so the linker puts us in the proper
1058 order; constructors are run from right to left, and the
1059 linker sorts in increasing order. */
1060 MAX_INIT_PRIORITY
- priority
);
1064 named_section_flags (section
, SECTION_WRITE
);
1065 assemble_align (POINTER_SIZE
);
1066 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1069 #ifdef CTORS_SECTION_ASM_OP
1073 if (in_section
!= in_ctors
)
1075 in_section
= in_ctors
;
1076 fputs (CTORS_SECTION_ASM_OP
, asm_out_file
);
1077 fputc ('\n', asm_out_file
);
1082 default_ctor_section_asm_out_constructor (symbol
, priority
)
1084 int priority ATTRIBUTE_UNUSED
;
1087 assemble_align (POINTER_SIZE
);
1088 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1092 /* CONSTANT_POOL_BEFORE_FUNCTION may be defined as an expression with
1093 a nonzero value if the constant pool should be output before the
1094 start of the function, or a zero value if the pool should output
1095 after the end of the function. The default is to put it before the
1098 #ifndef CONSTANT_POOL_BEFORE_FUNCTION
1099 #define CONSTANT_POOL_BEFORE_FUNCTION 1
1102 /* Output assembler code for the constant pool of a function and associated
1103 with defining the name of the function. DECL describes the function.
1104 NAME is the function's name. For the constant pool, we use the current
1105 constant pool data. */
1108 assemble_start_function (decl
, fnname
)
1114 /* The following code does not need preprocessing in the assembler. */
1118 if (CONSTANT_POOL_BEFORE_FUNCTION
)
1119 output_constant_pool (fnname
, decl
);
1121 resolve_unique_section (decl
, 0, flag_function_sections
);
1122 function_section (decl
);
1124 /* Tell assembler to move to target machine's alignment for functions. */
1125 align
= floor_log2 (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
1126 if (align
< force_align_functions_log
)
1127 align
= force_align_functions_log
;
1130 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1133 /* Handle a user-specified function alignment.
1134 Note that we still need to align to FUNCTION_BOUNDARY, as above,
1135 because ASM_OUTPUT_MAX_SKIP_ALIGN might not do any alignment at all. */
1136 if (align_functions_log
> align
1137 && cfun
->function_frequency
!= FUNCTION_FREQUENCY_UNLIKELY_EXECUTED
)
1139 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
1140 ASM_OUTPUT_MAX_SKIP_ALIGN (asm_out_file
,
1141 align_functions_log
, align_functions
- 1);
1143 ASM_OUTPUT_ALIGN (asm_out_file
, align_functions_log
);
1147 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
1148 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file
, fnname
);
1151 (*debug_hooks
->begin_function
) (decl
);
1153 /* Make function name accessible from other files, if appropriate. */
1155 if (TREE_PUBLIC (decl
))
1157 if (! first_global_object_name
)
1162 p
= (* targetm
.strip_name_encoding
) (fnname
);
1165 if (! DECL_WEAK (decl
) && ! DECL_ONE_ONLY (decl
))
1166 first_global_object_name
= name
;
1168 weak_global_object_name
= name
;
1171 globalize_decl (decl
);
1173 maybe_assemble_visibility (decl
);
1176 /* Do any machine/system dependent processing of the function name */
1177 #ifdef ASM_DECLARE_FUNCTION_NAME
1178 ASM_DECLARE_FUNCTION_NAME (asm_out_file
, fnname
, current_function_decl
);
1180 /* Standard thing is just output label for the function. */
1181 ASM_OUTPUT_LABEL (asm_out_file
, fnname
);
1182 #endif /* ASM_DECLARE_FUNCTION_NAME */
1185 /* Output assembler code associated with defining the size of the
1186 function. DECL describes the function. NAME is the function's name. */
1189 assemble_end_function (decl
, fnname
)
1193 #ifdef ASM_DECLARE_FUNCTION_SIZE
1194 ASM_DECLARE_FUNCTION_SIZE (asm_out_file
, fnname
, decl
);
1196 if (! CONSTANT_POOL_BEFORE_FUNCTION
)
1198 output_constant_pool (fnname
, decl
);
1199 function_section (decl
); /* need to switch back */
1203 /* Assemble code to leave SIZE bytes of zeros. */
1206 assemble_zeros (size
)
1209 /* Do no output if -fsyntax-only. */
1210 if (flag_syntax_only
)
1213 #ifdef ASM_NO_SKIP_IN_TEXT
1214 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
1215 so we must output 0s explicitly in the text section. */
1216 if (ASM_NO_SKIP_IN_TEXT
&& in_text_section ())
1219 for (i
= 0; i
< size
; i
++)
1220 assemble_integer (const0_rtx
, 1, BITS_PER_UNIT
, 1);
1225 ASM_OUTPUT_SKIP (asm_out_file
, size
);
1228 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
1231 assemble_align (align
)
1234 if (align
> BITS_PER_UNIT
)
1236 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
1240 /* Assemble a string constant with the specified C string as contents. */
1243 assemble_string (p
, size
)
1250 /* If the string is very long, split it up. */
1254 int thissize
= size
- pos
;
1255 if (thissize
> maximum
)
1258 ASM_OUTPUT_ASCII (asm_out_file
, p
, thissize
);
1266 #if defined ASM_OUTPUT_ALIGNED_DECL_LOCAL
1267 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1268 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1270 #if defined ASM_OUTPUT_ALIGNED_LOCAL
1271 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1272 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, DECL_ALIGN (decl))
1274 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1275 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded)
1279 #if defined ASM_OUTPUT_ALIGNED_BSS
1280 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1281 ASM_OUTPUT_ALIGNED_BSS (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1283 #if defined ASM_OUTPUT_BSS
1284 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1285 ASM_OUTPUT_BSS (asm_out_file, decl, name, size, rounded)
1291 #if defined ASM_OUTPUT_ALIGNED_DECL_COMMON
1292 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1293 ASM_OUTPUT_ALIGNED_DECL_COMMON (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1295 #if defined ASM_OUTPUT_ALIGNED_COMMON
1296 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1297 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file, name, size, DECL_ALIGN (decl))
1299 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1300 ASM_OUTPUT_COMMON (asm_out_file, name, size, rounded)
1305 asm_emit_uninitialised (decl
, name
, size
, rounded
)
1308 int size ATTRIBUTE_UNUSED
;
1309 int rounded ATTRIBUTE_UNUSED
;
1317 destination
= asm_dest_local
;
1319 /* ??? We should handle .bss via select_section mechanisms rather than
1320 via special target hooks. That would eliminate this special case. */
1321 if (TREE_PUBLIC (decl
))
1323 if (!DECL_COMMON (decl
))
1325 destination
= asm_dest_bss
;
1330 destination
= asm_dest_common
;
1333 if (destination
== asm_dest_bss
)
1334 globalize_decl (decl
);
1335 resolve_unique_section (decl
, 0, flag_data_sections
);
1337 if (flag_shared_data
)
1339 switch (destination
)
1341 #ifdef ASM_OUTPUT_SHARED_BSS
1343 ASM_OUTPUT_SHARED_BSS (asm_out_file
, decl
, name
, size
, rounded
);
1346 #ifdef ASM_OUTPUT_SHARED_COMMON
1347 case asm_dest_common
:
1348 ASM_OUTPUT_SHARED_COMMON (asm_out_file
, name
, size
, rounded
);
1351 #ifdef ASM_OUTPUT_SHARED_LOCAL
1352 case asm_dest_local
:
1353 ASM_OUTPUT_SHARED_LOCAL (asm_out_file
, name
, size
, rounded
);
1361 switch (destination
)
1365 ASM_EMIT_BSS (decl
, name
, size
, rounded
);
1368 case asm_dest_common
:
1369 ASM_EMIT_COMMON (decl
, name
, size
, rounded
);
1371 case asm_dest_local
:
1372 ASM_EMIT_LOCAL (decl
, name
, size
, rounded
);
1381 /* Assemble everything that is needed for a variable or function declaration.
1382 Not used for automatic variables, and not used for function definitions.
1383 Should not be called for variables of incomplete structure type.
1385 TOP_LEVEL is nonzero if this variable has file scope.
1386 AT_END is nonzero if this is the special handling, at end of compilation,
1387 to define things that have had only tentative definitions.
1388 DONT_OUTPUT_DATA if nonzero means don't actually output the
1389 initial value (that will be done by the caller). */
1392 assemble_variable (decl
, top_level
, at_end
, dont_output_data
)
1394 int top_level ATTRIBUTE_UNUSED
;
1395 int at_end ATTRIBUTE_UNUSED
;
1396 int dont_output_data
;
1403 last_assemble_variable_decl
= 0;
1405 /* Normally no need to say anything here for external references,
1406 since assemble_external is called by the language-specific code
1407 when a declaration is first seen. */
1409 if (DECL_EXTERNAL (decl
))
1412 /* Output no assembler code for a function declaration.
1413 Only definitions of functions output anything. */
1415 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1418 /* Do nothing for global register variables. */
1419 if (DECL_RTL_SET_P (decl
) && GET_CODE (DECL_RTL (decl
)) == REG
)
1421 TREE_ASM_WRITTEN (decl
) = 1;
1425 /* If type was incomplete when the variable was declared,
1426 see if it is complete now. */
1428 if (DECL_SIZE (decl
) == 0)
1429 layout_decl (decl
, 0);
1431 /* Still incomplete => don't allocate it; treat the tentative defn
1432 (which is what it must have been) as an `extern' reference. */
1434 if (!dont_output_data
&& DECL_SIZE (decl
) == 0)
1436 error_with_file_and_line (DECL_SOURCE_FILE (decl
),
1437 DECL_SOURCE_LINE (decl
),
1438 "storage size of `%s' isn't known",
1439 IDENTIFIER_POINTER (DECL_NAME (decl
)));
1440 TREE_ASM_WRITTEN (decl
) = 1;
1444 /* The first declaration of a variable that comes through this function
1445 decides whether it is global (in C, has external linkage)
1446 or local (in C, has internal linkage). So do nothing more
1447 if this function has already run. */
1449 if (TREE_ASM_WRITTEN (decl
))
1452 /* Make sure targetm.encode_section_info is invoked before we set
1454 decl_rtl
= DECL_RTL (decl
);
1456 TREE_ASM_WRITTEN (decl
) = 1;
1458 /* Do no output if -fsyntax-only. */
1459 if (flag_syntax_only
)
1464 if (! dont_output_data
1465 && ! host_integerp (DECL_SIZE_UNIT (decl
), 1))
1467 error_with_decl (decl
, "size of variable `%s' is too large");
1471 name
= XSTR (XEXP (decl_rtl
, 0), 0);
1472 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
)
1473 && ! first_global_object_name
1474 && ! (DECL_COMMON (decl
) && (DECL_INITIAL (decl
) == 0
1475 || DECL_INITIAL (decl
) == error_mark_node
))
1476 && ! DECL_WEAK (decl
)
1477 && ! DECL_ONE_ONLY (decl
))
1482 p
= (* targetm
.strip_name_encoding
) (name
);
1483 xname
= xstrdup (p
);
1484 first_global_object_name
= xname
;
1487 /* Compute the alignment of this data. */
1489 align
= DECL_ALIGN (decl
);
1491 /* In the case for initialing an array whose length isn't specified,
1492 where we have not yet been able to do the layout,
1493 figure out the proper alignment now. */
1494 if (dont_output_data
&& DECL_SIZE (decl
) == 0
1495 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
)
1496 align
= MAX (align
, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl
))));
1498 /* Some object file formats have a maximum alignment which they support.
1499 In particular, a.out format supports a maximum alignment of 4. */
1500 #ifndef MAX_OFILE_ALIGNMENT
1501 #define MAX_OFILE_ALIGNMENT BIGGEST_ALIGNMENT
1503 if (align
> MAX_OFILE_ALIGNMENT
)
1505 warning_with_decl (decl
,
1506 "alignment of `%s' is greater than maximum object file alignment. Using %d",
1507 MAX_OFILE_ALIGNMENT
/BITS_PER_UNIT
);
1508 align
= MAX_OFILE_ALIGNMENT
;
1511 /* On some machines, it is good to increase alignment sometimes. */
1512 if (! DECL_USER_ALIGN (decl
))
1514 #ifdef DATA_ALIGNMENT
1515 align
= DATA_ALIGNMENT (TREE_TYPE (decl
), align
);
1517 #ifdef CONSTANT_ALIGNMENT
1518 if (DECL_INITIAL (decl
) != 0 && DECL_INITIAL (decl
) != error_mark_node
)
1519 align
= CONSTANT_ALIGNMENT (DECL_INITIAL (decl
), align
);
1523 /* Reset the alignment in case we have made it tighter, so we can benefit
1524 from it in get_pointer_alignment. */
1525 DECL_ALIGN (decl
) = align
;
1526 set_mem_align (decl_rtl
, align
);
1528 if (TREE_PUBLIC (decl
))
1529 maybe_assemble_visibility (decl
);
1531 /* Output any data that we will need to use the address of. */
1532 if (DECL_INITIAL (decl
) == error_mark_node
)
1533 reloc
= contains_pointers_p (TREE_TYPE (decl
)) ? 3 : 0;
1534 else if (DECL_INITIAL (decl
))
1535 reloc
= output_addressed_constants (DECL_INITIAL (decl
));
1536 resolve_unique_section (decl
, reloc
, flag_data_sections
);
1538 /* Handle uninitialized definitions. */
1540 /* If the decl has been given an explicit section name, then it
1541 isn't common, and shouldn't be handled as such. */
1542 if (DECL_SECTION_NAME (decl
) || dont_output_data
)
1544 /* We don't implement common thread-local data at present. */
1545 else if (DECL_THREAD_LOCAL (decl
))
1547 if (DECL_COMMON (decl
))
1548 sorry ("thread-local COMMON data not implemented");
1550 else if (DECL_INITIAL (decl
) == 0
1551 || DECL_INITIAL (decl
) == error_mark_node
1552 || (flag_zero_initialized_in_bss
1553 /* Leave constant zeroes in .rodata so they can be shared. */
1554 && !TREE_READONLY (decl
)
1555 && initializer_zerop (DECL_INITIAL (decl
))))
1557 unsigned HOST_WIDE_INT size
= tree_low_cst (DECL_SIZE_UNIT (decl
), 1);
1558 unsigned HOST_WIDE_INT rounded
= size
;
1560 /* Don't allocate zero bytes of common,
1561 since that means "undefined external" in the linker. */
1565 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1566 so that each uninitialized object starts on such a boundary. */
1567 rounded
+= (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1;
1568 rounded
= (rounded
/ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1569 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1571 #if !defined(ASM_OUTPUT_ALIGNED_COMMON) && !defined(ASM_OUTPUT_ALIGNED_DECL_COMMON) && !defined(ASM_OUTPUT_ALIGNED_BSS)
1572 if ((unsigned HOST_WIDE_INT
) DECL_ALIGN (decl
) / BITS_PER_UNIT
> rounded
)
1574 (decl
, "requested alignment for %s is greater than implemented alignment of %d",rounded
);
1577 /* If the target cannot output uninitialized but not common global data
1578 in .bss, then we have to use .data, so fall through. */
1579 if (asm_emit_uninitialised (decl
, name
, size
, rounded
))
1583 /* Handle initialized definitions.
1584 Also handle uninitialized global definitions if -fno-common and the
1585 target doesn't support ASM_OUTPUT_BSS. */
1587 /* First make the assembler name(s) global if appropriate. */
1588 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
))
1589 globalize_decl (decl
);
1591 /* Switch to the appropriate section. */
1592 variable_section (decl
, reloc
);
1594 /* dbxout.c needs to know this. */
1595 if (in_text_section ())
1596 DECL_IN_TEXT_SECTION (decl
) = 1;
1598 /* Output the alignment of this data. */
1599 if (align
> BITS_PER_UNIT
)
1601 ASM_OUTPUT_ALIGN (asm_out_file
,
1602 floor_log2 (DECL_ALIGN (decl
) / BITS_PER_UNIT
));
1605 /* Do any machine/system dependent processing of the object. */
1606 #ifdef ASM_DECLARE_OBJECT_NAME
1607 last_assemble_variable_decl
= decl
;
1608 ASM_DECLARE_OBJECT_NAME (asm_out_file
, name
, decl
);
1610 /* Standard thing is just output label for the object. */
1611 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1612 #endif /* ASM_DECLARE_OBJECT_NAME */
1614 if (!dont_output_data
)
1616 if (DECL_INITIAL (decl
) && DECL_INITIAL (decl
) != error_mark_node
)
1617 /* Output the actual data. */
1618 output_constant (DECL_INITIAL (decl
),
1619 tree_low_cst (DECL_SIZE_UNIT (decl
), 1),
1622 /* Leave space for it. */
1623 assemble_zeros (tree_low_cst (DECL_SIZE_UNIT (decl
), 1));
1627 /* Return 1 if type TYPE contains any pointers. */
1630 contains_pointers_p (type
)
1633 switch (TREE_CODE (type
))
1636 case REFERENCE_TYPE
:
1637 /* I'm not sure whether OFFSET_TYPE needs this treatment,
1638 so I'll play safe and return 1. */
1644 case QUAL_UNION_TYPE
:
1647 /* For a type that has fields, see if the fields have pointers. */
1648 for (fields
= TYPE_FIELDS (type
); fields
; fields
= TREE_CHAIN (fields
))
1649 if (TREE_CODE (fields
) == FIELD_DECL
1650 && contains_pointers_p (TREE_TYPE (fields
)))
1656 /* An array type contains pointers if its element type does. */
1657 return contains_pointers_p (TREE_TYPE (type
));
1664 /* Output something to declare an external symbol to the assembler.
1665 (Most assemblers don't need this, so we normally output nothing.)
1666 Do nothing if DECL is not external. */
1669 assemble_external (decl
)
1670 tree decl ATTRIBUTE_UNUSED
;
1672 /* Because most platforms do not define ASM_OUTPUT_EXTERNAL, the
1673 main body of this code is only rarely exercised. To provide some
1674 testing, on all platforms, we make sure that the ASM_OUT_FILE is
1675 open. If it's not, we should not be calling this function. */
1679 #ifdef ASM_OUTPUT_EXTERNAL
1680 if (DECL_P (decl
) && DECL_EXTERNAL (decl
) && TREE_PUBLIC (decl
))
1682 rtx rtl
= DECL_RTL (decl
);
1684 if (GET_CODE (rtl
) == MEM
&& GET_CODE (XEXP (rtl
, 0)) == SYMBOL_REF
1685 && ! SYMBOL_REF_USED (XEXP (rtl
, 0)))
1687 /* Some systems do require some output. */
1688 SYMBOL_REF_USED (XEXP (rtl
, 0)) = 1;
1689 ASM_OUTPUT_EXTERNAL (asm_out_file
, decl
, XSTR (XEXP (rtl
, 0), 0));
1695 /* Similar, for calling a library function FUN. */
1698 assemble_external_libcall (fun
)
1699 rtx fun ATTRIBUTE_UNUSED
;
1701 #ifdef ASM_OUTPUT_EXTERNAL_LIBCALL
1702 /* Declare library function name external when first used, if nec. */
1703 if (! SYMBOL_REF_USED (fun
))
1705 SYMBOL_REF_USED (fun
) = 1;
1706 ASM_OUTPUT_EXTERNAL_LIBCALL (asm_out_file
, fun
);
1711 /* Assemble a label named NAME. */
1714 assemble_label (name
)
1717 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1720 /* Output to FILE a reference to the assembler name of a C-level name NAME.
1721 If NAME starts with a *, the rest of NAME is output verbatim.
1722 Otherwise NAME is transformed in an implementation-defined way
1723 (usually by the addition of an underscore).
1724 Many macros in the tm file are defined to call this function. */
1727 assemble_name (file
, name
)
1731 const char *real_name
;
1734 real_name
= (* targetm
.strip_name_encoding
) (name
);
1736 id
= maybe_get_identifier (real_name
);
1738 TREE_SYMBOL_REFERENCED (id
) = 1;
1741 fputs (&name
[1], file
);
1743 ASM_OUTPUT_LABELREF (file
, name
);
1746 /* Allocate SIZE bytes writable static space with a gensym name
1747 and return an RTX to refer to its address. */
1750 assemble_static_space (size
)
1754 const char *namestring
;
1758 if (flag_shared_data
)
1762 ASM_GENERATE_INTERNAL_LABEL (name
, "LF", const_labelno
);
1764 namestring
= ggc_strdup (name
);
1766 x
= gen_rtx_SYMBOL_REF (Pmode
, namestring
);
1767 SYMBOL_REF_FLAGS (x
) = SYMBOL_FLAG_LOCAL
;
1769 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
1770 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file
, NULL_TREE
, name
, size
,
1773 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1774 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file
, name
, size
, BIGGEST_ALIGNMENT
);
1777 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1778 so that each uninitialized object starts on such a boundary. */
1779 /* Variable `rounded' might or might not be used in ASM_OUTPUT_LOCAL. */
1780 int rounded ATTRIBUTE_UNUSED
1781 = ((size
+ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1)
1782 / (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1783 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1784 ASM_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
1791 /* Assemble the static constant template for function entry trampolines.
1792 This is done at most once per compilation.
1793 Returns an RTX for the address of the template. */
1795 #ifdef TRAMPOLINE_TEMPLATE
1797 assemble_trampoline_template ()
1804 /* By default, put trampoline templates in read-only data section. */
1806 #ifdef TRAMPOLINE_SECTION
1807 TRAMPOLINE_SECTION ();
1809 readonly_data_section ();
1812 /* Write the assembler code to define one. */
1813 align
= floor_log2 (TRAMPOLINE_ALIGNMENT
/ BITS_PER_UNIT
);
1816 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1819 (*targetm
.asm_out
.internal_label
) (asm_out_file
, "LTRAMP", 0);
1820 TRAMPOLINE_TEMPLATE (asm_out_file
);
1822 /* Record the rtl to refer to it. */
1823 ASM_GENERATE_INTERNAL_LABEL (label
, "LTRAMP", 0);
1824 name
= ggc_strdup (label
);
1825 symbol
= gen_rtx_SYMBOL_REF (Pmode
, name
);
1826 SYMBOL_REF_FLAGS (symbol
) = SYMBOL_FLAG_LOCAL
;
1832 /* A and B are either alignments or offsets. Return the minimum alignment
1833 that may be assumed after adding the two together. */
1835 static inline unsigned
1839 return (a
| b
) & -(a
| b
);
1842 /* Return the assembler directive for creating a given kind of integer
1843 object. SIZE is the number of bytes in the object and ALIGNED_P
1844 indicates whether it is known to be aligned. Return NULL if the
1845 assembly dialect has no such directive.
1847 The returned string should be printed at the start of a new line and
1848 be followed immediately by the object's initial value. */
1851 integer_asm_op (size
, aligned_p
)
1855 struct asm_int_op
*ops
;
1858 ops
= &targetm
.asm_out
.aligned_op
;
1860 ops
= &targetm
.asm_out
.unaligned_op
;
1865 return targetm
.asm_out
.byte_op
;
1879 /* Use directive OP to assemble an integer object X. Print OP at the
1880 start of the line, followed immediately by the value of X. */
1883 assemble_integer_with_op (op
, x
)
1887 fputs (op
, asm_out_file
);
1888 output_addr_const (asm_out_file
, x
);
1889 fputc ('\n', asm_out_file
);
1892 /* The default implementation of the asm_out.integer target hook. */
1895 default_assemble_integer (x
, size
, aligned_p
)
1896 rtx x ATTRIBUTE_UNUSED
;
1897 unsigned int size ATTRIBUTE_UNUSED
;
1898 int aligned_p ATTRIBUTE_UNUSED
;
1900 const char *op
= integer_asm_op (size
, aligned_p
);
1901 return op
&& (assemble_integer_with_op (op
, x
), true);
1904 /* Assemble the integer constant X into an object of SIZE bytes. ALIGN is
1905 the alignment of the integer in bits. Return 1 if we were able to output
1906 the constant, otherwise 0. If FORCE is nonzero, abort if we can't output
1910 assemble_integer (x
, size
, align
, force
)
1918 aligned_p
= (align
>= MIN (size
* BITS_PER_UNIT
, BIGGEST_ALIGNMENT
));
1920 /* See if the target hook can handle this kind of object. */
1921 if ((*targetm
.asm_out
.integer
) (x
, size
, aligned_p
))
1924 /* If the object is a multi-byte one, try splitting it up. Split
1925 it into words it if is multi-word, otherwise split it into bytes. */
1928 enum machine_mode omode
, imode
;
1929 unsigned int subalign
;
1930 unsigned int subsize
, i
;
1932 subsize
= size
> UNITS_PER_WORD
? UNITS_PER_WORD
: 1;
1933 subalign
= MIN (align
, subsize
* BITS_PER_UNIT
);
1934 omode
= mode_for_size (subsize
* BITS_PER_UNIT
, MODE_INT
, 0);
1935 imode
= mode_for_size (size
* BITS_PER_UNIT
, MODE_INT
, 0);
1937 for (i
= 0; i
< size
; i
+= subsize
)
1939 rtx partial
= simplify_subreg (omode
, x
, imode
, i
);
1940 if (!partial
|| !assemble_integer (partial
, subsize
, subalign
, 0))
1946 /* If we've printed some of it, but not all of it, there's no going
1959 assemble_real (d
, mode
, align
)
1961 enum machine_mode mode
;
1966 unsigned int nalign
= min_align (align
, 32);
1968 switch (BITS_PER_UNIT
)
1974 REAL_VALUE_TO_TARGET_SINGLE (d
, l
);
1975 assemble_integer (GEN_INT (l
), 4, align
, 1);
1978 REAL_VALUE_TO_TARGET_DOUBLE (d
, data
);
1979 assemble_integer (GEN_INT (data
[0]), 4, align
, 1);
1980 assemble_integer (GEN_INT (data
[1]), 4, nalign
, 1);
1983 REAL_VALUE_TO_TARGET_LONG_DOUBLE (d
, data
);
1984 assemble_integer (GEN_INT (data
[0]), 4, align
, 1);
1985 assemble_integer (GEN_INT (data
[1]), 4, nalign
, 1);
1986 assemble_integer (GEN_INT (data
[2]), 4, nalign
, 1);
1989 REAL_VALUE_TO_TARGET_LONG_DOUBLE (d
, data
);
1990 assemble_integer (GEN_INT (data
[0]), 4, align
, 1);
1991 assemble_integer (GEN_INT (data
[1]), 4, nalign
, 1);
1992 assemble_integer (GEN_INT (data
[2]), 4, nalign
, 1);
1993 assemble_integer (GEN_INT (data
[3]), 4, nalign
, 1);
2004 REAL_VALUE_TO_TARGET_SINGLE (d
, l
);
2005 assemble_integer (GEN_INT (l
), 2, align
, 1);
2008 REAL_VALUE_TO_TARGET_DOUBLE (d
, data
);
2009 assemble_integer (GEN_INT (data
[0]), 2, align
, 1);
2010 assemble_integer (GEN_INT (data
[1]), 1, nalign
, 1);
2021 REAL_VALUE_TO_TARGET_SINGLE (d
, l
);
2022 assemble_integer (GEN_INT (l
), 1, align
, 1);
2025 REAL_VALUE_TO_TARGET_DOUBLE (d
, data
);
2026 assemble_integer (GEN_INT (data
[0]), 1, align
, 1);
2027 assemble_integer (GEN_INT (data
[1]), 1, nalign
, 1);
2039 /* Given an expression EXP with a constant value,
2040 reduce it to the sum of an assembler symbol and an integer.
2041 Store them both in the structure *VALUE.
2042 Abort if EXP does not reduce. */
2044 struct addr_const
GTY(())
2047 HOST_WIDE_INT offset
;
2051 decode_addr_const (exp
, value
)
2053 struct addr_const
*value
;
2055 tree target
= TREE_OPERAND (exp
, 0);
2061 if (TREE_CODE (target
) == COMPONENT_REF
2062 && host_integerp (byte_position (TREE_OPERAND (target
, 1)), 0))
2065 offset
+= int_byte_position (TREE_OPERAND (target
, 1));
2066 target
= TREE_OPERAND (target
, 0);
2068 else if (TREE_CODE (target
) == ARRAY_REF
2069 || TREE_CODE (target
) == ARRAY_RANGE_REF
)
2071 offset
+= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (target
)), 1)
2072 * tree_low_cst (TREE_OPERAND (target
, 1), 0));
2073 target
= TREE_OPERAND (target
, 0);
2079 switch (TREE_CODE (target
))
2083 x
= DECL_RTL (target
);
2087 x
= gen_rtx_MEM (FUNCTION_MODE
,
2088 gen_rtx_LABEL_REF (VOIDmode
,
2089 label_rtx (TREE_OPERAND (exp
, 0))));
2097 /* This constant should have been output already, but we can't simply
2098 use TREE_CST_RTL since INTEGER_CST doesn't have one. */
2099 x
= output_constant_def (target
, 1);
2106 if (GET_CODE (x
) != MEM
)
2111 value
->offset
= offset
;
2114 /* We do RTX_UNSPEC + XINT (blah), so nothing can go after RTX_UNSPEC. */
2115 enum kind
{ RTX_UNKNOWN
, RTX_DOUBLE
, RTX_VECTOR
, RTX_INT
, RTX_UNSPEC
};
2116 struct rtx_const
GTY(())
2118 ENUM_BITFIELD(kind
) kind
: 16;
2119 ENUM_BITFIELD(machine_mode
) mode
: 16;
2120 union rtx_const_un
{
2121 REAL_VALUE_TYPE
GTY ((tag ("4"))) du
;
2122 struct rtx_const_u_addr
{
2125 HOST_WIDE_INT offset
;
2126 } GTY ((tag ("1"))) addr
;
2127 struct rtx_const_u_di
{
2130 } GTY ((tag ("0"))) di
;
2132 /* The max vector size we have is 16 wide; two variants for
2133 integral and floating point vectors. */
2134 struct rtx_const_int_vec
{
2137 } GTY ((tag ("2"))) int_vec
[16];
2139 REAL_VALUE_TYPE
GTY ((tag ("3"))) fp_vec
[8];
2141 } GTY ((desc ("%1.kind >= RTX_INT"), descbits ("1"))) un
;
2144 /* Uniquize all constants that appear in memory.
2145 Each constant in memory thus far output is recorded
2146 in `const_hash_table'. */
2148 struct constant_descriptor_tree
GTY(())
2150 /* More constant_descriptors with the same hash code. */
2151 struct constant_descriptor_tree
*next
;
2153 /* The label of the constant. */
2156 /* A MEM for the constant. */
2159 /* The value of the constant. */
2163 #define MAX_HASH_TABLE 1009
2164 static GTY(()) struct constant_descriptor_tree
*
2165 const_hash_table
[MAX_HASH_TABLE
];
2167 /* We maintain a hash table of STRING_CST values. Unless we are asked to force
2168 out a string constant, we defer output of the constants until we know
2169 they are actually used. This will be if something takes its address or if
2170 there is a usage of the string in the RTL of a function. */
2172 #define STRHASH(x) htab_hash_pointer (x)
2174 struct deferred_string
GTY(())
2181 static GTY ((param_is (struct deferred_string
))) htab_t const_str_htab
;
2183 /* Returns a hash code for X (which is a really a
2184 struct deferred_string *). */
2187 const_str_htab_hash (x
)
2190 return STRHASH (((const struct deferred_string
*) x
)->label
);
2193 /* Returns nonzero if the value represented by X (which is really a
2194 struct deferred_string *) is the same as that given by Y
2195 (which is really a char *). */
2198 const_str_htab_eq (x
, y
)
2202 return (((const struct deferred_string
*) x
)->label
== (const char *) y
);
2205 /* Compute a hash code for a constant expression. */
2211 return const_hash_1 (exp
) % MAX_HASH_TABLE
;
2221 enum tree_code code
= TREE_CODE (exp
);
2223 /* Either set P and LEN to the address and len of something to hash and
2224 exit the switch or return a value. */
2229 p
= (char *) &TREE_INT_CST (exp
);
2230 len
= sizeof TREE_INT_CST (exp
);
2234 return real_hash (TREE_REAL_CST_PTR (exp
));
2237 p
= TREE_STRING_POINTER (exp
);
2238 len
= TREE_STRING_LENGTH (exp
);
2242 return (const_hash_1 (TREE_REALPART (exp
)) * 5
2243 + const_hash_1 (TREE_IMAGPART (exp
)));
2246 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2250 len
= int_size_in_bytes (TREE_TYPE (exp
));
2251 tmp
= (char *) alloca (len
);
2252 get_set_constructor_bytes (exp
, (unsigned char *) tmp
, len
);
2260 hi
= 5 + int_size_in_bytes (TREE_TYPE (exp
));
2262 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2263 if (TREE_VALUE (link
))
2264 hi
= hi
* 603 + const_hash_1 (TREE_VALUE (link
));
2272 struct addr_const value
;
2274 decode_addr_const (exp
, &value
);
2275 if (GET_CODE (value
.base
) == SYMBOL_REF
)
2277 /* Don't hash the address of the SYMBOL_REF;
2278 only use the offset and the symbol name. */
2280 p
= XSTR (value
.base
, 0);
2281 for (i
= 0; p
[i
] != 0; i
++)
2282 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2284 else if (GET_CODE (value
.base
) == LABEL_REF
)
2285 hi
= value
.offset
+ CODE_LABEL_NUMBER (XEXP (value
.base
, 0)) * 13;
2293 return (const_hash_1 (TREE_OPERAND (exp
, 0)) * 9
2294 + const_hash_1 (TREE_OPERAND (exp
, 1)));
2298 case NON_LVALUE_EXPR
:
2299 return const_hash_1 (TREE_OPERAND (exp
, 0)) * 7 + 2;
2302 /* A language specific constant. Just hash the code. */
2306 /* Compute hashing function */
2308 for (i
= 0; i
< len
; i
++)
2309 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2314 /* Compare t1 and t2, and return 1 only if they are known to result in
2315 the same bit pattern on output. */
2318 compare_constant (t1
, t2
)
2322 enum tree_code typecode
;
2324 if (t1
== NULL_TREE
)
2325 return t2
== NULL_TREE
;
2326 if (t2
== NULL_TREE
)
2329 if (TREE_CODE (t1
) != TREE_CODE (t2
))
2332 switch (TREE_CODE (t1
))
2335 /* Integer constants are the same only if the same width of type. */
2336 if (TYPE_PRECISION (TREE_TYPE (t1
)) != TYPE_PRECISION (TREE_TYPE (t2
)))
2338 return tree_int_cst_equal (t1
, t2
);
2341 /* Real constants are the same only if the same width of type. */
2342 if (TYPE_PRECISION (TREE_TYPE (t1
)) != TYPE_PRECISION (TREE_TYPE (t2
)))
2345 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
2348 if (flag_writable_strings
)
2351 if (TYPE_MODE (TREE_TYPE (t1
)) != TYPE_MODE (TREE_TYPE (t2
)))
2354 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
2355 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
2356 TREE_STRING_LENGTH (t1
)));
2359 return (compare_constant (TREE_REALPART (t1
), TREE_REALPART (t2
))
2360 && compare_constant (TREE_IMAGPART (t1
), TREE_IMAGPART (t2
)));
2363 typecode
= TREE_CODE (TREE_TYPE (t1
));
2364 if (typecode
!= TREE_CODE (TREE_TYPE (t2
)))
2367 if (typecode
== SET_TYPE
)
2369 int len
= int_size_in_bytes (TREE_TYPE (t2
));
2370 unsigned char *tmp1
, *tmp2
;
2372 if (int_size_in_bytes (TREE_TYPE (t1
)) != len
)
2375 tmp1
= (unsigned char *) alloca (len
);
2376 tmp2
= (unsigned char *) alloca (len
);
2378 if (get_set_constructor_bytes (t1
, tmp1
, len
) != NULL_TREE
)
2380 if (get_set_constructor_bytes (t2
, tmp2
, len
) != NULL_TREE
)
2383 return memcmp (tmp1
, tmp2
, len
) != 0;
2389 if (typecode
== ARRAY_TYPE
)
2391 HOST_WIDE_INT size_1
= int_size_in_bytes (TREE_TYPE (t1
));
2392 /* For arrays, check that the sizes all match. */
2393 if (TYPE_MODE (TREE_TYPE (t1
)) != TYPE_MODE (TREE_TYPE (t2
))
2395 || size_1
!= int_size_in_bytes (TREE_TYPE (t2
)))
2400 /* For record and union constructors, require exact type
2402 if (TREE_TYPE (t1
) != TREE_TYPE (t2
))
2406 for (l1
= CONSTRUCTOR_ELTS (t1
), l2
= CONSTRUCTOR_ELTS (t2
);
2408 l1
= TREE_CHAIN (l1
), l2
= TREE_CHAIN (l2
))
2410 /* Check that each value is the same... */
2411 if (! compare_constant (TREE_VALUE (l1
), TREE_VALUE (l2
)))
2413 /* ... and that they apply to the same fields! */
2414 if (typecode
== ARRAY_TYPE
)
2416 if (! compare_constant (TREE_PURPOSE (l1
),
2422 if (TREE_PURPOSE (l1
) != TREE_PURPOSE (l2
))
2427 return l1
== NULL_TREE
&& l2
== NULL_TREE
;
2433 struct addr_const value1
, value2
;
2435 decode_addr_const (t1
, &value1
);
2436 decode_addr_const (t2
, &value2
);
2437 return (value1
.offset
== value2
.offset
2438 && strcmp (XSTR (value1
.base
, 0), XSTR (value2
.base
, 0)) == 0);
2444 return (compare_constant (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0))
2445 && compare_constant(TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1)));
2449 case NON_LVALUE_EXPR
:
2450 return compare_constant (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
2455 nt1
= (*lang_hooks
.expand_constant
) (t1
);
2456 nt2
= (*lang_hooks
.expand_constant
) (t2
);
2457 if (nt1
!= t1
|| nt2
!= t2
)
2458 return compare_constant (nt1
, nt2
);
2464 /* Should not get here. */
2468 /* Record a list of constant expressions that were passed to
2469 output_constant_def but that could not be output right away. */
2471 struct deferred_constant
2473 struct deferred_constant
*next
;
2479 static struct deferred_constant
*deferred_constants
;
2481 /* Nonzero means defer output of addressed subconstants
2482 (i.e., those for which output_constant_def is called.) */
2483 static int defer_addressed_constants_flag
;
2485 /* Start deferring output of subconstants. */
2488 defer_addressed_constants ()
2490 defer_addressed_constants_flag
++;
2493 /* Stop deferring output of subconstants,
2494 and output now all those that have been deferred. */
2497 output_deferred_addressed_constants ()
2499 struct deferred_constant
*p
, *next
;
2501 defer_addressed_constants_flag
--;
2503 if (defer_addressed_constants_flag
> 0)
2506 for (p
= deferred_constants
; p
; p
= next
)
2508 output_constant_def_contents (p
->exp
, p
->reloc
, p
->labelno
);
2513 deferred_constants
= 0;
2516 /* Make a copy of the whole tree structure for a constant. This
2517 handles the same types of nodes that compare_constant handles. */
2523 switch (TREE_CODE (exp
))
2526 /* For ADDR_EXPR, we do not want to copy the decl whose address
2527 is requested. We do want to copy constants though. */
2528 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, 0))) == 'c')
2529 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2530 copy_constant (TREE_OPERAND (exp
, 0)));
2532 return copy_node (exp
);
2537 return copy_node (exp
);
2540 return build_complex (TREE_TYPE (exp
),
2541 copy_constant (TREE_REALPART (exp
)),
2542 copy_constant (TREE_IMAGPART (exp
)));
2546 return build (TREE_CODE (exp
), TREE_TYPE (exp
),
2547 copy_constant (TREE_OPERAND (exp
, 0)),
2548 copy_constant (TREE_OPERAND (exp
, 1)));
2552 case NON_LVALUE_EXPR
:
2553 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2554 copy_constant (TREE_OPERAND (exp
, 0)));
2558 tree copy
= copy_node (exp
);
2559 tree list
= copy_list (CONSTRUCTOR_ELTS (exp
));
2562 CONSTRUCTOR_ELTS (copy
) = list
;
2563 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
2564 TREE_VALUE (tail
) = copy_constant (TREE_VALUE (tail
));
2565 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2566 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
2567 TREE_PURPOSE (tail
) = copy_constant (TREE_PURPOSE (tail
));
2575 t
= (*lang_hooks
.expand_constant
) (exp
);
2577 return copy_constant (t
);
2584 /* Return an rtx representing a reference to constant data in memory
2585 for the constant expression EXP.
2587 If assembler code for such a constant has already been output,
2588 return an rtx to refer to it.
2589 Otherwise, output such a constant in memory (or defer it for later)
2590 and generate an rtx for it.
2592 If DEFER is nonzero, the output of string constants can be deferred
2593 and output only if referenced in the function after all optimizations.
2595 The TREE_CST_RTL of EXP is set up to point to that rtx.
2596 The const_hash_table records which constants already have label strings. */
2599 output_constant_def (exp
, defer
)
2604 struct constant_descriptor_tree
*desc
;
2605 struct deferred_string
**defstr
;
2612 /* We can't just use the saved RTL if this is a deferred string constant
2613 and we are not to defer anymore. */
2614 if (TREE_CODE (exp
) != INTEGER_CST
&& TREE_CST_RTL (exp
)
2615 && (defer
|| !STRING_POOL_ADDRESS_P (XEXP (TREE_CST_RTL (exp
), 0))))
2616 return TREE_CST_RTL (exp
);
2618 /* Make sure any other constants whose addresses appear in EXP
2619 are assigned label numbers. */
2621 reloc
= output_addressed_constants (exp
);
2623 /* Compute hash code of EXP. Search the descriptors for that hash code
2624 to see if any of them describes EXP. If yes, the descriptor records
2625 the label number already assigned. */
2627 hash
= const_hash (exp
);
2629 for (desc
= const_hash_table
[hash
]; desc
; desc
= desc
->next
)
2630 if (compare_constant (exp
, desc
->value
))
2637 /* No constant equal to EXP is known to have been output.
2638 Make a constant descriptor to enter EXP in the hash table.
2639 Assign the label number and record it in the descriptor for
2640 future calls to this function to find. */
2642 /* Create a string containing the label name, in LABEL. */
2643 labelno
= const_labelno
++;
2644 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", labelno
);
2646 desc
= ggc_alloc (sizeof (*desc
));
2647 desc
->next
= const_hash_table
[hash
];
2648 desc
->label
= ggc_strdup (label
);
2649 desc
->value
= copy_constant (exp
);
2650 const_hash_table
[hash
] = desc
;
2652 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
2653 symbol
= gen_rtx_SYMBOL_REF (Pmode
, desc
->label
);
2654 SYMBOL_REF_FLAGS (symbol
) = SYMBOL_FLAG_LOCAL
;
2656 rtl
= desc
->rtl
= gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp
)), symbol
);
2658 set_mem_attributes (rtl
, exp
, 1);
2659 set_mem_alias_set (rtl
, 0);
2660 set_mem_alias_set (rtl
, const_alias_set
);
2667 if (TREE_CODE (exp
) != INTEGER_CST
)
2668 TREE_CST_RTL (exp
) = rtl
;
2670 /* Optionally set flags or add text to the name to record information
2671 such as that it is a function name. If the name is changed, the macro
2672 ASM_OUTPUT_LABELREF will have to know how to strip this information. */
2673 /* A previously-processed constant would already have section info
2677 /* Take care not to invoke targetm.encode_section_info for
2678 constants which don't have a TREE_CST_RTL. */
2679 if (TREE_CODE (exp
) != INTEGER_CST
)
2680 (*targetm
.encode_section_info
) (exp
, true);
2683 desc
->label
= XSTR (XEXP (desc
->rtl
, 0), 0);
2687 && STRING_POOL_ADDRESS_P (XEXP (rtl
, 0))
2688 && (!defer
|| defer_addressed_constants_flag
))
2690 defstr
= (struct deferred_string
**)
2691 htab_find_slot_with_hash (const_str_htab
, desc
->label
,
2692 STRHASH (desc
->label
), NO_INSERT
);
2695 /* If the string is currently deferred but we need to output it now,
2696 remove it from deferred string hash table. */
2698 labelno
= (*defstr
)->labelno
;
2699 STRING_POOL_ADDRESS_P (XEXP (rtl
, 0)) = 0;
2700 htab_clear_slot (const_str_htab
, (void **) defstr
);
2704 /* If this is the first time we've seen this particular constant,
2705 output it (or defer its output for later). */
2708 if (defer_addressed_constants_flag
)
2710 struct deferred_constant
*p
2711 = (struct deferred_constant
*)
2712 xmalloc (sizeof (struct deferred_constant
));
2714 p
->exp
= desc
->value
;
2716 p
->labelno
= labelno
;
2717 p
->next
= deferred_constants
;
2718 deferred_constants
= p
;
2722 /* Do no output if -fsyntax-only. */
2723 if (! flag_syntax_only
)
2725 if (TREE_CODE (exp
) != STRING_CST
2727 || flag_writable_strings
2728 || (defstr
= (struct deferred_string
**)
2729 htab_find_slot_with_hash (const_str_htab
,
2731 STRHASH (desc
->label
),
2733 output_constant_def_contents (exp
, reloc
, labelno
);
2736 struct deferred_string
*p
;
2738 p
= (struct deferred_string
*)
2739 ggc_alloc (sizeof (struct deferred_string
));
2741 p
->exp
= desc
->value
;
2742 p
->label
= desc
->label
;
2743 p
->labelno
= labelno
;
2745 STRING_POOL_ADDRESS_P (XEXP (rtl
, 0)) = 1;
2754 /* Now output assembler code to define the label for EXP,
2755 and follow it with the data of EXP. */
2758 output_constant_def_contents (exp
, reloc
, labelno
)
2765 /* Align the location counter as required by EXP's data type. */
2766 align
= TYPE_ALIGN (TREE_TYPE (exp
));
2767 #ifdef CONSTANT_ALIGNMENT
2768 align
= CONSTANT_ALIGNMENT (exp
, align
);
2771 if (IN_NAMED_SECTION (exp
))
2772 named_section (exp
, NULL
, reloc
);
2774 (*targetm
.asm_out
.select_section
) (exp
, reloc
, align
);
2776 if (align
> BITS_PER_UNIT
)
2778 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
2781 /* Output the label itself. */
2782 (*targetm
.asm_out
.internal_label
) (asm_out_file
, "LC", labelno
);
2784 /* Output the value of EXP. */
2785 output_constant (exp
,
2786 (TREE_CODE (exp
) == STRING_CST
2787 ? MAX (TREE_STRING_LENGTH (exp
),
2788 int_size_in_bytes (TREE_TYPE (exp
)))
2789 : int_size_in_bytes (TREE_TYPE (exp
))),
2794 /* Used in the hash tables to avoid outputting the same constant
2795 twice. Unlike 'struct constant_descriptor_tree', RTX constants
2796 are output once per function, not once per file; there seems
2797 to be no reason for the difference. */
2799 struct constant_descriptor_rtx
GTY(())
2801 /* More constant_descriptors with the same hash code. */
2802 struct constant_descriptor_rtx
*next
;
2804 /* A MEM for the constant. */
2807 /* The value of the constant. */
2808 struct rtx_const value
;
2811 /* Structure to represent sufficient information about a constant so that
2812 it can be output when the constant pool is output, so that function
2813 integration can be done, and to simplify handling on machines that reference
2814 constant pool as base+displacement. */
2816 struct pool_constant
GTY(())
2818 struct constant_descriptor_rtx
*desc
;
2819 struct pool_constant
*next
;
2820 struct pool_constant
*next_sym
;
2822 enum machine_mode mode
;
2825 HOST_WIDE_INT offset
;
2829 /* Hash code for a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true.
2830 The argument is XSTR (... , 0) */
2832 #define SYMHASH(LABEL) (((unsigned long) (LABEL)) % MAX_RTX_HASH_TABLE)
2834 /* Initialize constant pool hashing for a new function. */
2837 init_varasm_status (f
)
2840 struct varasm_status
*p
;
2841 p
= (struct varasm_status
*) ggc_alloc (sizeof (struct varasm_status
));
2843 p
->x_const_rtx_hash_table
2844 = ((struct constant_descriptor_rtx
**)
2845 ggc_alloc_cleared (MAX_RTX_HASH_TABLE
2846 * sizeof (struct constant_descriptor_rtx
*)));
2847 p
->x_const_rtx_sym_hash_table
2848 = ((struct pool_constant
**)
2849 ggc_alloc_cleared (MAX_RTX_HASH_TABLE
2850 * sizeof (struct pool_constant
*)));
2852 p
->x_first_pool
= p
->x_last_pool
= 0;
2853 p
->x_pool_offset
= 0;
2857 /* Express an rtx for a constant integer (perhaps symbolic)
2858 as the sum of a symbol or label plus an explicit integer.
2859 They are stored into VALUE. */
2862 decode_rtx_const (mode
, x
, value
)
2863 enum machine_mode mode
;
2865 struct rtx_const
*value
;
2867 /* Clear the whole structure, including any gaps. */
2868 memset (value
, 0, sizeof (struct rtx_const
));
2870 value
->kind
= RTX_INT
; /* Most usual kind. */
2873 switch (GET_CODE (x
))
2876 value
->kind
= RTX_DOUBLE
;
2877 if (GET_MODE (x
) != VOIDmode
)
2879 const REAL_VALUE_TYPE
*r
= CONST_DOUBLE_REAL_VALUE (x
);
2881 value
->mode
= GET_MODE (x
);
2883 /* Copy the REAL_VALUE_TYPE by members so that we don't
2884 copy garbage from the original structure into our
2885 carefully cleaned hashing structure. */
2886 value
->un
.du
.class = r
->class;
2887 value
->un
.du
.sign
= r
->sign
;
2894 value
->un
.du
.exp
= r
->exp
;
2897 memcpy (value
->un
.du
.sig
, r
->sig
, sizeof (r
->sig
));
2905 value
->un
.di
.low
= CONST_DOUBLE_LOW (x
);
2906 value
->un
.di
.high
= CONST_DOUBLE_HIGH (x
);
2914 units
= CONST_VECTOR_NUNITS (x
);
2915 value
->kind
= RTX_VECTOR
;
2918 if (GET_MODE_CLASS (mode
) == MODE_VECTOR_INT
)
2920 for (i
= 0; i
< units
; ++i
)
2922 rtx elt
= CONST_VECTOR_ELT (x
, i
);
2923 if (GET_CODE (elt
) == CONST_INT
)
2925 value
->un
.int_vec
[i
].low
= INTVAL (elt
);
2926 value
->un
.int_vec
[i
].high
= 0;
2930 value
->un
.int_vec
[i
].low
= CONST_DOUBLE_LOW (elt
);
2931 value
->un
.int_vec
[i
].high
= CONST_DOUBLE_HIGH (elt
);
2935 else if (GET_MODE_CLASS (mode
) == MODE_VECTOR_FLOAT
)
2937 for (i
= 0; i
< units
; ++i
)
2939 const REAL_VALUE_TYPE
*r
2940 = CONST_DOUBLE_REAL_VALUE (CONST_VECTOR_ELT (x
, i
));
2941 REAL_VALUE_TYPE
*d
= &value
->un
.fp_vec
[i
];
2943 /* Copy the REAL_VALUE_TYPE by members so that we don't
2944 copy garbage from the original structure into our
2945 carefully cleaned hashing structure. */
2946 d
->class = r
->class;
2957 memcpy (d
->sig
, r
->sig
, sizeof (r
->sig
));
2970 value
->un
.addr
.offset
= INTVAL (x
);
2976 value
->un
.addr
.base
= x
;
2981 if (GET_CODE (x
) == PLUS
&& GET_CODE (XEXP (x
, 1)) == CONST_INT
)
2983 value
->un
.addr
.base
= XEXP (x
, 0);
2984 value
->un
.addr
.offset
= INTVAL (XEXP (x
, 1));
2986 else if (GET_CODE (x
) == MINUS
&& GET_CODE (XEXP (x
, 1)) == CONST_INT
)
2988 value
->un
.addr
.base
= XEXP (x
, 0);
2989 value
->un
.addr
.offset
= - INTVAL (XEXP (x
, 1));
2993 value
->un
.addr
.base
= x
;
2994 value
->un
.addr
.offset
= 0;
2999 value
->kind
= RTX_UNKNOWN
;
3003 if (value
->kind
== RTX_INT
&& value
->un
.addr
.base
!= 0
3004 && GET_CODE (value
->un
.addr
.base
) == UNSPEC
)
3006 /* For a simple UNSPEC, the base is set to the
3007 operand, the kind field is set to the index of
3008 the unspec expression.
3009 Together with the code below, in case that
3010 the operand is a SYMBOL_REF or LABEL_REF,
3011 the address of the string or the code_label
3012 is taken as base. */
3013 if (XVECLEN (value
->un
.addr
.base
, 0) == 1)
3015 value
->kind
= RTX_UNSPEC
+ XINT (value
->un
.addr
.base
, 1);
3016 value
->un
.addr
.base
= XVECEXP (value
->un
.addr
.base
, 0, 0);
3020 if (value
->kind
>= RTX_INT
&& value
->un
.addr
.base
!= 0)
3021 switch (GET_CODE (value
->un
.addr
.base
))
3024 /* Use the string's address, not the SYMBOL_REF's address,
3025 for the sake of addresses of library routines. */
3026 value
->un
.addr
.symbol
= XSTR (value
->un
.addr
.base
, 0);
3027 value
->un
.addr
.base
= NULL_RTX
;
3031 /* For a LABEL_REF, compare labels. */
3032 value
->un
.addr
.base
= XEXP (value
->un
.addr
.base
, 0);
3039 /* Given a MINUS expression, simplify it if both sides
3040 include the same symbol. */
3043 simplify_subtraction (x
)
3046 struct rtx_const val0
, val1
;
3048 decode_rtx_const (GET_MODE (x
), XEXP (x
, 0), &val0
);
3049 decode_rtx_const (GET_MODE (x
), XEXP (x
, 1), &val1
);
3051 if (val0
.kind
>= RTX_INT
3052 && val0
.kind
== val1
.kind
3053 && val0
.un
.addr
.base
== val1
.un
.addr
.base
3054 && val0
.un
.addr
.symbol
== val1
.un
.addr
.symbol
)
3055 return GEN_INT (val0
.un
.addr
.offset
- val1
.un
.addr
.offset
);
3060 /* Compute a hash code for a constant RTL expression. */
3063 const_hash_rtx (mode
, x
)
3064 enum machine_mode mode
;
3068 struct rtx_const value
;
3069 unsigned int data
[sizeof(struct rtx_const
) / sizeof (unsigned int)];
3075 decode_rtx_const (mode
, x
, &u
.value
);
3077 /* Compute hashing function */
3079 for (i
= 0; i
< ARRAY_SIZE (u
.data
); i
++)
3080 hi
= hi
* 613 + u
.data
[i
];
3082 return hi
% MAX_RTX_HASH_TABLE
;
3085 /* Compare a constant rtl object X with a constant-descriptor DESC.
3086 Return 1 if DESC describes a constant with the same value as X. */
3089 compare_constant_rtx (mode
, x
, desc
)
3090 enum machine_mode mode
;
3092 struct constant_descriptor_rtx
*desc
;
3094 struct rtx_const value
;
3096 decode_rtx_const (mode
, x
, &value
);
3098 /* Compare constant contents. */
3099 return memcmp (&value
, &desc
->value
, sizeof (struct rtx_const
)) == 0;
3102 /* Construct a constant descriptor for the rtl-expression X.
3103 It is up to the caller to enter the descriptor in the hash table. */
3105 static struct constant_descriptor_rtx
*
3106 record_constant_rtx (mode
, x
)
3107 enum machine_mode mode
;
3110 struct constant_descriptor_rtx
*ptr
;
3112 ptr
= (struct constant_descriptor_rtx
*) ggc_alloc (sizeof (*ptr
));
3113 decode_rtx_const (mode
, x
, &ptr
->value
);
3118 /* Given a constant rtx X, return a MEM for the location in memory at which
3119 this constant has been placed. Return 0 if it not has been placed yet. */
3122 mem_for_const_double (x
)
3125 enum machine_mode mode
= GET_MODE (x
);
3126 struct constant_descriptor_rtx
*desc
;
3128 for (desc
= const_rtx_hash_table
[const_hash_rtx (mode
, x
)]; desc
;
3130 if (compare_constant_rtx (mode
, x
, desc
))
3136 /* Given a constant rtx X, make (or find) a memory constant for its value
3137 and return a MEM rtx to refer to it in memory. */
3140 force_const_mem (mode
, x
)
3141 enum machine_mode mode
;
3145 struct constant_descriptor_rtx
*desc
;
3148 struct pool_constant
*pool
;
3151 /* If we're not allowed to drop X into the constant pool, don't. */
3152 if ((*targetm
.cannot_force_const_mem
) (x
))
3155 /* Compute hash code of X. Search the descriptors for that hash code
3156 to see if any of them describes X. If yes, we have an rtx to use. */
3157 hash
= const_hash_rtx (mode
, x
);
3158 for (desc
= const_rtx_hash_table
[hash
]; desc
; desc
= desc
->next
)
3159 if (compare_constant_rtx (mode
, x
, desc
))
3162 /* No constant equal to X is known to have been output.
3163 Make a constant descriptor to enter X in the hash table
3164 and make a MEM for it. */
3165 desc
= record_constant_rtx (mode
, x
);
3166 desc
->next
= const_rtx_hash_table
[hash
];
3167 const_rtx_hash_table
[hash
] = desc
;
3169 /* Align the location counter as required by EXP's data type. */
3170 align
= GET_MODE_ALIGNMENT (mode
== VOIDmode
? word_mode
: mode
);
3171 #ifdef CONSTANT_ALIGNMENT
3172 align
= CONSTANT_ALIGNMENT (make_tree ((*lang_hooks
.types
.type_for_mode
)
3173 (mode
, 0), x
), align
);
3176 pool_offset
+= (align
/ BITS_PER_UNIT
) - 1;
3177 pool_offset
&= ~ ((align
/ BITS_PER_UNIT
) - 1);
3179 if (GET_CODE (x
) == LABEL_REF
)
3180 LABEL_PRESERVE_P (XEXP (x
, 0)) = 1;
3182 /* Allocate a pool constant descriptor, fill it in, and chain it in. */
3183 pool
= (struct pool_constant
*) ggc_alloc (sizeof (struct pool_constant
));
3187 pool
->labelno
= const_labelno
;
3188 pool
->align
= align
;
3189 pool
->offset
= pool_offset
;
3196 last_pool
->next
= pool
;
3199 pool_offset
+= GET_MODE_SIZE (mode
);
3201 /* Create a string containing the label name, in LABEL. */
3202 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
3206 /* Construct the SYMBOL_REF and the MEM. */
3208 symbol
= gen_rtx_SYMBOL_REF (Pmode
, ggc_strdup (label
));
3209 SYMBOL_REF_FLAGS (symbol
) = SYMBOL_FLAG_LOCAL
;
3211 pool
->desc
->rtl
= def
= gen_rtx_MEM (mode
, symbol
);
3212 set_mem_attributes (def
, (*lang_hooks
.types
.type_for_mode
) (mode
, 0), 1);
3213 RTX_UNCHANGING_P (def
) = 1;
3215 /* Add label to symbol hash table. */
3216 hash
= SYMHASH (XSTR (symbol
, 0));
3217 pool
->next_sym
= const_rtx_sym_hash_table
[hash
];
3218 const_rtx_sym_hash_table
[hash
] = pool
;
3220 /* Mark the symbol_ref as belonging to this constants pool. */
3221 CONSTANT_POOL_ADDRESS_P (symbol
) = 1;
3222 SYMBOL_REF_FLAGS (symbol
) = SYMBOL_FLAG_LOCAL
;
3223 current_function_uses_const_pool
= 1;
3228 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
3229 the corresponding pool_constant structure. */
3231 static struct pool_constant
*
3232 find_pool_constant (f
, addr
)
3236 struct pool_constant
*pool
;
3237 const char *label
= XSTR (addr
, 0);
3239 for (pool
= f
->varasm
->x_const_rtx_sym_hash_table
[SYMHASH (label
)]; pool
;
3240 pool
= pool
->next_sym
)
3241 if (XSTR (XEXP (pool
->desc
->rtl
, 0), 0) == label
)
3247 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
3250 get_pool_constant (addr
)
3253 return (find_pool_constant (cfun
, addr
))->constant
;
3256 /* Given a constant pool SYMBOL_REF, return the corresponding constant
3257 and whether it has been output or not. */
3260 get_pool_constant_mark (addr
, pmarked
)
3264 struct pool_constant
*pool
= find_pool_constant (cfun
, addr
);
3265 *pmarked
= (pool
->mark
!= 0);
3266 return pool
->constant
;
3269 /* Likewise, but for the constant pool of a specific function. */
3272 get_pool_constant_for_function (f
, addr
)
3276 return (find_pool_constant (f
, addr
))->constant
;
3279 /* Similar, return the mode. */
3282 get_pool_mode (addr
)
3285 return (find_pool_constant (cfun
, addr
))->mode
;
3289 get_pool_mode_for_function (f
, addr
)
3293 return (find_pool_constant (f
, addr
))->mode
;
3296 /* Similar, return the offset in the constant pool. */
3299 get_pool_offset (addr
)
3302 return (find_pool_constant (cfun
, addr
))->offset
;
3305 /* Return the size of the constant pool. */
3313 /* Write all the constants in the constant pool. */
3316 output_constant_pool (fnname
, fndecl
)
3317 const char *fnname ATTRIBUTE_UNUSED
;
3318 tree fndecl ATTRIBUTE_UNUSED
;
3320 struct pool_constant
*pool
;
3324 /* It is possible for gcc to call force_const_mem and then to later
3325 discard the instructions which refer to the constant. In such a
3326 case we do not need to output the constant. */
3327 mark_constant_pool ();
3329 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3330 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3333 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3342 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3343 whose CODE_LABEL has been deleted. This can occur if a jump table
3344 is eliminated by optimization. If so, write a constant of zero
3345 instead. Note that this can also happen by turning the
3346 CODE_LABEL into a NOTE. */
3347 /* ??? This seems completely and utterly wrong. Certainly it's
3348 not true for NOTE_INSN_DELETED_LABEL, but I disbelieve proper
3349 functioning even with INSN_DELETED_P and friends. */
3352 switch (GET_CODE (x
))
3355 if (GET_CODE (XEXP (x
, 0)) != PLUS
3356 || GET_CODE (XEXP (XEXP (x
, 0), 0)) != LABEL_REF
)
3358 tmp
= XEXP (XEXP (x
, 0), 0);
3363 if (INSN_DELETED_P (tmp
)
3364 || (GET_CODE (tmp
) == NOTE
3365 && NOTE_LINE_NUMBER (tmp
) == NOTE_INSN_DELETED
))
3376 /* First switch to correct section. */
3377 (*targetm
.asm_out
.select_rtx_section
) (pool
->mode
, x
, pool
->align
);
3379 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3380 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file
, x
, pool
->mode
,
3381 pool
->align
, pool
->labelno
, done
);
3384 assemble_align (pool
->align
);
3386 /* Output the label. */
3387 (*targetm
.asm_out
.internal_label
) (asm_out_file
, "LC", pool
->labelno
);
3389 /* Output the value of the constant itself. */
3390 switch (GET_MODE_CLASS (pool
->mode
))
3393 if (GET_CODE (x
) != CONST_DOUBLE
)
3396 REAL_VALUE_FROM_CONST_DOUBLE (r
, x
);
3397 assemble_real (r
, pool
->mode
, pool
->align
);
3401 case MODE_PARTIAL_INT
:
3402 assemble_integer (x
, GET_MODE_SIZE (pool
->mode
), pool
->align
, 1);
3405 case MODE_VECTOR_FLOAT
:
3410 if (GET_CODE (x
) != CONST_VECTOR
)
3413 units
= CONST_VECTOR_NUNITS (x
);
3415 for (i
= 0; i
< units
; i
++)
3417 elt
= CONST_VECTOR_ELT (x
, i
);
3418 REAL_VALUE_FROM_CONST_DOUBLE (r
, elt
);
3419 assemble_real (r
, GET_MODE_INNER (pool
->mode
), pool
->align
);
3424 case MODE_VECTOR_INT
:
3429 if (GET_CODE (x
) != CONST_VECTOR
)
3432 units
= CONST_VECTOR_NUNITS (x
);
3434 for (i
= 0; i
< units
; i
++)
3436 elt
= CONST_VECTOR_ELT (x
, i
);
3437 assemble_integer (elt
, GET_MODE_UNIT_SIZE (pool
->mode
),
3447 /* Make sure all constants in SECTION_MERGE and not SECTION_STRINGS
3448 sections have proper size. */
3449 if (pool
->align
> GET_MODE_BITSIZE (pool
->mode
)
3450 && in_section
== in_named
3451 && get_named_section_flags (in_named_name
) & SECTION_MERGE
)
3452 assemble_align (pool
->align
);
3454 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3459 #ifdef ASM_OUTPUT_POOL_EPILOGUE
3460 ASM_OUTPUT_POOL_EPILOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3463 /* Done with this pool. */
3464 first_pool
= last_pool
= 0;
3467 /* Look through the instructions for this function, and mark all the
3468 entries in the constant pool which are actually being used.
3469 Emit used deferred strings. */
3472 mark_constant_pool ()
3476 struct pool_constant
*pool
;
3478 if (first_pool
== 0 && htab_elements (const_str_htab
) == 0)
3481 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3484 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
3486 mark_constants (PATTERN (insn
));
3488 for (link
= current_function_epilogue_delay_list
;
3490 link
= XEXP (link
, 1))
3492 insn
= XEXP (link
, 0);
3495 mark_constants (PATTERN (insn
));
3499 /* Look through appropriate parts of X, marking all entries in the
3500 constant pool which are actually being used. Entries that are only
3501 referenced by other constants are also marked as used. Emit
3502 deferred strings that are used. */
3509 const char *format_ptr
;
3514 if (GET_CODE (x
) == SYMBOL_REF
)
3516 mark_constant (&x
, NULL
);
3520 /* Insns may appear inside a SEQUENCE. Only check the patterns of
3521 insns, not any notes that may be attached. We don't want to mark
3522 a constant just because it happens to appear in a REG_EQUIV note. */
3525 mark_constants (PATTERN (x
));
3529 format_ptr
= GET_RTX_FORMAT (GET_CODE (x
));
3531 for (i
= 0; i
< GET_RTX_LENGTH (GET_CODE (x
)); i
++)
3533 switch (*format_ptr
++)
3536 mark_constants (XEXP (x
, i
));
3540 if (XVEC (x
, i
) != 0)
3544 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
3545 mark_constants (XVECEXP (x
, i
, j
));
3565 /* Given a SYMBOL_REF CURRENT_RTX, mark it and all constants it refers
3566 to as used. Emit referenced deferred strings. This function can
3567 be used with for_each_rtx to mark all SYMBOL_REFs in an rtx. */
3570 mark_constant (current_rtx
, data
)
3572 void *data ATTRIBUTE_UNUSED
;
3574 rtx x
= *current_rtx
;
3579 else if (GET_CODE (x
) == SYMBOL_REF
)
3581 if (CONSTANT_POOL_ADDRESS_P (x
))
3583 struct pool_constant
*pool
= find_pool_constant (cfun
, x
);
3584 if (pool
->mark
== 0)
3587 for_each_rtx (&(pool
->constant
), &mark_constant
, NULL
);
3592 else if (STRING_POOL_ADDRESS_P (x
))
3594 struct deferred_string
**defstr
;
3596 defstr
= (struct deferred_string
**)
3597 htab_find_slot_with_hash (const_str_htab
, XSTR (x
, 0),
3598 STRHASH (XSTR (x
, 0)), NO_INSERT
);
3601 struct deferred_string
*p
= *defstr
;
3603 STRING_POOL_ADDRESS_P (x
) = 0;
3604 output_constant_def_contents (p
->exp
, 0, p
->labelno
);
3605 htab_clear_slot (const_str_htab
, (void **) defstr
);
3612 /* Find all the constants whose addresses are referenced inside of EXP,
3613 and make sure assembler code with a label has been output for each one.
3614 Indicate whether an ADDR_EXPR has been encountered. */
3617 output_addressed_constants (exp
)
3620 int reloc
= 0, reloc2
;
3623 /* Give the front-end a chance to convert VALUE to something that
3624 looks more like a constant to the back-end. */
3625 exp
= (*lang_hooks
.expand_constant
) (exp
);
3627 switch (TREE_CODE (exp
))
3631 /* Go inside any operations that get_inner_reference can handle and see
3632 if what's inside is a constant: no need to do anything here for
3633 addresses of variables or functions. */
3634 for (tem
= TREE_OPERAND (exp
, 0); handled_component_p (tem
);
3635 tem
= TREE_OPERAND (tem
, 0))
3638 if (TREE_CODE_CLASS (TREE_CODE (tem
)) == 'c'
3639 || TREE_CODE (tem
) == CONSTRUCTOR
)
3640 output_constant_def (tem
, 0);
3642 if (TREE_PUBLIC (tem
))
3649 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
3650 reloc
|= output_addressed_constants (TREE_OPERAND (exp
, 1));
3654 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
3655 reloc2
= output_addressed_constants (TREE_OPERAND (exp
, 1));
3656 /* The difference of two local labels is computable at link time. */
3657 if (reloc
== 1 && reloc2
== 1)
3665 case NON_LVALUE_EXPR
:
3666 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
3670 for (tem
= CONSTRUCTOR_ELTS (exp
); tem
; tem
= TREE_CHAIN (tem
))
3671 if (TREE_VALUE (tem
) != 0)
3672 reloc
|= output_addressed_constants (TREE_VALUE (tem
));
3682 /* Return nonzero if VALUE is a valid constant-valued expression
3683 for use in initializing a static variable; one that can be an
3684 element of a "constant" initializer.
3686 Return null_pointer_node if the value is absolute;
3687 if it is relocatable, return the variable that determines the relocation.
3688 We assume that VALUE has been folded as much as possible;
3689 therefore, we do not need to check for such things as
3690 arithmetic-combinations of integers. */
3693 initializer_constant_valid_p (value
, endtype
)
3697 /* Give the front-end a chance to convert VALUE to something that
3698 looks more like a constant to the back-end. */
3699 value
= (*lang_hooks
.expand_constant
) (value
);
3701 switch (TREE_CODE (value
))
3704 if ((TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
3705 || TREE_CODE (TREE_TYPE (value
)) == RECORD_TYPE
)
3706 && TREE_CONSTANT (value
)
3707 && CONSTRUCTOR_ELTS (value
))
3709 initializer_constant_valid_p (TREE_VALUE (CONSTRUCTOR_ELTS (value
)),
3712 return TREE_STATIC (value
) ? null_pointer_node
: 0;
3719 return null_pointer_node
;
3723 return staticp (TREE_OPERAND (value
, 0)) ? TREE_OPERAND (value
, 0) : 0;
3725 case VIEW_CONVERT_EXPR
:
3726 case NON_LVALUE_EXPR
:
3727 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3731 /* Allow conversions between pointer types. */
3732 if (POINTER_TYPE_P (TREE_TYPE (value
))
3733 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3734 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3736 /* Allow conversions between real types. */
3737 if (FLOAT_TYPE_P (TREE_TYPE (value
))
3738 && FLOAT_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3739 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3741 /* Allow length-preserving conversions between integer types. */
3742 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
3743 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
3744 && (TYPE_PRECISION (TREE_TYPE (value
))
3745 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
3746 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3748 /* Allow conversions between other integer types only if
3750 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
3751 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3753 tree inner
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3755 if (inner
== null_pointer_node
)
3756 return null_pointer_node
;
3760 /* Allow (int) &foo provided int is as wide as a pointer. */
3761 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
3762 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
3763 && (TYPE_PRECISION (TREE_TYPE (value
))
3764 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
3765 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3768 /* Likewise conversions from int to pointers, but also allow
3769 conversions from 0. */
3770 if (POINTER_TYPE_P (TREE_TYPE (value
))
3771 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3773 if (integer_zerop (TREE_OPERAND (value
, 0)))
3774 return null_pointer_node
;
3775 else if (TYPE_PRECISION (TREE_TYPE (value
))
3776 <= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0))))
3777 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3781 /* Allow conversions to union types if the value inside is okay. */
3782 if (TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
)
3783 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3788 if (! INTEGRAL_TYPE_P (endtype
)
3789 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
3791 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3793 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
3795 /* If either term is absolute, use the other terms relocation. */
3796 if (valid0
== null_pointer_node
)
3798 if (valid1
== null_pointer_node
)
3804 if (! INTEGRAL_TYPE_P (endtype
)
3805 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
3807 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3809 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
3811 /* Win if second argument is absolute. */
3812 if (valid1
== null_pointer_node
)
3814 /* Win if both arguments have the same relocation.
3815 Then the value is absolute. */
3816 if (valid0
== valid1
&& valid0
!= 0)
3817 return null_pointer_node
;
3819 /* Since GCC guarantees that string constants are unique in the
3820 generated code, a subtraction between two copies of the same
3821 constant string is absolute. */
3822 if (valid0
&& TREE_CODE (valid0
) == STRING_CST
&&
3823 valid1
&& TREE_CODE (valid1
) == STRING_CST
&&
3824 TREE_STRING_POINTER (valid0
) == TREE_STRING_POINTER (valid1
))
3825 return null_pointer_node
;
3828 /* Support differences between labels. */
3829 if (INTEGRAL_TYPE_P (endtype
))
3832 op0
= TREE_OPERAND (value
, 0);
3833 op1
= TREE_OPERAND (value
, 1);
3835 /* Like STRIP_NOPS except allow the operand mode to widen.
3836 This works around a feature of fold that simplifies
3837 (int)(p1 - p2) to ((int)p1 - (int)p2) under the theory
3838 that the narrower operation is cheaper. */
3840 while (TREE_CODE (op0
) == NOP_EXPR
3841 || TREE_CODE (op0
) == CONVERT_EXPR
3842 || TREE_CODE (op0
) == NON_LVALUE_EXPR
)
3844 tree inner
= TREE_OPERAND (op0
, 0);
3845 if (inner
== error_mark_node
3846 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner
)))
3847 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op0
)))
3848 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner
)))))
3853 while (TREE_CODE (op1
) == NOP_EXPR
3854 || TREE_CODE (op1
) == CONVERT_EXPR
3855 || TREE_CODE (op1
) == NON_LVALUE_EXPR
)
3857 tree inner
= TREE_OPERAND (op1
, 0);
3858 if (inner
== error_mark_node
3859 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner
)))
3860 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op1
)))
3861 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner
)))))
3866 if (TREE_CODE (op0
) == ADDR_EXPR
3867 && TREE_CODE (TREE_OPERAND (op0
, 0)) == LABEL_DECL
3868 && TREE_CODE (op1
) == ADDR_EXPR
3869 && TREE_CODE (TREE_OPERAND (op1
, 0)) == LABEL_DECL
)
3870 return null_pointer_node
;
3881 /* Output assembler code for constant EXP to FILE, with no label.
3882 This includes the pseudo-op such as ".int" or ".byte", and a newline.
3883 Assumes output_addressed_constants has been done on EXP already.
3885 Generate exactly SIZE bytes of assembler data, padding at the end
3886 with zeros if necessary. SIZE must always be specified.
3888 SIZE is important for structure constructors,
3889 since trailing members may have been omitted from the constructor.
3890 It is also important for initialization of arrays from string constants
3891 since the full length of the string constant might not be wanted.
3892 It is also needed for initialization of unions, where the initializer's
3893 type is just one member, and that may not be as long as the union.
3895 There a case in which we would fail to output exactly SIZE bytes:
3896 for a structure constructor that wants to produce more than SIZE bytes.
3897 But such constructors will never be generated for any possible input.
3899 ALIGN is the alignment of the data in bits. */
3902 output_constant (exp
, size
, align
)
3907 enum tree_code code
;
3908 HOST_WIDE_INT thissize
;
3910 /* Some front-ends use constants other than the standard language-independent
3911 varieties, but which may still be output directly. Give the front-end a
3912 chance to convert EXP to a language-independent representation. */
3913 exp
= (*lang_hooks
.expand_constant
) (exp
);
3915 if (size
== 0 || flag_syntax_only
)
3918 /* Eliminate any conversions since we'll be outputting the underlying
3920 while (TREE_CODE (exp
) == NOP_EXPR
|| TREE_CODE (exp
) == CONVERT_EXPR
3921 || TREE_CODE (exp
) == NON_LVALUE_EXPR
3922 || TREE_CODE (exp
) == VIEW_CONVERT_EXPR
)
3923 exp
= TREE_OPERAND (exp
, 0);
3925 code
= TREE_CODE (TREE_TYPE (exp
));
3926 thissize
= int_size_in_bytes (TREE_TYPE (exp
));
3928 /* Allow a constructor with no elements for any data type.
3929 This means to fill the space with zeros. */
3930 if (TREE_CODE (exp
) == CONSTRUCTOR
&& CONSTRUCTOR_ELTS (exp
) == 0)
3932 assemble_zeros (size
);
3936 if (TREE_CODE (exp
) == FDESC_EXPR
)
3938 #ifdef ASM_OUTPUT_FDESC
3939 HOST_WIDE_INT part
= tree_low_cst (TREE_OPERAND (exp
, 1), 0);
3940 tree decl
= TREE_OPERAND (exp
, 0);
3941 ASM_OUTPUT_FDESC (asm_out_file
, decl
, part
);
3948 /* Now output the underlying data. If we've handling the padding, return.
3949 Otherwise, break and ensure THISSIZE is the size written. */
3957 case REFERENCE_TYPE
:
3958 if (! assemble_integer (expand_expr (exp
, NULL_RTX
, VOIDmode
,
3959 EXPAND_INITIALIZER
),
3961 error ("initializer for integer value is too complicated");
3965 if (TREE_CODE (exp
) != REAL_CST
)
3966 error ("initializer for floating value is not a floating constant");
3968 assemble_real (TREE_REAL_CST (exp
),
3969 mode_for_size (size
* BITS_PER_UNIT
, MODE_FLOAT
, 0),
3974 output_constant (TREE_REALPART (exp
), thissize
/ 2, align
);
3975 output_constant (TREE_IMAGPART (exp
), thissize
/ 2,
3976 min_align (align
, BITS_PER_UNIT
* (thissize
/ 2)));
3981 if (TREE_CODE (exp
) == CONSTRUCTOR
)
3983 output_constructor (exp
, size
, align
);
3986 else if (TREE_CODE (exp
) == STRING_CST
)
3988 thissize
= MIN (TREE_STRING_LENGTH (exp
), size
);
3989 assemble_string (TREE_STRING_POINTER (exp
), thissize
);
3991 else if (TREE_CODE (exp
) == VECTOR_CST
)
3995 unsigned int nalign
;
3996 enum machine_mode inner
;
3998 inner
= GET_MODE_INNER (TYPE_MODE (TREE_TYPE (exp
)));
3999 nalign
= MIN (align
, GET_MODE_ALIGNMENT (inner
));
4001 elt_size
= GET_MODE_UNIT_SIZE (TYPE_MODE (TREE_TYPE (exp
)));
4003 link
= TREE_VECTOR_CST_ELTS (exp
);
4004 output_constant (TREE_VALUE (link
), elt_size
, align
);
4005 while ((link
= TREE_CHAIN (link
)) != NULL
)
4006 output_constant (TREE_VALUE (link
), elt_size
, nalign
);
4014 if (TREE_CODE (exp
) == CONSTRUCTOR
)
4015 output_constructor (exp
, size
, align
);
4021 if (TREE_CODE (exp
) == INTEGER_CST
)
4022 assemble_integer (expand_expr (exp
, NULL_RTX
,
4023 VOIDmode
, EXPAND_INITIALIZER
),
4024 thissize
, align
, 1);
4025 else if (TREE_CODE (exp
) == CONSTRUCTOR
)
4027 unsigned char *buffer
= (unsigned char *) alloca (thissize
);
4028 if (get_set_constructor_bytes (exp
, buffer
, thissize
))
4030 assemble_string ((char *) buffer
, thissize
);
4033 error ("unknown set constructor type");
4045 assemble_zeros (size
);
4049 /* Subroutine of output_constructor, used for computing the size of
4050 arrays of unspecified length. VAL must be a CONSTRUCTOR of an array
4051 type with an unspecified upper bound. */
4053 static unsigned HOST_WIDE_INT
4054 array_size_for_constructor (val
)
4059 /* This code used to attempt to handle string constants that are not
4060 arrays of single-bytes, but nothing else does, so there's no point in
4062 if (TREE_CODE (val
) == STRING_CST
)
4063 return TREE_STRING_LENGTH (val
);
4065 max_index
= NULL_TREE
;
4066 for (i
= CONSTRUCTOR_ELTS (val
); i
; i
= TREE_CHAIN (i
))
4068 tree index
= TREE_PURPOSE (i
);
4070 if (TREE_CODE (index
) == RANGE_EXPR
)
4071 index
= TREE_OPERAND (index
, 1);
4072 if (max_index
== NULL_TREE
|| tree_int_cst_lt (max_index
, index
))
4076 if (max_index
== NULL_TREE
)
4079 /* Compute the total number of array elements. */
4080 i
= size_binop (MINUS_EXPR
, convert (sizetype
, max_index
),
4082 TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (val
)))));
4083 i
= size_binop (PLUS_EXPR
, i
, convert (sizetype
, integer_one_node
));
4085 /* Multiply by the array element unit size to find number of bytes. */
4086 i
= size_binop (MULT_EXPR
, i
, TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (val
))));
4088 return tree_low_cst (i
, 1);
4091 /* Subroutine of output_constant, used for CONSTRUCTORs (aggregate constants).
4092 Generate at least SIZE bytes, padding if necessary. */
4095 output_constructor (exp
, size
, align
)
4100 tree type
= TREE_TYPE (exp
);
4101 tree link
, field
= 0;
4103 /* Number of bytes output or skipped so far.
4104 In other words, current position within the constructor. */
4105 HOST_WIDE_INT total_bytes
= 0;
4106 /* Nonzero means BYTE contains part of a byte, to be output. */
4107 int byte_buffer_in_use
= 0;
4110 if (HOST_BITS_PER_WIDE_INT
< BITS_PER_UNIT
)
4113 if (TREE_CODE (type
) == RECORD_TYPE
)
4114 field
= TYPE_FIELDS (type
);
4116 if (TREE_CODE (type
) == ARRAY_TYPE
4117 && TYPE_DOMAIN (type
) != 0)
4118 min_index
= TYPE_MIN_VALUE (TYPE_DOMAIN (type
));
4120 /* As LINK goes through the elements of the constant,
4121 FIELD goes through the structure fields, if the constant is a structure.
4122 if the constant is a union, then we override this,
4123 by getting the field from the TREE_LIST element.
4124 But the constant could also be an array. Then FIELD is zero.
4126 There is always a maximum of one element in the chain LINK for unions
4127 (even if the initializer in a source program incorrectly contains
4129 for (link
= CONSTRUCTOR_ELTS (exp
);
4131 link
= TREE_CHAIN (link
),
4132 field
= field
? TREE_CHAIN (field
) : 0)
4134 tree val
= TREE_VALUE (link
);
4137 /* The element in a union constructor specifies the proper field
4139 if ((TREE_CODE (type
) == RECORD_TYPE
|| TREE_CODE (type
) == UNION_TYPE
4140 || TREE_CODE (type
) == QUAL_UNION_TYPE
)
4141 && TREE_PURPOSE (link
) != 0)
4142 field
= TREE_PURPOSE (link
);
4144 else if (TREE_CODE (type
) == ARRAY_TYPE
)
4145 index
= TREE_PURPOSE (link
);
4147 /* Eliminate the marker that makes a cast not be an lvalue. */
4151 if (index
&& TREE_CODE (index
) == RANGE_EXPR
)
4153 unsigned HOST_WIDE_INT fieldsize
4154 = int_size_in_bytes (TREE_TYPE (type
));
4155 HOST_WIDE_INT lo_index
= tree_low_cst (TREE_OPERAND (index
, 0), 0);
4156 HOST_WIDE_INT hi_index
= tree_low_cst (TREE_OPERAND (index
, 1), 0);
4157 HOST_WIDE_INT index
;
4158 unsigned int align2
= min_align (align
, fieldsize
* BITS_PER_UNIT
);
4160 for (index
= lo_index
; index
<= hi_index
; index
++)
4162 /* Output the element's initial value. */
4164 assemble_zeros (fieldsize
);
4166 output_constant (val
, fieldsize
, align2
);
4168 /* Count its size. */
4169 total_bytes
+= fieldsize
;
4172 else if (field
== 0 || !DECL_BIT_FIELD (field
))
4174 /* An element that is not a bit-field. */
4176 unsigned HOST_WIDE_INT fieldsize
;
4177 /* Since this structure is static,
4178 we know the positions are constant. */
4179 HOST_WIDE_INT pos
= field
? int_byte_position (field
) : 0;
4180 unsigned int align2
;
4183 pos
= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (val
)), 1)
4184 * (tree_low_cst (index
, 0) - tree_low_cst (min_index
, 0)));
4186 /* Output any buffered-up bit-fields preceding this element. */
4187 if (byte_buffer_in_use
)
4189 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4191 byte_buffer_in_use
= 0;
4194 /* Advance to offset of this element.
4195 Note no alignment needed in an array, since that is guaranteed
4196 if each element has the proper size. */
4197 if ((field
!= 0 || index
!= 0) && pos
!= total_bytes
)
4199 assemble_zeros (pos
- total_bytes
);
4203 /* Find the alignment of this element. */
4204 align2
= min_align (align
, BITS_PER_UNIT
* pos
);
4206 /* Determine size this element should occupy. */
4211 /* If this is an array with an unspecified upper bound,
4212 the initializer determines the size. */
4213 /* ??? This ought to only checked if DECL_SIZE_UNIT is NULL,
4214 but we cannot do this until the deprecated support for
4215 initializing zero-length array members is removed. */
4216 if (TREE_CODE (TREE_TYPE (field
)) == ARRAY_TYPE
4217 && TYPE_DOMAIN (TREE_TYPE (field
))
4218 && ! TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (field
))))
4220 fieldsize
= array_size_for_constructor (val
);
4221 /* Given a non-empty initialization, this field had
4223 if (fieldsize
!= 0 && TREE_CHAIN (field
) != NULL_TREE
)
4226 else if (DECL_SIZE_UNIT (field
))
4228 /* ??? This can't be right. If the decl size overflows
4229 a host integer we will silently emit no data. */
4230 if (host_integerp (DECL_SIZE_UNIT (field
), 1))
4231 fieldsize
= tree_low_cst (DECL_SIZE_UNIT (field
), 1);
4235 fieldsize
= int_size_in_bytes (TREE_TYPE (type
));
4237 /* Output the element's initial value. */
4239 assemble_zeros (fieldsize
);
4241 output_constant (val
, fieldsize
, align2
);
4243 /* Count its size. */
4244 total_bytes
+= fieldsize
;
4246 else if (val
!= 0 && TREE_CODE (val
) != INTEGER_CST
)
4247 error ("invalid initial value for member `%s'",
4248 IDENTIFIER_POINTER (DECL_NAME (field
)));
4251 /* Element that is a bit-field. */
4253 HOST_WIDE_INT next_offset
= int_bit_position (field
);
4254 HOST_WIDE_INT end_offset
4255 = (next_offset
+ tree_low_cst (DECL_SIZE (field
), 1));
4258 val
= integer_zero_node
;
4260 /* If this field does not start in this (or, next) byte,
4262 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4264 /* Output remnant of any bit field in previous bytes. */
4265 if (byte_buffer_in_use
)
4267 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4269 byte_buffer_in_use
= 0;
4272 /* If still not at proper byte, advance to there. */
4273 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4275 assemble_zeros (next_offset
/ BITS_PER_UNIT
- total_bytes
);
4276 total_bytes
= next_offset
/ BITS_PER_UNIT
;
4280 if (! byte_buffer_in_use
)
4283 /* We must split the element into pieces that fall within
4284 separate bytes, and combine each byte with previous or
4285 following bit-fields. */
4287 /* next_offset is the offset n fbits from the beginning of
4288 the structure to the next bit of this element to be processed.
4289 end_offset is the offset of the first bit past the end of
4291 while (next_offset
< end_offset
)
4295 HOST_WIDE_INT value
;
4296 HOST_WIDE_INT next_byte
= next_offset
/ BITS_PER_UNIT
;
4297 HOST_WIDE_INT next_bit
= next_offset
% BITS_PER_UNIT
;
4299 /* Advance from byte to byte
4300 within this element when necessary. */
4301 while (next_byte
!= total_bytes
)
4303 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4308 /* Number of bits we can process at once
4309 (all part of the same byte). */
4310 this_time
= MIN (end_offset
- next_offset
,
4311 BITS_PER_UNIT
- next_bit
);
4312 if (BYTES_BIG_ENDIAN
)
4314 /* On big-endian machine, take the most significant bits
4315 first (of the bits that are significant)
4316 and put them into bytes from the most significant end. */
4317 shift
= end_offset
- next_offset
- this_time
;
4319 /* Don't try to take a bunch of bits that cross
4320 the word boundary in the INTEGER_CST. We can
4321 only select bits from the LOW or HIGH part
4323 if (shift
< HOST_BITS_PER_WIDE_INT
4324 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4326 this_time
= shift
+ this_time
- HOST_BITS_PER_WIDE_INT
;
4327 shift
= HOST_BITS_PER_WIDE_INT
;
4330 /* Now get the bits from the appropriate constant word. */
4331 if (shift
< HOST_BITS_PER_WIDE_INT
)
4332 value
= TREE_INT_CST_LOW (val
);
4333 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4335 value
= TREE_INT_CST_HIGH (val
);
4336 shift
-= HOST_BITS_PER_WIDE_INT
;
4341 /* Get the result. This works only when:
4342 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4343 byte
|= (((value
>> shift
)
4344 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4345 << (BITS_PER_UNIT
- this_time
- next_bit
));
4349 /* On little-endian machines,
4350 take first the least significant bits of the value
4351 and pack them starting at the least significant
4352 bits of the bytes. */
4353 shift
= next_offset
- int_bit_position (field
);
4355 /* Don't try to take a bunch of bits that cross
4356 the word boundary in the INTEGER_CST. We can
4357 only select bits from the LOW or HIGH part
4359 if (shift
< HOST_BITS_PER_WIDE_INT
4360 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4361 this_time
= (HOST_BITS_PER_WIDE_INT
- shift
);
4363 /* Now get the bits from the appropriate constant word. */
4364 if (shift
< HOST_BITS_PER_WIDE_INT
)
4365 value
= TREE_INT_CST_LOW (val
);
4366 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4368 value
= TREE_INT_CST_HIGH (val
);
4369 shift
-= HOST_BITS_PER_WIDE_INT
;
4374 /* Get the result. This works only when:
4375 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4376 byte
|= (((value
>> shift
)
4377 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4381 next_offset
+= this_time
;
4382 byte_buffer_in_use
= 1;
4387 if (byte_buffer_in_use
)
4389 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4393 if (total_bytes
< size
)
4394 assemble_zeros (size
- total_bytes
);
4397 /* This TREE_LIST contains any weak symbol declarations waiting
4399 static GTY(()) tree weak_decls
;
4401 /* Mark DECL as weak. */
4407 DECL_WEAK (decl
) = 1;
4409 if (DECL_RTL_SET_P (decl
)
4410 && GET_CODE (DECL_RTL (decl
)) == MEM
4411 && XEXP (DECL_RTL (decl
), 0)
4412 && GET_CODE (XEXP (DECL_RTL (decl
), 0)) == SYMBOL_REF
)
4413 SYMBOL_REF_WEAK (XEXP (DECL_RTL (decl
), 0)) = 1;
4416 /* Merge weak status between NEWDECL and OLDDECL. */
4419 merge_weak (newdecl
, olddecl
)
4423 if (DECL_WEAK (newdecl
) == DECL_WEAK (olddecl
))
4426 if (DECL_WEAK (newdecl
))
4430 /* NEWDECL is weak, but OLDDECL is not. */
4432 /* If we already output the OLDDECL, we're in trouble; we can't
4433 go back and make it weak. This error cannot caught in
4434 declare_weak because the NEWDECL and OLDDECL was not yet
4435 been merged; therefore, TREE_ASM_WRITTEN was not set. */
4436 if (TREE_ASM_WRITTEN (olddecl
))
4437 error_with_decl (newdecl
,
4438 "weak declaration of `%s' must precede definition");
4440 /* If we've already generated rtl referencing OLDDECL, we may
4441 have done so in a way that will not function properly with
4443 else if (TREE_USED (olddecl
)
4444 && TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (olddecl
)))
4445 warning_with_decl (newdecl
, "weak declaration of `%s' after first use results in unspecified behavior");
4449 /* We put the NEWDECL on the weak_decls list at some point.
4450 Replace it with the OLDDECL. */
4451 for (wd
= weak_decls
; wd
; wd
= TREE_CHAIN (wd
))
4452 if (TREE_VALUE (wd
) == newdecl
)
4454 TREE_VALUE (wd
) = olddecl
;
4457 /* We may not find the entry on the list. If NEWDECL is a
4458 weak alias, then we will have already called
4459 globalize_decl to remove the entry; in that case, we do
4460 not need to do anything. */
4463 /* Make the OLDDECL weak; it's OLDDECL that we'll be keeping. */
4464 mark_weak (olddecl
);
4467 /* OLDDECL was weak, but NEWDECL was not explicitly marked as
4468 weak. Just update NEWDECL to indicate that it's weak too. */
4469 mark_weak (newdecl
);
4472 /* Declare DECL to be a weak symbol. */
4478 if (! TREE_PUBLIC (decl
))
4479 error_with_decl (decl
, "weak declaration of `%s' must be public");
4480 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& TREE_ASM_WRITTEN (decl
))
4481 error_with_decl (decl
, "weak declaration of `%s' must precede definition");
4482 else if (SUPPORTS_WEAK
)
4484 if (! DECL_WEAK (decl
))
4485 weak_decls
= tree_cons (NULL
, decl
, weak_decls
);
4488 warning_with_decl (decl
, "weak declaration of `%s' not supported");
4493 /* Emit any pending weak declarations. */
4500 for (t
= weak_decls
; t
; t
= TREE_CHAIN (t
))
4502 tree decl
= TREE_VALUE (t
);
4503 #if defined (ASM_WEAKEN_DECL) || defined (ASM_WEAKEN_LABEL)
4504 const char *const name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
4507 if (! TREE_USED (decl
))
4510 #ifdef ASM_WEAKEN_DECL
4511 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, NULL
);
4513 #ifdef ASM_WEAKEN_LABEL
4514 ASM_WEAKEN_LABEL (asm_out_file
, name
);
4516 #ifdef ASM_OUTPUT_WEAK_ALIAS
4517 warning ("only weak aliases are supported in this configuration");
4525 /* Emit the assembly bits to indicate that DECL is globally visible. */
4528 globalize_decl (decl
)
4531 const char *name
= XSTR (XEXP (DECL_RTL (decl
), 0), 0);
4533 #if defined (ASM_WEAKEN_LABEL) || defined (ASM_WEAKEN_DECL)
4534 if (DECL_WEAK (decl
))
4538 #ifdef ASM_WEAKEN_DECL
4539 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, 0);
4541 ASM_WEAKEN_LABEL (asm_out_file
, name
);
4544 /* Remove this function from the pending weak list so that
4545 we do not emit multiple .weak directives for it. */
4546 for (p
= &weak_decls
; (t
= *p
) ; )
4548 if (DECL_ASSEMBLER_NAME (decl
) == DECL_ASSEMBLER_NAME (TREE_VALUE (t
)))
4549 *p
= TREE_CHAIN (t
);
4551 p
= &TREE_CHAIN (t
);
4557 (*targetm
.asm_out
.globalize_label
) (asm_out_file
, name
);
4560 /* Emit an assembler directive to make the symbol for DECL an alias to
4561 the symbol for TARGET. */
4564 assemble_alias (decl
, target
)
4565 tree decl
, target ATTRIBUTE_UNUSED
;
4569 /* We must force creation of DECL_RTL for debug info generation, even though
4570 we don't use it here. */
4571 make_decl_rtl (decl
, NULL
);
4573 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
4575 #ifdef ASM_OUTPUT_DEF
4576 /* Make name accessible from other files, if appropriate. */
4578 if (TREE_PUBLIC (decl
))
4580 globalize_decl (decl
);
4581 maybe_assemble_visibility (decl
);
4584 #ifdef ASM_OUTPUT_DEF_FROM_DECLS
4585 ASM_OUTPUT_DEF_FROM_DECLS (asm_out_file
, decl
, target
);
4587 ASM_OUTPUT_DEF (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4589 #else /* !ASM_OUTPUT_DEF */
4590 #if defined (ASM_OUTPUT_WEAK_ALIAS) || defined (ASM_WEAKEN_DECL)
4591 if (! DECL_WEAK (decl
))
4592 warning ("only weak aliases are supported in this configuration");
4594 #ifdef ASM_WEAKEN_DECL
4595 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, IDENTIFIER_POINTER (target
));
4597 ASM_OUTPUT_WEAK_ALIAS (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4600 warning ("alias definitions not supported in this configuration; ignored");
4604 TREE_USED (decl
) = 1;
4605 TREE_ASM_WRITTEN (decl
) = 1;
4606 TREE_ASM_WRITTEN (DECL_ASSEMBLER_NAME (decl
)) = 1;
4609 /* Emit an assembler directive to set symbol for DECL visibility to
4610 the visibility type VIS, which must not be VISIBILITY_DEFAULT. */
4613 default_assemble_visibility (decl
, vis
)
4617 static const char * const visibility_types
[] = {
4618 NULL
, "internal", "hidden", "protected"
4621 const char *name
, *type
;
4623 name
= (* targetm
.strip_name_encoding
)
4624 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
4625 type
= visibility_types
[vis
];
4627 #ifdef HAVE_GAS_HIDDEN
4628 fprintf (asm_out_file
, "\t.%s\t%s\n", type
, name
);
4630 warning ("visibility attribute not supported in this configuration; ignored");
4634 /* A helper function to call assemble_visibility when needed for a decl. */
4637 maybe_assemble_visibility (decl
)
4640 enum symbol_visibility vis
= decl_visibility (decl
);
4642 if (vis
!= VISIBILITY_DEFAULT
)
4643 (* targetm
.asm_out
.visibility
) (decl
, vis
);
4646 /* Returns 1 if the target configuration supports defining public symbols
4647 so that one of them will be chosen at link time instead of generating a
4648 multiply-defined symbol error, whether through the use of weak symbols or
4649 a target-specific mechanism for having duplicates discarded. */
4652 supports_one_only ()
4654 if (SUPPORTS_ONE_ONLY
)
4656 return SUPPORTS_WEAK
;
4659 /* Set up DECL as a public symbol that can be defined in multiple
4660 translation units without generating a linker error. */
4663 make_decl_one_only (decl
)
4666 if (TREE_CODE (decl
) != VAR_DECL
&& TREE_CODE (decl
) != FUNCTION_DECL
)
4669 TREE_PUBLIC (decl
) = 1;
4671 if (TREE_CODE (decl
) == VAR_DECL
4672 && (DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
))
4673 DECL_COMMON (decl
) = 1;
4674 else if (SUPPORTS_ONE_ONLY
)
4676 #ifdef MAKE_DECL_ONE_ONLY
4677 MAKE_DECL_ONE_ONLY (decl
);
4679 DECL_ONE_ONLY (decl
) = 1;
4681 else if (SUPPORTS_WEAK
)
4682 DECL_WEAK (decl
) = 1;
4690 const_str_htab
= htab_create_ggc (128, const_str_htab_hash
,
4691 const_str_htab_eq
, NULL
);
4692 in_named_htab
= htab_create_ggc (31, in_named_entry_hash
,
4693 in_named_entry_eq
, NULL
);
4695 const_alias_set
= new_alias_set ();
4699 decl_tls_model (decl
)
4702 enum tls_model kind
;
4703 tree attr
= lookup_attribute ("tls_model", DECL_ATTRIBUTES (decl
));
4708 attr
= TREE_VALUE (TREE_VALUE (attr
));
4709 if (TREE_CODE (attr
) != STRING_CST
)
4711 if (!strcmp (TREE_STRING_POINTER (attr
), "local-exec"))
4712 kind
= TLS_MODEL_LOCAL_EXEC
;
4713 else if (!strcmp (TREE_STRING_POINTER (attr
), "initial-exec"))
4714 kind
= TLS_MODEL_INITIAL_EXEC
;
4715 else if (!strcmp (TREE_STRING_POINTER (attr
), "local-dynamic"))
4716 kind
= optimize
? TLS_MODEL_LOCAL_DYNAMIC
: TLS_MODEL_GLOBAL_DYNAMIC
;
4717 else if (!strcmp (TREE_STRING_POINTER (attr
), "global-dynamic"))
4718 kind
= TLS_MODEL_GLOBAL_DYNAMIC
;
4724 is_local
= (*targetm
.binds_local_p
) (decl
);
4728 kind
= TLS_MODEL_LOCAL_EXEC
;
4730 kind
= TLS_MODEL_INITIAL_EXEC
;
4732 /* Local dynamic is inefficient when we're not combining the
4733 parts of the address. */
4734 else if (optimize
&& is_local
)
4735 kind
= TLS_MODEL_LOCAL_DYNAMIC
;
4737 kind
= TLS_MODEL_GLOBAL_DYNAMIC
;
4738 if (kind
< flag_tls_default
)
4739 kind
= flag_tls_default
;
4744 enum symbol_visibility
4745 decl_visibility (decl
)
4748 tree attr
= lookup_attribute ("visibility", DECL_ATTRIBUTES (decl
));
4752 const char *which
= TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr
)));
4754 if (strcmp (which
, "default") == 0)
4755 return VISIBILITY_DEFAULT
;
4756 if (strcmp (which
, "internal") == 0)
4757 return VISIBILITY_INTERNAL
;
4758 if (strcmp (which
, "hidden") == 0)
4759 return VISIBILITY_HIDDEN
;
4760 if (strcmp (which
, "protected") == 0)
4761 return VISIBILITY_PROTECTED
;
4766 return VISIBILITY_DEFAULT
;
4769 /* Select a set of attributes for section NAME based on the properties
4770 of DECL and whether or not RELOC indicates that DECL's initializer
4771 might contain runtime relocations.
4773 We make the section read-only and executable for a function decl,
4774 read-only for a const data decl, and writable for a non-const data decl. */
4777 default_section_type_flags (decl
, name
, reloc
)
4782 return default_section_type_flags_1 (decl
, name
, reloc
, flag_pic
);
4786 default_section_type_flags_1 (decl
, name
, reloc
, shlib
)
4794 if (decl
&& TREE_CODE (decl
) == FUNCTION_DECL
)
4795 flags
= SECTION_CODE
;
4796 else if (decl
&& decl_readonly_section_1 (decl
, reloc
, shlib
))
4799 flags
= SECTION_WRITE
;
4801 if (decl
&& DECL_ONE_ONLY (decl
))
4802 flags
|= SECTION_LINKONCE
;
4804 if (decl
&& TREE_CODE (decl
) == VAR_DECL
&& DECL_THREAD_LOCAL (decl
))
4805 flags
|= SECTION_TLS
| SECTION_WRITE
;
4807 if (strcmp (name
, ".bss") == 0
4808 || strncmp (name
, ".bss.", 5) == 0
4809 || strncmp (name
, ".gnu.linkonce.b.", 16) == 0
4810 || strcmp (name
, ".sbss") == 0
4811 || strncmp (name
, ".sbss.", 6) == 0
4812 || strncmp (name
, ".gnu.linkonce.sb.", 17) == 0
4813 || strcmp (name
, ".tbss") == 0
4814 || strncmp (name
, ".gnu.linkonce.tb.", 17) == 0)
4815 flags
|= SECTION_BSS
;
4817 if (strcmp (name
, ".tdata") == 0
4818 || strcmp (name
, ".tbss") == 0
4819 || strncmp (name
, ".gnu.linkonce.td.", 17) == 0
4820 || strncmp (name
, ".gnu.linkonce.tb.", 17) == 0)
4821 flags
|= SECTION_TLS
;
4823 /* These three sections have special ELF types. They are neither
4824 SHT_PROGBITS nor SHT_NOBITS, so when changing sections we don't
4825 want to print a section type (@progbits or @nobits). If someone
4826 is silly enough to emit code or TLS variables to one of these
4827 sections, then don't handle them specially. */
4828 if (!(flags
& (SECTION_CODE
| SECTION_BSS
| SECTION_TLS
))
4829 && (strcmp (name
, ".init_array") == 0
4830 || strcmp (name
, ".fini_array") == 0
4831 || strcmp (name
, ".preinit_array") == 0))
4832 flags
|= SECTION_NOTYPE
;
4837 /* Output assembly to switch to section NAME with attribute FLAGS.
4838 Four variants for common object file formats. */
4841 default_no_named_section (name
, flags
)
4842 const char *name ATTRIBUTE_UNUSED
;
4843 unsigned int flags ATTRIBUTE_UNUSED
;
4845 /* Some object formats don't support named sections at all. The
4846 front-end should already have flagged this as an error. */
4851 default_elf_asm_named_section (name
, flags
)
4855 char flagchars
[10], *f
= flagchars
;
4857 if (! named_section_first_declaration (name
))
4859 fprintf (asm_out_file
, "\t.section\t%s\n", name
);
4863 if (!(flags
& SECTION_DEBUG
))
4865 if (flags
& SECTION_WRITE
)
4867 if (flags
& SECTION_CODE
)
4869 if (flags
& SECTION_SMALL
)
4871 if (flags
& SECTION_MERGE
)
4873 if (flags
& SECTION_STRINGS
)
4875 if (flags
& SECTION_TLS
)
4879 fprintf (asm_out_file
, "\t.section\t%s,\"%s\"", name
, flagchars
);
4881 if (!(flags
& SECTION_NOTYPE
))
4885 if (flags
& SECTION_BSS
)
4890 fprintf (asm_out_file
, ",@%s", type
);
4892 if (flags
& SECTION_ENTSIZE
)
4893 fprintf (asm_out_file
, ",%d", flags
& SECTION_ENTSIZE
);
4896 putc ('\n', asm_out_file
);
4900 default_coff_asm_named_section (name
, flags
)
4904 char flagchars
[8], *f
= flagchars
;
4906 if (flags
& SECTION_WRITE
)
4908 if (flags
& SECTION_CODE
)
4912 fprintf (asm_out_file
, "\t.section\t%s,\"%s\"\n", name
, flagchars
);
4916 default_pe_asm_named_section (name
, flags
)
4920 default_coff_asm_named_section (name
, flags
);
4922 if (flags
& SECTION_LINKONCE
)
4924 /* Functions may have been compiled at various levels of
4925 optimization so we can't use `same_size' here.
4926 Instead, have the linker pick one. */
4927 fprintf (asm_out_file
, "\t.linkonce %s\n",
4928 (flags
& SECTION_CODE
? "discard" : "same_size"));
4932 /* Used for vtable gc in GNU binutils. Record that the pointer at OFFSET
4933 from SYMBOL is used in all classes derived from SYMBOL. */
4936 assemble_vtable_entry (symbol
, offset
)
4938 HOST_WIDE_INT offset
;
4940 fputs ("\t.vtable_entry ", asm_out_file
);
4941 output_addr_const (asm_out_file
, symbol
);
4942 fputs (", ", asm_out_file
);
4943 fprintf (asm_out_file
, HOST_WIDE_INT_PRINT_DEC
, offset
);
4944 fputc ('\n', asm_out_file
);
4947 /* Used for vtable gc in GNU binutils. Record the class hierarchy by noting
4948 that the vtable symbol CHILD is derived from the vtable symbol PARENT. */
4951 assemble_vtable_inherit (child
, parent
)
4954 fputs ("\t.vtable_inherit ", asm_out_file
);
4955 output_addr_const (asm_out_file
, child
);
4956 fputs (", ", asm_out_file
);
4957 output_addr_const (asm_out_file
, parent
);
4958 fputc ('\n', asm_out_file
);
4961 /* The lame default section selector. */
4964 default_select_section (decl
, reloc
, align
)
4967 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
;
4969 bool readonly
= false;
4973 if (decl_readonly_section (decl
, reloc
))
4976 else if (TREE_CODE (decl
) == CONSTRUCTOR
)
4978 if (! ((flag_pic
&& reloc
)
4979 || !TREE_READONLY (decl
)
4980 || TREE_SIDE_EFFECTS (decl
)
4981 || !TREE_CONSTANT (decl
)))
4984 else if (TREE_CODE (decl
) == STRING_CST
)
4985 readonly
= !flag_writable_strings
;
4986 else if (! (flag_pic
&& reloc
))
4990 readonly_data_section ();
4995 /* A helper function for default_elf_select_section and
4996 default_elf_unique_section. Categorizes the DECL. */
4998 enum section_category
5003 SECCAT_RODATA_MERGE_STR
,
5004 SECCAT_RODATA_MERGE_STR_INIT
,
5005 SECCAT_RODATA_MERGE_CONST
,
5010 /* To optimize loading of shared programs, define following subsections
5012 _REL Contains data that has relocations, so they get grouped
5013 together and dynamic linker will visit fewer pages in memory.
5014 _RO Contains data that is otherwise read-only. This is useful
5015 with prelinking as most relocations won't be dynamically
5016 linked and thus stay read only.
5017 _LOCAL Marks data containing relocations only to local objects.
5018 These relocations will get fully resolved by prelinking. */
5020 SECCAT_DATA_REL_LOCAL
,
5022 SECCAT_DATA_REL_RO_LOCAL
,
5032 static enum section_category
5033 categorize_decl_for_section
PARAMS ((tree
, int, int));
5035 static enum section_category
5036 categorize_decl_for_section (decl
, reloc
, shlib
)
5041 enum section_category ret
;
5043 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5045 else if (TREE_CODE (decl
) == STRING_CST
)
5047 if (flag_writable_strings
)
5050 return SECCAT_RODATA_MERGE_STR
;
5052 else if (TREE_CODE (decl
) == VAR_DECL
)
5054 if (DECL_INITIAL (decl
) == NULL
5055 || DECL_INITIAL (decl
) == error_mark_node
)
5057 else if (! TREE_READONLY (decl
)
5058 || TREE_SIDE_EFFECTS (decl
)
5059 || ! TREE_CONSTANT (DECL_INITIAL (decl
)))
5061 if (shlib
&& (reloc
& 2))
5062 ret
= SECCAT_DATA_REL
;
5063 else if (shlib
&& reloc
)
5064 ret
= SECCAT_DATA_REL_LOCAL
;
5068 else if (shlib
&& (reloc
& 2))
5069 ret
= SECCAT_DATA_REL_RO
;
5070 else if (shlib
&& reloc
)
5071 ret
= SECCAT_DATA_REL_RO_LOCAL
;
5072 else if (reloc
|| flag_merge_constants
< 2)
5073 /* C and C++ don't allow different variables to share the same
5074 location. -fmerge-all-constants allows even that (at the
5075 expense of not conforming). */
5076 ret
= SECCAT_RODATA
;
5077 else if (TREE_CODE (DECL_INITIAL (decl
)) == STRING_CST
)
5078 ret
= SECCAT_RODATA_MERGE_STR_INIT
;
5080 ret
= SECCAT_RODATA_MERGE_CONST
;
5082 else if (TREE_CODE (decl
) == CONSTRUCTOR
)
5084 if ((shlib
&& reloc
)
5085 || TREE_SIDE_EFFECTS (decl
)
5086 || ! TREE_CONSTANT (decl
))
5089 ret
= SECCAT_RODATA
;
5092 ret
= SECCAT_RODATA
;
5094 /* There are no read-only thread-local sections. */
5095 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_THREAD_LOCAL (decl
))
5097 if (ret
== SECCAT_BSS
)
5103 /* If the target uses small data sections, select it. */
5104 else if ((*targetm
.in_small_data_p
) (decl
))
5106 if (ret
== SECCAT_BSS
)
5108 else if (targetm
.have_srodata_section
&& ret
== SECCAT_RODATA
)
5109 ret
= SECCAT_SRODATA
;
5118 decl_readonly_section (decl
, reloc
)
5122 return decl_readonly_section_1 (decl
, reloc
, flag_pic
);
5126 decl_readonly_section_1 (decl
, reloc
, shlib
)
5131 switch (categorize_decl_for_section (decl
, reloc
, shlib
))
5134 case SECCAT_RODATA_MERGE_STR
:
5135 case SECCAT_RODATA_MERGE_STR_INIT
:
5136 case SECCAT_RODATA_MERGE_CONST
:
5137 case SECCAT_SRODATA
:
5146 /* Select a section based on the above categorization. */
5149 default_elf_select_section (decl
, reloc
, align
)
5152 unsigned HOST_WIDE_INT align
;
5154 default_elf_select_section_1 (decl
, reloc
, align
, flag_pic
);
5158 default_elf_select_section_1 (decl
, reloc
, align
, shlib
)
5161 unsigned HOST_WIDE_INT align
;
5164 switch (categorize_decl_for_section (decl
, reloc
, shlib
))
5167 /* We're not supposed to be called on FUNCTION_DECLs. */
5170 readonly_data_section ();
5172 case SECCAT_RODATA_MERGE_STR
:
5173 mergeable_string_section (decl
, align
, 0);
5175 case SECCAT_RODATA_MERGE_STR_INIT
:
5176 mergeable_string_section (DECL_INITIAL (decl
), align
, 0);
5178 case SECCAT_RODATA_MERGE_CONST
:
5179 mergeable_constant_section (DECL_MODE (decl
), align
, 0);
5181 case SECCAT_SRODATA
:
5182 named_section (NULL_TREE
, ".sdata2", reloc
);
5187 case SECCAT_DATA_REL
:
5188 named_section (NULL_TREE
, ".data.rel", reloc
);
5190 case SECCAT_DATA_REL_LOCAL
:
5191 named_section (NULL_TREE
, ".data.rel.local", reloc
);
5193 case SECCAT_DATA_REL_RO
:
5194 named_section (NULL_TREE
, ".data.rel.ro", reloc
);
5196 case SECCAT_DATA_REL_RO_LOCAL
:
5197 named_section (NULL_TREE
, ".data.rel.ro.local", reloc
);
5200 named_section (NULL_TREE
, ".sdata", reloc
);
5203 named_section (NULL_TREE
, ".tdata", reloc
);
5206 #ifdef BSS_SECTION_ASM_OP
5209 named_section (NULL_TREE
, ".bss", reloc
);
5213 named_section (NULL_TREE
, ".sbss", reloc
);
5216 named_section (NULL_TREE
, ".tbss", reloc
);
5223 /* Construct a unique section name based on the decl name and the
5224 categorization performed above. */
5227 default_unique_section (decl
, reloc
)
5231 default_unique_section_1 (decl
, reloc
, flag_pic
);
5235 default_unique_section_1 (decl
, reloc
, shlib
)
5240 bool one_only
= DECL_ONE_ONLY (decl
);
5241 const char *prefix
, *name
;
5245 switch (categorize_decl_for_section (decl
, reloc
, shlib
))
5248 prefix
= one_only
? ".gnu.linkonce.t." : ".text.";
5251 case SECCAT_RODATA_MERGE_STR
:
5252 case SECCAT_RODATA_MERGE_STR_INIT
:
5253 case SECCAT_RODATA_MERGE_CONST
:
5254 prefix
= one_only
? ".gnu.linkonce.r." : ".rodata.";
5256 case SECCAT_SRODATA
:
5257 prefix
= one_only
? ".gnu.linkonce.s2." : ".sdata2.";
5260 case SECCAT_DATA_REL
:
5261 case SECCAT_DATA_REL_LOCAL
:
5262 case SECCAT_DATA_REL_RO
:
5263 case SECCAT_DATA_REL_RO_LOCAL
:
5264 prefix
= one_only
? ".gnu.linkonce.d." : ".data.";
5267 prefix
= one_only
? ".gnu.linkonce.s." : ".sdata.";
5270 prefix
= one_only
? ".gnu.linkonce.b." : ".bss.";
5273 prefix
= one_only
? ".gnu.linkonce.sb." : ".sbss.";
5276 prefix
= one_only
? ".gnu.linkonce.td." : ".tdata.";
5279 prefix
= one_only
? ".gnu.linkonce.tb." : ".tbss.";
5284 plen
= strlen (prefix
);
5286 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
5287 name
= (* targetm
.strip_name_encoding
) (name
);
5288 nlen
= strlen (name
);
5290 string
= alloca (nlen
+ plen
+ 1);
5291 memcpy (string
, prefix
, plen
);
5292 memcpy (string
+ plen
, name
, nlen
+ 1);
5294 DECL_SECTION_NAME (decl
) = build_string (nlen
+ plen
, string
);
5298 default_select_rtx_section (mode
, x
, align
)
5299 enum machine_mode mode ATTRIBUTE_UNUSED
;
5301 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
;
5304 switch (GET_CODE (x
))
5316 readonly_data_section ();
5320 default_elf_select_rtx_section (mode
, x
, align
)
5321 enum machine_mode mode
;
5323 unsigned HOST_WIDE_INT align
;
5325 /* ??? Handle small data here somehow. */
5328 switch (GET_CODE (x
))
5332 named_section (NULL_TREE
, ".data.rel.ro", 3);
5336 named_section (NULL_TREE
, ".data.rel.ro.local", 1);
5343 mergeable_constant_section (mode
, align
, 0);
5346 /* Set the generally applicable flags on the SYMBOL_REF for EXP. */
5349 default_encode_section_info (decl
, first
)
5351 int first ATTRIBUTE_UNUSED
;
5356 rtl
= DECL_P (decl
) ? DECL_RTL (decl
) : TREE_CST_RTL (decl
);
5358 /* Careful not to prod global register variables. */
5359 if (GET_CODE (rtl
) != MEM
)
5361 symbol
= XEXP (rtl
, 0);
5362 if (GET_CODE (symbol
) != SYMBOL_REF
)
5366 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5367 flags
|= SYMBOL_FLAG_FUNCTION
;
5368 if ((*targetm
.binds_local_p
) (decl
))
5369 flags
|= SYMBOL_FLAG_LOCAL
;
5370 if ((*targetm
.in_small_data_p
) (decl
))
5371 flags
|= SYMBOL_FLAG_SMALL
;
5372 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_THREAD_LOCAL (decl
))
5373 flags
|= decl_tls_model (decl
) << SYMBOL_FLAG_TLS_SHIFT
;
5374 /* ??? Why is DECL_EXTERNAL ever set for non-PUBLIC names? Without
5375 being PUBLIC, the thing *must* be defined in this translation unit.
5376 Prevent this buglet from being propagated into rtl code as well. */
5377 if (DECL_P (decl
) && DECL_EXTERNAL (decl
) && TREE_PUBLIC (decl
))
5378 flags
|= SYMBOL_FLAG_EXTERNAL
;
5380 SYMBOL_REF_FLAGS (symbol
) = flags
;
5383 /* By default, we do nothing for encode_section_info, so we need not
5384 do anything but discard the '*' marker. */
5387 default_strip_name_encoding (str
)
5390 return str
+ (*str
== '*');
5393 /* Assume ELF-ish defaults, since that's pretty much the most liberal
5394 wrt cross-module name binding. */
5397 default_binds_local_p (exp
)
5400 return default_binds_local_p_1 (exp
, flag_pic
);
5404 default_binds_local_p_1 (exp
, shlib
)
5410 /* A non-decl is an entry in the constant pool. */
5413 /* Static variables are always local. */
5414 else if (! TREE_PUBLIC (exp
))
5416 /* A variable is local if the user tells us so. */
5417 else if (decl_visibility (exp
) != VISIBILITY_DEFAULT
)
5419 /* Otherwise, variables defined outside this object may not be local. */
5420 else if (DECL_EXTERNAL (exp
))
5422 /* Linkonce and weak data are never local. */
5423 else if (DECL_ONE_ONLY (exp
) || DECL_WEAK (exp
))
5425 /* If PIC, then assume that any global name can be overridden by
5426 symbols resolved from other modules. */
5429 /* Uninitialized COMMON variable may be unified with symbols
5430 resolved from other modules. */
5431 else if (DECL_COMMON (exp
)
5432 && (DECL_INITIAL (exp
) == NULL
5433 || DECL_INITIAL (exp
) == error_mark_node
))
5435 /* Otherwise we're left with initialized (or non-common) global data
5436 which is of necessity defined locally. */
5443 /* Determine whether or not a pointer mode is valid. Assume defaults
5444 of ptr_mode or Pmode - can be overridden. */
5446 default_valid_pointer_mode (mode
)
5447 enum machine_mode mode
;
5449 return (mode
== ptr_mode
|| mode
== Pmode
);
5452 /* Default function to output code that will globalize a label. A
5453 target must define GLOBAL_ASM_OP or provide it's own function to
5454 globalize a label. */
5455 #ifdef GLOBAL_ASM_OP
5457 default_globalize_label (stream
, name
)
5461 fputs (GLOBAL_ASM_OP
, stream
);
5462 assemble_name (stream
, name
);
5463 putc ('\n', stream
);
5465 #endif /* GLOBAL_ASM_OP */
5467 /* This is how to output an internal numbered label where PREFIX is
5468 the class of label and LABELNO is the number within the class. */
5471 default_internal_label (stream
, prefix
, labelno
)
5474 unsigned long labelno
;
5476 char *const buf
= alloca (40 + strlen (prefix
));
5477 ASM_GENERATE_INTERNAL_LABEL (buf
, prefix
, labelno
);
5478 ASM_OUTPUT_LABEL (stream
, buf
);
5481 #include "gt-varasm.h"