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, 2004, 2005
4 Free Software Foundation, Inc.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 2, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING. If not, write to the Free
20 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
24 /* This file handles generation of all the assembler code
25 *except* the instructions of a function.
26 This includes declarations of variables and their initial values.
28 We also output the assembler code for constants stored in memory
29 and are responsible for combining constants with the same value. */
33 #include "coretypes.h"
40 #include "hard-reg-set.h"
48 #include "langhooks.h"
52 #include "tree-mudflap.h"
54 #include "cfglayout.h"
55 #include "basic-block.h"
57 #ifdef XCOFF_DEBUGGING_INFO
58 #include "xcoffout.h" /* Needed for external data
59 declarations for e.g. AIX 4.x. */
62 /* The (assembler) name of the first globally-visible object output. */
63 const char *first_global_object_name
;
64 const char *weak_global_object_name
;
67 struct constant_descriptor_rtx
;
68 struct rtx_constant_pool
;
70 struct varasm_status
GTY(())
72 /* If we're using a per-function constant pool, this is it. */
73 struct rtx_constant_pool
*pool
;
75 /* Number of tree-constants deferred during the expansion of this
77 unsigned int deferred_constants
;
80 #define n_deferred_constants (cfun->varasm->deferred_constants)
82 /* Number for making the label on the next
83 constant that is stored in memory. */
85 static GTY(()) int const_labelno
;
87 /* Carry information from ASM_DECLARE_OBJECT_NAME
88 to ASM_FINISH_DECLARE_OBJECT. */
90 int size_directive_output
;
92 /* The last decl for which assemble_variable was called,
93 if it did ASM_DECLARE_OBJECT_NAME.
94 If the last call to assemble_variable didn't do that,
97 tree last_assemble_variable_decl
;
99 /* The following global variable indicates if the first basic block
100 in a function belongs to the cold partition or not. */
102 bool first_function_block_is_cold
;
104 /* The following global variable indicates the label name to be put at
105 the start of the first cold section within each function, when
106 partitioning basic blocks into hot and cold sections. Used for
109 char *unlikely_section_label
;
111 /* The following global variable indicates the label name to be put at
112 the start of the first hot section within each function, when
113 partitioning basic blocks into hot and cold sections. Used for
116 char *hot_section_label
;
118 /* The following global variable indicates the label name to be put at
119 the end of the last hot section within each function, when
120 partitioning basic blocks into hot and cold sections. Used for
123 char *hot_section_end_label
;
125 /* The following global variable indicates the label name to be put at
126 the end of the last cold section within each function, when
127 partitioning basic blocks into hot and cold sections. Used for
130 char *cold_section_end_label
;
132 /* The following global variable indicates the section name to be used
133 for the current cold section, when partitiong hot and cold basic
134 blocks into separate sections. */
136 char *unlikely_text_section_name
;
138 /* We give all constants their own alias set. Perhaps redundant with
139 MEM_READONLY_P, but pre-dates it. */
141 static HOST_WIDE_INT const_alias_set
;
143 static const char *strip_reg_name (const char *);
144 static int contains_pointers_p (tree
);
145 #ifdef ASM_OUTPUT_EXTERNAL
146 static bool incorporeal_function_p (tree
);
148 static void decode_addr_const (tree
, struct addr_const
*);
149 static hashval_t
const_desc_hash (const void *);
150 static int const_desc_eq (const void *, const void *);
151 static hashval_t
const_hash_1 (const tree
);
152 static int compare_constant (const tree
, const tree
);
153 static tree
copy_constant (tree
);
154 static void output_constant_def_contents (rtx
);
155 static void output_addressed_constants (tree
);
156 static unsigned HOST_WIDE_INT
array_size_for_constructor (tree
);
157 static unsigned min_align (unsigned, unsigned);
158 static void output_constructor (tree
, unsigned HOST_WIDE_INT
, unsigned int);
159 static void globalize_decl (tree
);
160 static void maybe_assemble_visibility (tree
);
161 static int in_named_entry_eq (const void *, const void *);
162 static hashval_t
in_named_entry_hash (const void *);
163 static void initialize_cold_section_name (void);
164 #ifdef BSS_SECTION_ASM_OP
165 #ifdef ASM_OUTPUT_BSS
166 static void asm_output_bss (FILE *, tree
, const char *,
167 unsigned HOST_WIDE_INT
, unsigned HOST_WIDE_INT
);
169 #ifdef ASM_OUTPUT_ALIGNED_BSS
170 static void asm_output_aligned_bss (FILE *, tree
, const char *,
171 unsigned HOST_WIDE_INT
, int)
174 #endif /* BSS_SECTION_ASM_OP */
175 static bool asm_emit_uninitialised (tree
, const char*,
176 unsigned HOST_WIDE_INT
,
177 unsigned HOST_WIDE_INT
);
178 static void mark_weak (tree
);
180 static GTY(()) enum in_section in_section
= no_section
;
181 enum in_section last_text_section
;
183 /* Return a nonzero value if DECL has a section attribute. */
184 #ifndef IN_NAMED_SECTION
185 #define IN_NAMED_SECTION(DECL) \
186 ((TREE_CODE (DECL) == FUNCTION_DECL || TREE_CODE (DECL) == VAR_DECL) \
187 && DECL_SECTION_NAME (DECL) != NULL_TREE)
190 /* Text of section name when in_section == in_named. */
191 static GTY(()) const char *in_named_name
;
192 const char *last_text_section_name
;
194 /* Hash table of flags that have been used for a particular named section. */
196 struct in_named_entry
GTY(())
203 static GTY((param_is (struct in_named_entry
))) htab_t in_named_htab
;
205 /* Define functions like text_section for any extra sections. */
206 #ifdef EXTRA_SECTION_FUNCTIONS
207 EXTRA_SECTION_FUNCTIONS
211 initialize_cold_section_name (void)
216 if (! unlikely_text_section_name
)
218 if (DECL_SECTION_NAME (current_function_decl
)
219 && (strcmp (TREE_STRING_POINTER (DECL_SECTION_NAME
220 (current_function_decl
)),
221 HOT_TEXT_SECTION_NAME
) != 0)
222 && (strcmp (TREE_STRING_POINTER (DECL_SECTION_NAME
223 (current_function_decl
)),
224 UNLIKELY_EXECUTED_TEXT_SECTION_NAME
) != 0))
226 name
= TREE_STRING_POINTER (DECL_SECTION_NAME
227 (current_function_decl
));
229 unlikely_text_section_name
= xmalloc (len
+ 10);
230 sprintf (unlikely_text_section_name
, "%s%s", name
, "_unlikely");
233 unlikely_text_section_name
=
234 xstrdup (UNLIKELY_EXECUTED_TEXT_SECTION_NAME
);
238 /* Tell assembler to switch to text section. */
243 if (in_section
!= in_text
)
245 in_section
= in_text
;
246 last_text_section
= in_text
;
247 fprintf (asm_out_file
, "%s\n", TEXT_SECTION_ASM_OP
);
251 /* Tell assembler to switch to unlikely-to-be-executed text section. */
254 unlikely_text_section (void)
256 if (! unlikely_text_section_name
)
257 initialize_cold_section_name ();
259 if ((in_section
!= in_unlikely_executed_text
)
260 && (in_section
!= in_named
261 || strcmp (in_named_name
, unlikely_text_section_name
) != 0))
263 named_section (NULL_TREE
, unlikely_text_section_name
, 0);
264 in_section
= in_unlikely_executed_text
;
265 last_text_section
= in_unlikely_executed_text
;
269 /* Tell assembler to switch to data section. */
274 if (in_section
!= in_data
)
276 in_section
= in_data
;
277 fprintf (asm_out_file
, "%s\n", DATA_SECTION_ASM_OP
);
281 /* Tell assembler to switch to read-only data section. This is normally
285 readonly_data_section (void)
287 #ifdef READONLY_DATA_SECTION
288 READONLY_DATA_SECTION (); /* Note this can call data_section. */
290 #ifdef READONLY_DATA_SECTION_ASM_OP
291 if (in_section
!= in_readonly_data
)
293 in_section
= in_readonly_data
;
294 fputs (READONLY_DATA_SECTION_ASM_OP
, asm_out_file
);
295 fputc ('\n', asm_out_file
);
303 /* Determine if we're in the text section. */
306 in_text_section (void)
308 return in_section
== in_text
;
311 /* Determine if we're in the unlikely-to-be-executed text section. */
314 in_unlikely_text_section (void)
318 ret_val
= ((in_section
== in_unlikely_executed_text
)
319 || (in_section
== in_named
320 && unlikely_text_section_name
321 && strcmp (in_named_name
, unlikely_text_section_name
) == 0));
326 /* Determine if we're in the data section. */
329 in_data_section (void)
331 return in_section
== in_data
;
334 /* Helper routines for maintaining in_named_htab. */
337 in_named_entry_eq (const void *p1
, const void *p2
)
339 const struct in_named_entry
*old
= p1
;
340 const char *new = p2
;
342 return strcmp (old
->name
, new) == 0;
346 in_named_entry_hash (const void *p
)
348 const struct in_named_entry
*old
= p
;
349 return htab_hash_string (old
->name
);
352 /* If SECTION has been seen before as a named section, return the flags
353 that were used. Otherwise, return 0. Note, that 0 is a perfectly valid
354 set of flags for a section to have, so 0 does not mean that the section
355 has not been seen. */
358 get_named_section_flags (const char *section
)
360 struct in_named_entry
**slot
;
362 slot
= (struct in_named_entry
**)
363 htab_find_slot_with_hash (in_named_htab
, section
,
364 htab_hash_string (section
), NO_INSERT
);
366 return slot
? (*slot
)->flags
: 0;
369 /* Returns true if the section has been declared before. Sets internal
370 flag on this section in in_named_hash so subsequent calls on this
371 section will return false. */
374 named_section_first_declaration (const char *name
)
376 struct in_named_entry
**slot
;
378 slot
= (struct in_named_entry
**)
379 htab_find_slot_with_hash (in_named_htab
, name
,
380 htab_hash_string (name
), NO_INSERT
);
381 if (! (*slot
)->declared
)
383 (*slot
)->declared
= true;
393 /* Record FLAGS for SECTION. If SECTION was previously recorded with a
394 different set of flags, return false. */
397 set_named_section_flags (const char *section
, unsigned int flags
)
399 struct in_named_entry
**slot
, *entry
;
401 slot
= (struct in_named_entry
**)
402 htab_find_slot_with_hash (in_named_htab
, section
,
403 htab_hash_string (section
), INSERT
);
408 entry
= ggc_alloc (sizeof (*entry
));
410 entry
->name
= ggc_strdup (section
);
411 entry
->flags
= flags
;
412 entry
->declared
= false;
414 else if (entry
->flags
!= flags
)
420 /* Tell assembler to change to section NAME with attributes FLAGS. If
421 DECL is non-NULL, it is the VAR_DECL or FUNCTION_DECL with which
422 this section is associated. */
425 named_section_real (const char *name
, unsigned int flags
, tree decl
)
427 if (in_section
!= in_named
|| strcmp (name
, in_named_name
) != 0)
429 bool unchanged
= set_named_section_flags (name
, flags
);
431 gcc_assert (unchanged
);
433 targetm
.asm_out
.named_section (name
, flags
, decl
);
435 if (flags
& SECTION_FORGET
)
436 in_section
= no_section
;
439 in_named_name
= ggc_strdup (name
);
440 in_section
= in_named
;
444 if (in_text_section () || in_unlikely_text_section ())
446 last_text_section
= in_section
;
447 last_text_section_name
= name
;
451 /* Tell assembler to change to section NAME for DECL.
452 If DECL is NULL, just switch to section NAME.
453 If NAME is NULL, get the name from DECL.
454 If RELOC is 1, the initializer for DECL contains relocs. */
457 named_section (tree decl
, const char *name
, int reloc
)
461 gcc_assert (!decl
|| DECL_P (decl
));
463 name
= TREE_STRING_POINTER (DECL_SECTION_NAME (decl
));
465 if (strcmp (name
, UNLIKELY_EXECUTED_TEXT_SECTION_NAME
) == 0
466 && !unlikely_text_section_name
)
467 unlikely_text_section_name
=
468 xstrdup (UNLIKELY_EXECUTED_TEXT_SECTION_NAME
);
470 flags
= targetm
.section_type_flags (decl
, name
, reloc
);
472 /* Sanity check user variables for flag changes. Non-user
473 section flag changes will abort in named_section_flags.
474 However, don't complain if SECTION_OVERRIDE is set.
475 We trust that the setter knows that it is safe to ignore
476 the default flags for this decl. */
477 if (decl
&& ! set_named_section_flags (name
, flags
))
479 flags
= get_named_section_flags (name
);
480 if ((flags
& SECTION_OVERRIDE
) == 0)
481 error ("%J%D causes a section type conflict", decl
, decl
);
484 named_section_real (name
, flags
, decl
);
487 /* If required, set DECL_SECTION_NAME to a unique name. */
490 resolve_unique_section (tree decl
, int reloc ATTRIBUTE_UNUSED
,
491 int flag_function_or_data_sections
)
493 if (DECL_SECTION_NAME (decl
) == NULL_TREE
494 && targetm
.have_named_sections
495 && (flag_function_or_data_sections
496 || DECL_ONE_ONLY (decl
)))
497 targetm
.asm_out
.unique_section (decl
, reloc
);
500 #ifdef BSS_SECTION_ASM_OP
502 /* Tell the assembler to switch to the bss section. */
507 if (in_section
!= in_bss
)
509 fprintf (asm_out_file
, "%s\n", BSS_SECTION_ASM_OP
);
514 #ifdef ASM_OUTPUT_BSS
516 /* Utility function for ASM_OUTPUT_BSS for targets to use if
517 they don't support alignments in .bss.
518 ??? It is believed that this function will work in most cases so such
519 support is localized here. */
522 asm_output_bss (FILE *file
, tree decl ATTRIBUTE_UNUSED
,
524 unsigned HOST_WIDE_INT size ATTRIBUTE_UNUSED
,
525 unsigned HOST_WIDE_INT rounded
)
527 targetm
.asm_out
.globalize_label (file
, name
);
529 #ifdef ASM_DECLARE_OBJECT_NAME
530 last_assemble_variable_decl
= decl
;
531 ASM_DECLARE_OBJECT_NAME (file
, name
, decl
);
533 /* Standard thing is just output label for the object. */
534 ASM_OUTPUT_LABEL (file
, name
);
535 #endif /* ASM_DECLARE_OBJECT_NAME */
536 ASM_OUTPUT_SKIP (file
, rounded
? rounded
: 1);
541 #ifdef ASM_OUTPUT_ALIGNED_BSS
543 /* Utility function for targets to use in implementing
544 ASM_OUTPUT_ALIGNED_BSS.
545 ??? It is believed that this function will work in most cases so such
546 support is localized here. */
549 asm_output_aligned_bss (FILE *file
, tree decl ATTRIBUTE_UNUSED
,
550 const char *name
, unsigned HOST_WIDE_INT size
,
554 ASM_OUTPUT_ALIGN (file
, floor_log2 (align
/ BITS_PER_UNIT
));
555 #ifdef ASM_DECLARE_OBJECT_NAME
556 last_assemble_variable_decl
= decl
;
557 ASM_DECLARE_OBJECT_NAME (file
, name
, decl
);
559 /* Standard thing is just output label for the object. */
560 ASM_OUTPUT_LABEL (file
, name
);
561 #endif /* ASM_DECLARE_OBJECT_NAME */
562 ASM_OUTPUT_SKIP (file
, size
? size
: 1);
567 #endif /* BSS_SECTION_ASM_OP */
569 /* Switch to the section for function DECL.
571 If DECL is NULL_TREE, switch to the text section. We can be passed
572 NULL_TREE under some circumstances by dbxout.c at least. */
575 function_section (tree decl
)
577 bool unlikely
= false;
579 if (first_function_block_is_cold
)
582 #ifdef USE_SELECT_SECTION_FOR_FUNCTIONS
583 targetm
.asm_out
.select_section (decl
, unlikely
, DECL_ALIGN (decl
));
585 if (decl
!= NULL_TREE
586 && DECL_SECTION_NAME (decl
) != NULL_TREE
)
587 named_section (decl
, (char *) 0, 0);
594 current_function_section (tree decl
)
596 #ifdef USE_SELECT_SECTION_FOR_FUNCTIONS
597 bool unlikely
= (in_unlikely_text_section ()
598 || (last_text_section
== in_unlikely_executed_text
));
600 targetm
.asm_out
.select_section (decl
, unlikely
, DECL_ALIGN (decl
));
602 if (last_text_section
== in_unlikely_executed_text
)
603 unlikely_text_section ();
604 else if (last_text_section
== in_text
)
606 else if (last_text_section
== in_named
)
607 named_section (NULL_TREE
, last_text_section_name
, 0);
609 function_section (decl
);
613 /* Switch to read-only data section associated with function DECL. */
616 default_function_rodata_section (tree decl
)
618 if (decl
!= NULL_TREE
&& DECL_SECTION_NAME (decl
))
620 const char *name
= TREE_STRING_POINTER (DECL_SECTION_NAME (decl
));
622 /* For .gnu.linkonce.t.foo we want to use .gnu.linkonce.r.foo. */
623 if (DECL_ONE_ONLY (decl
) && strncmp (name
, ".gnu.linkonce.t.", 16) == 0)
625 size_t len
= strlen (name
) + 1;
626 char *rname
= alloca (len
);
628 memcpy (rname
, name
, len
);
630 named_section_real (rname
, SECTION_LINKONCE
, decl
);
633 /* For .text.foo we want to use .rodata.foo. */
634 else if (flag_function_sections
&& flag_data_sections
635 && strncmp (name
, ".text.", 6) == 0)
637 size_t len
= strlen (name
) + 1;
638 char *rname
= alloca (len
+ 2);
640 memcpy (rname
, ".rodata", 7);
641 memcpy (rname
+ 7, name
+ 5, len
- 5);
642 named_section_flags (rname
, 0);
647 readonly_data_section ();
650 /* Switch to read-only data section associated with function DECL
651 for targets where that section should be always the single
652 readonly data section. */
655 default_no_function_rodata_section (tree decl ATTRIBUTE_UNUSED
)
657 readonly_data_section ();
660 /* Switch to section for variable DECL. RELOC is the same as the
661 argument to SELECT_SECTION. */
664 variable_section (tree decl
, int reloc
)
666 if (IN_NAMED_SECTION (decl
))
667 named_section (decl
, NULL
, reloc
);
669 targetm
.asm_out
.select_section (decl
, reloc
, DECL_ALIGN (decl
));
672 /* Tell assembler to switch to the section for string merging. */
675 mergeable_string_section (tree decl ATTRIBUTE_UNUSED
,
676 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
,
677 unsigned int flags ATTRIBUTE_UNUSED
)
679 if (HAVE_GAS_SHF_MERGE
&& flag_merge_constants
680 && TREE_CODE (decl
) == STRING_CST
681 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
683 && TREE_STRING_LENGTH (decl
) >= int_size_in_bytes (TREE_TYPE (decl
)))
685 enum machine_mode mode
;
686 unsigned int modesize
;
691 mode
= TYPE_MODE (TREE_TYPE (TREE_TYPE (decl
)));
692 modesize
= GET_MODE_BITSIZE (mode
);
693 if (modesize
>= 8 && modesize
<= 256
694 && (modesize
& (modesize
- 1)) == 0)
696 if (align
< modesize
)
699 str
= TREE_STRING_POINTER (decl
);
700 len
= TREE_STRING_LENGTH (decl
);
701 unit
= GET_MODE_SIZE (mode
);
703 /* Check for embedded NUL characters. */
704 for (i
= 0; i
< len
; i
+= unit
)
706 for (j
= 0; j
< unit
; j
++)
707 if (str
[i
+ j
] != '\0')
714 sprintf (name
, ".rodata.str%d.%d", modesize
/ 8,
716 flags
|= (modesize
/ 8) | SECTION_MERGE
| SECTION_STRINGS
;
717 if (!i
&& modesize
< align
)
719 /* A "" string with requested alignment greater than
720 character size might cause a problem:
721 if some other string required even bigger
722 alignment than "", then linker might think the
723 "" is just part of padding after some other string
724 and not put it into the hash table initially.
725 But this means "" could have smaller alignment
727 #ifdef ASM_OUTPUT_SECTION_START
728 named_section_flags (name
, flags
);
729 ASM_OUTPUT_SECTION_START (asm_out_file
);
731 readonly_data_section ();
736 named_section_flags (name
, flags
);
742 readonly_data_section ();
745 /* Tell assembler to switch to the section for constant merging. */
748 mergeable_constant_section (enum machine_mode mode ATTRIBUTE_UNUSED
,
749 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
,
750 unsigned int flags ATTRIBUTE_UNUSED
)
752 unsigned int modesize
= GET_MODE_BITSIZE (mode
);
754 if (HAVE_GAS_SHF_MERGE
&& flag_merge_constants
760 && (align
& (align
- 1)) == 0)
764 sprintf (name
, ".rodata.cst%d", (int) (align
/ 8));
765 flags
|= (align
/ 8) | SECTION_MERGE
;
766 named_section_flags (name
, flags
);
770 readonly_data_section ();
773 /* Given NAME, a putative register name, discard any customary prefixes. */
776 strip_reg_name (const char *name
)
778 #ifdef REGISTER_PREFIX
779 if (!strncmp (name
, REGISTER_PREFIX
, strlen (REGISTER_PREFIX
)))
780 name
+= strlen (REGISTER_PREFIX
);
782 if (name
[0] == '%' || name
[0] == '#')
787 /* The user has asked for a DECL to have a particular name. Set (or
788 change) it in such a way that we don't prefix an underscore to
791 set_user_assembler_name (tree decl
, const char *name
)
793 char *starred
= alloca (strlen (name
) + 2);
795 strcpy (starred
+ 1, name
);
796 change_decl_assembler_name (decl
, get_identifier (starred
));
797 SET_DECL_RTL (decl
, NULL_RTX
);
800 /* Decode an `asm' spec for a declaration as a register name.
801 Return the register number, or -1 if nothing specified,
802 or -2 if the ASMSPEC is not `cc' or `memory' and is not recognized,
803 or -3 if ASMSPEC is `cc' and is not recognized,
804 or -4 if ASMSPEC is `memory' and is not recognized.
805 Accept an exact spelling or a decimal number.
806 Prefixes such as % are optional. */
809 decode_reg_name (const char *asmspec
)
815 /* Get rid of confusing prefixes. */
816 asmspec
= strip_reg_name (asmspec
);
818 /* Allow a decimal number as a "register name". */
819 for (i
= strlen (asmspec
) - 1; i
>= 0; i
--)
820 if (! ISDIGIT (asmspec
[i
]))
822 if (asmspec
[0] != 0 && i
< 0)
825 if (i
< FIRST_PSEUDO_REGISTER
&& i
>= 0)
831 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
833 && ! strcmp (asmspec
, strip_reg_name (reg_names
[i
])))
836 #ifdef ADDITIONAL_REGISTER_NAMES
838 static const struct { const char *const name
; const int number
; } table
[]
839 = ADDITIONAL_REGISTER_NAMES
;
841 for (i
= 0; i
< (int) ARRAY_SIZE (table
); i
++)
842 if (! strcmp (asmspec
, table
[i
].name
))
843 return table
[i
].number
;
845 #endif /* ADDITIONAL_REGISTER_NAMES */
847 if (!strcmp (asmspec
, "memory"))
850 if (!strcmp (asmspec
, "cc"))
859 /* Create the DECL_RTL for a VAR_DECL or FUNCTION_DECL. DECL should
860 have static storage duration. In other words, it should not be an
861 automatic variable, including PARM_DECLs.
863 There is, however, one exception: this function handles variables
864 explicitly placed in a particular register by the user.
866 This is never called for PARM_DECL nodes. */
869 make_decl_rtl (tree decl
)
871 const char *name
= 0;
875 /* Check that we are not being given an automatic variable. */
876 gcc_assert (TREE_CODE (decl
) != PARM_DECL
877 && TREE_CODE (decl
) != RESULT_DECL
);
879 /* A weak alias has TREE_PUBLIC set but not the other bits. */
880 gcc_assert (TREE_CODE (decl
) != VAR_DECL
881 || TREE_STATIC (decl
)
882 || TREE_PUBLIC (decl
)
883 || DECL_EXTERNAL (decl
)
884 || DECL_REGISTER (decl
));
886 /* And that we were not given a type or a label. */
887 gcc_assert (TREE_CODE (decl
) != TYPE_DECL
888 && TREE_CODE (decl
) != LABEL_DECL
);
890 /* For a duplicate declaration, we can be called twice on the
891 same DECL node. Don't discard the RTL already made. */
892 if (DECL_RTL_SET_P (decl
))
894 /* If the old RTL had the wrong mode, fix the mode. */
895 if (GET_MODE (DECL_RTL (decl
)) != DECL_MODE (decl
))
896 SET_DECL_RTL (decl
, adjust_address_nv (DECL_RTL (decl
),
897 DECL_MODE (decl
), 0));
899 if (TREE_CODE (decl
) != FUNCTION_DECL
&& DECL_REGISTER (decl
))
902 /* ??? Another way to do this would be to maintain a hashed
903 table of such critters. Instead of adding stuff to a DECL
904 to give certain attributes to it, we could use an external
905 hash map from DECL to set of attributes. */
907 /* Let the target reassign the RTL if it wants.
908 This is necessary, for example, when one machine specific
909 decl attribute overrides another. */
910 targetm
.encode_section_info (decl
, DECL_RTL (decl
), false);
912 /* Make this function static known to the mudflap runtime. */
913 if (flag_mudflap
&& TREE_CODE (decl
) == VAR_DECL
)
914 mudflap_enqueue_decl (decl
);
919 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
921 if (TREE_CODE (decl
) != FUNCTION_DECL
&& DECL_REGISTER (decl
))
923 reg_number
= decode_reg_name (name
);
924 /* First detect errors in declaring global registers. */
925 if (reg_number
== -1)
926 error ("%Jregister name not specified for %qD", decl
, decl
);
927 else if (reg_number
< 0)
928 error ("%Jinvalid register name for %qD", decl
, decl
);
929 else if (TYPE_MODE (TREE_TYPE (decl
)) == BLKmode
)
930 error ("%Jdata type of %qD isn%'t suitable for a register",
932 else if (! HARD_REGNO_MODE_OK (reg_number
, TYPE_MODE (TREE_TYPE (decl
))))
933 error ("%Jregister specified for %qD isn%'t suitable for data type",
935 /* Now handle properly declared static register variables. */
940 if (DECL_INITIAL (decl
) != 0 && TREE_STATIC (decl
))
942 DECL_INITIAL (decl
) = 0;
943 error ("global register variable has initial value");
945 if (TREE_THIS_VOLATILE (decl
))
946 warning ("volatile register variables don%'t "
947 "work as you might wish");
949 /* If the user specified one of the eliminables registers here,
950 e.g., FRAME_POINTER_REGNUM, we don't want to get this variable
951 confused with that register and be eliminated. This usage is
952 somewhat suspect... */
954 SET_DECL_RTL (decl
, gen_rtx_raw_REG (DECL_MODE (decl
), reg_number
));
955 ORIGINAL_REGNO (DECL_RTL (decl
)) = reg_number
;
956 REG_USERVAR_P (DECL_RTL (decl
)) = 1;
958 if (TREE_STATIC (decl
))
960 /* Make this register global, so not usable for anything
962 #ifdef ASM_DECLARE_REGISTER_GLOBAL
963 name
= IDENTIFIER_POINTER (DECL_NAME (decl
));
964 ASM_DECLARE_REGISTER_GLOBAL (asm_out_file
, decl
, reg_number
, name
);
966 nregs
= hard_regno_nregs
[reg_number
][DECL_MODE (decl
)];
968 globalize_reg (reg_number
+ --nregs
);
971 /* As a register variable, it has no section. */
975 /* Now handle ordinary static variables and functions (in memory).
976 Also handle vars declared register invalidly. */
977 else if (name
[0] == '*')
979 #ifdef REGISTER_PREFIX
980 if (strlen (REGISTER_PREFIX
) != 0)
982 reg_number
= decode_reg_name (name
);
983 if (reg_number
>= 0 || reg_number
== -3)
984 error ("%Jregister name given for non-register variable %qD", decl
, decl
);
989 /* Specifying a section attribute on a variable forces it into a
990 non-.bss section, and thus it cannot be common. */
991 if (TREE_CODE (decl
) == VAR_DECL
992 && DECL_SECTION_NAME (decl
) != NULL_TREE
993 && DECL_INITIAL (decl
) == NULL_TREE
994 && DECL_COMMON (decl
))
995 DECL_COMMON (decl
) = 0;
997 /* Variables can't be both common and weak. */
998 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_WEAK (decl
))
999 DECL_COMMON (decl
) = 0;
1001 x
= gen_rtx_SYMBOL_REF (Pmode
, name
);
1002 SYMBOL_REF_WEAK (x
) = DECL_WEAK (decl
);
1003 SYMBOL_REF_DECL (x
) = decl
;
1005 x
= gen_rtx_MEM (DECL_MODE (decl
), x
);
1006 if (TREE_CODE (decl
) != FUNCTION_DECL
)
1007 set_mem_attributes (x
, decl
, 1);
1008 SET_DECL_RTL (decl
, x
);
1010 /* Optionally set flags or add text to the name to record information
1011 such as that it is a function name.
1012 If the name is changed, the macro ASM_OUTPUT_LABELREF
1013 will have to know how to strip this information. */
1014 targetm
.encode_section_info (decl
, DECL_RTL (decl
), true);
1016 /* Make this function static known to the mudflap runtime. */
1017 if (flag_mudflap
&& TREE_CODE (decl
) == VAR_DECL
)
1018 mudflap_enqueue_decl (decl
);
1021 /* Make the rtl for variable VAR be volatile.
1022 Use this only for static variables. */
1025 make_var_volatile (tree var
)
1027 gcc_assert (MEM_P (DECL_RTL (var
)));
1029 MEM_VOLATILE_P (DECL_RTL (var
)) = 1;
1032 /* Output a string of literal assembler code
1033 for an `asm' keyword used between functions. */
1036 assemble_asm (tree string
)
1040 if (TREE_CODE (string
) == ADDR_EXPR
)
1041 string
= TREE_OPERAND (string
, 0);
1043 fprintf (asm_out_file
, "\t%s\n", TREE_STRING_POINTER (string
));
1046 /* Record an element in the table of global destructors. SYMBOL is
1047 a SYMBOL_REF of the function to be called; PRIORITY is a number
1048 between 0 and MAX_INIT_PRIORITY. */
1051 default_stabs_asm_out_destructor (rtx symbol ATTRIBUTE_UNUSED
,
1052 int priority ATTRIBUTE_UNUSED
)
1054 #if defined DBX_DEBUGGING_INFO || defined XCOFF_DEBUGGING_INFO
1055 /* Tell GNU LD that this is part of the static destructor set.
1056 This will work for any system that uses stabs, most usefully
1058 dbxout_begin_simple_stabs ("___DTOR_LIST__", 22 /* N_SETT */);
1059 dbxout_stab_value_label (XSTR (symbol
, 0));
1061 sorry ("global destructors not supported on this target");
1066 default_named_section_asm_out_destructor (rtx symbol
, int priority
)
1068 const char *section
= ".dtors";
1071 /* ??? This only works reliably with the GNU linker. */
1072 if (priority
!= DEFAULT_INIT_PRIORITY
)
1074 sprintf (buf
, ".dtors.%.5u",
1075 /* Invert the numbering so the linker puts us in the proper
1076 order; constructors are run from right to left, and the
1077 linker sorts in increasing order. */
1078 MAX_INIT_PRIORITY
- priority
);
1082 named_section_flags (section
, SECTION_WRITE
);
1083 assemble_align (POINTER_SIZE
);
1084 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1087 #ifdef DTORS_SECTION_ASM_OP
1089 dtors_section (void)
1091 if (in_section
!= in_dtors
)
1093 in_section
= in_dtors
;
1094 fputs (DTORS_SECTION_ASM_OP
, asm_out_file
);
1095 fputc ('\n', asm_out_file
);
1100 default_dtor_section_asm_out_destructor (rtx symbol
,
1101 int priority ATTRIBUTE_UNUSED
)
1104 assemble_align (POINTER_SIZE
);
1105 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1109 /* Likewise for global constructors. */
1112 default_stabs_asm_out_constructor (rtx symbol ATTRIBUTE_UNUSED
,
1113 int priority ATTRIBUTE_UNUSED
)
1115 #if defined DBX_DEBUGGING_INFO || defined XCOFF_DEBUGGING_INFO
1116 /* Tell GNU LD that this is part of the static destructor set.
1117 This will work for any system that uses stabs, most usefully
1119 dbxout_begin_simple_stabs ("___CTOR_LIST__", 22 /* N_SETT */);
1120 dbxout_stab_value_label (XSTR (symbol
, 0));
1122 sorry ("global constructors not supported on this target");
1127 default_named_section_asm_out_constructor (rtx symbol
, int priority
)
1129 const char *section
= ".ctors";
1132 /* ??? This only works reliably with the GNU linker. */
1133 if (priority
!= DEFAULT_INIT_PRIORITY
)
1135 sprintf (buf
, ".ctors.%.5u",
1136 /* Invert the numbering so the linker puts us in the proper
1137 order; constructors are run from right to left, and the
1138 linker sorts in increasing order. */
1139 MAX_INIT_PRIORITY
- priority
);
1143 named_section_flags (section
, SECTION_WRITE
);
1144 assemble_align (POINTER_SIZE
);
1145 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1148 #ifdef CTORS_SECTION_ASM_OP
1150 ctors_section (void)
1152 if (in_section
!= in_ctors
)
1154 in_section
= in_ctors
;
1155 fputs (CTORS_SECTION_ASM_OP
, asm_out_file
);
1156 fputc ('\n', asm_out_file
);
1161 default_ctor_section_asm_out_constructor (rtx symbol
,
1162 int priority ATTRIBUTE_UNUSED
)
1165 assemble_align (POINTER_SIZE
);
1166 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1170 /* CONSTANT_POOL_BEFORE_FUNCTION may be defined as an expression with
1171 a nonzero value if the constant pool should be output before the
1172 start of the function, or a zero value if the pool should output
1173 after the end of the function. The default is to put it before the
1176 #ifndef CONSTANT_POOL_BEFORE_FUNCTION
1177 #define CONSTANT_POOL_BEFORE_FUNCTION 1
1180 /* DECL is an object (either VAR_DECL or FUNCTION_DECL) which is going
1181 to be output to assembler.
1182 Set first_global_object_name and weak_global_object_name as appropriate. */
1185 notice_global_symbol (tree decl
)
1187 const char **type
= &first_global_object_name
;
1189 if (first_global_object_name
1190 || !TREE_PUBLIC (decl
) || DECL_EXTERNAL (decl
)
1191 || !DECL_NAME (decl
)
1192 || (TREE_CODE (decl
) != FUNCTION_DECL
1193 && (TREE_CODE (decl
) != VAR_DECL
1194 || (DECL_COMMON (decl
)
1195 && (DECL_INITIAL (decl
) == 0
1196 || DECL_INITIAL (decl
) == error_mark_node
))))
1197 || !MEM_P (DECL_RTL (decl
)))
1200 /* We win when global object is found, but it is useful to know about weak
1201 symbol as well so we can produce nicer unique names. */
1202 if (DECL_WEAK (decl
) || DECL_ONE_ONLY (decl
))
1203 type
= &weak_global_object_name
;
1209 rtx decl_rtl
= DECL_RTL (decl
);
1211 p
= targetm
.strip_name_encoding (XSTR (XEXP (decl_rtl
, 0), 0));
1218 /* Output assembler code for the constant pool of a function and associated
1219 with defining the name of the function. DECL describes the function.
1220 NAME is the function's name. For the constant pool, we use the current
1221 constant pool data. */
1224 assemble_start_function (tree decl
, const char *fnname
)
1227 bool hot_label_written
= false;
1229 unlikely_text_section_name
= NULL
;
1231 first_function_block_is_cold
= false;
1232 hot_section_label
= reconcat (hot_section_label
, fnname
, ".hot_section", NULL
);
1233 unlikely_section_label
= reconcat (unlikely_section_label
,
1234 fnname
, ".unlikely_section", NULL
);
1235 hot_section_end_label
= reconcat (hot_section_end_label
,
1236 fnname
, ".end", NULL
);
1237 cold_section_end_label
= reconcat (cold_section_end_label
,
1238 fnname
, ".end.cold", NULL
);
1240 /* The following code does not need preprocessing in the assembler. */
1244 if (CONSTANT_POOL_BEFORE_FUNCTION
)
1245 output_constant_pool (fnname
, decl
);
1247 /* Make sure the not and cold text (code) sections are properly
1248 aligned. This is necessary here in the case where the function
1249 has both hot and cold sections, because we don't want to re-set
1250 the alignment when the section switch happens mid-function. */
1252 if (flag_reorder_blocks_and_partition
)
1254 unlikely_text_section ();
1255 assemble_align (FUNCTION_BOUNDARY
);
1256 ASM_OUTPUT_LABEL (asm_out_file
, unlikely_section_label
);
1257 if (BB_PARTITION (ENTRY_BLOCK_PTR
->next_bb
) == BB_COLD_PARTITION
)
1259 /* Since the function starts with a cold section, we need to
1260 explicitly align the hot section and write out the hot
1263 assemble_align (FUNCTION_BOUNDARY
);
1264 ASM_OUTPUT_LABEL (asm_out_file
, hot_section_label
);
1265 hot_label_written
= true;
1266 first_function_block_is_cold
= true;
1269 else if (DECL_SECTION_NAME (decl
))
1271 /* Calls to function_section rely on first_function_block_is_cold
1272 being accurate. The first block may be cold even if we aren't
1273 doing partitioning, if the entire function was decided by
1274 choose_function_section (predict.c) to be cold. */
1280 initialize_cold_section_name ();
1282 /* The following is necessary, because 'strcmp
1283 (TREE_STRING_POINTER (DECL_SECTION_NAME (decl)), blah)' always
1284 fails, presumably because TREE_STRING_POINTER is declared to
1285 be an array of size 1 of char. */
1287 len
= TREE_STRING_LENGTH (DECL_SECTION_NAME (decl
));
1288 s
= (char *) xmalloc (len
+ 1);
1290 for (i
= 0; i
< len
; i
++)
1291 s
[i
] = (TREE_STRING_POINTER (DECL_SECTION_NAME (decl
)))[i
];
1294 if (unlikely_text_section_name
1295 && (strcmp (s
, unlikely_text_section_name
) == 0))
1296 first_function_block_is_cold
= true;
1299 last_text_section
= no_section
;
1300 in_section
= no_section
;
1301 resolve_unique_section (decl
, 0, flag_function_sections
);
1303 /* Switch to the correct text section for the start of the function. */
1305 function_section (decl
);
1306 if (!hot_label_written
)
1307 ASM_OUTPUT_LABEL (asm_out_file
, hot_section_label
);
1309 /* Tell assembler to move to target machine's alignment for functions. */
1310 align
= floor_log2 (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
1311 if (align
< force_align_functions_log
)
1312 align
= force_align_functions_log
;
1315 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1318 /* Handle a user-specified function alignment.
1319 Note that we still need to align to FUNCTION_BOUNDARY, as above,
1320 because ASM_OUTPUT_MAX_SKIP_ALIGN might not do any alignment at all. */
1321 if (align_functions_log
> align
1322 && cfun
->function_frequency
!= FUNCTION_FREQUENCY_UNLIKELY_EXECUTED
)
1324 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
1325 ASM_OUTPUT_MAX_SKIP_ALIGN (asm_out_file
,
1326 align_functions_log
, align_functions
- 1);
1328 ASM_OUTPUT_ALIGN (asm_out_file
, align_functions_log
);
1332 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
1333 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file
, fnname
);
1336 (*debug_hooks
->begin_function
) (decl
);
1338 /* Make function name accessible from other files, if appropriate. */
1340 if (TREE_PUBLIC (decl
))
1342 notice_global_symbol (decl
);
1344 globalize_decl (decl
);
1346 maybe_assemble_visibility (decl
);
1349 if (DECL_PRESERVE_P (decl
))
1350 targetm
.asm_out
.mark_decl_preserved (fnname
);
1352 /* Do any machine/system dependent processing of the function name. */
1353 #ifdef ASM_DECLARE_FUNCTION_NAME
1354 ASM_DECLARE_FUNCTION_NAME (asm_out_file
, fnname
, current_function_decl
);
1356 /* Standard thing is just output label for the function. */
1357 ASM_OUTPUT_LABEL (asm_out_file
, fnname
);
1358 #endif /* ASM_DECLARE_FUNCTION_NAME */
1360 insert_section_boundary_note ();
1363 /* Output assembler code associated with defining the size of the
1364 function. DECL describes the function. NAME is the function's name. */
1367 assemble_end_function (tree decl
, const char *fnname
)
1369 enum in_section save_text_section
;
1370 #ifdef ASM_DECLARE_FUNCTION_SIZE
1371 ASM_DECLARE_FUNCTION_SIZE (asm_out_file
, fnname
, decl
);
1373 if (! CONSTANT_POOL_BEFORE_FUNCTION
)
1375 output_constant_pool (fnname
, decl
);
1376 function_section (decl
); /* need to switch back */
1378 /* Output labels for end of hot/cold text sections (to be used by
1380 save_text_section
= in_section
;
1381 unlikely_text_section ();
1382 ASM_OUTPUT_LABEL (asm_out_file
, cold_section_end_label
);
1384 ASM_OUTPUT_LABEL (asm_out_file
, hot_section_end_label
);
1385 if (save_text_section
== in_unlikely_executed_text
)
1386 unlikely_text_section ();
1389 /* Assemble code to leave SIZE bytes of zeros. */
1392 assemble_zeros (unsigned HOST_WIDE_INT size
)
1394 /* Do no output if -fsyntax-only. */
1395 if (flag_syntax_only
)
1398 #ifdef ASM_NO_SKIP_IN_TEXT
1399 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
1400 so we must output 0s explicitly in the text section. */
1401 if ((ASM_NO_SKIP_IN_TEXT
&& in_text_section ())
1402 || (ASM_NO_SKIP_IN_TEXT
&& in_unlikely_text_section ()))
1404 unsigned HOST_WIDE_INT i
;
1405 for (i
= 0; i
< size
; i
++)
1406 assemble_integer (const0_rtx
, 1, BITS_PER_UNIT
, 1);
1411 ASM_OUTPUT_SKIP (asm_out_file
, size
);
1414 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
1417 assemble_align (int align
)
1419 if (align
> BITS_PER_UNIT
)
1421 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
1425 /* Assemble a string constant with the specified C string as contents. */
1428 assemble_string (const char *p
, int size
)
1433 /* If the string is very long, split it up. */
1437 int thissize
= size
- pos
;
1438 if (thissize
> maximum
)
1441 ASM_OUTPUT_ASCII (asm_out_file
, p
, thissize
);
1449 #if defined ASM_OUTPUT_ALIGNED_DECL_LOCAL
1450 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1451 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1453 #if defined ASM_OUTPUT_ALIGNED_LOCAL
1454 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1455 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, DECL_ALIGN (decl))
1457 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1458 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded)
1462 #if defined ASM_OUTPUT_ALIGNED_BSS
1463 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1464 ASM_OUTPUT_ALIGNED_BSS (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1466 #if defined ASM_OUTPUT_BSS
1467 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1468 ASM_OUTPUT_BSS (asm_out_file, decl, name, size, rounded)
1474 #if defined ASM_OUTPUT_ALIGNED_DECL_COMMON
1475 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1476 ASM_OUTPUT_ALIGNED_DECL_COMMON (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1478 #if defined ASM_OUTPUT_ALIGNED_COMMON
1479 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1480 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file, name, size, DECL_ALIGN (decl))
1482 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1483 ASM_OUTPUT_COMMON (asm_out_file, name, size, rounded)
1488 asm_emit_uninitialised (tree decl
, const char *name
,
1489 unsigned HOST_WIDE_INT size ATTRIBUTE_UNUSED
,
1490 unsigned HOST_WIDE_INT rounded ATTRIBUTE_UNUSED
)
1498 destination
= asm_dest_local
;
1500 /* ??? We should handle .bss via select_section mechanisms rather than
1501 via special target hooks. That would eliminate this special case. */
1502 if (TREE_PUBLIC (decl
))
1504 if (!DECL_COMMON (decl
))
1506 destination
= asm_dest_bss
;
1511 destination
= asm_dest_common
;
1514 if (destination
!= asm_dest_common
)
1516 resolve_unique_section (decl
, 0, flag_data_sections
);
1517 /* Custom sections don't belong here. */
1518 if (DECL_SECTION_NAME (decl
))
1522 if (destination
== asm_dest_bss
)
1523 globalize_decl (decl
);
1525 if (flag_shared_data
)
1527 switch (destination
)
1529 #ifdef ASM_OUTPUT_SHARED_BSS
1531 ASM_OUTPUT_SHARED_BSS (asm_out_file
, decl
, name
, size
, rounded
);
1534 #ifdef ASM_OUTPUT_SHARED_COMMON
1535 case asm_dest_common
:
1536 ASM_OUTPUT_SHARED_COMMON (asm_out_file
, name
, size
, rounded
);
1539 #ifdef ASM_OUTPUT_SHARED_LOCAL
1540 case asm_dest_local
:
1541 ASM_OUTPUT_SHARED_LOCAL (asm_out_file
, name
, size
, rounded
);
1549 switch (destination
)
1553 ASM_EMIT_BSS (decl
, name
, size
, rounded
);
1556 case asm_dest_common
:
1557 ASM_EMIT_COMMON (decl
, name
, size
, rounded
);
1559 case asm_dest_local
:
1560 ASM_EMIT_LOCAL (decl
, name
, size
, rounded
);
1569 /* Assemble everything that is needed for a variable or function declaration.
1570 Not used for automatic variables, and not used for function definitions.
1571 Should not be called for variables of incomplete structure type.
1573 TOP_LEVEL is nonzero if this variable has file scope.
1574 AT_END is nonzero if this is the special handling, at end of compilation,
1575 to define things that have had only tentative definitions.
1576 DONT_OUTPUT_DATA if nonzero means don't actually output the
1577 initial value (that will be done by the caller). */
1580 assemble_variable (tree decl
, int top_level ATTRIBUTE_UNUSED
,
1581 int at_end ATTRIBUTE_UNUSED
, int dont_output_data
)
1588 if (lang_hooks
.decls
.prepare_assemble_variable
)
1589 lang_hooks
.decls
.prepare_assemble_variable (decl
);
1591 last_assemble_variable_decl
= 0;
1593 /* Normally no need to say anything here for external references,
1594 since assemble_external is called by the language-specific code
1595 when a declaration is first seen. */
1597 if (DECL_EXTERNAL (decl
))
1600 /* Output no assembler code for a function declaration.
1601 Only definitions of functions output anything. */
1603 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1606 /* Do nothing for global register variables. */
1607 if (DECL_RTL_SET_P (decl
) && REG_P (DECL_RTL (decl
)))
1609 TREE_ASM_WRITTEN (decl
) = 1;
1613 /* If type was incomplete when the variable was declared,
1614 see if it is complete now. */
1616 if (DECL_SIZE (decl
) == 0)
1617 layout_decl (decl
, 0);
1619 /* Still incomplete => don't allocate it; treat the tentative defn
1620 (which is what it must have been) as an `extern' reference. */
1622 if (!dont_output_data
&& DECL_SIZE (decl
) == 0)
1624 error ("%Jstorage size of %qD isn%'t known", decl
, decl
);
1625 TREE_ASM_WRITTEN (decl
) = 1;
1629 /* The first declaration of a variable that comes through this function
1630 decides whether it is global (in C, has external linkage)
1631 or local (in C, has internal linkage). So do nothing more
1632 if this function has already run. */
1634 if (TREE_ASM_WRITTEN (decl
))
1637 /* Make sure targetm.encode_section_info is invoked before we set
1639 decl_rtl
= DECL_RTL (decl
);
1641 TREE_ASM_WRITTEN (decl
) = 1;
1643 /* Do no output if -fsyntax-only. */
1644 if (flag_syntax_only
)
1649 if (! dont_output_data
1650 && ! host_integerp (DECL_SIZE_UNIT (decl
), 1))
1652 error ("%Jsize of variable %qD is too large", decl
, decl
);
1656 name
= XSTR (XEXP (decl_rtl
, 0), 0);
1657 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
))
1658 notice_global_symbol (decl
);
1660 /* Compute the alignment of this data. */
1662 align
= DECL_ALIGN (decl
);
1664 /* In the case for initialing an array whose length isn't specified,
1665 where we have not yet been able to do the layout,
1666 figure out the proper alignment now. */
1667 if (dont_output_data
&& DECL_SIZE (decl
) == 0
1668 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
)
1669 align
= MAX (align
, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl
))));
1671 /* Some object file formats have a maximum alignment which they support.
1672 In particular, a.out format supports a maximum alignment of 4. */
1673 if (align
> MAX_OFILE_ALIGNMENT
)
1675 warning ("%Jalignment of %qD is greater than maximum object "
1676 "file alignment. Using %d", decl
, decl
,
1677 MAX_OFILE_ALIGNMENT
/BITS_PER_UNIT
);
1678 align
= MAX_OFILE_ALIGNMENT
;
1681 /* On some machines, it is good to increase alignment sometimes. */
1682 if (! DECL_USER_ALIGN (decl
))
1684 #ifdef DATA_ALIGNMENT
1685 align
= DATA_ALIGNMENT (TREE_TYPE (decl
), align
);
1687 #ifdef CONSTANT_ALIGNMENT
1688 if (DECL_INITIAL (decl
) != 0 && DECL_INITIAL (decl
) != error_mark_node
)
1689 align
= CONSTANT_ALIGNMENT (DECL_INITIAL (decl
), align
);
1693 /* Reset the alignment in case we have made it tighter, so we can benefit
1694 from it in get_pointer_alignment. */
1695 DECL_ALIGN (decl
) = align
;
1696 set_mem_align (decl_rtl
, align
);
1698 if (TREE_PUBLIC (decl
))
1699 maybe_assemble_visibility (decl
);
1701 if (DECL_PRESERVE_P (decl
))
1702 targetm
.asm_out
.mark_decl_preserved (name
);
1704 /* Handle uninitialized definitions. */
1706 /* If the decl has been given an explicit section name, then it
1707 isn't common, and shouldn't be handled as such. */
1708 if (DECL_SECTION_NAME (decl
) || dont_output_data
)
1710 /* We don't implement common thread-local data at present. */
1711 else if (DECL_THREAD_LOCAL (decl
))
1713 if (DECL_COMMON (decl
))
1714 sorry ("thread-local COMMON data not implemented");
1716 else if (DECL_INITIAL (decl
) == 0
1717 || DECL_INITIAL (decl
) == error_mark_node
1718 || (flag_zero_initialized_in_bss
1719 /* Leave constant zeroes in .rodata so they can be shared. */
1720 && !TREE_READONLY (decl
)
1721 && initializer_zerop (DECL_INITIAL (decl
))))
1723 unsigned HOST_WIDE_INT size
= tree_low_cst (DECL_SIZE_UNIT (decl
), 1);
1724 unsigned HOST_WIDE_INT rounded
= size
;
1726 /* Don't allocate zero bytes of common,
1727 since that means "undefined external" in the linker. */
1731 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1732 so that each uninitialized object starts on such a boundary. */
1733 rounded
+= (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1;
1734 rounded
= (rounded
/ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1735 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1737 #if !defined(ASM_OUTPUT_ALIGNED_COMMON) && !defined(ASM_OUTPUT_ALIGNED_DECL_COMMON) && !defined(ASM_OUTPUT_ALIGNED_BSS)
1738 if ((unsigned HOST_WIDE_INT
) DECL_ALIGN_UNIT (decl
) > rounded
)
1739 warning ("%Jrequested alignment for %qD is greater than "
1740 "implemented alignment of %d", decl
, decl
, rounded
);
1743 /* If the target cannot output uninitialized but not common global data
1744 in .bss, then we have to use .data, so fall through. */
1745 if (asm_emit_uninitialised (decl
, name
, size
, rounded
))
1749 /* Handle initialized definitions.
1750 Also handle uninitialized global definitions if -fno-common and the
1751 target doesn't support ASM_OUTPUT_BSS. */
1753 /* First make the assembler name(s) global if appropriate. */
1754 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
))
1755 globalize_decl (decl
);
1757 /* Output any data that we will need to use the address of. */
1758 if (DECL_INITIAL (decl
) == error_mark_node
)
1759 reloc
= contains_pointers_p (TREE_TYPE (decl
)) ? 3 : 0;
1760 else if (DECL_INITIAL (decl
))
1762 reloc
= compute_reloc_for_constant (DECL_INITIAL (decl
));
1763 output_addressed_constants (DECL_INITIAL (decl
));
1766 /* Switch to the appropriate section. */
1767 resolve_unique_section (decl
, reloc
, flag_data_sections
);
1768 variable_section (decl
, reloc
);
1770 /* dbxout.c needs to know this. */
1771 if (in_text_section () || in_unlikely_text_section ())
1772 DECL_IN_TEXT_SECTION (decl
) = 1;
1774 /* Output the alignment of this data. */
1775 if (align
> BITS_PER_UNIT
)
1776 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (DECL_ALIGN_UNIT (decl
)));
1778 /* Do any machine/system dependent processing of the object. */
1779 #ifdef ASM_DECLARE_OBJECT_NAME
1780 last_assemble_variable_decl
= decl
;
1781 ASM_DECLARE_OBJECT_NAME (asm_out_file
, name
, decl
);
1783 /* Standard thing is just output label for the object. */
1784 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1785 #endif /* ASM_DECLARE_OBJECT_NAME */
1787 if (!dont_output_data
)
1789 if (DECL_INITIAL (decl
)
1790 && DECL_INITIAL (decl
) != error_mark_node
1791 && !initializer_zerop (DECL_INITIAL (decl
)))
1792 /* Output the actual data. */
1793 output_constant (DECL_INITIAL (decl
),
1794 tree_low_cst (DECL_SIZE_UNIT (decl
), 1),
1797 /* Leave space for it. */
1798 assemble_zeros (tree_low_cst (DECL_SIZE_UNIT (decl
), 1));
1802 /* Return 1 if type TYPE contains any pointers. */
1805 contains_pointers_p (tree type
)
1807 switch (TREE_CODE (type
))
1810 case REFERENCE_TYPE
:
1811 /* I'm not sure whether OFFSET_TYPE needs this treatment,
1812 so I'll play safe and return 1. */
1818 case QUAL_UNION_TYPE
:
1821 /* For a type that has fields, see if the fields have pointers. */
1822 for (fields
= TYPE_FIELDS (type
); fields
; fields
= TREE_CHAIN (fields
))
1823 if (TREE_CODE (fields
) == FIELD_DECL
1824 && contains_pointers_p (TREE_TYPE (fields
)))
1830 /* An array type contains pointers if its element type does. */
1831 return contains_pointers_p (TREE_TYPE (type
));
1838 /* In unit-at-a-time mode, we delay assemble_external processing until
1839 the compilation unit is finalized. This is the best we can do for
1840 right now (i.e. stage 3 of GCC 4.0) - the right thing is to delay
1841 it all the way to final. See PR 17982 for further discussion. */
1842 static GTY(()) tree pending_assemble_externals
;
1844 #ifdef ASM_OUTPUT_EXTERNAL
1845 /* True if DECL is a function decl for which no out-of-line copy exists.
1846 It is assumed that DECL's assembler name has been set. */
1849 incorporeal_function_p (tree decl
)
1851 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_BUILT_IN (decl
))
1855 if (DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
1856 && DECL_FUNCTION_CODE (decl
) == BUILT_IN_ALLOCA
)
1859 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
1860 if (strncmp (name
, "__builtin_", strlen ("__builtin_")) == 0)
1866 /* Actually do the tests to determine if this is necessary, and invoke
1867 ASM_OUTPUT_EXTERNAL. */
1869 assemble_external_real (tree decl
)
1871 rtx rtl
= DECL_RTL (decl
);
1873 if (MEM_P (rtl
) && GET_CODE (XEXP (rtl
, 0)) == SYMBOL_REF
1874 && !SYMBOL_REF_USED (XEXP (rtl
, 0))
1875 && !incorporeal_function_p (decl
))
1877 /* Some systems do require some output. */
1878 SYMBOL_REF_USED (XEXP (rtl
, 0)) = 1;
1879 ASM_OUTPUT_EXTERNAL (asm_out_file
, decl
, XSTR (XEXP (rtl
, 0), 0));
1885 process_pending_assemble_externals (void)
1887 #ifdef ASM_OUTPUT_EXTERNAL
1889 for (list
= pending_assemble_externals
; list
; list
= TREE_CHAIN (list
))
1890 assemble_external_real (TREE_VALUE (list
));
1892 pending_assemble_externals
= 0;
1896 /* Output something to declare an external symbol to the assembler.
1897 (Most assemblers don't need this, so we normally output nothing.)
1898 Do nothing if DECL is not external. */
1901 assemble_external (tree decl ATTRIBUTE_UNUSED
)
1903 /* Because most platforms do not define ASM_OUTPUT_EXTERNAL, the
1904 main body of this code is only rarely exercised. To provide some
1905 testing, on all platforms, we make sure that the ASM_OUT_FILE is
1906 open. If it's not, we should not be calling this function. */
1907 gcc_assert (asm_out_file
);
1909 #ifdef ASM_OUTPUT_EXTERNAL
1910 if (!DECL_P (decl
) || !DECL_EXTERNAL (decl
) || !TREE_PUBLIC (decl
))
1913 if (flag_unit_at_a_time
)
1914 pending_assemble_externals
= tree_cons (0, decl
,
1915 pending_assemble_externals
);
1917 assemble_external_real (decl
);
1921 /* Similar, for calling a library function FUN. */
1924 assemble_external_libcall (rtx fun
)
1926 /* Declare library function name external when first used, if nec. */
1927 if (! SYMBOL_REF_USED (fun
))
1929 SYMBOL_REF_USED (fun
) = 1;
1930 targetm
.asm_out
.external_libcall (fun
);
1934 /* Assemble a label named NAME. */
1937 assemble_label (const char *name
)
1939 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1942 /* Set the symbol_referenced flag for ID. */
1944 mark_referenced (tree id
)
1946 TREE_SYMBOL_REFERENCED (id
) = 1;
1949 /* Set the symbol_referenced flag for DECL and notify callgraph. */
1951 mark_decl_referenced (tree decl
)
1953 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1955 /* Extern inline functions don't become needed when referenced. */
1956 if (!DECL_EXTERNAL (decl
))
1957 cgraph_mark_needed_node (cgraph_node (decl
));
1959 else if (TREE_CODE (decl
) == VAR_DECL
)
1961 struct cgraph_varpool_node
*node
= cgraph_varpool_node (decl
);
1962 cgraph_varpool_mark_needed_node (node
);
1963 /* C++ frontend use mark_decl_references to force COMDAT variables
1964 to be output that might appear dead otherwise. */
1965 node
->force_output
= true;
1967 /* else do nothing - we can get various sorts of CST nodes here,
1968 which do not need to be marked. */
1971 /* Output to FILE (an assembly file) a reference to NAME. If NAME
1972 starts with a *, the rest of NAME is output verbatim. Otherwise
1973 NAME is transformed in a target-specific way (usually by the
1974 addition of an underscore). */
1977 assemble_name_raw (FILE *file
, const char *name
)
1980 fputs (&name
[1], file
);
1982 ASM_OUTPUT_LABELREF (file
, name
);
1985 /* Like assemble_name_raw, but should be used when NAME might refer to
1986 an entity that is also represented as a tree (like a function or
1987 variable). If NAME does refer to such an entity, that entity will
1988 be marked as referenced. */
1991 assemble_name (FILE *file
, const char *name
)
1993 const char *real_name
;
1996 real_name
= targetm
.strip_name_encoding (name
);
1998 id
= maybe_get_identifier (real_name
);
2000 mark_referenced (id
);
2002 assemble_name_raw (file
, name
);
2005 /* Allocate SIZE bytes writable static space with a gensym name
2006 and return an RTX to refer to its address. */
2009 assemble_static_space (unsigned HOST_WIDE_INT size
)
2012 const char *namestring
;
2016 if (flag_shared_data
)
2020 ASM_GENERATE_INTERNAL_LABEL (name
, "LF", const_labelno
);
2022 namestring
= ggc_strdup (name
);
2024 x
= gen_rtx_SYMBOL_REF (Pmode
, namestring
);
2025 SYMBOL_REF_FLAGS (x
) = SYMBOL_FLAG_LOCAL
;
2027 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
2028 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file
, NULL_TREE
, name
, size
,
2031 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
2032 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file
, name
, size
, BIGGEST_ALIGNMENT
);
2035 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
2036 so that each uninitialized object starts on such a boundary. */
2037 /* Variable `rounded' might or might not be used in ASM_OUTPUT_LOCAL. */
2038 unsigned HOST_WIDE_INT rounded ATTRIBUTE_UNUSED
2039 = ((size
+ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1)
2040 / (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
2041 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
2042 ASM_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
2049 /* Assemble the static constant template for function entry trampolines.
2050 This is done at most once per compilation.
2051 Returns an RTX for the address of the template. */
2053 static GTY(()) rtx initial_trampoline
;
2055 #ifdef TRAMPOLINE_TEMPLATE
2057 assemble_trampoline_template (void)
2064 if (initial_trampoline
)
2065 return initial_trampoline
;
2067 /* By default, put trampoline templates in read-only data section. */
2069 #ifdef TRAMPOLINE_SECTION
2070 TRAMPOLINE_SECTION ();
2072 readonly_data_section ();
2075 /* Write the assembler code to define one. */
2076 align
= floor_log2 (TRAMPOLINE_ALIGNMENT
/ BITS_PER_UNIT
);
2079 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
2082 targetm
.asm_out
.internal_label (asm_out_file
, "LTRAMP", 0);
2083 TRAMPOLINE_TEMPLATE (asm_out_file
);
2085 /* Record the rtl to refer to it. */
2086 ASM_GENERATE_INTERNAL_LABEL (label
, "LTRAMP", 0);
2087 name
= ggc_strdup (label
);
2088 symbol
= gen_rtx_SYMBOL_REF (Pmode
, name
);
2089 SYMBOL_REF_FLAGS (symbol
) = SYMBOL_FLAG_LOCAL
;
2091 initial_trampoline
= gen_rtx_MEM (BLKmode
, symbol
);
2092 set_mem_align (initial_trampoline
, TRAMPOLINE_ALIGNMENT
);
2094 return initial_trampoline
;
2098 /* A and B are either alignments or offsets. Return the minimum alignment
2099 that may be assumed after adding the two together. */
2101 static inline unsigned
2102 min_align (unsigned int a
, unsigned int b
)
2104 return (a
| b
) & -(a
| b
);
2107 /* Return the assembler directive for creating a given kind of integer
2108 object. SIZE is the number of bytes in the object and ALIGNED_P
2109 indicates whether it is known to be aligned. Return NULL if the
2110 assembly dialect has no such directive.
2112 The returned string should be printed at the start of a new line and
2113 be followed immediately by the object's initial value. */
2116 integer_asm_op (int size
, int aligned_p
)
2118 struct asm_int_op
*ops
;
2121 ops
= &targetm
.asm_out
.aligned_op
;
2123 ops
= &targetm
.asm_out
.unaligned_op
;
2128 return targetm
.asm_out
.byte_op
;
2142 /* Use directive OP to assemble an integer object X. Print OP at the
2143 start of the line, followed immediately by the value of X. */
2146 assemble_integer_with_op (const char *op
, rtx x
)
2148 fputs (op
, asm_out_file
);
2149 output_addr_const (asm_out_file
, x
);
2150 fputc ('\n', asm_out_file
);
2153 /* The default implementation of the asm_out.integer target hook. */
2156 default_assemble_integer (rtx x ATTRIBUTE_UNUSED
,
2157 unsigned int size ATTRIBUTE_UNUSED
,
2158 int aligned_p ATTRIBUTE_UNUSED
)
2160 const char *op
= integer_asm_op (size
, aligned_p
);
2161 /* Avoid GAS bugs for large values. Specifically negative values whose
2162 absolute value fits in a bfd_vma, but not in a bfd_signed_vma. */
2163 if (size
> UNITS_PER_WORD
&& size
> POINTER_SIZE
/ BITS_PER_UNIT
)
2165 return op
&& (assemble_integer_with_op (op
, x
), true);
2168 /* Assemble the integer constant X into an object of SIZE bytes. ALIGN is
2169 the alignment of the integer in bits. Return 1 if we were able to output
2170 the constant, otherwise 0. If FORCE is nonzero, abort if we can't output
2174 assemble_integer (rtx x
, unsigned int size
, unsigned int align
, int force
)
2178 aligned_p
= (align
>= MIN (size
* BITS_PER_UNIT
, BIGGEST_ALIGNMENT
));
2180 /* See if the target hook can handle this kind of object. */
2181 if (targetm
.asm_out
.integer (x
, size
, aligned_p
))
2184 /* If the object is a multi-byte one, try splitting it up. Split
2185 it into words it if is multi-word, otherwise split it into bytes. */
2188 enum machine_mode omode
, imode
;
2189 unsigned int subalign
;
2190 unsigned int subsize
, i
;
2192 subsize
= size
> UNITS_PER_WORD
? UNITS_PER_WORD
: 1;
2193 subalign
= MIN (align
, subsize
* BITS_PER_UNIT
);
2194 omode
= mode_for_size (subsize
* BITS_PER_UNIT
, MODE_INT
, 0);
2195 imode
= mode_for_size (size
* BITS_PER_UNIT
, MODE_INT
, 0);
2197 for (i
= 0; i
< size
; i
+= subsize
)
2199 rtx partial
= simplify_subreg (omode
, x
, imode
, i
);
2200 if (!partial
|| !assemble_integer (partial
, subsize
, subalign
, 0))
2206 /* If we've printed some of it, but not all of it, there's no going
2211 gcc_assert (!force
);
2217 assemble_real (REAL_VALUE_TYPE d
, enum machine_mode mode
, unsigned int align
)
2221 int bitsize
, nelts
, nunits
, units_per
;
2223 /* This is hairy. We have a quantity of known size. real_to_target
2224 will put it into an array of *host* longs, 32 bits per element
2225 (even if long is more than 32 bits). We need to determine the
2226 number of array elements that are occupied (nelts) and the number
2227 of *target* min-addressable units that will be occupied in the
2228 object file (nunits). We cannot assume that 32 divides the
2229 mode's bitsize (size * BITS_PER_UNIT) evenly.
2231 size * BITS_PER_UNIT is used here to make sure that padding bits
2232 (which might appear at either end of the value; real_to_target
2233 will include the padding bits in its output array) are included. */
2235 nunits
= GET_MODE_SIZE (mode
);
2236 bitsize
= nunits
* BITS_PER_UNIT
;
2237 nelts
= CEIL (bitsize
, 32);
2238 units_per
= 32 / BITS_PER_UNIT
;
2240 real_to_target (data
, &d
, mode
);
2242 /* Put out the first word with the specified alignment. */
2243 assemble_integer (GEN_INT (data
[0]), MIN (nunits
, units_per
), align
, 1);
2244 nunits
-= units_per
;
2246 /* Subsequent words need only 32-bit alignment. */
2247 align
= min_align (align
, 32);
2249 for (i
= 1; i
< nelts
; i
++)
2251 assemble_integer (GEN_INT (data
[i
]), MIN (nunits
, units_per
), align
, 1);
2252 nunits
-= units_per
;
2256 /* Given an expression EXP with a constant value,
2257 reduce it to the sum of an assembler symbol and an integer.
2258 Store them both in the structure *VALUE.
2259 Abort if EXP does not reduce. */
2261 struct addr_const
GTY(())
2264 HOST_WIDE_INT offset
;
2268 decode_addr_const (tree exp
, struct addr_const
*value
)
2270 tree target
= TREE_OPERAND (exp
, 0);
2276 if (TREE_CODE (target
) == COMPONENT_REF
2277 && host_integerp (byte_position (TREE_OPERAND (target
, 1)), 0))
2280 offset
+= int_byte_position (TREE_OPERAND (target
, 1));
2281 target
= TREE_OPERAND (target
, 0);
2283 else if (TREE_CODE (target
) == ARRAY_REF
2284 || TREE_CODE (target
) == ARRAY_RANGE_REF
)
2286 offset
+= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (target
)), 1)
2287 * tree_low_cst (TREE_OPERAND (target
, 1), 0));
2288 target
= TREE_OPERAND (target
, 0);
2294 switch (TREE_CODE (target
))
2298 x
= DECL_RTL (target
);
2302 x
= gen_rtx_MEM (FUNCTION_MODE
,
2303 gen_rtx_LABEL_REF (VOIDmode
, force_label_rtx (target
)));
2311 x
= output_constant_def (target
, 1);
2318 gcc_assert (MEM_P (x
));
2322 value
->offset
= offset
;
2325 /* Uniquize all constants that appear in memory.
2326 Each constant in memory thus far output is recorded
2327 in `const_desc_table'. */
2329 struct constant_descriptor_tree
GTY(())
2331 /* A MEM for the constant. */
2334 /* The value of the constant. */
2338 static GTY((param_is (struct constant_descriptor_tree
)))
2339 htab_t const_desc_htab
;
2341 static struct constant_descriptor_tree
* build_constant_desc (tree
);
2342 static void maybe_output_constant_def_contents (struct constant_descriptor_tree
*, int);
2344 /* Compute a hash code for a constant expression. */
2347 const_desc_hash (const void *ptr
)
2349 return const_hash_1 (((struct constant_descriptor_tree
*)ptr
)->value
);
2353 const_hash_1 (const tree exp
)
2358 enum tree_code code
= TREE_CODE (exp
);
2360 /* Either set P and LEN to the address and len of something to hash and
2361 exit the switch or return a value. */
2366 p
= (char *) &TREE_INT_CST (exp
);
2367 len
= sizeof TREE_INT_CST (exp
);
2371 return real_hash (TREE_REAL_CST_PTR (exp
));
2374 p
= TREE_STRING_POINTER (exp
);
2375 len
= TREE_STRING_LENGTH (exp
);
2379 return (const_hash_1 (TREE_REALPART (exp
)) * 5
2380 + const_hash_1 (TREE_IMAGPART (exp
)));
2386 hi
= 5 + int_size_in_bytes (TREE_TYPE (exp
));
2388 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2389 if (TREE_VALUE (link
))
2390 hi
= hi
* 603 + const_hash_1 (TREE_VALUE (link
));
2398 struct addr_const value
;
2400 decode_addr_const (exp
, &value
);
2401 switch (GET_CODE (value
.base
))
2404 /* Don't hash the address of the SYMBOL_REF;
2405 only use the offset and the symbol name. */
2407 p
= XSTR (value
.base
, 0);
2408 for (i
= 0; p
[i
] != 0; i
++)
2409 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2413 hi
= value
.offset
+ CODE_LABEL_NUMBER (XEXP (value
.base
, 0)) * 13;
2424 return (const_hash_1 (TREE_OPERAND (exp
, 0)) * 9
2425 + const_hash_1 (TREE_OPERAND (exp
, 1)));
2429 case NON_LVALUE_EXPR
:
2430 return const_hash_1 (TREE_OPERAND (exp
, 0)) * 7 + 2;
2433 /* A language specific constant. Just hash the code. */
2437 /* Compute hashing function. */
2439 for (i
= 0; i
< len
; i
++)
2440 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2445 /* Wrapper of compare_constant, for the htab interface. */
2447 const_desc_eq (const void *p1
, const void *p2
)
2449 return compare_constant (((struct constant_descriptor_tree
*)p1
)->value
,
2450 ((struct constant_descriptor_tree
*)p2
)->value
);
2453 /* Compare t1 and t2, and return 1 only if they are known to result in
2454 the same bit pattern on output. */
2457 compare_constant (const tree t1
, const tree t2
)
2459 enum tree_code typecode
;
2461 if (t1
== NULL_TREE
)
2462 return t2
== NULL_TREE
;
2463 if (t2
== NULL_TREE
)
2466 if (TREE_CODE (t1
) != TREE_CODE (t2
))
2469 switch (TREE_CODE (t1
))
2472 /* Integer constants are the same only if the same width of type. */
2473 if (TYPE_PRECISION (TREE_TYPE (t1
)) != TYPE_PRECISION (TREE_TYPE (t2
)))
2475 return tree_int_cst_equal (t1
, t2
);
2478 /* Real constants are the same only if the same width of type. */
2479 if (TYPE_PRECISION (TREE_TYPE (t1
)) != TYPE_PRECISION (TREE_TYPE (t2
)))
2482 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
2485 if (TYPE_MODE (TREE_TYPE (t1
)) != TYPE_MODE (TREE_TYPE (t2
)))
2488 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
2489 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
2490 TREE_STRING_LENGTH (t1
)));
2493 return (compare_constant (TREE_REALPART (t1
), TREE_REALPART (t2
))
2494 && compare_constant (TREE_IMAGPART (t1
), TREE_IMAGPART (t2
)));
2500 typecode
= TREE_CODE (TREE_TYPE (t1
));
2501 if (typecode
!= TREE_CODE (TREE_TYPE (t2
)))
2504 if (typecode
== ARRAY_TYPE
)
2506 HOST_WIDE_INT size_1
= int_size_in_bytes (TREE_TYPE (t1
));
2507 /* For arrays, check that the sizes all match. */
2508 if (TYPE_MODE (TREE_TYPE (t1
)) != TYPE_MODE (TREE_TYPE (t2
))
2510 || size_1
!= int_size_in_bytes (TREE_TYPE (t2
)))
2515 /* For record and union constructors, require exact type
2517 if (TREE_TYPE (t1
) != TREE_TYPE (t2
))
2521 for (l1
= CONSTRUCTOR_ELTS (t1
), l2
= CONSTRUCTOR_ELTS (t2
);
2523 l1
= TREE_CHAIN (l1
), l2
= TREE_CHAIN (l2
))
2525 /* Check that each value is the same... */
2526 if (! compare_constant (TREE_VALUE (l1
), TREE_VALUE (l2
)))
2528 /* ... and that they apply to the same fields! */
2529 if (typecode
== ARRAY_TYPE
)
2531 if (! compare_constant (TREE_PURPOSE (l1
),
2537 if (TREE_PURPOSE (l1
) != TREE_PURPOSE (l2
))
2542 return l1
== NULL_TREE
&& l2
== NULL_TREE
;
2548 struct addr_const value1
, value2
;
2550 decode_addr_const (t1
, &value1
);
2551 decode_addr_const (t2
, &value2
);
2552 return (value1
.offset
== value2
.offset
2553 && strcmp (XSTR (value1
.base
, 0), XSTR (value2
.base
, 0)) == 0);
2559 return (compare_constant (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0))
2560 && compare_constant(TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1)));
2564 case NON_LVALUE_EXPR
:
2565 case VIEW_CONVERT_EXPR
:
2566 return compare_constant (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
2571 nt1
= lang_hooks
.expand_constant (t1
);
2572 nt2
= lang_hooks
.expand_constant (t2
);
2573 if (nt1
!= t1
|| nt2
!= t2
)
2574 return compare_constant (nt1
, nt2
);
2583 /* Make a copy of the whole tree structure for a constant. This
2584 handles the same types of nodes that compare_constant handles. */
2587 copy_constant (tree exp
)
2589 switch (TREE_CODE (exp
))
2592 /* For ADDR_EXPR, we do not want to copy the decl whose address
2593 is requested. We do want to copy constants though. */
2594 if (CONSTANT_CLASS_P (TREE_OPERAND (exp
, 0)))
2595 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2596 copy_constant (TREE_OPERAND (exp
, 0)));
2598 return copy_node (exp
);
2603 return copy_node (exp
);
2606 return build_complex (TREE_TYPE (exp
),
2607 copy_constant (TREE_REALPART (exp
)),
2608 copy_constant (TREE_IMAGPART (exp
)));
2612 return build2 (TREE_CODE (exp
), TREE_TYPE (exp
),
2613 copy_constant (TREE_OPERAND (exp
, 0)),
2614 copy_constant (TREE_OPERAND (exp
, 1)));
2618 case NON_LVALUE_EXPR
:
2619 case VIEW_CONVERT_EXPR
:
2620 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2621 copy_constant (TREE_OPERAND (exp
, 0)));
2625 tree copy
= copy_node (exp
);
2626 tree list
= copy_list (CONSTRUCTOR_ELTS (exp
));
2629 CONSTRUCTOR_ELTS (copy
) = list
;
2630 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
2631 TREE_VALUE (tail
) = copy_constant (TREE_VALUE (tail
));
2638 tree t
= lang_hooks
.expand_constant (exp
);
2640 gcc_assert (t
== exp
);
2641 return copy_constant (t
);
2646 /* Subroutine of output_constant_def:
2647 No constant equal to EXP is known to have been output.
2648 Make a constant descriptor to enter EXP in the hash table.
2649 Assign the label number and construct RTL to refer to the
2650 constant's location in memory.
2651 Caller is responsible for updating the hash table. */
2653 static struct constant_descriptor_tree
*
2654 build_constant_desc (tree exp
)
2660 struct constant_descriptor_tree
*desc
;
2662 desc
= ggc_alloc (sizeof (*desc
));
2663 desc
->value
= copy_constant (exp
);
2665 /* Propagate marked-ness to copied constant. */
2666 if (flag_mudflap
&& mf_marked_p (exp
))
2667 mf_mark (desc
->value
);
2669 /* Create a string containing the label name, in LABEL. */
2670 labelno
= const_labelno
++;
2671 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", labelno
);
2673 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
2674 symbol
= gen_rtx_SYMBOL_REF (Pmode
, ggc_strdup (label
));
2675 SYMBOL_REF_FLAGS (symbol
) = SYMBOL_FLAG_LOCAL
;
2676 SYMBOL_REF_DECL (symbol
) = desc
->value
;
2677 TREE_CONSTANT_POOL_ADDRESS_P (symbol
) = 1;
2679 rtl
= gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp
)), symbol
);
2680 set_mem_attributes (rtl
, exp
, 1);
2681 set_mem_alias_set (rtl
, 0);
2682 set_mem_alias_set (rtl
, const_alias_set
);
2684 /* Set flags or add text to the name to record information, such as
2685 that it is a local symbol. If the name is changed, the macro
2686 ASM_OUTPUT_LABELREF will have to know how to strip this
2687 information. This call might invalidate our local variable
2688 SYMBOL; we can't use it afterward. */
2690 targetm
.encode_section_info (exp
, rtl
, true);
2697 /* Return an rtx representing a reference to constant data in memory
2698 for the constant expression EXP.
2700 If assembler code for such a constant has already been output,
2701 return an rtx to refer to it.
2702 Otherwise, output such a constant in memory
2703 and generate an rtx for it.
2705 If DEFER is nonzero, this constant can be deferred and output only
2706 if referenced in the function after all optimizations.
2708 `const_desc_table' records which constants already have label strings. */
2711 output_constant_def (tree exp
, int defer
)
2713 struct constant_descriptor_tree
*desc
;
2714 struct constant_descriptor_tree key
;
2717 /* Look up EXP in the table of constant descriptors. If we didn't find
2718 it, create a new one. */
2720 loc
= htab_find_slot (const_desc_htab
, &key
, INSERT
);
2725 desc
= build_constant_desc (exp
);
2729 maybe_output_constant_def_contents (desc
, defer
);
2733 /* Subroutine of output_constant_def: Decide whether or not we need to
2734 output the constant DESC now, and if so, do it. */
2736 maybe_output_constant_def_contents (struct constant_descriptor_tree
*desc
,
2739 rtx symbol
= XEXP (desc
->rtl
, 0);
2740 tree exp
= desc
->value
;
2742 if (flag_syntax_only
)
2745 if (TREE_ASM_WRITTEN (exp
))
2746 /* Already output; don't do it again. */
2749 /* We can always defer constants as long as the context allows
2753 /* Increment n_deferred_constants if it exists. It needs to be at
2754 least as large as the number of constants actually referred to
2755 by the function. If it's too small we'll stop looking too early
2756 and fail to emit constants; if it's too large we'll only look
2757 through the entire function when we could have stopped earlier. */
2759 n_deferred_constants
++;
2763 output_constant_def_contents (symbol
);
2766 /* We must output the constant data referred to by SYMBOL; do so. */
2769 output_constant_def_contents (rtx symbol
)
2771 tree exp
= SYMBOL_REF_DECL (symbol
);
2772 const char *label
= XSTR (symbol
, 0);
2775 /* Make sure any other constants whose addresses appear in EXP
2776 are assigned label numbers. */
2777 int reloc
= compute_reloc_for_constant (exp
);
2779 /* Align the location counter as required by EXP's data type. */
2780 unsigned int align
= TYPE_ALIGN (TREE_TYPE (exp
));
2781 #ifdef CONSTANT_ALIGNMENT
2782 align
= CONSTANT_ALIGNMENT (exp
, align
);
2785 output_addressed_constants (exp
);
2787 /* We are no longer deferring this constant. */
2788 TREE_ASM_WRITTEN (exp
) = 1;
2790 if (IN_NAMED_SECTION (exp
))
2791 named_section (exp
, NULL
, reloc
);
2793 targetm
.asm_out
.select_section (exp
, reloc
, align
);
2795 if (align
> BITS_PER_UNIT
)
2797 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
2800 size
= int_size_in_bytes (TREE_TYPE (exp
));
2801 if (TREE_CODE (exp
) == STRING_CST
)
2802 size
= MAX (TREE_STRING_LENGTH (exp
), size
);
2804 /* Do any machine/system dependent processing of the constant. */
2805 #ifdef ASM_DECLARE_CONSTANT_NAME
2806 ASM_DECLARE_CONSTANT_NAME (asm_out_file
, label
, exp
, size
);
2808 /* Standard thing is just output label for the constant. */
2809 ASM_OUTPUT_LABEL (asm_out_file
, label
);
2810 #endif /* ASM_DECLARE_CONSTANT_NAME */
2812 /* Output the value of EXP. */
2813 output_constant (exp
, size
, align
);
2815 mudflap_enqueue_constant (exp
);
2818 /* Look up EXP in the table of constant descriptors. Return the rtl
2819 if it has been emitted, else null. */
2822 lookup_constant_def (tree exp
)
2824 struct constant_descriptor_tree
*desc
;
2825 struct constant_descriptor_tree key
;
2828 desc
= htab_find (const_desc_htab
, &key
);
2830 return (desc
? desc
->rtl
: NULL_RTX
);
2833 /* Used in the hash tables to avoid outputting the same constant
2834 twice. Unlike 'struct constant_descriptor_tree', RTX constants
2835 are output once per function, not once per file. */
2836 /* ??? Only a few targets need per-function constant pools. Most
2837 can use one per-file pool. Should add a targetm bit to tell the
2840 struct rtx_constant_pool
GTY(())
2842 /* Pointers to first and last constant in pool, as ordered by offset. */
2843 struct constant_descriptor_rtx
*first
;
2844 struct constant_descriptor_rtx
*last
;
2846 /* Hash facility for making memory-constants from constant rtl-expressions.
2847 It is used on RISC machines where immediate integer arguments and
2848 constant addresses are restricted so that such constants must be stored
2850 htab_t
GTY((param_is (struct constant_descriptor_rtx
))) const_rtx_htab
;
2851 htab_t
GTY((param_is (struct constant_descriptor_rtx
))) const_rtx_sym_htab
;
2853 /* Current offset in constant pool (does not include any
2854 machine-specific header). */
2855 HOST_WIDE_INT offset
;
2858 struct constant_descriptor_rtx
GTY((chain_next ("%h.next")))
2860 struct constant_descriptor_rtx
*next
;
2864 HOST_WIDE_INT offset
;
2866 enum machine_mode mode
;
2872 /* Hash and compare functions for const_rtx_htab. */
2875 const_desc_rtx_hash (const void *ptr
)
2877 const struct constant_descriptor_rtx
*desc
= ptr
;
2882 const_desc_rtx_eq (const void *a
, const void *b
)
2884 const struct constant_descriptor_rtx
*x
= a
;
2885 const struct constant_descriptor_rtx
*y
= b
;
2887 if (x
->mode
!= y
->mode
)
2889 return rtx_equal_p (x
->constant
, y
->constant
);
2892 /* Hash and compare functions for const_rtx_sym_htab. */
2895 const_desc_rtx_sym_hash (const void *ptr
)
2897 const struct constant_descriptor_rtx
*desc
= ptr
;
2898 return htab_hash_string (XSTR (desc
->sym
, 0));
2902 const_desc_rtx_sym_eq (const void *a
, const void *b
)
2904 const struct constant_descriptor_rtx
*x
= a
;
2905 const struct constant_descriptor_rtx
*y
= b
;
2906 return XSTR (x
->sym
, 0) == XSTR (y
->sym
, 0);
2909 /* This is the worker function for const_rtx_hash, called via for_each_rtx. */
2912 const_rtx_hash_1 (rtx
*xp
, void *data
)
2914 unsigned HOST_WIDE_INT hwi
;
2915 enum machine_mode mode
;
2921 code
= GET_CODE (x
);
2922 mode
= GET_MODE (x
);
2923 h
= (hashval_t
) code
* 1048573 + mode
;
2931 const int shift
= sizeof (hashval_t
) * CHAR_BIT
;
2932 const int n
= sizeof (HOST_WIDE_INT
) / sizeof (hashval_t
);
2935 h
^= (hashval_t
) hwi
;
2936 for (i
= 1; i
< n
; ++i
)
2939 h
^= (hashval_t
) hwi
;
2945 if (mode
== VOIDmode
)
2947 hwi
= CONST_DOUBLE_LOW (x
) ^ CONST_DOUBLE_HIGH (x
);
2951 h
^= real_hash (CONST_DOUBLE_REAL_VALUE (x
));
2957 for (i
= XVECLEN (x
, 0); i
-- > 0; )
2958 h
= h
* 251 + const_rtx_hash_1 (&XVECEXP (x
, 0, i
), data
);
2963 h
^= htab_hash_string (XSTR (x
, 0));
2967 h
= h
* 251 + CODE_LABEL_NUMBER (XEXP (x
, 0));
2971 case UNSPEC_VOLATILE
:
2972 h
= h
* 251 + XINT (x
, 1);
2980 *hp
= *hp
* 509 + h
;
2984 /* Compute a hash value for X, which should be a constant. */
2987 const_rtx_hash (rtx x
)
2990 for_each_rtx (&x
, const_rtx_hash_1
, &h
);
2995 /* Initialize constant pool hashing for a new function. */
2998 init_varasm_status (struct function
*f
)
3000 struct varasm_status
*p
;
3001 struct rtx_constant_pool
*pool
;
3003 p
= ggc_alloc (sizeof (struct varasm_status
));
3006 pool
= ggc_alloc (sizeof (struct rtx_constant_pool
));
3008 p
->deferred_constants
= 0;
3010 pool
->const_rtx_htab
= htab_create_ggc (31, const_desc_rtx_hash
,
3011 const_desc_rtx_eq
, NULL
);
3012 pool
->const_rtx_sym_htab
= htab_create_ggc (31, const_desc_rtx_sym_hash
,
3013 const_desc_rtx_sym_eq
, NULL
);
3014 pool
->first
= pool
->last
= NULL
;
3018 /* Given a MINUS expression, simplify it if both sides
3019 include the same symbol. */
3022 simplify_subtraction (rtx x
)
3024 rtx r
= simplify_rtx (x
);
3028 /* Given a constant rtx X, make (or find) a memory constant for its value
3029 and return a MEM rtx to refer to it in memory. */
3032 force_const_mem (enum machine_mode mode
, rtx x
)
3034 struct constant_descriptor_rtx
*desc
, tmp
;
3035 struct rtx_constant_pool
*pool
= cfun
->varasm
->pool
;
3042 /* If we're not allowed to drop X into the constant pool, don't. */
3043 if (targetm
.cannot_force_const_mem (x
))
3046 /* Lookup the value in the hashtable. */
3049 hash
= const_rtx_hash (x
);
3050 slot
= htab_find_slot_with_hash (pool
->const_rtx_htab
, &tmp
, hash
, INSERT
);
3053 /* If the constant was already present, return its memory. */
3055 return copy_rtx (desc
->mem
);
3057 /* Otherwise, create a new descriptor. */
3058 desc
= ggc_alloc (sizeof (*desc
));
3061 /* Align the location counter as required by EXP's data type. */
3062 align
= GET_MODE_ALIGNMENT (mode
== VOIDmode
? word_mode
: mode
);
3063 #ifdef CONSTANT_ALIGNMENT
3065 tree type
= lang_hooks
.types
.type_for_mode (mode
, 0);
3066 if (type
!= NULL_TREE
)
3067 align
= CONSTANT_ALIGNMENT (make_tree (type
, x
), align
);
3071 pool
->offset
+= (align
/ BITS_PER_UNIT
) - 1;
3072 pool
->offset
&= ~ ((align
/ BITS_PER_UNIT
) - 1);
3075 desc
->constant
= tmp
.constant
;
3076 desc
->offset
= pool
->offset
;
3079 desc
->align
= align
;
3080 desc
->labelno
= const_labelno
;
3083 pool
->offset
+= GET_MODE_SIZE (mode
);
3085 pool
->last
->next
= desc
;
3087 pool
->first
= pool
->last
= desc
;
3090 /* Create a string containing the label name, in LABEL. */
3091 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
3094 /* Construct the SYMBOL_REF. Make sure to mark it as belonging to
3095 the constants pool. */
3096 desc
->sym
= symbol
= gen_rtx_SYMBOL_REF (Pmode
, ggc_strdup (label
));
3097 SYMBOL_REF_FLAGS (symbol
) = SYMBOL_FLAG_LOCAL
;
3098 CONSTANT_POOL_ADDRESS_P (symbol
) = 1;
3099 current_function_uses_const_pool
= 1;
3101 /* Insert the descriptor into the symbol cross-reference table too. */
3102 slot
= htab_find_slot (pool
->const_rtx_sym_htab
, desc
, INSERT
);
3103 gcc_assert (!*slot
);
3106 /* Construct the MEM. */
3107 desc
->mem
= def
= gen_const_mem (mode
, symbol
);
3108 set_mem_attributes (def
, lang_hooks
.types
.type_for_mode (mode
, 0), 1);
3109 set_mem_align (def
, align
);
3111 /* If we're dropping a label to the constant pool, make sure we
3113 if (GET_CODE (x
) == LABEL_REF
)
3114 LABEL_PRESERVE_P (XEXP (x
, 0)) = 1;
3116 return copy_rtx (def
);
3119 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
3120 the corresponding constant_descriptor_rtx structure. */
3122 static struct constant_descriptor_rtx
*
3123 find_pool_constant (struct rtx_constant_pool
*pool
, rtx sym
)
3125 struct constant_descriptor_rtx tmp
;
3127 return htab_find (pool
->const_rtx_sym_htab
, &tmp
);
3130 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
3133 get_pool_constant (rtx addr
)
3135 return find_pool_constant (cfun
->varasm
->pool
, addr
)->constant
;
3138 /* Given a constant pool SYMBOL_REF, return the corresponding constant
3139 and whether it has been output or not. */
3142 get_pool_constant_mark (rtx addr
, bool *pmarked
)
3144 struct constant_descriptor_rtx
*desc
;
3146 desc
= find_pool_constant (cfun
->varasm
->pool
, addr
);
3147 *pmarked
= (desc
->mark
!= 0);
3148 return desc
->constant
;
3151 /* Likewise, but for the constant pool of a specific function. */
3154 get_pool_constant_for_function (struct function
*f
, rtx addr
)
3156 return find_pool_constant (f
->varasm
->pool
, addr
)->constant
;
3159 /* Similar, return the mode. */
3162 get_pool_mode (rtx addr
)
3164 return find_pool_constant (cfun
->varasm
->pool
, addr
)->mode
;
3167 /* Return the size of the constant pool. */
3170 get_pool_size (void)
3172 return cfun
->varasm
->pool
->offset
;
3175 /* Worker function for output_constant_pool_1. Emit assembly for X
3176 in MODE with known alignment ALIGN. */
3179 output_constant_pool_2 (enum machine_mode mode
, rtx x
, unsigned int align
)
3181 switch (GET_MODE_CLASS (mode
))
3187 gcc_assert (GET_CODE (x
) == CONST_DOUBLE
);
3188 REAL_VALUE_FROM_CONST_DOUBLE (r
, x
);
3189 assemble_real (r
, mode
, align
);
3194 case MODE_PARTIAL_INT
:
3195 assemble_integer (x
, GET_MODE_SIZE (mode
), align
, 1);
3198 case MODE_VECTOR_FLOAT
:
3199 case MODE_VECTOR_INT
:
3202 enum machine_mode submode
= GET_MODE_INNER (mode
);
3203 unsigned int subalign
= MIN (align
, GET_MODE_BITSIZE (submode
));
3205 gcc_assert (GET_CODE (x
) == CONST_VECTOR
);
3206 units
= CONST_VECTOR_NUNITS (x
);
3208 for (i
= 0; i
< units
; i
++)
3210 rtx elt
= CONST_VECTOR_ELT (x
, i
);
3211 output_constant_pool_2 (submode
, elt
, i
? subalign
: align
);
3221 /* Worker function for output_constant_pool. Emit POOL. */
3224 output_constant_pool_1 (struct constant_descriptor_rtx
*desc
)
3232 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3233 whose CODE_LABEL has been deleted. This can occur if a jump table
3234 is eliminated by optimization. If so, write a constant of zero
3235 instead. Note that this can also happen by turning the
3236 CODE_LABEL into a NOTE. */
3237 /* ??? This seems completely and utterly wrong. Certainly it's
3238 not true for NOTE_INSN_DELETED_LABEL, but I disbelieve proper
3239 functioning even with INSN_DELETED_P and friends. */
3242 switch (GET_CODE (x
))
3245 if (GET_CODE (XEXP (x
, 0)) != PLUS
3246 || GET_CODE (XEXP (XEXP (x
, 0), 0)) != LABEL_REF
)
3248 tmp
= XEXP (XEXP (x
, 0), 0);
3253 gcc_assert (!INSN_DELETED_P (tmp
));
3254 gcc_assert (!NOTE_P (tmp
)
3255 || NOTE_LINE_NUMBER (tmp
) != NOTE_INSN_DELETED
);
3262 /* First switch to correct section. */
3263 targetm
.asm_out
.select_rtx_section (desc
->mode
, x
, desc
->align
);
3265 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3266 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file
, x
, desc
->mode
,
3267 desc
->align
, desc
->labelno
, done
);
3270 assemble_align (desc
->align
);
3272 /* Output the label. */
3273 targetm
.asm_out
.internal_label (asm_out_file
, "LC", desc
->labelno
);
3275 /* Output the data. */
3276 output_constant_pool_2 (desc
->mode
, x
, desc
->align
);
3278 /* Make sure all constants in SECTION_MERGE and not SECTION_STRINGS
3279 sections have proper size. */
3280 if (desc
->align
> GET_MODE_BITSIZE (desc
->mode
)
3281 && in_section
== in_named
3282 && get_named_section_flags (in_named_name
) & SECTION_MERGE
)
3283 assemble_align (desc
->align
);
3285 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3291 /* Given a SYMBOL_REF CURRENT_RTX, mark it and all constants it refers
3292 to as used. Emit referenced deferred strings. This function can
3293 be used with for_each_rtx to mark all SYMBOL_REFs in an rtx. */
3296 mark_constant (rtx
*current_rtx
, void *data
)
3298 struct rtx_constant_pool
*pool
= data
;
3299 rtx x
= *current_rtx
;
3301 if (x
== NULL_RTX
|| GET_CODE (x
) != SYMBOL_REF
)
3304 if (CONSTANT_POOL_ADDRESS_P (x
))
3306 struct constant_descriptor_rtx
*desc
= find_pool_constant (pool
, x
);
3307 if (desc
->mark
== 0)
3310 for_each_rtx (&desc
->constant
, mark_constant
, pool
);
3313 else if (TREE_CONSTANT_POOL_ADDRESS_P (x
))
3315 tree exp
= SYMBOL_REF_DECL (x
);
3316 if (!TREE_ASM_WRITTEN (exp
))
3318 n_deferred_constants
--;
3319 output_constant_def_contents (x
);
3326 /* Look through appropriate parts of INSN, marking all entries in the
3327 constant pool which are actually being used. Entries that are only
3328 referenced by other constants are also marked as used. Emit
3329 deferred strings that are used. */
3332 mark_constants (struct rtx_constant_pool
*pool
, rtx insn
)
3337 /* Insns may appear inside a SEQUENCE. Only check the patterns of
3338 insns, not any notes that may be attached. We don't want to mark
3339 a constant just because it happens to appear in a REG_EQUIV note. */
3340 if (GET_CODE (PATTERN (insn
)) == SEQUENCE
)
3342 rtx seq
= PATTERN (insn
);
3343 int i
, n
= XVECLEN (seq
, 0);
3344 for (i
= 0; i
< n
; ++i
)
3346 rtx subinsn
= XVECEXP (seq
, 0, i
);
3347 if (INSN_P (subinsn
))
3348 for_each_rtx (&PATTERN (subinsn
), mark_constant
, pool
);
3352 for_each_rtx (&PATTERN (insn
), mark_constant
, pool
);
3355 /* Look through the instructions for this function, and mark all the
3356 entries in POOL which are actually being used. Emit deferred constants
3357 which have indeed been used. */
3360 mark_constant_pool (struct rtx_constant_pool
*pool
)
3364 if (pool
->first
== 0 && n_deferred_constants
== 0)
3367 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
3368 mark_constants (pool
, insn
);
3370 for (link
= current_function_epilogue_delay_list
;
3372 link
= XEXP (link
, 1))
3373 mark_constants (pool
, XEXP (link
, 0));
3376 /* Write all the constants in the constant pool. */
3379 output_constant_pool (const char *fnname ATTRIBUTE_UNUSED
,
3380 tree fndecl ATTRIBUTE_UNUSED
)
3382 struct rtx_constant_pool
*pool
= cfun
->varasm
->pool
;
3383 struct constant_descriptor_rtx
*desc
;
3385 /* It is possible for gcc to call force_const_mem and then to later
3386 discard the instructions which refer to the constant. In such a
3387 case we do not need to output the constant. */
3388 mark_constant_pool (pool
);
3390 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3391 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file
, fnname
, fndecl
, pool
->offset
);
3394 for (desc
= pool
->first
; desc
; desc
= desc
->next
)
3395 output_constant_pool_1 (desc
);
3397 #ifdef ASM_OUTPUT_POOL_EPILOGUE
3398 ASM_OUTPUT_POOL_EPILOGUE (asm_out_file
, fnname
, fndecl
, pool
->offset
);
3402 /* Determine what kind of relocations EXP may need. */
3405 compute_reloc_for_constant (tree exp
)
3407 int reloc
= 0, reloc2
;
3410 /* Give the front-end a chance to convert VALUE to something that
3411 looks more like a constant to the back-end. */
3412 exp
= lang_hooks
.expand_constant (exp
);
3414 switch (TREE_CODE (exp
))
3418 /* Go inside any operations that get_inner_reference can handle and see
3419 if what's inside is a constant: no need to do anything here for
3420 addresses of variables or functions. */
3421 for (tem
= TREE_OPERAND (exp
, 0); handled_component_p (tem
);
3422 tem
= TREE_OPERAND (tem
, 0))
3425 if (TREE_PUBLIC (tem
))
3432 reloc
= compute_reloc_for_constant (TREE_OPERAND (exp
, 0));
3433 reloc
|= compute_reloc_for_constant (TREE_OPERAND (exp
, 1));
3437 reloc
= compute_reloc_for_constant (TREE_OPERAND (exp
, 0));
3438 reloc2
= compute_reloc_for_constant (TREE_OPERAND (exp
, 1));
3439 /* The difference of two local labels is computable at link time. */
3440 if (reloc
== 1 && reloc2
== 1)
3448 case NON_LVALUE_EXPR
:
3449 reloc
= compute_reloc_for_constant (TREE_OPERAND (exp
, 0));
3453 for (tem
= CONSTRUCTOR_ELTS (exp
); tem
; tem
= TREE_CHAIN (tem
))
3454 if (TREE_VALUE (tem
) != 0)
3455 reloc
|= compute_reloc_for_constant (TREE_VALUE (tem
));
3465 /* Find all the constants whose addresses are referenced inside of EXP,
3466 and make sure assembler code with a label has been output for each one.
3467 Indicate whether an ADDR_EXPR has been encountered. */
3470 output_addressed_constants (tree exp
)
3474 /* Give the front-end a chance to convert VALUE to something that
3475 looks more like a constant to the back-end. */
3476 exp
= lang_hooks
.expand_constant (exp
);
3478 switch (TREE_CODE (exp
))
3482 /* Go inside any operations that get_inner_reference can handle and see
3483 if what's inside is a constant: no need to do anything here for
3484 addresses of variables or functions. */
3485 for (tem
= TREE_OPERAND (exp
, 0); handled_component_p (tem
);
3486 tem
= TREE_OPERAND (tem
, 0))
3489 /* If we have an initialized CONST_DECL, retrieve the initializer. */
3490 if (TREE_CODE (tem
) == CONST_DECL
&& DECL_INITIAL (tem
))
3491 tem
= DECL_INITIAL (tem
);
3493 if (CONSTANT_CLASS_P (tem
) || TREE_CODE (tem
) == CONSTRUCTOR
)
3494 output_constant_def (tem
, 0);
3499 output_addressed_constants (TREE_OPERAND (exp
, 1));
3504 case NON_LVALUE_EXPR
:
3505 output_addressed_constants (TREE_OPERAND (exp
, 0));
3509 for (tem
= CONSTRUCTOR_ELTS (exp
); tem
; tem
= TREE_CHAIN (tem
))
3510 if (TREE_VALUE (tem
) != 0)
3511 output_addressed_constants (TREE_VALUE (tem
));
3520 /* Return nonzero if VALUE is a valid constant-valued expression
3521 for use in initializing a static variable; one that can be an
3522 element of a "constant" initializer.
3524 Return null_pointer_node if the value is absolute;
3525 if it is relocatable, return the variable that determines the relocation.
3526 We assume that VALUE has been folded as much as possible;
3527 therefore, we do not need to check for such things as
3528 arithmetic-combinations of integers. */
3531 initializer_constant_valid_p (tree value
, tree endtype
)
3533 /* Give the front-end a chance to convert VALUE to something that
3534 looks more like a constant to the back-end. */
3535 value
= lang_hooks
.expand_constant (value
);
3537 switch (TREE_CODE (value
))
3540 if ((TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
3541 || TREE_CODE (TREE_TYPE (value
)) == RECORD_TYPE
)
3542 && TREE_CONSTANT (value
)
3543 && CONSTRUCTOR_ELTS (value
))
3546 bool absolute
= true;
3548 for (elt
= CONSTRUCTOR_ELTS (value
); elt
; elt
= TREE_CHAIN (elt
))
3551 value
= TREE_VALUE (elt
);
3552 reloc
= initializer_constant_valid_p (value
, TREE_TYPE (value
));
3555 if (reloc
!= null_pointer_node
)
3558 /* For a non-absolute relocation, there is no single
3559 variable that can be "the variable that determines the
3561 return absolute
? null_pointer_node
: error_mark_node
;
3564 return TREE_STATIC (value
) ? null_pointer_node
: NULL_TREE
;
3571 return null_pointer_node
;
3575 value
= staticp (TREE_OPERAND (value
, 0));
3576 /* "&(*a).f" is like unto pointer arithmetic. If "a" turns out to
3577 be a constant, this is old-skool offsetof-like nonsense. */
3579 && TREE_CODE (value
) == INDIRECT_REF
3580 && TREE_CONSTANT (TREE_OPERAND (value
, 0)))
3581 return null_pointer_node
;
3582 /* Taking the address of a nested function involves a trampoline. */
3584 && TREE_CODE (value
) == FUNCTION_DECL
3585 && ((decl_function_context (value
) && !DECL_NO_STATIC_CHAIN (value
))
3586 || DECL_NON_ADDR_CONST_P (value
)))
3590 case VIEW_CONVERT_EXPR
:
3591 case NON_LVALUE_EXPR
:
3592 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3601 src
= TREE_OPERAND (value
, 0);
3602 src_type
= TREE_TYPE (src
);
3603 dest_type
= TREE_TYPE (value
);
3605 /* Allow conversions between pointer types, floating-point
3606 types, and offset types. */
3607 if ((POINTER_TYPE_P (dest_type
) && POINTER_TYPE_P (src_type
))
3608 || (FLOAT_TYPE_P (dest_type
) && FLOAT_TYPE_P (src_type
))
3609 || (TREE_CODE (dest_type
) == OFFSET_TYPE
3610 && TREE_CODE (src_type
) == OFFSET_TYPE
))
3611 return initializer_constant_valid_p (src
, endtype
);
3613 /* Allow length-preserving conversions between integer types. */
3614 if (INTEGRAL_TYPE_P (dest_type
) && INTEGRAL_TYPE_P (src_type
)
3615 && (TYPE_PRECISION (dest_type
) == TYPE_PRECISION (src_type
)))
3616 return initializer_constant_valid_p (src
, endtype
);
3618 /* Allow conversions between other integer types only if
3620 if (INTEGRAL_TYPE_P (dest_type
) && INTEGRAL_TYPE_P (src_type
))
3622 tree inner
= initializer_constant_valid_p (src
, endtype
);
3623 if (inner
== null_pointer_node
)
3624 return null_pointer_node
;
3628 /* Allow (int) &foo provided int is as wide as a pointer. */
3629 if (INTEGRAL_TYPE_P (dest_type
) && POINTER_TYPE_P (src_type
)
3630 && (TYPE_PRECISION (dest_type
) >= TYPE_PRECISION (src_type
)))
3631 return initializer_constant_valid_p (src
, endtype
);
3633 /* Likewise conversions from int to pointers, but also allow
3634 conversions from 0. */
3635 if ((POINTER_TYPE_P (dest_type
)
3636 || TREE_CODE (dest_type
) == OFFSET_TYPE
)
3637 && INTEGRAL_TYPE_P (src_type
))
3639 if (integer_zerop (src
))
3640 return null_pointer_node
;
3641 else if (TYPE_PRECISION (dest_type
) <= TYPE_PRECISION (src_type
))
3642 return initializer_constant_valid_p (src
, endtype
);
3645 /* Allow conversions to struct or union types if the value
3647 if (TREE_CODE (dest_type
) == RECORD_TYPE
3648 || TREE_CODE (dest_type
) == UNION_TYPE
)
3649 return initializer_constant_valid_p (src
, endtype
);
3654 if (! INTEGRAL_TYPE_P (endtype
)
3655 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
3657 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3659 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
3661 /* If either term is absolute, use the other terms relocation. */
3662 if (valid0
== null_pointer_node
)
3664 if (valid1
== null_pointer_node
)
3670 if (! INTEGRAL_TYPE_P (endtype
)
3671 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
3673 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3675 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
3677 /* Win if second argument is absolute. */
3678 if (valid1
== null_pointer_node
)
3680 /* Win if both arguments have the same relocation.
3681 Then the value is absolute. */
3682 if (valid0
== valid1
&& valid0
!= 0)
3683 return null_pointer_node
;
3685 /* Since GCC guarantees that string constants are unique in the
3686 generated code, a subtraction between two copies of the same
3687 constant string is absolute. */
3688 if (valid0
&& TREE_CODE (valid0
) == STRING_CST
3689 && valid1
&& TREE_CODE (valid1
) == STRING_CST
3690 && operand_equal_p (valid0
, valid1
, 1))
3691 return null_pointer_node
;
3694 /* Support narrowing differences. */
3695 if (INTEGRAL_TYPE_P (endtype
))
3699 op0
= TREE_OPERAND (value
, 0);
3700 op1
= TREE_OPERAND (value
, 1);
3702 /* Like STRIP_NOPS except allow the operand mode to widen.
3703 This works around a feature of fold that simplifies
3704 (int)(p1 - p2) to ((int)p1 - (int)p2) under the theory
3705 that the narrower operation is cheaper. */
3707 while (TREE_CODE (op0
) == NOP_EXPR
3708 || TREE_CODE (op0
) == CONVERT_EXPR
3709 || TREE_CODE (op0
) == NON_LVALUE_EXPR
)
3711 tree inner
= TREE_OPERAND (op0
, 0);
3712 if (inner
== error_mark_node
3713 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner
)))
3714 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op0
)))
3715 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner
)))))
3720 while (TREE_CODE (op1
) == NOP_EXPR
3721 || TREE_CODE (op1
) == CONVERT_EXPR
3722 || TREE_CODE (op1
) == NON_LVALUE_EXPR
)
3724 tree inner
= TREE_OPERAND (op1
, 0);
3725 if (inner
== error_mark_node
3726 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner
)))
3727 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op1
)))
3728 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner
)))))
3733 op0
= initializer_constant_valid_p (op0
, endtype
);
3734 op1
= initializer_constant_valid_p (op1
, endtype
);
3736 /* Both initializers must be known. */
3740 return null_pointer_node
;
3742 /* Support differences between labels. */
3743 if (TREE_CODE (op0
) == LABEL_DECL
3744 && TREE_CODE (op1
) == LABEL_DECL
)
3745 return null_pointer_node
;
3747 if (TREE_CODE (op0
) == STRING_CST
3748 && TREE_CODE (op1
) == STRING_CST
3749 && operand_equal_p (op0
, op1
, 1))
3750 return null_pointer_node
;
3762 /* Output assembler code for constant EXP to FILE, with no label.
3763 This includes the pseudo-op such as ".int" or ".byte", and a newline.
3764 Assumes output_addressed_constants has been done on EXP already.
3766 Generate exactly SIZE bytes of assembler data, padding at the end
3767 with zeros if necessary. SIZE must always be specified.
3769 SIZE is important for structure constructors,
3770 since trailing members may have been omitted from the constructor.
3771 It is also important for initialization of arrays from string constants
3772 since the full length of the string constant might not be wanted.
3773 It is also needed for initialization of unions, where the initializer's
3774 type is just one member, and that may not be as long as the union.
3776 There a case in which we would fail to output exactly SIZE bytes:
3777 for a structure constructor that wants to produce more than SIZE bytes.
3778 But such constructors will never be generated for any possible input.
3780 ALIGN is the alignment of the data in bits. */
3783 output_constant (tree exp
, unsigned HOST_WIDE_INT size
, unsigned int align
)
3785 enum tree_code code
;
3786 unsigned HOST_WIDE_INT thissize
;
3788 /* Some front-ends use constants other than the standard language-independent
3789 varieties, but which may still be output directly. Give the front-end a
3790 chance to convert EXP to a language-independent representation. */
3791 exp
= lang_hooks
.expand_constant (exp
);
3793 if (size
== 0 || flag_syntax_only
)
3796 /* Eliminate any conversions since we'll be outputting the underlying
3798 while (TREE_CODE (exp
) == NOP_EXPR
|| TREE_CODE (exp
) == CONVERT_EXPR
3799 || TREE_CODE (exp
) == NON_LVALUE_EXPR
3800 || TREE_CODE (exp
) == VIEW_CONVERT_EXPR
)
3801 exp
= TREE_OPERAND (exp
, 0);
3803 code
= TREE_CODE (TREE_TYPE (exp
));
3804 thissize
= int_size_in_bytes (TREE_TYPE (exp
));
3806 /* Allow a constructor with no elements for any data type.
3807 This means to fill the space with zeros. */
3808 if (TREE_CODE (exp
) == CONSTRUCTOR
&& CONSTRUCTOR_ELTS (exp
) == 0)
3810 assemble_zeros (size
);
3814 if (TREE_CODE (exp
) == FDESC_EXPR
)
3816 #ifdef ASM_OUTPUT_FDESC
3817 HOST_WIDE_INT part
= tree_low_cst (TREE_OPERAND (exp
, 1), 0);
3818 tree decl
= TREE_OPERAND (exp
, 0);
3819 ASM_OUTPUT_FDESC (asm_out_file
, decl
, part
);
3826 /* Now output the underlying data. If we've handling the padding, return.
3827 Otherwise, break and ensure SIZE is the size written. */
3835 case REFERENCE_TYPE
:
3837 if (! assemble_integer (expand_expr (exp
, NULL_RTX
, VOIDmode
,
3838 EXPAND_INITIALIZER
),
3839 MIN (size
, thissize
), align
, 0))
3840 error ("initializer for integer value is too complicated");
3844 if (TREE_CODE (exp
) != REAL_CST
)
3845 error ("initializer for floating value is not a floating constant");
3847 assemble_real (TREE_REAL_CST (exp
), TYPE_MODE (TREE_TYPE (exp
)), align
);
3851 output_constant (TREE_REALPART (exp
), thissize
/ 2, align
);
3852 output_constant (TREE_IMAGPART (exp
), thissize
/ 2,
3853 min_align (align
, BITS_PER_UNIT
* (thissize
/ 2)));
3858 switch (TREE_CODE (exp
))
3861 output_constructor (exp
, size
, align
);
3864 thissize
= MIN ((unsigned HOST_WIDE_INT
)TREE_STRING_LENGTH (exp
),
3866 assemble_string (TREE_STRING_POINTER (exp
), thissize
);
3873 unsigned int nalign
;
3874 enum machine_mode inner
;
3876 inner
= TYPE_MODE (TREE_TYPE (TREE_TYPE (exp
)));
3877 nalign
= MIN (align
, GET_MODE_ALIGNMENT (inner
));
3879 elt_size
= GET_MODE_SIZE (inner
);
3881 link
= TREE_VECTOR_CST_ELTS (exp
);
3882 output_constant (TREE_VALUE (link
), elt_size
, align
);
3883 while ((link
= TREE_CHAIN (link
)) != NULL
)
3884 output_constant (TREE_VALUE (link
), elt_size
, nalign
);
3894 gcc_assert (TREE_CODE (exp
) == CONSTRUCTOR
);
3895 output_constructor (exp
, size
, align
);
3905 if (size
> thissize
)
3906 assemble_zeros (size
- thissize
);
3910 /* Subroutine of output_constructor, used for computing the size of
3911 arrays of unspecified length. VAL must be a CONSTRUCTOR of an array
3912 type with an unspecified upper bound. */
3914 static unsigned HOST_WIDE_INT
3915 array_size_for_constructor (tree val
)
3919 /* This code used to attempt to handle string constants that are not
3920 arrays of single-bytes, but nothing else does, so there's no point in
3922 if (TREE_CODE (val
) == STRING_CST
)
3923 return TREE_STRING_LENGTH (val
);
3925 max_index
= NULL_TREE
;
3926 for (i
= CONSTRUCTOR_ELTS (val
); i
; i
= TREE_CHAIN (i
))
3928 tree index
= TREE_PURPOSE (i
);
3930 if (TREE_CODE (index
) == RANGE_EXPR
)
3931 index
= TREE_OPERAND (index
, 1);
3932 if (max_index
== NULL_TREE
|| tree_int_cst_lt (max_index
, index
))
3936 if (max_index
== NULL_TREE
)
3939 /* Compute the total number of array elements. */
3940 i
= size_binop (MINUS_EXPR
, convert (sizetype
, max_index
),
3942 TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (val
)))));
3943 i
= size_binop (PLUS_EXPR
, i
, convert (sizetype
, integer_one_node
));
3945 /* Multiply by the array element unit size to find number of bytes. */
3946 i
= size_binop (MULT_EXPR
, i
, TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (val
))));
3948 return tree_low_cst (i
, 1);
3951 /* Subroutine of output_constant, used for CONSTRUCTORs (aggregate constants).
3952 Generate at least SIZE bytes, padding if necessary. */
3955 output_constructor (tree exp
, unsigned HOST_WIDE_INT size
,
3958 tree type
= TREE_TYPE (exp
);
3959 tree link
, field
= 0;
3961 /* Number of bytes output or skipped so far.
3962 In other words, current position within the constructor. */
3963 HOST_WIDE_INT total_bytes
= 0;
3964 /* Nonzero means BYTE contains part of a byte, to be output. */
3965 int byte_buffer_in_use
= 0;
3968 gcc_assert (HOST_BITS_PER_WIDE_INT
>= BITS_PER_UNIT
);
3970 if (TREE_CODE (type
) == RECORD_TYPE
)
3971 field
= TYPE_FIELDS (type
);
3973 if (TREE_CODE (type
) == ARRAY_TYPE
3974 && TYPE_DOMAIN (type
) != 0)
3975 min_index
= TYPE_MIN_VALUE (TYPE_DOMAIN (type
));
3977 /* As LINK goes through the elements of the constant,
3978 FIELD goes through the structure fields, if the constant is a structure.
3979 if the constant is a union, then we override this,
3980 by getting the field from the TREE_LIST element.
3981 But the constant could also be an array. Then FIELD is zero.
3983 There is always a maximum of one element in the chain LINK for unions
3984 (even if the initializer in a source program incorrectly contains
3986 for (link
= CONSTRUCTOR_ELTS (exp
);
3988 link
= TREE_CHAIN (link
),
3989 field
= field
? TREE_CHAIN (field
) : 0)
3991 tree val
= TREE_VALUE (link
);
3994 /* The element in a union constructor specifies the proper field
3996 if ((TREE_CODE (type
) == RECORD_TYPE
|| TREE_CODE (type
) == UNION_TYPE
3997 || TREE_CODE (type
) == QUAL_UNION_TYPE
)
3998 && TREE_PURPOSE (link
) != 0)
3999 field
= TREE_PURPOSE (link
);
4001 else if (TREE_CODE (type
) == ARRAY_TYPE
)
4002 index
= TREE_PURPOSE (link
);
4004 #ifdef ASM_COMMENT_START
4005 if (field
&& flag_verbose_asm
)
4006 fprintf (asm_out_file
, "%s %s:\n",
4009 ? IDENTIFIER_POINTER (DECL_NAME (field
))
4013 /* Eliminate the marker that makes a cast not be an lvalue. */
4017 if (index
&& TREE_CODE (index
) == RANGE_EXPR
)
4019 unsigned HOST_WIDE_INT fieldsize
4020 = int_size_in_bytes (TREE_TYPE (type
));
4021 HOST_WIDE_INT lo_index
= tree_low_cst (TREE_OPERAND (index
, 0), 0);
4022 HOST_WIDE_INT hi_index
= tree_low_cst (TREE_OPERAND (index
, 1), 0);
4023 HOST_WIDE_INT index
;
4024 unsigned int align2
= min_align (align
, fieldsize
* BITS_PER_UNIT
);
4026 for (index
= lo_index
; index
<= hi_index
; index
++)
4028 /* Output the element's initial value. */
4030 assemble_zeros (fieldsize
);
4032 output_constant (val
, fieldsize
, align2
);
4034 /* Count its size. */
4035 total_bytes
+= fieldsize
;
4038 else if (field
== 0 || !DECL_BIT_FIELD (field
))
4040 /* An element that is not a bit-field. */
4042 unsigned HOST_WIDE_INT fieldsize
;
4043 /* Since this structure is static,
4044 we know the positions are constant. */
4045 HOST_WIDE_INT pos
= field
? int_byte_position (field
) : 0;
4046 unsigned int align2
;
4049 pos
= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (val
)), 1)
4050 * (tree_low_cst (index
, 0) - tree_low_cst (min_index
, 0)));
4052 /* Output any buffered-up bit-fields preceding this element. */
4053 if (byte_buffer_in_use
)
4055 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4057 byte_buffer_in_use
= 0;
4060 /* Advance to offset of this element.
4061 Note no alignment needed in an array, since that is guaranteed
4062 if each element has the proper size. */
4063 if ((field
!= 0 || index
!= 0) && pos
!= total_bytes
)
4065 assemble_zeros (pos
- total_bytes
);
4069 /* Find the alignment of this element. */
4070 align2
= min_align (align
, BITS_PER_UNIT
* pos
);
4072 /* Determine size this element should occupy. */
4077 /* If this is an array with an unspecified upper bound,
4078 the initializer determines the size. */
4079 /* ??? This ought to only checked if DECL_SIZE_UNIT is NULL,
4080 but we cannot do this until the deprecated support for
4081 initializing zero-length array members is removed. */
4082 if (TREE_CODE (TREE_TYPE (field
)) == ARRAY_TYPE
4083 && TYPE_DOMAIN (TREE_TYPE (field
))
4084 && ! TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (field
))))
4086 fieldsize
= array_size_for_constructor (val
);
4087 /* Given a non-empty initialization, this field had
4089 gcc_assert (!fieldsize
|| !TREE_CHAIN (field
));
4091 else if (DECL_SIZE_UNIT (field
))
4093 /* ??? This can't be right. If the decl size overflows
4094 a host integer we will silently emit no data. */
4095 if (host_integerp (DECL_SIZE_UNIT (field
), 1))
4096 fieldsize
= tree_low_cst (DECL_SIZE_UNIT (field
), 1);
4100 fieldsize
= int_size_in_bytes (TREE_TYPE (type
));
4102 /* Output the element's initial value. */
4104 assemble_zeros (fieldsize
);
4106 output_constant (val
, fieldsize
, align2
);
4108 /* Count its size. */
4109 total_bytes
+= fieldsize
;
4111 else if (val
!= 0 && TREE_CODE (val
) != INTEGER_CST
)
4112 error ("invalid initial value for member %qs",
4113 IDENTIFIER_POINTER (DECL_NAME (field
)));
4116 /* Element that is a bit-field. */
4118 HOST_WIDE_INT next_offset
= int_bit_position (field
);
4119 HOST_WIDE_INT end_offset
4120 = (next_offset
+ tree_low_cst (DECL_SIZE (field
), 1));
4123 val
= integer_zero_node
;
4125 /* If this field does not start in this (or, next) byte,
4127 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4129 /* Output remnant of any bit field in previous bytes. */
4130 if (byte_buffer_in_use
)
4132 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4134 byte_buffer_in_use
= 0;
4137 /* If still not at proper byte, advance to there. */
4138 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4140 assemble_zeros (next_offset
/ BITS_PER_UNIT
- total_bytes
);
4141 total_bytes
= next_offset
/ BITS_PER_UNIT
;
4145 if (! byte_buffer_in_use
)
4148 /* We must split the element into pieces that fall within
4149 separate bytes, and combine each byte with previous or
4150 following bit-fields. */
4152 /* next_offset is the offset n fbits from the beginning of
4153 the structure to the next bit of this element to be processed.
4154 end_offset is the offset of the first bit past the end of
4156 while (next_offset
< end_offset
)
4160 HOST_WIDE_INT value
;
4161 HOST_WIDE_INT next_byte
= next_offset
/ BITS_PER_UNIT
;
4162 HOST_WIDE_INT next_bit
= next_offset
% BITS_PER_UNIT
;
4164 /* Advance from byte to byte
4165 within this element when necessary. */
4166 while (next_byte
!= total_bytes
)
4168 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4173 /* Number of bits we can process at once
4174 (all part of the same byte). */
4175 this_time
= MIN (end_offset
- next_offset
,
4176 BITS_PER_UNIT
- next_bit
);
4177 if (BYTES_BIG_ENDIAN
)
4179 /* On big-endian machine, take the most significant bits
4180 first (of the bits that are significant)
4181 and put them into bytes from the most significant end. */
4182 shift
= end_offset
- next_offset
- this_time
;
4184 /* Don't try to take a bunch of bits that cross
4185 the word boundary in the INTEGER_CST. We can
4186 only select bits from the LOW or HIGH part
4188 if (shift
< HOST_BITS_PER_WIDE_INT
4189 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4191 this_time
= shift
+ this_time
- HOST_BITS_PER_WIDE_INT
;
4192 shift
= HOST_BITS_PER_WIDE_INT
;
4195 /* Now get the bits from the appropriate constant word. */
4196 if (shift
< HOST_BITS_PER_WIDE_INT
)
4197 value
= TREE_INT_CST_LOW (val
);
4200 gcc_assert (shift
< 2 * HOST_BITS_PER_WIDE_INT
);
4201 value
= TREE_INT_CST_HIGH (val
);
4202 shift
-= HOST_BITS_PER_WIDE_INT
;
4205 /* Get the result. This works only when:
4206 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4207 byte
|= (((value
>> shift
)
4208 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4209 << (BITS_PER_UNIT
- this_time
- next_bit
));
4213 /* On little-endian machines,
4214 take first the least significant bits of the value
4215 and pack them starting at the least significant
4216 bits of the bytes. */
4217 shift
= next_offset
- int_bit_position (field
);
4219 /* Don't try to take a bunch of bits that cross
4220 the word boundary in the INTEGER_CST. We can
4221 only select bits from the LOW or HIGH part
4223 if (shift
< HOST_BITS_PER_WIDE_INT
4224 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4225 this_time
= (HOST_BITS_PER_WIDE_INT
- shift
);
4227 /* Now get the bits from the appropriate constant word. */
4228 if (shift
< HOST_BITS_PER_WIDE_INT
)
4229 value
= TREE_INT_CST_LOW (val
);
4232 gcc_assert (shift
< 2 * HOST_BITS_PER_WIDE_INT
);
4233 value
= TREE_INT_CST_HIGH (val
);
4234 shift
-= HOST_BITS_PER_WIDE_INT
;
4237 /* Get the result. This works only when:
4238 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4239 byte
|= (((value
>> shift
)
4240 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4244 next_offset
+= this_time
;
4245 byte_buffer_in_use
= 1;
4250 if (byte_buffer_in_use
)
4252 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4256 if ((unsigned HOST_WIDE_INT
)total_bytes
< size
)
4257 assemble_zeros (size
- total_bytes
);
4260 /* This TREE_LIST contains any weak symbol declarations waiting
4262 static GTY(()) tree weak_decls
;
4264 /* Mark DECL as weak. */
4267 mark_weak (tree decl
)
4269 DECL_WEAK (decl
) = 1;
4271 if (DECL_RTL_SET_P (decl
)
4272 && MEM_P (DECL_RTL (decl
))
4273 && XEXP (DECL_RTL (decl
), 0)
4274 && GET_CODE (XEXP (DECL_RTL (decl
), 0)) == SYMBOL_REF
)
4275 SYMBOL_REF_WEAK (XEXP (DECL_RTL (decl
), 0)) = 1;
4278 /* Merge weak status between NEWDECL and OLDDECL. */
4281 merge_weak (tree newdecl
, tree olddecl
)
4283 if (DECL_WEAK (newdecl
) == DECL_WEAK (olddecl
))
4286 if (DECL_WEAK (newdecl
))
4290 /* NEWDECL is weak, but OLDDECL is not. */
4292 /* If we already output the OLDDECL, we're in trouble; we can't
4293 go back and make it weak. This error cannot caught in
4294 declare_weak because the NEWDECL and OLDDECL was not yet
4295 been merged; therefore, TREE_ASM_WRITTEN was not set. */
4296 if (TREE_ASM_WRITTEN (olddecl
))
4297 error ("%Jweak declaration of %qD must precede definition",
4300 /* If we've already generated rtl referencing OLDDECL, we may
4301 have done so in a way that will not function properly with
4303 else if (TREE_USED (olddecl
)
4304 && TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (olddecl
)))
4305 warning ("%Jweak declaration of %qD after first use results "
4306 "in unspecified behavior", newdecl
, newdecl
);
4310 /* We put the NEWDECL on the weak_decls list at some point.
4311 Replace it with the OLDDECL. */
4312 for (wd
= weak_decls
; wd
; wd
= TREE_CHAIN (wd
))
4313 if (TREE_VALUE (wd
) == newdecl
)
4315 TREE_VALUE (wd
) = olddecl
;
4318 /* We may not find the entry on the list. If NEWDECL is a
4319 weak alias, then we will have already called
4320 globalize_decl to remove the entry; in that case, we do
4321 not need to do anything. */
4324 /* Make the OLDDECL weak; it's OLDDECL that we'll be keeping. */
4325 mark_weak (olddecl
);
4328 /* OLDDECL was weak, but NEWDECL was not explicitly marked as
4329 weak. Just update NEWDECL to indicate that it's weak too. */
4330 mark_weak (newdecl
);
4333 /* Declare DECL to be a weak symbol. */
4336 declare_weak (tree decl
)
4338 if (! TREE_PUBLIC (decl
))
4339 error ("%Jweak declaration of %qD must be public", decl
, decl
);
4340 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& TREE_ASM_WRITTEN (decl
))
4341 error ("%Jweak declaration of %qD must precede definition", decl
, decl
);
4342 else if (SUPPORTS_WEAK
)
4344 if (! DECL_WEAK (decl
))
4345 weak_decls
= tree_cons (NULL
, decl
, weak_decls
);
4348 warning ("%Jweak declaration of %qD not supported", decl
, decl
);
4353 /* Emit any pending weak declarations. */
4360 for (t
= weak_decls
; t
; t
= TREE_CHAIN (t
))
4362 tree decl
= TREE_VALUE (t
);
4363 #if defined (ASM_WEAKEN_DECL) || defined (ASM_WEAKEN_LABEL)
4364 const char *const name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
4367 if (! TREE_USED (decl
))
4370 #ifdef ASM_WEAKEN_DECL
4371 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, NULL
);
4373 #ifdef ASM_WEAKEN_LABEL
4374 ASM_WEAKEN_LABEL (asm_out_file
, name
);
4376 #ifdef ASM_OUTPUT_WEAK_ALIAS
4377 warning ("only weak aliases are supported in this configuration");
4385 /* Emit the assembly bits to indicate that DECL is globally visible. */
4388 globalize_decl (tree decl
)
4390 const char *name
= XSTR (XEXP (DECL_RTL (decl
), 0), 0);
4392 #if defined (ASM_WEAKEN_LABEL) || defined (ASM_WEAKEN_DECL)
4393 if (DECL_WEAK (decl
))
4397 #ifdef ASM_WEAKEN_DECL
4398 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, 0);
4400 ASM_WEAKEN_LABEL (asm_out_file
, name
);
4403 /* Remove this function from the pending weak list so that
4404 we do not emit multiple .weak directives for it. */
4405 for (p
= &weak_decls
; (t
= *p
) ; )
4407 if (DECL_ASSEMBLER_NAME (decl
) == DECL_ASSEMBLER_NAME (TREE_VALUE (t
)))
4408 *p
= TREE_CHAIN (t
);
4410 p
= &TREE_CHAIN (t
);
4414 #elif defined(ASM_MAKE_LABEL_LINKONCE)
4415 if (DECL_ONE_ONLY (decl
))
4416 ASM_MAKE_LABEL_LINKONCE (asm_out_file
, name
);
4419 targetm
.asm_out
.globalize_label (asm_out_file
, name
);
4422 /* We have to be able to tell cgraph about the needed-ness of the target
4423 of an alias. This requires that the decl have been defined. Aliases
4424 that precede their definition have to be queued for later processing. */
4426 struct alias_pair
GTY(())
4431 typedef struct alias_pair
*alias_pair
;
4433 /* Define gc'd vector type. */
4434 DEF_VEC_GC_P(alias_pair
);
4436 static GTY(()) VEC(alias_pair
) *alias_pairs
;
4438 /* Given an assembly name, find the decl it is associated with. At the
4439 same time, mark it needed for cgraph. */
4442 find_decl_and_mark_needed (tree decl
, tree target
)
4444 struct cgraph_node
*fnode
= NULL
;
4445 struct cgraph_varpool_node
*vnode
= NULL
;
4447 /* C++ thunk emitting code produces aliases late in the game.
4448 Avoid confusing cgraph code in that case. */
4449 if (!cgraph_global_info_ready
)
4451 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4453 fnode
= cgraph_node_for_asm (target
);
4455 vnode
= cgraph_varpool_node_for_asm (target
);
4459 vnode
= cgraph_varpool_node_for_asm (target
);
4461 fnode
= cgraph_node_for_asm (target
);
4467 cgraph_mark_needed_node (fnode
);
4472 cgraph_varpool_mark_needed_node (vnode
);
4479 /* Output the assembler code for a define (equate) using ASM_OUTPUT_DEF
4480 or ASM_OUTPUT_DEF_FROM_DECLS. The function defines the symbol whose
4481 tree node is DECL to have the value of the tree node TARGET. */
4484 do_assemble_alias (tree decl
, tree target ATTRIBUTE_UNUSED
)
4486 TREE_ASM_WRITTEN (decl
) = 1;
4487 TREE_ASM_WRITTEN (DECL_ASSEMBLER_NAME (decl
)) = 1;
4489 #ifdef ASM_OUTPUT_DEF
4490 /* Make name accessible from other files, if appropriate. */
4492 if (TREE_PUBLIC (decl
))
4494 globalize_decl (decl
);
4495 maybe_assemble_visibility (decl
);
4498 # ifdef ASM_OUTPUT_DEF_FROM_DECLS
4499 ASM_OUTPUT_DEF_FROM_DECLS (asm_out_file
, decl
, target
);
4501 ASM_OUTPUT_DEF (asm_out_file
,
4502 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)),
4503 IDENTIFIER_POINTER (target
));
4505 #elif defined (ASM_OUTPUT_WEAK_ALIAS) || defined (ASM_WEAKEN_DECL)
4510 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
4511 # ifdef ASM_WEAKEN_DECL
4512 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, IDENTIFIER_POINTER (target
));
4514 ASM_OUTPUT_WEAK_ALIAS (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4516 /* Remove this function from the pending weak list so that
4517 we do not emit multiple .weak directives for it. */
4518 for (p
= &weak_decls
; (t
= *p
) ; )
4519 if (DECL_ASSEMBLER_NAME (decl
) == DECL_ASSEMBLER_NAME (TREE_VALUE (t
)))
4520 *p
= TREE_CHAIN (t
);
4522 p
= &TREE_CHAIN (t
);
4527 /* First pass of completing pending aliases. Make sure that cgraph knows
4528 which symbols will be required. */
4531 finish_aliases_1 (void)
4536 for (i
= 0; VEC_iterate (alias_pair
, alias_pairs
, i
, p
); i
++)
4540 target_decl
= find_decl_and_mark_needed (p
->decl
, p
->target
);
4541 if (target_decl
== NULL
)
4542 error ("%J%qD aliased to undefined symbol %qE",
4543 p
->decl
, p
->decl
, p
->target
);
4544 else if (DECL_EXTERNAL (target_decl
))
4545 error ("%J%qD aliased to external symbol %qE",
4546 p
->decl
, p
->decl
, p
->target
);
4550 /* Second pass of completing pending aliases. Emit the actual assembly.
4551 This happens at the end of compilation and thus it is assured that the
4552 target symbol has been emitted. */
4555 finish_aliases_2 (void)
4560 for (i
= 0; VEC_iterate (alias_pair
, alias_pairs
, i
, p
); i
++)
4561 do_assemble_alias (p
->decl
, p
->target
);
4566 /* Emit an assembler directive to make the symbol for DECL an alias to
4567 the symbol for TARGET. */
4570 assemble_alias (tree decl
, tree target
)
4574 #if !defined (ASM_OUTPUT_DEF)
4575 # if !defined(ASM_OUTPUT_WEAK_ALIAS) && !defined (ASM_WEAKEN_DECL)
4576 error ("%Jalias definitions not supported in this configuration", decl
);
4579 if (!DECL_WEAK (decl
))
4581 error ("%Jonly weak aliases are supported in this configuration", decl
);
4587 /* We must force creation of DECL_RTL for debug info generation, even though
4588 we don't use it here. */
4589 make_decl_rtl (decl
);
4590 TREE_USED (decl
) = 1;
4592 /* A quirk of the initial implementation of aliases required that the user
4593 add "extern" to all of them. Which is silly, but now historical. Do
4594 note that the symbol is in fact locally defined. */
4595 DECL_EXTERNAL (decl
) = 0;
4597 /* Allow aliases to aliases. */
4598 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4599 cgraph_node (decl
)->alias
= true;
4601 cgraph_varpool_node (decl
)->alias
= true;
4603 /* If the target has already been emitted, we don't have to queue the
4604 alias. This saves a tad o memory. */
4605 target_decl
= find_decl_and_mark_needed (decl
, target
);
4606 if (target_decl
&& TREE_ASM_WRITTEN (target_decl
))
4607 do_assemble_alias (decl
, target
);
4612 p
= ggc_alloc (sizeof (struct alias_pair
));
4615 VEC_safe_push (alias_pair
, alias_pairs
, p
);
4619 /* Emit an assembler directive to set symbol for DECL visibility to
4620 the visibility type VIS, which must not be VISIBILITY_DEFAULT. */
4623 default_assemble_visibility (tree decl
, int vis
)
4625 static const char * const visibility_types
[] = {
4626 NULL
, "internal", "hidden", "protected"
4629 const char *name
, *type
;
4631 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
4632 type
= visibility_types
[vis
];
4634 #ifdef HAVE_GAS_HIDDEN
4635 fprintf (asm_out_file
, "\t.%s\t", type
);
4636 assemble_name (asm_out_file
, name
);
4637 fprintf (asm_out_file
, "\n");
4639 warning ("visibility attribute not supported in this configuration; ignored");
4643 /* A helper function to call assemble_visibility when needed for a decl. */
4646 maybe_assemble_visibility (tree decl
)
4648 enum symbol_visibility vis
= DECL_VISIBILITY (decl
);
4650 if (vis
!= VISIBILITY_DEFAULT
)
4651 targetm
.asm_out
.visibility (decl
, vis
);
4654 /* Returns 1 if the target configuration supports defining public symbols
4655 so that one of them will be chosen at link time instead of generating a
4656 multiply-defined symbol error, whether through the use of weak symbols or
4657 a target-specific mechanism for having duplicates discarded. */
4660 supports_one_only (void)
4662 if (SUPPORTS_ONE_ONLY
)
4664 return SUPPORTS_WEAK
;
4667 /* Set up DECL as a public symbol that can be defined in multiple
4668 translation units without generating a linker error. */
4671 make_decl_one_only (tree decl
)
4673 gcc_assert (TREE_CODE (decl
) == VAR_DECL
4674 || TREE_CODE (decl
) == FUNCTION_DECL
);
4676 TREE_PUBLIC (decl
) = 1;
4678 if (SUPPORTS_ONE_ONLY
)
4680 #ifdef MAKE_DECL_ONE_ONLY
4681 MAKE_DECL_ONE_ONLY (decl
);
4683 DECL_ONE_ONLY (decl
) = 1;
4685 else if (TREE_CODE (decl
) == VAR_DECL
4686 && (DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
))
4687 DECL_COMMON (decl
) = 1;
4690 gcc_assert (SUPPORTS_WEAK
);
4691 DECL_WEAK (decl
) = 1;
4696 init_varasm_once (void)
4698 in_named_htab
= htab_create_ggc (31, in_named_entry_hash
,
4699 in_named_entry_eq
, NULL
);
4700 const_desc_htab
= htab_create_ggc (1009, const_desc_hash
,
4701 const_desc_eq
, NULL
);
4703 const_alias_set
= new_alias_set ();
4706 static enum tls_model
4707 decl_tls_model (tree decl
)
4709 enum tls_model kind
;
4710 tree attr
= lookup_attribute ("tls_model", DECL_ATTRIBUTES (decl
));
4715 attr
= TREE_VALUE (TREE_VALUE (attr
));
4716 gcc_assert (TREE_CODE (attr
) == STRING_CST
);
4718 if (!strcmp (TREE_STRING_POINTER (attr
), "local-exec"))
4719 kind
= TLS_MODEL_LOCAL_EXEC
;
4720 else if (!strcmp (TREE_STRING_POINTER (attr
), "initial-exec"))
4721 kind
= TLS_MODEL_INITIAL_EXEC
;
4722 else if (!strcmp (TREE_STRING_POINTER (attr
), "local-dynamic"))
4723 kind
= optimize
? TLS_MODEL_LOCAL_DYNAMIC
: TLS_MODEL_GLOBAL_DYNAMIC
;
4724 else if (!strcmp (TREE_STRING_POINTER (attr
), "global-dynamic"))
4725 kind
= TLS_MODEL_GLOBAL_DYNAMIC
;
4731 is_local
= targetm
.binds_local_p (decl
);
4735 kind
= TLS_MODEL_LOCAL_EXEC
;
4737 kind
= TLS_MODEL_INITIAL_EXEC
;
4739 /* Local dynamic is inefficient when we're not combining the
4740 parts of the address. */
4741 else if (optimize
&& is_local
)
4742 kind
= TLS_MODEL_LOCAL_DYNAMIC
;
4744 kind
= TLS_MODEL_GLOBAL_DYNAMIC
;
4745 if (kind
< flag_tls_default
)
4746 kind
= flag_tls_default
;
4751 /* Select a set of attributes for section NAME based on the properties
4752 of DECL and whether or not RELOC indicates that DECL's initializer
4753 might contain runtime relocations.
4755 We make the section read-only and executable for a function decl,
4756 read-only for a const data decl, and writable for a non-const data decl. */
4759 default_section_type_flags (tree decl
, const char *name
, int reloc
)
4761 return default_section_type_flags_1 (decl
, name
, reloc
, flag_pic
);
4765 default_section_type_flags_1 (tree decl
, const char *name
, int reloc
,
4770 if (decl
&& TREE_CODE (decl
) == FUNCTION_DECL
)
4771 flags
= SECTION_CODE
;
4772 else if (decl
&& decl_readonly_section_1 (decl
, reloc
, shlib
))
4774 else if (unlikely_text_section_name
4775 && strcmp (name
, unlikely_text_section_name
) == 0)
4776 flags
= SECTION_CODE
;
4778 flags
= SECTION_WRITE
;
4780 if (decl
&& DECL_ONE_ONLY (decl
))
4781 flags
|= SECTION_LINKONCE
;
4783 if (decl
&& TREE_CODE (decl
) == VAR_DECL
&& DECL_THREAD_LOCAL (decl
))
4784 flags
|= SECTION_TLS
| SECTION_WRITE
;
4786 if (strcmp (name
, ".bss") == 0
4787 || strncmp (name
, ".bss.", 5) == 0
4788 || strncmp (name
, ".gnu.linkonce.b.", 16) == 0
4789 || strcmp (name
, ".sbss") == 0
4790 || strncmp (name
, ".sbss.", 6) == 0
4791 || strncmp (name
, ".gnu.linkonce.sb.", 17) == 0)
4792 flags
|= SECTION_BSS
;
4794 if (strcmp (name
, ".tdata") == 0
4795 || strncmp (name
, ".tdata.", 7) == 0
4796 || strncmp (name
, ".gnu.linkonce.td.", 17) == 0)
4797 flags
|= SECTION_TLS
;
4799 if (strcmp (name
, ".tbss") == 0
4800 || strncmp (name
, ".tbss.", 6) == 0
4801 || strncmp (name
, ".gnu.linkonce.tb.", 17) == 0)
4802 flags
|= SECTION_TLS
| SECTION_BSS
;
4804 /* These three sections have special ELF types. They are neither
4805 SHT_PROGBITS nor SHT_NOBITS, so when changing sections we don't
4806 want to print a section type (@progbits or @nobits). If someone
4807 is silly enough to emit code or TLS variables to one of these
4808 sections, then don't handle them specially. */
4809 if (!(flags
& (SECTION_CODE
| SECTION_BSS
| SECTION_TLS
))
4810 && (strcmp (name
, ".init_array") == 0
4811 || strcmp (name
, ".fini_array") == 0
4812 || strcmp (name
, ".preinit_array") == 0))
4813 flags
|= SECTION_NOTYPE
;
4818 /* Output assembly to switch to section NAME with attribute FLAGS.
4819 Four variants for common object file formats. */
4822 default_no_named_section (const char *name ATTRIBUTE_UNUSED
,
4823 unsigned int flags ATTRIBUTE_UNUSED
,
4824 tree decl ATTRIBUTE_UNUSED
)
4826 /* Some object formats don't support named sections at all. The
4827 front-end should already have flagged this as an error. */
4832 default_elf_asm_named_section (const char *name
, unsigned int flags
,
4833 tree decl ATTRIBUTE_UNUSED
)
4835 char flagchars
[10], *f
= flagchars
;
4837 /* If we have already declared this section, we can use an
4838 abbreviated form to switch back to it -- unless this section is
4839 part of a COMDAT groups, in which case GAS requires the full
4840 declaration every time. */
4841 if (!(HAVE_GAS_COMDAT_GROUP
&& (flags
& SECTION_LINKONCE
))
4842 && ! named_section_first_declaration (name
))
4844 fprintf (asm_out_file
, "\t.section\t%s\n", name
);
4848 if (!(flags
& SECTION_DEBUG
))
4850 if (flags
& SECTION_WRITE
)
4852 if (flags
& SECTION_CODE
)
4854 if (flags
& SECTION_SMALL
)
4856 if (flags
& SECTION_MERGE
)
4858 if (flags
& SECTION_STRINGS
)
4860 if (flags
& SECTION_TLS
)
4862 if (HAVE_GAS_COMDAT_GROUP
&& (flags
& SECTION_LINKONCE
))
4866 fprintf (asm_out_file
, "\t.section\t%s,\"%s\"", name
, flagchars
);
4868 if (!(flags
& SECTION_NOTYPE
))
4873 if (flags
& SECTION_BSS
)
4879 #ifdef ASM_COMMENT_START
4880 /* On platforms that use "@" as the assembly comment character,
4882 if (strcmp (ASM_COMMENT_START
, "@") == 0)
4885 fprintf (asm_out_file
, format
, type
);
4887 if (flags
& SECTION_ENTSIZE
)
4888 fprintf (asm_out_file
, ",%d", flags
& SECTION_ENTSIZE
);
4889 if (HAVE_GAS_COMDAT_GROUP
&& (flags
& SECTION_LINKONCE
))
4890 fprintf (asm_out_file
, ",%s,comdat",
4891 lang_hooks
.decls
.comdat_group (decl
));
4894 putc ('\n', asm_out_file
);
4898 default_coff_asm_named_section (const char *name
, unsigned int flags
,
4899 tree decl ATTRIBUTE_UNUSED
)
4901 char flagchars
[8], *f
= flagchars
;
4903 if (flags
& SECTION_WRITE
)
4905 if (flags
& SECTION_CODE
)
4909 fprintf (asm_out_file
, "\t.section\t%s,\"%s\"\n", name
, flagchars
);
4913 default_pe_asm_named_section (const char *name
, unsigned int flags
,
4916 default_coff_asm_named_section (name
, flags
, decl
);
4918 if (flags
& SECTION_LINKONCE
)
4920 /* Functions may have been compiled at various levels of
4921 optimization so we can't use `same_size' here.
4922 Instead, have the linker pick one. */
4923 fprintf (asm_out_file
, "\t.linkonce %s\n",
4924 (flags
& SECTION_CODE
? "discard" : "same_size"));
4928 /* The lame default section selector. */
4931 default_select_section (tree decl
, int reloc
,
4932 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
)
4934 bool readonly
= false;
4938 if (decl_readonly_section (decl
, reloc
))
4941 else if (TREE_CODE (decl
) == CONSTRUCTOR
)
4943 if (! ((flag_pic
&& reloc
)
4944 || !TREE_READONLY (decl
)
4945 || TREE_SIDE_EFFECTS (decl
)
4946 || !TREE_CONSTANT (decl
)))
4949 else if (TREE_CODE (decl
) == STRING_CST
)
4951 else if (! (flag_pic
&& reloc
))
4955 readonly_data_section ();
4960 /* A helper function for default_elf_select_section and
4961 default_elf_unique_section. Categorizes the DECL. */
4963 enum section_category
4968 SECCAT_RODATA_MERGE_STR
,
4969 SECCAT_RODATA_MERGE_STR_INIT
,
4970 SECCAT_RODATA_MERGE_CONST
,
4975 /* To optimize loading of shared programs, define following subsections
4977 _REL Contains data that has relocations, so they get grouped
4978 together and dynamic linker will visit fewer pages in memory.
4979 _RO Contains data that is otherwise read-only. This is useful
4980 with prelinking as most relocations won't be dynamically
4981 linked and thus stay read only.
4982 _LOCAL Marks data containing relocations only to local objects.
4983 These relocations will get fully resolved by prelinking. */
4985 SECCAT_DATA_REL_LOCAL
,
4987 SECCAT_DATA_REL_RO_LOCAL
,
4997 static enum section_category
4998 categorize_decl_for_section (tree
, int, int);
5000 static enum section_category
5001 categorize_decl_for_section (tree decl
, int reloc
, int shlib
)
5003 enum section_category ret
;
5005 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5007 else if (TREE_CODE (decl
) == STRING_CST
)
5009 if (flag_mudflap
) /* or !flag_merge_constants */
5010 return SECCAT_RODATA
;
5012 return SECCAT_RODATA_MERGE_STR
;
5014 else if (TREE_CODE (decl
) == VAR_DECL
)
5016 if (DECL_INITIAL (decl
) == NULL
5017 || DECL_INITIAL (decl
) == error_mark_node
5018 || (flag_zero_initialized_in_bss
5019 /* Leave constant zeroes in .rodata so they can be shared. */
5020 && !TREE_READONLY (decl
)
5021 && initializer_zerop (DECL_INITIAL (decl
))))
5023 else if (! TREE_READONLY (decl
)
5024 || TREE_SIDE_EFFECTS (decl
)
5025 || ! TREE_CONSTANT (DECL_INITIAL (decl
)))
5027 if (shlib
&& (reloc
& 2))
5028 ret
= SECCAT_DATA_REL
;
5029 else if (shlib
&& reloc
)
5030 ret
= SECCAT_DATA_REL_LOCAL
;
5034 else if (shlib
&& (reloc
& 2))
5035 ret
= SECCAT_DATA_REL_RO
;
5036 else if (shlib
&& reloc
)
5037 ret
= SECCAT_DATA_REL_RO_LOCAL
;
5038 else if (reloc
|| flag_merge_constants
< 2)
5039 /* C and C++ don't allow different variables to share the same
5040 location. -fmerge-all-constants allows even that (at the
5041 expense of not conforming). */
5042 ret
= SECCAT_RODATA
;
5043 else if (TREE_CODE (DECL_INITIAL (decl
)) == STRING_CST
)
5044 ret
= SECCAT_RODATA_MERGE_STR_INIT
;
5046 ret
= SECCAT_RODATA_MERGE_CONST
;
5048 else if (TREE_CODE (decl
) == CONSTRUCTOR
)
5050 if ((shlib
&& reloc
)
5051 || TREE_SIDE_EFFECTS (decl
)
5052 || ! TREE_CONSTANT (decl
))
5055 ret
= SECCAT_RODATA
;
5058 ret
= SECCAT_RODATA
;
5060 /* There are no read-only thread-local sections. */
5061 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_THREAD_LOCAL (decl
))
5063 /* Note that this would be *just* SECCAT_BSS, except that there's
5064 no concept of a read-only thread-local-data section. */
5065 if (ret
== SECCAT_BSS
5066 || (flag_zero_initialized_in_bss
5067 && initializer_zerop (DECL_INITIAL (decl
))))
5073 /* If the target uses small data sections, select it. */
5074 else if (targetm
.in_small_data_p (decl
))
5076 if (ret
== SECCAT_BSS
)
5078 else if (targetm
.have_srodata_section
&& ret
== SECCAT_RODATA
)
5079 ret
= SECCAT_SRODATA
;
5088 decl_readonly_section (tree decl
, int reloc
)
5090 return decl_readonly_section_1 (decl
, reloc
, flag_pic
);
5094 decl_readonly_section_1 (tree decl
, int reloc
, int shlib
)
5096 switch (categorize_decl_for_section (decl
, reloc
, shlib
))
5099 case SECCAT_RODATA_MERGE_STR
:
5100 case SECCAT_RODATA_MERGE_STR_INIT
:
5101 case SECCAT_RODATA_MERGE_CONST
:
5102 case SECCAT_SRODATA
:
5111 /* Select a section based on the above categorization. */
5114 default_elf_select_section (tree decl
, int reloc
,
5115 unsigned HOST_WIDE_INT align
)
5117 default_elf_select_section_1 (decl
, reloc
, align
, flag_pic
);
5121 default_elf_select_section_1 (tree decl
, int reloc
,
5122 unsigned HOST_WIDE_INT align
, int shlib
)
5125 switch (categorize_decl_for_section (decl
, reloc
, shlib
))
5128 /* We're not supposed to be called on FUNCTION_DECLs. */
5131 readonly_data_section ();
5133 case SECCAT_RODATA_MERGE_STR
:
5134 mergeable_string_section (decl
, align
, 0);
5136 case SECCAT_RODATA_MERGE_STR_INIT
:
5137 mergeable_string_section (DECL_INITIAL (decl
), align
, 0);
5139 case SECCAT_RODATA_MERGE_CONST
:
5140 mergeable_constant_section (DECL_MODE (decl
), align
, 0);
5142 case SECCAT_SRODATA
:
5148 case SECCAT_DATA_REL
:
5149 sname
= ".data.rel";
5151 case SECCAT_DATA_REL_LOCAL
:
5152 sname
= ".data.rel.local";
5154 case SECCAT_DATA_REL_RO
:
5155 sname
= ".data.rel.ro";
5157 case SECCAT_DATA_REL_RO_LOCAL
:
5158 sname
= ".data.rel.ro.local";
5167 #ifdef BSS_SECTION_ASM_OP
5186 named_section (decl
, sname
, reloc
);
5189 /* Construct a unique section name based on the decl name and the
5190 categorization performed above. */
5193 default_unique_section (tree decl
, int reloc
)
5195 default_unique_section_1 (decl
, reloc
, flag_pic
);
5199 default_unique_section_1 (tree decl
, int reloc
, int shlib
)
5201 bool one_only
= DECL_ONE_ONLY (decl
);
5202 const char *prefix
, *name
;
5206 switch (categorize_decl_for_section (decl
, reloc
, shlib
))
5209 prefix
= one_only
? ".gnu.linkonce.t." : ".text.";
5212 case SECCAT_RODATA_MERGE_STR
:
5213 case SECCAT_RODATA_MERGE_STR_INIT
:
5214 case SECCAT_RODATA_MERGE_CONST
:
5215 prefix
= one_only
? ".gnu.linkonce.r." : ".rodata.";
5217 case SECCAT_SRODATA
:
5218 prefix
= one_only
? ".gnu.linkonce.s2." : ".sdata2.";
5221 case SECCAT_DATA_REL
:
5222 case SECCAT_DATA_REL_LOCAL
:
5223 case SECCAT_DATA_REL_RO
:
5224 case SECCAT_DATA_REL_RO_LOCAL
:
5225 prefix
= one_only
? ".gnu.linkonce.d." : ".data.";
5228 prefix
= one_only
? ".gnu.linkonce.s." : ".sdata.";
5231 prefix
= one_only
? ".gnu.linkonce.b." : ".bss.";
5234 prefix
= one_only
? ".gnu.linkonce.sb." : ".sbss.";
5237 prefix
= one_only
? ".gnu.linkonce.td." : ".tdata.";
5240 prefix
= one_only
? ".gnu.linkonce.tb." : ".tbss.";
5245 plen
= strlen (prefix
);
5247 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
5248 name
= targetm
.strip_name_encoding (name
);
5249 nlen
= strlen (name
);
5251 string
= alloca (nlen
+ plen
+ 1);
5252 memcpy (string
, prefix
, plen
);
5253 memcpy (string
+ plen
, name
, nlen
+ 1);
5255 DECL_SECTION_NAME (decl
) = build_string (nlen
+ plen
, string
);
5259 default_select_rtx_section (enum machine_mode mode ATTRIBUTE_UNUSED
,
5261 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
)
5264 switch (GET_CODE (x
))
5276 readonly_data_section ();
5280 default_elf_select_rtx_section (enum machine_mode mode
, rtx x
,
5281 unsigned HOST_WIDE_INT align
)
5283 /* ??? Handle small data here somehow. */
5286 switch (GET_CODE (x
))
5290 named_section (NULL_TREE
, ".data.rel.ro", 3);
5294 named_section (NULL_TREE
, ".data.rel.ro.local", 1);
5301 mergeable_constant_section (mode
, align
, 0);
5304 /* Set the generally applicable flags on the SYMBOL_REF for EXP. */
5307 default_encode_section_info (tree decl
, rtx rtl
, int first ATTRIBUTE_UNUSED
)
5312 /* Careful not to prod global register variables. */
5315 symbol
= XEXP (rtl
, 0);
5316 if (GET_CODE (symbol
) != SYMBOL_REF
)
5320 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5321 flags
|= SYMBOL_FLAG_FUNCTION
;
5322 if (targetm
.binds_local_p (decl
))
5323 flags
|= SYMBOL_FLAG_LOCAL
;
5324 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_THREAD_LOCAL (decl
))
5325 flags
|= decl_tls_model (decl
) << SYMBOL_FLAG_TLS_SHIFT
;
5326 else if (targetm
.in_small_data_p (decl
))
5327 flags
|= SYMBOL_FLAG_SMALL
;
5328 /* ??? Why is DECL_EXTERNAL ever set for non-PUBLIC names? Without
5329 being PUBLIC, the thing *must* be defined in this translation unit.
5330 Prevent this buglet from being propagated into rtl code as well. */
5331 if (DECL_P (decl
) && DECL_EXTERNAL (decl
) && TREE_PUBLIC (decl
))
5332 flags
|= SYMBOL_FLAG_EXTERNAL
;
5334 SYMBOL_REF_FLAGS (symbol
) = flags
;
5337 /* By default, we do nothing for encode_section_info, so we need not
5338 do anything but discard the '*' marker. */
5341 default_strip_name_encoding (const char *str
)
5343 return str
+ (*str
== '*');
5346 /* Assume ELF-ish defaults, since that's pretty much the most liberal
5347 wrt cross-module name binding. */
5350 default_binds_local_p (tree exp
)
5352 return default_binds_local_p_1 (exp
, flag_shlib
);
5356 default_binds_local_p_1 (tree exp
, int shlib
)
5360 /* A non-decl is an entry in the constant pool. */
5363 /* Static variables are always local. */
5364 else if (! TREE_PUBLIC (exp
))
5366 /* A variable is local if the user explicitly tells us so. */
5367 else if (DECL_VISIBILITY_SPECIFIED (exp
) && DECL_VISIBILITY (exp
) != VISIBILITY_DEFAULT
)
5369 /* Otherwise, variables defined outside this object may not be local. */
5370 else if (DECL_EXTERNAL (exp
))
5372 /* Linkonce and weak data are never local. */
5373 else if (DECL_ONE_ONLY (exp
) || DECL_WEAK (exp
))
5375 /* If none of the above and visibility is not default, make local. */
5376 else if (DECL_VISIBILITY (exp
) != VISIBILITY_DEFAULT
)
5378 /* If PIC, then assume that any global name can be overridden by
5379 symbols resolved from other modules. */
5382 /* Uninitialized COMMON variable may be unified with symbols
5383 resolved from other modules. */
5384 else if (DECL_COMMON (exp
)
5385 && (DECL_INITIAL (exp
) == NULL
5386 || DECL_INITIAL (exp
) == error_mark_node
))
5388 /* Otherwise we're left with initialized (or non-common) global data
5389 which is of necessity defined locally. */
5396 /* Determine whether or not a pointer mode is valid. Assume defaults
5397 of ptr_mode or Pmode - can be overridden. */
5399 default_valid_pointer_mode (enum machine_mode mode
)
5401 return (mode
== ptr_mode
|| mode
== Pmode
);
5404 /* Default function to output code that will globalize a label. A
5405 target must define GLOBAL_ASM_OP or provide it's own function to
5406 globalize a label. */
5407 #ifdef GLOBAL_ASM_OP
5409 default_globalize_label (FILE * stream
, const char *name
)
5411 fputs (GLOBAL_ASM_OP
, stream
);
5412 assemble_name (stream
, name
);
5413 putc ('\n', stream
);
5415 #endif /* GLOBAL_ASM_OP */
5417 /* Default function to output a label for unwind information. The
5418 default is to do nothing. A target that needs nonlocal labels for
5419 unwind information must provide its own function to do this. */
5421 default_emit_unwind_label (FILE * stream ATTRIBUTE_UNUSED
,
5422 tree decl ATTRIBUTE_UNUSED
,
5423 int for_eh ATTRIBUTE_UNUSED
,
5424 int empty ATTRIBUTE_UNUSED
)
5428 /* This is how to output an internal numbered label where PREFIX is
5429 the class of label and LABELNO is the number within the class. */
5432 default_internal_label (FILE *stream
, const char *prefix
,
5433 unsigned long labelno
)
5435 char *const buf
= alloca (40 + strlen (prefix
));
5436 ASM_GENERATE_INTERNAL_LABEL (buf
, prefix
, labelno
);
5437 ASM_OUTPUT_INTERNAL_LABEL (stream
, buf
);
5440 /* This is the default behavior at the beginning of a file. It's
5441 controlled by two other target-hook toggles. */
5443 default_file_start (void)
5445 if (targetm
.file_start_app_off
&& !flag_verbose_asm
)
5446 fputs (ASM_APP_OFF
, asm_out_file
);
5448 if (targetm
.file_start_file_directive
)
5449 output_file_directive (asm_out_file
, main_input_filename
);
5452 /* This is a generic routine suitable for use as TARGET_ASM_FILE_END
5453 which emits a special section directive used to indicate whether or
5454 not this object file needs an executable stack. This is primarily
5455 a GNU extension to ELF but could be used on other targets. */
5457 int trampolines_created
;
5460 file_end_indicate_exec_stack (void)
5462 unsigned int flags
= SECTION_DEBUG
;
5463 if (trampolines_created
)
5464 flags
|= SECTION_CODE
;
5466 named_section_flags (".note.GNU-stack", flags
);
5469 #include "gt-varasm.h"