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, 2006, 2007, 2008, 2009,
4 2010, 2011 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 3, 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 COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
23 /* This file handles generation of all the assembler code
24 *except* the instructions of a function.
25 This includes declarations of variables and their initial values.
27 We also output the assembler code for constants stored in memory
28 and are responsible for combining constants with the same value. */
32 #include "coretypes.h"
39 #include "hard-reg-set.h"
42 #include "diagnostic-core.h"
45 #include "langhooks.h"
49 #include "common/common-target.h"
50 #include "targhooks.h"
51 #include "tree-mudflap.h"
53 #include "cfglayout.h"
54 #include "basic-block.h"
55 #include "tree-iterator.h"
56 #include "pointer-set.h"
58 #ifdef XCOFF_DEBUGGING_INFO
59 #include "xcoffout.h" /* Needed for external data
60 declarations for e.g. AIX 4.x. */
63 /* The (assembler) name of the first globally-visible object output. */
64 extern GTY(()) const char *first_global_object_name
;
65 extern GTY(()) const char *weak_global_object_name
;
67 const char *first_global_object_name
;
68 const char *weak_global_object_name
;
71 struct constant_descriptor_rtx
;
72 struct rtx_constant_pool
;
74 #define n_deferred_constants (crtl->varasm.deferred_constants)
76 /* Number for making the label on the next
77 constant that is stored in memory. */
79 static GTY(()) int const_labelno
;
81 /* Carry information from ASM_DECLARE_OBJECT_NAME
82 to ASM_FINISH_DECLARE_OBJECT. */
84 int size_directive_output
;
86 /* The last decl for which assemble_variable was called,
87 if it did ASM_DECLARE_OBJECT_NAME.
88 If the last call to assemble_variable didn't do that,
91 tree last_assemble_variable_decl
;
93 /* The following global variable indicates if the first basic block
94 in a function belongs to the cold partition or not. */
96 bool first_function_block_is_cold
;
98 /* We give all constants their own alias set. Perhaps redundant with
99 MEM_READONLY_P, but pre-dates it. */
101 static alias_set_type const_alias_set
;
103 /* Whether we saw any functions with no_split_stack. */
105 static bool saw_no_split_stack
;
107 static const char *strip_reg_name (const char *);
108 static int contains_pointers_p (tree
);
109 #ifdef ASM_OUTPUT_EXTERNAL
110 static bool incorporeal_function_p (tree
);
112 static void decode_addr_const (tree
, struct addr_const
*);
113 static hashval_t
const_desc_hash (const void *);
114 static int const_desc_eq (const void *, const void *);
115 static hashval_t
const_hash_1 (const tree
);
116 static int compare_constant (const tree
, const tree
);
117 static tree
copy_constant (tree
);
118 static void output_constant_def_contents (rtx
);
119 static void output_addressed_constants (tree
);
120 static unsigned HOST_WIDE_INT
array_size_for_constructor (tree
);
121 static unsigned min_align (unsigned, unsigned);
122 static void globalize_decl (tree
);
123 static bool decl_readonly_section_1 (enum section_category
);
124 #ifdef BSS_SECTION_ASM_OP
125 #ifdef ASM_OUTPUT_ALIGNED_BSS
126 static void asm_output_aligned_bss (FILE *, tree
, const char *,
127 unsigned HOST_WIDE_INT
, int)
130 #endif /* BSS_SECTION_ASM_OP */
131 static void mark_weak (tree
);
132 static void output_constant_pool (const char *, tree
);
134 /* Well-known sections, each one associated with some sort of *_ASM_OP. */
135 section
*text_section
;
136 section
*data_section
;
137 section
*readonly_data_section
;
138 section
*sdata_section
;
139 section
*ctors_section
;
140 section
*dtors_section
;
141 section
*bss_section
;
142 section
*sbss_section
;
144 /* Various forms of common section. All are guaranteed to be nonnull. */
145 section
*tls_comm_section
;
146 section
*comm_section
;
147 section
*lcomm_section
;
149 /* A SECTION_NOSWITCH section used for declaring global BSS variables.
151 section
*bss_noswitch_section
;
153 /* The section that holds the main exception table, when known. The section
154 is set either by the target's init_sections hook or by the first call to
155 switch_to_exception_section. */
156 section
*exception_section
;
158 /* The section that holds the DWARF2 frame unwind information, when known.
159 The section is set either by the target's init_sections hook or by the
160 first call to switch_to_eh_frame_section. */
161 section
*eh_frame_section
;
163 /* asm_out_file's current section. This is NULL if no section has yet
164 been selected or if we lose track of what the current section is. */
167 /* True if code for the current function is currently being directed
168 at the cold section. */
169 bool in_cold_section_p
;
171 /* A linked list of all the unnamed sections. */
172 static GTY(()) section
*unnamed_sections
;
174 /* Return a nonzero value if DECL has a section attribute. */
175 #define IN_NAMED_SECTION(DECL) \
176 ((TREE_CODE (DECL) == FUNCTION_DECL || TREE_CODE (DECL) == VAR_DECL) \
177 && DECL_SECTION_NAME (DECL) != NULL_TREE)
179 /* Hash table of named sections. */
180 static GTY((param_is (section
))) htab_t section_htab
;
182 /* A table of object_blocks, indexed by section. */
183 static GTY((param_is (struct object_block
))) htab_t object_block_htab
;
185 /* The next number to use for internal anchor labels. */
186 static GTY(()) int anchor_labelno
;
188 /* A pool of constants that can be shared between functions. */
189 static GTY(()) struct rtx_constant_pool
*shared_constant_pool
;
191 /* Helper routines for maintaining section_htab. */
194 section_entry_eq (const void *p1
, const void *p2
)
196 const section
*old
= (const section
*) p1
;
197 const char *new_name
= (const char *) p2
;
199 return strcmp (old
->named
.name
, new_name
) == 0;
203 section_entry_hash (const void *p
)
205 const section
*old
= (const section
*) p
;
206 return htab_hash_string (old
->named
.name
);
209 /* Return a hash value for section SECT. */
212 hash_section (section
*sect
)
214 if (sect
->common
.flags
& SECTION_NAMED
)
215 return htab_hash_string (sect
->named
.name
);
216 return sect
->common
.flags
;
219 /* Helper routines for maintaining object_block_htab. */
222 object_block_entry_eq (const void *p1
, const void *p2
)
224 const struct object_block
*old
= (const struct object_block
*) p1
;
225 const section
*new_section
= (const section
*) p2
;
227 return old
->sect
== new_section
;
231 object_block_entry_hash (const void *p
)
233 const struct object_block
*old
= (const struct object_block
*) p
;
234 return hash_section (old
->sect
);
237 /* Return a new unnamed section with the given fields. */
240 get_unnamed_section (unsigned int flags
, void (*callback
) (const void *),
245 sect
= ggc_alloc_section ();
246 sect
->unnamed
.common
.flags
= flags
| SECTION_UNNAMED
;
247 sect
->unnamed
.callback
= callback
;
248 sect
->unnamed
.data
= data
;
249 sect
->unnamed
.next
= unnamed_sections
;
251 unnamed_sections
= sect
;
255 /* Return a SECTION_NOSWITCH section with the given fields. */
258 get_noswitch_section (unsigned int flags
, noswitch_section_callback callback
)
262 sect
= ggc_alloc_section ();
263 sect
->noswitch
.common
.flags
= flags
| SECTION_NOSWITCH
;
264 sect
->noswitch
.callback
= callback
;
269 /* Return the named section structure associated with NAME. Create
270 a new section with the given fields if no such structure exists. */
273 get_section (const char *name
, unsigned int flags
, tree decl
)
275 section
*sect
, **slot
;
278 htab_find_slot_with_hash (section_htab
, name
,
279 htab_hash_string (name
), INSERT
);
280 flags
|= SECTION_NAMED
;
283 sect
= ggc_alloc_section ();
284 sect
->named
.common
.flags
= flags
;
285 sect
->named
.name
= ggc_strdup (name
);
286 sect
->named
.decl
= decl
;
292 if ((sect
->common
.flags
& ~SECTION_DECLARED
) != flags
293 && ((sect
->common
.flags
| flags
) & SECTION_OVERRIDE
) == 0)
295 /* It is fine if one of the section flags is
296 SECTION_WRITE | SECTION_RELRO and the other has none of these
297 flags (i.e. read-only) in named sections and either the
298 section hasn't been declared yet or has been declared as writable.
299 In that case just make sure the resulting flags are
300 SECTION_WRITE | SECTION_RELRO, ie. writable only because of
302 if (((sect
->common
.flags
^ flags
) & (SECTION_WRITE
| SECTION_RELRO
))
303 == (SECTION_WRITE
| SECTION_RELRO
)
304 && (sect
->common
.flags
305 & ~(SECTION_DECLARED
| SECTION_WRITE
| SECTION_RELRO
))
306 == (flags
& ~(SECTION_WRITE
| SECTION_RELRO
))
307 && ((sect
->common
.flags
& SECTION_DECLARED
) == 0
308 || (sect
->common
.flags
& SECTION_WRITE
)))
310 sect
->common
.flags
|= (SECTION_WRITE
| SECTION_RELRO
);
313 /* Sanity check user variables for flag changes. */
315 decl
= sect
->named
.decl
;
317 error ("%+D causes a section type conflict with %D",
318 decl
, sect
->named
.decl
);
319 if (decl
!= sect
->named
.decl
)
320 inform (DECL_SOURCE_LOCATION (sect
->named
.decl
),
321 "%qD was declared here", sect
->named
.decl
);
322 /* Make sure we don't error about one section multiple times. */
323 sect
->common
.flags
|= SECTION_OVERRIDE
;
329 /* Return true if the current compilation mode benefits from having
330 objects grouped into blocks. */
333 use_object_blocks_p (void)
335 return flag_section_anchors
;
338 /* Return the object_block structure for section SECT. Create a new
339 structure if we haven't created one already. Return null if SECT
342 static struct object_block
*
343 get_block_for_section (section
*sect
)
345 struct object_block
*block
;
351 slot
= htab_find_slot_with_hash (object_block_htab
, sect
,
352 hash_section (sect
), INSERT
);
353 block
= (struct object_block
*) *slot
;
356 block
= ggc_alloc_cleared_object_block ();
363 /* Create a symbol with label LABEL and place it at byte offset
364 OFFSET in BLOCK. OFFSET can be negative if the symbol's offset
365 is not yet known. LABEL must be a garbage-collected string. */
368 create_block_symbol (const char *label
, struct object_block
*block
,
369 HOST_WIDE_INT offset
)
374 /* Create the extended SYMBOL_REF. */
375 size
= RTX_HDR_SIZE
+ sizeof (struct block_symbol
);
376 symbol
= ggc_alloc_zone_rtx_def (size
, &rtl_zone
);
378 /* Initialize the normal SYMBOL_REF fields. */
379 memset (symbol
, 0, size
);
380 PUT_CODE (symbol
, SYMBOL_REF
);
381 PUT_MODE (symbol
, Pmode
);
382 XSTR (symbol
, 0) = label
;
383 SYMBOL_REF_FLAGS (symbol
) = SYMBOL_FLAG_HAS_BLOCK_INFO
;
385 /* Initialize the block_symbol stuff. */
386 SYMBOL_REF_BLOCK (symbol
) = block
;
387 SYMBOL_REF_BLOCK_OFFSET (symbol
) = offset
;
392 /* Return a section with a particular name and with whatever SECTION_*
393 flags section_type_flags deems appropriate. The name of the section
394 is taken from NAME if nonnull, otherwise it is taken from DECL's
395 DECL_SECTION_NAME. DECL is the decl associated with the section
396 (see the section comment for details) and RELOC is as for
397 section_type_flags. */
400 get_named_section (tree decl
, const char *name
, int reloc
)
404 gcc_assert (!decl
|| DECL_P (decl
));
406 name
= TREE_STRING_POINTER (DECL_SECTION_NAME (decl
));
408 flags
= targetm
.section_type_flags (decl
, name
, reloc
);
410 return get_section (name
, flags
, decl
);
413 /* If required, set DECL_SECTION_NAME to a unique name. */
416 resolve_unique_section (tree decl
, int reloc ATTRIBUTE_UNUSED
,
417 int flag_function_or_data_sections
)
419 if (DECL_SECTION_NAME (decl
) == NULL_TREE
420 && targetm_common
.have_named_sections
421 && (flag_function_or_data_sections
422 || DECL_ONE_ONLY (decl
)))
424 targetm
.asm_out
.unique_section (decl
, reloc
);
425 DECL_HAS_IMPLICIT_SECTION_NAME_P (decl
) = true;
429 #ifdef BSS_SECTION_ASM_OP
431 #ifdef ASM_OUTPUT_ALIGNED_BSS
433 /* Utility function for targets to use in implementing
434 ASM_OUTPUT_ALIGNED_BSS.
435 ??? It is believed that this function will work in most cases so such
436 support is localized here. */
439 asm_output_aligned_bss (FILE *file
, tree decl ATTRIBUTE_UNUSED
,
440 const char *name
, unsigned HOST_WIDE_INT size
,
443 switch_to_section (bss_section
);
444 ASM_OUTPUT_ALIGN (file
, floor_log2 (align
/ BITS_PER_UNIT
));
445 #ifdef ASM_DECLARE_OBJECT_NAME
446 last_assemble_variable_decl
= decl
;
447 ASM_DECLARE_OBJECT_NAME (file
, name
, decl
);
449 /* Standard thing is just output label for the object. */
450 ASM_OUTPUT_LABEL (file
, name
);
451 #endif /* ASM_DECLARE_OBJECT_NAME */
452 ASM_OUTPUT_SKIP (file
, size
? size
: 1);
457 #endif /* BSS_SECTION_ASM_OP */
459 #ifndef USE_SELECT_SECTION_FOR_FUNCTIONS
460 /* Return the hot section for function DECL. Return text_section for
464 hot_function_section (tree decl
)
466 if (decl
!= NULL_TREE
467 && DECL_SECTION_NAME (decl
) != NULL_TREE
468 && targetm_common
.have_named_sections
)
469 return get_named_section (decl
, NULL
, 0);
475 /* Return section for TEXT_SECTION_NAME if DECL or DECL_SECTION_NAME (DECL)
478 When DECL_SECTION_NAME is non-NULL and it is implicit section and
479 NAMED_SECTION_SUFFIX is non-NULL, then produce section called
480 concatenate the name with NAMED_SECTION_SUFFIX.
481 Otherwise produce "TEXT_SECTION_NAME.IMPLICIT_NAME". */
484 get_named_text_section (tree decl
,
485 const char *text_section_name
,
486 const char *named_section_suffix
)
488 if (decl
&& DECL_SECTION_NAME (decl
))
490 if (named_section_suffix
)
492 tree dsn
= DECL_SECTION_NAME (decl
);
493 const char *stripped_name
;
496 name
= (char *) alloca (TREE_STRING_LENGTH (dsn
) + 1);
497 memcpy (name
, TREE_STRING_POINTER (dsn
),
498 TREE_STRING_LENGTH (dsn
) + 1);
500 stripped_name
= targetm
.strip_name_encoding (name
);
502 buffer
= ACONCAT ((stripped_name
, named_section_suffix
, NULL
));
503 return get_named_section (decl
, buffer
, 0);
505 else if (DECL_HAS_IMPLICIT_SECTION_NAME_P (decl
))
509 /* Do not try to split gnu_linkonce functions. This gets somewhat
511 if (DECL_ONE_ONLY (decl
) && !HAVE_COMDAT_GROUP
)
513 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
514 name
= targetm
.strip_name_encoding (name
);
515 return get_named_section (decl
, ACONCAT ((text_section_name
, ".",
521 return get_named_section (decl
, text_section_name
, 0);
524 /* Choose named function section based on its frequency. */
527 default_function_section (tree decl
, enum node_frequency freq
,
528 bool startup
, bool exit
)
530 #if defined HAVE_LD_EH_GC_SECTIONS && defined HAVE_LD_EH_GC_SECTIONS_BUG
531 /* Old GNU linkers have buggy --gc-section support, which sometimes
532 results in .gcc_except_table* sections being garbage collected. */
534 && DECL_SECTION_NAME (decl
)
535 && DECL_HAS_IMPLICIT_SECTION_NAME_P (decl
))
539 if (!flag_reorder_functions
540 || !targetm_common
.have_named_sections
)
542 /* Startup code should go to startup subsection unless it is
543 unlikely executed (this happens especially with function splitting
544 where we can split away unnecesary parts of static constructors. */
545 if (startup
&& freq
!= NODE_FREQUENCY_UNLIKELY_EXECUTED
)
546 return get_named_text_section (decl
, ".text.startup", NULL
);
548 /* Similarly for exit. */
549 if (exit
&& freq
!= NODE_FREQUENCY_UNLIKELY_EXECUTED
)
550 return get_named_text_section (decl
, ".text.exit", NULL
);
552 /* Group cold functions together, similarly for hot code. */
555 case NODE_FREQUENCY_UNLIKELY_EXECUTED
:
556 return get_named_text_section (decl
, ".text.unlikely", NULL
);
557 case NODE_FREQUENCY_HOT
:
558 return get_named_text_section (decl
, ".text.hot", NULL
);
564 /* Return the section for function DECL.
566 If DECL is NULL_TREE, return the text section. We can be passed
567 NULL_TREE under some circumstances by dbxout.c at least.
569 If FORCE_COLD is true, return cold function section ignoring
570 the frequency info of cgraph_node. */
573 function_section_1 (tree decl
, bool force_cold
)
575 section
*section
= NULL
;
576 enum node_frequency freq
= NODE_FREQUENCY_NORMAL
;
577 bool startup
= false, exit
= false;
581 struct cgraph_node
*node
= cgraph_get_node (decl
);
585 freq
= node
->frequency
;
586 startup
= node
->only_called_at_startup
;
587 exit
= node
->only_called_at_exit
;
591 freq
= NODE_FREQUENCY_UNLIKELY_EXECUTED
;
593 #ifdef USE_SELECT_SECTION_FOR_FUNCTIONS
594 if (decl
!= NULL_TREE
595 && DECL_SECTION_NAME (decl
) != NULL_TREE
)
597 if (targetm
.asm_out
.function_section
)
598 section
= targetm
.asm_out
.function_section (decl
, freq
,
602 return get_named_section (decl
, NULL
, 0);
605 return targetm
.asm_out
.select_section
606 (decl
, freq
== NODE_FREQUENCY_UNLIKELY_EXECUTED
,
609 if (targetm
.asm_out
.function_section
)
610 section
= targetm
.asm_out
.function_section (decl
, freq
, startup
, exit
);
613 return hot_function_section (decl
);
617 /* Return the section for function DECL.
619 If DECL is NULL_TREE, return the text section. We can be passed
620 NULL_TREE under some circumstances by dbxout.c at least. */
623 function_section (tree decl
)
625 /* Handle cases where function splitting code decides
626 to put function entry point into unlikely executed section
627 despite the fact that the function itself is not cold
628 (i.e. it is called rarely but contains a hot loop that is
629 better to live in hot subsection for the code locality). */
630 return function_section_1 (decl
,
631 first_function_block_is_cold
);
634 /* Return the section for the current function, take IN_COLD_SECTION_P
638 current_function_section (void)
640 return function_section_1 (current_function_decl
, in_cold_section_p
);
643 /* Tell assembler to switch to unlikely-to-be-executed text section. */
646 unlikely_text_section (void)
648 return function_section_1 (current_function_decl
, true);
651 /* When called within a function context, return true if the function
652 has been assigned a cold text section and if SECT is that section.
653 When called outside a function context, return true if SECT is the
654 default cold section. */
657 unlikely_text_section_p (section
*sect
)
659 return sect
== function_section_1 (current_function_decl
, true);
662 /* Return the read-only data section associated with function DECL. */
665 default_function_rodata_section (tree decl
)
667 if (decl
!= NULL_TREE
&& DECL_SECTION_NAME (decl
))
669 const char *name
= TREE_STRING_POINTER (DECL_SECTION_NAME (decl
));
671 if (DECL_ONE_ONLY (decl
) && HAVE_COMDAT_GROUP
)
677 dot
= strchr (name
+ 1, '.');
680 len
= strlen (dot
) + 8;
681 rname
= (char *) alloca (len
);
683 strcpy (rname
, ".rodata");
685 return get_section (rname
, SECTION_LINKONCE
, decl
);
687 /* For .gnu.linkonce.t.foo we want to use .gnu.linkonce.r.foo. */
688 else if (DECL_ONE_ONLY (decl
)
689 && strncmp (name
, ".gnu.linkonce.t.", 16) == 0)
691 size_t len
= strlen (name
) + 1;
692 char *rname
= (char *) alloca (len
);
694 memcpy (rname
, name
, len
);
696 return get_section (rname
, SECTION_LINKONCE
, decl
);
698 /* For .text.foo we want to use .rodata.foo. */
699 else if (flag_function_sections
&& flag_data_sections
700 && strncmp (name
, ".text.", 6) == 0)
702 size_t len
= strlen (name
) + 1;
703 char *rname
= (char *) alloca (len
+ 2);
705 memcpy (rname
, ".rodata", 7);
706 memcpy (rname
+ 7, name
+ 5, len
- 5);
707 return get_section (rname
, 0, decl
);
711 return readonly_data_section
;
714 /* Return the read-only data section associated with function DECL
715 for targets where that section should be always the single
716 readonly data section. */
719 default_no_function_rodata_section (tree decl ATTRIBUTE_UNUSED
)
721 return readonly_data_section
;
724 /* Return the section to use for string merging. */
727 mergeable_string_section (tree decl ATTRIBUTE_UNUSED
,
728 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
,
729 unsigned int flags ATTRIBUTE_UNUSED
)
733 if (HAVE_GAS_SHF_MERGE
&& flag_merge_constants
734 && TREE_CODE (decl
) == STRING_CST
735 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
737 && (len
= int_size_in_bytes (TREE_TYPE (decl
))) > 0
738 && TREE_STRING_LENGTH (decl
) >= len
)
740 enum machine_mode mode
;
741 unsigned int modesize
;
745 const char *prefix
= targetm
.asm_out
.mergeable_rodata_prefix
;
746 char *name
= (char *) alloca (strlen (prefix
) + 30);
748 mode
= TYPE_MODE (TREE_TYPE (TREE_TYPE (decl
)));
749 modesize
= GET_MODE_BITSIZE (mode
);
750 if (modesize
>= 8 && modesize
<= 256
751 && (modesize
& (modesize
- 1)) == 0)
753 if (align
< modesize
)
756 str
= TREE_STRING_POINTER (decl
);
757 unit
= GET_MODE_SIZE (mode
);
759 /* Check for embedded NUL characters. */
760 for (i
= 0; i
< len
; i
+= unit
)
762 for (j
= 0; j
< unit
; j
++)
763 if (str
[i
+ j
] != '\0')
770 sprintf (name
, "%s.str%d.%d", prefix
,
771 modesize
/ 8, (int) (align
/ 8));
772 flags
|= (modesize
/ 8) | SECTION_MERGE
| SECTION_STRINGS
;
773 return get_section (name
, flags
, NULL
);
778 return readonly_data_section
;
781 /* Return the section to use for constant merging. */
784 mergeable_constant_section (enum machine_mode mode ATTRIBUTE_UNUSED
,
785 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
,
786 unsigned int flags ATTRIBUTE_UNUSED
)
788 unsigned int modesize
= GET_MODE_BITSIZE (mode
);
790 if (HAVE_GAS_SHF_MERGE
&& flag_merge_constants
796 && (align
& (align
- 1)) == 0)
798 const char *prefix
= targetm
.asm_out
.mergeable_rodata_prefix
;
799 char *name
= (char *) alloca (strlen (prefix
) + 30);
801 sprintf (name
, "%s.cst%d", prefix
, (int) (align
/ 8));
802 flags
|= (align
/ 8) | SECTION_MERGE
;
803 return get_section (name
, flags
, NULL
);
805 return readonly_data_section
;
808 /* Given NAME, a putative register name, discard any customary prefixes. */
811 strip_reg_name (const char *name
)
813 #ifdef REGISTER_PREFIX
814 if (!strncmp (name
, REGISTER_PREFIX
, strlen (REGISTER_PREFIX
)))
815 name
+= strlen (REGISTER_PREFIX
);
817 if (name
[0] == '%' || name
[0] == '#')
822 /* The user has asked for a DECL to have a particular name. Set (or
823 change) it in such a way that we don't prefix an underscore to
826 set_user_assembler_name (tree decl
, const char *name
)
828 char *starred
= (char *) alloca (strlen (name
) + 2);
830 strcpy (starred
+ 1, name
);
831 change_decl_assembler_name (decl
, get_identifier (starred
));
832 SET_DECL_RTL (decl
, NULL_RTX
);
835 /* Decode an `asm' spec for a declaration as a register name.
836 Return the register number, or -1 if nothing specified,
837 or -2 if the ASMSPEC is not `cc' or `memory' and is not recognized,
838 or -3 if ASMSPEC is `cc' and is not recognized,
839 or -4 if ASMSPEC is `memory' and is not recognized.
840 Accept an exact spelling or a decimal number.
841 Prefixes such as % are optional. */
844 decode_reg_name_and_count (const char *asmspec
, int *pnregs
)
846 /* Presume just one register is clobbered. */
853 /* Get rid of confusing prefixes. */
854 asmspec
= strip_reg_name (asmspec
);
856 /* Allow a decimal number as a "register name". */
857 for (i
= strlen (asmspec
) - 1; i
>= 0; i
--)
858 if (! ISDIGIT (asmspec
[i
]))
860 if (asmspec
[0] != 0 && i
< 0)
863 if (i
< FIRST_PSEUDO_REGISTER
&& i
>= 0)
869 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
871 && ! strcmp (asmspec
, strip_reg_name (reg_names
[i
])))
874 #ifdef OVERLAPPING_REGISTER_NAMES
878 const char *const name
;
881 } table
[] = OVERLAPPING_REGISTER_NAMES
;
883 for (i
= 0; i
< (int) ARRAY_SIZE (table
); i
++)
885 && ! strcmp (asmspec
, table
[i
].name
))
887 *pnregs
= table
[i
].nregs
;
888 return table
[i
].number
;
891 #endif /* OVERLAPPING_REGISTER_NAMES */
893 #ifdef ADDITIONAL_REGISTER_NAMES
895 static const struct { const char *const name
; const int number
; } table
[]
896 = ADDITIONAL_REGISTER_NAMES
;
898 for (i
= 0; i
< (int) ARRAY_SIZE (table
); i
++)
900 && ! strcmp (asmspec
, table
[i
].name
))
901 return table
[i
].number
;
903 #endif /* ADDITIONAL_REGISTER_NAMES */
905 if (!strcmp (asmspec
, "memory"))
908 if (!strcmp (asmspec
, "cc"))
918 decode_reg_name (const char *name
)
921 return decode_reg_name_and_count (name
, &count
);
925 /* Return true if DECL's initializer is suitable for a BSS section. */
928 bss_initializer_p (const_tree decl
)
930 return (DECL_INITIAL (decl
) == NULL
931 || DECL_INITIAL (decl
) == error_mark_node
932 || (flag_zero_initialized_in_bss
933 /* Leave constant zeroes in .rodata so they
935 && !TREE_READONLY (decl
)
936 && initializer_zerop (DECL_INITIAL (decl
))));
939 /* Compute the alignment of variable specified by DECL.
940 DONT_OUTPUT_DATA is from assemble_variable. */
943 align_variable (tree decl
, bool dont_output_data
)
945 unsigned int align
= DECL_ALIGN (decl
);
947 /* In the case for initialing an array whose length isn't specified,
948 where we have not yet been able to do the layout,
949 figure out the proper alignment now. */
950 if (dont_output_data
&& DECL_SIZE (decl
) == 0
951 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
)
952 align
= MAX (align
, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl
))));
954 /* Some object file formats have a maximum alignment which they support.
955 In particular, a.out format supports a maximum alignment of 4. */
956 if (align
> MAX_OFILE_ALIGNMENT
)
958 warning (0, "alignment of %q+D is greater than maximum object "
959 "file alignment. Using %d", decl
,
960 MAX_OFILE_ALIGNMENT
/BITS_PER_UNIT
);
961 align
= MAX_OFILE_ALIGNMENT
;
964 /* On some machines, it is good to increase alignment sometimes. */
965 if (! DECL_USER_ALIGN (decl
))
967 #ifdef DATA_ALIGNMENT
968 unsigned int data_align
= DATA_ALIGNMENT (TREE_TYPE (decl
), align
);
969 /* Don't increase alignment too much for TLS variables - TLS space
971 if (! DECL_THREAD_LOCAL_P (decl
) || data_align
<= BITS_PER_WORD
)
974 #ifdef CONSTANT_ALIGNMENT
975 if (DECL_INITIAL (decl
) != 0 && DECL_INITIAL (decl
) != error_mark_node
)
977 unsigned int const_align
= CONSTANT_ALIGNMENT (DECL_INITIAL (decl
),
979 /* Don't increase alignment too much for TLS variables - TLS space
981 if (! DECL_THREAD_LOCAL_P (decl
) || const_align
<= BITS_PER_WORD
)
987 /* Reset the alignment in case we have made it tighter, so we can benefit
988 from it in get_pointer_alignment. */
989 DECL_ALIGN (decl
) = align
;
992 /* Return the section into which the given VAR_DECL or CONST_DECL
993 should be placed. PREFER_NOSWITCH_P is true if a noswitch
994 section should be used wherever possible. */
997 get_variable_section (tree decl
, bool prefer_noswitch_p
)
999 addr_space_t as
= ADDR_SPACE_GENERIC
;
1002 if (TREE_TYPE (decl
) != error_mark_node
)
1003 as
= TYPE_ADDR_SPACE (TREE_TYPE (decl
));
1005 if (DECL_COMMON (decl
))
1007 /* If the decl has been given an explicit section name, or it resides
1008 in a non-generic address space, then it isn't common, and shouldn't
1009 be handled as such. */
1010 gcc_assert (DECL_SECTION_NAME (decl
) == NULL
1011 && ADDR_SPACE_GENERIC_P (as
));
1012 if (DECL_THREAD_LOCAL_P (decl
))
1013 return tls_comm_section
;
1014 else if (TREE_PUBLIC (decl
) && bss_initializer_p (decl
))
1015 return comm_section
;
1018 if (DECL_INITIAL (decl
) == error_mark_node
)
1019 reloc
= contains_pointers_p (TREE_TYPE (decl
)) ? 3 : 0;
1020 else if (DECL_INITIAL (decl
))
1021 reloc
= compute_reloc_for_constant (DECL_INITIAL (decl
));
1025 resolve_unique_section (decl
, reloc
, flag_data_sections
);
1026 if (IN_NAMED_SECTION (decl
))
1027 return get_named_section (decl
, NULL
, reloc
);
1029 if (ADDR_SPACE_GENERIC_P (as
)
1030 && !DECL_THREAD_LOCAL_P (decl
)
1031 && !(prefer_noswitch_p
&& targetm
.have_switchable_bss_sections
)
1032 && bss_initializer_p (decl
))
1034 if (!TREE_PUBLIC (decl
))
1035 return lcomm_section
;
1036 if (bss_noswitch_section
)
1037 return bss_noswitch_section
;
1040 return targetm
.asm_out
.select_section (decl
, reloc
, DECL_ALIGN (decl
));
1043 /* Return the block into which object_block DECL should be placed. */
1045 static struct object_block
*
1046 get_block_for_decl (tree decl
)
1050 if (TREE_CODE (decl
) == VAR_DECL
)
1052 /* The object must be defined in this translation unit. */
1053 if (DECL_EXTERNAL (decl
))
1056 /* There's no point using object blocks for something that is
1057 isolated by definition. */
1058 if (DECL_ONE_ONLY (decl
))
1062 /* We can only calculate block offsets if the decl has a known
1064 if (DECL_SIZE_UNIT (decl
) == NULL
)
1066 if (!host_integerp (DECL_SIZE_UNIT (decl
), 1))
1069 /* Find out which section should contain DECL. We cannot put it into
1070 an object block if it requires a standalone definition. */
1071 if (TREE_CODE (decl
) == VAR_DECL
)
1072 align_variable (decl
, 0);
1073 sect
= get_variable_section (decl
, true);
1074 if (SECTION_STYLE (sect
) == SECTION_NOSWITCH
)
1077 return get_block_for_section (sect
);
1080 /* Make sure block symbol SYMBOL is in block BLOCK. */
1083 change_symbol_block (rtx symbol
, struct object_block
*block
)
1085 if (block
!= SYMBOL_REF_BLOCK (symbol
))
1087 gcc_assert (SYMBOL_REF_BLOCK_OFFSET (symbol
) < 0);
1088 SYMBOL_REF_BLOCK (symbol
) = block
;
1092 /* Return true if it is possible to put DECL in an object_block. */
1095 use_blocks_for_decl_p (tree decl
)
1097 /* Only data DECLs can be placed into object blocks. */
1098 if (TREE_CODE (decl
) != VAR_DECL
&& TREE_CODE (decl
) != CONST_DECL
)
1101 /* Detect decls created by dw2_force_const_mem. Such decls are
1102 special because DECL_INITIAL doesn't specify the decl's true value.
1103 dw2_output_indirect_constants will instead call assemble_variable
1104 with dont_output_data set to 1 and then print the contents itself. */
1105 if (DECL_INITIAL (decl
) == decl
)
1108 /* If this decl is an alias, then we don't want to emit a
1110 if (lookup_attribute ("alias", DECL_ATTRIBUTES (decl
)))
1116 /* Create the DECL_RTL for a VAR_DECL or FUNCTION_DECL. DECL should
1117 have static storage duration. In other words, it should not be an
1118 automatic variable, including PARM_DECLs.
1120 There is, however, one exception: this function handles variables
1121 explicitly placed in a particular register by the user.
1123 This is never called for PARM_DECL nodes. */
1126 make_decl_rtl (tree decl
)
1128 const char *name
= 0;
1132 /* Check that we are not being given an automatic variable. */
1133 gcc_assert (TREE_CODE (decl
) != PARM_DECL
1134 && TREE_CODE (decl
) != RESULT_DECL
);
1136 /* A weak alias has TREE_PUBLIC set but not the other bits. */
1137 gcc_assert (TREE_CODE (decl
) != VAR_DECL
1138 || TREE_STATIC (decl
)
1139 || TREE_PUBLIC (decl
)
1140 || DECL_EXTERNAL (decl
)
1141 || DECL_REGISTER (decl
));
1143 /* And that we were not given a type or a label. */
1144 gcc_assert (TREE_CODE (decl
) != TYPE_DECL
1145 && TREE_CODE (decl
) != LABEL_DECL
);
1147 /* For a duplicate declaration, we can be called twice on the
1148 same DECL node. Don't discard the RTL already made. */
1149 if (DECL_RTL_SET_P (decl
))
1151 /* If the old RTL had the wrong mode, fix the mode. */
1152 x
= DECL_RTL (decl
);
1153 if (GET_MODE (x
) != DECL_MODE (decl
))
1154 SET_DECL_RTL (decl
, adjust_address_nv (x
, DECL_MODE (decl
), 0));
1156 if (TREE_CODE (decl
) != FUNCTION_DECL
&& DECL_REGISTER (decl
))
1159 /* ??? Another way to do this would be to maintain a hashed
1160 table of such critters. Instead of adding stuff to a DECL
1161 to give certain attributes to it, we could use an external
1162 hash map from DECL to set of attributes. */
1164 /* Let the target reassign the RTL if it wants.
1165 This is necessary, for example, when one machine specific
1166 decl attribute overrides another. */
1167 targetm
.encode_section_info (decl
, DECL_RTL (decl
), false);
1169 /* If the symbol has a SYMBOL_REF_BLOCK field, update it based
1170 on the new decl information. */
1172 && GET_CODE (XEXP (x
, 0)) == SYMBOL_REF
1173 && SYMBOL_REF_HAS_BLOCK_INFO_P (XEXP (x
, 0)))
1174 change_symbol_block (XEXP (x
, 0), get_block_for_decl (decl
));
1176 /* Make this function static known to the mudflap runtime. */
1177 if (flag_mudflap
&& TREE_CODE (decl
) == VAR_DECL
)
1178 mudflap_enqueue_decl (decl
);
1183 /* If this variable belongs to the global constant pool, retrieve the
1184 pre-computed RTL or recompute it in LTO mode. */
1185 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_IN_CONSTANT_POOL (decl
))
1187 SET_DECL_RTL (decl
, output_constant_def (DECL_INITIAL (decl
), 1));
1191 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
1193 if (name
[0] != '*' && TREE_CODE (decl
) != FUNCTION_DECL
1194 && DECL_REGISTER (decl
))
1196 error ("register name not specified for %q+D", decl
);
1198 else if (TREE_CODE (decl
) != FUNCTION_DECL
&& DECL_REGISTER (decl
))
1200 const char *asmspec
= name
+1;
1201 reg_number
= decode_reg_name (asmspec
);
1202 /* First detect errors in declaring global registers. */
1203 if (reg_number
== -1)
1204 error ("register name not specified for %q+D", decl
);
1205 else if (reg_number
< 0)
1206 error ("invalid register name for %q+D", decl
);
1207 else if (TYPE_MODE (TREE_TYPE (decl
)) == BLKmode
)
1208 error ("data type of %q+D isn%'t suitable for a register",
1210 else if (! HARD_REGNO_MODE_OK (reg_number
, TYPE_MODE (TREE_TYPE (decl
))))
1211 error ("register specified for %q+D isn%'t suitable for data type",
1213 /* Now handle properly declared static register variables. */
1218 if (DECL_INITIAL (decl
) != 0 && TREE_STATIC (decl
))
1220 DECL_INITIAL (decl
) = 0;
1221 error ("global register variable has initial value");
1223 if (TREE_THIS_VOLATILE (decl
))
1224 warning (OPT_Wvolatile_register_var
,
1225 "optimization may eliminate reads and/or "
1226 "writes to register variables");
1228 /* If the user specified one of the eliminables registers here,
1229 e.g., FRAME_POINTER_REGNUM, we don't want to get this variable
1230 confused with that register and be eliminated. This usage is
1231 somewhat suspect... */
1233 SET_DECL_RTL (decl
, gen_rtx_raw_REG (DECL_MODE (decl
), reg_number
));
1234 ORIGINAL_REGNO (DECL_RTL (decl
)) = reg_number
;
1235 REG_USERVAR_P (DECL_RTL (decl
)) = 1;
1237 if (TREE_STATIC (decl
))
1239 /* Make this register global, so not usable for anything
1241 #ifdef ASM_DECLARE_REGISTER_GLOBAL
1242 name
= IDENTIFIER_POINTER (DECL_NAME (decl
));
1243 ASM_DECLARE_REGISTER_GLOBAL (asm_out_file
, decl
, reg_number
, name
);
1245 nregs
= hard_regno_nregs
[reg_number
][DECL_MODE (decl
)];
1247 globalize_reg (decl
, reg_number
+ --nregs
);
1250 /* As a register variable, it has no section. */
1254 /* Now handle ordinary static variables and functions (in memory).
1255 Also handle vars declared register invalidly. */
1256 else if (name
[0] == '*')
1258 #ifdef REGISTER_PREFIX
1259 if (strlen (REGISTER_PREFIX
) != 0)
1261 reg_number
= decode_reg_name (name
);
1262 if (reg_number
>= 0 || reg_number
== -3)
1263 error ("register name given for non-register variable %q+D", decl
);
1268 /* Specifying a section attribute on a variable forces it into a
1269 non-.bss section, and thus it cannot be common. */
1270 /* FIXME: In general this code should not be necessary because
1271 visibility pass is doing the same work. But notice_global_symbol
1272 is called early and it needs to make DECL_RTL to get the name.
1273 we take care of recomputing the DECL_RTL after visibility is changed. */
1274 if (TREE_CODE (decl
) == VAR_DECL
1275 && DECL_SECTION_NAME (decl
) != NULL_TREE
1276 && DECL_INITIAL (decl
) == NULL_TREE
1277 && DECL_COMMON (decl
))
1278 DECL_COMMON (decl
) = 0;
1280 /* Variables can't be both common and weak. */
1281 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_WEAK (decl
))
1282 DECL_COMMON (decl
) = 0;
1284 if (use_object_blocks_p () && use_blocks_for_decl_p (decl
))
1285 x
= create_block_symbol (name
, get_block_for_decl (decl
), -1);
1288 enum machine_mode address_mode
= Pmode
;
1289 if (TREE_TYPE (decl
) != error_mark_node
)
1291 addr_space_t as
= TYPE_ADDR_SPACE (TREE_TYPE (decl
));
1292 address_mode
= targetm
.addr_space
.address_mode (as
);
1294 x
= gen_rtx_SYMBOL_REF (address_mode
, name
);
1296 SYMBOL_REF_WEAK (x
) = DECL_WEAK (decl
);
1297 SET_SYMBOL_REF_DECL (x
, decl
);
1299 x
= gen_rtx_MEM (DECL_MODE (decl
), x
);
1300 if (TREE_CODE (decl
) != FUNCTION_DECL
)
1301 set_mem_attributes (x
, decl
, 1);
1302 SET_DECL_RTL (decl
, x
);
1304 /* Optionally set flags or add text to the name to record information
1305 such as that it is a function name.
1306 If the name is changed, the macro ASM_OUTPUT_LABELREF
1307 will have to know how to strip this information. */
1308 targetm
.encode_section_info (decl
, DECL_RTL (decl
), true);
1310 /* Make this function static known to the mudflap runtime. */
1311 if (flag_mudflap
&& TREE_CODE (decl
) == VAR_DECL
)
1312 mudflap_enqueue_decl (decl
);
1315 /* Like make_decl_rtl, but inhibit creation of new alias sets when
1316 calling make_decl_rtl. Also, reset DECL_RTL before returning the
1320 make_decl_rtl_for_debug (tree decl
)
1322 unsigned int save_aliasing_flag
, save_mudflap_flag
;
1325 if (DECL_RTL_SET_P (decl
))
1326 return DECL_RTL (decl
);
1328 /* Kludge alert! Somewhere down the call chain, make_decl_rtl will
1329 call new_alias_set. If running with -fcompare-debug, sometimes
1330 we do not want to create alias sets that will throw the alias
1331 numbers off in the comparison dumps. So... clearing
1332 flag_strict_aliasing will keep new_alias_set() from creating a
1333 new set. It is undesirable to register decl with mudflap
1334 in this case as well. */
1335 save_aliasing_flag
= flag_strict_aliasing
;
1336 flag_strict_aliasing
= 0;
1337 save_mudflap_flag
= flag_mudflap
;
1340 rtl
= DECL_RTL (decl
);
1341 /* Reset DECL_RTL back, as various parts of the compiler expects
1342 DECL_RTL set meaning it is actually going to be output. */
1343 SET_DECL_RTL (decl
, NULL
);
1345 flag_strict_aliasing
= save_aliasing_flag
;
1346 flag_mudflap
= save_mudflap_flag
;
1351 /* Output a string of literal assembler code
1352 for an `asm' keyword used between functions. */
1355 assemble_asm (tree string
)
1359 if (TREE_CODE (string
) == ADDR_EXPR
)
1360 string
= TREE_OPERAND (string
, 0);
1362 fprintf (asm_out_file
, "\t%s\n", TREE_STRING_POINTER (string
));
1365 /* Record an element in the table of global destructors. SYMBOL is
1366 a SYMBOL_REF of the function to be called; PRIORITY is a number
1367 between 0 and MAX_INIT_PRIORITY. */
1370 default_stabs_asm_out_destructor (rtx symbol ATTRIBUTE_UNUSED
,
1371 int priority ATTRIBUTE_UNUSED
)
1373 #if defined DBX_DEBUGGING_INFO || defined XCOFF_DEBUGGING_INFO
1374 /* Tell GNU LD that this is part of the static destructor set.
1375 This will work for any system that uses stabs, most usefully
1377 dbxout_begin_simple_stabs ("___DTOR_LIST__", 22 /* N_SETT */);
1378 dbxout_stab_value_label (XSTR (symbol
, 0));
1380 sorry ("global destructors not supported on this target");
1384 /* Write the address of the entity given by SYMBOL to SEC. */
1386 assemble_addr_to_section (rtx symbol
, section
*sec
)
1388 switch_to_section (sec
);
1389 assemble_align (POINTER_SIZE
);
1390 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1393 /* Return the numbered .ctors.N (if CONSTRUCTOR_P) or .dtors.N (if
1394 not) section for PRIORITY. */
1396 get_cdtor_priority_section (int priority
, bool constructor_p
)
1400 /* ??? This only works reliably with the GNU linker. */
1401 sprintf (buf
, "%s.%.5u",
1402 constructor_p
? ".ctors" : ".dtors",
1403 /* Invert the numbering so the linker puts us in the proper
1404 order; constructors are run from right to left, and the
1405 linker sorts in increasing order. */
1406 MAX_INIT_PRIORITY
- priority
);
1407 return get_section (buf
, SECTION_WRITE
, NULL
);
1411 default_named_section_asm_out_destructor (rtx symbol
, int priority
)
1415 if (priority
!= DEFAULT_INIT_PRIORITY
)
1416 sec
= get_cdtor_priority_section (priority
,
1417 /*constructor_p=*/false);
1419 sec
= get_section (".dtors", SECTION_WRITE
, NULL
);
1421 assemble_addr_to_section (symbol
, sec
);
1424 #ifdef DTORS_SECTION_ASM_OP
1426 default_dtor_section_asm_out_destructor (rtx symbol
,
1427 int priority ATTRIBUTE_UNUSED
)
1429 assemble_addr_to_section (symbol
, dtors_section
);
1433 /* Likewise for global constructors. */
1436 default_stabs_asm_out_constructor (rtx symbol ATTRIBUTE_UNUSED
,
1437 int priority ATTRIBUTE_UNUSED
)
1439 #if defined DBX_DEBUGGING_INFO || defined XCOFF_DEBUGGING_INFO
1440 /* Tell GNU LD that this is part of the static destructor set.
1441 This will work for any system that uses stabs, most usefully
1443 dbxout_begin_simple_stabs ("___CTOR_LIST__", 22 /* N_SETT */);
1444 dbxout_stab_value_label (XSTR (symbol
, 0));
1446 sorry ("global constructors not supported on this target");
1451 default_named_section_asm_out_constructor (rtx symbol
, int priority
)
1455 if (priority
!= DEFAULT_INIT_PRIORITY
)
1456 sec
= get_cdtor_priority_section (priority
,
1457 /*constructor_p=*/true);
1459 sec
= get_section (".ctors", SECTION_WRITE
, NULL
);
1461 assemble_addr_to_section (symbol
, sec
);
1464 #ifdef CTORS_SECTION_ASM_OP
1466 default_ctor_section_asm_out_constructor (rtx symbol
,
1467 int priority ATTRIBUTE_UNUSED
)
1469 assemble_addr_to_section (symbol
, ctors_section
);
1473 /* CONSTANT_POOL_BEFORE_FUNCTION may be defined as an expression with
1474 a nonzero value if the constant pool should be output before the
1475 start of the function, or a zero value if the pool should output
1476 after the end of the function. The default is to put it before the
1479 #ifndef CONSTANT_POOL_BEFORE_FUNCTION
1480 #define CONSTANT_POOL_BEFORE_FUNCTION 1
1483 /* DECL is an object (either VAR_DECL or FUNCTION_DECL) which is going
1484 to be output to assembler.
1485 Set first_global_object_name and weak_global_object_name as appropriate. */
1488 notice_global_symbol (tree decl
)
1490 const char **type
= &first_global_object_name
;
1492 if (first_global_object_name
1493 || !TREE_PUBLIC (decl
)
1494 || DECL_EXTERNAL (decl
)
1495 || !DECL_NAME (decl
)
1496 || (TREE_CODE (decl
) != FUNCTION_DECL
1497 && (TREE_CODE (decl
) != VAR_DECL
1498 || (DECL_COMMON (decl
)
1499 && (DECL_INITIAL (decl
) == 0
1500 || DECL_INITIAL (decl
) == error_mark_node
))))
1501 || !MEM_P (DECL_RTL (decl
)))
1504 /* We win when global object is found, but it is useful to know about weak
1505 symbol as well so we can produce nicer unique names. */
1506 if (DECL_WEAK (decl
) || DECL_ONE_ONLY (decl
) || flag_shlib
)
1507 type
= &weak_global_object_name
;
1513 rtx decl_rtl
= DECL_RTL (decl
);
1515 p
= targetm
.strip_name_encoding (XSTR (XEXP (decl_rtl
, 0), 0));
1516 name
= ggc_strdup (p
);
1522 /* If not using flag_reorder_blocks_and_partition, decide early whether the
1523 current function goes into the cold section, so that targets can use
1524 current_function_section during RTL expansion. DECL describes the
1528 decide_function_section (tree decl
)
1530 first_function_block_is_cold
= false;
1532 if (flag_reorder_blocks_and_partition
)
1533 /* We will decide in assemble_start_function. */
1536 if (DECL_SECTION_NAME (decl
))
1538 struct cgraph_node
*node
= cgraph_get_node (current_function_decl
);
1539 /* Calls to function_section rely on first_function_block_is_cold
1541 first_function_block_is_cold
= (node
1543 == NODE_FREQUENCY_UNLIKELY_EXECUTED
);
1546 in_cold_section_p
= first_function_block_is_cold
;
1549 /* Output assembler code for the constant pool of a function and associated
1550 with defining the name of the function. DECL describes the function.
1551 NAME is the function's name. For the constant pool, we use the current
1552 constant pool data. */
1555 assemble_start_function (tree decl
, const char *fnname
)
1558 char tmp_label
[100];
1559 bool hot_label_written
= false;
1561 if (flag_reorder_blocks_and_partition
)
1563 ASM_GENERATE_INTERNAL_LABEL (tmp_label
, "LHOTB", const_labelno
);
1564 crtl
->subsections
.hot_section_label
= ggc_strdup (tmp_label
);
1565 ASM_GENERATE_INTERNAL_LABEL (tmp_label
, "LCOLDB", const_labelno
);
1566 crtl
->subsections
.cold_section_label
= ggc_strdup (tmp_label
);
1567 ASM_GENERATE_INTERNAL_LABEL (tmp_label
, "LHOTE", const_labelno
);
1568 crtl
->subsections
.hot_section_end_label
= ggc_strdup (tmp_label
);
1569 ASM_GENERATE_INTERNAL_LABEL (tmp_label
, "LCOLDE", const_labelno
);
1570 crtl
->subsections
.cold_section_end_label
= ggc_strdup (tmp_label
);
1575 crtl
->subsections
.hot_section_label
= NULL
;
1576 crtl
->subsections
.cold_section_label
= NULL
;
1577 crtl
->subsections
.hot_section_end_label
= NULL
;
1578 crtl
->subsections
.cold_section_end_label
= NULL
;
1581 /* The following code does not need preprocessing in the assembler. */
1585 if (CONSTANT_POOL_BEFORE_FUNCTION
)
1586 output_constant_pool (fnname
, decl
);
1588 /* Make sure the not and cold text (code) sections are properly
1589 aligned. This is necessary here in the case where the function
1590 has both hot and cold sections, because we don't want to re-set
1591 the alignment when the section switch happens mid-function. */
1593 if (flag_reorder_blocks_and_partition
)
1595 first_function_block_is_cold
= false;
1597 switch_to_section (unlikely_text_section ());
1598 assemble_align (DECL_ALIGN (decl
));
1599 ASM_OUTPUT_LABEL (asm_out_file
, crtl
->subsections
.cold_section_label
);
1601 /* When the function starts with a cold section, we need to explicitly
1602 align the hot section and write out the hot section label.
1603 But if the current function is a thunk, we do not have a CFG. */
1605 && BB_PARTITION (ENTRY_BLOCK_PTR
->next_bb
) == BB_COLD_PARTITION
)
1607 switch_to_section (text_section
);
1608 assemble_align (DECL_ALIGN (decl
));
1609 ASM_OUTPUT_LABEL (asm_out_file
, crtl
->subsections
.hot_section_label
);
1610 hot_label_written
= true;
1611 first_function_block_is_cold
= true;
1613 in_cold_section_p
= first_function_block_is_cold
;
1617 /* Switch to the correct text section for the start of the function. */
1619 switch_to_section (function_section (decl
));
1620 if (flag_reorder_blocks_and_partition
1621 && !hot_label_written
)
1622 ASM_OUTPUT_LABEL (asm_out_file
, crtl
->subsections
.hot_section_label
);
1624 /* Tell assembler to move to target machine's alignment for functions. */
1625 align
= floor_log2 (DECL_ALIGN (decl
) / BITS_PER_UNIT
);
1628 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1631 /* Handle a user-specified function alignment.
1632 Note that we still need to align to DECL_ALIGN, as above,
1633 because ASM_OUTPUT_MAX_SKIP_ALIGN might not do any alignment at all. */
1634 if (! DECL_USER_ALIGN (decl
)
1635 && align_functions_log
> align
1636 && optimize_function_for_speed_p (cfun
))
1638 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
1639 ASM_OUTPUT_MAX_SKIP_ALIGN (asm_out_file
,
1640 align_functions_log
, align_functions
- 1);
1642 ASM_OUTPUT_ALIGN (asm_out_file
, align_functions_log
);
1646 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
1647 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file
, fnname
);
1650 if (!DECL_IGNORED_P (decl
))
1651 (*debug_hooks
->begin_function
) (decl
);
1653 /* Make function name accessible from other files, if appropriate. */
1655 if (TREE_PUBLIC (decl
))
1657 notice_global_symbol (decl
);
1659 globalize_decl (decl
);
1661 maybe_assemble_visibility (decl
);
1664 if (DECL_PRESERVE_P (decl
))
1665 targetm
.asm_out
.mark_decl_preserved (fnname
);
1667 /* Do any machine/system dependent processing of the function name. */
1668 #ifdef ASM_DECLARE_FUNCTION_NAME
1669 ASM_DECLARE_FUNCTION_NAME (asm_out_file
, fnname
, current_function_decl
);
1671 /* Standard thing is just output label for the function. */
1672 ASM_OUTPUT_FUNCTION_LABEL (asm_out_file
, fnname
, current_function_decl
);
1673 #endif /* ASM_DECLARE_FUNCTION_NAME */
1675 if (lookup_attribute ("no_split_stack", DECL_ATTRIBUTES (decl
)))
1676 saw_no_split_stack
= true;
1679 /* Output assembler code associated with defining the size of the
1680 function. DECL describes the function. NAME is the function's name. */
1683 assemble_end_function (tree decl
, const char *fnname ATTRIBUTE_UNUSED
)
1685 #ifdef ASM_DECLARE_FUNCTION_SIZE
1686 /* We could have switched section in the middle of the function. */
1687 if (flag_reorder_blocks_and_partition
)
1688 switch_to_section (function_section (decl
));
1689 ASM_DECLARE_FUNCTION_SIZE (asm_out_file
, fnname
, decl
);
1691 if (! CONSTANT_POOL_BEFORE_FUNCTION
)
1693 output_constant_pool (fnname
, decl
);
1694 switch_to_section (function_section (decl
)); /* need to switch back */
1696 /* Output labels for end of hot/cold text sections (to be used by
1698 if (flag_reorder_blocks_and_partition
)
1700 section
*save_text_section
;
1702 save_text_section
= in_section
;
1703 switch_to_section (unlikely_text_section ());
1704 ASM_OUTPUT_LABEL (asm_out_file
, crtl
->subsections
.cold_section_end_label
);
1705 if (first_function_block_is_cold
)
1706 switch_to_section (text_section
);
1708 switch_to_section (function_section (decl
));
1709 ASM_OUTPUT_LABEL (asm_out_file
, crtl
->subsections
.hot_section_end_label
);
1710 switch_to_section (save_text_section
);
1714 /* Assemble code to leave SIZE bytes of zeros. */
1717 assemble_zeros (unsigned HOST_WIDE_INT size
)
1719 /* Do no output if -fsyntax-only. */
1720 if (flag_syntax_only
)
1723 #ifdef ASM_NO_SKIP_IN_TEXT
1724 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
1725 so we must output 0s explicitly in the text section. */
1726 if (ASM_NO_SKIP_IN_TEXT
&& (in_section
->common
.flags
& SECTION_CODE
) != 0)
1728 unsigned HOST_WIDE_INT i
;
1729 for (i
= 0; i
< size
; i
++)
1730 assemble_integer (const0_rtx
, 1, BITS_PER_UNIT
, 1);
1735 ASM_OUTPUT_SKIP (asm_out_file
, size
);
1738 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
1741 assemble_align (int align
)
1743 if (align
> BITS_PER_UNIT
)
1745 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
1749 /* Assemble a string constant with the specified C string as contents. */
1752 assemble_string (const char *p
, int size
)
1757 /* If the string is very long, split it up. */
1761 int thissize
= size
- pos
;
1762 if (thissize
> maximum
)
1765 ASM_OUTPUT_ASCII (asm_out_file
, p
, thissize
);
1773 /* A noswitch_section_callback for lcomm_section. */
1776 emit_local (tree decl ATTRIBUTE_UNUSED
,
1777 const char *name ATTRIBUTE_UNUSED
,
1778 unsigned HOST_WIDE_INT size ATTRIBUTE_UNUSED
,
1779 unsigned HOST_WIDE_INT rounded ATTRIBUTE_UNUSED
)
1781 #if defined ASM_OUTPUT_ALIGNED_DECL_LOCAL
1782 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file
, decl
, name
,
1783 size
, DECL_ALIGN (decl
));
1785 #elif defined ASM_OUTPUT_ALIGNED_LOCAL
1786 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file
, name
, size
, DECL_ALIGN (decl
));
1789 ASM_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
1794 /* A noswitch_section_callback for bss_noswitch_section. */
1796 #if defined ASM_OUTPUT_ALIGNED_BSS
1798 emit_bss (tree decl ATTRIBUTE_UNUSED
,
1799 const char *name ATTRIBUTE_UNUSED
,
1800 unsigned HOST_WIDE_INT size ATTRIBUTE_UNUSED
,
1801 unsigned HOST_WIDE_INT rounded ATTRIBUTE_UNUSED
)
1803 #if defined ASM_OUTPUT_ALIGNED_BSS
1804 ASM_OUTPUT_ALIGNED_BSS (asm_out_file
, decl
, name
, size
, DECL_ALIGN (decl
));
1810 /* A noswitch_section_callback for comm_section. */
1813 emit_common (tree decl ATTRIBUTE_UNUSED
,
1814 const char *name ATTRIBUTE_UNUSED
,
1815 unsigned HOST_WIDE_INT size ATTRIBUTE_UNUSED
,
1816 unsigned HOST_WIDE_INT rounded ATTRIBUTE_UNUSED
)
1818 #if defined ASM_OUTPUT_ALIGNED_DECL_COMMON
1819 ASM_OUTPUT_ALIGNED_DECL_COMMON (asm_out_file
, decl
, name
,
1820 size
, DECL_ALIGN (decl
));
1822 #elif defined ASM_OUTPUT_ALIGNED_COMMON
1823 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file
, name
, size
, DECL_ALIGN (decl
));
1826 ASM_OUTPUT_COMMON (asm_out_file
, name
, size
, rounded
);
1831 /* A noswitch_section_callback for tls_comm_section. */
1834 emit_tls_common (tree decl ATTRIBUTE_UNUSED
,
1835 const char *name ATTRIBUTE_UNUSED
,
1836 unsigned HOST_WIDE_INT size ATTRIBUTE_UNUSED
,
1837 unsigned HOST_WIDE_INT rounded ATTRIBUTE_UNUSED
)
1839 #ifdef ASM_OUTPUT_TLS_COMMON
1840 ASM_OUTPUT_TLS_COMMON (asm_out_file
, decl
, name
, size
);
1843 sorry ("thread-local COMMON data not implemented");
1848 /* Assemble DECL given that it belongs in SECTION_NOSWITCH section SECT.
1849 NAME is the name of DECL's SYMBOL_REF. */
1852 assemble_noswitch_variable (tree decl
, const char *name
, section
*sect
)
1854 unsigned HOST_WIDE_INT size
, rounded
;
1856 size
= tree_low_cst (DECL_SIZE_UNIT (decl
), 1);
1859 /* Don't allocate zero bytes of common,
1860 since that means "undefined external" in the linker. */
1864 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1865 so that each uninitialized object starts on such a boundary. */
1866 rounded
+= (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1;
1867 rounded
= (rounded
/ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1868 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1870 if (!sect
->noswitch
.callback (decl
, name
, size
, rounded
)
1871 && (unsigned HOST_WIDE_INT
) DECL_ALIGN_UNIT (decl
) > rounded
)
1872 warning (0, "requested alignment for %q+D is greater than "
1873 "implemented alignment of %wu", decl
, rounded
);
1876 /* A subroutine of assemble_variable. Output the label and contents of
1877 DECL, whose address is a SYMBOL_REF with name NAME. DONT_OUTPUT_DATA
1878 is as for assemble_variable. */
1881 assemble_variable_contents (tree decl
, const char *name
,
1882 bool dont_output_data
)
1884 /* Do any machine/system dependent processing of the object. */
1885 #ifdef ASM_DECLARE_OBJECT_NAME
1886 last_assemble_variable_decl
= decl
;
1887 ASM_DECLARE_OBJECT_NAME (asm_out_file
, name
, decl
);
1889 /* Standard thing is just output label for the object. */
1890 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1891 #endif /* ASM_DECLARE_OBJECT_NAME */
1893 if (!dont_output_data
)
1895 if (DECL_INITIAL (decl
)
1896 && DECL_INITIAL (decl
) != error_mark_node
1897 && !initializer_zerop (DECL_INITIAL (decl
)))
1898 /* Output the actual data. */
1899 output_constant (DECL_INITIAL (decl
),
1900 tree_low_cst (DECL_SIZE_UNIT (decl
), 1),
1903 /* Leave space for it. */
1904 assemble_zeros (tree_low_cst (DECL_SIZE_UNIT (decl
), 1));
1908 /* Assemble everything that is needed for a variable or function declaration.
1909 Not used for automatic variables, and not used for function definitions.
1910 Should not be called for variables of incomplete structure type.
1912 TOP_LEVEL is nonzero if this variable has file scope.
1913 AT_END is nonzero if this is the special handling, at end of compilation,
1914 to define things that have had only tentative definitions.
1915 DONT_OUTPUT_DATA if nonzero means don't actually output the
1916 initial value (that will be done by the caller). */
1919 assemble_variable (tree decl
, int top_level ATTRIBUTE_UNUSED
,
1920 int at_end ATTRIBUTE_UNUSED
, int dont_output_data
)
1923 rtx decl_rtl
, symbol
;
1926 /* This function is supposed to handle VARIABLES. Ensure we have one. */
1927 gcc_assert (TREE_CODE (decl
) == VAR_DECL
);
1929 /* Emulated TLS had better not get this far. */
1930 gcc_checking_assert (targetm
.have_tls
|| !DECL_THREAD_LOCAL_P (decl
));
1932 last_assemble_variable_decl
= 0;
1934 /* Normally no need to say anything here for external references,
1935 since assemble_external is called by the language-specific code
1936 when a declaration is first seen. */
1938 if (DECL_EXTERNAL (decl
))
1941 /* Do nothing for global register variables. */
1942 if (DECL_RTL_SET_P (decl
) && REG_P (DECL_RTL (decl
)))
1944 TREE_ASM_WRITTEN (decl
) = 1;
1948 /* If type was incomplete when the variable was declared,
1949 see if it is complete now. */
1951 if (DECL_SIZE (decl
) == 0)
1952 layout_decl (decl
, 0);
1954 /* Still incomplete => don't allocate it; treat the tentative defn
1955 (which is what it must have been) as an `extern' reference. */
1957 if (!dont_output_data
&& DECL_SIZE (decl
) == 0)
1959 error ("storage size of %q+D isn%'t known", decl
);
1960 TREE_ASM_WRITTEN (decl
) = 1;
1964 /* The first declaration of a variable that comes through this function
1965 decides whether it is global (in C, has external linkage)
1966 or local (in C, has internal linkage). So do nothing more
1967 if this function has already run. */
1969 if (TREE_ASM_WRITTEN (decl
))
1972 /* Make sure targetm.encode_section_info is invoked before we set
1974 decl_rtl
= DECL_RTL (decl
);
1976 TREE_ASM_WRITTEN (decl
) = 1;
1978 /* Do no output if -fsyntax-only. */
1979 if (flag_syntax_only
)
1982 if (! dont_output_data
1983 && ! host_integerp (DECL_SIZE_UNIT (decl
), 1))
1985 error ("size of variable %q+D is too large", decl
);
1989 gcc_assert (MEM_P (decl_rtl
));
1990 gcc_assert (GET_CODE (XEXP (decl_rtl
, 0)) == SYMBOL_REF
);
1991 symbol
= XEXP (decl_rtl
, 0);
1993 /* If this symbol belongs to the tree constant pool, output the constant
1994 if it hasn't already been written. */
1995 if (TREE_CONSTANT_POOL_ADDRESS_P (symbol
))
1997 tree decl
= SYMBOL_REF_DECL (symbol
);
1998 if (!TREE_ASM_WRITTEN (DECL_INITIAL (decl
)))
1999 output_constant_def_contents (symbol
);
2005 name
= XSTR (symbol
, 0);
2006 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
))
2007 notice_global_symbol (decl
);
2009 /* Compute the alignment of this data. */
2011 align_variable (decl
, dont_output_data
);
2012 set_mem_align (decl_rtl
, DECL_ALIGN (decl
));
2014 if (TREE_PUBLIC (decl
))
2015 maybe_assemble_visibility (decl
);
2017 if (DECL_PRESERVE_P (decl
))
2018 targetm
.asm_out
.mark_decl_preserved (name
);
2020 /* First make the assembler name(s) global if appropriate. */
2021 sect
= get_variable_section (decl
, false);
2022 if (TREE_PUBLIC (decl
)
2023 && (sect
->common
.flags
& SECTION_COMMON
) == 0)
2024 globalize_decl (decl
);
2026 /* Output any data that we will need to use the address of. */
2027 if (DECL_INITIAL (decl
) && DECL_INITIAL (decl
) != error_mark_node
)
2028 output_addressed_constants (DECL_INITIAL (decl
));
2030 /* dbxout.c needs to know this. */
2031 if (sect
&& (sect
->common
.flags
& SECTION_CODE
) != 0)
2032 DECL_IN_TEXT_SECTION (decl
) = 1;
2034 /* If the decl is part of an object_block, make sure that the decl
2035 has been positioned within its block, but do not write out its
2036 definition yet. output_object_blocks will do that later. */
2037 if (SYMBOL_REF_HAS_BLOCK_INFO_P (symbol
) && SYMBOL_REF_BLOCK (symbol
))
2039 gcc_assert (!dont_output_data
);
2040 place_block_symbol (symbol
);
2042 else if (SECTION_STYLE (sect
) == SECTION_NOSWITCH
)
2043 assemble_noswitch_variable (decl
, name
, sect
);
2046 switch_to_section (sect
);
2047 if (DECL_ALIGN (decl
) > BITS_PER_UNIT
)
2048 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (DECL_ALIGN_UNIT (decl
)));
2049 assemble_variable_contents (decl
, name
, dont_output_data
);
2053 /* Return 1 if type TYPE contains any pointers. */
2056 contains_pointers_p (tree type
)
2058 switch (TREE_CODE (type
))
2061 case REFERENCE_TYPE
:
2062 /* I'm not sure whether OFFSET_TYPE needs this treatment,
2063 so I'll play safe and return 1. */
2069 case QUAL_UNION_TYPE
:
2072 /* For a type that has fields, see if the fields have pointers. */
2073 for (fields
= TYPE_FIELDS (type
); fields
; fields
= DECL_CHAIN (fields
))
2074 if (TREE_CODE (fields
) == FIELD_DECL
2075 && contains_pointers_p (TREE_TYPE (fields
)))
2081 /* An array type contains pointers if its element type does. */
2082 return contains_pointers_p (TREE_TYPE (type
));
2089 /* We delay assemble_external processing until
2090 the compilation unit is finalized. This is the best we can do for
2091 right now (i.e. stage 3 of GCC 4.0) - the right thing is to delay
2092 it all the way to final. See PR 17982 for further discussion. */
2093 static GTY(()) tree pending_assemble_externals
;
2095 #ifdef ASM_OUTPUT_EXTERNAL
2096 /* True if DECL is a function decl for which no out-of-line copy exists.
2097 It is assumed that DECL's assembler name has been set. */
2100 incorporeal_function_p (tree decl
)
2102 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_BUILT_IN (decl
))
2106 if (DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
2107 && (DECL_FUNCTION_CODE (decl
) == BUILT_IN_ALLOCA
2108 || DECL_FUNCTION_CODE (decl
) == BUILT_IN_ALLOCA_WITH_ALIGN
))
2111 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
2112 if (is_builtin_name (name
))
2118 /* Actually do the tests to determine if this is necessary, and invoke
2119 ASM_OUTPUT_EXTERNAL. */
2121 assemble_external_real (tree decl
)
2123 rtx rtl
= DECL_RTL (decl
);
2125 if (MEM_P (rtl
) && GET_CODE (XEXP (rtl
, 0)) == SYMBOL_REF
2126 && !SYMBOL_REF_USED (XEXP (rtl
, 0))
2127 && !incorporeal_function_p (decl
))
2129 /* Some systems do require some output. */
2130 SYMBOL_REF_USED (XEXP (rtl
, 0)) = 1;
2131 ASM_OUTPUT_EXTERNAL (asm_out_file
, decl
, XSTR (XEXP (rtl
, 0), 0));
2137 process_pending_assemble_externals (void)
2139 #ifdef ASM_OUTPUT_EXTERNAL
2141 for (list
= pending_assemble_externals
; list
; list
= TREE_CHAIN (list
))
2142 assemble_external_real (TREE_VALUE (list
));
2144 pending_assemble_externals
= 0;
2148 /* This TREE_LIST contains any weak symbol declarations waiting
2150 static GTY(()) tree weak_decls
;
2152 /* Output something to declare an external symbol to the assembler,
2153 and qualifiers such as weakness. (Most assemblers don't need
2154 extern declaration, so we normally output nothing.) Do nothing if
2155 DECL is not external. */
2158 assemble_external (tree decl ATTRIBUTE_UNUSED
)
2160 /* Because most platforms do not define ASM_OUTPUT_EXTERNAL, the
2161 main body of this code is only rarely exercised. To provide some
2162 testing, on all platforms, we make sure that the ASM_OUT_FILE is
2163 open. If it's not, we should not be calling this function. */
2164 gcc_assert (asm_out_file
);
2166 if (!DECL_P (decl
) || !DECL_EXTERNAL (decl
) || !TREE_PUBLIC (decl
))
2169 /* We want to output annotation for weak and external symbols at
2170 very last to check if they are references or not. */
2172 if (TARGET_SUPPORTS_WEAK
2174 /* TREE_STATIC is a weird and abused creature which is not
2175 generally the right test for whether an entity has been
2176 locally emitted, inlined or otherwise not-really-extern, but
2177 for declarations that can be weak, it happens to be
2179 && !TREE_STATIC (decl
)
2180 && lookup_attribute ("weak", DECL_ATTRIBUTES (decl
))
2181 && value_member (decl
, weak_decls
) == NULL_TREE
)
2182 weak_decls
= tree_cons (NULL
, decl
, weak_decls
);
2184 #ifdef ASM_OUTPUT_EXTERNAL
2185 if (value_member (decl
, pending_assemble_externals
) == NULL_TREE
)
2186 pending_assemble_externals
= tree_cons (NULL
, decl
,
2187 pending_assemble_externals
);
2191 /* Similar, for calling a library function FUN. */
2194 assemble_external_libcall (rtx fun
)
2196 /* Declare library function name external when first used, if nec. */
2197 if (! SYMBOL_REF_USED (fun
))
2199 SYMBOL_REF_USED (fun
) = 1;
2200 targetm
.asm_out
.external_libcall (fun
);
2204 /* Assemble a label named NAME. */
2207 assemble_label (FILE *file
, const char *name
)
2209 ASM_OUTPUT_LABEL (file
, name
);
2212 /* Set the symbol_referenced flag for ID. */
2214 mark_referenced (tree id
)
2216 TREE_SYMBOL_REFERENCED (id
) = 1;
2219 /* Set the symbol_referenced flag for DECL and notify callgraph. */
2221 mark_decl_referenced (tree decl
)
2223 if (TREE_CODE (decl
) == FUNCTION_DECL
)
2225 /* Extern inline functions don't become needed when referenced.
2226 If we know a method will be emitted in other TU and no new
2227 functions can be marked reachable, just use the external
2229 struct cgraph_node
*node
= cgraph_get_create_node (decl
);
2230 if (!DECL_EXTERNAL (decl
)
2231 && !node
->local
.finalized
)
2232 cgraph_mark_needed_node (node
);
2234 else if (TREE_CODE (decl
) == VAR_DECL
)
2236 struct varpool_node
*node
= varpool_node (decl
);
2237 varpool_mark_needed_node (node
);
2238 /* C++ frontend use mark_decl_references to force COMDAT variables
2239 to be output that might appear dead otherwise. */
2240 node
->force_output
= true;
2242 /* else do nothing - we can get various sorts of CST nodes here,
2243 which do not need to be marked. */
2247 /* Follow the IDENTIFIER_TRANSPARENT_ALIAS chain starting at *ALIAS
2248 until we find an identifier that is not itself a transparent alias.
2249 Modify the alias passed to it by reference (and all aliases on the
2250 way to the ultimate target), such that they do not have to be
2251 followed again, and return the ultimate target of the alias
2255 ultimate_transparent_alias_target (tree
*alias
)
2257 tree target
= *alias
;
2259 if (IDENTIFIER_TRANSPARENT_ALIAS (target
))
2261 gcc_assert (TREE_CHAIN (target
));
2262 target
= ultimate_transparent_alias_target (&TREE_CHAIN (target
));
2263 gcc_assert (! IDENTIFIER_TRANSPARENT_ALIAS (target
)
2264 && ! TREE_CHAIN (target
));
2271 /* Output to FILE (an assembly file) a reference to NAME. If NAME
2272 starts with a *, the rest of NAME is output verbatim. Otherwise
2273 NAME is transformed in a target-specific way (usually by the
2274 addition of an underscore). */
2277 assemble_name_raw (FILE *file
, const char *name
)
2280 fputs (&name
[1], file
);
2282 ASM_OUTPUT_LABELREF (file
, name
);
2285 /* Like assemble_name_raw, but should be used when NAME might refer to
2286 an entity that is also represented as a tree (like a function or
2287 variable). If NAME does refer to such an entity, that entity will
2288 be marked as referenced. */
2291 assemble_name (FILE *file
, const char *name
)
2293 const char *real_name
;
2296 real_name
= targetm
.strip_name_encoding (name
);
2298 id
= maybe_get_identifier (real_name
);
2303 mark_referenced (id
);
2304 ultimate_transparent_alias_target (&id
);
2306 name
= IDENTIFIER_POINTER (id
);
2307 gcc_assert (! TREE_CHAIN (id
));
2310 assemble_name_raw (file
, name
);
2313 /* Allocate SIZE bytes writable static space with a gensym name
2314 and return an RTX to refer to its address. */
2317 assemble_static_space (unsigned HOST_WIDE_INT size
)
2320 const char *namestring
;
2323 ASM_GENERATE_INTERNAL_LABEL (name
, "LF", const_labelno
);
2325 namestring
= ggc_strdup (name
);
2327 x
= gen_rtx_SYMBOL_REF (Pmode
, namestring
);
2328 SYMBOL_REF_FLAGS (x
) = SYMBOL_FLAG_LOCAL
;
2330 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
2331 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file
, NULL_TREE
, name
, size
,
2334 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
2335 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file
, name
, size
, BIGGEST_ALIGNMENT
);
2338 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
2339 so that each uninitialized object starts on such a boundary. */
2340 /* Variable `rounded' might or might not be used in ASM_OUTPUT_LOCAL. */
2341 unsigned HOST_WIDE_INT rounded ATTRIBUTE_UNUSED
2342 = ((size
+ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1)
2343 / (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
2344 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
2345 ASM_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
2352 /* Assemble the static constant template for function entry trampolines.
2353 This is done at most once per compilation.
2354 Returns an RTX for the address of the template. */
2356 static GTY(()) rtx initial_trampoline
;
2359 assemble_trampoline_template (void)
2366 gcc_assert (targetm
.asm_out
.trampoline_template
!= NULL
);
2368 if (initial_trampoline
)
2369 return initial_trampoline
;
2371 /* By default, put trampoline templates in read-only data section. */
2373 #ifdef TRAMPOLINE_SECTION
2374 switch_to_section (TRAMPOLINE_SECTION
);
2376 switch_to_section (readonly_data_section
);
2379 /* Write the assembler code to define one. */
2380 align
= floor_log2 (TRAMPOLINE_ALIGNMENT
/ BITS_PER_UNIT
);
2382 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
2384 targetm
.asm_out
.internal_label (asm_out_file
, "LTRAMP", 0);
2385 targetm
.asm_out
.trampoline_template (asm_out_file
);
2387 /* Record the rtl to refer to it. */
2388 ASM_GENERATE_INTERNAL_LABEL (label
, "LTRAMP", 0);
2389 name
= ggc_strdup (label
);
2390 symbol
= gen_rtx_SYMBOL_REF (Pmode
, name
);
2391 SYMBOL_REF_FLAGS (symbol
) = SYMBOL_FLAG_LOCAL
;
2393 initial_trampoline
= gen_const_mem (BLKmode
, symbol
);
2394 set_mem_align (initial_trampoline
, TRAMPOLINE_ALIGNMENT
);
2395 set_mem_size (initial_trampoline
, TRAMPOLINE_SIZE
);
2397 return initial_trampoline
;
2400 /* A and B are either alignments or offsets. Return the minimum alignment
2401 that may be assumed after adding the two together. */
2403 static inline unsigned
2404 min_align (unsigned int a
, unsigned int b
)
2406 return (a
| b
) & -(a
| b
);
2409 /* Return the assembler directive for creating a given kind of integer
2410 object. SIZE is the number of bytes in the object and ALIGNED_P
2411 indicates whether it is known to be aligned. Return NULL if the
2412 assembly dialect has no such directive.
2414 The returned string should be printed at the start of a new line and
2415 be followed immediately by the object's initial value. */
2418 integer_asm_op (int size
, int aligned_p
)
2420 struct asm_int_op
*ops
;
2423 ops
= &targetm
.asm_out
.aligned_op
;
2425 ops
= &targetm
.asm_out
.unaligned_op
;
2430 return targetm
.asm_out
.byte_op
;
2444 /* Use directive OP to assemble an integer object X. Print OP at the
2445 start of the line, followed immediately by the value of X. */
2448 assemble_integer_with_op (const char *op
, rtx x
)
2450 fputs (op
, asm_out_file
);
2451 output_addr_const (asm_out_file
, x
);
2452 fputc ('\n', asm_out_file
);
2455 /* The default implementation of the asm_out.integer target hook. */
2458 default_assemble_integer (rtx x ATTRIBUTE_UNUSED
,
2459 unsigned int size ATTRIBUTE_UNUSED
,
2460 int aligned_p ATTRIBUTE_UNUSED
)
2462 const char *op
= integer_asm_op (size
, aligned_p
);
2463 /* Avoid GAS bugs for large values. Specifically negative values whose
2464 absolute value fits in a bfd_vma, but not in a bfd_signed_vma. */
2465 if (size
> UNITS_PER_WORD
&& size
> POINTER_SIZE
/ BITS_PER_UNIT
)
2467 return op
&& (assemble_integer_with_op (op
, x
), true);
2470 /* Assemble the integer constant X into an object of SIZE bytes. ALIGN is
2471 the alignment of the integer in bits. Return 1 if we were able to output
2472 the constant, otherwise 0. We must be able to output the constant,
2473 if FORCE is nonzero. */
2476 assemble_integer (rtx x
, unsigned int size
, unsigned int align
, int force
)
2480 aligned_p
= (align
>= MIN (size
* BITS_PER_UNIT
, BIGGEST_ALIGNMENT
));
2482 /* See if the target hook can handle this kind of object. */
2483 if (targetm
.asm_out
.integer (x
, size
, aligned_p
))
2486 /* If the object is a multi-byte one, try splitting it up. Split
2487 it into words it if is multi-word, otherwise split it into bytes. */
2490 enum machine_mode omode
, imode
;
2491 unsigned int subalign
;
2492 unsigned int subsize
, i
;
2493 enum mode_class mclass
;
2495 subsize
= size
> UNITS_PER_WORD
? UNITS_PER_WORD
: 1;
2496 subalign
= MIN (align
, subsize
* BITS_PER_UNIT
);
2497 if (GET_CODE (x
) == CONST_FIXED
)
2498 mclass
= GET_MODE_CLASS (GET_MODE (x
));
2502 omode
= mode_for_size (subsize
* BITS_PER_UNIT
, mclass
, 0);
2503 imode
= mode_for_size (size
* BITS_PER_UNIT
, mclass
, 0);
2505 for (i
= 0; i
< size
; i
+= subsize
)
2507 rtx partial
= simplify_subreg (omode
, x
, imode
, i
);
2508 if (!partial
|| !assemble_integer (partial
, subsize
, subalign
, 0))
2514 /* If we've printed some of it, but not all of it, there's no going
2519 gcc_assert (!force
);
2525 assemble_real (REAL_VALUE_TYPE d
, enum machine_mode mode
, unsigned int align
)
2527 long data
[4] = {0, 0, 0, 0};
2529 int bitsize
, nelts
, nunits
, units_per
;
2531 /* This is hairy. We have a quantity of known size. real_to_target
2532 will put it into an array of *host* longs, 32 bits per element
2533 (even if long is more than 32 bits). We need to determine the
2534 number of array elements that are occupied (nelts) and the number
2535 of *target* min-addressable units that will be occupied in the
2536 object file (nunits). We cannot assume that 32 divides the
2537 mode's bitsize (size * BITS_PER_UNIT) evenly.
2539 size * BITS_PER_UNIT is used here to make sure that padding bits
2540 (which might appear at either end of the value; real_to_target
2541 will include the padding bits in its output array) are included. */
2543 nunits
= GET_MODE_SIZE (mode
);
2544 bitsize
= nunits
* BITS_PER_UNIT
;
2545 nelts
= CEIL (bitsize
, 32);
2546 units_per
= 32 / BITS_PER_UNIT
;
2548 real_to_target (data
, &d
, mode
);
2550 /* Put out the first word with the specified alignment. */
2551 assemble_integer (GEN_INT (data
[0]), MIN (nunits
, units_per
), align
, 1);
2552 nunits
-= units_per
;
2554 /* Subsequent words need only 32-bit alignment. */
2555 align
= min_align (align
, 32);
2557 for (i
= 1; i
< nelts
; i
++)
2559 assemble_integer (GEN_INT (data
[i
]), MIN (nunits
, units_per
), align
, 1);
2560 nunits
-= units_per
;
2564 /* Given an expression EXP with a constant value,
2565 reduce it to the sum of an assembler symbol and an integer.
2566 Store them both in the structure *VALUE.
2567 EXP must be reducible. */
2571 HOST_WIDE_INT offset
;
2575 decode_addr_const (tree exp
, struct addr_const
*value
)
2577 tree target
= TREE_OPERAND (exp
, 0);
2583 if (TREE_CODE (target
) == COMPONENT_REF
2584 && host_integerp (byte_position (TREE_OPERAND (target
, 1)), 0))
2586 offset
+= int_byte_position (TREE_OPERAND (target
, 1));
2587 target
= TREE_OPERAND (target
, 0);
2589 else if (TREE_CODE (target
) == ARRAY_REF
2590 || TREE_CODE (target
) == ARRAY_RANGE_REF
)
2592 offset
+= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (target
)), 1)
2593 * tree_low_cst (TREE_OPERAND (target
, 1), 0));
2594 target
= TREE_OPERAND (target
, 0);
2596 else if (TREE_CODE (target
) == MEM_REF
2597 && TREE_CODE (TREE_OPERAND (target
, 0)) == ADDR_EXPR
)
2599 offset
+= mem_ref_offset (target
).low
;
2600 target
= TREE_OPERAND (TREE_OPERAND (target
, 0), 0);
2602 else if (TREE_CODE (target
) == INDIRECT_REF
2603 && TREE_CODE (TREE_OPERAND (target
, 0)) == NOP_EXPR
2604 && TREE_CODE (TREE_OPERAND (TREE_OPERAND (target
, 0), 0))
2606 target
= TREE_OPERAND (TREE_OPERAND (TREE_OPERAND (target
, 0), 0), 0);
2611 switch (TREE_CODE (target
))
2615 x
= DECL_RTL (target
);
2619 x
= gen_rtx_MEM (FUNCTION_MODE
,
2620 gen_rtx_LABEL_REF (Pmode
, force_label_rtx (target
)));
2629 x
= output_constant_def (target
, 1);
2636 gcc_assert (MEM_P (x
));
2640 value
->offset
= offset
;
2644 static GTY((param_is (struct constant_descriptor_tree
)))
2645 htab_t const_desc_htab
;
2647 static void maybe_output_constant_def_contents (struct constant_descriptor_tree
*, int);
2649 /* Constant pool accessor function. */
2652 constant_pool_htab (void)
2654 return const_desc_htab
;
2657 /* Compute a hash code for a constant expression. */
2660 const_desc_hash (const void *ptr
)
2662 return ((const struct constant_descriptor_tree
*)ptr
)->hash
;
2666 const_hash_1 (const tree exp
)
2671 enum tree_code code
= TREE_CODE (exp
);
2673 /* Either set P and LEN to the address and len of something to hash and
2674 exit the switch or return a value. */
2679 p
= (char *) &TREE_INT_CST (exp
);
2680 len
= sizeof TREE_INT_CST (exp
);
2684 return real_hash (TREE_REAL_CST_PTR (exp
));
2687 return fixed_hash (TREE_FIXED_CST_PTR (exp
));
2690 p
= TREE_STRING_POINTER (exp
);
2691 len
= TREE_STRING_LENGTH (exp
);
2695 return (const_hash_1 (TREE_REALPART (exp
)) * 5
2696 + const_hash_1 (TREE_IMAGPART (exp
)));
2702 hi
= 7 + TYPE_VECTOR_SUBPARTS (TREE_TYPE (exp
));
2704 for (link
= TREE_VECTOR_CST_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2705 hi
= hi
* 563 + const_hash_1 (TREE_VALUE (link
));
2712 unsigned HOST_WIDE_INT idx
;
2715 hi
= 5 + int_size_in_bytes (TREE_TYPE (exp
));
2717 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (exp
), idx
, value
)
2719 hi
= hi
* 603 + const_hash_1 (value
);
2727 struct addr_const value
;
2729 decode_addr_const (exp
, &value
);
2730 switch (GET_CODE (value
.base
))
2733 /* Don't hash the address of the SYMBOL_REF;
2734 only use the offset and the symbol name. */
2736 p
= XSTR (value
.base
, 0);
2737 for (i
= 0; p
[i
] != 0; i
++)
2738 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2742 hi
= value
.offset
+ CODE_LABEL_NUMBER (XEXP (value
.base
, 0)) * 13;
2752 case POINTER_PLUS_EXPR
:
2754 return (const_hash_1 (TREE_OPERAND (exp
, 0)) * 9
2755 + const_hash_1 (TREE_OPERAND (exp
, 1)));
2758 return const_hash_1 (TREE_OPERAND (exp
, 0)) * 7 + 2;
2761 /* A language specific constant. Just hash the code. */
2765 /* Compute hashing function. */
2767 for (i
= 0; i
< len
; i
++)
2768 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2773 /* Wrapper of compare_constant, for the htab interface. */
2775 const_desc_eq (const void *p1
, const void *p2
)
2777 const struct constant_descriptor_tree
*const c1
2778 = (const struct constant_descriptor_tree
*) p1
;
2779 const struct constant_descriptor_tree
*const c2
2780 = (const struct constant_descriptor_tree
*) p2
;
2781 if (c1
->hash
!= c2
->hash
)
2783 return compare_constant (c1
->value
, c2
->value
);
2786 /* Compare t1 and t2, and return 1 only if they are known to result in
2787 the same bit pattern on output. */
2790 compare_constant (const tree t1
, const tree t2
)
2792 enum tree_code typecode
;
2794 if (t1
== NULL_TREE
)
2795 return t2
== NULL_TREE
;
2796 if (t2
== NULL_TREE
)
2799 if (TREE_CODE (t1
) != TREE_CODE (t2
))
2802 switch (TREE_CODE (t1
))
2805 /* Integer constants are the same only if the same width of type. */
2806 if (TYPE_PRECISION (TREE_TYPE (t1
)) != TYPE_PRECISION (TREE_TYPE (t2
)))
2808 if (TYPE_MODE (TREE_TYPE (t1
)) != TYPE_MODE (TREE_TYPE (t2
)))
2810 return tree_int_cst_equal (t1
, t2
);
2813 /* Real constants are the same only if the same width of type. */
2814 if (TYPE_PRECISION (TREE_TYPE (t1
)) != TYPE_PRECISION (TREE_TYPE (t2
)))
2817 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
2820 /* Fixed constants are the same only if the same width of type. */
2821 if (TYPE_PRECISION (TREE_TYPE (t1
)) != TYPE_PRECISION (TREE_TYPE (t2
)))
2824 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1
), TREE_FIXED_CST (t2
));
2827 if (TYPE_MODE (TREE_TYPE (t1
)) != TYPE_MODE (TREE_TYPE (t2
)))
2830 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
2831 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
2832 TREE_STRING_LENGTH (t1
)));
2835 return (compare_constant (TREE_REALPART (t1
), TREE_REALPART (t2
))
2836 && compare_constant (TREE_IMAGPART (t1
), TREE_IMAGPART (t2
)));
2842 if (TYPE_VECTOR_SUBPARTS (TREE_TYPE (t1
))
2843 != TYPE_VECTOR_SUBPARTS (TREE_TYPE (t2
)))
2846 link2
= TREE_VECTOR_CST_ELTS (t2
);
2847 for (link1
= TREE_VECTOR_CST_ELTS (t1
);
2849 link1
= TREE_CHAIN (link1
))
2851 if (!compare_constant (TREE_VALUE (link1
), TREE_VALUE (link2
)))
2853 link2
= TREE_CHAIN (link2
);
2861 VEC(constructor_elt
, gc
) *v1
, *v2
;
2862 unsigned HOST_WIDE_INT idx
;
2864 typecode
= TREE_CODE (TREE_TYPE (t1
));
2865 if (typecode
!= TREE_CODE (TREE_TYPE (t2
)))
2868 if (typecode
== ARRAY_TYPE
)
2870 HOST_WIDE_INT size_1
= int_size_in_bytes (TREE_TYPE (t1
));
2871 /* For arrays, check that the sizes all match. */
2872 if (TYPE_MODE (TREE_TYPE (t1
)) != TYPE_MODE (TREE_TYPE (t2
))
2874 || size_1
!= int_size_in_bytes (TREE_TYPE (t2
)))
2879 /* For record and union constructors, require exact type
2881 if (TREE_TYPE (t1
) != TREE_TYPE (t2
))
2885 v1
= CONSTRUCTOR_ELTS (t1
);
2886 v2
= CONSTRUCTOR_ELTS (t2
);
2887 if (VEC_length (constructor_elt
, v1
)
2888 != VEC_length (constructor_elt
, v2
))
2891 for (idx
= 0; idx
< VEC_length (constructor_elt
, v1
); ++idx
)
2893 constructor_elt
*c1
= VEC_index (constructor_elt
, v1
, idx
);
2894 constructor_elt
*c2
= VEC_index (constructor_elt
, v2
, idx
);
2896 /* Check that each value is the same... */
2897 if (!compare_constant (c1
->value
, c2
->value
))
2899 /* ... and that they apply to the same fields! */
2900 if (typecode
== ARRAY_TYPE
)
2902 if (!compare_constant (c1
->index
, c2
->index
))
2907 if (c1
->index
!= c2
->index
)
2918 struct addr_const value1
, value2
;
2922 decode_addr_const (t1
, &value1
);
2923 decode_addr_const (t2
, &value2
);
2925 if (value1
.offset
!= value2
.offset
)
2928 code
= GET_CODE (value1
.base
);
2929 if (code
!= GET_CODE (value2
.base
))
2935 ret
= (strcmp (XSTR (value1
.base
, 0), XSTR (value2
.base
, 0)) == 0);
2939 ret
= (CODE_LABEL_NUMBER (XEXP (value1
.base
, 0))
2940 == CODE_LABEL_NUMBER (XEXP (value2
.base
, 0)));
2950 case POINTER_PLUS_EXPR
:
2953 return (compare_constant (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0))
2954 && compare_constant(TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1)));
2957 case VIEW_CONVERT_EXPR
:
2958 return compare_constant (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
2967 /* Make a copy of the whole tree structure for a constant. This
2968 handles the same types of nodes that compare_constant handles. */
2971 copy_constant (tree exp
)
2973 switch (TREE_CODE (exp
))
2976 /* For ADDR_EXPR, we do not want to copy the decl whose address
2977 is requested. We do want to copy constants though. */
2978 if (CONSTANT_CLASS_P (TREE_OPERAND (exp
, 0)))
2979 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2980 copy_constant (TREE_OPERAND (exp
, 0)));
2982 return copy_node (exp
);
2988 return copy_node (exp
);
2991 return build_complex (TREE_TYPE (exp
),
2992 copy_constant (TREE_REALPART (exp
)),
2993 copy_constant (TREE_IMAGPART (exp
)));
2996 case POINTER_PLUS_EXPR
:
2998 return build2 (TREE_CODE (exp
), TREE_TYPE (exp
),
2999 copy_constant (TREE_OPERAND (exp
, 0)),
3000 copy_constant (TREE_OPERAND (exp
, 1)));
3003 case VIEW_CONVERT_EXPR
:
3004 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
3005 copy_constant (TREE_OPERAND (exp
, 0)));
3008 return build_vector (TREE_TYPE (exp
),
3009 copy_list (TREE_VECTOR_CST_ELTS (exp
)));
3013 tree copy
= copy_node (exp
);
3014 VEC(constructor_elt
, gc
) *v
;
3015 unsigned HOST_WIDE_INT idx
;
3016 tree purpose
, value
;
3018 v
= VEC_alloc(constructor_elt
, gc
, VEC_length(constructor_elt
,
3019 CONSTRUCTOR_ELTS (exp
)));
3020 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (exp
), idx
, purpose
, value
)
3022 constructor_elt
*ce
= VEC_quick_push (constructor_elt
, v
, NULL
);
3023 ce
->index
= purpose
;
3024 ce
->value
= copy_constant (value
);
3026 CONSTRUCTOR_ELTS (copy
) = v
;
3035 /* Return the section into which constant EXP should be placed. */
3038 get_constant_section (tree exp
, unsigned int align
)
3040 return targetm
.asm_out
.select_section (exp
,
3041 compute_reloc_for_constant (exp
),
3045 /* Return the size of constant EXP in bytes. */
3047 static HOST_WIDE_INT
3048 get_constant_size (tree exp
)
3052 size
= int_size_in_bytes (TREE_TYPE (exp
));
3053 if (TREE_CODE (exp
) == STRING_CST
)
3054 size
= MAX (TREE_STRING_LENGTH (exp
), size
);
3058 /* Subroutine of output_constant_def:
3059 No constant equal to EXP is known to have been output.
3060 Make a constant descriptor to enter EXP in the hash table.
3061 Assign the label number and construct RTL to refer to the
3062 constant's location in memory.
3063 Caller is responsible for updating the hash table. */
3065 static struct constant_descriptor_tree
*
3066 build_constant_desc (tree exp
)
3068 struct constant_descriptor_tree
*desc
;
3074 desc
= ggc_alloc_constant_descriptor_tree ();
3075 desc
->value
= copy_constant (exp
);
3077 /* Propagate marked-ness to copied constant. */
3078 if (flag_mudflap
&& mf_marked_p (exp
))
3079 mf_mark (desc
->value
);
3081 /* Create a string containing the label name, in LABEL. */
3082 labelno
= const_labelno
++;
3083 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", labelno
);
3085 /* Construct the VAR_DECL associated with the constant. */
3086 decl
= build_decl (UNKNOWN_LOCATION
, VAR_DECL
, get_identifier (label
),
3088 DECL_ARTIFICIAL (decl
) = 1;
3089 DECL_IGNORED_P (decl
) = 1;
3090 TREE_READONLY (decl
) = 1;
3091 TREE_STATIC (decl
) = 1;
3092 TREE_ADDRESSABLE (decl
) = 1;
3093 /* We don't set the RTL yet as this would cause varpool to assume that the
3094 variable is referenced. Moreover, it would just be dropped in LTO mode.
3095 Instead we set the flag that will be recognized in make_decl_rtl. */
3096 DECL_IN_CONSTANT_POOL (decl
) = 1;
3097 DECL_INITIAL (decl
) = desc
->value
;
3098 /* ??? CONSTANT_ALIGNMENT hasn't been updated for vector types on most
3099 architectures so use DATA_ALIGNMENT as well, except for strings. */
3100 if (TREE_CODE (exp
) == STRING_CST
)
3102 #ifdef CONSTANT_ALIGNMENT
3103 DECL_ALIGN (decl
) = CONSTANT_ALIGNMENT (exp
, DECL_ALIGN (decl
));
3107 align_variable (decl
, 0);
3109 /* Now construct the SYMBOL_REF and the MEM. */
3110 if (use_object_blocks_p ())
3112 section
*sect
= get_constant_section (exp
, DECL_ALIGN (decl
));
3113 symbol
= create_block_symbol (ggc_strdup (label
),
3114 get_block_for_section (sect
), -1);
3117 symbol
= gen_rtx_SYMBOL_REF (Pmode
, ggc_strdup (label
));
3118 SYMBOL_REF_FLAGS (symbol
) |= SYMBOL_FLAG_LOCAL
;
3119 SET_SYMBOL_REF_DECL (symbol
, decl
);
3120 TREE_CONSTANT_POOL_ADDRESS_P (symbol
) = 1;
3122 rtl
= gen_const_mem (TYPE_MODE (TREE_TYPE (exp
)), symbol
);
3123 set_mem_attributes (rtl
, exp
, 1);
3124 set_mem_alias_set (rtl
, 0);
3125 set_mem_alias_set (rtl
, const_alias_set
);
3127 /* We cannot share RTX'es in pool entries.
3128 Mark this piece of RTL as required for unsharing. */
3129 RTX_FLAG (rtl
, used
) = 1;
3131 /* Set flags or add text to the name to record information, such as
3132 that it is a local symbol. If the name is changed, the macro
3133 ASM_OUTPUT_LABELREF will have to know how to strip this
3134 information. This call might invalidate our local variable
3135 SYMBOL; we can't use it afterward. */
3136 targetm
.encode_section_info (exp
, rtl
, true);
3143 /* Return an rtx representing a reference to constant data in memory
3144 for the constant expression EXP.
3146 If assembler code for such a constant has already been output,
3147 return an rtx to refer to it.
3148 Otherwise, output such a constant in memory
3149 and generate an rtx for it.
3151 If DEFER is nonzero, this constant can be deferred and output only
3152 if referenced in the function after all optimizations.
3154 `const_desc_table' records which constants already have label strings. */
3157 output_constant_def (tree exp
, int defer
)
3159 struct constant_descriptor_tree
*desc
;
3160 struct constant_descriptor_tree key
;
3163 /* Look up EXP in the table of constant descriptors. If we didn't find
3164 it, create a new one. */
3166 key
.hash
= const_hash_1 (exp
);
3167 loc
= htab_find_slot_with_hash (const_desc_htab
, &key
, key
.hash
, INSERT
);
3169 desc
= (struct constant_descriptor_tree
*) *loc
;
3172 desc
= build_constant_desc (exp
);
3173 desc
->hash
= key
.hash
;
3177 maybe_output_constant_def_contents (desc
, defer
);
3181 /* Subroutine of output_constant_def: Decide whether or not we need to
3182 output the constant DESC now, and if so, do it. */
3184 maybe_output_constant_def_contents (struct constant_descriptor_tree
*desc
,
3187 rtx symbol
= XEXP (desc
->rtl
, 0);
3188 tree exp
= desc
->value
;
3190 if (flag_syntax_only
)
3193 if (TREE_ASM_WRITTEN (exp
))
3194 /* Already output; don't do it again. */
3197 /* We can always defer constants as long as the context allows
3201 /* Increment n_deferred_constants if it exists. It needs to be at
3202 least as large as the number of constants actually referred to
3203 by the function. If it's too small we'll stop looking too early
3204 and fail to emit constants; if it's too large we'll only look
3205 through the entire function when we could have stopped earlier. */
3207 n_deferred_constants
++;
3211 output_constant_def_contents (symbol
);
3214 /* Subroutine of output_constant_def_contents. Output the definition
3215 of constant EXP, which is pointed to by label LABEL. ALIGN is the
3216 constant's alignment in bits. */
3219 assemble_constant_contents (tree exp
, const char *label
, unsigned int align
)
3223 size
= get_constant_size (exp
);
3225 /* Do any machine/system dependent processing of the constant. */
3226 targetm
.asm_out
.declare_constant_name (asm_out_file
, label
, exp
, size
);
3228 /* Output the value of EXP. */
3229 output_constant (exp
, size
, align
);
3232 /* We must output the constant data referred to by SYMBOL; do so. */
3235 output_constant_def_contents (rtx symbol
)
3237 tree decl
= SYMBOL_REF_DECL (symbol
);
3238 tree exp
= DECL_INITIAL (decl
);
3241 /* Make sure any other constants whose addresses appear in EXP
3242 are assigned label numbers. */
3243 output_addressed_constants (exp
);
3245 /* We are no longer deferring this constant. */
3246 TREE_ASM_WRITTEN (decl
) = TREE_ASM_WRITTEN (exp
) = 1;
3248 /* If the constant is part of an object block, make sure that the
3249 decl has been positioned within its block, but do not write out
3250 its definition yet. output_object_blocks will do that later. */
3251 if (SYMBOL_REF_HAS_BLOCK_INFO_P (symbol
) && SYMBOL_REF_BLOCK (symbol
))
3252 place_block_symbol (symbol
);
3255 align
= DECL_ALIGN (decl
);
3256 switch_to_section (get_constant_section (exp
, align
));
3257 if (align
> BITS_PER_UNIT
)
3258 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
3259 assemble_constant_contents (exp
, XSTR (symbol
, 0), align
);
3262 mudflap_enqueue_constant (exp
);
3265 /* Look up EXP in the table of constant descriptors. Return the rtl
3266 if it has been emitted, else null. */
3269 lookup_constant_def (tree exp
)
3271 struct constant_descriptor_tree
*desc
;
3272 struct constant_descriptor_tree key
;
3275 key
.hash
= const_hash_1 (exp
);
3276 desc
= (struct constant_descriptor_tree
*)
3277 htab_find_with_hash (const_desc_htab
, &key
, key
.hash
);
3279 return (desc
? desc
->rtl
: NULL_RTX
);
3282 /* Return a tree representing a reference to constant data in memory
3283 for the constant expression EXP.
3285 This is the counterpart of output_constant_def at the Tree level. */
3288 tree_output_constant_def (tree exp
)
3290 struct constant_descriptor_tree
*desc
, key
;
3294 /* Look up EXP in the table of constant descriptors. If we didn't find
3295 it, create a new one. */
3297 key
.hash
= const_hash_1 (exp
);
3298 loc
= htab_find_slot_with_hash (const_desc_htab
, &key
, key
.hash
, INSERT
);
3300 desc
= (struct constant_descriptor_tree
*) *loc
;
3303 desc
= build_constant_desc (exp
);
3304 desc
->hash
= key
.hash
;
3308 decl
= SYMBOL_REF_DECL (XEXP (desc
->rtl
, 0));
3309 varpool_finalize_decl (decl
);
3313 /* Used in the hash tables to avoid outputting the same constant
3314 twice. Unlike 'struct constant_descriptor_tree', RTX constants
3315 are output once per function, not once per file. */
3316 /* ??? Only a few targets need per-function constant pools. Most
3317 can use one per-file pool. Should add a targetm bit to tell the
3320 struct GTY(()) rtx_constant_pool
{
3321 /* Pointers to first and last constant in pool, as ordered by offset. */
3322 struct constant_descriptor_rtx
*first
;
3323 struct constant_descriptor_rtx
*last
;
3325 /* Hash facility for making memory-constants from constant rtl-expressions.
3326 It is used on RISC machines where immediate integer arguments and
3327 constant addresses are restricted so that such constants must be stored
3329 htab_t
GTY((param_is (struct constant_descriptor_rtx
))) const_rtx_htab
;
3331 /* Current offset in constant pool (does not include any
3332 machine-specific header). */
3333 HOST_WIDE_INT offset
;
3336 struct GTY((chain_next ("%h.next"))) constant_descriptor_rtx
{
3337 struct constant_descriptor_rtx
*next
;
3341 HOST_WIDE_INT offset
;
3343 enum machine_mode mode
;
3349 /* Hash and compare functions for const_rtx_htab. */
3352 const_desc_rtx_hash (const void *ptr
)
3354 const struct constant_descriptor_rtx
*const desc
3355 = (const struct constant_descriptor_rtx
*) ptr
;
3360 const_desc_rtx_eq (const void *a
, const void *b
)
3362 const struct constant_descriptor_rtx
*const x
3363 = (const struct constant_descriptor_rtx
*) a
;
3364 const struct constant_descriptor_rtx
*const y
3365 = (const struct constant_descriptor_rtx
*) b
;
3367 if (x
->mode
!= y
->mode
)
3369 return rtx_equal_p (x
->constant
, y
->constant
);
3372 /* This is the worker function for const_rtx_hash, called via for_each_rtx. */
3375 const_rtx_hash_1 (rtx
*xp
, void *data
)
3377 unsigned HOST_WIDE_INT hwi
;
3378 enum machine_mode mode
;
3384 code
= GET_CODE (x
);
3385 mode
= GET_MODE (x
);
3386 h
= (hashval_t
) code
* 1048573 + mode
;
3394 int shift
= sizeof (hashval_t
) * CHAR_BIT
;
3395 const int n
= sizeof (HOST_WIDE_INT
) / sizeof (hashval_t
);
3398 h
^= (hashval_t
) hwi
;
3399 for (i
= 1; i
< n
; ++i
)
3402 h
^= (hashval_t
) hwi
;
3408 if (mode
== VOIDmode
)
3410 hwi
= CONST_DOUBLE_LOW (x
) ^ CONST_DOUBLE_HIGH (x
);
3414 h
^= real_hash (CONST_DOUBLE_REAL_VALUE (x
));
3418 h
^= fixed_hash (CONST_FIXED_VALUE (x
));
3424 for (i
= XVECLEN (x
, 0); i
-- > 0; )
3425 h
= h
* 251 + const_rtx_hash_1 (&XVECEXP (x
, 0, i
), data
);
3430 h
^= htab_hash_string (XSTR (x
, 0));
3434 h
= h
* 251 + CODE_LABEL_NUMBER (XEXP (x
, 0));
3438 case UNSPEC_VOLATILE
:
3439 h
= h
* 251 + XINT (x
, 1);
3446 hp
= (hashval_t
*) data
;
3447 *hp
= *hp
* 509 + h
;
3451 /* Compute a hash value for X, which should be a constant. */
3454 const_rtx_hash (rtx x
)
3457 for_each_rtx (&x
, const_rtx_hash_1
, &h
);
3462 /* Create and return a new rtx constant pool. */
3464 static struct rtx_constant_pool
*
3465 create_constant_pool (void)
3467 struct rtx_constant_pool
*pool
;
3469 pool
= ggc_alloc_rtx_constant_pool ();
3470 pool
->const_rtx_htab
= htab_create_ggc (31, const_desc_rtx_hash
,
3471 const_desc_rtx_eq
, NULL
);
3478 /* Initialize constant pool hashing for a new function. */
3481 init_varasm_status (void)
3483 crtl
->varasm
.pool
= create_constant_pool ();
3484 crtl
->varasm
.deferred_constants
= 0;
3487 /* Given a MINUS expression, simplify it if both sides
3488 include the same symbol. */
3491 simplify_subtraction (rtx x
)
3493 rtx r
= simplify_rtx (x
);
3497 /* Given a constant rtx X, make (or find) a memory constant for its value
3498 and return a MEM rtx to refer to it in memory. */
3501 force_const_mem (enum machine_mode mode
, rtx x
)
3503 struct constant_descriptor_rtx
*desc
, tmp
;
3504 struct rtx_constant_pool
*pool
;
3511 /* If we're not allowed to drop X into the constant pool, don't. */
3512 if (targetm
.cannot_force_const_mem (mode
, x
))
3515 /* Record that this function has used a constant pool entry. */
3516 crtl
->uses_const_pool
= 1;
3518 /* Decide which pool to use. */
3519 pool
= (targetm
.use_blocks_for_constant_p (mode
, x
)
3520 ? shared_constant_pool
3521 : crtl
->varasm
.pool
);
3523 /* Lookup the value in the hashtable. */
3526 hash
= const_rtx_hash (x
);
3527 slot
= htab_find_slot_with_hash (pool
->const_rtx_htab
, &tmp
, hash
, INSERT
);
3528 desc
= (struct constant_descriptor_rtx
*) *slot
;
3530 /* If the constant was already present, return its memory. */
3532 return copy_rtx (desc
->mem
);
3534 /* Otherwise, create a new descriptor. */
3535 desc
= ggc_alloc_constant_descriptor_rtx ();
3538 /* Align the location counter as required by EXP's data type. */
3539 align
= GET_MODE_ALIGNMENT (mode
== VOIDmode
? word_mode
: mode
);
3540 #ifdef CONSTANT_ALIGNMENT
3542 tree type
= lang_hooks
.types
.type_for_mode (mode
, 0);
3543 if (type
!= NULL_TREE
)
3544 align
= CONSTANT_ALIGNMENT (make_tree (type
, x
), align
);
3548 pool
->offset
+= (align
/ BITS_PER_UNIT
) - 1;
3549 pool
->offset
&= ~ ((align
/ BITS_PER_UNIT
) - 1);
3552 desc
->constant
= copy_rtx (tmp
.constant
);
3553 desc
->offset
= pool
->offset
;
3556 desc
->align
= align
;
3557 desc
->labelno
= const_labelno
;
3560 pool
->offset
+= GET_MODE_SIZE (mode
);
3562 pool
->last
->next
= desc
;
3564 pool
->first
= pool
->last
= desc
;
3567 /* Create a string containing the label name, in LABEL. */
3568 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
3571 /* Construct the SYMBOL_REF. Make sure to mark it as belonging to
3572 the constants pool. */
3573 if (use_object_blocks_p () && targetm
.use_blocks_for_constant_p (mode
, x
))
3575 section
*sect
= targetm
.asm_out
.select_rtx_section (mode
, x
, align
);
3576 symbol
= create_block_symbol (ggc_strdup (label
),
3577 get_block_for_section (sect
), -1);
3580 symbol
= gen_rtx_SYMBOL_REF (Pmode
, ggc_strdup (label
));
3582 SYMBOL_REF_FLAGS (symbol
) |= SYMBOL_FLAG_LOCAL
;
3583 CONSTANT_POOL_ADDRESS_P (symbol
) = 1;
3584 SET_SYMBOL_REF_CONSTANT (symbol
, desc
);
3586 /* Construct the MEM. */
3587 desc
->mem
= def
= gen_const_mem (mode
, symbol
);
3588 set_mem_attributes (def
, lang_hooks
.types
.type_for_mode (mode
, 0), 1);
3589 set_mem_align (def
, align
);
3591 /* If we're dropping a label to the constant pool, make sure we
3593 if (GET_CODE (x
) == LABEL_REF
)
3594 LABEL_PRESERVE_P (XEXP (x
, 0)) = 1;
3596 return copy_rtx (def
);
3599 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
3602 get_pool_constant (rtx addr
)
3604 return SYMBOL_REF_CONSTANT (addr
)->constant
;
3607 /* Given a constant pool SYMBOL_REF, return the corresponding constant
3608 and whether it has been output or not. */
3611 get_pool_constant_mark (rtx addr
, bool *pmarked
)
3613 struct constant_descriptor_rtx
*desc
;
3615 desc
= SYMBOL_REF_CONSTANT (addr
);
3616 *pmarked
= (desc
->mark
!= 0);
3617 return desc
->constant
;
3620 /* Similar, return the mode. */
3623 get_pool_mode (const_rtx addr
)
3625 return SYMBOL_REF_CONSTANT (addr
)->mode
;
3628 /* Return the size of the constant pool. */
3631 get_pool_size (void)
3633 return crtl
->varasm
.pool
->offset
;
3636 /* Worker function for output_constant_pool_1. Emit assembly for X
3637 in MODE with known alignment ALIGN. */
3640 output_constant_pool_2 (enum machine_mode mode
, rtx x
, unsigned int align
)
3642 switch (GET_MODE_CLASS (mode
))
3645 case MODE_DECIMAL_FLOAT
:
3649 gcc_assert (GET_CODE (x
) == CONST_DOUBLE
);
3650 REAL_VALUE_FROM_CONST_DOUBLE (r
, x
);
3651 assemble_real (r
, mode
, align
);
3656 case MODE_PARTIAL_INT
:
3661 assemble_integer (x
, GET_MODE_SIZE (mode
), align
, 1);
3664 case MODE_VECTOR_FLOAT
:
3665 case MODE_VECTOR_INT
:
3666 case MODE_VECTOR_FRACT
:
3667 case MODE_VECTOR_UFRACT
:
3668 case MODE_VECTOR_ACCUM
:
3669 case MODE_VECTOR_UACCUM
:
3672 enum machine_mode submode
= GET_MODE_INNER (mode
);
3673 unsigned int subalign
= MIN (align
, GET_MODE_BITSIZE (submode
));
3675 gcc_assert (GET_CODE (x
) == CONST_VECTOR
);
3676 units
= CONST_VECTOR_NUNITS (x
);
3678 for (i
= 0; i
< units
; i
++)
3680 rtx elt
= CONST_VECTOR_ELT (x
, i
);
3681 output_constant_pool_2 (submode
, elt
, i
? subalign
: align
);
3691 /* Worker function for output_constant_pool. Emit constant DESC,
3692 giving it ALIGN bits of alignment. */
3695 output_constant_pool_1 (struct constant_descriptor_rtx
*desc
,
3702 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3703 whose CODE_LABEL has been deleted. This can occur if a jump table
3704 is eliminated by optimization. If so, write a constant of zero
3705 instead. Note that this can also happen by turning the
3706 CODE_LABEL into a NOTE. */
3707 /* ??? This seems completely and utterly wrong. Certainly it's
3708 not true for NOTE_INSN_DELETED_LABEL, but I disbelieve proper
3709 functioning even with INSN_DELETED_P and friends. */
3712 switch (GET_CODE (tmp
))
3715 if (GET_CODE (XEXP (tmp
, 0)) != PLUS
3716 || GET_CODE (XEXP (XEXP (tmp
, 0), 0)) != LABEL_REF
)
3718 tmp
= XEXP (XEXP (tmp
, 0), 0);
3722 tmp
= XEXP (tmp
, 0);
3723 gcc_assert (!INSN_DELETED_P (tmp
));
3724 gcc_assert (!NOTE_P (tmp
)
3725 || NOTE_KIND (tmp
) != NOTE_INSN_DELETED
);
3732 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3733 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file
, x
, desc
->mode
,
3734 align
, desc
->labelno
, done
);
3737 assemble_align (align
);
3739 /* Output the label. */
3740 targetm
.asm_out
.internal_label (asm_out_file
, "LC", desc
->labelno
);
3742 /* Output the data. */
3743 output_constant_pool_2 (desc
->mode
, x
, align
);
3745 /* Make sure all constants in SECTION_MERGE and not SECTION_STRINGS
3746 sections have proper size. */
3747 if (align
> GET_MODE_BITSIZE (desc
->mode
)
3749 && (in_section
->common
.flags
& SECTION_MERGE
))
3750 assemble_align (align
);
3752 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3758 /* Given a SYMBOL_REF CURRENT_RTX, mark it and all constants it refers
3759 to as used. Emit referenced deferred strings. This function can
3760 be used with for_each_rtx to mark all SYMBOL_REFs in an rtx. */
3763 mark_constant (rtx
*current_rtx
, void *data ATTRIBUTE_UNUSED
)
3765 rtx x
= *current_rtx
;
3767 if (x
== NULL_RTX
|| GET_CODE (x
) != SYMBOL_REF
)
3770 if (CONSTANT_POOL_ADDRESS_P (x
))
3772 struct constant_descriptor_rtx
*desc
= SYMBOL_REF_CONSTANT (x
);
3773 if (desc
->mark
== 0)
3776 for_each_rtx (&desc
->constant
, mark_constant
, NULL
);
3779 else if (TREE_CONSTANT_POOL_ADDRESS_P (x
))
3781 tree decl
= SYMBOL_REF_DECL (x
);
3782 if (!TREE_ASM_WRITTEN (DECL_INITIAL (decl
)))
3784 n_deferred_constants
--;
3785 output_constant_def_contents (x
);
3792 /* Look through appropriate parts of INSN, marking all entries in the
3793 constant pool which are actually being used. Entries that are only
3794 referenced by other constants are also marked as used. Emit
3795 deferred strings that are used. */
3798 mark_constants (rtx insn
)
3803 /* Insns may appear inside a SEQUENCE. Only check the patterns of
3804 insns, not any notes that may be attached. We don't want to mark
3805 a constant just because it happens to appear in a REG_EQUIV note. */
3806 if (GET_CODE (PATTERN (insn
)) == SEQUENCE
)
3808 rtx seq
= PATTERN (insn
);
3809 int i
, n
= XVECLEN (seq
, 0);
3810 for (i
= 0; i
< n
; ++i
)
3812 rtx subinsn
= XVECEXP (seq
, 0, i
);
3813 if (INSN_P (subinsn
))
3814 for_each_rtx (&PATTERN (subinsn
), mark_constant
, NULL
);
3818 for_each_rtx (&PATTERN (insn
), mark_constant
, NULL
);
3821 /* Look through the instructions for this function, and mark all the
3822 entries in POOL which are actually being used. Emit deferred constants
3823 which have indeed been used. */
3826 mark_constant_pool (void)
3830 if (!crtl
->uses_const_pool
&& n_deferred_constants
== 0)
3833 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
3834 mark_constants (insn
);
3836 for (link
= crtl
->epilogue_delay_list
;
3838 link
= XEXP (link
, 1))
3839 mark_constants (XEXP (link
, 0));
3842 /* Write all the constants in POOL. */
3845 output_constant_pool_contents (struct rtx_constant_pool
*pool
)
3847 struct constant_descriptor_rtx
*desc
;
3849 for (desc
= pool
->first
; desc
; desc
= desc
->next
)
3852 /* If the constant is part of an object_block, make sure that
3853 the constant has been positioned within its block, but do not
3854 write out its definition yet. output_object_blocks will do
3856 if (SYMBOL_REF_HAS_BLOCK_INFO_P (desc
->sym
)
3857 && SYMBOL_REF_BLOCK (desc
->sym
))
3858 place_block_symbol (desc
->sym
);
3861 switch_to_section (targetm
.asm_out
.select_rtx_section
3862 (desc
->mode
, desc
->constant
, desc
->align
));
3863 output_constant_pool_1 (desc
, desc
->align
);
3868 /* Mark all constants that are used in the current function, then write
3869 out the function's private constant pool. */
3872 output_constant_pool (const char *fnname ATTRIBUTE_UNUSED
,
3873 tree fndecl ATTRIBUTE_UNUSED
)
3875 struct rtx_constant_pool
*pool
= crtl
->varasm
.pool
;
3877 /* It is possible for gcc to call force_const_mem and then to later
3878 discard the instructions which refer to the constant. In such a
3879 case we do not need to output the constant. */
3880 mark_constant_pool ();
3882 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3883 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file
, fnname
, fndecl
, pool
->offset
);
3886 output_constant_pool_contents (pool
);
3888 #ifdef ASM_OUTPUT_POOL_EPILOGUE
3889 ASM_OUTPUT_POOL_EPILOGUE (asm_out_file
, fnname
, fndecl
, pool
->offset
);
3893 /* Write the contents of the shared constant pool. */
3896 output_shared_constant_pool (void)
3898 output_constant_pool_contents (shared_constant_pool
);
3901 /* Determine what kind of relocations EXP may need. */
3904 compute_reloc_for_constant (tree exp
)
3906 int reloc
= 0, reloc2
;
3909 switch (TREE_CODE (exp
))
3913 /* Go inside any operations that get_inner_reference can handle and see
3914 if what's inside is a constant: no need to do anything here for
3915 addresses of variables or functions. */
3916 for (tem
= TREE_OPERAND (exp
, 0); handled_component_p (tem
);
3917 tem
= TREE_OPERAND (tem
, 0))
3920 if (TREE_PUBLIC (tem
))
3927 case POINTER_PLUS_EXPR
:
3928 reloc
= compute_reloc_for_constant (TREE_OPERAND (exp
, 0));
3929 reloc
|= compute_reloc_for_constant (TREE_OPERAND (exp
, 1));
3933 reloc
= compute_reloc_for_constant (TREE_OPERAND (exp
, 0));
3934 reloc2
= compute_reloc_for_constant (TREE_OPERAND (exp
, 1));
3935 /* The difference of two local labels is computable at link time. */
3936 if (reloc
== 1 && reloc2
== 1)
3943 case VIEW_CONVERT_EXPR
:
3944 reloc
= compute_reloc_for_constant (TREE_OPERAND (exp
, 0));
3949 unsigned HOST_WIDE_INT idx
;
3950 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (exp
), idx
, tem
)
3952 reloc
|= compute_reloc_for_constant (tem
);
3962 /* Find all the constants whose addresses are referenced inside of EXP,
3963 and make sure assembler code with a label has been output for each one.
3964 Indicate whether an ADDR_EXPR has been encountered. */
3967 output_addressed_constants (tree exp
)
3971 switch (TREE_CODE (exp
))
3975 /* Go inside any operations that get_inner_reference can handle and see
3976 if what's inside is a constant: no need to do anything here for
3977 addresses of variables or functions. */
3978 for (tem
= TREE_OPERAND (exp
, 0); handled_component_p (tem
);
3979 tem
= TREE_OPERAND (tem
, 0))
3982 /* If we have an initialized CONST_DECL, retrieve the initializer. */
3983 if (TREE_CODE (tem
) == CONST_DECL
&& DECL_INITIAL (tem
))
3984 tem
= DECL_INITIAL (tem
);
3986 if (CONSTANT_CLASS_P (tem
) || TREE_CODE (tem
) == CONSTRUCTOR
)
3987 output_constant_def (tem
, 0);
3991 case POINTER_PLUS_EXPR
:
3993 output_addressed_constants (TREE_OPERAND (exp
, 1));
3997 case VIEW_CONVERT_EXPR
:
3998 output_addressed_constants (TREE_OPERAND (exp
, 0));
4003 unsigned HOST_WIDE_INT idx
;
4004 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (exp
), idx
, tem
)
4006 output_addressed_constants (tem
);
4015 /* Whether a constructor CTOR is a valid static constant initializer if all
4016 its elements are. This used to be internal to initializer_constant_valid_p
4017 and has been exposed to let other functions like categorize_ctor_elements
4018 evaluate the property while walking a constructor for other purposes. */
4021 constructor_static_from_elts_p (const_tree ctor
)
4023 return (TREE_CONSTANT (ctor
)
4024 && (TREE_CODE (TREE_TYPE (ctor
)) == UNION_TYPE
4025 || TREE_CODE (TREE_TYPE (ctor
)) == RECORD_TYPE
4026 || TREE_CODE (TREE_TYPE (ctor
)) == ARRAY_TYPE
));
4029 static tree
initializer_constant_valid_p_1 (tree value
, tree endtype
,
4032 /* A subroutine of initializer_constant_valid_p. VALUE is a MINUS_EXPR,
4033 PLUS_EXPR or POINTER_PLUS_EXPR. This looks for cases of VALUE
4034 which are valid when ENDTYPE is an integer of any size; in
4035 particular, this does not accept a pointer minus a constant. This
4036 returns null_pointer_node if the VALUE is an absolute constant
4037 which can be used to initialize a static variable. Otherwise it
4041 narrowing_initializer_constant_valid_p (tree value
, tree endtype
, tree
*cache
)
4045 if (!INTEGRAL_TYPE_P (endtype
))
4048 op0
= TREE_OPERAND (value
, 0);
4049 op1
= TREE_OPERAND (value
, 1);
4051 /* Like STRIP_NOPS except allow the operand mode to widen. This
4052 works around a feature of fold that simplifies (int)(p1 - p2) to
4053 ((int)p1 - (int)p2) under the theory that the narrower operation
4056 while (CONVERT_EXPR_P (op0
)
4057 || TREE_CODE (op0
) == NON_LVALUE_EXPR
)
4059 tree inner
= TREE_OPERAND (op0
, 0);
4060 if (inner
== error_mark_node
4061 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner
)))
4062 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op0
)))
4063 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner
)))))
4068 while (CONVERT_EXPR_P (op1
)
4069 || TREE_CODE (op1
) == NON_LVALUE_EXPR
)
4071 tree inner
= TREE_OPERAND (op1
, 0);
4072 if (inner
== error_mark_node
4073 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner
)))
4074 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op1
)))
4075 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner
)))))
4080 op0
= initializer_constant_valid_p_1 (op0
, endtype
, cache
);
4084 op1
= initializer_constant_valid_p_1 (op1
, endtype
,
4085 cache
? cache
+ 2 : NULL
);
4086 /* Both initializers must be known. */
4090 && (op0
== null_pointer_node
4091 || TREE_CODE (value
) == MINUS_EXPR
))
4092 return null_pointer_node
;
4094 /* Support differences between labels. */
4095 if (TREE_CODE (op0
) == LABEL_DECL
4096 && TREE_CODE (op1
) == LABEL_DECL
)
4097 return null_pointer_node
;
4099 if (TREE_CODE (op0
) == STRING_CST
4100 && TREE_CODE (op1
) == STRING_CST
4101 && operand_equal_p (op0
, op1
, 1))
4102 return null_pointer_node
;
4108 /* Helper function of initializer_constant_valid_p.
4109 Return nonzero if VALUE is a valid constant-valued expression
4110 for use in initializing a static variable; one that can be an
4111 element of a "constant" initializer.
4113 Return null_pointer_node if the value is absolute;
4114 if it is relocatable, return the variable that determines the relocation.
4115 We assume that VALUE has been folded as much as possible;
4116 therefore, we do not need to check for such things as
4117 arithmetic-combinations of integers.
4119 Use CACHE (pointer to 2 tree values) for caching if non-NULL. */
4122 initializer_constant_valid_p_1 (tree value
, tree endtype
, tree
*cache
)
4126 switch (TREE_CODE (value
))
4129 if (constructor_static_from_elts_p (value
))
4131 unsigned HOST_WIDE_INT idx
;
4133 bool absolute
= true;
4135 if (cache
&& cache
[0] == value
)
4137 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (value
), idx
, elt
)
4140 reloc
= initializer_constant_valid_p_1 (elt
, TREE_TYPE (elt
),
4147 cache
[1] = NULL_TREE
;
4151 if (reloc
!= null_pointer_node
)
4154 /* For a non-absolute relocation, there is no single
4155 variable that can be "the variable that determines the
4160 cache
[1] = absolute
? null_pointer_node
: error_mark_node
;
4162 return absolute
? null_pointer_node
: error_mark_node
;
4165 return TREE_STATIC (value
) ? null_pointer_node
: NULL_TREE
;
4173 return null_pointer_node
;
4178 tree op0
= staticp (TREE_OPERAND (value
, 0));
4181 /* "&(*a).f" is like unto pointer arithmetic. If "a" turns out
4182 to be a constant, this is old-skool offsetof-like nonsense. */
4183 if (TREE_CODE (op0
) == INDIRECT_REF
4184 && TREE_CONSTANT (TREE_OPERAND (op0
, 0)))
4185 return null_pointer_node
;
4186 /* Taking the address of a nested function involves a trampoline,
4187 unless we don't need or want one. */
4188 if (TREE_CODE (op0
) == FUNCTION_DECL
4189 && DECL_STATIC_CHAIN (op0
)
4190 && !TREE_NO_TRAMPOLINE (value
))
4192 /* "&{...}" requires a temporary to hold the constructed
4194 if (TREE_CODE (op0
) == CONSTRUCTOR
)
4200 case NON_LVALUE_EXPR
:
4201 return initializer_constant_valid_p_1 (TREE_OPERAND (value
, 0),
4204 case VIEW_CONVERT_EXPR
:
4206 tree src
= TREE_OPERAND (value
, 0);
4207 tree src_type
= TREE_TYPE (src
);
4208 tree dest_type
= TREE_TYPE (value
);
4210 /* Allow view-conversions from aggregate to non-aggregate type only
4211 if the bit pattern is fully preserved afterwards; otherwise, the
4212 RTL expander won't be able to apply a subsequent transformation
4213 to the underlying constructor. */
4214 if (AGGREGATE_TYPE_P (src_type
) && !AGGREGATE_TYPE_P (dest_type
))
4216 if (TYPE_MODE (endtype
) == TYPE_MODE (dest_type
))
4217 return initializer_constant_valid_p_1 (src
, endtype
, cache
);
4222 /* Allow all other kinds of view-conversion. */
4223 return initializer_constant_valid_p_1 (src
, endtype
, cache
);
4228 tree src
= TREE_OPERAND (value
, 0);
4229 tree src_type
= TREE_TYPE (src
);
4230 tree dest_type
= TREE_TYPE (value
);
4232 /* Allow conversions between pointer types, floating-point
4233 types, and offset types. */
4234 if ((POINTER_TYPE_P (dest_type
) && POINTER_TYPE_P (src_type
))
4235 || (FLOAT_TYPE_P (dest_type
) && FLOAT_TYPE_P (src_type
))
4236 || (TREE_CODE (dest_type
) == OFFSET_TYPE
4237 && TREE_CODE (src_type
) == OFFSET_TYPE
))
4238 return initializer_constant_valid_p_1 (src
, endtype
, cache
);
4240 /* Allow length-preserving conversions between integer types. */
4241 if (INTEGRAL_TYPE_P (dest_type
) && INTEGRAL_TYPE_P (src_type
)
4242 && (TYPE_PRECISION (dest_type
) == TYPE_PRECISION (src_type
)))
4243 return initializer_constant_valid_p_1 (src
, endtype
, cache
);
4245 /* Allow conversions between other integer types only if
4247 if (INTEGRAL_TYPE_P (dest_type
) && INTEGRAL_TYPE_P (src_type
))
4249 tree inner
= initializer_constant_valid_p_1 (src
, endtype
, cache
);
4250 if (inner
== null_pointer_node
)
4251 return null_pointer_node
;
4255 /* Allow (int) &foo provided int is as wide as a pointer. */
4256 if (INTEGRAL_TYPE_P (dest_type
) && POINTER_TYPE_P (src_type
)
4257 && (TYPE_PRECISION (dest_type
) >= TYPE_PRECISION (src_type
)))
4258 return initializer_constant_valid_p_1 (src
, endtype
, cache
);
4260 /* Likewise conversions from int to pointers, but also allow
4261 conversions from 0. */
4262 if ((POINTER_TYPE_P (dest_type
)
4263 || TREE_CODE (dest_type
) == OFFSET_TYPE
)
4264 && INTEGRAL_TYPE_P (src_type
))
4266 if (TREE_CODE (src
) == INTEGER_CST
4267 && TYPE_PRECISION (dest_type
) >= TYPE_PRECISION (src_type
))
4268 return null_pointer_node
;
4269 if (integer_zerop (src
))
4270 return null_pointer_node
;
4271 else if (TYPE_PRECISION (dest_type
) <= TYPE_PRECISION (src_type
))
4272 return initializer_constant_valid_p_1 (src
, endtype
, cache
);
4275 /* Allow conversions to struct or union types if the value
4277 if (TREE_CODE (dest_type
) == RECORD_TYPE
4278 || TREE_CODE (dest_type
) == UNION_TYPE
)
4279 return initializer_constant_valid_p_1 (src
, endtype
, cache
);
4283 case POINTER_PLUS_EXPR
:
4285 /* Any valid floating-point constants will have been folded by now;
4286 with -frounding-math we hit this with addition of two constants. */
4287 if (TREE_CODE (endtype
) == REAL_TYPE
)
4289 if (cache
&& cache
[0] == value
)
4291 if (! INTEGRAL_TYPE_P (endtype
)
4292 || TYPE_PRECISION (endtype
) >= TYPE_PRECISION (TREE_TYPE (value
)))
4294 tree ncache
[4] = { NULL_TREE
, NULL_TREE
, NULL_TREE
, NULL_TREE
};
4296 = initializer_constant_valid_p_1 (TREE_OPERAND (value
, 0),
4299 = initializer_constant_valid_p_1 (TREE_OPERAND (value
, 1),
4300 endtype
, ncache
+ 2);
4301 /* If either term is absolute, use the other term's relocation. */
4302 if (valid0
== null_pointer_node
)
4304 else if (valid1
== null_pointer_node
)
4306 /* Support narrowing pointer differences. */
4308 ret
= narrowing_initializer_constant_valid_p (value
, endtype
,
4312 /* Support narrowing pointer differences. */
4313 ret
= narrowing_initializer_constant_valid_p (value
, endtype
, NULL
);
4322 if (TREE_CODE (endtype
) == REAL_TYPE
)
4324 if (cache
&& cache
[0] == value
)
4326 if (! INTEGRAL_TYPE_P (endtype
)
4327 || TYPE_PRECISION (endtype
) >= TYPE_PRECISION (TREE_TYPE (value
)))
4329 tree ncache
[4] = { NULL_TREE
, NULL_TREE
, NULL_TREE
, NULL_TREE
};
4331 = initializer_constant_valid_p_1 (TREE_OPERAND (value
, 0),
4334 = initializer_constant_valid_p_1 (TREE_OPERAND (value
, 1),
4335 endtype
, ncache
+ 2);
4336 /* Win if second argument is absolute. */
4337 if (valid1
== null_pointer_node
)
4339 /* Win if both arguments have the same relocation.
4340 Then the value is absolute. */
4341 else if (valid0
== valid1
&& valid0
!= 0)
4342 ret
= null_pointer_node
;
4343 /* Since GCC guarantees that string constants are unique in the
4344 generated code, a subtraction between two copies of the same
4345 constant string is absolute. */
4346 else if (valid0
&& TREE_CODE (valid0
) == STRING_CST
4347 && valid1
&& TREE_CODE (valid1
) == STRING_CST
4348 && operand_equal_p (valid0
, valid1
, 1))
4349 ret
= null_pointer_node
;
4350 /* Support narrowing differences. */
4352 ret
= narrowing_initializer_constant_valid_p (value
, endtype
,
4356 /* Support narrowing differences. */
4357 ret
= narrowing_initializer_constant_valid_p (value
, endtype
, NULL
);
4372 /* Return nonzero if VALUE is a valid constant-valued expression
4373 for use in initializing a static variable; one that can be an
4374 element of a "constant" initializer.
4376 Return null_pointer_node if the value is absolute;
4377 if it is relocatable, return the variable that determines the relocation.
4378 We assume that VALUE has been folded as much as possible;
4379 therefore, we do not need to check for such things as
4380 arithmetic-combinations of integers. */
4382 initializer_constant_valid_p (tree value
, tree endtype
)
4384 return initializer_constant_valid_p_1 (value
, endtype
, NULL
);
4387 /* Return true if VALUE is a valid constant-valued expression
4388 for use in initializing a static bit-field; one that can be
4389 an element of a "constant" initializer. */
4392 initializer_constant_valid_for_bitfield_p (tree value
)
4394 /* For bitfields we support integer constants or possibly nested aggregates
4396 switch (TREE_CODE (value
))
4400 unsigned HOST_WIDE_INT idx
;
4403 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (value
), idx
, elt
)
4404 if (!initializer_constant_valid_for_bitfield_p (elt
))
4412 case VIEW_CONVERT_EXPR
:
4413 case NON_LVALUE_EXPR
:
4415 initializer_constant_valid_for_bitfield_p (TREE_OPERAND (value
, 0));
4424 /* output_constructor outer state of relevance in recursive calls, typically
4425 for nested aggregate bitfields. */
4428 unsigned int bit_offset
; /* current position in ... */
4429 int byte
; /* ... the outer byte buffer. */
4432 static unsigned HOST_WIDE_INT
4433 output_constructor (tree
, unsigned HOST_WIDE_INT
, unsigned int,
4436 /* Output assembler code for constant EXP to FILE, with no label.
4437 This includes the pseudo-op such as ".int" or ".byte", and a newline.
4438 Assumes output_addressed_constants has been done on EXP already.
4440 Generate exactly SIZE bytes of assembler data, padding at the end
4441 with zeros if necessary. SIZE must always be specified.
4443 SIZE is important for structure constructors,
4444 since trailing members may have been omitted from the constructor.
4445 It is also important for initialization of arrays from string constants
4446 since the full length of the string constant might not be wanted.
4447 It is also needed for initialization of unions, where the initializer's
4448 type is just one member, and that may not be as long as the union.
4450 There a case in which we would fail to output exactly SIZE bytes:
4451 for a structure constructor that wants to produce more than SIZE bytes.
4452 But such constructors will never be generated for any possible input.
4454 ALIGN is the alignment of the data in bits. */
4457 output_constant (tree exp
, unsigned HOST_WIDE_INT size
, unsigned int align
)
4459 enum tree_code code
;
4460 unsigned HOST_WIDE_INT thissize
;
4462 if (size
== 0 || flag_syntax_only
)
4465 /* See if we're trying to initialize a pointer in a non-default mode
4466 to the address of some declaration somewhere. If the target says
4467 the mode is valid for pointers, assume the target has a way of
4469 if (TREE_CODE (exp
) == NOP_EXPR
4470 && POINTER_TYPE_P (TREE_TYPE (exp
))
4471 && targetm
.addr_space
.valid_pointer_mode
4472 (TYPE_MODE (TREE_TYPE (exp
)),
4473 TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (exp
)))))
4475 tree saved_type
= TREE_TYPE (exp
);
4477 /* Peel off any intermediate conversions-to-pointer for valid
4479 while (TREE_CODE (exp
) == NOP_EXPR
4480 && POINTER_TYPE_P (TREE_TYPE (exp
))
4481 && targetm
.addr_space
.valid_pointer_mode
4482 (TYPE_MODE (TREE_TYPE (exp
)),
4483 TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (exp
)))))
4484 exp
= TREE_OPERAND (exp
, 0);
4486 /* If what we're left with is the address of something, we can
4487 convert the address to the final type and output it that
4489 if (TREE_CODE (exp
) == ADDR_EXPR
)
4490 exp
= build1 (ADDR_EXPR
, saved_type
, TREE_OPERAND (exp
, 0));
4491 /* Likewise for constant ints. */
4492 else if (TREE_CODE (exp
) == INTEGER_CST
)
4493 exp
= build_int_cst_wide (saved_type
, TREE_INT_CST_LOW (exp
),
4494 TREE_INT_CST_HIGH (exp
));
4498 /* Eliminate any conversions since we'll be outputting the underlying
4500 while (CONVERT_EXPR_P (exp
)
4501 || TREE_CODE (exp
) == NON_LVALUE_EXPR
4502 || TREE_CODE (exp
) == VIEW_CONVERT_EXPR
)
4504 HOST_WIDE_INT type_size
= int_size_in_bytes (TREE_TYPE (exp
));
4505 HOST_WIDE_INT op_size
= int_size_in_bytes (TREE_TYPE (TREE_OPERAND (exp
, 0)));
4507 /* Make sure eliminating the conversion is really a no-op, except with
4508 VIEW_CONVERT_EXPRs to allow for wild Ada unchecked conversions and
4509 union types to allow for Ada unchecked unions. */
4510 if (type_size
> op_size
4511 && TREE_CODE (exp
) != VIEW_CONVERT_EXPR
4512 && TREE_CODE (TREE_TYPE (exp
)) != UNION_TYPE
)
4513 /* Keep the conversion. */
4516 exp
= TREE_OPERAND (exp
, 0);
4519 code
= TREE_CODE (TREE_TYPE (exp
));
4520 thissize
= int_size_in_bytes (TREE_TYPE (exp
));
4522 /* Allow a constructor with no elements for any data type.
4523 This means to fill the space with zeros. */
4524 if (TREE_CODE (exp
) == CONSTRUCTOR
4525 && VEC_empty (constructor_elt
, CONSTRUCTOR_ELTS (exp
)))
4527 assemble_zeros (size
);
4531 if (TREE_CODE (exp
) == FDESC_EXPR
)
4533 #ifdef ASM_OUTPUT_FDESC
4534 HOST_WIDE_INT part
= tree_low_cst (TREE_OPERAND (exp
, 1), 0);
4535 tree decl
= TREE_OPERAND (exp
, 0);
4536 ASM_OUTPUT_FDESC (asm_out_file
, decl
, part
);
4543 /* Now output the underlying data. If we've handling the padding, return.
4544 Otherwise, break and ensure SIZE is the size written. */
4551 case REFERENCE_TYPE
:
4553 case FIXED_POINT_TYPE
:
4554 if (! assemble_integer (expand_expr (exp
, NULL_RTX
, VOIDmode
,
4555 EXPAND_INITIALIZER
),
4556 MIN (size
, thissize
), align
, 0))
4557 error ("initializer for integer/fixed-point value is too complicated");
4561 if (TREE_CODE (exp
) != REAL_CST
)
4562 error ("initializer for floating value is not a floating constant");
4564 assemble_real (TREE_REAL_CST (exp
), TYPE_MODE (TREE_TYPE (exp
)), align
);
4568 output_constant (TREE_REALPART (exp
), thissize
/ 2, align
);
4569 output_constant (TREE_IMAGPART (exp
), thissize
/ 2,
4570 min_align (align
, BITS_PER_UNIT
* (thissize
/ 2)));
4575 switch (TREE_CODE (exp
))
4578 output_constructor (exp
, size
, align
, NULL
);
4581 thissize
= MIN ((unsigned HOST_WIDE_INT
)TREE_STRING_LENGTH (exp
),
4583 assemble_string (TREE_STRING_POINTER (exp
), thissize
);
4590 unsigned int nalign
;
4591 enum machine_mode inner
;
4593 inner
= TYPE_MODE (TREE_TYPE (TREE_TYPE (exp
)));
4594 nalign
= MIN (align
, GET_MODE_ALIGNMENT (inner
));
4596 elt_size
= GET_MODE_SIZE (inner
);
4598 link
= TREE_VECTOR_CST_ELTS (exp
);
4599 output_constant (TREE_VALUE (link
), elt_size
, align
);
4600 thissize
= elt_size
;
4601 while ((link
= TREE_CHAIN (link
)) != NULL
)
4603 output_constant (TREE_VALUE (link
), elt_size
, nalign
);
4604 thissize
+= elt_size
;
4615 gcc_assert (TREE_CODE (exp
) == CONSTRUCTOR
);
4616 output_constructor (exp
, size
, align
, NULL
);
4626 if (size
> thissize
)
4627 assemble_zeros (size
- thissize
);
4631 /* Subroutine of output_constructor, used for computing the size of
4632 arrays of unspecified length. VAL must be a CONSTRUCTOR of an array
4633 type with an unspecified upper bound. */
4635 static unsigned HOST_WIDE_INT
4636 array_size_for_constructor (tree val
)
4639 unsigned HOST_WIDE_INT cnt
;
4640 tree index
, value
, tmp
;
4643 /* This code used to attempt to handle string constants that are not
4644 arrays of single-bytes, but nothing else does, so there's no point in
4646 if (TREE_CODE (val
) == STRING_CST
)
4647 return TREE_STRING_LENGTH (val
);
4649 max_index
= NULL_TREE
;
4650 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (val
), cnt
, index
, value
)
4652 if (TREE_CODE (index
) == RANGE_EXPR
)
4653 index
= TREE_OPERAND (index
, 1);
4654 if (max_index
== NULL_TREE
|| tree_int_cst_lt (max_index
, index
))
4658 if (max_index
== NULL_TREE
)
4661 /* Compute the total number of array elements. */
4662 tmp
= TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (val
)));
4663 i
= double_int_sub (tree_to_double_int (max_index
), tree_to_double_int (tmp
));
4664 i
= double_int_add (i
, double_int_one
);
4666 /* Multiply by the array element unit size to find number of bytes. */
4667 i
= double_int_mul (i
, tree_to_double_int
4668 (TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (val
)))));
4670 gcc_assert (double_int_fits_in_uhwi_p (i
));
4674 /* Other datastructures + helpers for output_constructor. */
4676 /* output_constructor local state to support interaction with helpers. */
4680 /* Received arguments. */
4681 tree exp
; /* Constructor expression. */
4682 unsigned HOST_WIDE_INT size
; /* # bytes to output - pad if necessary. */
4683 unsigned int align
; /* Known initial alignment. */
4685 /* Constructor expression data. */
4686 tree type
; /* Expression type. */
4687 tree field
; /* Current field decl in a record. */
4688 tree min_index
; /* Lower bound if specified for an array. */
4690 /* Output processing state. */
4691 HOST_WIDE_INT total_bytes
; /* # bytes output so far / current position. */
4692 bool byte_buffer_in_use
; /* Whether byte ... */
4693 int byte
; /* ... contains part of a bitfield byte yet to
4696 int last_relative_index
; /* Implicit or explicit index of the last
4697 array element output within a bitfield. */
4698 /* Current element. */
4699 tree val
; /* Current element value. */
4700 tree index
; /* Current element index. */
4704 /* Helper for output_constructor. From the current LOCAL state, output a
4705 RANGE_EXPR element. */
4708 output_constructor_array_range (oc_local_state
*local
)
4710 unsigned HOST_WIDE_INT fieldsize
4711 = int_size_in_bytes (TREE_TYPE (local
->type
));
4713 HOST_WIDE_INT lo_index
4714 = tree_low_cst (TREE_OPERAND (local
->index
, 0), 0);
4715 HOST_WIDE_INT hi_index
4716 = tree_low_cst (TREE_OPERAND (local
->index
, 1), 0);
4717 HOST_WIDE_INT index
;
4720 = min_align (local
->align
, fieldsize
* BITS_PER_UNIT
);
4722 for (index
= lo_index
; index
<= hi_index
; index
++)
4724 /* Output the element's initial value. */
4725 if (local
->val
== NULL_TREE
)
4726 assemble_zeros (fieldsize
);
4728 output_constant (local
->val
, fieldsize
, align2
);
4730 /* Count its size. */
4731 local
->total_bytes
+= fieldsize
;
4735 /* Helper for output_constructor. From the current LOCAL state, output a
4736 field element that is not true bitfield or part of an outer one. */
4739 output_constructor_regular_field (oc_local_state
*local
)
4741 /* Field size and position. Since this structure is static, we know the
4742 positions are constant. */
4743 unsigned HOST_WIDE_INT fieldsize
;
4744 HOST_WIDE_INT fieldpos
;
4746 unsigned int align2
;
4748 if (local
->index
!= NULL_TREE
)
4750 double_int idx
= double_int_sub (tree_to_double_int (local
->index
),
4751 tree_to_double_int (local
->min_index
));
4752 gcc_assert (double_int_fits_in_shwi_p (idx
));
4753 fieldpos
= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (local
->val
)), 1)
4756 else if (local
->field
!= NULL_TREE
)
4757 fieldpos
= int_byte_position (local
->field
);
4761 /* Output any buffered-up bit-fields preceding this element. */
4762 if (local
->byte_buffer_in_use
)
4764 assemble_integer (GEN_INT (local
->byte
), 1, BITS_PER_UNIT
, 1);
4765 local
->total_bytes
++;
4766 local
->byte_buffer_in_use
= false;
4769 /* Advance to offset of this element.
4770 Note no alignment needed in an array, since that is guaranteed
4771 if each element has the proper size. */
4772 if ((local
->field
!= NULL_TREE
|| local
->index
!= NULL_TREE
)
4773 && fieldpos
!= local
->total_bytes
)
4775 gcc_assert (fieldpos
>= local
->total_bytes
);
4776 assemble_zeros (fieldpos
- local
->total_bytes
);
4777 local
->total_bytes
= fieldpos
;
4780 /* Find the alignment of this element. */
4781 align2
= min_align (local
->align
, BITS_PER_UNIT
* fieldpos
);
4783 /* Determine size this element should occupy. */
4788 /* If this is an array with an unspecified upper bound,
4789 the initializer determines the size. */
4790 /* ??? This ought to only checked if DECL_SIZE_UNIT is NULL,
4791 but we cannot do this until the deprecated support for
4792 initializing zero-length array members is removed. */
4793 if (TREE_CODE (TREE_TYPE (local
->field
)) == ARRAY_TYPE
4794 && TYPE_DOMAIN (TREE_TYPE (local
->field
))
4795 && ! TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (local
->field
))))
4797 fieldsize
= array_size_for_constructor (local
->val
);
4798 /* Given a non-empty initialization, this field had
4800 gcc_assert (!fieldsize
|| !DECL_CHAIN (local
->field
));
4803 fieldsize
= tree_low_cst (DECL_SIZE_UNIT (local
->field
), 1);
4806 fieldsize
= int_size_in_bytes (TREE_TYPE (local
->type
));
4808 /* Output the element's initial value. */
4809 if (local
->val
== NULL_TREE
)
4810 assemble_zeros (fieldsize
);
4812 output_constant (local
->val
, fieldsize
, align2
);
4814 /* Count its size. */
4815 local
->total_bytes
+= fieldsize
;
4818 /* Helper for output_constructor. From the current LOCAL and OUTER states,
4819 output an element that is a true bitfield or part of an outer one. */
4822 output_constructor_bitfield (oc_local_state
*local
, oc_outer_state
*outer
)
4824 /* Bit size of this element. */
4825 HOST_WIDE_INT ebitsize
4827 ? tree_low_cst (DECL_SIZE (local
->field
), 1)
4828 : tree_low_cst (TYPE_SIZE (TREE_TYPE (local
->type
)), 1));
4830 /* Relative index of this element if this is an array component. */
4831 HOST_WIDE_INT relative_index
4834 ? (tree_low_cst (local
->index
, 0)
4835 - tree_low_cst (local
->min_index
, 0))
4836 : local
->last_relative_index
+ 1)
4839 /* Bit position of this element from the start of the containing
4841 HOST_WIDE_INT constructor_relative_ebitpos
4843 ? int_bit_position (local
->field
)
4844 : ebitsize
* relative_index
);
4846 /* Bit position of this element from the start of a possibly ongoing
4847 outer byte buffer. */
4848 HOST_WIDE_INT byte_relative_ebitpos
4849 = ((outer
? outer
->bit_offset
: 0) + constructor_relative_ebitpos
);
4851 /* From the start of a possibly ongoing outer byte buffer, offsets to
4852 the first bit of this element and to the first bit past the end of
4854 HOST_WIDE_INT next_offset
= byte_relative_ebitpos
;
4855 HOST_WIDE_INT end_offset
= byte_relative_ebitpos
+ ebitsize
;
4857 local
->last_relative_index
= relative_index
;
4859 if (local
->val
== NULL_TREE
)
4860 local
->val
= integer_zero_node
;
4862 while (TREE_CODE (local
->val
) == VIEW_CONVERT_EXPR
4863 || TREE_CODE (local
->val
) == NON_LVALUE_EXPR
)
4864 local
->val
= TREE_OPERAND (local
->val
, 0);
4866 if (TREE_CODE (local
->val
) != INTEGER_CST
4867 && TREE_CODE (local
->val
) != CONSTRUCTOR
)
4869 error ("invalid initial value for member %qE", DECL_NAME (local
->field
));
4873 /* If this field does not start in this (or, next) byte,
4875 if (next_offset
/ BITS_PER_UNIT
!= local
->total_bytes
)
4877 /* Output remnant of any bit field in previous bytes. */
4878 if (local
->byte_buffer_in_use
)
4880 assemble_integer (GEN_INT (local
->byte
), 1, BITS_PER_UNIT
, 1);
4881 local
->total_bytes
++;
4882 local
->byte_buffer_in_use
= false;
4885 /* If still not at proper byte, advance to there. */
4886 if (next_offset
/ BITS_PER_UNIT
!= local
->total_bytes
)
4888 gcc_assert (next_offset
/ BITS_PER_UNIT
>= local
->total_bytes
);
4889 assemble_zeros (next_offset
/ BITS_PER_UNIT
- local
->total_bytes
);
4890 local
->total_bytes
= next_offset
/ BITS_PER_UNIT
;
4894 /* Set up the buffer if necessary. */
4895 if (!local
->byte_buffer_in_use
)
4899 local
->byte_buffer_in_use
= true;
4902 /* If this is nested constructor, recurse passing the bit offset and the
4903 pending data, then retrieve the new pending data afterwards. */
4904 if (TREE_CODE (local
->val
) == CONSTRUCTOR
)
4906 oc_outer_state output_state
;
4908 output_state
.bit_offset
= next_offset
% BITS_PER_UNIT
;
4909 output_state
.byte
= local
->byte
;
4911 += output_constructor (local
->val
, 0, 0, &output_state
);
4912 local
->byte
= output_state
.byte
;
4916 /* Otherwise, we must split the element into pieces that fall within
4917 separate bytes, and combine each byte with previous or following
4919 while (next_offset
< end_offset
)
4923 HOST_WIDE_INT value
;
4924 HOST_WIDE_INT next_byte
= next_offset
/ BITS_PER_UNIT
;
4925 HOST_WIDE_INT next_bit
= next_offset
% BITS_PER_UNIT
;
4927 /* Advance from byte to byte
4928 within this element when necessary. */
4929 while (next_byte
!= local
->total_bytes
)
4931 assemble_integer (GEN_INT (local
->byte
), 1, BITS_PER_UNIT
, 1);
4932 local
->total_bytes
++;
4936 /* Number of bits we can process at once
4937 (all part of the same byte). */
4938 this_time
= MIN (end_offset
- next_offset
,
4939 BITS_PER_UNIT
- next_bit
);
4940 if (BYTES_BIG_ENDIAN
)
4942 /* On big-endian machine, take the most significant bits
4943 first (of the bits that are significant)
4944 and put them into bytes from the most significant end. */
4945 shift
= end_offset
- next_offset
- this_time
;
4947 /* Don't try to take a bunch of bits that cross
4948 the word boundary in the INTEGER_CST. We can
4949 only select bits from the LOW or HIGH part
4951 if (shift
< HOST_BITS_PER_WIDE_INT
4952 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4954 this_time
= shift
+ this_time
- HOST_BITS_PER_WIDE_INT
;
4955 shift
= HOST_BITS_PER_WIDE_INT
;
4958 /* Now get the bits from the appropriate constant word. */
4959 if (shift
< HOST_BITS_PER_WIDE_INT
)
4960 value
= TREE_INT_CST_LOW (local
->val
);
4963 gcc_assert (shift
< 2 * HOST_BITS_PER_WIDE_INT
);
4964 value
= TREE_INT_CST_HIGH (local
->val
);
4965 shift
-= HOST_BITS_PER_WIDE_INT
;
4968 /* Get the result. This works only when:
4969 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4970 local
->byte
|= (((value
>> shift
)
4971 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4972 << (BITS_PER_UNIT
- this_time
- next_bit
));
4976 /* On little-endian machines,
4977 take first the least significant bits of the value
4978 and pack them starting at the least significant
4979 bits of the bytes. */
4980 shift
= next_offset
- byte_relative_ebitpos
;
4982 /* Don't try to take a bunch of bits that cross
4983 the word boundary in the INTEGER_CST. We can
4984 only select bits from the LOW or HIGH part
4986 if (shift
< HOST_BITS_PER_WIDE_INT
4987 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4988 this_time
= (HOST_BITS_PER_WIDE_INT
- shift
);
4990 /* Now get the bits from the appropriate constant word. */
4991 if (shift
< HOST_BITS_PER_WIDE_INT
)
4992 value
= TREE_INT_CST_LOW (local
->val
);
4995 gcc_assert (shift
< 2 * HOST_BITS_PER_WIDE_INT
);
4996 value
= TREE_INT_CST_HIGH (local
->val
);
4997 shift
-= HOST_BITS_PER_WIDE_INT
;
5000 /* Get the result. This works only when:
5001 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
5002 local
->byte
|= (((value
>> shift
)
5003 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
5007 next_offset
+= this_time
;
5008 local
->byte_buffer_in_use
= true;
5012 /* Subroutine of output_constant, used for CONSTRUCTORs (aggregate constants).
5013 Generate at least SIZE bytes, padding if necessary. OUTER designates the
5014 caller output state of relevance in recursive invocations. */
5016 static unsigned HOST_WIDE_INT
5017 output_constructor (tree exp
, unsigned HOST_WIDE_INT size
,
5018 unsigned int align
, oc_outer_state
* outer
)
5020 unsigned HOST_WIDE_INT cnt
;
5021 constructor_elt
*ce
;
5023 oc_local_state local
;
5025 /* Setup our local state to communicate with helpers. */
5028 local
.align
= align
;
5030 local
.total_bytes
= 0;
5031 local
.byte_buffer_in_use
= outer
!= NULL
;
5032 local
.byte
= outer
? outer
->byte
: 0;
5034 local
.type
= TREE_TYPE (exp
);
5036 local
.last_relative_index
= -1;
5038 local
.min_index
= NULL_TREE
;
5039 if (TREE_CODE (local
.type
) == ARRAY_TYPE
5040 && TYPE_DOMAIN (local
.type
) != NULL_TREE
)
5041 local
.min_index
= TYPE_MIN_VALUE (TYPE_DOMAIN (local
.type
));
5043 gcc_assert (HOST_BITS_PER_WIDE_INT
>= BITS_PER_UNIT
);
5045 /* As CE goes through the elements of the constant, FIELD goes through the
5046 structure fields if the constant is a structure. If the constant is a
5047 union, we override this by getting the field from the TREE_LIST element.
5048 But the constant could also be an array. Then FIELD is zero.
5050 There is always a maximum of one element in the chain LINK for unions
5051 (even if the initializer in a source program incorrectly contains
5054 local
.field
= NULL_TREE
;
5055 if (TREE_CODE (local
.type
) == RECORD_TYPE
)
5056 local
.field
= TYPE_FIELDS (local
.type
);
5059 VEC_iterate (constructor_elt
, CONSTRUCTOR_ELTS (exp
), cnt
, ce
);
5060 cnt
++, local
.field
= local
.field
? DECL_CHAIN (local
.field
) : 0)
5062 local
.val
= ce
->value
;
5063 local
.index
= NULL_TREE
;
5065 /* The element in a union constructor specifies the proper field
5067 if ((TREE_CODE (local
.type
) == RECORD_TYPE
5068 || TREE_CODE (local
.type
) == UNION_TYPE
5069 || TREE_CODE (local
.type
) == QUAL_UNION_TYPE
)
5070 && ce
->index
!= NULL_TREE
)
5071 local
.field
= ce
->index
;
5073 else if (TREE_CODE (local
.type
) == ARRAY_TYPE
)
5074 local
.index
= ce
->index
;
5076 if (local
.field
&& flag_verbose_asm
)
5077 fprintf (asm_out_file
, "%s %s:\n",
5079 DECL_NAME (local
.field
)
5080 ? IDENTIFIER_POINTER (DECL_NAME (local
.field
))
5083 /* Eliminate the marker that makes a cast not be an lvalue. */
5084 if (local
.val
!= NULL_TREE
)
5085 STRIP_NOPS (local
.val
);
5087 /* Output the current element, using the appropriate helper ... */
5089 /* For an array slice not part of an outer bitfield. */
5091 && local
.index
!= NULL_TREE
5092 && TREE_CODE (local
.index
) == RANGE_EXPR
)
5093 output_constructor_array_range (&local
);
5095 /* For a field that is neither a true bitfield nor part of an outer one,
5096 known to be at least byte aligned and multiple-of-bytes long. */
5098 && (local
.field
== NULL_TREE
5099 || !CONSTRUCTOR_BITFIELD_P (local
.field
)))
5100 output_constructor_regular_field (&local
);
5102 /* For a true bitfield or part of an outer one. */
5104 output_constructor_bitfield (&local
, outer
);
5107 /* If we are not at toplevel, save the pending data for our caller.
5108 Otherwise output the pending data and padding zeros as needed. */
5110 outer
->byte
= local
.byte
;
5113 if (local
.byte_buffer_in_use
)
5115 assemble_integer (GEN_INT (local
.byte
), 1, BITS_PER_UNIT
, 1);
5116 local
.total_bytes
++;
5119 if ((unsigned HOST_WIDE_INT
)local
.total_bytes
< local
.size
)
5121 assemble_zeros (local
.size
- local
.total_bytes
);
5122 local
.total_bytes
= local
.size
;
5126 return local
.total_bytes
;
5129 /* Mark DECL as weak. */
5132 mark_weak (tree decl
)
5134 DECL_WEAK (decl
) = 1;
5136 if (DECL_RTL_SET_P (decl
)
5137 && MEM_P (DECL_RTL (decl
))
5138 && XEXP (DECL_RTL (decl
), 0)
5139 && GET_CODE (XEXP (DECL_RTL (decl
), 0)) == SYMBOL_REF
)
5140 SYMBOL_REF_WEAK (XEXP (DECL_RTL (decl
), 0)) = 1;
5143 /* Merge weak status between NEWDECL and OLDDECL. */
5146 merge_weak (tree newdecl
, tree olddecl
)
5148 if (DECL_WEAK (newdecl
) == DECL_WEAK (olddecl
))
5150 if (DECL_WEAK (newdecl
) && TARGET_SUPPORTS_WEAK
)
5153 /* We put the NEWDECL on the weak_decls list at some point
5154 and OLDDECL as well. Keep just OLDDECL on the list. */
5155 for (pwd
= &weak_decls
; *pwd
; pwd
= &TREE_CHAIN (*pwd
))
5156 if (TREE_VALUE (*pwd
) == newdecl
)
5158 *pwd
= TREE_CHAIN (*pwd
);
5165 if (DECL_WEAK (newdecl
))
5169 /* NEWDECL is weak, but OLDDECL is not. */
5171 /* If we already output the OLDDECL, we're in trouble; we can't
5172 go back and make it weak. This should never happen in
5173 unit-at-a-time compilation. */
5174 gcc_assert (!TREE_ASM_WRITTEN (olddecl
));
5176 /* If we've already generated rtl referencing OLDDECL, we may
5177 have done so in a way that will not function properly with
5178 a weak symbol. Again in unit-at-a-time this should be
5180 gcc_assert (!TREE_USED (olddecl
)
5181 || !TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (olddecl
)));
5183 if (TARGET_SUPPORTS_WEAK
)
5185 /* We put the NEWDECL on the weak_decls list at some point.
5186 Replace it with the OLDDECL. */
5187 for (wd
= weak_decls
; wd
; wd
= TREE_CHAIN (wd
))
5188 if (TREE_VALUE (wd
) == newdecl
)
5190 TREE_VALUE (wd
) = olddecl
;
5193 /* We may not find the entry on the list. If NEWDECL is a
5194 weak alias, then we will have already called
5195 globalize_decl to remove the entry; in that case, we do
5196 not need to do anything. */
5199 /* Make the OLDDECL weak; it's OLDDECL that we'll be keeping. */
5200 mark_weak (olddecl
);
5203 /* OLDDECL was weak, but NEWDECL was not explicitly marked as
5204 weak. Just update NEWDECL to indicate that it's weak too. */
5205 mark_weak (newdecl
);
5208 /* Declare DECL to be a weak symbol. */
5211 declare_weak (tree decl
)
5213 gcc_assert (TREE_CODE (decl
) != FUNCTION_DECL
|| !TREE_ASM_WRITTEN (decl
));
5214 if (! TREE_PUBLIC (decl
))
5215 error ("weak declaration of %q+D must be public", decl
);
5216 else if (!TARGET_SUPPORTS_WEAK
)
5217 warning (0, "weak declaration of %q+D not supported", decl
);
5220 if (!lookup_attribute ("weak", DECL_ATTRIBUTES (decl
)))
5221 DECL_ATTRIBUTES (decl
)
5222 = tree_cons (get_identifier ("weak"), NULL
, DECL_ATTRIBUTES (decl
));
5226 weak_finish_1 (tree decl
)
5228 #if defined (ASM_WEAKEN_DECL) || defined (ASM_WEAKEN_LABEL)
5229 const char *const name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
5232 if (! TREE_USED (decl
))
5235 #ifdef ASM_WEAKEN_DECL
5236 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, NULL
);
5238 #ifdef ASM_WEAKEN_LABEL
5239 ASM_WEAKEN_LABEL (asm_out_file
, name
);
5241 #ifdef ASM_OUTPUT_WEAK_ALIAS
5243 static bool warn_once
= 0;
5246 warning (0, "only weak aliases are supported in this configuration");
5256 /* This TREE_LIST contains weakref targets. */
5258 static GTY(()) tree weakref_targets
;
5260 /* Forward declaration. */
5261 static tree
find_decl_and_mark_needed (tree decl
, tree target
);
5263 /* Emit any pending weak declarations. */
5270 for (t
= weakref_targets
; t
; t
= TREE_CHAIN (t
))
5272 tree alias_decl
= TREE_PURPOSE (t
);
5273 tree target
= ultimate_transparent_alias_target (&TREE_VALUE (t
));
5275 if (! TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (alias_decl
)))
5276 /* Remove alias_decl from the weak list, but leave entries for
5277 the target alone. */
5279 #ifndef ASM_OUTPUT_WEAKREF
5280 else if (! TREE_SYMBOL_REFERENCED (target
))
5282 /* Use ASM_WEAKEN_LABEL only if ASM_WEAKEN_DECL is not
5283 defined, otherwise we and weak_finish_1 would use
5284 different macros. */
5285 # if defined ASM_WEAKEN_LABEL && ! defined ASM_WEAKEN_DECL
5286 ASM_WEAKEN_LABEL (asm_out_file
, IDENTIFIER_POINTER (target
));
5288 tree decl
= find_decl_and_mark_needed (alias_decl
, target
);
5292 decl
= build_decl (DECL_SOURCE_LOCATION (alias_decl
),
5293 TREE_CODE (alias_decl
), target
,
5294 TREE_TYPE (alias_decl
));
5296 DECL_EXTERNAL (decl
) = 1;
5297 TREE_PUBLIC (decl
) = 1;
5298 DECL_ARTIFICIAL (decl
) = 1;
5299 TREE_NOTHROW (decl
) = TREE_NOTHROW (alias_decl
);
5300 TREE_USED (decl
) = 1;
5303 weak_finish_1 (decl
);
5312 /* Remove the alias and the target from the pending weak list
5313 so that we do not emit any .weak directives for the former,
5314 nor multiple .weak directives for the latter. */
5315 for (p
= &weak_decls
; (t2
= *p
) ; )
5317 if (TREE_VALUE (t2
) == alias_decl
5318 || target
== DECL_ASSEMBLER_NAME (TREE_VALUE (t2
)))
5319 *p
= TREE_CHAIN (t2
);
5321 p
= &TREE_CHAIN (t2
);
5324 /* Remove other weakrefs to the same target, to speed things up. */
5325 for (p
= &TREE_CHAIN (t
); (t2
= *p
) ; )
5327 if (target
== ultimate_transparent_alias_target (&TREE_VALUE (t2
)))
5328 *p
= TREE_CHAIN (t2
);
5330 p
= &TREE_CHAIN (t2
);
5335 for (t
= weak_decls
; t
; t
= TREE_CHAIN (t
))
5337 tree decl
= TREE_VALUE (t
);
5339 weak_finish_1 (decl
);
5343 /* Emit the assembly bits to indicate that DECL is globally visible. */
5346 globalize_decl (tree decl
)
5349 #if defined (ASM_WEAKEN_LABEL) || defined (ASM_WEAKEN_DECL)
5350 if (DECL_WEAK (decl
))
5352 const char *name
= XSTR (XEXP (DECL_RTL (decl
), 0), 0);
5355 #ifdef ASM_WEAKEN_DECL
5356 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, 0);
5358 ASM_WEAKEN_LABEL (asm_out_file
, name
);
5361 /* Remove this function from the pending weak list so that
5362 we do not emit multiple .weak directives for it. */
5363 for (p
= &weak_decls
; (t
= *p
) ; )
5365 if (DECL_ASSEMBLER_NAME (decl
) == DECL_ASSEMBLER_NAME (TREE_VALUE (t
)))
5366 *p
= TREE_CHAIN (t
);
5368 p
= &TREE_CHAIN (t
);
5371 /* Remove weakrefs to the same target from the pending weakref
5372 list, for the same reason. */
5373 for (p
= &weakref_targets
; (t
= *p
) ; )
5375 if (DECL_ASSEMBLER_NAME (decl
)
5376 == ultimate_transparent_alias_target (&TREE_VALUE (t
)))
5377 *p
= TREE_CHAIN (t
);
5379 p
= &TREE_CHAIN (t
);
5386 targetm
.asm_out
.globalize_decl_name (asm_out_file
, decl
);
5389 VEC(alias_pair
,gc
) *alias_pairs
;
5391 /* Given an assembly name, find the decl it is associated with. At the
5392 same time, mark it needed for cgraph. */
5395 find_decl_and_mark_needed (tree decl
, tree target
)
5397 struct cgraph_node
*fnode
= NULL
;
5398 struct varpool_node
*vnode
= NULL
;
5400 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5402 fnode
= cgraph_node_for_asm (target
);
5404 vnode
= varpool_node_for_asm (target
);
5408 vnode
= varpool_node_for_asm (target
);
5410 fnode
= cgraph_node_for_asm (target
);
5415 cgraph_mark_needed_node (fnode
);
5420 varpool_mark_needed_node (vnode
);
5421 vnode
->force_output
= 1;
5428 /* Output the assembler code for a define (equate) using ASM_OUTPUT_DEF
5429 or ASM_OUTPUT_DEF_FROM_DECLS. The function defines the symbol whose
5430 tree node is DECL to have the value of the tree node TARGET. */
5433 do_assemble_alias (tree decl
, tree target
)
5435 /* Emulated TLS had better not get this var. */
5436 gcc_assert(!(!targetm
.have_tls
5437 && TREE_CODE (decl
) == VAR_DECL
5438 && DECL_THREAD_LOCAL_P (decl
)));
5440 if (TREE_ASM_WRITTEN (decl
))
5443 /* We must force creation of DECL_RTL for debug info generation, even though
5444 we don't use it here. */
5445 make_decl_rtl (decl
);
5447 TREE_ASM_WRITTEN (decl
) = 1;
5448 TREE_ASM_WRITTEN (DECL_ASSEMBLER_NAME (decl
)) = 1;
5450 if (lookup_attribute ("weakref", DECL_ATTRIBUTES (decl
)))
5452 ultimate_transparent_alias_target (&target
);
5454 if (!TREE_SYMBOL_REFERENCED (target
))
5455 weakref_targets
= tree_cons (decl
, target
, weakref_targets
);
5457 #ifdef ASM_OUTPUT_WEAKREF
5458 ASM_OUTPUT_WEAKREF (asm_out_file
, decl
,
5459 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)),
5460 IDENTIFIER_POINTER (target
));
5462 if (!TARGET_SUPPORTS_WEAK
)
5464 error_at (DECL_SOURCE_LOCATION (decl
),
5465 "weakref is not supported in this configuration");
5472 #ifdef ASM_OUTPUT_DEF
5473 /* Make name accessible from other files, if appropriate. */
5475 if (TREE_PUBLIC (decl
))
5477 globalize_decl (decl
);
5478 maybe_assemble_visibility (decl
);
5480 if (lookup_attribute ("ifunc", DECL_ATTRIBUTES (decl
)))
5482 #if defined (ASM_OUTPUT_TYPE_DIRECTIVE) && HAVE_GNU_INDIRECT_FUNCTION
5483 ASM_OUTPUT_TYPE_DIRECTIVE
5484 (asm_out_file
, IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)),
5487 error_at (DECL_SOURCE_LOCATION (decl
),
5488 "ifunc is not supported in this configuration");
5492 # ifdef ASM_OUTPUT_DEF_FROM_DECLS
5493 ASM_OUTPUT_DEF_FROM_DECLS (asm_out_file
, decl
, target
);
5495 ASM_OUTPUT_DEF (asm_out_file
,
5496 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)),
5497 IDENTIFIER_POINTER (target
));
5499 #elif defined (ASM_OUTPUT_WEAK_ALIAS) || defined (ASM_WEAKEN_DECL)
5504 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
5505 # ifdef ASM_WEAKEN_DECL
5506 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, IDENTIFIER_POINTER (target
));
5508 ASM_OUTPUT_WEAK_ALIAS (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
5510 /* Remove this function from the pending weak list so that
5511 we do not emit multiple .weak directives for it. */
5512 for (p
= &weak_decls
; (t
= *p
) ; )
5513 if (DECL_ASSEMBLER_NAME (decl
) == DECL_ASSEMBLER_NAME (TREE_VALUE (t
)))
5514 *p
= TREE_CHAIN (t
);
5516 p
= &TREE_CHAIN (t
);
5518 /* Remove weakrefs to the same target from the pending weakref
5519 list, for the same reason. */
5520 for (p
= &weakref_targets
; (t
= *p
) ; )
5522 if (DECL_ASSEMBLER_NAME (decl
)
5523 == ultimate_transparent_alias_target (&TREE_VALUE (t
)))
5524 *p
= TREE_CHAIN (t
);
5526 p
= &TREE_CHAIN (t
);
5533 /* Allocate and construct a symbol alias set. */
5535 static symbol_alias_set_t
*
5536 symbol_alias_set_create (void)
5538 return pointer_set_create ();
5541 /* Destruct and free a symbol alias set. */
5544 symbol_alias_set_destroy (symbol_alias_set_t
*aset
)
5546 pointer_set_destroy (aset
);
5549 /* Test if a symbol alias set contains a given name. */
5552 symbol_alias_set_contains (const symbol_alias_set_t
*aset
, tree t
)
5554 /* We accept either a DECL or an IDENTIFIER directly. */
5555 if (TREE_CODE (t
) != IDENTIFIER_NODE
)
5556 t
= DECL_ASSEMBLER_NAME (t
);
5557 t
= targetm
.asm_out
.mangle_assembler_name (IDENTIFIER_POINTER (t
));
5558 return pointer_set_contains (aset
, t
);
5561 /* Enter a new name into a symbol alias set. */
5564 symbol_alias_set_insert (symbol_alias_set_t
*aset
, tree t
)
5566 /* We accept either a DECL or an IDENTIFIER directly. */
5567 if (TREE_CODE (t
) != IDENTIFIER_NODE
)
5568 t
= DECL_ASSEMBLER_NAME (t
);
5569 t
= targetm
.asm_out
.mangle_assembler_name (IDENTIFIER_POINTER (t
));
5570 return pointer_set_insert (aset
, t
);
5573 /* IN_SET_P is a predicate function assuming to be taken
5574 alias_pair->decl, alias_pair->target and DATA arguments.
5576 Compute set of aliases by including everything where TRIVIALLY_VISIBLE
5577 predeicate is true and propagate across aliases such that when
5578 alias DECL is included, its TARGET is included too. */
5580 static symbol_alias_set_t
*
5581 propagate_aliases_forward (bool (*in_set_p
)
5582 (tree decl
, tree target
, void *data
),
5585 symbol_alias_set_t
*set
;
5590 set
= symbol_alias_set_create ();
5591 for (i
= 0; VEC_iterate (alias_pair
, alias_pairs
, i
, p
); ++i
)
5592 if (in_set_p (p
->decl
, p
->target
, data
))
5593 symbol_alias_set_insert (set
, p
->decl
);
5597 for (i
= 0; VEC_iterate (alias_pair
, alias_pairs
, i
, p
); ++i
)
5598 if (symbol_alias_set_contains (set
, p
->decl
)
5599 && !symbol_alias_set_insert (set
, p
->target
))
5607 /* Like propagate_aliases_forward but do backward propagation. */
5609 symbol_alias_set_t
*
5610 propagate_aliases_backward (bool (*in_set_p
)
5611 (tree decl
, tree target
, void *data
),
5614 symbol_alias_set_t
*set
;
5619 /* We have to compute the set of set nodes including aliases
5621 set
= symbol_alias_set_create ();
5622 for (i
= 0; VEC_iterate (alias_pair
, alias_pairs
, i
, p
); ++i
)
5623 if (in_set_p (p
->decl
, p
->target
, data
))
5624 symbol_alias_set_insert (set
, p
->target
);
5628 for (i
= 0; VEC_iterate (alias_pair
, alias_pairs
, i
, p
); ++i
)
5629 if (symbol_alias_set_contains (set
, p
->target
)
5630 && !symbol_alias_set_insert (set
, p
->decl
))
5637 /* See if the alias is trivially visible. This means
5638 1) alias is expoerted from the unit or
5639 2) alias is used in the code.
5640 We assume that unused cgraph/varpool nodes has been
5642 Used as callback for propagate_aliases. */
5645 trivially_visible_alias (tree decl
, tree target ATTRIBUTE_UNUSED
,
5646 void *data ATTRIBUTE_UNUSED
)
5648 struct cgraph_node
*fnode
= NULL
;
5649 struct varpool_node
*vnode
= NULL
;
5651 if (!TREE_PUBLIC (decl
))
5653 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5654 fnode
= cgraph_get_node (decl
);
5656 vnode
= varpool_get_node (decl
);
5657 return vnode
|| fnode
;
5663 /* See if the target of alias is defined in this unit.
5664 Used as callback for propagate_aliases. */
5667 trivially_defined_alias (tree decl ATTRIBUTE_UNUSED
,
5669 void *data ATTRIBUTE_UNUSED
)
5671 struct cgraph_node
*fnode
= NULL
;
5672 struct varpool_node
*vnode
= NULL
;
5674 fnode
= cgraph_node_for_asm (target
);
5675 vnode
= (fnode
== NULL
) ? varpool_node_for_asm (target
) : NULL
;
5676 return (fnode
&& fnode
->analyzed
) || (vnode
&& vnode
->finalized
);
5679 /* Remove the alias pairing for functions that are no longer in the call
5683 remove_unreachable_alias_pairs (void)
5685 symbol_alias_set_t
*visible
;
5689 if (alias_pairs
== NULL
)
5692 /* We have to compute the set of visible nodes including aliases
5694 visible
= propagate_aliases_forward (trivially_visible_alias
, NULL
);
5696 for (i
= 0; VEC_iterate (alias_pair
, alias_pairs
, i
, p
); )
5698 if (!DECL_EXTERNAL (p
->decl
)
5699 && !symbol_alias_set_contains (visible
, p
->decl
))
5701 VEC_unordered_remove (alias_pair
, alias_pairs
, i
);
5708 symbol_alias_set_destroy (visible
);
5712 /* First pass of completing pending aliases. Make sure that cgraph knows
5713 which symbols will be required. */
5716 finish_aliases_1 (void)
5718 symbol_alias_set_t
*defined
;
5722 if (alias_pairs
== NULL
)
5725 /* We have to compute the set of defined nodes including aliases
5727 defined
= propagate_aliases_backward (trivially_defined_alias
, NULL
);
5729 FOR_EACH_VEC_ELT (alias_pair
, alias_pairs
, i
, p
)
5733 target_decl
= find_decl_and_mark_needed (p
->decl
, p
->target
);
5734 if (target_decl
== NULL
)
5736 if (symbol_alias_set_contains (defined
, p
->target
))
5739 if (! (p
->emitted_diags
& ALIAS_DIAG_TO_UNDEF
)
5740 && ! lookup_attribute ("weakref", DECL_ATTRIBUTES (p
->decl
)))
5742 error ("%q+D aliased to undefined symbol %qE",
5743 p
->decl
, p
->target
);
5744 p
->emitted_diags
|= ALIAS_DIAG_TO_UNDEF
;
5747 else if (! (p
->emitted_diags
& ALIAS_DIAG_TO_EXTERN
)
5748 && DECL_EXTERNAL (target_decl
)
5749 /* We use local aliases for C++ thunks to force the tailcall
5750 to bind locally. This is a hack - to keep it working do
5751 the following (which is not strictly correct). */
5752 && (! TREE_CODE (target_decl
) == FUNCTION_DECL
5753 || ! DECL_VIRTUAL_P (target_decl
))
5754 && ! lookup_attribute ("weakref", DECL_ATTRIBUTES (p
->decl
)))
5756 error ("%q+D aliased to external symbol %qE",
5757 p
->decl
, p
->target
);
5758 p
->emitted_diags
|= ALIAS_DIAG_TO_EXTERN
;
5762 symbol_alias_set_destroy (defined
);
5765 /* Second pass of completing pending aliases. Emit the actual assembly.
5766 This happens at the end of compilation and thus it is assured that the
5767 target symbol has been emitted. */
5770 finish_aliases_2 (void)
5775 FOR_EACH_VEC_ELT (alias_pair
, alias_pairs
, i
, p
)
5776 do_assemble_alias (p
->decl
, p
->target
);
5778 VEC_truncate (alias_pair
, alias_pairs
, 0);
5781 /* Emit an assembler directive to make the symbol for DECL an alias to
5782 the symbol for TARGET. */
5785 assemble_alias (tree decl
, tree target
)
5788 bool is_weakref
= false;
5790 if (lookup_attribute ("weakref", DECL_ATTRIBUTES (decl
)))
5792 tree alias
= DECL_ASSEMBLER_NAME (decl
);
5796 ultimate_transparent_alias_target (&target
);
5798 if (alias
== target
)
5799 error ("weakref %q+D ultimately targets itself", decl
);
5802 #ifndef ASM_OUTPUT_WEAKREF
5803 IDENTIFIER_TRANSPARENT_ALIAS (alias
) = 1;
5804 TREE_CHAIN (alias
) = target
;
5807 if (TREE_PUBLIC (decl
))
5808 error ("weakref %q+D must have static linkage", decl
);
5812 #if !defined (ASM_OUTPUT_DEF)
5813 # if !defined(ASM_OUTPUT_WEAK_ALIAS) && !defined (ASM_WEAKEN_DECL)
5814 error_at (DECL_SOURCE_LOCATION (decl
),
5815 "alias definitions not supported in this configuration");
5818 if (!DECL_WEAK (decl
))
5820 if (lookup_attribute ("ifunc", DECL_ATTRIBUTES (decl
)))
5821 error_at (DECL_SOURCE_LOCATION (decl
),
5822 "ifunc is not supported in this configuration");
5824 error_at (DECL_SOURCE_LOCATION (decl
),
5825 "only weak aliases are supported in this configuration");
5831 TREE_USED (decl
) = 1;
5833 /* A quirk of the initial implementation of aliases required that the user
5834 add "extern" to all of them. Which is silly, but now historical. Do
5835 note that the symbol is in fact locally defined. */
5837 DECL_EXTERNAL (decl
) = 0;
5839 /* Allow aliases to aliases. */
5840 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5841 cgraph_get_create_node (decl
)->alias
= true;
5843 varpool_node (decl
)->alias
= true;
5845 /* If the target has already been emitted, we don't have to queue the
5846 alias. This saves a tad of memory. */
5847 if (cgraph_global_info_ready
)
5848 target_decl
= find_decl_and_mark_needed (decl
, target
);
5851 if (target_decl
&& TREE_ASM_WRITTEN (target_decl
))
5852 do_assemble_alias (decl
, target
);
5855 alias_pair
*p
= VEC_safe_push (alias_pair
, gc
, alias_pairs
, NULL
);
5858 p
->emitted_diags
= ALIAS_DIAG_NONE
;
5862 /* Record and output a table of translations from original function
5863 to its transaction aware clone. Note that tm_pure functions are
5864 considered to be their own clone. */
5866 static GTY((if_marked ("tree_map_marked_p"), param_is (struct tree_map
)))
5867 htab_t tm_clone_hash
;
5870 record_tm_clone_pair (tree o
, tree n
)
5872 struct tree_map
**slot
, *h
;
5874 if (tm_clone_hash
== NULL
)
5875 tm_clone_hash
= htab_create_ggc (32, tree_map_hash
, tree_map_eq
, 0);
5877 h
= ggc_alloc_tree_map ();
5878 h
->hash
= htab_hash_pointer (o
);
5882 slot
= (struct tree_map
**)
5883 htab_find_slot_with_hash (tm_clone_hash
, h
, h
->hash
, INSERT
);
5888 get_tm_clone_pair (tree o
)
5892 struct tree_map
*h
, in
;
5895 in
.hash
= htab_hash_pointer (o
);
5896 h
= (struct tree_map
*) htab_find_with_hash (tm_clone_hash
,
5904 typedef struct tm_alias_pair
5911 DEF_VEC_O(tm_alias_pair
);
5912 DEF_VEC_ALLOC_O(tm_alias_pair
,heap
);
5914 /* Helper function for finish_tm_clone_pairs. Dump a hash table entry
5915 into a VEC in INFO. */
5918 dump_tm_clone_to_vec (void **slot
, void *info
)
5920 struct tree_map
*map
= (struct tree_map
*) *slot
;
5921 VEC(tm_alias_pair
,heap
) **tm_alias_pairs
5922 = (VEC(tm_alias_pair
, heap
) **) info
;
5925 p
= VEC_safe_push (tm_alias_pair
, heap
, *tm_alias_pairs
, NULL
);
5926 p
->from
= map
->base
.from
;
5928 p
->uid
= DECL_UID (p
->from
);
5932 /* Dump the actual pairs to the .tm_clone_table section. */
5935 dump_tm_clone_pairs (VEC(tm_alias_pair
,heap
) *tm_alias_pairs
)
5939 bool switched
= false;
5941 FOR_EACH_VEC_ELT (tm_alias_pair
, tm_alias_pairs
, i
, p
)
5945 struct cgraph_node
*src_n
= cgraph_get_node (src
);
5946 struct cgraph_node
*dst_n
= cgraph_get_node (dst
);
5948 /* The function ipa_tm_create_version() marks the clone as needed if
5949 the original function was needed. But we also mark the clone as
5950 needed if we ever called the clone indirectly through
5951 TM_GETTMCLONE. If neither of these are true, we didn't generate
5952 a clone, and we didn't call it indirectly... no sense keeping it
5953 in the clone table. */
5954 if (!dst_n
|| !dst_n
->needed
)
5957 /* This covers the case where we have optimized the original
5958 function away, and only access the transactional clone. */
5959 if (!src_n
|| !src_n
->needed
)
5964 switch_to_section (get_named_section (NULL
, ".tm_clone_table", 3));
5965 assemble_align (POINTER_SIZE
);
5969 assemble_integer (XEXP (DECL_RTL (src
), 0),
5970 POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
5971 assemble_integer (XEXP (DECL_RTL (dst
), 0),
5972 POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
5976 /* Helper comparison function for qsorting by the DECL_UID stored in
5977 alias_pair->emitted_diags. */
5980 tm_alias_pair_cmp (const void *x
, const void *y
)
5982 const tm_alias_pair
*p1
= (const tm_alias_pair
*) x
;
5983 const tm_alias_pair
*p2
= (const tm_alias_pair
*) y
;
5984 if (p1
->uid
< p2
->uid
)
5986 if (p1
->uid
> p2
->uid
)
5992 finish_tm_clone_pairs (void)
5994 VEC(tm_alias_pair
,heap
) *tm_alias_pairs
= NULL
;
5996 if (tm_clone_hash
== NULL
)
5999 /* We need a determenistic order for the .tm_clone_table, otherwise
6000 we will get bootstrap comparison failures, so dump the hash table
6001 to a vector, sort it, and dump the vector. */
6003 /* Dump the hashtable to a vector. */
6004 htab_traverse_noresize (tm_clone_hash
, dump_tm_clone_to_vec
,
6005 (void *) &tm_alias_pairs
);
6007 VEC_qsort (tm_alias_pair
, tm_alias_pairs
, tm_alias_pair_cmp
);
6010 dump_tm_clone_pairs (tm_alias_pairs
);
6012 htab_delete (tm_clone_hash
);
6013 tm_clone_hash
= NULL
;
6014 VEC_free (tm_alias_pair
, heap
, tm_alias_pairs
);
6018 /* Emit an assembler directive to set symbol for DECL visibility to
6019 the visibility type VIS, which must not be VISIBILITY_DEFAULT. */
6022 default_assemble_visibility (tree decl ATTRIBUTE_UNUSED
,
6023 int vis ATTRIBUTE_UNUSED
)
6025 #ifdef HAVE_GAS_HIDDEN
6026 static const char * const visibility_types
[] = {
6027 NULL
, "protected", "hidden", "internal"
6030 const char *name
, *type
;
6032 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
6033 type
= visibility_types
[vis
];
6035 fprintf (asm_out_file
, "\t.%s\t", type
);
6036 assemble_name (asm_out_file
, name
);
6037 fprintf (asm_out_file
, "\n");
6039 warning (OPT_Wattributes
, "visibility attribute not supported "
6040 "in this configuration; ignored");
6044 /* A helper function to call assemble_visibility when needed for a decl. */
6047 maybe_assemble_visibility (tree decl
)
6049 enum symbol_visibility vis
= DECL_VISIBILITY (decl
);
6051 if (vis
!= VISIBILITY_DEFAULT
)
6053 targetm
.asm_out
.assemble_visibility (decl
, vis
);
6060 /* Returns 1 if the target configuration supports defining public symbols
6061 so that one of them will be chosen at link time instead of generating a
6062 multiply-defined symbol error, whether through the use of weak symbols or
6063 a target-specific mechanism for having duplicates discarded. */
6066 supports_one_only (void)
6068 if (SUPPORTS_ONE_ONLY
)
6070 return TARGET_SUPPORTS_WEAK
;
6073 /* Set up DECL as a public symbol that can be defined in multiple
6074 translation units without generating a linker error. */
6077 make_decl_one_only (tree decl
, tree comdat_group
)
6079 gcc_assert (TREE_CODE (decl
) == VAR_DECL
6080 || TREE_CODE (decl
) == FUNCTION_DECL
);
6082 TREE_PUBLIC (decl
) = 1;
6084 if (SUPPORTS_ONE_ONLY
)
6086 #ifdef MAKE_DECL_ONE_ONLY
6087 MAKE_DECL_ONE_ONLY (decl
);
6089 DECL_COMDAT_GROUP (decl
) = comdat_group
;
6091 else if (TREE_CODE (decl
) == VAR_DECL
6092 && (DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
))
6093 DECL_COMMON (decl
) = 1;
6096 gcc_assert (TARGET_SUPPORTS_WEAK
);
6097 DECL_WEAK (decl
) = 1;
6102 init_varasm_once (void)
6104 section_htab
= htab_create_ggc (31, section_entry_hash
,
6105 section_entry_eq
, NULL
);
6106 object_block_htab
= htab_create_ggc (31, object_block_entry_hash
,
6107 object_block_entry_eq
, NULL
);
6108 const_desc_htab
= htab_create_ggc (1009, const_desc_hash
,
6109 const_desc_eq
, NULL
);
6111 const_alias_set
= new_alias_set ();
6112 shared_constant_pool
= create_constant_pool ();
6114 #ifdef TEXT_SECTION_ASM_OP
6115 text_section
= get_unnamed_section (SECTION_CODE
, output_section_asm_op
,
6116 TEXT_SECTION_ASM_OP
);
6119 #ifdef DATA_SECTION_ASM_OP
6120 data_section
= get_unnamed_section (SECTION_WRITE
, output_section_asm_op
,
6121 DATA_SECTION_ASM_OP
);
6124 #ifdef SDATA_SECTION_ASM_OP
6125 sdata_section
= get_unnamed_section (SECTION_WRITE
, output_section_asm_op
,
6126 SDATA_SECTION_ASM_OP
);
6129 #ifdef READONLY_DATA_SECTION_ASM_OP
6130 readonly_data_section
= get_unnamed_section (0, output_section_asm_op
,
6131 READONLY_DATA_SECTION_ASM_OP
);
6134 #ifdef CTORS_SECTION_ASM_OP
6135 ctors_section
= get_unnamed_section (0, output_section_asm_op
,
6136 CTORS_SECTION_ASM_OP
);
6139 #ifdef DTORS_SECTION_ASM_OP
6140 dtors_section
= get_unnamed_section (0, output_section_asm_op
,
6141 DTORS_SECTION_ASM_OP
);
6144 #ifdef BSS_SECTION_ASM_OP
6145 bss_section
= get_unnamed_section (SECTION_WRITE
| SECTION_BSS
,
6146 output_section_asm_op
,
6147 BSS_SECTION_ASM_OP
);
6150 #ifdef SBSS_SECTION_ASM_OP
6151 sbss_section
= get_unnamed_section (SECTION_WRITE
| SECTION_BSS
,
6152 output_section_asm_op
,
6153 SBSS_SECTION_ASM_OP
);
6156 tls_comm_section
= get_noswitch_section (SECTION_WRITE
| SECTION_BSS
6157 | SECTION_COMMON
, emit_tls_common
);
6158 lcomm_section
= get_noswitch_section (SECTION_WRITE
| SECTION_BSS
6159 | SECTION_COMMON
, emit_local
);
6160 comm_section
= get_noswitch_section (SECTION_WRITE
| SECTION_BSS
6161 | SECTION_COMMON
, emit_common
);
6163 #if defined ASM_OUTPUT_ALIGNED_BSS
6164 bss_noswitch_section
= get_noswitch_section (SECTION_WRITE
| SECTION_BSS
,
6168 targetm
.asm_out
.init_sections ();
6170 if (readonly_data_section
== NULL
)
6171 readonly_data_section
= text_section
;
6175 decl_default_tls_model (const_tree decl
)
6177 enum tls_model kind
;
6180 is_local
= targetm
.binds_local_p (decl
);
6184 kind
= TLS_MODEL_LOCAL_EXEC
;
6186 kind
= TLS_MODEL_INITIAL_EXEC
;
6189 /* Local dynamic is inefficient when we're not combining the
6190 parts of the address. */
6191 else if (optimize
&& is_local
)
6192 kind
= TLS_MODEL_LOCAL_DYNAMIC
;
6194 kind
= TLS_MODEL_GLOBAL_DYNAMIC
;
6195 if (kind
< flag_tls_default
)
6196 kind
= flag_tls_default
;
6201 /* Select a set of attributes for section NAME based on the properties
6202 of DECL and whether or not RELOC indicates that DECL's initializer
6203 might contain runtime relocations.
6205 We make the section read-only and executable for a function decl,
6206 read-only for a const data decl, and writable for a non-const data decl. */
6209 default_section_type_flags (tree decl
, const char *name
, int reloc
)
6213 if (decl
&& TREE_CODE (decl
) == FUNCTION_DECL
)
6214 flags
= SECTION_CODE
;
6217 enum section_category category
6218 = categorize_decl_for_section (decl
, reloc
);
6219 if (decl_readonly_section_1 (category
))
6221 else if (category
== SECCAT_DATA_REL_RO
6222 || category
== SECCAT_DATA_REL_RO_LOCAL
)
6223 flags
= SECTION_WRITE
| SECTION_RELRO
;
6225 flags
= SECTION_WRITE
;
6229 flags
= SECTION_WRITE
;
6230 if (strcmp (name
, ".data.rel.ro") == 0
6231 || strcmp (name
, ".data.rel.ro.local") == 0)
6232 flags
|= SECTION_RELRO
;
6235 if (decl
&& DECL_ONE_ONLY (decl
))
6236 flags
|= SECTION_LINKONCE
;
6238 if (decl
&& TREE_CODE (decl
) == VAR_DECL
&& DECL_THREAD_LOCAL_P (decl
))
6239 flags
|= SECTION_TLS
| SECTION_WRITE
;
6241 if (strcmp (name
, ".bss") == 0
6242 || strncmp (name
, ".bss.", 5) == 0
6243 || strncmp (name
, ".gnu.linkonce.b.", 16) == 0
6244 || strcmp (name
, ".sbss") == 0
6245 || strncmp (name
, ".sbss.", 6) == 0
6246 || strncmp (name
, ".gnu.linkonce.sb.", 17) == 0)
6247 flags
|= SECTION_BSS
;
6249 if (strcmp (name
, ".tdata") == 0
6250 || strncmp (name
, ".tdata.", 7) == 0
6251 || strncmp (name
, ".gnu.linkonce.td.", 17) == 0)
6252 flags
|= SECTION_TLS
;
6254 if (strcmp (name
, ".tbss") == 0
6255 || strncmp (name
, ".tbss.", 6) == 0
6256 || strncmp (name
, ".gnu.linkonce.tb.", 17) == 0)
6257 flags
|= SECTION_TLS
| SECTION_BSS
;
6259 /* These three sections have special ELF types. They are neither
6260 SHT_PROGBITS nor SHT_NOBITS, so when changing sections we don't
6261 want to print a section type (@progbits or @nobits). If someone
6262 is silly enough to emit code or TLS variables to one of these
6263 sections, then don't handle them specially. */
6264 if (!(flags
& (SECTION_CODE
| SECTION_BSS
| SECTION_TLS
))
6265 && (strcmp (name
, ".init_array") == 0
6266 || strcmp (name
, ".fini_array") == 0
6267 || strcmp (name
, ".preinit_array") == 0))
6268 flags
|= SECTION_NOTYPE
;
6273 /* Return true if the target supports some form of global BSS,
6274 either through bss_noswitch_section, or by selecting a BSS
6275 section in TARGET_ASM_SELECT_SECTION. */
6278 have_global_bss_p (void)
6280 return bss_noswitch_section
|| targetm
.have_switchable_bss_sections
;
6283 /* Output assembly to switch to section NAME with attribute FLAGS.
6284 Four variants for common object file formats. */
6287 default_no_named_section (const char *name ATTRIBUTE_UNUSED
,
6288 unsigned int flags ATTRIBUTE_UNUSED
,
6289 tree decl ATTRIBUTE_UNUSED
)
6291 /* Some object formats don't support named sections at all. The
6292 front-end should already have flagged this as an error. */
6296 #ifndef TLS_SECTION_ASM_FLAG
6297 #define TLS_SECTION_ASM_FLAG 'T'
6301 default_elf_asm_named_section (const char *name
, unsigned int flags
,
6302 tree decl ATTRIBUTE_UNUSED
)
6304 char flagchars
[10], *f
= flagchars
;
6306 /* If we have already declared this section, we can use an
6307 abbreviated form to switch back to it -- unless this section is
6308 part of a COMDAT groups, in which case GAS requires the full
6309 declaration every time. */
6310 if (!(HAVE_COMDAT_GROUP
&& (flags
& SECTION_LINKONCE
))
6311 && (flags
& SECTION_DECLARED
))
6313 fprintf (asm_out_file
, "\t.section\t%s\n", name
);
6317 if (!(flags
& SECTION_DEBUG
))
6319 if (flags
& SECTION_EXCLUDE
)
6321 if (flags
& SECTION_WRITE
)
6323 if (flags
& SECTION_CODE
)
6325 if (flags
& SECTION_SMALL
)
6327 if (flags
& SECTION_MERGE
)
6329 if (flags
& SECTION_STRINGS
)
6331 if (flags
& SECTION_TLS
)
6332 *f
++ = TLS_SECTION_ASM_FLAG
;
6333 if (HAVE_COMDAT_GROUP
&& (flags
& SECTION_LINKONCE
))
6337 fprintf (asm_out_file
, "\t.section\t%s,\"%s\"", name
, flagchars
);
6339 if (!(flags
& SECTION_NOTYPE
))
6344 if (flags
& SECTION_BSS
)
6350 /* On platforms that use "@" as the assembly comment character,
6352 if (strcmp (ASM_COMMENT_START
, "@") == 0)
6354 fprintf (asm_out_file
, format
, type
);
6356 if (flags
& SECTION_ENTSIZE
)
6357 fprintf (asm_out_file
, ",%d", flags
& SECTION_ENTSIZE
);
6358 if (HAVE_COMDAT_GROUP
&& (flags
& SECTION_LINKONCE
))
6360 if (TREE_CODE (decl
) == IDENTIFIER_NODE
)
6361 fprintf (asm_out_file
, ",%s,comdat", IDENTIFIER_POINTER (decl
));
6363 fprintf (asm_out_file
, ",%s,comdat",
6364 IDENTIFIER_POINTER (DECL_COMDAT_GROUP (decl
)));
6368 putc ('\n', asm_out_file
);
6372 default_coff_asm_named_section (const char *name
, unsigned int flags
,
6373 tree decl ATTRIBUTE_UNUSED
)
6375 char flagchars
[8], *f
= flagchars
;
6377 if (flags
& SECTION_WRITE
)
6379 if (flags
& SECTION_CODE
)
6383 fprintf (asm_out_file
, "\t.section\t%s,\"%s\"\n", name
, flagchars
);
6387 default_pe_asm_named_section (const char *name
, unsigned int flags
,
6390 default_coff_asm_named_section (name
, flags
, decl
);
6392 if (flags
& SECTION_LINKONCE
)
6394 /* Functions may have been compiled at various levels of
6395 optimization so we can't use `same_size' here.
6396 Instead, have the linker pick one. */
6397 fprintf (asm_out_file
, "\t.linkonce %s\n",
6398 (flags
& SECTION_CODE
? "discard" : "same_size"));
6402 /* The lame default section selector. */
6405 default_select_section (tree decl
, int reloc
,
6406 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
)
6410 if (decl_readonly_section (decl
, reloc
))
6411 return readonly_data_section
;
6413 else if (TREE_CODE (decl
) == CONSTRUCTOR
)
6415 if (! ((flag_pic
&& reloc
)
6416 || !TREE_READONLY (decl
)
6417 || TREE_SIDE_EFFECTS (decl
)
6418 || !TREE_CONSTANT (decl
)))
6419 return readonly_data_section
;
6421 else if (TREE_CODE (decl
) == STRING_CST
)
6422 return readonly_data_section
;
6423 else if (! (flag_pic
&& reloc
))
6424 return readonly_data_section
;
6426 return data_section
;
6429 enum section_category
6430 categorize_decl_for_section (const_tree decl
, int reloc
)
6432 enum section_category ret
;
6434 if (TREE_CODE (decl
) == FUNCTION_DECL
)
6436 else if (TREE_CODE (decl
) == STRING_CST
)
6438 if (flag_mudflap
) /* or !flag_merge_constants */
6439 return SECCAT_RODATA
;
6441 return SECCAT_RODATA_MERGE_STR
;
6443 else if (TREE_CODE (decl
) == VAR_DECL
)
6445 if (bss_initializer_p (decl
))
6447 else if (! TREE_READONLY (decl
)
6448 || TREE_SIDE_EFFECTS (decl
)
6449 || ! TREE_CONSTANT (DECL_INITIAL (decl
)))
6451 /* Here the reloc_rw_mask is not testing whether the section should
6452 be read-only or not, but whether the dynamic link will have to
6453 do something. If so, we wish to segregate the data in order to
6454 minimize cache misses inside the dynamic linker. */
6455 if (reloc
& targetm
.asm_out
.reloc_rw_mask ())
6456 ret
= reloc
== 1 ? SECCAT_DATA_REL_LOCAL
: SECCAT_DATA_REL
;
6460 else if (reloc
& targetm
.asm_out
.reloc_rw_mask ())
6461 ret
= reloc
== 1 ? SECCAT_DATA_REL_RO_LOCAL
: SECCAT_DATA_REL_RO
;
6462 else if (reloc
|| flag_merge_constants
< 2)
6463 /* C and C++ don't allow different variables to share the same
6464 location. -fmerge-all-constants allows even that (at the
6465 expense of not conforming). */
6466 ret
= SECCAT_RODATA
;
6467 else if (TREE_CODE (DECL_INITIAL (decl
)) == STRING_CST
)
6468 ret
= SECCAT_RODATA_MERGE_STR_INIT
;
6470 ret
= SECCAT_RODATA_MERGE_CONST
;
6472 else if (TREE_CODE (decl
) == CONSTRUCTOR
)
6474 if ((reloc
& targetm
.asm_out
.reloc_rw_mask ())
6475 || TREE_SIDE_EFFECTS (decl
)
6476 || ! TREE_CONSTANT (decl
))
6479 ret
= SECCAT_RODATA
;
6482 ret
= SECCAT_RODATA
;
6484 /* There are no read-only thread-local sections. */
6485 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_THREAD_LOCAL_P (decl
))
6487 /* Note that this would be *just* SECCAT_BSS, except that there's
6488 no concept of a read-only thread-local-data section. */
6489 if (ret
== SECCAT_BSS
6490 || (flag_zero_initialized_in_bss
6491 && initializer_zerop (DECL_INITIAL (decl
))))
6497 /* If the target uses small data sections, select it. */
6498 else if (targetm
.in_small_data_p (decl
))
6500 if (ret
== SECCAT_BSS
)
6502 else if (targetm
.have_srodata_section
&& ret
== SECCAT_RODATA
)
6503 ret
= SECCAT_SRODATA
;
6512 decl_readonly_section_1 (enum section_category category
)
6517 case SECCAT_RODATA_MERGE_STR
:
6518 case SECCAT_RODATA_MERGE_STR_INIT
:
6519 case SECCAT_RODATA_MERGE_CONST
:
6520 case SECCAT_SRODATA
:
6528 decl_readonly_section (const_tree decl
, int reloc
)
6530 return decl_readonly_section_1 (categorize_decl_for_section (decl
, reloc
));
6533 /* Select a section based on the above categorization. */
6536 default_elf_select_section (tree decl
, int reloc
,
6537 unsigned HOST_WIDE_INT align
)
6540 switch (categorize_decl_for_section (decl
, reloc
))
6543 /* We're not supposed to be called on FUNCTION_DECLs. */
6546 return readonly_data_section
;
6547 case SECCAT_RODATA_MERGE_STR
:
6548 return mergeable_string_section (decl
, align
, 0);
6549 case SECCAT_RODATA_MERGE_STR_INIT
:
6550 return mergeable_string_section (DECL_INITIAL (decl
), align
, 0);
6551 case SECCAT_RODATA_MERGE_CONST
:
6552 return mergeable_constant_section (DECL_MODE (decl
), align
, 0);
6553 case SECCAT_SRODATA
:
6557 return data_section
;
6558 case SECCAT_DATA_REL
:
6559 sname
= ".data.rel";
6561 case SECCAT_DATA_REL_LOCAL
:
6562 sname
= ".data.rel.local";
6564 case SECCAT_DATA_REL_RO
:
6565 sname
= ".data.rel.ro";
6567 case SECCAT_DATA_REL_RO_LOCAL
:
6568 sname
= ".data.rel.ro.local";
6593 return get_named_section (decl
, sname
, reloc
);
6596 /* Construct a unique section name based on the decl name and the
6597 categorization performed above. */
6600 default_unique_section (tree decl
, int reloc
)
6602 /* We only need to use .gnu.linkonce if we don't have COMDAT groups. */
6603 bool one_only
= DECL_ONE_ONLY (decl
) && !HAVE_COMDAT_GROUP
;
6604 const char *prefix
, *name
, *linkonce
;
6607 switch (categorize_decl_for_section (decl
, reloc
))
6610 prefix
= one_only
? ".t" : ".text";
6613 case SECCAT_RODATA_MERGE_STR
:
6614 case SECCAT_RODATA_MERGE_STR_INIT
:
6615 case SECCAT_RODATA_MERGE_CONST
:
6616 prefix
= one_only
? ".r" : ".rodata";
6618 case SECCAT_SRODATA
:
6619 prefix
= one_only
? ".s2" : ".sdata2";
6622 prefix
= one_only
? ".d" : ".data";
6624 case SECCAT_DATA_REL
:
6625 prefix
= one_only
? ".d.rel" : ".data.rel";
6627 case SECCAT_DATA_REL_LOCAL
:
6628 prefix
= one_only
? ".d.rel.local" : ".data.rel.local";
6630 case SECCAT_DATA_REL_RO
:
6631 prefix
= one_only
? ".d.rel.ro" : ".data.rel.ro";
6633 case SECCAT_DATA_REL_RO_LOCAL
:
6634 prefix
= one_only
? ".d.rel.ro.local" : ".data.rel.ro.local";
6637 prefix
= one_only
? ".s" : ".sdata";
6640 prefix
= one_only
? ".b" : ".bss";
6643 prefix
= one_only
? ".sb" : ".sbss";
6646 prefix
= one_only
? ".td" : ".tdata";
6649 prefix
= one_only
? ".tb" : ".tbss";
6655 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
6656 name
= targetm
.strip_name_encoding (name
);
6658 /* If we're using one_only, then there needs to be a .gnu.linkonce
6659 prefix to the section name. */
6660 linkonce
= one_only
? ".gnu.linkonce" : "";
6662 string
= ACONCAT ((linkonce
, prefix
, ".", name
, NULL
));
6664 DECL_SECTION_NAME (decl
) = build_string (strlen (string
), string
);
6667 /* Like compute_reloc_for_constant, except for an RTX. The return value
6668 is a mask for which bit 1 indicates a global relocation, and bit 0
6669 indicates a local relocation. */
6672 compute_reloc_for_rtx_1 (rtx
*xp
, void *data
)
6674 int *preloc
= (int *) data
;
6677 switch (GET_CODE (x
))
6680 *preloc
|= SYMBOL_REF_LOCAL_P (x
) ? 1 : 2;
6693 compute_reloc_for_rtx (rtx x
)
6697 switch (GET_CODE (x
))
6703 for_each_rtx (&x
, compute_reloc_for_rtx_1
, &reloc
);
6712 default_select_rtx_section (enum machine_mode mode ATTRIBUTE_UNUSED
,
6714 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
)
6716 if (compute_reloc_for_rtx (x
) & targetm
.asm_out
.reloc_rw_mask ())
6717 return data_section
;
6719 return readonly_data_section
;
6723 default_elf_select_rtx_section (enum machine_mode mode
, rtx x
,
6724 unsigned HOST_WIDE_INT align
)
6726 int reloc
= compute_reloc_for_rtx (x
);
6728 /* ??? Handle small data here somehow. */
6730 if (reloc
& targetm
.asm_out
.reloc_rw_mask ())
6733 return get_named_section (NULL
, ".data.rel.ro.local", 1);
6735 return get_named_section (NULL
, ".data.rel.ro", 3);
6738 return mergeable_constant_section (mode
, align
, 0);
6741 /* Set the generally applicable flags on the SYMBOL_REF for EXP. */
6744 default_encode_section_info (tree decl
, rtx rtl
, int first ATTRIBUTE_UNUSED
)
6749 /* Careful not to prod global register variables. */
6752 symbol
= XEXP (rtl
, 0);
6753 if (GET_CODE (symbol
) != SYMBOL_REF
)
6756 flags
= SYMBOL_REF_FLAGS (symbol
) & SYMBOL_FLAG_HAS_BLOCK_INFO
;
6757 if (TREE_CODE (decl
) == FUNCTION_DECL
)
6758 flags
|= SYMBOL_FLAG_FUNCTION
;
6759 if (targetm
.binds_local_p (decl
))
6760 flags
|= SYMBOL_FLAG_LOCAL
;
6761 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_THREAD_LOCAL_P (decl
))
6762 flags
|= DECL_TLS_MODEL (decl
) << SYMBOL_FLAG_TLS_SHIFT
;
6763 else if (targetm
.in_small_data_p (decl
))
6764 flags
|= SYMBOL_FLAG_SMALL
;
6765 /* ??? Why is DECL_EXTERNAL ever set for non-PUBLIC names? Without
6766 being PUBLIC, the thing *must* be defined in this translation unit.
6767 Prevent this buglet from being propagated into rtl code as well. */
6768 if (DECL_P (decl
) && DECL_EXTERNAL (decl
) && TREE_PUBLIC (decl
))
6769 flags
|= SYMBOL_FLAG_EXTERNAL
;
6771 SYMBOL_REF_FLAGS (symbol
) = flags
;
6774 /* By default, we do nothing for encode_section_info, so we need not
6775 do anything but discard the '*' marker. */
6778 default_strip_name_encoding (const char *str
)
6780 return str
+ (*str
== '*');
6783 #ifdef ASM_OUTPUT_DEF
6784 /* The default implementation of TARGET_ASM_OUTPUT_ANCHOR. Define the
6785 anchor relative to ".", the current section position. */
6788 default_asm_output_anchor (rtx symbol
)
6792 sprintf (buffer
, "*. + " HOST_WIDE_INT_PRINT_DEC
,
6793 SYMBOL_REF_BLOCK_OFFSET (symbol
));
6794 ASM_OUTPUT_DEF (asm_out_file
, XSTR (symbol
, 0), buffer
);
6798 /* The default implementation of TARGET_USE_ANCHORS_FOR_SYMBOL_P. */
6801 default_use_anchors_for_symbol_p (const_rtx symbol
)
6806 /* Don't use anchors for mergeable sections. The linker might move
6807 the objects around. */
6808 sect
= SYMBOL_REF_BLOCK (symbol
)->sect
;
6809 if (sect
->common
.flags
& SECTION_MERGE
)
6812 /* Don't use anchors for small data sections. The small data register
6813 acts as an anchor for such sections. */
6814 if (sect
->common
.flags
& SECTION_SMALL
)
6817 decl
= SYMBOL_REF_DECL (symbol
);
6818 if (decl
&& DECL_P (decl
))
6820 /* Don't use section anchors for decls that might be defined by
6822 if (!targetm
.binds_local_p (decl
))
6825 /* Don't use section anchors for decls that will be placed in a
6826 small data section. */
6827 /* ??? Ideally, this check would be redundant with the SECTION_SMALL
6828 one above. The problem is that we only use SECTION_SMALL for
6829 sections that should be marked as small in the section directive. */
6830 if (targetm
.in_small_data_p (decl
))
6836 /* Return true when RESOLUTION indicate that symbol will be bound to the
6837 definition provided by current .o file. */
6840 resolution_to_local_definition_p (enum ld_plugin_symbol_resolution resolution
)
6842 return (resolution
== LDPR_PREVAILING_DEF
6843 || resolution
== LDPR_PREVAILING_DEF_IRONLY_EXP
6844 || resolution
== LDPR_PREVAILING_DEF_IRONLY
);
6847 /* Return true when RESOLUTION indicate that symbol will be bound locally
6848 within current executable or DSO. */
6851 resolution_local_p (enum ld_plugin_symbol_resolution resolution
)
6853 return (resolution
== LDPR_PREVAILING_DEF
6854 || resolution
== LDPR_PREVAILING_DEF_IRONLY
6855 || resolution
== LDPR_PREVAILING_DEF_IRONLY_EXP
6856 || resolution
== LDPR_PREEMPTED_REG
6857 || resolution
== LDPR_PREEMPTED_IR
6858 || resolution
== LDPR_RESOLVED_IR
6859 || resolution
== LDPR_RESOLVED_EXEC
);
6862 /* Assume ELF-ish defaults, since that's pretty much the most liberal
6863 wrt cross-module name binding. */
6866 default_binds_local_p (const_tree exp
)
6868 return default_binds_local_p_1 (exp
, flag_shlib
);
6872 default_binds_local_p_1 (const_tree exp
, int shlib
)
6875 bool resolved_locally
= false;
6876 bool resolved_to_local_def
= false;
6878 /* With resolution file in hands, take look into resolutions.
6879 We can't just return true for resolved_locally symbols,
6880 because dynamic linking might overwrite symbols
6881 in shared libraries. */
6882 if (TREE_CODE (exp
) == VAR_DECL
&& TREE_PUBLIC (exp
)
6883 && (TREE_STATIC (exp
) || DECL_EXTERNAL (exp
)))
6885 struct varpool_node
*vnode
= varpool_get_node (exp
);
6886 if (vnode
&& resolution_local_p (vnode
->resolution
))
6887 resolved_locally
= true;
6889 && resolution_to_local_definition_p (vnode
->resolution
))
6890 resolved_to_local_def
= true;
6892 else if (TREE_CODE (exp
) == FUNCTION_DECL
&& TREE_PUBLIC (exp
))
6894 struct cgraph_node
*node
= cgraph_get_node (exp
);
6896 && resolution_local_p (node
->resolution
))
6897 resolved_locally
= true;
6899 && resolution_to_local_definition_p (node
->resolution
))
6900 resolved_to_local_def
= true;
6903 /* A non-decl is an entry in the constant pool. */
6906 /* Weakrefs may not bind locally, even though the weakref itself is
6907 always static and therefore local.
6908 FIXME: We can resolve this more curefuly by looking at the weakref
6910 else if (lookup_attribute ("weakref", DECL_ATTRIBUTES (exp
)))
6912 /* Static variables are always local. */
6913 else if (! TREE_PUBLIC (exp
))
6915 /* A variable is local if the user has said explicitly that it will
6917 else if ((DECL_VISIBILITY_SPECIFIED (exp
)
6918 || resolved_to_local_def
)
6919 && DECL_VISIBILITY (exp
) != VISIBILITY_DEFAULT
)
6921 /* Variables defined outside this object might not be local. */
6922 else if (DECL_EXTERNAL (exp
) && !resolved_locally
)
6924 /* If defined in this object and visibility is not default, must be
6926 else if (DECL_VISIBILITY (exp
) != VISIBILITY_DEFAULT
)
6928 /* Default visibility weak data can be overridden by a strong symbol
6929 in another module and so are not local. */
6930 else if (DECL_WEAK (exp
)
6931 && !resolved_locally
)
6933 /* If PIC, then assume that any global name can be overridden by
6934 symbols resolved from other modules. */
6937 /* Uninitialized COMMON variable may be unified with symbols
6938 resolved from other modules. */
6939 else if (DECL_COMMON (exp
)
6940 && !resolved_locally
6941 && (DECL_INITIAL (exp
) == NULL
6942 || DECL_INITIAL (exp
) == error_mark_node
))
6944 /* Otherwise we're left with initialized (or non-common) global data
6945 which is of necessity defined locally. */
6952 /* Return true when references to DECL must bind to current definition in
6955 The condition is usually equivalent to whether the function binds to the
6956 current module (shared library or executable), that is to binds_local_p.
6957 We use this fact to avoid need for another target hook and implement
6958 the logic using binds_local_p and just special cases where
6959 decl_binds_to_current_def_p is stronger than binds_local_p. In particular
6960 the weak definitions (that can be overwritten at linktime by other
6961 definition from different object file) and when resolution info is available
6962 we simply use the knowledge passed to us by linker plugin. */
6964 decl_binds_to_current_def_p (tree decl
)
6966 gcc_assert (DECL_P (decl
));
6967 if (!TREE_PUBLIC (decl
))
6969 if (!targetm
.binds_local_p (decl
))
6971 /* When resolution is available, just use it. */
6972 if (TREE_CODE (decl
) == VAR_DECL
6973 && (TREE_STATIC (decl
) || DECL_EXTERNAL (decl
)))
6975 struct varpool_node
*vnode
= varpool_get_node (decl
);
6977 && vnode
->resolution
!= LDPR_UNKNOWN
)
6978 return resolution_to_local_definition_p (vnode
->resolution
);
6980 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
6982 struct cgraph_node
*node
= cgraph_get_node (decl
);
6984 && node
->resolution
!= LDPR_UNKNOWN
)
6985 return resolution_to_local_definition_p (node
->resolution
);
6987 /* Otherwise we have to assume the worst for DECL_WEAK (hidden weaks
6988 binds locally but still can be overwritten).
6989 This rely on fact that binds_local_p behave as decl_replaceable_p
6990 for all other declaration types. */
6991 return !DECL_WEAK (decl
);
6994 /* A replaceable function or variable is one which may be replaced
6995 at link-time with an entirely different definition, provided that the
6996 replacement has the same type. For example, functions declared
6997 with __attribute__((weak)) on most systems are replaceable.
6999 COMDAT functions are not replaceable, since all definitions of the
7000 function must be equivalent. It is important that COMDAT functions
7001 not be treated as replaceable so that use of C++ template
7002 instantiations is not penalized. */
7005 decl_replaceable_p (tree decl
)
7007 gcc_assert (DECL_P (decl
));
7008 if (!TREE_PUBLIC (decl
) || DECL_COMDAT (decl
))
7010 return !decl_binds_to_current_def_p (decl
);
7013 /* Default function to output code that will globalize a label. A
7014 target must define GLOBAL_ASM_OP or provide its own function to
7015 globalize a label. */
7016 #ifdef GLOBAL_ASM_OP
7018 default_globalize_label (FILE * stream
, const char *name
)
7020 fputs (GLOBAL_ASM_OP
, stream
);
7021 assemble_name (stream
, name
);
7022 putc ('\n', stream
);
7024 #endif /* GLOBAL_ASM_OP */
7026 /* Default function to output code that will globalize a declaration. */
7028 default_globalize_decl_name (FILE * stream
, tree decl
)
7030 const char *name
= XSTR (XEXP (DECL_RTL (decl
), 0), 0);
7031 targetm
.asm_out
.globalize_label (stream
, name
);
7034 /* Default function to output a label for unwind information. The
7035 default is to do nothing. A target that needs nonlocal labels for
7036 unwind information must provide its own function to do this. */
7038 default_emit_unwind_label (FILE * stream ATTRIBUTE_UNUSED
,
7039 tree decl ATTRIBUTE_UNUSED
,
7040 int for_eh ATTRIBUTE_UNUSED
,
7041 int empty ATTRIBUTE_UNUSED
)
7045 /* Default function to output a label to divide up the exception table.
7046 The default is to do nothing. A target that needs/wants to divide
7047 up the table must provide it's own function to do this. */
7049 default_emit_except_table_label (FILE * stream ATTRIBUTE_UNUSED
)
7053 /* This is how to output an internal numbered label where PREFIX is
7054 the class of label and LABELNO is the number within the class. */
7057 default_generate_internal_label (char *buf
, const char *prefix
,
7058 unsigned long labelno
)
7060 ASM_GENERATE_INTERNAL_LABEL (buf
, prefix
, labelno
);
7063 /* This is how to output an internal numbered label where PREFIX is
7064 the class of label and LABELNO is the number within the class. */
7067 default_internal_label (FILE *stream
, const char *prefix
,
7068 unsigned long labelno
)
7070 char *const buf
= (char *) alloca (40 + strlen (prefix
));
7071 ASM_GENERATE_INTERNAL_LABEL (buf
, prefix
, labelno
);
7072 ASM_OUTPUT_INTERNAL_LABEL (stream
, buf
);
7076 /* The default implementation of ASM_DECLARE_CONSTANT_NAME. */
7079 default_asm_declare_constant_name (FILE *file
, const char *name
,
7080 const_tree exp ATTRIBUTE_UNUSED
,
7081 HOST_WIDE_INT size ATTRIBUTE_UNUSED
)
7083 assemble_label (file
, name
);
7086 /* This is the default behavior at the beginning of a file. It's
7087 controlled by two other target-hook toggles. */
7089 default_file_start (void)
7091 if (targetm
.asm_file_start_app_off
7092 && !(flag_verbose_asm
|| flag_debug_asm
|| flag_dump_rtl_in_asm
))
7093 fputs (ASM_APP_OFF
, asm_out_file
);
7095 if (targetm
.asm_file_start_file_directive
)
7096 output_file_directive (asm_out_file
, main_input_filename
);
7099 /* This is a generic routine suitable for use as TARGET_ASM_FILE_END
7100 which emits a special section directive used to indicate whether or
7101 not this object file needs an executable stack. This is primarily
7102 a GNU extension to ELF but could be used on other targets. */
7104 int trampolines_created
;
7107 file_end_indicate_exec_stack (void)
7109 unsigned int flags
= SECTION_DEBUG
;
7110 if (trampolines_created
)
7111 flags
|= SECTION_CODE
;
7113 switch_to_section (get_section (".note.GNU-stack", flags
, NULL
));
7116 /* Emit a special section directive to indicate that this object file
7117 was compiled with -fsplit-stack. This is used to let the linker
7118 detect calls between split-stack code and non-split-stack code, so
7119 that it can modify the split-stack code to allocate a sufficiently
7120 large stack. We emit another special section if there are any
7121 functions in this file which have the no_split_stack attribute, to
7122 prevent the linker from warning about being unable to convert the
7123 functions if they call non-split-stack code. */
7126 file_end_indicate_split_stack (void)
7128 if (flag_split_stack
)
7130 switch_to_section (get_section (".note.GNU-split-stack", SECTION_DEBUG
,
7132 if (saw_no_split_stack
)
7133 switch_to_section (get_section (".note.GNU-no-split-stack",
7134 SECTION_DEBUG
, NULL
));
7138 /* Output DIRECTIVE (a C string) followed by a newline. This is used as
7139 a get_unnamed_section callback. */
7142 output_section_asm_op (const void *directive
)
7144 fprintf (asm_out_file
, "%s\n", (const char *) directive
);
7147 /* Emit assembly code to switch to section NEW_SECTION. Do nothing if
7148 the current section is NEW_SECTION. */
7151 switch_to_section (section
*new_section
)
7153 if (in_section
== new_section
)
7156 if (new_section
->common
.flags
& SECTION_FORGET
)
7159 in_section
= new_section
;
7161 switch (SECTION_STYLE (new_section
))
7164 targetm
.asm_out
.named_section (new_section
->named
.name
,
7165 new_section
->named
.common
.flags
,
7166 new_section
->named
.decl
);
7169 case SECTION_UNNAMED
:
7170 new_section
->unnamed
.callback (new_section
->unnamed
.data
);
7173 case SECTION_NOSWITCH
:
7178 new_section
->common
.flags
|= SECTION_DECLARED
;
7181 /* If block symbol SYMBOL has not yet been assigned an offset, place
7182 it at the end of its block. */
7185 place_block_symbol (rtx symbol
)
7187 unsigned HOST_WIDE_INT size
, mask
, offset
;
7188 struct constant_descriptor_rtx
*desc
;
7189 unsigned int alignment
;
7190 struct object_block
*block
;
7193 gcc_assert (SYMBOL_REF_BLOCK (symbol
));
7194 if (SYMBOL_REF_BLOCK_OFFSET (symbol
) >= 0)
7197 /* Work out the symbol's size and alignment. */
7198 if (CONSTANT_POOL_ADDRESS_P (symbol
))
7200 desc
= SYMBOL_REF_CONSTANT (symbol
);
7201 alignment
= desc
->align
;
7202 size
= GET_MODE_SIZE (desc
->mode
);
7204 else if (TREE_CONSTANT_POOL_ADDRESS_P (symbol
))
7206 decl
= SYMBOL_REF_DECL (symbol
);
7207 alignment
= DECL_ALIGN (decl
);
7208 size
= get_constant_size (DECL_INITIAL (decl
));
7212 decl
= SYMBOL_REF_DECL (symbol
);
7213 alignment
= DECL_ALIGN (decl
);
7214 size
= tree_low_cst (DECL_SIZE_UNIT (decl
), 1);
7217 /* Calculate the object's offset from the start of the block. */
7218 block
= SYMBOL_REF_BLOCK (symbol
);
7219 mask
= alignment
/ BITS_PER_UNIT
- 1;
7220 offset
= (block
->size
+ mask
) & ~mask
;
7221 SYMBOL_REF_BLOCK_OFFSET (symbol
) = offset
;
7223 /* Record the block's new alignment and size. */
7224 block
->alignment
= MAX (block
->alignment
, alignment
);
7225 block
->size
= offset
+ size
;
7227 VEC_safe_push (rtx
, gc
, block
->objects
, symbol
);
7230 /* Return the anchor that should be used to address byte offset OFFSET
7231 from the first object in BLOCK. MODEL is the TLS model used
7235 get_section_anchor (struct object_block
*block
, HOST_WIDE_INT offset
,
7236 enum tls_model model
)
7239 unsigned int begin
, middle
, end
;
7240 unsigned HOST_WIDE_INT min_offset
, max_offset
, range
, bias
, delta
;
7243 /* Work out the anchor's offset. Use an offset of 0 for the first
7244 anchor so that we don't pessimize the case where we take the address
7245 of a variable at the beginning of the block. This is particularly
7246 useful when a block has only one variable assigned to it.
7248 We try to place anchors RANGE bytes apart, so there can then be
7249 anchors at +/-RANGE, +/-2 * RANGE, and so on, up to the limits of
7250 a ptr_mode offset. With some target settings, the lowest such
7251 anchor might be out of range for the lowest ptr_mode offset;
7252 likewise the highest anchor for the highest offset. Use anchors
7253 at the extreme ends of the ptr_mode range in such cases.
7255 All arithmetic uses unsigned integers in order to avoid
7257 max_offset
= (unsigned HOST_WIDE_INT
) targetm
.max_anchor_offset
;
7258 min_offset
= (unsigned HOST_WIDE_INT
) targetm
.min_anchor_offset
;
7259 range
= max_offset
- min_offset
+ 1;
7264 bias
= 1 << (GET_MODE_BITSIZE (ptr_mode
) - 1);
7267 delta
= -(unsigned HOST_WIDE_INT
) offset
+ max_offset
;
7268 delta
-= delta
% range
;
7271 offset
= (HOST_WIDE_INT
) (-delta
);
7275 delta
= (unsigned HOST_WIDE_INT
) offset
- min_offset
;
7276 delta
-= delta
% range
;
7277 if (delta
> bias
- 1)
7279 offset
= (HOST_WIDE_INT
) delta
;
7283 /* Do a binary search to see if there's already an anchor we can use.
7284 Set BEGIN to the new anchor's index if not. */
7286 end
= VEC_length (rtx
, block
->anchors
);
7287 while (begin
!= end
)
7289 middle
= (end
+ begin
) / 2;
7290 anchor
= VEC_index (rtx
, block
->anchors
, middle
);
7291 if (SYMBOL_REF_BLOCK_OFFSET (anchor
) > offset
)
7293 else if (SYMBOL_REF_BLOCK_OFFSET (anchor
) < offset
)
7295 else if (SYMBOL_REF_TLS_MODEL (anchor
) > model
)
7297 else if (SYMBOL_REF_TLS_MODEL (anchor
) < model
)
7303 /* Create a new anchor with a unique label. */
7304 ASM_GENERATE_INTERNAL_LABEL (label
, "LANCHOR", anchor_labelno
++);
7305 anchor
= create_block_symbol (ggc_strdup (label
), block
, offset
);
7306 SYMBOL_REF_FLAGS (anchor
) |= SYMBOL_FLAG_LOCAL
| SYMBOL_FLAG_ANCHOR
;
7307 SYMBOL_REF_FLAGS (anchor
) |= model
<< SYMBOL_FLAG_TLS_SHIFT
;
7309 /* Insert it at index BEGIN. */
7310 VEC_safe_insert (rtx
, gc
, block
->anchors
, begin
, anchor
);
7314 /* Output the objects in BLOCK. */
7317 output_object_block (struct object_block
*block
)
7319 struct constant_descriptor_rtx
*desc
;
7321 HOST_WIDE_INT offset
;
7325 if (block
->objects
== NULL
)
7328 /* Switch to the section and make sure that the first byte is
7329 suitably aligned. */
7330 switch_to_section (block
->sect
);
7331 assemble_align (block
->alignment
);
7333 /* Define the values of all anchors relative to the current section
7335 FOR_EACH_VEC_ELT (rtx
, block
->anchors
, i
, symbol
)
7336 targetm
.asm_out
.output_anchor (symbol
);
7338 /* Output the objects themselves. */
7340 FOR_EACH_VEC_ELT (rtx
, block
->objects
, i
, symbol
)
7342 /* Move to the object's offset, padding with zeros if necessary. */
7343 assemble_zeros (SYMBOL_REF_BLOCK_OFFSET (symbol
) - offset
);
7344 offset
= SYMBOL_REF_BLOCK_OFFSET (symbol
);
7345 if (CONSTANT_POOL_ADDRESS_P (symbol
))
7347 desc
= SYMBOL_REF_CONSTANT (symbol
);
7348 output_constant_pool_1 (desc
, 1);
7349 offset
+= GET_MODE_SIZE (desc
->mode
);
7351 else if (TREE_CONSTANT_POOL_ADDRESS_P (symbol
))
7353 decl
= SYMBOL_REF_DECL (symbol
);
7354 assemble_constant_contents (DECL_INITIAL (decl
), XSTR (symbol
, 0),
7356 offset
+= get_constant_size (DECL_INITIAL (decl
));
7360 decl
= SYMBOL_REF_DECL (symbol
);
7361 assemble_variable_contents (decl
, XSTR (symbol
, 0), false);
7362 offset
+= tree_low_cst (DECL_SIZE_UNIT (decl
), 1);
7367 /* A htab_traverse callback used to call output_object_block for
7368 each member of object_block_htab. */
7371 output_object_block_htab (void **slot
, void *data ATTRIBUTE_UNUSED
)
7373 output_object_block ((struct object_block
*) (*slot
));
7377 /* Output the definitions of all object_blocks. */
7380 output_object_blocks (void)
7382 htab_traverse (object_block_htab
, output_object_block_htab
, NULL
);
7385 /* This function provides a possible implementation of the
7386 TARGET_ASM_RECORD_GCC_SWITCHES target hook for ELF targets. When triggered
7387 by -frecord-gcc-switches it creates a new mergeable, string section in the
7388 assembler output file called TARGET_ASM_RECORD_GCC_SWITCHES_SECTION which
7389 contains the switches in ASCII format.
7391 FIXME: This code does not correctly handle double quote characters
7392 that appear inside strings, (it strips them rather than preserving them).
7393 FIXME: ASM_OUTPUT_ASCII, as defined in config/elfos.h will not emit NUL
7394 characters - instead it treats them as sub-string separators. Since
7395 we want to emit NUL strings terminators into the object file we have to use
7399 elf_record_gcc_switches (print_switch_type type
, const char * name
)
7403 case SWITCH_TYPE_PASSED
:
7404 ASM_OUTPUT_ASCII (asm_out_file
, name
, strlen (name
));
7405 ASM_OUTPUT_SKIP (asm_out_file
, (unsigned HOST_WIDE_INT
) 1);
7408 case SWITCH_TYPE_DESCRIPTIVE
:
7411 /* Distinguish between invocations where name is NULL. */
7412 static bool started
= false;
7418 sec
= get_section (targetm
.asm_out
.record_gcc_switches_section
,
7422 | (SECTION_ENTSIZE
& 1),
7424 switch_to_section (sec
);
7433 /* The return value is currently ignored by the caller, but must be 0.
7434 For -fverbose-asm the return value would be the number of characters
7435 emitted into the assembler file. */
7439 /* Emit text to declare externally defined symbols. It is needed to
7440 properly support non-default visibility. */
7442 default_elf_asm_output_external (FILE *file ATTRIBUTE_UNUSED
,
7444 const char *name ATTRIBUTE_UNUSED
)
7446 /* We output the name if and only if TREE_SYMBOL_REFERENCED is
7447 set in order to avoid putting out names that are never really
7449 if (TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (decl
))
7450 && targetm
.binds_local_p (decl
))
7451 maybe_assemble_visibility (decl
);
7454 /* The default hook for TARGET_ASM_OUTPUT_SOURCE_FILENAME. */
7457 default_asm_output_source_filename (FILE *file
, const char *name
)
7459 #ifdef ASM_OUTPUT_SOURCE_FILENAME
7460 ASM_OUTPUT_SOURCE_FILENAME (file
, name
);
7462 fprintf (file
, "\t.file\t");
7463 output_quoted_string (file
, name
);
7468 /* Output a file name in the form wanted by System V. */
7471 output_file_directive (FILE *asm_file
, const char *input_name
)
7476 if (input_name
== NULL
)
7477 input_name
= "<stdin>";
7479 input_name
= remap_debug_filename (input_name
);
7481 len
= strlen (input_name
);
7482 na
= input_name
+ len
;
7484 /* NA gets INPUT_NAME sans directory names. */
7485 while (na
> input_name
)
7487 if (IS_DIR_SEPARATOR (na
[-1]))
7492 targetm
.asm_out
.output_source_filename (asm_file
, na
);
7495 /* Create a DEBUG_EXPR_DECL / DEBUG_EXPR pair from RTL expression
7498 make_debug_expr_from_rtl (const_rtx exp
)
7500 tree ddecl
= make_node (DEBUG_EXPR_DECL
), type
;
7501 enum machine_mode mode
= GET_MODE (exp
);
7504 DECL_ARTIFICIAL (ddecl
) = 1;
7505 if (REG_P (exp
) && REG_EXPR (exp
))
7506 type
= TREE_TYPE (REG_EXPR (exp
));
7507 else if (MEM_P (exp
) && MEM_EXPR (exp
))
7508 type
= TREE_TYPE (MEM_EXPR (exp
));
7511 if (type
&& TYPE_MODE (type
) == mode
)
7512 TREE_TYPE (ddecl
) = type
;
7514 TREE_TYPE (ddecl
) = lang_hooks
.types
.type_for_mode (mode
, 1);
7515 DECL_MODE (ddecl
) = mode
;
7516 dval
= gen_rtx_DEBUG_EXPR (mode
);
7517 DEBUG_EXPR_TREE_DECL (dval
) = ddecl
;
7518 SET_DECL_RTL (ddecl
, dval
);
7522 #ifdef ELF_ASCII_ESCAPES
7523 /* Default ASM_OUTPUT_LIMITED_STRING for ELF targets. */
7526 default_elf_asm_output_limited_string (FILE *f
, const char *s
)
7531 fputs ("\t.string\t\"", f
);
7535 escape
= ELF_ASCII_ESCAPES
[c
];
7542 /* TODO: Print in hex with fast function, important for -flto. */
7543 fprintf (f
, "\\%03o", c
);
7556 /* Default ASM_OUTPUT_ASCII for ELF targets. */
7559 default_elf_asm_output_ascii (FILE *f
, const char *s
, unsigned int len
)
7561 const char *limit
= s
+ len
;
7562 const char *last_null
= NULL
;
7563 unsigned bytes_in_chunk
= 0;
7567 for (; s
< limit
; s
++)
7571 if (bytes_in_chunk
>= 60)
7580 for (p
= s
; p
< limit
&& *p
!= '\0'; p
++)
7587 if (p
< limit
&& (p
- s
) <= (long) ELF_STRING_LIMIT
)
7589 if (bytes_in_chunk
> 0)
7596 default_elf_asm_output_limited_string (f
, s
);
7601 if (bytes_in_chunk
== 0)
7602 fputs (ASCII_DATA_ASM_OP
"\"", f
);
7605 escape
= ELF_ASCII_ESCAPES
[c
];
7613 /* TODO: Print in hex with fast function, important for -flto. */
7614 fprintf (f
, "\\%03o", c
);
7615 bytes_in_chunk
+= 4;
7620 bytes_in_chunk
+= 2;
7627 if (bytes_in_chunk
> 0)
7635 /* Default TARGET_ASM_INTERNAL_LABEL for ELF targets. */
7638 default_elf_internal_label (FILE *f
, const char *prefix
,
7639 unsigned long labelno
)
7643 fprint_ul (f
, labelno
);
7648 static GTY(()) section
*elf_init_array_section
;
7649 static GTY(()) section
*elf_fini_array_section
;
7652 get_elf_initfini_array_priority_section (int priority
,
7656 if (priority
!= DEFAULT_INIT_PRIORITY
)
7659 sprintf (buf
, "%s.%.5u",
7660 constructor_p
? ".init_array" : ".fini_array",
7662 sec
= get_section (buf
, SECTION_WRITE
, NULL_TREE
);
7668 if (elf_init_array_section
== NULL
)
7669 elf_init_array_section
7670 = get_unnamed_section (0, output_section_asm_op
,
7671 "\t.section\t.init_array");
7672 sec
= elf_init_array_section
;
7676 if (elf_fini_array_section
== NULL
)
7677 elf_fini_array_section
7678 = get_unnamed_section (0, output_section_asm_op
,
7679 "\t.section\t.fini_array");
7680 sec
= elf_fini_array_section
;
7686 /* Use .init_array section for constructors. */
7689 default_elf_init_array_asm_out_constructor (rtx symbol
, int priority
)
7691 section
*sec
= get_elf_initfini_array_priority_section (priority
,
7693 assemble_addr_to_section (symbol
, sec
);
7696 /* Use .fini_array section for destructors. */
7699 default_elf_fini_array_asm_out_destructor (rtx symbol
, int priority
)
7701 section
*sec
= get_elf_initfini_array_priority_section (priority
,
7703 assemble_addr_to_section (symbol
, sec
);
7706 #include "gt-varasm.h"