Daily bump.
[official-gcc.git] / gcc / varasm.c
blob11a8ac4bc8c0e30d78f11b2977b0fccfc9d305fe
1 /* Output variables, constants and external declarations, for GNU compiler.
2 Copyright (C) 1987-2017 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
9 version.
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14 for more details.
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
21 /* This file handles generation of all the assembler code
22 *except* the instructions of a function.
23 This includes declarations of variables and their initial values.
25 We also output the assembler code for constants stored in memory
26 and are responsible for combining constants with the same value. */
28 #include "config.h"
29 #include "system.h"
30 #include "coretypes.h"
31 #include "backend.h"
32 #include "target.h"
33 #include "rtl.h"
34 #include "tree.h"
35 #include "predict.h"
36 #include "memmodel.h"
37 #include "tm_p.h"
38 #include "stringpool.h"
39 #include "regs.h"
40 #include "emit-rtl.h"
41 #include "cgraph.h"
42 #include "diagnostic-core.h"
43 #include "fold-const.h"
44 #include "stor-layout.h"
45 #include "varasm.h"
46 #include "flags.h"
47 #include "stmt.h"
48 #include "expr.h"
49 #include "expmed.h"
50 #include "output.h"
51 #include "langhooks.h"
52 #include "debug.h"
53 #include "common/common-target.h"
54 #include "asan.h"
55 #include "rtl-iter.h"
57 #ifdef XCOFF_DEBUGGING_INFO
58 #include "xcoffout.h" /* Needed for external data declarations. */
59 #endif
61 /* The (assembler) name of the first globally-visible object output. */
62 extern GTY(()) const char *first_global_object_name;
63 extern GTY(()) const char *weak_global_object_name;
65 const char *first_global_object_name;
66 const char *weak_global_object_name;
68 struct addr_const;
69 struct constant_descriptor_rtx;
70 struct rtx_constant_pool;
72 #define n_deferred_constants (crtl->varasm.deferred_constants)
74 /* Number for making the label on the next
75 constant that is stored in memory. */
77 static GTY(()) int const_labelno;
79 /* Carry information from ASM_DECLARE_OBJECT_NAME
80 to ASM_FINISH_DECLARE_OBJECT. */
82 int size_directive_output;
84 /* The last decl for which assemble_variable was called,
85 if it did ASM_DECLARE_OBJECT_NAME.
86 If the last call to assemble_variable didn't do that,
87 this holds 0. */
89 tree last_assemble_variable_decl;
91 /* The following global variable indicates if the first basic block
92 in a function belongs to the cold partition or not. */
94 bool first_function_block_is_cold;
96 /* Whether we saw any functions with no_split_stack. */
98 static bool saw_no_split_stack;
100 static const char *strip_reg_name (const char *);
101 static int contains_pointers_p (tree);
102 #ifdef ASM_OUTPUT_EXTERNAL
103 static bool incorporeal_function_p (tree);
104 #endif
105 static void decode_addr_const (tree, struct addr_const *);
106 static hashval_t const_hash_1 (const tree);
107 static int compare_constant (const tree, const tree);
108 static void output_constant_def_contents (rtx);
109 static void output_addressed_constants (tree);
110 static unsigned HOST_WIDE_INT output_constant (tree, unsigned HOST_WIDE_INT,
111 unsigned int, bool);
112 static void globalize_decl (tree);
113 static bool decl_readonly_section_1 (enum section_category);
114 #ifdef BSS_SECTION_ASM_OP
115 #ifdef ASM_OUTPUT_ALIGNED_BSS
116 static void asm_output_aligned_bss (FILE *, tree, const char *,
117 unsigned HOST_WIDE_INT, int)
118 ATTRIBUTE_UNUSED;
119 #endif
120 #endif /* BSS_SECTION_ASM_OP */
121 static void mark_weak (tree);
122 static void output_constant_pool (const char *, tree);
123 static void handle_vtv_comdat_section (section *, const_tree);
125 /* Well-known sections, each one associated with some sort of *_ASM_OP. */
126 section *text_section;
127 section *data_section;
128 section *readonly_data_section;
129 section *sdata_section;
130 section *ctors_section;
131 section *dtors_section;
132 section *bss_section;
133 section *sbss_section;
135 /* Various forms of common section. All are guaranteed to be nonnull. */
136 section *tls_comm_section;
137 section *comm_section;
138 section *lcomm_section;
140 /* A SECTION_NOSWITCH section used for declaring global BSS variables.
141 May be null. */
142 section *bss_noswitch_section;
144 /* The section that holds the main exception table, when known. The section
145 is set either by the target's init_sections hook or by the first call to
146 switch_to_exception_section. */
147 section *exception_section;
149 /* The section that holds the DWARF2 frame unwind information, when known.
150 The section is set either by the target's init_sections hook or by the
151 first call to switch_to_eh_frame_section. */
152 section *eh_frame_section;
154 /* asm_out_file's current section. This is NULL if no section has yet
155 been selected or if we lose track of what the current section is. */
156 section *in_section;
158 /* True if code for the current function is currently being directed
159 at the cold section. */
160 bool in_cold_section_p;
162 /* The following global holds the "function name" for the code in the
163 cold section of a function, if hot/cold function splitting is enabled
164 and there was actually code that went into the cold section. A
165 pseudo function name is needed for the cold section of code for some
166 debugging tools that perform symbolization. */
167 tree cold_function_name = NULL_TREE;
169 /* A linked list of all the unnamed sections. */
170 static GTY(()) section *unnamed_sections;
172 /* Return a nonzero value if DECL has a section attribute. */
173 #define IN_NAMED_SECTION(DECL) \
174 (VAR_OR_FUNCTION_DECL_P (DECL) && DECL_SECTION_NAME (DECL) != NULL)
176 struct section_hasher : ggc_ptr_hash<section>
178 typedef const char *compare_type;
180 static hashval_t hash (section *);
181 static bool equal (section *, const char *);
184 /* Hash table of named sections. */
185 static GTY(()) hash_table<section_hasher> *section_htab;
187 struct object_block_hasher : ggc_ptr_hash<object_block>
189 typedef const section *compare_type;
191 static hashval_t hash (object_block *);
192 static bool equal (object_block *, const section *);
195 /* A table of object_blocks, indexed by section. */
196 static GTY(()) hash_table<object_block_hasher> *object_block_htab;
198 /* The next number to use for internal anchor labels. */
199 static GTY(()) int anchor_labelno;
201 /* A pool of constants that can be shared between functions. */
202 static GTY(()) struct rtx_constant_pool *shared_constant_pool;
204 /* Helper routines for maintaining section_htab. */
206 bool
207 section_hasher::equal (section *old, const char *new_name)
209 return strcmp (old->named.name, new_name) == 0;
212 hashval_t
213 section_hasher::hash (section *old)
215 return htab_hash_string (old->named.name);
218 /* Return a hash value for section SECT. */
220 static hashval_t
221 hash_section (section *sect)
223 if (sect->common.flags & SECTION_NAMED)
224 return htab_hash_string (sect->named.name);
225 return sect->common.flags;
228 /* Helper routines for maintaining object_block_htab. */
230 inline bool
231 object_block_hasher::equal (object_block *old, const section *new_section)
233 return old->sect == new_section;
236 hashval_t
237 object_block_hasher::hash (object_block *old)
239 return hash_section (old->sect);
242 /* Return a new unnamed section with the given fields. */
244 section *
245 get_unnamed_section (unsigned int flags, void (*callback) (const void *),
246 const void *data)
248 section *sect;
250 sect = ggc_alloc<section> ();
251 sect->unnamed.common.flags = flags | SECTION_UNNAMED;
252 sect->unnamed.callback = callback;
253 sect->unnamed.data = data;
254 sect->unnamed.next = unnamed_sections;
256 unnamed_sections = sect;
257 return sect;
260 /* Return a SECTION_NOSWITCH section with the given fields. */
262 static section *
263 get_noswitch_section (unsigned int flags, noswitch_section_callback callback)
265 section *sect;
267 sect = ggc_alloc<section> ();
268 sect->noswitch.common.flags = flags | SECTION_NOSWITCH;
269 sect->noswitch.callback = callback;
271 return sect;
274 /* Return the named section structure associated with NAME. Create
275 a new section with the given fields if no such structure exists. */
277 section *
278 get_section (const char *name, unsigned int flags, tree decl)
280 section *sect, **slot;
282 slot = section_htab->find_slot_with_hash (name, htab_hash_string (name),
283 INSERT);
284 flags |= SECTION_NAMED;
285 if (*slot == NULL)
287 sect = ggc_alloc<section> ();
288 sect->named.common.flags = flags;
289 sect->named.name = ggc_strdup (name);
290 sect->named.decl = decl;
291 *slot = sect;
293 else
295 sect = *slot;
296 if ((sect->common.flags & ~SECTION_DECLARED) != flags
297 && ((sect->common.flags | flags) & SECTION_OVERRIDE) == 0)
299 /* It is fine if one of the section flags is
300 SECTION_WRITE | SECTION_RELRO and the other has none of these
301 flags (i.e. read-only) in named sections and either the
302 section hasn't been declared yet or has been declared as writable.
303 In that case just make sure the resulting flags are
304 SECTION_WRITE | SECTION_RELRO, ie. writable only because of
305 relocations. */
306 if (((sect->common.flags ^ flags) & (SECTION_WRITE | SECTION_RELRO))
307 == (SECTION_WRITE | SECTION_RELRO)
308 && (sect->common.flags
309 & ~(SECTION_DECLARED | SECTION_WRITE | SECTION_RELRO))
310 == (flags & ~(SECTION_WRITE | SECTION_RELRO))
311 && ((sect->common.flags & SECTION_DECLARED) == 0
312 || (sect->common.flags & SECTION_WRITE)))
314 sect->common.flags |= (SECTION_WRITE | SECTION_RELRO);
315 return sect;
317 /* Sanity check user variables for flag changes. */
318 if (sect->named.decl != NULL
319 && DECL_P (sect->named.decl)
320 && decl != sect->named.decl)
322 if (decl != NULL && DECL_P (decl))
323 error ("%+D causes a section type conflict with %D",
324 decl, sect->named.decl);
325 else
326 error ("section type conflict with %D", sect->named.decl);
327 inform (DECL_SOURCE_LOCATION (sect->named.decl),
328 "%qD was declared here", sect->named.decl);
330 else if (decl != NULL && DECL_P (decl))
331 error ("%+D causes a section type conflict", decl);
332 else
333 error ("section type conflict");
334 /* Make sure we don't error about one section multiple times. */
335 sect->common.flags |= SECTION_OVERRIDE;
338 return sect;
341 /* Return true if the current compilation mode benefits from having
342 objects grouped into blocks. */
344 static bool
345 use_object_blocks_p (void)
347 return flag_section_anchors;
350 /* Return the object_block structure for section SECT. Create a new
351 structure if we haven't created one already. Return null if SECT
352 itself is null. */
354 static struct object_block *
355 get_block_for_section (section *sect)
357 struct object_block *block;
359 if (sect == NULL)
360 return NULL;
362 object_block **slot
363 = object_block_htab->find_slot_with_hash (sect, hash_section (sect),
364 INSERT);
365 block = *slot;
366 if (block == NULL)
368 block = ggc_cleared_alloc<object_block> ();
369 block->sect = sect;
370 *slot = block;
372 return block;
375 /* Create a symbol with label LABEL and place it at byte offset
376 OFFSET in BLOCK. OFFSET can be negative if the symbol's offset
377 is not yet known. LABEL must be a garbage-collected string. */
379 static rtx
380 create_block_symbol (const char *label, struct object_block *block,
381 HOST_WIDE_INT offset)
383 rtx symbol;
384 unsigned int size;
386 /* Create the extended SYMBOL_REF. */
387 size = RTX_HDR_SIZE + sizeof (struct block_symbol);
388 symbol = (rtx) ggc_internal_alloc (size);
390 /* Initialize the normal SYMBOL_REF fields. */
391 memset (symbol, 0, size);
392 PUT_CODE (symbol, SYMBOL_REF);
393 PUT_MODE (symbol, Pmode);
394 XSTR (symbol, 0) = label;
395 SYMBOL_REF_FLAGS (symbol) = SYMBOL_FLAG_HAS_BLOCK_INFO;
397 /* Initialize the block_symbol stuff. */
398 SYMBOL_REF_BLOCK (symbol) = block;
399 SYMBOL_REF_BLOCK_OFFSET (symbol) = offset;
401 return symbol;
404 /* Return a section with a particular name and with whatever SECTION_*
405 flags section_type_flags deems appropriate. The name of the section
406 is taken from NAME if nonnull, otherwise it is taken from DECL's
407 DECL_SECTION_NAME. DECL is the decl associated with the section
408 (see the section comment for details) and RELOC is as for
409 section_type_flags. */
411 section *
412 get_named_section (tree decl, const char *name, int reloc)
414 unsigned int flags;
416 if (name == NULL)
418 gcc_assert (decl && DECL_P (decl) && DECL_SECTION_NAME (decl));
419 name = DECL_SECTION_NAME (decl);
422 flags = targetm.section_type_flags (decl, name, reloc);
423 return get_section (name, flags, decl);
426 /* Worker for resolve_unique_section. */
428 static bool
429 set_implicit_section (struct symtab_node *n, void *data ATTRIBUTE_UNUSED)
431 n->implicit_section = true;
432 return false;
435 /* If required, set DECL_SECTION_NAME to a unique name. */
437 void
438 resolve_unique_section (tree decl, int reloc ATTRIBUTE_UNUSED,
439 int flag_function_or_data_sections)
441 if (DECL_SECTION_NAME (decl) == NULL
442 && targetm_common.have_named_sections
443 && (flag_function_or_data_sections
444 || DECL_COMDAT_GROUP (decl)))
446 targetm.asm_out.unique_section (decl, reloc);
447 if (DECL_SECTION_NAME (decl))
448 symtab_node::get (decl)->call_for_symbol_and_aliases
449 (set_implicit_section, NULL, true);
453 #ifdef BSS_SECTION_ASM_OP
455 #ifdef ASM_OUTPUT_ALIGNED_BSS
457 /* Utility function for targets to use in implementing
458 ASM_OUTPUT_ALIGNED_BSS.
459 ??? It is believed that this function will work in most cases so such
460 support is localized here. */
462 static void
463 asm_output_aligned_bss (FILE *file, tree decl ATTRIBUTE_UNUSED,
464 const char *name, unsigned HOST_WIDE_INT size,
465 int align)
467 switch_to_section (bss_section);
468 ASM_OUTPUT_ALIGN (file, floor_log2 (align / BITS_PER_UNIT));
469 #ifdef ASM_DECLARE_OBJECT_NAME
470 last_assemble_variable_decl = decl;
471 ASM_DECLARE_OBJECT_NAME (file, name, decl);
472 #else
473 /* Standard thing is just output label for the object. */
474 ASM_OUTPUT_LABEL (file, name);
475 #endif /* ASM_DECLARE_OBJECT_NAME */
476 ASM_OUTPUT_SKIP (file, size ? size : 1);
479 #endif
481 #endif /* BSS_SECTION_ASM_OP */
483 #ifndef USE_SELECT_SECTION_FOR_FUNCTIONS
484 /* Return the hot section for function DECL. Return text_section for
485 null DECLs. */
487 static section *
488 hot_function_section (tree decl)
490 if (decl != NULL_TREE
491 && DECL_SECTION_NAME (decl) != NULL
492 && targetm_common.have_named_sections)
493 return get_named_section (decl, NULL, 0);
494 else
495 return text_section;
497 #endif
499 /* Return section for TEXT_SECTION_NAME if DECL or DECL_SECTION_NAME (DECL)
500 is NULL.
502 When DECL_SECTION_NAME is non-NULL and it is implicit section and
503 NAMED_SECTION_SUFFIX is non-NULL, then produce section called
504 concatenate the name with NAMED_SECTION_SUFFIX.
505 Otherwise produce "TEXT_SECTION_NAME.IMPLICIT_NAME". */
507 section *
508 get_named_text_section (tree decl,
509 const char *text_section_name,
510 const char *named_section_suffix)
512 if (decl && DECL_SECTION_NAME (decl))
514 if (named_section_suffix)
516 const char *dsn = DECL_SECTION_NAME (decl);
517 const char *stripped_name;
518 char *name, *buffer;
520 name = (char *) alloca (strlen (dsn) + 1);
521 memcpy (name, dsn,
522 strlen (dsn) + 1);
524 stripped_name = targetm.strip_name_encoding (name);
526 buffer = ACONCAT ((stripped_name, named_section_suffix, NULL));
527 return get_named_section (decl, buffer, 0);
529 else if (symtab_node::get (decl)->implicit_section)
531 const char *name;
533 /* Do not try to split gnu_linkonce functions. This gets somewhat
534 slipperly. */
535 if (DECL_COMDAT_GROUP (decl) && !HAVE_COMDAT_GROUP)
536 return NULL;
537 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
538 name = targetm.strip_name_encoding (name);
539 return get_named_section (decl, ACONCAT ((text_section_name, ".",
540 name, NULL)), 0);
542 else
543 return NULL;
545 return get_named_section (decl, text_section_name, 0);
548 /* Choose named function section based on its frequency. */
550 section *
551 default_function_section (tree decl, enum node_frequency freq,
552 bool startup, bool exit)
554 #if defined HAVE_LD_EH_GC_SECTIONS && defined HAVE_LD_EH_GC_SECTIONS_BUG
555 /* Old GNU linkers have buggy --gc-section support, which sometimes
556 results in .gcc_except_table* sections being garbage collected. */
557 if (decl
558 && symtab_node::get (decl)->implicit_section)
559 return NULL;
560 #endif
562 if (!flag_reorder_functions
563 || !targetm_common.have_named_sections)
564 return NULL;
565 /* Startup code should go to startup subsection unless it is
566 unlikely executed (this happens especially with function splitting
567 where we can split away unnecessary parts of static constructors. */
568 if (startup && freq != NODE_FREQUENCY_UNLIKELY_EXECUTED)
570 /* If we do have a profile or(and) LTO phase is executed, we do not need
571 these ELF section. */
572 if (!in_lto_p || !flag_profile_values)
573 return get_named_text_section (decl, ".text.startup", NULL);
574 else
575 return NULL;
578 /* Similarly for exit. */
579 if (exit && freq != NODE_FREQUENCY_UNLIKELY_EXECUTED)
580 return get_named_text_section (decl, ".text.exit", NULL);
582 /* Group cold functions together, similarly for hot code. */
583 switch (freq)
585 case NODE_FREQUENCY_UNLIKELY_EXECUTED:
586 return get_named_text_section (decl, ".text.unlikely", NULL);
587 case NODE_FREQUENCY_HOT:
588 /* If we do have a profile or(and) LTO phase is executed, we do not need
589 these ELF section. */
590 if (!in_lto_p || !flag_profile_values)
591 return get_named_text_section (decl, ".text.hot", NULL);
592 /* FALLTHRU */
593 default:
594 return NULL;
598 /* Return the section for function DECL.
600 If DECL is NULL_TREE, return the text section. We can be passed
601 NULL_TREE under some circumstances by dbxout.c at least.
603 If FORCE_COLD is true, return cold function section ignoring
604 the frequency info of cgraph_node. */
606 static section *
607 function_section_1 (tree decl, bool force_cold)
609 section *section = NULL;
610 enum node_frequency freq = NODE_FREQUENCY_NORMAL;
611 bool startup = false, exit = false;
613 if (decl)
615 struct cgraph_node *node = cgraph_node::get (decl);
617 if (node)
619 freq = node->frequency;
620 startup = node->only_called_at_startup;
621 exit = node->only_called_at_exit;
624 if (force_cold)
625 freq = NODE_FREQUENCY_UNLIKELY_EXECUTED;
627 #ifdef USE_SELECT_SECTION_FOR_FUNCTIONS
628 if (decl != NULL_TREE
629 && DECL_SECTION_NAME (decl) != NULL)
631 if (targetm.asm_out.function_section)
632 section = targetm.asm_out.function_section (decl, freq,
633 startup, exit);
634 if (section)
635 return section;
636 return get_named_section (decl, NULL, 0);
638 else
639 return targetm.asm_out.select_section
640 (decl, freq == NODE_FREQUENCY_UNLIKELY_EXECUTED,
641 symtab_node::get (decl)->definition_alignment ());
642 #else
643 if (targetm.asm_out.function_section)
644 section = targetm.asm_out.function_section (decl, freq, startup, exit);
645 if (section)
646 return section;
647 return hot_function_section (decl);
648 #endif
651 /* Return the section for function DECL.
653 If DECL is NULL_TREE, return the text section. We can be passed
654 NULL_TREE under some circumstances by dbxout.c at least. */
656 section *
657 function_section (tree decl)
659 /* Handle cases where function splitting code decides
660 to put function entry point into unlikely executed section
661 despite the fact that the function itself is not cold
662 (i.e. it is called rarely but contains a hot loop that is
663 better to live in hot subsection for the code locality). */
664 return function_section_1 (decl,
665 first_function_block_is_cold);
668 /* Return the section for the current function, take IN_COLD_SECTION_P
669 into account. */
671 section *
672 current_function_section (void)
674 return function_section_1 (current_function_decl, in_cold_section_p);
677 /* Tell assembler to switch to unlikely-to-be-executed text section. */
679 section *
680 unlikely_text_section (void)
682 return function_section_1 (current_function_decl, true);
685 /* When called within a function context, return true if the function
686 has been assigned a cold text section and if SECT is that section.
687 When called outside a function context, return true if SECT is the
688 default cold section. */
690 bool
691 unlikely_text_section_p (section *sect)
693 return sect == function_section_1 (current_function_decl, true);
696 /* Return the read-only data section associated with function DECL. */
698 section *
699 default_function_rodata_section (tree decl)
701 if (decl != NULL_TREE && DECL_SECTION_NAME (decl))
703 const char *name = DECL_SECTION_NAME (decl);
705 if (DECL_COMDAT_GROUP (decl) && HAVE_COMDAT_GROUP)
707 const char *dot;
708 size_t len;
709 char* rname;
711 dot = strchr (name + 1, '.');
712 if (!dot)
713 dot = name;
714 len = strlen (dot) + 8;
715 rname = (char *) alloca (len);
717 strcpy (rname, ".rodata");
718 strcat (rname, dot);
719 return get_section (rname, SECTION_LINKONCE, decl);
721 /* For .gnu.linkonce.t.foo we want to use .gnu.linkonce.r.foo. */
722 else if (DECL_COMDAT_GROUP (decl)
723 && strncmp (name, ".gnu.linkonce.t.", 16) == 0)
725 size_t len = strlen (name) + 1;
726 char *rname = (char *) alloca (len);
728 memcpy (rname, name, len);
729 rname[14] = 'r';
730 return get_section (rname, SECTION_LINKONCE, decl);
732 /* For .text.foo we want to use .rodata.foo. */
733 else if (flag_function_sections && flag_data_sections
734 && strncmp (name, ".text.", 6) == 0)
736 size_t len = strlen (name) + 1;
737 char *rname = (char *) alloca (len + 2);
739 memcpy (rname, ".rodata", 7);
740 memcpy (rname + 7, name + 5, len - 5);
741 return get_section (rname, 0, decl);
745 return readonly_data_section;
748 /* Return the read-only data section associated with function DECL
749 for targets where that section should be always the single
750 readonly data section. */
752 section *
753 default_no_function_rodata_section (tree decl ATTRIBUTE_UNUSED)
755 return readonly_data_section;
758 /* A subroutine of mergeable_string_section and mergeable_constant_section. */
760 static const char *
761 function_mergeable_rodata_prefix (void)
763 section *s = targetm.asm_out.function_rodata_section (current_function_decl);
764 if (SECTION_STYLE (s) == SECTION_NAMED)
765 return s->named.name;
766 else
767 return targetm.asm_out.mergeable_rodata_prefix;
770 /* Return the section to use for string merging. */
772 static section *
773 mergeable_string_section (tree decl ATTRIBUTE_UNUSED,
774 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED,
775 unsigned int flags ATTRIBUTE_UNUSED)
777 HOST_WIDE_INT len;
779 if (HAVE_GAS_SHF_MERGE && flag_merge_constants
780 && TREE_CODE (decl) == STRING_CST
781 && TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE
782 && align <= 256
783 && (len = int_size_in_bytes (TREE_TYPE (decl))) > 0
784 && TREE_STRING_LENGTH (decl) >= len)
786 machine_mode mode;
787 unsigned int modesize;
788 const char *str;
789 HOST_WIDE_INT i;
790 int j, unit;
791 const char *prefix = function_mergeable_rodata_prefix ();
792 char *name = (char *) alloca (strlen (prefix) + 30);
794 mode = TYPE_MODE (TREE_TYPE (TREE_TYPE (decl)));
795 modesize = GET_MODE_BITSIZE (mode);
796 if (modesize >= 8 && modesize <= 256
797 && (modesize & (modesize - 1)) == 0)
799 if (align < modesize)
800 align = modesize;
802 str = TREE_STRING_POINTER (decl);
803 unit = GET_MODE_SIZE (mode);
805 /* Check for embedded NUL characters. */
806 for (i = 0; i < len; i += unit)
808 for (j = 0; j < unit; j++)
809 if (str[i + j] != '\0')
810 break;
811 if (j == unit)
812 break;
814 if (i == len - unit)
816 sprintf (name, "%s.str%d.%d", prefix,
817 modesize / 8, (int) (align / 8));
818 flags |= (modesize / 8) | SECTION_MERGE | SECTION_STRINGS;
819 return get_section (name, flags, NULL);
824 return readonly_data_section;
827 /* Return the section to use for constant merging. */
829 section *
830 mergeable_constant_section (machine_mode mode ATTRIBUTE_UNUSED,
831 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED,
832 unsigned int flags ATTRIBUTE_UNUSED)
834 unsigned int modesize = GET_MODE_BITSIZE (mode);
836 if (HAVE_GAS_SHF_MERGE && flag_merge_constants
837 && mode != VOIDmode
838 && mode != BLKmode
839 && modesize <= align
840 && align >= 8
841 && align <= 256
842 && (align & (align - 1)) == 0)
844 const char *prefix = function_mergeable_rodata_prefix ();
845 char *name = (char *) alloca (strlen (prefix) + 30);
847 sprintf (name, "%s.cst%d", prefix, (int) (align / 8));
848 flags |= (align / 8) | SECTION_MERGE;
849 return get_section (name, flags, NULL);
851 return readonly_data_section;
854 /* Given NAME, a putative register name, discard any customary prefixes. */
856 static const char *
857 strip_reg_name (const char *name)
859 #ifdef REGISTER_PREFIX
860 if (!strncmp (name, REGISTER_PREFIX, strlen (REGISTER_PREFIX)))
861 name += strlen (REGISTER_PREFIX);
862 #endif
863 if (name[0] == '%' || name[0] == '#')
864 name++;
865 return name;
868 /* The user has asked for a DECL to have a particular name. Set (or
869 change) it in such a way that we don't prefix an underscore to
870 it. */
871 void
872 set_user_assembler_name (tree decl, const char *name)
874 char *starred = (char *) alloca (strlen (name) + 2);
875 starred[0] = '*';
876 strcpy (starred + 1, name);
877 symtab->change_decl_assembler_name (decl, get_identifier (starred));
878 SET_DECL_RTL (decl, NULL_RTX);
881 /* Decode an `asm' spec for a declaration as a register name.
882 Return the register number, or -1 if nothing specified,
883 or -2 if the ASMSPEC is not `cc' or `memory' and is not recognized,
884 or -3 if ASMSPEC is `cc' and is not recognized,
885 or -4 if ASMSPEC is `memory' and is not recognized.
886 Accept an exact spelling or a decimal number.
887 Prefixes such as % are optional. */
890 decode_reg_name_and_count (const char *asmspec, int *pnregs)
892 /* Presume just one register is clobbered. */
893 *pnregs = 1;
895 if (asmspec != 0)
897 int i;
899 /* Get rid of confusing prefixes. */
900 asmspec = strip_reg_name (asmspec);
902 /* Allow a decimal number as a "register name". */
903 for (i = strlen (asmspec) - 1; i >= 0; i--)
904 if (! ISDIGIT (asmspec[i]))
905 break;
906 if (asmspec[0] != 0 && i < 0)
908 i = atoi (asmspec);
909 if (i < FIRST_PSEUDO_REGISTER && i >= 0 && reg_names[i][0])
910 return i;
911 else
912 return -2;
915 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
916 if (reg_names[i][0]
917 && ! strcmp (asmspec, strip_reg_name (reg_names[i])))
918 return i;
920 #ifdef OVERLAPPING_REGISTER_NAMES
922 static const struct
924 const char *const name;
925 const int number;
926 const int nregs;
927 } table[] = OVERLAPPING_REGISTER_NAMES;
929 for (i = 0; i < (int) ARRAY_SIZE (table); i++)
930 if (table[i].name[0]
931 && ! strcmp (asmspec, table[i].name))
933 *pnregs = table[i].nregs;
934 return table[i].number;
937 #endif /* OVERLAPPING_REGISTER_NAMES */
939 #ifdef ADDITIONAL_REGISTER_NAMES
941 static const struct { const char *const name; const int number; } table[]
942 = ADDITIONAL_REGISTER_NAMES;
944 for (i = 0; i < (int) ARRAY_SIZE (table); i++)
945 if (table[i].name[0]
946 && ! strcmp (asmspec, table[i].name)
947 && reg_names[table[i].number][0])
948 return table[i].number;
950 #endif /* ADDITIONAL_REGISTER_NAMES */
952 if (!strcmp (asmspec, "memory"))
953 return -4;
955 if (!strcmp (asmspec, "cc"))
956 return -3;
958 return -2;
961 return -1;
965 decode_reg_name (const char *name)
967 int count;
968 return decode_reg_name_and_count (name, &count);
972 /* Return true if DECL's initializer is suitable for a BSS section. */
974 bool
975 bss_initializer_p (const_tree decl)
977 return (DECL_INITIAL (decl) == NULL
978 /* In LTO we have no errors in program; error_mark_node is used
979 to mark offlined constructors. */
980 || (DECL_INITIAL (decl) == error_mark_node
981 && !in_lto_p)
982 || (flag_zero_initialized_in_bss
983 /* Leave constant zeroes in .rodata so they
984 can be shared. */
985 && !TREE_READONLY (decl)
986 && initializer_zerop (DECL_INITIAL (decl))));
989 /* Compute the alignment of variable specified by DECL.
990 DONT_OUTPUT_DATA is from assemble_variable. */
992 void
993 align_variable (tree decl, bool dont_output_data)
995 unsigned int align = DECL_ALIGN (decl);
997 /* In the case for initialing an array whose length isn't specified,
998 where we have not yet been able to do the layout,
999 figure out the proper alignment now. */
1000 if (dont_output_data && DECL_SIZE (decl) == 0
1001 && TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE)
1002 align = MAX (align, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl))));
1004 /* Some object file formats have a maximum alignment which they support.
1005 In particular, a.out format supports a maximum alignment of 4. */
1006 if (align > MAX_OFILE_ALIGNMENT)
1008 error ("alignment of %q+D is greater than maximum object "
1009 "file alignment %d", decl,
1010 MAX_OFILE_ALIGNMENT/BITS_PER_UNIT);
1011 align = MAX_OFILE_ALIGNMENT;
1014 if (! DECL_USER_ALIGN (decl))
1016 #ifdef DATA_ABI_ALIGNMENT
1017 unsigned int data_abi_align
1018 = DATA_ABI_ALIGNMENT (TREE_TYPE (decl), align);
1019 /* For backwards compatibility, don't assume the ABI alignment for
1020 TLS variables. */
1021 if (! DECL_THREAD_LOCAL_P (decl) || data_abi_align <= BITS_PER_WORD)
1022 align = data_abi_align;
1023 #endif
1025 /* On some machines, it is good to increase alignment sometimes.
1026 But as DECL_ALIGN is used both for actually emitting the variable
1027 and for code accessing the variable as guaranteed alignment, we
1028 can only increase the alignment if it is a performance optimization
1029 if the references to it must bind to the current definition. */
1030 if (decl_binds_to_current_def_p (decl)
1031 && !DECL_VIRTUAL_P (decl))
1033 #ifdef DATA_ALIGNMENT
1034 unsigned int data_align = DATA_ALIGNMENT (TREE_TYPE (decl), align);
1035 /* Don't increase alignment too much for TLS variables - TLS space
1036 is too precious. */
1037 if (! DECL_THREAD_LOCAL_P (decl) || data_align <= BITS_PER_WORD)
1038 align = data_align;
1039 #endif
1040 if (DECL_INITIAL (decl) != 0
1041 /* In LTO we have no errors in program; error_mark_node is used
1042 to mark offlined constructors. */
1043 && (in_lto_p || DECL_INITIAL (decl) != error_mark_node))
1045 unsigned int const_align
1046 = CONSTANT_ALIGNMENT (DECL_INITIAL (decl), align);
1047 /* Don't increase alignment too much for TLS variables - TLS
1048 space is too precious. */
1049 if (! DECL_THREAD_LOCAL_P (decl) || const_align <= BITS_PER_WORD)
1050 align = const_align;
1055 /* Reset the alignment in case we have made it tighter, so we can benefit
1056 from it in get_pointer_alignment. */
1057 SET_DECL_ALIGN (decl, align);
1060 /* Return DECL_ALIGN (decl), possibly increased for optimization purposes
1061 beyond what align_variable returned. */
1063 static unsigned int
1064 get_variable_align (tree decl)
1066 unsigned int align = DECL_ALIGN (decl);
1068 /* For user aligned vars or static vars align_variable already did
1069 everything. */
1070 if (DECL_USER_ALIGN (decl) || !TREE_PUBLIC (decl))
1071 return align;
1073 #ifdef DATA_ABI_ALIGNMENT
1074 if (DECL_THREAD_LOCAL_P (decl))
1075 align = DATA_ABI_ALIGNMENT (TREE_TYPE (decl), align);
1076 #endif
1078 /* For decls that bind to the current definition, align_variable
1079 did also everything, except for not assuming ABI required alignment
1080 of TLS variables. For other vars, increase the alignment here
1081 as an optimization. */
1082 if (!decl_binds_to_current_def_p (decl))
1084 /* On some machines, it is good to increase alignment sometimes. */
1085 #ifdef DATA_ALIGNMENT
1086 unsigned int data_align = DATA_ALIGNMENT (TREE_TYPE (decl), align);
1087 /* Don't increase alignment too much for TLS variables - TLS space
1088 is too precious. */
1089 if (! DECL_THREAD_LOCAL_P (decl) || data_align <= BITS_PER_WORD)
1090 align = data_align;
1091 #endif
1092 if (DECL_INITIAL (decl) != 0
1093 /* In LTO we have no errors in program; error_mark_node is used
1094 to mark offlined constructors. */
1095 && (in_lto_p || DECL_INITIAL (decl) != error_mark_node))
1097 unsigned int const_align = CONSTANT_ALIGNMENT (DECL_INITIAL (decl),
1098 align);
1099 /* Don't increase alignment too much for TLS variables - TLS space
1100 is too precious. */
1101 if (! DECL_THREAD_LOCAL_P (decl) || const_align <= BITS_PER_WORD)
1102 align = const_align;
1106 return align;
1109 /* Return the section into which the given VAR_DECL or CONST_DECL
1110 should be placed. PREFER_NOSWITCH_P is true if a noswitch
1111 section should be used wherever possible. */
1113 section *
1114 get_variable_section (tree decl, bool prefer_noswitch_p)
1116 addr_space_t as = ADDR_SPACE_GENERIC;
1117 int reloc;
1118 varpool_node *vnode = varpool_node::get (decl);
1119 if (vnode)
1121 vnode = vnode->ultimate_alias_target ();
1122 decl = vnode->decl;
1125 if (TREE_TYPE (decl) != error_mark_node)
1126 as = TYPE_ADDR_SPACE (TREE_TYPE (decl));
1128 /* We need the constructor to figure out reloc flag. */
1129 if (vnode)
1130 vnode->get_constructor ();
1132 if (DECL_COMMON (decl))
1134 /* If the decl has been given an explicit section name, or it resides
1135 in a non-generic address space, then it isn't common, and shouldn't
1136 be handled as such. */
1137 gcc_assert (DECL_SECTION_NAME (decl) == NULL
1138 && ADDR_SPACE_GENERIC_P (as));
1139 if (DECL_THREAD_LOCAL_P (decl))
1140 return tls_comm_section;
1141 else if (TREE_PUBLIC (decl) && bss_initializer_p (decl))
1142 return comm_section;
1145 if (DECL_INITIAL (decl) == error_mark_node)
1146 reloc = contains_pointers_p (TREE_TYPE (decl)) ? 3 : 0;
1147 else if (DECL_INITIAL (decl))
1148 reloc = compute_reloc_for_constant (DECL_INITIAL (decl));
1149 else
1150 reloc = 0;
1152 resolve_unique_section (decl, reloc, flag_data_sections);
1153 if (IN_NAMED_SECTION (decl))
1155 section *sect = get_named_section (decl, NULL, reloc);
1157 if ((sect->common.flags & SECTION_BSS) && !bss_initializer_p (decl))
1159 error_at (DECL_SOURCE_LOCATION (decl),
1160 "only zero initializers are allowed in section %qs",
1161 sect->named.name);
1162 DECL_INITIAL (decl) = error_mark_node;
1164 return sect;
1167 if (ADDR_SPACE_GENERIC_P (as)
1168 && !DECL_THREAD_LOCAL_P (decl)
1169 && !(prefer_noswitch_p && targetm.have_switchable_bss_sections)
1170 && bss_initializer_p (decl))
1172 if (!TREE_PUBLIC (decl)
1173 && !((flag_sanitize & SANITIZE_ADDRESS)
1174 && asan_protect_global (decl)))
1175 return lcomm_section;
1176 if (bss_noswitch_section)
1177 return bss_noswitch_section;
1180 return targetm.asm_out.select_section (decl, reloc,
1181 get_variable_align (decl));
1184 /* Return the block into which object_block DECL should be placed. */
1186 static struct object_block *
1187 get_block_for_decl (tree decl)
1189 section *sect;
1191 if (VAR_P (decl))
1193 /* The object must be defined in this translation unit. */
1194 if (DECL_EXTERNAL (decl))
1195 return NULL;
1197 /* There's no point using object blocks for something that is
1198 isolated by definition. */
1199 if (DECL_COMDAT_GROUP (decl))
1200 return NULL;
1203 /* We can only calculate block offsets if the decl has a known
1204 constant size. */
1205 if (DECL_SIZE_UNIT (decl) == NULL)
1206 return NULL;
1207 if (!tree_fits_uhwi_p (DECL_SIZE_UNIT (decl)))
1208 return NULL;
1210 /* Find out which section should contain DECL. We cannot put it into
1211 an object block if it requires a standalone definition. */
1212 if (VAR_P (decl))
1213 align_variable (decl, 0);
1214 sect = get_variable_section (decl, true);
1215 if (SECTION_STYLE (sect) == SECTION_NOSWITCH)
1216 return NULL;
1218 return get_block_for_section (sect);
1221 /* Make sure block symbol SYMBOL is in block BLOCK. */
1223 static void
1224 change_symbol_block (rtx symbol, struct object_block *block)
1226 if (block != SYMBOL_REF_BLOCK (symbol))
1228 gcc_assert (SYMBOL_REF_BLOCK_OFFSET (symbol) < 0);
1229 SYMBOL_REF_BLOCK (symbol) = block;
1233 /* Return true if it is possible to put DECL in an object_block. */
1235 static bool
1236 use_blocks_for_decl_p (tree decl)
1238 struct symtab_node *snode;
1240 /* Only data DECLs can be placed into object blocks. */
1241 if (!VAR_P (decl) && TREE_CODE (decl) != CONST_DECL)
1242 return false;
1244 /* Detect decls created by dw2_force_const_mem. Such decls are
1245 special because DECL_INITIAL doesn't specify the decl's true value.
1246 dw2_output_indirect_constants will instead call assemble_variable
1247 with dont_output_data set to 1 and then print the contents itself. */
1248 if (DECL_INITIAL (decl) == decl)
1249 return false;
1251 /* If this decl is an alias, then we don't want to emit a
1252 definition. */
1253 if (VAR_P (decl)
1254 && (snode = symtab_node::get (decl)) != NULL
1255 && snode->alias)
1256 return false;
1258 return targetm.use_blocks_for_decl_p (decl);
1261 /* Follow the IDENTIFIER_TRANSPARENT_ALIAS chain starting at *ALIAS
1262 until we find an identifier that is not itself a transparent alias.
1263 Modify the alias passed to it by reference (and all aliases on the
1264 way to the ultimate target), such that they do not have to be
1265 followed again, and return the ultimate target of the alias
1266 chain. */
1268 static inline tree
1269 ultimate_transparent_alias_target (tree *alias)
1271 tree target = *alias;
1273 if (IDENTIFIER_TRANSPARENT_ALIAS (target))
1275 gcc_assert (TREE_CHAIN (target));
1276 target = ultimate_transparent_alias_target (&TREE_CHAIN (target));
1277 gcc_assert (! IDENTIFIER_TRANSPARENT_ALIAS (target)
1278 && ! TREE_CHAIN (target));
1279 *alias = target;
1282 return target;
1285 /* Create the DECL_RTL for a VAR_DECL or FUNCTION_DECL. DECL should
1286 have static storage duration. In other words, it should not be an
1287 automatic variable, including PARM_DECLs.
1289 There is, however, one exception: this function handles variables
1290 explicitly placed in a particular register by the user.
1292 This is never called for PARM_DECL nodes. */
1294 void
1295 make_decl_rtl (tree decl)
1297 const char *name = 0;
1298 int reg_number;
1299 tree id;
1300 rtx x;
1302 /* Check that we are not being given an automatic variable. */
1303 gcc_assert (TREE_CODE (decl) != PARM_DECL
1304 && TREE_CODE (decl) != RESULT_DECL);
1306 /* A weak alias has TREE_PUBLIC set but not the other bits. */
1307 gcc_assert (!VAR_P (decl)
1308 || TREE_STATIC (decl)
1309 || TREE_PUBLIC (decl)
1310 || DECL_EXTERNAL (decl)
1311 || DECL_REGISTER (decl));
1313 /* And that we were not given a type or a label. */
1314 gcc_assert (TREE_CODE (decl) != TYPE_DECL
1315 && TREE_CODE (decl) != LABEL_DECL);
1317 /* For a duplicate declaration, we can be called twice on the
1318 same DECL node. Don't discard the RTL already made. */
1319 if (DECL_RTL_SET_P (decl))
1321 /* If the old RTL had the wrong mode, fix the mode. */
1322 x = DECL_RTL (decl);
1323 if (GET_MODE (x) != DECL_MODE (decl))
1324 SET_DECL_RTL (decl, adjust_address_nv (x, DECL_MODE (decl), 0));
1326 if (TREE_CODE (decl) != FUNCTION_DECL && DECL_REGISTER (decl))
1327 return;
1329 /* ??? Another way to do this would be to maintain a hashed
1330 table of such critters. Instead of adding stuff to a DECL
1331 to give certain attributes to it, we could use an external
1332 hash map from DECL to set of attributes. */
1334 /* Let the target reassign the RTL if it wants.
1335 This is necessary, for example, when one machine specific
1336 decl attribute overrides another. */
1337 targetm.encode_section_info (decl, DECL_RTL (decl), false);
1339 /* If the symbol has a SYMBOL_REF_BLOCK field, update it based
1340 on the new decl information. */
1341 if (MEM_P (x)
1342 && GET_CODE (XEXP (x, 0)) == SYMBOL_REF
1343 && SYMBOL_REF_HAS_BLOCK_INFO_P (XEXP (x, 0)))
1344 change_symbol_block (XEXP (x, 0), get_block_for_decl (decl));
1346 return;
1349 /* If this variable belongs to the global constant pool, retrieve the
1350 pre-computed RTL or recompute it in LTO mode. */
1351 if (VAR_P (decl) && DECL_IN_CONSTANT_POOL (decl))
1353 SET_DECL_RTL (decl, output_constant_def (DECL_INITIAL (decl), 1));
1354 return;
1357 id = DECL_ASSEMBLER_NAME (decl);
1358 if (TREE_CODE (decl) == FUNCTION_DECL
1359 && cgraph_node::get (decl)
1360 && cgraph_node::get (decl)->instrumentation_clone)
1361 ultimate_transparent_alias_target (&id);
1362 name = IDENTIFIER_POINTER (id);
1364 if (name[0] != '*' && TREE_CODE (decl) != FUNCTION_DECL
1365 && DECL_REGISTER (decl))
1367 error ("register name not specified for %q+D", decl);
1369 else if (TREE_CODE (decl) != FUNCTION_DECL && DECL_REGISTER (decl))
1371 const char *asmspec = name+1;
1372 machine_mode mode = DECL_MODE (decl);
1373 reg_number = decode_reg_name (asmspec);
1374 /* First detect errors in declaring global registers. */
1375 if (reg_number == -1)
1376 error ("register name not specified for %q+D", decl);
1377 else if (reg_number < 0)
1378 error ("invalid register name for %q+D", decl);
1379 else if (mode == BLKmode)
1380 error ("data type of %q+D isn%'t suitable for a register",
1381 decl);
1382 else if (!in_hard_reg_set_p (accessible_reg_set, mode, reg_number))
1383 error ("the register specified for %q+D cannot be accessed"
1384 " by the current target", decl);
1385 else if (!in_hard_reg_set_p (operand_reg_set, mode, reg_number))
1386 error ("the register specified for %q+D is not general enough"
1387 " to be used as a register variable", decl);
1388 else if (!HARD_REGNO_MODE_OK (reg_number, mode))
1389 error ("register specified for %q+D isn%'t suitable for data type",
1390 decl);
1391 /* Now handle properly declared static register variables. */
1392 else
1394 int nregs;
1396 if (DECL_INITIAL (decl) != 0 && TREE_STATIC (decl))
1398 DECL_INITIAL (decl) = 0;
1399 error ("global register variable has initial value");
1401 if (TREE_THIS_VOLATILE (decl))
1402 warning (OPT_Wvolatile_register_var,
1403 "optimization may eliminate reads and/or "
1404 "writes to register variables");
1406 /* If the user specified one of the eliminables registers here,
1407 e.g., FRAME_POINTER_REGNUM, we don't want to get this variable
1408 confused with that register and be eliminated. This usage is
1409 somewhat suspect... */
1411 SET_DECL_RTL (decl, gen_raw_REG (mode, reg_number));
1412 ORIGINAL_REGNO (DECL_RTL (decl)) = reg_number;
1413 REG_USERVAR_P (DECL_RTL (decl)) = 1;
1415 if (TREE_STATIC (decl))
1417 /* Make this register global, so not usable for anything
1418 else. */
1419 #ifdef ASM_DECLARE_REGISTER_GLOBAL
1420 name = IDENTIFIER_POINTER (DECL_NAME (decl));
1421 ASM_DECLARE_REGISTER_GLOBAL (asm_out_file, decl, reg_number, name);
1422 #endif
1423 nregs = hard_regno_nregs[reg_number][mode];
1424 while (nregs > 0)
1425 globalize_reg (decl, reg_number + --nregs);
1428 /* As a register variable, it has no section. */
1429 return;
1431 /* Avoid internal errors from invalid register
1432 specifications. */
1433 SET_DECL_ASSEMBLER_NAME (decl, NULL_TREE);
1434 DECL_HARD_REGISTER (decl) = 0;
1435 /* Also avoid SSA inconsistencies by pretending this is an external
1436 decl now. */
1437 DECL_EXTERNAL (decl) = 1;
1438 return;
1440 /* Now handle ordinary static variables and functions (in memory).
1441 Also handle vars declared register invalidly. */
1442 else if (name[0] == '*')
1444 #ifdef REGISTER_PREFIX
1445 if (strlen (REGISTER_PREFIX) != 0)
1447 reg_number = decode_reg_name (name);
1448 if (reg_number >= 0 || reg_number == -3)
1449 error ("register name given for non-register variable %q+D", decl);
1451 #endif
1454 /* Specifying a section attribute on a variable forces it into a
1455 non-.bss section, and thus it cannot be common. */
1456 /* FIXME: In general this code should not be necessary because
1457 visibility pass is doing the same work. But notice_global_symbol
1458 is called early and it needs to make DECL_RTL to get the name.
1459 we take care of recomputing the DECL_RTL after visibility is changed. */
1460 if (VAR_P (decl)
1461 && (TREE_STATIC (decl) || DECL_EXTERNAL (decl))
1462 && DECL_SECTION_NAME (decl) != NULL
1463 && DECL_INITIAL (decl) == NULL_TREE
1464 && DECL_COMMON (decl))
1465 DECL_COMMON (decl) = 0;
1467 /* Variables can't be both common and weak. */
1468 if (VAR_P (decl) && DECL_WEAK (decl))
1469 DECL_COMMON (decl) = 0;
1471 if (use_object_blocks_p () && use_blocks_for_decl_p (decl))
1472 x = create_block_symbol (name, get_block_for_decl (decl), -1);
1473 else
1475 machine_mode address_mode = Pmode;
1476 if (TREE_TYPE (decl) != error_mark_node)
1478 addr_space_t as = TYPE_ADDR_SPACE (TREE_TYPE (decl));
1479 address_mode = targetm.addr_space.address_mode (as);
1481 x = gen_rtx_SYMBOL_REF (address_mode, name);
1483 SYMBOL_REF_WEAK (x) = DECL_WEAK (decl);
1484 SET_SYMBOL_REF_DECL (x, decl);
1486 x = gen_rtx_MEM (DECL_MODE (decl), x);
1487 if (TREE_CODE (decl) != FUNCTION_DECL)
1488 set_mem_attributes (x, decl, 1);
1489 SET_DECL_RTL (decl, x);
1491 /* Optionally set flags or add text to the name to record information
1492 such as that it is a function name.
1493 If the name is changed, the macro ASM_OUTPUT_LABELREF
1494 will have to know how to strip this information. */
1495 targetm.encode_section_info (decl, DECL_RTL (decl), true);
1498 /* Like make_decl_rtl, but inhibit creation of new alias sets when
1499 calling make_decl_rtl. Also, reset DECL_RTL before returning the
1500 rtl. */
1503 make_decl_rtl_for_debug (tree decl)
1505 unsigned int save_aliasing_flag;
1506 rtx rtl;
1508 if (DECL_RTL_SET_P (decl))
1509 return DECL_RTL (decl);
1511 /* Kludge alert! Somewhere down the call chain, make_decl_rtl will
1512 call new_alias_set. If running with -fcompare-debug, sometimes
1513 we do not want to create alias sets that will throw the alias
1514 numbers off in the comparison dumps. So... clearing
1515 flag_strict_aliasing will keep new_alias_set() from creating a
1516 new set. */
1517 save_aliasing_flag = flag_strict_aliasing;
1518 flag_strict_aliasing = 0;
1520 rtl = DECL_RTL (decl);
1521 /* Reset DECL_RTL back, as various parts of the compiler expects
1522 DECL_RTL set meaning it is actually going to be output. */
1523 SET_DECL_RTL (decl, NULL);
1525 flag_strict_aliasing = save_aliasing_flag;
1526 return rtl;
1529 /* Output a string of literal assembler code
1530 for an `asm' keyword used between functions. */
1532 void
1533 assemble_asm (tree string)
1535 const char *p;
1536 app_enable ();
1538 if (TREE_CODE (string) == ADDR_EXPR)
1539 string = TREE_OPERAND (string, 0);
1541 p = TREE_STRING_POINTER (string);
1542 fprintf (asm_out_file, "%s%s\n", p[0] == '\t' ? "" : "\t", p);
1545 /* Write the address of the entity given by SYMBOL to SEC. */
1546 void
1547 assemble_addr_to_section (rtx symbol, section *sec)
1549 switch_to_section (sec);
1550 assemble_align (POINTER_SIZE);
1551 assemble_integer (symbol, POINTER_SIZE_UNITS, POINTER_SIZE, 1);
1554 /* Return the numbered .ctors.N (if CONSTRUCTOR_P) or .dtors.N (if
1555 not) section for PRIORITY. */
1556 section *
1557 get_cdtor_priority_section (int priority, bool constructor_p)
1559 /* Buffer conservatively large enough for the full range of a 32-bit
1560 int plus the text below. */
1561 char buf[18];
1563 /* ??? This only works reliably with the GNU linker. */
1564 sprintf (buf, "%s.%.5u",
1565 constructor_p ? ".ctors" : ".dtors",
1566 /* Invert the numbering so the linker puts us in the proper
1567 order; constructors are run from right to left, and the
1568 linker sorts in increasing order. */
1569 MAX_INIT_PRIORITY - priority);
1570 return get_section (buf, SECTION_WRITE, NULL);
1573 void
1574 default_named_section_asm_out_destructor (rtx symbol, int priority)
1576 section *sec;
1578 if (priority != DEFAULT_INIT_PRIORITY)
1579 sec = get_cdtor_priority_section (priority,
1580 /*constructor_p=*/false);
1581 else
1582 sec = get_section (".dtors", SECTION_WRITE, NULL);
1584 assemble_addr_to_section (symbol, sec);
1587 #ifdef DTORS_SECTION_ASM_OP
1588 void
1589 default_dtor_section_asm_out_destructor (rtx symbol,
1590 int priority ATTRIBUTE_UNUSED)
1592 assemble_addr_to_section (symbol, dtors_section);
1594 #endif
1596 void
1597 default_named_section_asm_out_constructor (rtx symbol, int priority)
1599 section *sec;
1601 if (priority != DEFAULT_INIT_PRIORITY)
1602 sec = get_cdtor_priority_section (priority,
1603 /*constructor_p=*/true);
1604 else
1605 sec = get_section (".ctors", SECTION_WRITE, NULL);
1607 assemble_addr_to_section (symbol, sec);
1610 #ifdef CTORS_SECTION_ASM_OP
1611 void
1612 default_ctor_section_asm_out_constructor (rtx symbol,
1613 int priority ATTRIBUTE_UNUSED)
1615 assemble_addr_to_section (symbol, ctors_section);
1617 #endif
1619 /* CONSTANT_POOL_BEFORE_FUNCTION may be defined as an expression with
1620 a nonzero value if the constant pool should be output before the
1621 start of the function, or a zero value if the pool should output
1622 after the end of the function. The default is to put it before the
1623 start. */
1625 #ifndef CONSTANT_POOL_BEFORE_FUNCTION
1626 #define CONSTANT_POOL_BEFORE_FUNCTION 1
1627 #endif
1629 /* DECL is an object (either VAR_DECL or FUNCTION_DECL) which is going
1630 to be output to assembler.
1631 Set first_global_object_name and weak_global_object_name as appropriate. */
1633 void
1634 notice_global_symbol (tree decl)
1636 const char **t = &first_global_object_name;
1638 if (first_global_object_name
1639 || !TREE_PUBLIC (decl)
1640 || DECL_EXTERNAL (decl)
1641 || !DECL_NAME (decl)
1642 || (VAR_P (decl) && DECL_HARD_REGISTER (decl))
1643 || (TREE_CODE (decl) != FUNCTION_DECL
1644 && (!VAR_P (decl)
1645 || (DECL_COMMON (decl)
1646 && (DECL_INITIAL (decl) == 0
1647 || DECL_INITIAL (decl) == error_mark_node)))))
1648 return;
1650 /* We win when global object is found, but it is useful to know about weak
1651 symbol as well so we can produce nicer unique names. */
1652 if (DECL_WEAK (decl) || DECL_ONE_ONLY (decl) || flag_shlib)
1653 t = &weak_global_object_name;
1655 if (!*t)
1657 tree id = DECL_ASSEMBLER_NAME (decl);
1658 ultimate_transparent_alias_target (&id);
1659 *t = ggc_strdup (targetm.strip_name_encoding (IDENTIFIER_POINTER (id)));
1663 /* If not using flag_reorder_blocks_and_partition, decide early whether the
1664 current function goes into the cold section, so that targets can use
1665 current_function_section during RTL expansion. DECL describes the
1666 function. */
1668 void
1669 decide_function_section (tree decl)
1671 first_function_block_is_cold = false;
1673 if (flag_reorder_blocks_and_partition)
1674 /* We will decide in assemble_start_function. */
1675 return;
1677 if (DECL_SECTION_NAME (decl))
1679 struct cgraph_node *node = cgraph_node::get (current_function_decl);
1680 /* Calls to function_section rely on first_function_block_is_cold
1681 being accurate. */
1682 first_function_block_is_cold = (node
1683 && node->frequency
1684 == NODE_FREQUENCY_UNLIKELY_EXECUTED);
1687 in_cold_section_p = first_function_block_is_cold;
1690 /* Get the function's name, as described by its RTL. This may be
1691 different from the DECL_NAME name used in the source file. */
1692 const char *
1693 get_fnname_from_decl (tree decl)
1695 rtx x = DECL_RTL (decl);
1696 gcc_assert (MEM_P (x));
1697 x = XEXP (x, 0);
1698 gcc_assert (GET_CODE (x) == SYMBOL_REF);
1699 return XSTR (x, 0);
1702 /* Output assembler code for the constant pool of a function and associated
1703 with defining the name of the function. DECL describes the function.
1704 NAME is the function's name. For the constant pool, we use the current
1705 constant pool data. */
1707 void
1708 assemble_start_function (tree decl, const char *fnname)
1710 int align;
1711 char tmp_label[100];
1712 bool hot_label_written = false;
1714 if (flag_reorder_blocks_and_partition)
1716 ASM_GENERATE_INTERNAL_LABEL (tmp_label, "LHOTB", const_labelno);
1717 crtl->subsections.hot_section_label = ggc_strdup (tmp_label);
1718 ASM_GENERATE_INTERNAL_LABEL (tmp_label, "LCOLDB", const_labelno);
1719 crtl->subsections.cold_section_label = ggc_strdup (tmp_label);
1720 ASM_GENERATE_INTERNAL_LABEL (tmp_label, "LHOTE", const_labelno);
1721 crtl->subsections.hot_section_end_label = ggc_strdup (tmp_label);
1722 ASM_GENERATE_INTERNAL_LABEL (tmp_label, "LCOLDE", const_labelno);
1723 crtl->subsections.cold_section_end_label = ggc_strdup (tmp_label);
1724 const_labelno++;
1725 cold_function_name = NULL_TREE;
1727 else
1729 crtl->subsections.hot_section_label = NULL;
1730 crtl->subsections.cold_section_label = NULL;
1731 crtl->subsections.hot_section_end_label = NULL;
1732 crtl->subsections.cold_section_end_label = NULL;
1735 /* The following code does not need preprocessing in the assembler. */
1737 app_disable ();
1739 if (CONSTANT_POOL_BEFORE_FUNCTION)
1740 output_constant_pool (fnname, decl);
1742 align = symtab_node::get (decl)->definition_alignment ();
1744 /* Make sure the not and cold text (code) sections are properly
1745 aligned. This is necessary here in the case where the function
1746 has both hot and cold sections, because we don't want to re-set
1747 the alignment when the section switch happens mid-function. */
1749 if (flag_reorder_blocks_and_partition)
1751 first_function_block_is_cold = false;
1753 switch_to_section (unlikely_text_section ());
1754 assemble_align (align);
1755 ASM_OUTPUT_LABEL (asm_out_file, crtl->subsections.cold_section_label);
1757 /* When the function starts with a cold section, we need to explicitly
1758 align the hot section and write out the hot section label.
1759 But if the current function is a thunk, we do not have a CFG. */
1760 if (!cfun->is_thunk
1761 && BB_PARTITION (ENTRY_BLOCK_PTR_FOR_FN (cfun)->next_bb) == BB_COLD_PARTITION)
1763 switch_to_section (text_section);
1764 assemble_align (align);
1765 ASM_OUTPUT_LABEL (asm_out_file, crtl->subsections.hot_section_label);
1766 hot_label_written = true;
1767 first_function_block_is_cold = true;
1769 in_cold_section_p = first_function_block_is_cold;
1773 /* Switch to the correct text section for the start of the function. */
1775 switch_to_section (function_section (decl));
1776 if (flag_reorder_blocks_and_partition
1777 && !hot_label_written)
1778 ASM_OUTPUT_LABEL (asm_out_file, crtl->subsections.hot_section_label);
1780 /* Tell assembler to move to target machine's alignment for functions. */
1781 align = floor_log2 (align / BITS_PER_UNIT);
1782 if (align > 0)
1784 ASM_OUTPUT_ALIGN (asm_out_file, align);
1787 /* Handle a user-specified function alignment.
1788 Note that we still need to align to DECL_ALIGN, as above,
1789 because ASM_OUTPUT_MAX_SKIP_ALIGN might not do any alignment at all. */
1790 if (! DECL_USER_ALIGN (decl)
1791 && align_functions_log > align
1792 && optimize_function_for_speed_p (cfun))
1794 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
1795 int align_log = align_functions_log;
1796 #endif
1797 int max_skip = align_functions - 1;
1798 if (flag_limit_function_alignment && crtl->max_insn_address > 0
1799 && max_skip >= crtl->max_insn_address)
1800 max_skip = crtl->max_insn_address - 1;
1802 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
1803 ASM_OUTPUT_MAX_SKIP_ALIGN (asm_out_file, align_log, max_skip);
1804 #else
1805 ASM_OUTPUT_ALIGN (asm_out_file, align_functions_log);
1806 #endif
1809 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
1810 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file, fnname);
1811 #endif
1813 if (!DECL_IGNORED_P (decl))
1814 (*debug_hooks->begin_function) (decl);
1816 /* Make function name accessible from other files, if appropriate. */
1818 if (TREE_PUBLIC (decl)
1819 || (cgraph_node::get (decl)->instrumentation_clone
1820 && cgraph_node::get (decl)->instrumented_version
1821 && TREE_PUBLIC (cgraph_node::get (decl)->instrumented_version->decl)))
1823 notice_global_symbol (decl);
1825 globalize_decl (decl);
1827 maybe_assemble_visibility (decl);
1830 if (DECL_PRESERVE_P (decl))
1831 targetm.asm_out.mark_decl_preserved (fnname);
1833 /* Do any machine/system dependent processing of the function name. */
1834 #ifdef ASM_DECLARE_FUNCTION_NAME
1835 ASM_DECLARE_FUNCTION_NAME (asm_out_file, fnname, current_function_decl);
1836 #else
1837 /* Standard thing is just output label for the function. */
1838 ASM_OUTPUT_FUNCTION_LABEL (asm_out_file, fnname, current_function_decl);
1839 #endif /* ASM_DECLARE_FUNCTION_NAME */
1841 if (lookup_attribute ("no_split_stack", DECL_ATTRIBUTES (decl)))
1842 saw_no_split_stack = true;
1845 /* Output assembler code associated with defining the size of the
1846 function. DECL describes the function. NAME is the function's name. */
1848 void
1849 assemble_end_function (tree decl, const char *fnname ATTRIBUTE_UNUSED)
1851 #ifdef ASM_DECLARE_FUNCTION_SIZE
1852 /* We could have switched section in the middle of the function. */
1853 if (flag_reorder_blocks_and_partition)
1854 switch_to_section (function_section (decl));
1855 ASM_DECLARE_FUNCTION_SIZE (asm_out_file, fnname, decl);
1856 #endif
1857 if (! CONSTANT_POOL_BEFORE_FUNCTION)
1859 output_constant_pool (fnname, decl);
1860 switch_to_section (function_section (decl)); /* need to switch back */
1862 /* Output labels for end of hot/cold text sections (to be used by
1863 debug info.) */
1864 if (flag_reorder_blocks_and_partition)
1866 section *save_text_section;
1868 save_text_section = in_section;
1869 switch_to_section (unlikely_text_section ());
1870 #ifdef ASM_DECLARE_COLD_FUNCTION_SIZE
1871 if (cold_function_name != NULL_TREE)
1872 ASM_DECLARE_COLD_FUNCTION_SIZE (asm_out_file,
1873 IDENTIFIER_POINTER (cold_function_name),
1874 decl);
1875 #endif
1876 ASM_OUTPUT_LABEL (asm_out_file, crtl->subsections.cold_section_end_label);
1877 if (first_function_block_is_cold)
1878 switch_to_section (text_section);
1879 else
1880 switch_to_section (function_section (decl));
1881 ASM_OUTPUT_LABEL (asm_out_file, crtl->subsections.hot_section_end_label);
1882 switch_to_section (save_text_section);
1886 /* Assemble code to leave SIZE bytes of zeros. */
1888 void
1889 assemble_zeros (unsigned HOST_WIDE_INT size)
1891 /* Do no output if -fsyntax-only. */
1892 if (flag_syntax_only)
1893 return;
1895 #ifdef ASM_NO_SKIP_IN_TEXT
1896 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
1897 so we must output 0s explicitly in the text section. */
1898 if (ASM_NO_SKIP_IN_TEXT && (in_section->common.flags & SECTION_CODE) != 0)
1900 unsigned HOST_WIDE_INT i;
1901 for (i = 0; i < size; i++)
1902 assemble_integer (const0_rtx, 1, BITS_PER_UNIT, 1);
1904 else
1905 #endif
1906 if (size > 0)
1907 ASM_OUTPUT_SKIP (asm_out_file, size);
1910 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
1912 void
1913 assemble_align (int align)
1915 if (align > BITS_PER_UNIT)
1917 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
1921 /* Assemble a string constant with the specified C string as contents. */
1923 void
1924 assemble_string (const char *p, int size)
1926 int pos = 0;
1927 int maximum = 2000;
1929 /* If the string is very long, split it up. */
1931 while (pos < size)
1933 int thissize = size - pos;
1934 if (thissize > maximum)
1935 thissize = maximum;
1937 ASM_OUTPUT_ASCII (asm_out_file, p, thissize);
1939 pos += thissize;
1940 p += thissize;
1945 /* A noswitch_section_callback for lcomm_section. */
1947 static bool
1948 emit_local (tree decl ATTRIBUTE_UNUSED,
1949 const char *name ATTRIBUTE_UNUSED,
1950 unsigned HOST_WIDE_INT size ATTRIBUTE_UNUSED,
1951 unsigned HOST_WIDE_INT rounded ATTRIBUTE_UNUSED)
1953 #if defined ASM_OUTPUT_ALIGNED_DECL_LOCAL
1954 unsigned int align = symtab_node::get (decl)->definition_alignment ();
1955 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, decl, name,
1956 size, align);
1957 return true;
1958 #elif defined ASM_OUTPUT_ALIGNED_LOCAL
1959 unsigned int align = symtab_node::get (decl)->definition_alignment ();
1960 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, align);
1961 return true;
1962 #else
1963 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded);
1964 return false;
1965 #endif
1968 /* A noswitch_section_callback for bss_noswitch_section. */
1970 #if defined ASM_OUTPUT_ALIGNED_BSS
1971 static bool
1972 emit_bss (tree decl ATTRIBUTE_UNUSED,
1973 const char *name ATTRIBUTE_UNUSED,
1974 unsigned HOST_WIDE_INT size ATTRIBUTE_UNUSED,
1975 unsigned HOST_WIDE_INT rounded ATTRIBUTE_UNUSED)
1977 ASM_OUTPUT_ALIGNED_BSS (asm_out_file, decl, name, size,
1978 get_variable_align (decl));
1979 return true;
1981 #endif
1983 /* A noswitch_section_callback for comm_section. */
1985 static bool
1986 emit_common (tree decl ATTRIBUTE_UNUSED,
1987 const char *name ATTRIBUTE_UNUSED,
1988 unsigned HOST_WIDE_INT size ATTRIBUTE_UNUSED,
1989 unsigned HOST_WIDE_INT rounded ATTRIBUTE_UNUSED)
1991 #if defined ASM_OUTPUT_ALIGNED_DECL_COMMON
1992 ASM_OUTPUT_ALIGNED_DECL_COMMON (asm_out_file, decl, name,
1993 size, get_variable_align (decl));
1994 return true;
1995 #elif defined ASM_OUTPUT_ALIGNED_COMMON
1996 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file, name, size,
1997 get_variable_align (decl));
1998 return true;
1999 #else
2000 ASM_OUTPUT_COMMON (asm_out_file, name, size, rounded);
2001 return false;
2002 #endif
2005 /* A noswitch_section_callback for tls_comm_section. */
2007 static bool
2008 emit_tls_common (tree decl ATTRIBUTE_UNUSED,
2009 const char *name ATTRIBUTE_UNUSED,
2010 unsigned HOST_WIDE_INT size ATTRIBUTE_UNUSED,
2011 unsigned HOST_WIDE_INT rounded ATTRIBUTE_UNUSED)
2013 #ifdef ASM_OUTPUT_TLS_COMMON
2014 ASM_OUTPUT_TLS_COMMON (asm_out_file, decl, name, size);
2015 return true;
2016 #else
2017 sorry ("thread-local COMMON data not implemented");
2018 return true;
2019 #endif
2022 /* Assemble DECL given that it belongs in SECTION_NOSWITCH section SECT.
2023 NAME is the name of DECL's SYMBOL_REF. */
2025 static void
2026 assemble_noswitch_variable (tree decl, const char *name, section *sect,
2027 unsigned int align)
2029 unsigned HOST_WIDE_INT size, rounded;
2031 size = tree_to_uhwi (DECL_SIZE_UNIT (decl));
2032 rounded = size;
2034 if ((flag_sanitize & SANITIZE_ADDRESS) && asan_protect_global (decl))
2035 size += asan_red_zone_size (size);
2037 /* Don't allocate zero bytes of common,
2038 since that means "undefined external" in the linker. */
2039 if (size == 0)
2040 rounded = 1;
2042 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
2043 so that each uninitialized object starts on such a boundary. */
2044 rounded += (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1;
2045 rounded = (rounded / (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
2046 * (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
2048 if (!sect->noswitch.callback (decl, name, size, rounded)
2049 && (unsigned HOST_WIDE_INT) (align / BITS_PER_UNIT) > rounded)
2050 error ("requested alignment for %q+D is greater than "
2051 "implemented alignment of %wu", decl, rounded);
2054 /* A subroutine of assemble_variable. Output the label and contents of
2055 DECL, whose address is a SYMBOL_REF with name NAME. DONT_OUTPUT_DATA
2056 is as for assemble_variable. */
2058 static void
2059 assemble_variable_contents (tree decl, const char *name,
2060 bool dont_output_data)
2062 /* Do any machine/system dependent processing of the object. */
2063 #ifdef ASM_DECLARE_OBJECT_NAME
2064 last_assemble_variable_decl = decl;
2065 ASM_DECLARE_OBJECT_NAME (asm_out_file, name, decl);
2066 #else
2067 /* Standard thing is just output label for the object. */
2068 ASM_OUTPUT_LABEL (asm_out_file, name);
2069 #endif /* ASM_DECLARE_OBJECT_NAME */
2071 if (!dont_output_data)
2073 /* Caller is supposed to use varpool_get_constructor when it wants
2074 to output the body. */
2075 gcc_assert (!in_lto_p || DECL_INITIAL (decl) != error_mark_node);
2076 if (DECL_INITIAL (decl)
2077 && DECL_INITIAL (decl) != error_mark_node
2078 && !initializer_zerop (DECL_INITIAL (decl)))
2079 /* Output the actual data. */
2080 output_constant (DECL_INITIAL (decl),
2081 tree_to_uhwi (DECL_SIZE_UNIT (decl)),
2082 get_variable_align (decl),
2083 false);
2084 else
2085 /* Leave space for it. */
2086 assemble_zeros (tree_to_uhwi (DECL_SIZE_UNIT (decl)));
2087 targetm.asm_out.decl_end ();
2091 /* Write out assembly for the variable DECL, which is not defined in
2092 the current translation unit. */
2093 void
2094 assemble_undefined_decl (tree decl)
2096 const char *name = XSTR (XEXP (DECL_RTL (decl), 0), 0);
2097 targetm.asm_out.assemble_undefined_decl (asm_out_file, name, decl);
2100 /* Assemble everything that is needed for a variable or function declaration.
2101 Not used for automatic variables, and not used for function definitions.
2102 Should not be called for variables of incomplete structure type.
2104 TOP_LEVEL is nonzero if this variable has file scope.
2105 AT_END is nonzero if this is the special handling, at end of compilation,
2106 to define things that have had only tentative definitions.
2107 DONT_OUTPUT_DATA if nonzero means don't actually output the
2108 initial value (that will be done by the caller). */
2110 void
2111 assemble_variable (tree decl, int top_level ATTRIBUTE_UNUSED,
2112 int at_end ATTRIBUTE_UNUSED, int dont_output_data)
2114 const char *name;
2115 rtx decl_rtl, symbol;
2116 section *sect;
2117 unsigned int align;
2118 bool asan_protected = false;
2120 /* This function is supposed to handle VARIABLES. Ensure we have one. */
2121 gcc_assert (VAR_P (decl));
2123 /* Emulated TLS had better not get this far. */
2124 gcc_checking_assert (targetm.have_tls || !DECL_THREAD_LOCAL_P (decl));
2126 last_assemble_variable_decl = 0;
2128 /* Normally no need to say anything here for external references,
2129 since assemble_external is called by the language-specific code
2130 when a declaration is first seen. */
2132 if (DECL_EXTERNAL (decl))
2133 return;
2135 /* Do nothing for global register variables. */
2136 if (DECL_RTL_SET_P (decl) && REG_P (DECL_RTL (decl)))
2138 TREE_ASM_WRITTEN (decl) = 1;
2139 return;
2142 /* If type was incomplete when the variable was declared,
2143 see if it is complete now. */
2145 if (DECL_SIZE (decl) == 0)
2146 layout_decl (decl, 0);
2148 /* Still incomplete => don't allocate it; treat the tentative defn
2149 (which is what it must have been) as an `extern' reference. */
2151 if (!dont_output_data && DECL_SIZE (decl) == 0)
2153 error ("storage size of %q+D isn%'t known", decl);
2154 TREE_ASM_WRITTEN (decl) = 1;
2155 return;
2158 /* The first declaration of a variable that comes through this function
2159 decides whether it is global (in C, has external linkage)
2160 or local (in C, has internal linkage). So do nothing more
2161 if this function has already run. */
2163 if (TREE_ASM_WRITTEN (decl))
2164 return;
2166 /* Make sure targetm.encode_section_info is invoked before we set
2167 ASM_WRITTEN. */
2168 decl_rtl = DECL_RTL (decl);
2170 TREE_ASM_WRITTEN (decl) = 1;
2172 /* Do no output if -fsyntax-only. */
2173 if (flag_syntax_only)
2174 return;
2176 if (! dont_output_data
2177 && ! valid_constant_size_p (DECL_SIZE_UNIT (decl)))
2179 error ("size of variable %q+D is too large", decl);
2180 return;
2183 gcc_assert (MEM_P (decl_rtl));
2184 gcc_assert (GET_CODE (XEXP (decl_rtl, 0)) == SYMBOL_REF);
2185 symbol = XEXP (decl_rtl, 0);
2187 /* If this symbol belongs to the tree constant pool, output the constant
2188 if it hasn't already been written. */
2189 if (TREE_CONSTANT_POOL_ADDRESS_P (symbol))
2191 tree decl = SYMBOL_REF_DECL (symbol);
2192 if (!TREE_ASM_WRITTEN (DECL_INITIAL (decl)))
2193 output_constant_def_contents (symbol);
2194 return;
2197 app_disable ();
2199 name = XSTR (symbol, 0);
2200 if (TREE_PUBLIC (decl) && DECL_NAME (decl))
2201 notice_global_symbol (decl);
2203 /* Compute the alignment of this data. */
2205 align_variable (decl, dont_output_data);
2207 if ((flag_sanitize & SANITIZE_ADDRESS)
2208 && asan_protect_global (decl))
2210 asan_protected = true;
2211 SET_DECL_ALIGN (decl, MAX (DECL_ALIGN (decl),
2212 ASAN_RED_ZONE_SIZE * BITS_PER_UNIT));
2215 set_mem_align (decl_rtl, DECL_ALIGN (decl));
2217 align = get_variable_align (decl);
2219 if (TREE_PUBLIC (decl))
2220 maybe_assemble_visibility (decl);
2222 if (DECL_PRESERVE_P (decl))
2223 targetm.asm_out.mark_decl_preserved (name);
2225 /* First make the assembler name(s) global if appropriate. */
2226 sect = get_variable_section (decl, false);
2227 if (TREE_PUBLIC (decl)
2228 && (sect->common.flags & SECTION_COMMON) == 0)
2229 globalize_decl (decl);
2231 /* Output any data that we will need to use the address of. */
2232 if (DECL_INITIAL (decl) && DECL_INITIAL (decl) != error_mark_node)
2233 output_addressed_constants (DECL_INITIAL (decl));
2235 /* dbxout.c needs to know this. */
2236 if (sect && (sect->common.flags & SECTION_CODE) != 0)
2237 DECL_IN_TEXT_SECTION (decl) = 1;
2239 /* If the decl is part of an object_block, make sure that the decl
2240 has been positioned within its block, but do not write out its
2241 definition yet. output_object_blocks will do that later. */
2242 if (SYMBOL_REF_HAS_BLOCK_INFO_P (symbol) && SYMBOL_REF_BLOCK (symbol))
2244 gcc_assert (!dont_output_data);
2245 place_block_symbol (symbol);
2247 else if (SECTION_STYLE (sect) == SECTION_NOSWITCH)
2248 assemble_noswitch_variable (decl, name, sect, align);
2249 else
2251 /* Special-case handling of vtv comdat sections. */
2252 if (sect->named.name
2253 && (strcmp (sect->named.name, ".vtable_map_vars") == 0))
2254 handle_vtv_comdat_section (sect, decl);
2255 else
2256 switch_to_section (sect);
2257 if (align > BITS_PER_UNIT)
2258 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
2259 assemble_variable_contents (decl, name, dont_output_data);
2260 if (asan_protected)
2262 unsigned HOST_WIDE_INT int size
2263 = tree_to_uhwi (DECL_SIZE_UNIT (decl));
2264 assemble_zeros (asan_red_zone_size (size));
2270 /* Given a function declaration (FN_DECL), this function assembles the
2271 function into the .preinit_array section. */
2273 void
2274 assemble_vtv_preinit_initializer (tree fn_decl)
2276 section *sect;
2277 unsigned flags = SECTION_WRITE;
2278 rtx symbol = XEXP (DECL_RTL (fn_decl), 0);
2280 flags |= SECTION_NOTYPE;
2281 sect = get_section (".preinit_array", flags, fn_decl);
2282 switch_to_section (sect);
2283 assemble_addr_to_section (symbol, sect);
2286 /* Return 1 if type TYPE contains any pointers. */
2288 static int
2289 contains_pointers_p (tree type)
2291 switch (TREE_CODE (type))
2293 case POINTER_TYPE:
2294 case REFERENCE_TYPE:
2295 /* I'm not sure whether OFFSET_TYPE needs this treatment,
2296 so I'll play safe and return 1. */
2297 case OFFSET_TYPE:
2298 return 1;
2300 case RECORD_TYPE:
2301 case UNION_TYPE:
2302 case QUAL_UNION_TYPE:
2304 tree fields;
2305 /* For a type that has fields, see if the fields have pointers. */
2306 for (fields = TYPE_FIELDS (type); fields; fields = DECL_CHAIN (fields))
2307 if (TREE_CODE (fields) == FIELD_DECL
2308 && contains_pointers_p (TREE_TYPE (fields)))
2309 return 1;
2310 return 0;
2313 case ARRAY_TYPE:
2314 /* An array type contains pointers if its element type does. */
2315 return contains_pointers_p (TREE_TYPE (type));
2317 default:
2318 return 0;
2322 /* We delay assemble_external processing until
2323 the compilation unit is finalized. This is the best we can do for
2324 right now (i.e. stage 3 of GCC 4.0) - the right thing is to delay
2325 it all the way to final. See PR 17982 for further discussion. */
2326 static GTY(()) tree pending_assemble_externals;
2328 #ifdef ASM_OUTPUT_EXTERNAL
2329 /* Some targets delay some output to final using TARGET_ASM_FILE_END.
2330 As a result, assemble_external can be called after the list of externals
2331 is processed and the pointer set destroyed. */
2332 static bool pending_assemble_externals_processed;
2334 /* Avoid O(external_decls**2) lookups in the pending_assemble_externals
2335 TREE_LIST in assemble_external. */
2336 static hash_set<tree> *pending_assemble_externals_set;
2338 /* True if DECL is a function decl for which no out-of-line copy exists.
2339 It is assumed that DECL's assembler name has been set. */
2341 static bool
2342 incorporeal_function_p (tree decl)
2344 if (TREE_CODE (decl) == FUNCTION_DECL && DECL_BUILT_IN (decl))
2346 const char *name;
2348 if (DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL
2349 && (DECL_FUNCTION_CODE (decl) == BUILT_IN_ALLOCA
2350 || DECL_FUNCTION_CODE (decl) == BUILT_IN_ALLOCA_WITH_ALIGN))
2351 return true;
2353 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
2354 /* Atomic or sync builtins which have survived this far will be
2355 resolved externally and therefore are not incorporeal. */
2356 if (strncmp (name, "__builtin_", 10) == 0)
2357 return true;
2359 return false;
2362 /* Actually do the tests to determine if this is necessary, and invoke
2363 ASM_OUTPUT_EXTERNAL. */
2364 static void
2365 assemble_external_real (tree decl)
2367 rtx rtl = DECL_RTL (decl);
2369 if (MEM_P (rtl) && GET_CODE (XEXP (rtl, 0)) == SYMBOL_REF
2370 && !SYMBOL_REF_USED (XEXP (rtl, 0))
2371 && !incorporeal_function_p (decl))
2373 /* Some systems do require some output. */
2374 SYMBOL_REF_USED (XEXP (rtl, 0)) = 1;
2375 ASM_OUTPUT_EXTERNAL (asm_out_file, decl, XSTR (XEXP (rtl, 0), 0));
2378 #endif
2380 void
2381 process_pending_assemble_externals (void)
2383 #ifdef ASM_OUTPUT_EXTERNAL
2384 tree list;
2385 for (list = pending_assemble_externals; list; list = TREE_CHAIN (list))
2386 assemble_external_real (TREE_VALUE (list));
2388 pending_assemble_externals = 0;
2389 pending_assemble_externals_processed = true;
2390 delete pending_assemble_externals_set;
2391 #endif
2394 /* This TREE_LIST contains any weak symbol declarations waiting
2395 to be emitted. */
2396 static GTY(()) tree weak_decls;
2398 /* Output something to declare an external symbol to the assembler,
2399 and qualifiers such as weakness. (Most assemblers don't need
2400 extern declaration, so we normally output nothing.) Do nothing if
2401 DECL is not external. */
2403 void
2404 assemble_external (tree decl ATTRIBUTE_UNUSED)
2406 /* Make sure that the ASM_OUT_FILE is open.
2407 If it's not, we should not be calling this function. */
2408 gcc_assert (asm_out_file);
2410 /* In a perfect world, the following condition would be true.
2411 Sadly, the Java and Go front ends emit assembly *from the front end*,
2412 bypassing the call graph. See PR52739. Fix before GCC 4.8. */
2413 #if 0
2414 /* This function should only be called if we are expanding, or have
2415 expanded, to RTL.
2416 Ideally, only final.c would be calling this function, but it is
2417 not clear whether that would break things somehow. See PR 17982
2418 for further discussion. */
2419 gcc_assert (state == EXPANSION
2420 || state == FINISHED);
2421 #endif
2423 if (!DECL_P (decl) || !DECL_EXTERNAL (decl) || !TREE_PUBLIC (decl))
2424 return;
2426 /* We want to output annotation for weak and external symbols at
2427 very last to check if they are references or not. */
2429 if (TARGET_SUPPORTS_WEAK
2430 && DECL_WEAK (decl)
2431 /* TREE_STATIC is a weird and abused creature which is not
2432 generally the right test for whether an entity has been
2433 locally emitted, inlined or otherwise not-really-extern, but
2434 for declarations that can be weak, it happens to be
2435 match. */
2436 && !TREE_STATIC (decl)
2437 && lookup_attribute ("weak", DECL_ATTRIBUTES (decl))
2438 && value_member (decl, weak_decls) == NULL_TREE)
2439 weak_decls = tree_cons (NULL, decl, weak_decls);
2441 #ifdef ASM_OUTPUT_EXTERNAL
2442 if (pending_assemble_externals_processed)
2444 assemble_external_real (decl);
2445 return;
2448 if (! pending_assemble_externals_set->add (decl))
2449 pending_assemble_externals = tree_cons (NULL, decl,
2450 pending_assemble_externals);
2451 #endif
2454 /* Similar, for calling a library function FUN. */
2456 void
2457 assemble_external_libcall (rtx fun)
2459 /* Declare library function name external when first used, if nec. */
2460 if (! SYMBOL_REF_USED (fun))
2462 SYMBOL_REF_USED (fun) = 1;
2463 targetm.asm_out.external_libcall (fun);
2467 /* Assemble a label named NAME. */
2469 void
2470 assemble_label (FILE *file, const char *name)
2472 ASM_OUTPUT_LABEL (file, name);
2475 /* Set the symbol_referenced flag for ID. */
2476 void
2477 mark_referenced (tree id)
2479 TREE_SYMBOL_REFERENCED (id) = 1;
2482 /* Set the symbol_referenced flag for DECL and notify callgraph. */
2483 void
2484 mark_decl_referenced (tree decl)
2486 if (TREE_CODE (decl) == FUNCTION_DECL)
2488 /* Extern inline functions don't become needed when referenced.
2489 If we know a method will be emitted in other TU and no new
2490 functions can be marked reachable, just use the external
2491 definition. */
2492 struct cgraph_node *node = cgraph_node::get_create (decl);
2493 if (!DECL_EXTERNAL (decl)
2494 && !node->definition)
2495 node->mark_force_output ();
2497 else if (VAR_P (decl))
2499 varpool_node *node = varpool_node::get_create (decl);
2500 /* C++ frontend use mark_decl_references to force COMDAT variables
2501 to be output that might appear dead otherwise. */
2502 node->force_output = true;
2504 /* else do nothing - we can get various sorts of CST nodes here,
2505 which do not need to be marked. */
2509 /* Output to FILE (an assembly file) a reference to NAME. If NAME
2510 starts with a *, the rest of NAME is output verbatim. Otherwise
2511 NAME is transformed in a target-specific way (usually by the
2512 addition of an underscore). */
2514 void
2515 assemble_name_raw (FILE *file, const char *name)
2517 if (name[0] == '*')
2518 fputs (&name[1], file);
2519 else
2520 ASM_OUTPUT_LABELREF (file, name);
2523 /* Like assemble_name_raw, but should be used when NAME might refer to
2524 an entity that is also represented as a tree (like a function or
2525 variable). If NAME does refer to such an entity, that entity will
2526 be marked as referenced. */
2528 void
2529 assemble_name (FILE *file, const char *name)
2531 const char *real_name;
2532 tree id;
2534 real_name = targetm.strip_name_encoding (name);
2536 id = maybe_get_identifier (real_name);
2537 if (id)
2539 tree id_orig = id;
2541 mark_referenced (id);
2542 ultimate_transparent_alias_target (&id);
2543 if (id != id_orig)
2544 name = IDENTIFIER_POINTER (id);
2545 gcc_assert (! TREE_CHAIN (id));
2548 assemble_name_raw (file, name);
2551 /* Allocate SIZE bytes writable static space with a gensym name
2552 and return an RTX to refer to its address. */
2555 assemble_static_space (unsigned HOST_WIDE_INT size)
2557 char name[17];
2558 const char *namestring;
2559 rtx x;
2561 ASM_GENERATE_INTERNAL_LABEL (name, "LF", const_labelno);
2562 ++const_labelno;
2563 namestring = ggc_strdup (name);
2565 x = gen_rtx_SYMBOL_REF (Pmode, namestring);
2566 SYMBOL_REF_FLAGS (x) = SYMBOL_FLAG_LOCAL;
2568 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
2569 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, NULL_TREE, name, size,
2570 BIGGEST_ALIGNMENT);
2571 #else
2572 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
2573 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, BIGGEST_ALIGNMENT);
2574 #else
2576 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
2577 so that each uninitialized object starts on such a boundary. */
2578 /* Variable `rounded' might or might not be used in ASM_OUTPUT_LOCAL. */
2579 unsigned HOST_WIDE_INT rounded ATTRIBUTE_UNUSED
2580 = ((size + (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1)
2581 / (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
2582 * (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
2583 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded);
2585 #endif
2586 #endif
2587 return x;
2590 /* Assemble the static constant template for function entry trampolines.
2591 This is done at most once per compilation.
2592 Returns an RTX for the address of the template. */
2594 static GTY(()) rtx initial_trampoline;
2597 assemble_trampoline_template (void)
2599 char label[256];
2600 const char *name;
2601 int align;
2602 rtx symbol;
2604 gcc_assert (targetm.asm_out.trampoline_template != NULL);
2606 if (initial_trampoline)
2607 return initial_trampoline;
2609 /* By default, put trampoline templates in read-only data section. */
2611 #ifdef TRAMPOLINE_SECTION
2612 switch_to_section (TRAMPOLINE_SECTION);
2613 #else
2614 switch_to_section (readonly_data_section);
2615 #endif
2617 /* Write the assembler code to define one. */
2618 align = floor_log2 (TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT);
2619 if (align > 0)
2620 ASM_OUTPUT_ALIGN (asm_out_file, align);
2622 targetm.asm_out.internal_label (asm_out_file, "LTRAMP", 0);
2623 targetm.asm_out.trampoline_template (asm_out_file);
2625 /* Record the rtl to refer to it. */
2626 ASM_GENERATE_INTERNAL_LABEL (label, "LTRAMP", 0);
2627 name = ggc_strdup (label);
2628 symbol = gen_rtx_SYMBOL_REF (Pmode, name);
2629 SYMBOL_REF_FLAGS (symbol) = SYMBOL_FLAG_LOCAL;
2631 initial_trampoline = gen_const_mem (BLKmode, symbol);
2632 set_mem_align (initial_trampoline, TRAMPOLINE_ALIGNMENT);
2633 set_mem_size (initial_trampoline, TRAMPOLINE_SIZE);
2635 return initial_trampoline;
2638 /* A and B are either alignments or offsets. Return the minimum alignment
2639 that may be assumed after adding the two together. */
2641 static inline unsigned
2642 min_align (unsigned int a, unsigned int b)
2644 return least_bit_hwi (a | b);
2647 /* Return the assembler directive for creating a given kind of integer
2648 object. SIZE is the number of bytes in the object and ALIGNED_P
2649 indicates whether it is known to be aligned. Return NULL if the
2650 assembly dialect has no such directive.
2652 The returned string should be printed at the start of a new line and
2653 be followed immediately by the object's initial value. */
2655 const char *
2656 integer_asm_op (int size, int aligned_p)
2658 struct asm_int_op *ops;
2660 if (aligned_p)
2661 ops = &targetm.asm_out.aligned_op;
2662 else
2663 ops = &targetm.asm_out.unaligned_op;
2665 switch (size)
2667 case 1:
2668 return targetm.asm_out.byte_op;
2669 case 2:
2670 return ops->hi;
2671 case 4:
2672 return ops->si;
2673 case 8:
2674 return ops->di;
2675 case 16:
2676 return ops->ti;
2677 default:
2678 return NULL;
2682 /* Use directive OP to assemble an integer object X. Print OP at the
2683 start of the line, followed immediately by the value of X. */
2685 void
2686 assemble_integer_with_op (const char *op, rtx x)
2688 fputs (op, asm_out_file);
2689 output_addr_const (asm_out_file, x);
2690 fputc ('\n', asm_out_file);
2693 /* The default implementation of the asm_out.integer target hook. */
2695 bool
2696 default_assemble_integer (rtx x ATTRIBUTE_UNUSED,
2697 unsigned int size ATTRIBUTE_UNUSED,
2698 int aligned_p ATTRIBUTE_UNUSED)
2700 const char *op = integer_asm_op (size, aligned_p);
2701 /* Avoid GAS bugs for large values. Specifically negative values whose
2702 absolute value fits in a bfd_vma, but not in a bfd_signed_vma. */
2703 if (size > UNITS_PER_WORD && size > POINTER_SIZE_UNITS)
2704 return false;
2705 return op && (assemble_integer_with_op (op, x), true);
2708 /* Assemble the integer constant X into an object of SIZE bytes. ALIGN is
2709 the alignment of the integer in bits. Return 1 if we were able to output
2710 the constant, otherwise 0. We must be able to output the constant,
2711 if FORCE is nonzero. */
2713 bool
2714 assemble_integer (rtx x, unsigned int size, unsigned int align, int force)
2716 int aligned_p;
2718 aligned_p = (align >= MIN (size * BITS_PER_UNIT, BIGGEST_ALIGNMENT));
2720 /* See if the target hook can handle this kind of object. */
2721 if (targetm.asm_out.integer (x, size, aligned_p))
2722 return true;
2724 /* If the object is a multi-byte one, try splitting it up. Split
2725 it into words it if is multi-word, otherwise split it into bytes. */
2726 if (size > 1)
2728 machine_mode omode, imode;
2729 unsigned int subalign;
2730 unsigned int subsize, i;
2731 enum mode_class mclass;
2733 subsize = size > UNITS_PER_WORD? UNITS_PER_WORD : 1;
2734 subalign = MIN (align, subsize * BITS_PER_UNIT);
2735 if (GET_CODE (x) == CONST_FIXED)
2736 mclass = GET_MODE_CLASS (GET_MODE (x));
2737 else
2738 mclass = MODE_INT;
2740 omode = mode_for_size (subsize * BITS_PER_UNIT, mclass, 0);
2741 imode = mode_for_size (size * BITS_PER_UNIT, mclass, 0);
2743 for (i = 0; i < size; i += subsize)
2745 rtx partial = simplify_subreg (omode, x, imode, i);
2746 if (!partial || !assemble_integer (partial, subsize, subalign, 0))
2747 break;
2749 if (i == size)
2750 return true;
2752 /* If we've printed some of it, but not all of it, there's no going
2753 back now. */
2754 gcc_assert (!i);
2757 gcc_assert (!force);
2759 return false;
2762 /* Assemble the floating-point constant D into an object of size MODE. ALIGN
2763 is the alignment of the constant in bits. If REVERSE is true, D is output
2764 in reverse storage order. */
2766 void
2767 assemble_real (REAL_VALUE_TYPE d, machine_mode mode, unsigned int align,
2768 bool reverse)
2770 long data[4] = {0, 0, 0, 0};
2771 int bitsize, nelts, nunits, units_per;
2772 rtx elt;
2774 /* This is hairy. We have a quantity of known size. real_to_target
2775 will put it into an array of *host* longs, 32 bits per element
2776 (even if long is more than 32 bits). We need to determine the
2777 number of array elements that are occupied (nelts) and the number
2778 of *target* min-addressable units that will be occupied in the
2779 object file (nunits). We cannot assume that 32 divides the
2780 mode's bitsize (size * BITS_PER_UNIT) evenly.
2782 size * BITS_PER_UNIT is used here to make sure that padding bits
2783 (which might appear at either end of the value; real_to_target
2784 will include the padding bits in its output array) are included. */
2786 nunits = GET_MODE_SIZE (mode);
2787 bitsize = nunits * BITS_PER_UNIT;
2788 nelts = CEIL (bitsize, 32);
2789 units_per = 32 / BITS_PER_UNIT;
2791 real_to_target (data, &d, mode);
2793 /* Put out the first word with the specified alignment. */
2794 if (reverse)
2795 elt = flip_storage_order (SImode, gen_int_mode (data[nelts - 1], SImode));
2796 else
2797 elt = GEN_INT (data[0]);
2798 assemble_integer (elt, MIN (nunits, units_per), align, 1);
2799 nunits -= units_per;
2801 /* Subsequent words need only 32-bit alignment. */
2802 align = min_align (align, 32);
2804 for (int i = 1; i < nelts; i++)
2806 if (reverse)
2807 elt = flip_storage_order (SImode,
2808 gen_int_mode (data[nelts - 1 - i], SImode));
2809 else
2810 elt = GEN_INT (data[i]);
2811 assemble_integer (elt, MIN (nunits, units_per), align, 1);
2812 nunits -= units_per;
2816 /* Given an expression EXP with a constant value,
2817 reduce it to the sum of an assembler symbol and an integer.
2818 Store them both in the structure *VALUE.
2819 EXP must be reducible. */
2821 struct addr_const {
2822 rtx base;
2823 HOST_WIDE_INT offset;
2826 static void
2827 decode_addr_const (tree exp, struct addr_const *value)
2829 tree target = TREE_OPERAND (exp, 0);
2830 int offset = 0;
2831 rtx x;
2833 while (1)
2835 if (TREE_CODE (target) == COMPONENT_REF
2836 && tree_fits_shwi_p (byte_position (TREE_OPERAND (target, 1))))
2838 offset += int_byte_position (TREE_OPERAND (target, 1));
2839 target = TREE_OPERAND (target, 0);
2841 else if (TREE_CODE (target) == ARRAY_REF
2842 || TREE_CODE (target) == ARRAY_RANGE_REF)
2844 offset += (tree_to_uhwi (TYPE_SIZE_UNIT (TREE_TYPE (target)))
2845 * tree_to_shwi (TREE_OPERAND (target, 1)));
2846 target = TREE_OPERAND (target, 0);
2848 else if (TREE_CODE (target) == MEM_REF
2849 && TREE_CODE (TREE_OPERAND (target, 0)) == ADDR_EXPR)
2851 offset += mem_ref_offset (target).to_short_addr ();
2852 target = TREE_OPERAND (TREE_OPERAND (target, 0), 0);
2854 else if (TREE_CODE (target) == INDIRECT_REF
2855 && TREE_CODE (TREE_OPERAND (target, 0)) == NOP_EXPR
2856 && TREE_CODE (TREE_OPERAND (TREE_OPERAND (target, 0), 0))
2857 == ADDR_EXPR)
2858 target = TREE_OPERAND (TREE_OPERAND (TREE_OPERAND (target, 0), 0), 0);
2859 else
2860 break;
2863 switch (TREE_CODE (target))
2865 case VAR_DECL:
2866 case FUNCTION_DECL:
2867 x = DECL_RTL (target);
2868 break;
2870 case LABEL_DECL:
2871 x = gen_rtx_MEM (FUNCTION_MODE,
2872 gen_rtx_LABEL_REF (Pmode, force_label_rtx (target)));
2873 break;
2875 case REAL_CST:
2876 case FIXED_CST:
2877 case STRING_CST:
2878 case COMPLEX_CST:
2879 case CONSTRUCTOR:
2880 case INTEGER_CST:
2881 x = output_constant_def (target, 1);
2882 break;
2884 default:
2885 gcc_unreachable ();
2888 gcc_assert (MEM_P (x));
2889 x = XEXP (x, 0);
2891 value->base = x;
2892 value->offset = offset;
2895 static GTY(()) hash_table<tree_descriptor_hasher> *const_desc_htab;
2897 static void maybe_output_constant_def_contents (struct constant_descriptor_tree *, int);
2899 /* Constant pool accessor function. */
2901 hash_table<tree_descriptor_hasher> *
2902 constant_pool_htab (void)
2904 return const_desc_htab;
2907 /* Compute a hash code for a constant expression. */
2909 hashval_t
2910 tree_descriptor_hasher::hash (constant_descriptor_tree *ptr)
2912 return ptr->hash;
2915 static hashval_t
2916 const_hash_1 (const tree exp)
2918 const char *p;
2919 hashval_t hi;
2920 int len, i;
2921 enum tree_code code = TREE_CODE (exp);
2923 /* Either set P and LEN to the address and len of something to hash and
2924 exit the switch or return a value. */
2926 switch (code)
2928 case INTEGER_CST:
2929 p = (char *) &TREE_INT_CST_ELT (exp, 0);
2930 len = TREE_INT_CST_NUNITS (exp) * sizeof (HOST_WIDE_INT);
2931 break;
2933 case REAL_CST:
2934 return real_hash (TREE_REAL_CST_PTR (exp));
2936 case FIXED_CST:
2937 return fixed_hash (TREE_FIXED_CST_PTR (exp));
2939 case STRING_CST:
2940 p = TREE_STRING_POINTER (exp);
2941 len = TREE_STRING_LENGTH (exp);
2942 break;
2944 case COMPLEX_CST:
2945 return (const_hash_1 (TREE_REALPART (exp)) * 5
2946 + const_hash_1 (TREE_IMAGPART (exp)));
2948 case VECTOR_CST:
2950 unsigned i;
2952 hi = 7 + VECTOR_CST_NELTS (exp);
2954 for (i = 0; i < VECTOR_CST_NELTS (exp); ++i)
2955 hi = hi * 563 + const_hash_1 (VECTOR_CST_ELT (exp, i));
2957 return hi;
2960 case CONSTRUCTOR:
2962 unsigned HOST_WIDE_INT idx;
2963 tree value;
2965 hi = 5 + int_size_in_bytes (TREE_TYPE (exp));
2967 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (exp), idx, value)
2968 if (value)
2969 hi = hi * 603 + const_hash_1 (value);
2971 return hi;
2974 case ADDR_EXPR:
2975 case FDESC_EXPR:
2977 struct addr_const value;
2979 decode_addr_const (exp, &value);
2980 switch (GET_CODE (value.base))
2982 case SYMBOL_REF:
2983 /* Don't hash the address of the SYMBOL_REF;
2984 only use the offset and the symbol name. */
2985 hi = value.offset;
2986 p = XSTR (value.base, 0);
2987 for (i = 0; p[i] != 0; i++)
2988 hi = ((hi * 613) + (unsigned) (p[i]));
2989 break;
2991 case LABEL_REF:
2992 hi = (value.offset
2993 + CODE_LABEL_NUMBER (label_ref_label (value.base)) * 13);
2994 break;
2996 default:
2997 gcc_unreachable ();
3000 return hi;
3002 case PLUS_EXPR:
3003 case POINTER_PLUS_EXPR:
3004 case MINUS_EXPR:
3005 return (const_hash_1 (TREE_OPERAND (exp, 0)) * 9
3006 + const_hash_1 (TREE_OPERAND (exp, 1)));
3008 CASE_CONVERT:
3009 return const_hash_1 (TREE_OPERAND (exp, 0)) * 7 + 2;
3011 default:
3012 /* A language specific constant. Just hash the code. */
3013 return code;
3016 /* Compute hashing function. */
3017 hi = len;
3018 for (i = 0; i < len; i++)
3019 hi = ((hi * 613) + (unsigned) (p[i]));
3021 return hi;
3024 /* Wrapper of compare_constant, for the htab interface. */
3025 bool
3026 tree_descriptor_hasher::equal (constant_descriptor_tree *c1,
3027 constant_descriptor_tree *c2)
3029 if (c1->hash != c2->hash)
3030 return 0;
3031 return compare_constant (c1->value, c2->value);
3034 /* Compare t1 and t2, and return 1 only if they are known to result in
3035 the same bit pattern on output. */
3037 static int
3038 compare_constant (const tree t1, const tree t2)
3040 enum tree_code typecode;
3042 if (t1 == NULL_TREE)
3043 return t2 == NULL_TREE;
3044 if (t2 == NULL_TREE)
3045 return 0;
3047 if (TREE_CODE (t1) != TREE_CODE (t2))
3048 return 0;
3050 switch (TREE_CODE (t1))
3052 case INTEGER_CST:
3053 /* Integer constants are the same only if the same width of type. */
3054 if (TYPE_PRECISION (TREE_TYPE (t1)) != TYPE_PRECISION (TREE_TYPE (t2)))
3055 return 0;
3056 if (TYPE_MODE (TREE_TYPE (t1)) != TYPE_MODE (TREE_TYPE (t2)))
3057 return 0;
3058 return tree_int_cst_equal (t1, t2);
3060 case REAL_CST:
3061 /* Real constants are the same only if the same width of type. */
3062 if (TYPE_PRECISION (TREE_TYPE (t1)) != TYPE_PRECISION (TREE_TYPE (t2)))
3063 return 0;
3065 return real_identical (&TREE_REAL_CST (t1), &TREE_REAL_CST (t2));
3067 case FIXED_CST:
3068 /* Fixed constants are the same only if the same width of type. */
3069 if (TYPE_PRECISION (TREE_TYPE (t1)) != TYPE_PRECISION (TREE_TYPE (t2)))
3070 return 0;
3072 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1), TREE_FIXED_CST (t2));
3074 case STRING_CST:
3075 if (TYPE_MODE (TREE_TYPE (t1)) != TYPE_MODE (TREE_TYPE (t2)))
3076 return 0;
3078 return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
3079 && ! memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
3080 TREE_STRING_LENGTH (t1)));
3082 case COMPLEX_CST:
3083 return (compare_constant (TREE_REALPART (t1), TREE_REALPART (t2))
3084 && compare_constant (TREE_IMAGPART (t1), TREE_IMAGPART (t2)));
3086 case VECTOR_CST:
3088 unsigned i;
3090 if (VECTOR_CST_NELTS (t1) != VECTOR_CST_NELTS (t2))
3091 return 0;
3093 for (i = 0; i < VECTOR_CST_NELTS (t1); ++i)
3094 if (!compare_constant (VECTOR_CST_ELT (t1, i),
3095 VECTOR_CST_ELT (t2, i)))
3096 return 0;
3098 return 1;
3101 case CONSTRUCTOR:
3103 vec<constructor_elt, va_gc> *v1, *v2;
3104 unsigned HOST_WIDE_INT idx;
3106 typecode = TREE_CODE (TREE_TYPE (t1));
3107 if (typecode != TREE_CODE (TREE_TYPE (t2)))
3108 return 0;
3110 if (typecode == ARRAY_TYPE)
3112 HOST_WIDE_INT size_1 = int_size_in_bytes (TREE_TYPE (t1));
3113 /* For arrays, check that mode, size and storage order match. */
3114 if (TYPE_MODE (TREE_TYPE (t1)) != TYPE_MODE (TREE_TYPE (t2))
3115 || size_1 == -1
3116 || size_1 != int_size_in_bytes (TREE_TYPE (t2))
3117 || TYPE_REVERSE_STORAGE_ORDER (TREE_TYPE (t1))
3118 != TYPE_REVERSE_STORAGE_ORDER (TREE_TYPE (t2)))
3119 return 0;
3121 else
3123 /* For record and union constructors, require exact type
3124 equality. */
3125 if (TREE_TYPE (t1) != TREE_TYPE (t2))
3126 return 0;
3129 v1 = CONSTRUCTOR_ELTS (t1);
3130 v2 = CONSTRUCTOR_ELTS (t2);
3131 if (vec_safe_length (v1) != vec_safe_length (v2))
3132 return 0;
3134 for (idx = 0; idx < vec_safe_length (v1); ++idx)
3136 constructor_elt *c1 = &(*v1)[idx];
3137 constructor_elt *c2 = &(*v2)[idx];
3139 /* Check that each value is the same... */
3140 if (!compare_constant (c1->value, c2->value))
3141 return 0;
3142 /* ... and that they apply to the same fields! */
3143 if (typecode == ARRAY_TYPE)
3145 if (!compare_constant (c1->index, c2->index))
3146 return 0;
3148 else
3150 if (c1->index != c2->index)
3151 return 0;
3155 return 1;
3158 case ADDR_EXPR:
3159 case FDESC_EXPR:
3161 struct addr_const value1, value2;
3162 enum rtx_code code;
3163 int ret;
3165 decode_addr_const (t1, &value1);
3166 decode_addr_const (t2, &value2);
3168 if (value1.offset != value2.offset)
3169 return 0;
3171 code = GET_CODE (value1.base);
3172 if (code != GET_CODE (value2.base))
3173 return 0;
3175 switch (code)
3177 case SYMBOL_REF:
3178 ret = (strcmp (XSTR (value1.base, 0), XSTR (value2.base, 0)) == 0);
3179 break;
3181 case LABEL_REF:
3182 ret = (CODE_LABEL_NUMBER (label_ref_label (value1.base))
3183 == CODE_LABEL_NUMBER (label_ref_label (value2.base)));
3184 break;
3186 default:
3187 gcc_unreachable ();
3189 return ret;
3192 case PLUS_EXPR:
3193 case POINTER_PLUS_EXPR:
3194 case MINUS_EXPR:
3195 case RANGE_EXPR:
3196 return (compare_constant (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0))
3197 && compare_constant (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1)));
3199 CASE_CONVERT:
3200 case VIEW_CONVERT_EXPR:
3201 return compare_constant (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3203 default:
3204 return 0;
3207 gcc_unreachable ();
3210 /* Return the section into which constant EXP should be placed. */
3212 static section *
3213 get_constant_section (tree exp, unsigned int align)
3215 return targetm.asm_out.select_section (exp,
3216 compute_reloc_for_constant (exp),
3217 align);
3220 /* Return the size of constant EXP in bytes. */
3222 static HOST_WIDE_INT
3223 get_constant_size (tree exp)
3225 HOST_WIDE_INT size;
3227 size = int_size_in_bytes (TREE_TYPE (exp));
3228 if (TREE_CODE (exp) == STRING_CST)
3229 size = MAX (TREE_STRING_LENGTH (exp), size);
3230 return size;
3233 /* Subroutine of output_constant_def:
3234 No constant equal to EXP is known to have been output.
3235 Make a constant descriptor to enter EXP in the hash table.
3236 Assign the label number and construct RTL to refer to the
3237 constant's location in memory.
3238 Caller is responsible for updating the hash table. */
3240 static struct constant_descriptor_tree *
3241 build_constant_desc (tree exp)
3243 struct constant_descriptor_tree *desc;
3244 rtx symbol, rtl;
3245 char label[256];
3246 int labelno;
3247 tree decl;
3249 desc = ggc_alloc<constant_descriptor_tree> ();
3250 desc->value = exp;
3252 /* Create a string containing the label name, in LABEL. */
3253 labelno = const_labelno++;
3254 ASM_GENERATE_INTERNAL_LABEL (label, "LC", labelno);
3256 /* Construct the VAR_DECL associated with the constant. */
3257 decl = build_decl (UNKNOWN_LOCATION, VAR_DECL, get_identifier (label),
3258 TREE_TYPE (exp));
3259 DECL_ARTIFICIAL (decl) = 1;
3260 DECL_IGNORED_P (decl) = 1;
3261 TREE_READONLY (decl) = 1;
3262 TREE_STATIC (decl) = 1;
3263 TREE_ADDRESSABLE (decl) = 1;
3264 /* We don't set the RTL yet as this would cause varpool to assume that the
3265 variable is referenced. Moreover, it would just be dropped in LTO mode.
3266 Instead we set the flag that will be recognized in make_decl_rtl. */
3267 DECL_IN_CONSTANT_POOL (decl) = 1;
3268 DECL_INITIAL (decl) = desc->value;
3269 /* ??? CONSTANT_ALIGNMENT hasn't been updated for vector types on most
3270 architectures so use DATA_ALIGNMENT as well, except for strings. */
3271 if (TREE_CODE (exp) == STRING_CST)
3273 SET_DECL_ALIGN (decl, CONSTANT_ALIGNMENT (exp, DECL_ALIGN (decl)));
3275 else
3276 align_variable (decl, 0);
3278 /* Now construct the SYMBOL_REF and the MEM. */
3279 if (use_object_blocks_p ())
3281 int align = (TREE_CODE (decl) == CONST_DECL
3282 || (VAR_P (decl) && DECL_IN_CONSTANT_POOL (decl))
3283 ? DECL_ALIGN (decl)
3284 : symtab_node::get (decl)->definition_alignment ());
3285 section *sect = get_constant_section (exp, align);
3286 symbol = create_block_symbol (ggc_strdup (label),
3287 get_block_for_section (sect), -1);
3289 else
3290 symbol = gen_rtx_SYMBOL_REF (Pmode, ggc_strdup (label));
3291 SYMBOL_REF_FLAGS (symbol) |= SYMBOL_FLAG_LOCAL;
3292 SET_SYMBOL_REF_DECL (symbol, decl);
3293 TREE_CONSTANT_POOL_ADDRESS_P (symbol) = 1;
3295 rtl = gen_const_mem (TYPE_MODE (TREE_TYPE (exp)), symbol);
3296 set_mem_attributes (rtl, exp, 1);
3297 set_mem_alias_set (rtl, 0);
3299 /* Putting EXP into the literal pool might have imposed a different
3300 alignment which should be visible in the RTX as well. */
3301 set_mem_align (rtl, DECL_ALIGN (decl));
3303 /* We cannot share RTX'es in pool entries.
3304 Mark this piece of RTL as required for unsharing. */
3305 RTX_FLAG (rtl, used) = 1;
3307 /* Set flags or add text to the name to record information, such as
3308 that it is a local symbol. If the name is changed, the macro
3309 ASM_OUTPUT_LABELREF will have to know how to strip this
3310 information. This call might invalidate our local variable
3311 SYMBOL; we can't use it afterward. */
3312 targetm.encode_section_info (exp, rtl, true);
3314 desc->rtl = rtl;
3316 return desc;
3319 /* Return an rtx representing a reference to constant data in memory
3320 for the constant expression EXP.
3322 If assembler code for such a constant has already been output,
3323 return an rtx to refer to it.
3324 Otherwise, output such a constant in memory
3325 and generate an rtx for it.
3327 If DEFER is nonzero, this constant can be deferred and output only
3328 if referenced in the function after all optimizations.
3330 `const_desc_table' records which constants already have label strings. */
3333 output_constant_def (tree exp, int defer)
3335 struct constant_descriptor_tree *desc;
3336 struct constant_descriptor_tree key;
3338 /* Look up EXP in the table of constant descriptors. If we didn't find
3339 it, create a new one. */
3340 key.value = exp;
3341 key.hash = const_hash_1 (exp);
3342 constant_descriptor_tree **loc
3343 = const_desc_htab->find_slot_with_hash (&key, key.hash, INSERT);
3345 desc = *loc;
3346 if (desc == 0)
3348 desc = build_constant_desc (exp);
3349 desc->hash = key.hash;
3350 *loc = desc;
3353 maybe_output_constant_def_contents (desc, defer);
3354 return desc->rtl;
3357 /* Subroutine of output_constant_def: Decide whether or not we need to
3358 output the constant DESC now, and if so, do it. */
3359 static void
3360 maybe_output_constant_def_contents (struct constant_descriptor_tree *desc,
3361 int defer)
3363 rtx symbol = XEXP (desc->rtl, 0);
3364 tree exp = desc->value;
3366 if (flag_syntax_only)
3367 return;
3369 if (TREE_ASM_WRITTEN (exp))
3370 /* Already output; don't do it again. */
3371 return;
3373 /* We can always defer constants as long as the context allows
3374 doing so. */
3375 if (defer)
3377 /* Increment n_deferred_constants if it exists. It needs to be at
3378 least as large as the number of constants actually referred to
3379 by the function. If it's too small we'll stop looking too early
3380 and fail to emit constants; if it's too large we'll only look
3381 through the entire function when we could have stopped earlier. */
3382 if (cfun)
3383 n_deferred_constants++;
3384 return;
3387 output_constant_def_contents (symbol);
3390 /* Subroutine of output_constant_def_contents. Output the definition
3391 of constant EXP, which is pointed to by label LABEL. ALIGN is the
3392 constant's alignment in bits. */
3394 static void
3395 assemble_constant_contents (tree exp, const char *label, unsigned int align)
3397 HOST_WIDE_INT size;
3399 size = get_constant_size (exp);
3401 /* Do any machine/system dependent processing of the constant. */
3402 targetm.asm_out.declare_constant_name (asm_out_file, label, exp, size);
3404 /* Output the value of EXP. */
3405 output_constant (exp, size, align, false);
3407 targetm.asm_out.decl_end ();
3410 /* We must output the constant data referred to by SYMBOL; do so. */
3412 static void
3413 output_constant_def_contents (rtx symbol)
3415 tree decl = SYMBOL_REF_DECL (symbol);
3416 tree exp = DECL_INITIAL (decl);
3417 bool asan_protected = false;
3419 /* Make sure any other constants whose addresses appear in EXP
3420 are assigned label numbers. */
3421 output_addressed_constants (exp);
3423 /* We are no longer deferring this constant. */
3424 TREE_ASM_WRITTEN (decl) = TREE_ASM_WRITTEN (exp) = 1;
3426 if ((flag_sanitize & SANITIZE_ADDRESS)
3427 && TREE_CODE (exp) == STRING_CST
3428 && asan_protect_global (exp))
3430 asan_protected = true;
3431 SET_DECL_ALIGN (decl, MAX (DECL_ALIGN (decl),
3432 ASAN_RED_ZONE_SIZE * BITS_PER_UNIT));
3435 /* If the constant is part of an object block, make sure that the
3436 decl has been positioned within its block, but do not write out
3437 its definition yet. output_object_blocks will do that later. */
3438 if (SYMBOL_REF_HAS_BLOCK_INFO_P (symbol) && SYMBOL_REF_BLOCK (symbol))
3439 place_block_symbol (symbol);
3440 else
3442 int align = (TREE_CODE (decl) == CONST_DECL
3443 || (VAR_P (decl) && DECL_IN_CONSTANT_POOL (decl))
3444 ? DECL_ALIGN (decl)
3445 : symtab_node::get (decl)->definition_alignment ());
3446 switch_to_section (get_constant_section (exp, align));
3447 if (align > BITS_PER_UNIT)
3448 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
3449 assemble_constant_contents (exp, XSTR (symbol, 0), align);
3450 if (asan_protected)
3452 HOST_WIDE_INT size = get_constant_size (exp);
3453 assemble_zeros (asan_red_zone_size (size));
3458 /* Look up EXP in the table of constant descriptors. Return the rtl
3459 if it has been emitted, else null. */
3462 lookup_constant_def (tree exp)
3464 struct constant_descriptor_tree key;
3466 key.value = exp;
3467 key.hash = const_hash_1 (exp);
3468 constant_descriptor_tree *desc
3469 = const_desc_htab->find_with_hash (&key, key.hash);
3471 return (desc ? desc->rtl : NULL_RTX);
3474 /* Return a tree representing a reference to constant data in memory
3475 for the constant expression EXP.
3477 This is the counterpart of output_constant_def at the Tree level. */
3479 tree
3480 tree_output_constant_def (tree exp)
3482 struct constant_descriptor_tree *desc, key;
3483 tree decl;
3485 /* Look up EXP in the table of constant descriptors. If we didn't find
3486 it, create a new one. */
3487 key.value = exp;
3488 key.hash = const_hash_1 (exp);
3489 constant_descriptor_tree **loc
3490 = const_desc_htab->find_slot_with_hash (&key, key.hash, INSERT);
3492 desc = *loc;
3493 if (desc == 0)
3495 desc = build_constant_desc (exp);
3496 desc->hash = key.hash;
3497 *loc = desc;
3500 decl = SYMBOL_REF_DECL (XEXP (desc->rtl, 0));
3501 varpool_node::finalize_decl (decl);
3502 return decl;
3505 struct GTY((chain_next ("%h.next"), for_user)) constant_descriptor_rtx {
3506 struct constant_descriptor_rtx *next;
3507 rtx mem;
3508 rtx sym;
3509 rtx constant;
3510 HOST_WIDE_INT offset;
3511 hashval_t hash;
3512 machine_mode mode;
3513 unsigned int align;
3514 int labelno;
3515 int mark;
3518 struct const_rtx_desc_hasher : ggc_ptr_hash<constant_descriptor_rtx>
3520 static hashval_t hash (constant_descriptor_rtx *);
3521 static bool equal (constant_descriptor_rtx *, constant_descriptor_rtx *);
3524 /* Used in the hash tables to avoid outputting the same constant
3525 twice. Unlike 'struct constant_descriptor_tree', RTX constants
3526 are output once per function, not once per file. */
3527 /* ??? Only a few targets need per-function constant pools. Most
3528 can use one per-file pool. Should add a targetm bit to tell the
3529 difference. */
3531 struct GTY(()) rtx_constant_pool {
3532 /* Pointers to first and last constant in pool, as ordered by offset. */
3533 struct constant_descriptor_rtx *first;
3534 struct constant_descriptor_rtx *last;
3536 /* Hash facility for making memory-constants from constant rtl-expressions.
3537 It is used on RISC machines where immediate integer arguments and
3538 constant addresses are restricted so that such constants must be stored
3539 in memory. */
3540 hash_table<const_rtx_desc_hasher> *const_rtx_htab;
3542 /* Current offset in constant pool (does not include any
3543 machine-specific header). */
3544 HOST_WIDE_INT offset;
3547 /* Hash and compare functions for const_rtx_htab. */
3549 hashval_t
3550 const_rtx_desc_hasher::hash (constant_descriptor_rtx *desc)
3552 return desc->hash;
3555 bool
3556 const_rtx_desc_hasher::equal (constant_descriptor_rtx *x,
3557 constant_descriptor_rtx *y)
3559 if (x->mode != y->mode)
3560 return 0;
3561 return rtx_equal_p (x->constant, y->constant);
3564 /* Hash one component of a constant. */
3566 static hashval_t
3567 const_rtx_hash_1 (const_rtx x)
3569 unsigned HOST_WIDE_INT hwi;
3570 machine_mode mode;
3571 enum rtx_code code;
3572 hashval_t h;
3573 int i;
3575 code = GET_CODE (x);
3576 mode = GET_MODE (x);
3577 h = (hashval_t) code * 1048573 + mode;
3579 switch (code)
3581 case CONST_INT:
3582 hwi = INTVAL (x);
3584 fold_hwi:
3586 int shift = sizeof (hashval_t) * CHAR_BIT;
3587 const int n = sizeof (HOST_WIDE_INT) / sizeof (hashval_t);
3589 h ^= (hashval_t) hwi;
3590 for (i = 1; i < n; ++i)
3592 hwi >>= shift;
3593 h ^= (hashval_t) hwi;
3596 break;
3598 case CONST_WIDE_INT:
3599 hwi = GET_MODE_PRECISION (mode);
3601 for (i = 0; i < CONST_WIDE_INT_NUNITS (x); i++)
3602 hwi ^= CONST_WIDE_INT_ELT (x, i);
3603 goto fold_hwi;
3606 case CONST_DOUBLE:
3607 if (TARGET_SUPPORTS_WIDE_INT == 0 && mode == VOIDmode)
3609 hwi = CONST_DOUBLE_LOW (x) ^ CONST_DOUBLE_HIGH (x);
3610 goto fold_hwi;
3612 else
3613 h ^= real_hash (CONST_DOUBLE_REAL_VALUE (x));
3614 break;
3616 case CONST_FIXED:
3617 h ^= fixed_hash (CONST_FIXED_VALUE (x));
3618 break;
3620 case SYMBOL_REF:
3621 h ^= htab_hash_string (XSTR (x, 0));
3622 break;
3624 case LABEL_REF:
3625 h = h * 251 + CODE_LABEL_NUMBER (label_ref_label (x));
3626 break;
3628 case UNSPEC:
3629 case UNSPEC_VOLATILE:
3630 h = h * 251 + XINT (x, 1);
3631 break;
3633 default:
3634 break;
3637 return h;
3640 /* Compute a hash value for X, which should be a constant. */
3642 static hashval_t
3643 const_rtx_hash (rtx x)
3645 hashval_t h = 0;
3646 subrtx_iterator::array_type array;
3647 FOR_EACH_SUBRTX (iter, array, x, ALL)
3648 h = h * 509 + const_rtx_hash_1 (*iter);
3649 return h;
3653 /* Create and return a new rtx constant pool. */
3655 static struct rtx_constant_pool *
3656 create_constant_pool (void)
3658 struct rtx_constant_pool *pool;
3660 pool = ggc_alloc<rtx_constant_pool> ();
3661 pool->const_rtx_htab = hash_table<const_rtx_desc_hasher>::create_ggc (31);
3662 pool->first = NULL;
3663 pool->last = NULL;
3664 pool->offset = 0;
3665 return pool;
3668 /* Initialize constant pool hashing for a new function. */
3670 void
3671 init_varasm_status (void)
3673 crtl->varasm.pool = create_constant_pool ();
3674 crtl->varasm.deferred_constants = 0;
3677 /* Given a MINUS expression, simplify it if both sides
3678 include the same symbol. */
3681 simplify_subtraction (rtx x)
3683 rtx r = simplify_rtx (x);
3684 return r ? r : x;
3687 /* Given a constant rtx X, make (or find) a memory constant for its value
3688 and return a MEM rtx to refer to it in memory. */
3691 force_const_mem (machine_mode mode, rtx x)
3693 struct constant_descriptor_rtx *desc, tmp;
3694 struct rtx_constant_pool *pool;
3695 char label[256];
3696 rtx def, symbol;
3697 hashval_t hash;
3698 unsigned int align;
3699 constant_descriptor_rtx **slot;
3701 /* If we're not allowed to drop X into the constant pool, don't. */
3702 if (targetm.cannot_force_const_mem (mode, x))
3703 return NULL_RTX;
3705 /* Record that this function has used a constant pool entry. */
3706 crtl->uses_const_pool = 1;
3708 /* Decide which pool to use. */
3709 pool = (targetm.use_blocks_for_constant_p (mode, x)
3710 ? shared_constant_pool
3711 : crtl->varasm.pool);
3713 /* Lookup the value in the hashtable. */
3714 tmp.constant = x;
3715 tmp.mode = mode;
3716 hash = const_rtx_hash (x);
3717 slot = pool->const_rtx_htab->find_slot_with_hash (&tmp, hash, INSERT);
3718 desc = *slot;
3720 /* If the constant was already present, return its memory. */
3721 if (desc)
3722 return copy_rtx (desc->mem);
3724 /* Otherwise, create a new descriptor. */
3725 desc = ggc_alloc<constant_descriptor_rtx> ();
3726 *slot = desc;
3728 /* Align the location counter as required by EXP's data type. */
3729 align = GET_MODE_ALIGNMENT (mode == VOIDmode ? word_mode : mode);
3731 tree type = lang_hooks.types.type_for_mode (mode, 0);
3732 if (type != NULL_TREE)
3733 align = CONSTANT_ALIGNMENT (make_tree (type, x), align);
3735 pool->offset += (align / BITS_PER_UNIT) - 1;
3736 pool->offset &= ~ ((align / BITS_PER_UNIT) - 1);
3738 desc->next = NULL;
3739 desc->constant = copy_rtx (tmp.constant);
3740 desc->offset = pool->offset;
3741 desc->hash = hash;
3742 desc->mode = mode;
3743 desc->align = align;
3744 desc->labelno = const_labelno;
3745 desc->mark = 0;
3747 pool->offset += GET_MODE_SIZE (mode);
3748 if (pool->last)
3749 pool->last->next = desc;
3750 else
3751 pool->first = pool->last = desc;
3752 pool->last = desc;
3754 /* Create a string containing the label name, in LABEL. */
3755 ASM_GENERATE_INTERNAL_LABEL (label, "LC", const_labelno);
3756 ++const_labelno;
3758 /* Construct the SYMBOL_REF. Make sure to mark it as belonging to
3759 the constants pool. */
3760 if (use_object_blocks_p () && targetm.use_blocks_for_constant_p (mode, x))
3762 section *sect = targetm.asm_out.select_rtx_section (mode, x, align);
3763 symbol = create_block_symbol (ggc_strdup (label),
3764 get_block_for_section (sect), -1);
3766 else
3767 symbol = gen_rtx_SYMBOL_REF (Pmode, ggc_strdup (label));
3768 desc->sym = symbol;
3769 SYMBOL_REF_FLAGS (symbol) |= SYMBOL_FLAG_LOCAL;
3770 CONSTANT_POOL_ADDRESS_P (symbol) = 1;
3771 SET_SYMBOL_REF_CONSTANT (symbol, desc);
3773 /* Construct the MEM. */
3774 desc->mem = def = gen_const_mem (mode, symbol);
3775 set_mem_attributes (def, lang_hooks.types.type_for_mode (mode, 0), 1);
3776 set_mem_align (def, align);
3778 /* If we're dropping a label to the constant pool, make sure we
3779 don't delete it. */
3780 if (GET_CODE (x) == LABEL_REF)
3781 LABEL_PRESERVE_P (XEXP (x, 0)) = 1;
3783 return copy_rtx (def);
3786 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
3789 get_pool_constant (const_rtx addr)
3791 return SYMBOL_REF_CONSTANT (addr)->constant;
3794 /* Given a constant pool SYMBOL_REF, return the corresponding constant
3795 and whether it has been output or not. */
3798 get_pool_constant_mark (rtx addr, bool *pmarked)
3800 struct constant_descriptor_rtx *desc;
3802 desc = SYMBOL_REF_CONSTANT (addr);
3803 *pmarked = (desc->mark != 0);
3804 return desc->constant;
3807 /* Similar, return the mode. */
3809 machine_mode
3810 get_pool_mode (const_rtx addr)
3812 return SYMBOL_REF_CONSTANT (addr)->mode;
3815 /* Return TRUE if and only if the constant pool has no entries. Note
3816 that even entries we might end up choosing not to emit are counted
3817 here, so there is the potential for missed optimizations. */
3819 bool
3820 constant_pool_empty_p (void)
3822 return crtl->varasm.pool->first == NULL;
3825 /* Worker function for output_constant_pool_1. Emit assembly for X
3826 in MODE with known alignment ALIGN. */
3828 static void
3829 output_constant_pool_2 (machine_mode mode, rtx x, unsigned int align)
3831 switch (GET_MODE_CLASS (mode))
3833 case MODE_FLOAT:
3834 case MODE_DECIMAL_FLOAT:
3836 gcc_assert (CONST_DOUBLE_AS_FLOAT_P (x));
3837 assemble_real (*CONST_DOUBLE_REAL_VALUE (x), mode, align, false);
3838 break;
3841 case MODE_INT:
3842 case MODE_PARTIAL_INT:
3843 case MODE_FRACT:
3844 case MODE_UFRACT:
3845 case MODE_ACCUM:
3846 case MODE_UACCUM:
3847 case MODE_POINTER_BOUNDS:
3848 assemble_integer (x, GET_MODE_SIZE (mode), align, 1);
3849 break;
3851 case MODE_VECTOR_FLOAT:
3852 case MODE_VECTOR_INT:
3853 case MODE_VECTOR_FRACT:
3854 case MODE_VECTOR_UFRACT:
3855 case MODE_VECTOR_ACCUM:
3856 case MODE_VECTOR_UACCUM:
3858 int i, units;
3859 machine_mode submode = GET_MODE_INNER (mode);
3860 unsigned int subalign = MIN (align, GET_MODE_BITSIZE (submode));
3862 gcc_assert (GET_CODE (x) == CONST_VECTOR);
3863 units = CONST_VECTOR_NUNITS (x);
3865 for (i = 0; i < units; i++)
3867 rtx elt = CONST_VECTOR_ELT (x, i);
3868 output_constant_pool_2 (submode, elt, i ? subalign : align);
3871 break;
3873 default:
3874 gcc_unreachable ();
3878 /* Worker function for output_constant_pool. Emit constant DESC,
3879 giving it ALIGN bits of alignment. */
3881 static void
3882 output_constant_pool_1 (struct constant_descriptor_rtx *desc,
3883 unsigned int align)
3885 rtx x, tmp;
3887 x = desc->constant;
3889 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3890 whose CODE_LABEL has been deleted. This can occur if a jump table
3891 is eliminated by optimization. If so, write a constant of zero
3892 instead. Note that this can also happen by turning the
3893 CODE_LABEL into a NOTE. */
3894 /* ??? This seems completely and utterly wrong. Certainly it's
3895 not true for NOTE_INSN_DELETED_LABEL, but I disbelieve proper
3896 functioning even with rtx_insn::deleted and friends. */
3898 tmp = x;
3899 switch (GET_CODE (tmp))
3901 case CONST:
3902 if (GET_CODE (XEXP (tmp, 0)) != PLUS
3903 || GET_CODE (XEXP (XEXP (tmp, 0), 0)) != LABEL_REF)
3904 break;
3905 tmp = XEXP (XEXP (tmp, 0), 0);
3906 /* FALLTHRU */
3908 case LABEL_REF:
3910 rtx_insn *insn = label_ref_label (tmp);
3911 gcc_assert (!insn->deleted ());
3912 gcc_assert (!NOTE_P (insn)
3913 || NOTE_KIND (insn) != NOTE_INSN_DELETED);
3914 break;
3917 default:
3918 break;
3921 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3922 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file, x, desc->mode,
3923 align, desc->labelno, done);
3924 #endif
3926 assemble_align (align);
3928 /* Output the label. */
3929 targetm.asm_out.internal_label (asm_out_file, "LC", desc->labelno);
3931 /* Output the data.
3932 Pass actual alignment value while emitting string constant to asm code
3933 as function 'output_constant_pool_1' explicitly passes the alignment as 1
3934 assuming that the data is already aligned which prevents the generation
3935 of fix-up table entries. */
3936 output_constant_pool_2 (desc->mode, x, desc->align);
3938 /* Make sure all constants in SECTION_MERGE and not SECTION_STRINGS
3939 sections have proper size. */
3940 if (align > GET_MODE_BITSIZE (desc->mode)
3941 && in_section
3942 && (in_section->common.flags & SECTION_MERGE))
3943 assemble_align (align);
3945 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3946 done:
3947 #endif
3948 return;
3951 /* Recompute the offsets of entries in POOL, and the overall size of
3952 POOL. Do this after calling mark_constant_pool to ensure that we
3953 are computing the offset values for the pool which we will actually
3954 emit. */
3956 static void
3957 recompute_pool_offsets (struct rtx_constant_pool *pool)
3959 struct constant_descriptor_rtx *desc;
3960 pool->offset = 0;
3962 for (desc = pool->first; desc ; desc = desc->next)
3963 if (desc->mark)
3965 /* Recalculate offset. */
3966 unsigned int align = desc->align;
3967 pool->offset += (align / BITS_PER_UNIT) - 1;
3968 pool->offset &= ~ ((align / BITS_PER_UNIT) - 1);
3969 desc->offset = pool->offset;
3970 pool->offset += GET_MODE_SIZE (desc->mode);
3974 /* Mark all constants that are referenced by SYMBOL_REFs in X.
3975 Emit referenced deferred strings. */
3977 static void
3978 mark_constants_in_pattern (rtx insn)
3980 subrtx_iterator::array_type array;
3981 FOR_EACH_SUBRTX (iter, array, PATTERN (insn), ALL)
3983 const_rtx x = *iter;
3984 if (GET_CODE (x) == SYMBOL_REF)
3986 if (CONSTANT_POOL_ADDRESS_P (x))
3988 struct constant_descriptor_rtx *desc = SYMBOL_REF_CONSTANT (x);
3989 if (desc->mark == 0)
3991 desc->mark = 1;
3992 iter.substitute (desc->constant);
3995 else if (TREE_CONSTANT_POOL_ADDRESS_P (x))
3997 tree decl = SYMBOL_REF_DECL (x);
3998 if (!TREE_ASM_WRITTEN (DECL_INITIAL (decl)))
4000 n_deferred_constants--;
4001 output_constant_def_contents (CONST_CAST_RTX (x));
4008 /* Look through appropriate parts of INSN, marking all entries in the
4009 constant pool which are actually being used. Entries that are only
4010 referenced by other constants are also marked as used. Emit
4011 deferred strings that are used. */
4013 static void
4014 mark_constants (rtx_insn *insn)
4016 if (!INSN_P (insn))
4017 return;
4019 /* Insns may appear inside a SEQUENCE. Only check the patterns of
4020 insns, not any notes that may be attached. We don't want to mark
4021 a constant just because it happens to appear in a REG_EQUIV note. */
4022 if (rtx_sequence *seq = dyn_cast <rtx_sequence *> (PATTERN (insn)))
4024 int i, n = seq->len ();
4025 for (i = 0; i < n; ++i)
4027 rtx subinsn = seq->element (i);
4028 if (INSN_P (subinsn))
4029 mark_constants_in_pattern (subinsn);
4032 else
4033 mark_constants_in_pattern (insn);
4036 /* Look through the instructions for this function, and mark all the
4037 entries in POOL which are actually being used. Emit deferred constants
4038 which have indeed been used. */
4040 static void
4041 mark_constant_pool (void)
4043 rtx_insn *insn;
4045 if (!crtl->uses_const_pool && n_deferred_constants == 0)
4046 return;
4048 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
4049 mark_constants (insn);
4052 /* Write all the constants in POOL. */
4054 static void
4055 output_constant_pool_contents (struct rtx_constant_pool *pool)
4057 struct constant_descriptor_rtx *desc;
4059 for (desc = pool->first; desc ; desc = desc->next)
4060 if (desc->mark)
4062 /* If the constant is part of an object_block, make sure that
4063 the constant has been positioned within its block, but do not
4064 write out its definition yet. output_object_blocks will do
4065 that later. */
4066 if (SYMBOL_REF_HAS_BLOCK_INFO_P (desc->sym)
4067 && SYMBOL_REF_BLOCK (desc->sym))
4068 place_block_symbol (desc->sym);
4069 else
4071 switch_to_section (targetm.asm_out.select_rtx_section
4072 (desc->mode, desc->constant, desc->align));
4073 output_constant_pool_1 (desc, desc->align);
4078 /* Mark all constants that are used in the current function, then write
4079 out the function's private constant pool. */
4081 static void
4082 output_constant_pool (const char *fnname ATTRIBUTE_UNUSED,
4083 tree fndecl ATTRIBUTE_UNUSED)
4085 struct rtx_constant_pool *pool = crtl->varasm.pool;
4087 /* It is possible for gcc to call force_const_mem and then to later
4088 discard the instructions which refer to the constant. In such a
4089 case we do not need to output the constant. */
4090 mark_constant_pool ();
4092 /* Having marked the constant pool entries we'll actually emit, we
4093 now need to rebuild the offset information, which may have become
4094 stale. */
4095 recompute_pool_offsets (pool);
4097 #ifdef ASM_OUTPUT_POOL_PROLOGUE
4098 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file, fnname, fndecl, pool->offset);
4099 #endif
4101 output_constant_pool_contents (pool);
4103 #ifdef ASM_OUTPUT_POOL_EPILOGUE
4104 ASM_OUTPUT_POOL_EPILOGUE (asm_out_file, fnname, fndecl, pool->offset);
4105 #endif
4108 /* Write the contents of the shared constant pool. */
4110 void
4111 output_shared_constant_pool (void)
4113 output_constant_pool_contents (shared_constant_pool);
4116 /* Determine what kind of relocations EXP may need. */
4119 compute_reloc_for_constant (tree exp)
4121 int reloc = 0, reloc2;
4122 tree tem;
4124 switch (TREE_CODE (exp))
4126 case ADDR_EXPR:
4127 case FDESC_EXPR:
4128 /* Go inside any operations that get_inner_reference can handle and see
4129 if what's inside is a constant: no need to do anything here for
4130 addresses of variables or functions. */
4131 for (tem = TREE_OPERAND (exp, 0); handled_component_p (tem);
4132 tem = TREE_OPERAND (tem, 0))
4135 if (TREE_CODE (tem) == MEM_REF
4136 && TREE_CODE (TREE_OPERAND (tem, 0)) == ADDR_EXPR)
4138 reloc = compute_reloc_for_constant (TREE_OPERAND (tem, 0));
4139 break;
4142 if (!targetm.binds_local_p (tem))
4143 reloc |= 2;
4144 else
4145 reloc |= 1;
4146 break;
4148 case PLUS_EXPR:
4149 case POINTER_PLUS_EXPR:
4150 reloc = compute_reloc_for_constant (TREE_OPERAND (exp, 0));
4151 reloc |= compute_reloc_for_constant (TREE_OPERAND (exp, 1));
4152 break;
4154 case MINUS_EXPR:
4155 reloc = compute_reloc_for_constant (TREE_OPERAND (exp, 0));
4156 reloc2 = compute_reloc_for_constant (TREE_OPERAND (exp, 1));
4157 /* The difference of two local labels is computable at link time. */
4158 if (reloc == 1 && reloc2 == 1)
4159 reloc = 0;
4160 else
4161 reloc |= reloc2;
4162 break;
4164 CASE_CONVERT:
4165 case VIEW_CONVERT_EXPR:
4166 reloc = compute_reloc_for_constant (TREE_OPERAND (exp, 0));
4167 break;
4169 case CONSTRUCTOR:
4171 unsigned HOST_WIDE_INT idx;
4172 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (exp), idx, tem)
4173 if (tem != 0)
4174 reloc |= compute_reloc_for_constant (tem);
4176 break;
4178 default:
4179 break;
4181 return reloc;
4184 /* Find all the constants whose addresses are referenced inside of EXP,
4185 and make sure assembler code with a label has been output for each one.
4186 Indicate whether an ADDR_EXPR has been encountered. */
4188 static void
4189 output_addressed_constants (tree exp)
4191 tree tem;
4193 switch (TREE_CODE (exp))
4195 case ADDR_EXPR:
4196 case FDESC_EXPR:
4197 /* Go inside any operations that get_inner_reference can handle and see
4198 if what's inside is a constant: no need to do anything here for
4199 addresses of variables or functions. */
4200 for (tem = TREE_OPERAND (exp, 0); handled_component_p (tem);
4201 tem = TREE_OPERAND (tem, 0))
4204 /* If we have an initialized CONST_DECL, retrieve the initializer. */
4205 if (TREE_CODE (tem) == CONST_DECL && DECL_INITIAL (tem))
4206 tem = DECL_INITIAL (tem);
4208 if (CONSTANT_CLASS_P (tem) || TREE_CODE (tem) == CONSTRUCTOR)
4209 output_constant_def (tem, 0);
4211 if (TREE_CODE (tem) == MEM_REF)
4212 output_addressed_constants (TREE_OPERAND (tem, 0));
4213 break;
4215 case PLUS_EXPR:
4216 case POINTER_PLUS_EXPR:
4217 case MINUS_EXPR:
4218 output_addressed_constants (TREE_OPERAND (exp, 1));
4219 gcc_fallthrough ();
4221 CASE_CONVERT:
4222 case VIEW_CONVERT_EXPR:
4223 output_addressed_constants (TREE_OPERAND (exp, 0));
4224 break;
4226 case CONSTRUCTOR:
4228 unsigned HOST_WIDE_INT idx;
4229 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (exp), idx, tem)
4230 if (tem != 0)
4231 output_addressed_constants (tem);
4233 break;
4235 default:
4236 break;
4240 /* Whether a constructor CTOR is a valid static constant initializer if all
4241 its elements are. This used to be internal to initializer_constant_valid_p
4242 and has been exposed to let other functions like categorize_ctor_elements
4243 evaluate the property while walking a constructor for other purposes. */
4245 bool
4246 constructor_static_from_elts_p (const_tree ctor)
4248 return (TREE_CONSTANT (ctor)
4249 && (TREE_CODE (TREE_TYPE (ctor)) == UNION_TYPE
4250 || TREE_CODE (TREE_TYPE (ctor)) == RECORD_TYPE
4251 || TREE_CODE (TREE_TYPE (ctor)) == ARRAY_TYPE));
4254 static tree initializer_constant_valid_p_1 (tree value, tree endtype,
4255 tree *cache);
4257 /* A subroutine of initializer_constant_valid_p. VALUE is a MINUS_EXPR,
4258 PLUS_EXPR or POINTER_PLUS_EXPR. This looks for cases of VALUE
4259 which are valid when ENDTYPE is an integer of any size; in
4260 particular, this does not accept a pointer minus a constant. This
4261 returns null_pointer_node if the VALUE is an absolute constant
4262 which can be used to initialize a static variable. Otherwise it
4263 returns NULL. */
4265 static tree
4266 narrowing_initializer_constant_valid_p (tree value, tree endtype, tree *cache)
4268 tree op0, op1;
4270 if (!INTEGRAL_TYPE_P (endtype))
4271 return NULL_TREE;
4273 op0 = TREE_OPERAND (value, 0);
4274 op1 = TREE_OPERAND (value, 1);
4276 /* Like STRIP_NOPS except allow the operand mode to widen. This
4277 works around a feature of fold that simplifies (int)(p1 - p2) to
4278 ((int)p1 - (int)p2) under the theory that the narrower operation
4279 is cheaper. */
4281 while (CONVERT_EXPR_P (op0)
4282 || TREE_CODE (op0) == NON_LVALUE_EXPR)
4284 tree inner = TREE_OPERAND (op0, 0);
4285 if (inner == error_mark_node
4286 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner)))
4287 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op0)))
4288 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner)))))
4289 break;
4290 op0 = inner;
4293 while (CONVERT_EXPR_P (op1)
4294 || TREE_CODE (op1) == NON_LVALUE_EXPR)
4296 tree inner = TREE_OPERAND (op1, 0);
4297 if (inner == error_mark_node
4298 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner)))
4299 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op1)))
4300 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner)))))
4301 break;
4302 op1 = inner;
4305 op0 = initializer_constant_valid_p_1 (op0, endtype, cache);
4306 if (!op0)
4307 return NULL_TREE;
4309 op1 = initializer_constant_valid_p_1 (op1, endtype,
4310 cache ? cache + 2 : NULL);
4311 /* Both initializers must be known. */
4312 if (op1)
4314 if (op0 == op1
4315 && (op0 == null_pointer_node
4316 || TREE_CODE (value) == MINUS_EXPR))
4317 return null_pointer_node;
4319 /* Support differences between labels. */
4320 if (TREE_CODE (op0) == LABEL_DECL
4321 && TREE_CODE (op1) == LABEL_DECL)
4322 return null_pointer_node;
4324 if (TREE_CODE (op0) == STRING_CST
4325 && TREE_CODE (op1) == STRING_CST
4326 && operand_equal_p (op0, op1, 1))
4327 return null_pointer_node;
4330 return NULL_TREE;
4333 /* Helper function of initializer_constant_valid_p.
4334 Return nonzero if VALUE is a valid constant-valued expression
4335 for use in initializing a static variable; one that can be an
4336 element of a "constant" initializer.
4338 Return null_pointer_node if the value is absolute;
4339 if it is relocatable, return the variable that determines the relocation.
4340 We assume that VALUE has been folded as much as possible;
4341 therefore, we do not need to check for such things as
4342 arithmetic-combinations of integers.
4344 Use CACHE (pointer to 2 tree values) for caching if non-NULL. */
4346 static tree
4347 initializer_constant_valid_p_1 (tree value, tree endtype, tree *cache)
4349 tree ret;
4351 switch (TREE_CODE (value))
4353 case CONSTRUCTOR:
4354 if (constructor_static_from_elts_p (value))
4356 unsigned HOST_WIDE_INT idx;
4357 tree elt;
4358 bool absolute = true;
4360 if (cache && cache[0] == value)
4361 return cache[1];
4362 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (value), idx, elt)
4364 tree reloc;
4365 reloc = initializer_constant_valid_p_1 (elt, TREE_TYPE (elt),
4366 NULL);
4367 if (!reloc
4368 /* An absolute value is required with reverse SSO. */
4369 || (reloc != null_pointer_node
4370 && TYPE_REVERSE_STORAGE_ORDER (TREE_TYPE (value))
4371 && !AGGREGATE_TYPE_P (TREE_TYPE (elt))))
4373 if (cache)
4375 cache[0] = value;
4376 cache[1] = NULL_TREE;
4378 return NULL_TREE;
4380 if (reloc != null_pointer_node)
4381 absolute = false;
4383 /* For a non-absolute relocation, there is no single
4384 variable that can be "the variable that determines the
4385 relocation." */
4386 if (cache)
4388 cache[0] = value;
4389 cache[1] = absolute ? null_pointer_node : error_mark_node;
4391 return absolute ? null_pointer_node : error_mark_node;
4394 return TREE_STATIC (value) ? null_pointer_node : NULL_TREE;
4396 case INTEGER_CST:
4397 case VECTOR_CST:
4398 case REAL_CST:
4399 case FIXED_CST:
4400 case STRING_CST:
4401 case COMPLEX_CST:
4402 return null_pointer_node;
4404 case ADDR_EXPR:
4405 case FDESC_EXPR:
4407 tree op0 = staticp (TREE_OPERAND (value, 0));
4408 if (op0)
4410 /* "&(*a).f" is like unto pointer arithmetic. If "a" turns out
4411 to be a constant, this is old-skool offsetof-like nonsense. */
4412 if (TREE_CODE (op0) == INDIRECT_REF
4413 && TREE_CONSTANT (TREE_OPERAND (op0, 0)))
4414 return null_pointer_node;
4415 /* Taking the address of a nested function involves a trampoline,
4416 unless we don't need or want one. */
4417 if (TREE_CODE (op0) == FUNCTION_DECL
4418 && DECL_STATIC_CHAIN (op0)
4419 && !TREE_NO_TRAMPOLINE (value))
4420 return NULL_TREE;
4421 /* "&{...}" requires a temporary to hold the constructed
4422 object. */
4423 if (TREE_CODE (op0) == CONSTRUCTOR)
4424 return NULL_TREE;
4426 return op0;
4429 case NON_LVALUE_EXPR:
4430 return initializer_constant_valid_p_1 (TREE_OPERAND (value, 0),
4431 endtype, cache);
4433 case VIEW_CONVERT_EXPR:
4435 tree src = TREE_OPERAND (value, 0);
4436 tree src_type = TREE_TYPE (src);
4437 tree dest_type = TREE_TYPE (value);
4439 /* Allow view-conversions from aggregate to non-aggregate type only
4440 if the bit pattern is fully preserved afterwards; otherwise, the
4441 RTL expander won't be able to apply a subsequent transformation
4442 to the underlying constructor. */
4443 if (AGGREGATE_TYPE_P (src_type) && !AGGREGATE_TYPE_P (dest_type))
4445 if (TYPE_MODE (endtype) == TYPE_MODE (dest_type))
4446 return initializer_constant_valid_p_1 (src, endtype, cache);
4447 else
4448 return NULL_TREE;
4451 /* Allow all other kinds of view-conversion. */
4452 return initializer_constant_valid_p_1 (src, endtype, cache);
4455 CASE_CONVERT:
4457 tree src = TREE_OPERAND (value, 0);
4458 tree src_type = TREE_TYPE (src);
4459 tree dest_type = TREE_TYPE (value);
4461 /* Allow conversions between pointer types, floating-point
4462 types, and offset types. */
4463 if ((POINTER_TYPE_P (dest_type) && POINTER_TYPE_P (src_type))
4464 || (FLOAT_TYPE_P (dest_type) && FLOAT_TYPE_P (src_type))
4465 || (TREE_CODE (dest_type) == OFFSET_TYPE
4466 && TREE_CODE (src_type) == OFFSET_TYPE))
4467 return initializer_constant_valid_p_1 (src, endtype, cache);
4469 /* Allow length-preserving conversions between integer types. */
4470 if (INTEGRAL_TYPE_P (dest_type) && INTEGRAL_TYPE_P (src_type)
4471 && (TYPE_PRECISION (dest_type) == TYPE_PRECISION (src_type)))
4472 return initializer_constant_valid_p_1 (src, endtype, cache);
4474 /* Allow conversions between other integer types only if
4475 explicit value. */
4476 if (INTEGRAL_TYPE_P (dest_type) && INTEGRAL_TYPE_P (src_type))
4478 tree inner = initializer_constant_valid_p_1 (src, endtype, cache);
4479 if (inner == null_pointer_node)
4480 return null_pointer_node;
4481 break;
4484 /* Allow (int) &foo provided int is as wide as a pointer. */
4485 if (INTEGRAL_TYPE_P (dest_type) && POINTER_TYPE_P (src_type)
4486 && (TYPE_PRECISION (dest_type) >= TYPE_PRECISION (src_type)))
4487 return initializer_constant_valid_p_1 (src, endtype, cache);
4489 /* Likewise conversions from int to pointers, but also allow
4490 conversions from 0. */
4491 if ((POINTER_TYPE_P (dest_type)
4492 || TREE_CODE (dest_type) == OFFSET_TYPE)
4493 && INTEGRAL_TYPE_P (src_type))
4495 if (TREE_CODE (src) == INTEGER_CST
4496 && TYPE_PRECISION (dest_type) >= TYPE_PRECISION (src_type))
4497 return null_pointer_node;
4498 if (integer_zerop (src))
4499 return null_pointer_node;
4500 else if (TYPE_PRECISION (dest_type) <= TYPE_PRECISION (src_type))
4501 return initializer_constant_valid_p_1 (src, endtype, cache);
4504 /* Allow conversions to struct or union types if the value
4505 inside is okay. */
4506 if (TREE_CODE (dest_type) == RECORD_TYPE
4507 || TREE_CODE (dest_type) == UNION_TYPE)
4508 return initializer_constant_valid_p_1 (src, endtype, cache);
4510 break;
4512 case POINTER_PLUS_EXPR:
4513 case PLUS_EXPR:
4514 /* Any valid floating-point constants will have been folded by now;
4515 with -frounding-math we hit this with addition of two constants. */
4516 if (TREE_CODE (endtype) == REAL_TYPE)
4517 return NULL_TREE;
4518 if (cache && cache[0] == value)
4519 return cache[1];
4520 if (! INTEGRAL_TYPE_P (endtype)
4521 || TYPE_PRECISION (endtype) >= TYPE_PRECISION (TREE_TYPE (value)))
4523 tree ncache[4] = { NULL_TREE, NULL_TREE, NULL_TREE, NULL_TREE };
4524 tree valid0
4525 = initializer_constant_valid_p_1 (TREE_OPERAND (value, 0),
4526 endtype, ncache);
4527 tree valid1
4528 = initializer_constant_valid_p_1 (TREE_OPERAND (value, 1),
4529 endtype, ncache + 2);
4530 /* If either term is absolute, use the other term's relocation. */
4531 if (valid0 == null_pointer_node)
4532 ret = valid1;
4533 else if (valid1 == null_pointer_node)
4534 ret = valid0;
4535 /* Support narrowing pointer differences. */
4536 else
4537 ret = narrowing_initializer_constant_valid_p (value, endtype,
4538 ncache);
4540 else
4541 /* Support narrowing pointer differences. */
4542 ret = narrowing_initializer_constant_valid_p (value, endtype, NULL);
4543 if (cache)
4545 cache[0] = value;
4546 cache[1] = ret;
4548 return ret;
4550 case MINUS_EXPR:
4551 if (TREE_CODE (endtype) == REAL_TYPE)
4552 return NULL_TREE;
4553 if (cache && cache[0] == value)
4554 return cache[1];
4555 if (! INTEGRAL_TYPE_P (endtype)
4556 || TYPE_PRECISION (endtype) >= TYPE_PRECISION (TREE_TYPE (value)))
4558 tree ncache[4] = { NULL_TREE, NULL_TREE, NULL_TREE, NULL_TREE };
4559 tree valid0
4560 = initializer_constant_valid_p_1 (TREE_OPERAND (value, 0),
4561 endtype, ncache);
4562 tree valid1
4563 = initializer_constant_valid_p_1 (TREE_OPERAND (value, 1),
4564 endtype, ncache + 2);
4565 /* Win if second argument is absolute. */
4566 if (valid1 == null_pointer_node)
4567 ret = valid0;
4568 /* Win if both arguments have the same relocation.
4569 Then the value is absolute. */
4570 else if (valid0 == valid1 && valid0 != 0)
4571 ret = null_pointer_node;
4572 /* Since GCC guarantees that string constants are unique in the
4573 generated code, a subtraction between two copies of the same
4574 constant string is absolute. */
4575 else if (valid0 && TREE_CODE (valid0) == STRING_CST
4576 && valid1 && TREE_CODE (valid1) == STRING_CST
4577 && operand_equal_p (valid0, valid1, 1))
4578 ret = null_pointer_node;
4579 /* Support narrowing differences. */
4580 else
4581 ret = narrowing_initializer_constant_valid_p (value, endtype,
4582 ncache);
4584 else
4585 /* Support narrowing differences. */
4586 ret = narrowing_initializer_constant_valid_p (value, endtype, NULL);
4587 if (cache)
4589 cache[0] = value;
4590 cache[1] = ret;
4592 return ret;
4594 default:
4595 break;
4598 return NULL_TREE;
4601 /* Return nonzero if VALUE is a valid constant-valued expression
4602 for use in initializing a static variable; one that can be an
4603 element of a "constant" initializer.
4605 Return null_pointer_node if the value is absolute;
4606 if it is relocatable, return the variable that determines the relocation.
4607 We assume that VALUE has been folded as much as possible;
4608 therefore, we do not need to check for such things as
4609 arithmetic-combinations of integers. */
4610 tree
4611 initializer_constant_valid_p (tree value, tree endtype, bool reverse)
4613 tree reloc = initializer_constant_valid_p_1 (value, endtype, NULL);
4615 /* An absolute value is required with reverse storage order. */
4616 if (reloc
4617 && reloc != null_pointer_node
4618 && reverse
4619 && !AGGREGATE_TYPE_P (endtype)
4620 && !VECTOR_TYPE_P (endtype))
4621 reloc = NULL_TREE;
4623 return reloc;
4626 /* Return true if VALUE is a valid constant-valued expression
4627 for use in initializing a static bit-field; one that can be
4628 an element of a "constant" initializer. */
4630 bool
4631 initializer_constant_valid_for_bitfield_p (tree value)
4633 /* For bitfields we support integer constants or possibly nested aggregates
4634 of such. */
4635 switch (TREE_CODE (value))
4637 case CONSTRUCTOR:
4639 unsigned HOST_WIDE_INT idx;
4640 tree elt;
4642 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (value), idx, elt)
4643 if (!initializer_constant_valid_for_bitfield_p (elt))
4644 return false;
4645 return true;
4648 case INTEGER_CST:
4649 case REAL_CST:
4650 return true;
4652 case VIEW_CONVERT_EXPR:
4653 case NON_LVALUE_EXPR:
4654 return
4655 initializer_constant_valid_for_bitfield_p (TREE_OPERAND (value, 0));
4657 default:
4658 break;
4661 return false;
4664 /* output_constructor outer state of relevance in recursive calls, typically
4665 for nested aggregate bitfields. */
4667 struct oc_outer_state {
4668 unsigned int bit_offset; /* current position in ... */
4669 int byte; /* ... the outer byte buffer. */
4672 static unsigned HOST_WIDE_INT
4673 output_constructor (tree, unsigned HOST_WIDE_INT, unsigned int, bool,
4674 oc_outer_state *);
4676 /* Output assembler code for constant EXP, with no label.
4677 This includes the pseudo-op such as ".int" or ".byte", and a newline.
4678 Assumes output_addressed_constants has been done on EXP already.
4680 Generate at least SIZE bytes of assembler data, padding at the end
4681 with zeros if necessary. SIZE must always be specified. The returned
4682 value is the actual number of bytes of assembler data generated, which
4683 may be bigger than SIZE if the object contains a variable length field.
4685 SIZE is important for structure constructors,
4686 since trailing members may have been omitted from the constructor.
4687 It is also important for initialization of arrays from string constants
4688 since the full length of the string constant might not be wanted.
4689 It is also needed for initialization of unions, where the initializer's
4690 type is just one member, and that may not be as long as the union.
4692 There a case in which we would fail to output exactly SIZE bytes:
4693 for a structure constructor that wants to produce more than SIZE bytes.
4694 But such constructors will never be generated for any possible input.
4696 ALIGN is the alignment of the data in bits.
4698 If REVERSE is true, EXP is output in reverse storage order. */
4700 static unsigned HOST_WIDE_INT
4701 output_constant (tree exp, unsigned HOST_WIDE_INT size, unsigned int align,
4702 bool reverse)
4704 enum tree_code code;
4705 unsigned HOST_WIDE_INT thissize;
4706 rtx cst;
4708 if (size == 0 || flag_syntax_only)
4709 return size;
4711 /* See if we're trying to initialize a pointer in a non-default mode
4712 to the address of some declaration somewhere. If the target says
4713 the mode is valid for pointers, assume the target has a way of
4714 resolving it. */
4715 if (TREE_CODE (exp) == NOP_EXPR
4716 && POINTER_TYPE_P (TREE_TYPE (exp))
4717 && targetm.addr_space.valid_pointer_mode
4718 (TYPE_MODE (TREE_TYPE (exp)),
4719 TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (exp)))))
4721 tree saved_type = TREE_TYPE (exp);
4723 /* Peel off any intermediate conversions-to-pointer for valid
4724 pointer modes. */
4725 while (TREE_CODE (exp) == NOP_EXPR
4726 && POINTER_TYPE_P (TREE_TYPE (exp))
4727 && targetm.addr_space.valid_pointer_mode
4728 (TYPE_MODE (TREE_TYPE (exp)),
4729 TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (exp)))))
4730 exp = TREE_OPERAND (exp, 0);
4732 /* If what we're left with is the address of something, we can
4733 convert the address to the final type and output it that
4734 way. */
4735 if (TREE_CODE (exp) == ADDR_EXPR)
4736 exp = build1 (ADDR_EXPR, saved_type, TREE_OPERAND (exp, 0));
4737 /* Likewise for constant ints. */
4738 else if (TREE_CODE (exp) == INTEGER_CST)
4739 exp = fold_convert (saved_type, exp);
4743 /* Eliminate any conversions since we'll be outputting the underlying
4744 constant. */
4745 while (CONVERT_EXPR_P (exp)
4746 || TREE_CODE (exp) == NON_LVALUE_EXPR
4747 || TREE_CODE (exp) == VIEW_CONVERT_EXPR)
4749 HOST_WIDE_INT type_size = int_size_in_bytes (TREE_TYPE (exp));
4750 HOST_WIDE_INT op_size = int_size_in_bytes (TREE_TYPE (TREE_OPERAND (exp, 0)));
4752 /* Make sure eliminating the conversion is really a no-op, except with
4753 VIEW_CONVERT_EXPRs to allow for wild Ada unchecked conversions and
4754 union types to allow for Ada unchecked unions. */
4755 if (type_size > op_size
4756 && TREE_CODE (exp) != VIEW_CONVERT_EXPR
4757 && TREE_CODE (TREE_TYPE (exp)) != UNION_TYPE)
4758 /* Keep the conversion. */
4759 break;
4760 else
4761 exp = TREE_OPERAND (exp, 0);
4764 code = TREE_CODE (TREE_TYPE (exp));
4765 thissize = int_size_in_bytes (TREE_TYPE (exp));
4767 /* Allow a constructor with no elements for any data type.
4768 This means to fill the space with zeros. */
4769 if (TREE_CODE (exp) == CONSTRUCTOR
4770 && vec_safe_is_empty (CONSTRUCTOR_ELTS (exp)))
4772 assemble_zeros (size);
4773 return size;
4776 if (TREE_CODE (exp) == FDESC_EXPR)
4778 #ifdef ASM_OUTPUT_FDESC
4779 HOST_WIDE_INT part = tree_to_shwi (TREE_OPERAND (exp, 1));
4780 tree decl = TREE_OPERAND (exp, 0);
4781 ASM_OUTPUT_FDESC (asm_out_file, decl, part);
4782 #else
4783 gcc_unreachable ();
4784 #endif
4785 return size;
4788 /* Now output the underlying data. If we've handling the padding, return.
4789 Otherwise, break and ensure SIZE is the size written. */
4790 switch (code)
4792 case BOOLEAN_TYPE:
4793 case INTEGER_TYPE:
4794 case ENUMERAL_TYPE:
4795 case POINTER_TYPE:
4796 case REFERENCE_TYPE:
4797 case OFFSET_TYPE:
4798 case FIXED_POINT_TYPE:
4799 case POINTER_BOUNDS_TYPE:
4800 case NULLPTR_TYPE:
4801 cst = expand_expr (exp, NULL_RTX, VOIDmode, EXPAND_INITIALIZER);
4802 if (reverse)
4803 cst = flip_storage_order (TYPE_MODE (TREE_TYPE (exp)), cst);
4804 if (!assemble_integer (cst, MIN (size, thissize), align, 0))
4805 error ("initializer for integer/fixed-point value is too complicated");
4806 break;
4808 case REAL_TYPE:
4809 if (TREE_CODE (exp) != REAL_CST)
4810 error ("initializer for floating value is not a floating constant");
4811 else
4812 assemble_real (TREE_REAL_CST (exp), TYPE_MODE (TREE_TYPE (exp)),
4813 align, reverse);
4814 break;
4816 case COMPLEX_TYPE:
4817 output_constant (TREE_REALPART (exp), thissize / 2, align, reverse);
4818 output_constant (TREE_IMAGPART (exp), thissize / 2,
4819 min_align (align, BITS_PER_UNIT * (thissize / 2)),
4820 reverse);
4821 break;
4823 case ARRAY_TYPE:
4824 case VECTOR_TYPE:
4825 switch (TREE_CODE (exp))
4827 case CONSTRUCTOR:
4828 return output_constructor (exp, size, align, reverse, NULL);
4829 case STRING_CST:
4830 thissize
4831 = MIN ((unsigned HOST_WIDE_INT)TREE_STRING_LENGTH (exp), size);
4832 assemble_string (TREE_STRING_POINTER (exp), thissize);
4833 break;
4834 case VECTOR_CST:
4836 machine_mode inner = TYPE_MODE (TREE_TYPE (TREE_TYPE (exp)));
4837 unsigned int nalign = MIN (align, GET_MODE_ALIGNMENT (inner));
4838 int elt_size = GET_MODE_SIZE (inner);
4839 output_constant (VECTOR_CST_ELT (exp, 0), elt_size, align,
4840 reverse);
4841 thissize = elt_size;
4842 for (unsigned int i = 1; i < VECTOR_CST_NELTS (exp); i++)
4844 output_constant (VECTOR_CST_ELT (exp, i), elt_size, nalign,
4845 reverse);
4846 thissize += elt_size;
4848 break;
4850 default:
4851 gcc_unreachable ();
4853 break;
4855 case RECORD_TYPE:
4856 case UNION_TYPE:
4857 gcc_assert (TREE_CODE (exp) == CONSTRUCTOR);
4858 return output_constructor (exp, size, align, reverse, NULL);
4860 case ERROR_MARK:
4861 return 0;
4863 default:
4864 gcc_unreachable ();
4867 if (size > thissize)
4868 assemble_zeros (size - thissize);
4870 return size;
4873 /* Subroutine of output_constructor, used for computing the size of
4874 arrays of unspecified length. VAL must be a CONSTRUCTOR of an array
4875 type with an unspecified upper bound. */
4877 static unsigned HOST_WIDE_INT
4878 array_size_for_constructor (tree val)
4880 tree max_index;
4881 unsigned HOST_WIDE_INT cnt;
4882 tree index, value, tmp;
4883 offset_int i;
4885 /* This code used to attempt to handle string constants that are not
4886 arrays of single-bytes, but nothing else does, so there's no point in
4887 doing it here. */
4888 if (TREE_CODE (val) == STRING_CST)
4889 return TREE_STRING_LENGTH (val);
4891 max_index = NULL_TREE;
4892 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (val), cnt, index, value)
4894 if (TREE_CODE (index) == RANGE_EXPR)
4895 index = TREE_OPERAND (index, 1);
4896 if (max_index == NULL_TREE || tree_int_cst_lt (max_index, index))
4897 max_index = index;
4900 if (max_index == NULL_TREE)
4901 return 0;
4903 /* Compute the total number of array elements. */
4904 tmp = TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (val)));
4905 i = wi::to_offset (max_index) - wi::to_offset (tmp) + 1;
4907 /* Multiply by the array element unit size to find number of bytes. */
4908 i *= wi::to_offset (TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (val))));
4910 gcc_assert (wi::fits_uhwi_p (i));
4911 return i.to_uhwi ();
4914 /* Other datastructures + helpers for output_constructor. */
4916 /* output_constructor local state to support interaction with helpers. */
4918 struct oc_local_state {
4920 /* Received arguments. */
4921 tree exp; /* Constructor expression. */
4922 tree type; /* Type of constructor expression. */
4923 unsigned HOST_WIDE_INT size; /* # bytes to output - pad if necessary. */
4924 unsigned int align; /* Known initial alignment. */
4925 tree min_index; /* Lower bound if specified for an array. */
4927 /* Output processing state. */
4928 HOST_WIDE_INT total_bytes; /* # bytes output so far / current position. */
4929 int byte; /* Part of a bitfield byte yet to be output. */
4930 int last_relative_index; /* Implicit or explicit index of the last
4931 array element output within a bitfield. */
4932 bool byte_buffer_in_use; /* Whether BYTE is in use. */
4933 bool reverse; /* Whether reverse storage order is in use. */
4935 /* Current element. */
4936 tree field; /* Current field decl in a record. */
4937 tree val; /* Current element value. */
4938 tree index; /* Current element index. */
4942 /* Helper for output_constructor. From the current LOCAL state, output a
4943 RANGE_EXPR element. */
4945 static void
4946 output_constructor_array_range (oc_local_state *local)
4948 unsigned HOST_WIDE_INT fieldsize
4949 = int_size_in_bytes (TREE_TYPE (local->type));
4951 HOST_WIDE_INT lo_index
4952 = tree_to_shwi (TREE_OPERAND (local->index, 0));
4953 HOST_WIDE_INT hi_index
4954 = tree_to_shwi (TREE_OPERAND (local->index, 1));
4955 HOST_WIDE_INT index;
4957 unsigned int align2
4958 = min_align (local->align, fieldsize * BITS_PER_UNIT);
4960 for (index = lo_index; index <= hi_index; index++)
4962 /* Output the element's initial value. */
4963 if (local->val == NULL_TREE)
4964 assemble_zeros (fieldsize);
4965 else
4966 fieldsize
4967 = output_constant (local->val, fieldsize, align2, local->reverse);
4969 /* Count its size. */
4970 local->total_bytes += fieldsize;
4974 /* Helper for output_constructor. From the current LOCAL state, output a
4975 field element that is not true bitfield or part of an outer one. */
4977 static void
4978 output_constructor_regular_field (oc_local_state *local)
4980 /* Field size and position. Since this structure is static, we know the
4981 positions are constant. */
4982 unsigned HOST_WIDE_INT fieldsize;
4983 HOST_WIDE_INT fieldpos;
4985 unsigned int align2;
4987 /* Output any buffered-up bit-fields preceding this element. */
4988 if (local->byte_buffer_in_use)
4990 assemble_integer (GEN_INT (local->byte), 1, BITS_PER_UNIT, 1);
4991 local->total_bytes++;
4992 local->byte_buffer_in_use = false;
4995 if (local->index != NULL_TREE)
4997 /* Perform the index calculation in modulo arithmetic but
4998 sign-extend the result because Ada has negative DECL_FIELD_OFFSETs
4999 but we are using an unsigned sizetype. */
5000 unsigned prec = TYPE_PRECISION (sizetype);
5001 offset_int idx = wi::sext (wi::to_offset (local->index)
5002 - wi::to_offset (local->min_index), prec);
5003 fieldpos = (idx * wi::to_offset (TYPE_SIZE_UNIT (TREE_TYPE (local->val))))
5004 .to_short_addr ();
5006 else if (local->field != NULL_TREE)
5007 fieldpos = int_byte_position (local->field);
5008 else
5009 fieldpos = 0;
5011 /* Advance to offset of this element.
5012 Note no alignment needed in an array, since that is guaranteed
5013 if each element has the proper size. */
5014 if (local->field != NULL_TREE || local->index != NULL_TREE)
5016 if (fieldpos > local->total_bytes)
5018 assemble_zeros (fieldpos - local->total_bytes);
5019 local->total_bytes = fieldpos;
5021 else
5022 /* Must not go backwards. */
5023 gcc_assert (fieldpos == local->total_bytes);
5026 /* Find the alignment of this element. */
5027 align2 = min_align (local->align, BITS_PER_UNIT * fieldpos);
5029 /* Determine size this element should occupy. */
5030 if (local->field)
5032 fieldsize = 0;
5034 /* If this is an array with an unspecified upper bound,
5035 the initializer determines the size. */
5036 /* ??? This ought to only checked if DECL_SIZE_UNIT is NULL,
5037 but we cannot do this until the deprecated support for
5038 initializing zero-length array members is removed. */
5039 if (TREE_CODE (TREE_TYPE (local->field)) == ARRAY_TYPE
5040 && (!TYPE_DOMAIN (TREE_TYPE (local->field))
5041 || !TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (local->field)))))
5043 fieldsize = array_size_for_constructor (local->val);
5044 /* Given a non-empty initialization, this field had better
5045 be last. Given a flexible array member, the next field
5046 on the chain is a TYPE_DECL of the enclosing struct. */
5047 const_tree next = DECL_CHAIN (local->field);
5048 gcc_assert (!fieldsize || !next || TREE_CODE (next) != FIELD_DECL);
5050 else
5051 fieldsize = tree_to_uhwi (DECL_SIZE_UNIT (local->field));
5053 else
5054 fieldsize = int_size_in_bytes (TREE_TYPE (local->type));
5056 /* Output the element's initial value. */
5057 if (local->val == NULL_TREE)
5058 assemble_zeros (fieldsize);
5059 else
5060 fieldsize
5061 = output_constant (local->val, fieldsize, align2, local->reverse);
5063 /* Count its size. */
5064 local->total_bytes += fieldsize;
5067 /* Helper for output_constructor. From the LOCAL state, output an element
5068 that is a true bitfield or part of an outer one. BIT_OFFSET is the offset
5069 from the start of a possibly ongoing outer byte buffer. */
5071 static void
5072 output_constructor_bitfield (oc_local_state *local, unsigned int bit_offset)
5074 /* Bit size of this element. */
5075 HOST_WIDE_INT ebitsize
5076 = (local->field
5077 ? tree_to_uhwi (DECL_SIZE (local->field))
5078 : tree_to_uhwi (TYPE_SIZE (TREE_TYPE (local->type))));
5080 /* Relative index of this element if this is an array component. */
5081 HOST_WIDE_INT relative_index
5082 = (!local->field
5083 ? (local->index
5084 ? (tree_to_shwi (local->index)
5085 - tree_to_shwi (local->min_index))
5086 : local->last_relative_index + 1)
5087 : 0);
5089 /* Bit position of this element from the start of the containing
5090 constructor. */
5091 HOST_WIDE_INT constructor_relative_ebitpos
5092 = (local->field
5093 ? int_bit_position (local->field)
5094 : ebitsize * relative_index);
5096 /* Bit position of this element from the start of a possibly ongoing
5097 outer byte buffer. */
5098 HOST_WIDE_INT byte_relative_ebitpos
5099 = bit_offset + constructor_relative_ebitpos;
5101 /* From the start of a possibly ongoing outer byte buffer, offsets to
5102 the first bit of this element and to the first bit past the end of
5103 this element. */
5104 HOST_WIDE_INT next_offset = byte_relative_ebitpos;
5105 HOST_WIDE_INT end_offset = byte_relative_ebitpos + ebitsize;
5107 local->last_relative_index = relative_index;
5109 if (local->val == NULL_TREE)
5110 local->val = integer_zero_node;
5112 while (TREE_CODE (local->val) == VIEW_CONVERT_EXPR
5113 || TREE_CODE (local->val) == NON_LVALUE_EXPR)
5114 local->val = TREE_OPERAND (local->val, 0);
5116 if (TREE_CODE (local->val) != INTEGER_CST
5117 && TREE_CODE (local->val) != CONSTRUCTOR)
5119 error ("invalid initial value for member %qE", DECL_NAME (local->field));
5120 return;
5123 /* If this field does not start in this (or next) byte, skip some bytes. */
5124 if (next_offset / BITS_PER_UNIT != local->total_bytes)
5126 /* Output remnant of any bit field in previous bytes. */
5127 if (local->byte_buffer_in_use)
5129 assemble_integer (GEN_INT (local->byte), 1, BITS_PER_UNIT, 1);
5130 local->total_bytes++;
5131 local->byte_buffer_in_use = false;
5134 /* If still not at proper byte, advance to there. */
5135 if (next_offset / BITS_PER_UNIT != local->total_bytes)
5137 gcc_assert (next_offset / BITS_PER_UNIT >= local->total_bytes);
5138 assemble_zeros (next_offset / BITS_PER_UNIT - local->total_bytes);
5139 local->total_bytes = next_offset / BITS_PER_UNIT;
5143 /* Set up the buffer if necessary. */
5144 if (!local->byte_buffer_in_use)
5146 local->byte = 0;
5147 if (ebitsize > 0)
5148 local->byte_buffer_in_use = true;
5151 /* If this is nested constructor, recurse passing the bit offset and the
5152 pending data, then retrieve the new pending data afterwards. */
5153 if (TREE_CODE (local->val) == CONSTRUCTOR)
5155 oc_outer_state temp_state;
5156 temp_state.bit_offset = next_offset % BITS_PER_UNIT;
5157 temp_state.byte = local->byte;
5158 local->total_bytes
5159 += output_constructor (local->val, 0, 0, local->reverse, &temp_state);
5160 local->byte = temp_state.byte;
5161 return;
5164 /* Otherwise, we must split the element into pieces that fall within
5165 separate bytes, and combine each byte with previous or following
5166 bit-fields. */
5167 while (next_offset < end_offset)
5169 int this_time;
5170 int shift;
5171 HOST_WIDE_INT value;
5172 HOST_WIDE_INT next_byte = next_offset / BITS_PER_UNIT;
5173 HOST_WIDE_INT next_bit = next_offset % BITS_PER_UNIT;
5175 /* Advance from byte to byte within this element when necessary. */
5176 while (next_byte != local->total_bytes)
5178 assemble_integer (GEN_INT (local->byte), 1, BITS_PER_UNIT, 1);
5179 local->total_bytes++;
5180 local->byte = 0;
5183 /* Number of bits we can process at once (all part of the same byte). */
5184 this_time = MIN (end_offset - next_offset, BITS_PER_UNIT - next_bit);
5185 if (local->reverse ? !BYTES_BIG_ENDIAN : BYTES_BIG_ENDIAN)
5187 /* For big-endian data, take the most significant bits (of the
5188 bits that are significant) first and put them into bytes from
5189 the most significant end. */
5190 shift = end_offset - next_offset - this_time;
5192 /* Don't try to take a bunch of bits that cross
5193 the word boundary in the INTEGER_CST. We can
5194 only select bits from one element. */
5195 if ((shift / HOST_BITS_PER_WIDE_INT)
5196 != ((shift + this_time - 1) / HOST_BITS_PER_WIDE_INT))
5198 const int end = shift + this_time - 1;
5199 shift = end & -HOST_BITS_PER_WIDE_INT;
5200 this_time = end - shift + 1;
5203 /* Now get the bits from the appropriate constant word. */
5204 value = TREE_INT_CST_ELT (local->val, shift / HOST_BITS_PER_WIDE_INT);
5205 shift = shift & (HOST_BITS_PER_WIDE_INT - 1);
5207 /* Get the result. This works only when:
5208 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
5209 local->byte |= (((value >> shift)
5210 & (((HOST_WIDE_INT) 2 << (this_time - 1)) - 1))
5211 << (BITS_PER_UNIT - this_time - next_bit));
5213 else
5215 /* On little-endian machines, take the least significant bits of
5216 the value first and pack them starting at the least significant
5217 bits of the bytes. */
5218 shift = next_offset - byte_relative_ebitpos;
5220 /* Don't try to take a bunch of bits that cross
5221 the word boundary in the INTEGER_CST. We can
5222 only select bits from one element. */
5223 if ((shift / HOST_BITS_PER_WIDE_INT)
5224 != ((shift + this_time - 1) / HOST_BITS_PER_WIDE_INT))
5225 this_time
5226 = HOST_BITS_PER_WIDE_INT - (shift & (HOST_BITS_PER_WIDE_INT - 1));
5228 /* Now get the bits from the appropriate constant word. */
5229 value = TREE_INT_CST_ELT (local->val, shift / HOST_BITS_PER_WIDE_INT);
5230 shift = shift & (HOST_BITS_PER_WIDE_INT - 1);
5232 /* Get the result. This works only when:
5233 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
5234 local->byte |= (((value >> shift)
5235 & (((HOST_WIDE_INT) 2 << (this_time - 1)) - 1))
5236 << next_bit);
5239 next_offset += this_time;
5240 local->byte_buffer_in_use = true;
5244 /* Subroutine of output_constant, used for CONSTRUCTORs (aggregate constants).
5245 Generate at least SIZE bytes, padding if necessary. OUTER designates the
5246 caller output state of relevance in recursive invocations. */
5248 static unsigned HOST_WIDE_INT
5249 output_constructor (tree exp, unsigned HOST_WIDE_INT size, unsigned int align,
5250 bool reverse, oc_outer_state *outer)
5252 unsigned HOST_WIDE_INT cnt;
5253 constructor_elt *ce;
5254 oc_local_state local;
5256 /* Setup our local state to communicate with helpers. */
5257 local.exp = exp;
5258 local.type = TREE_TYPE (exp);
5259 local.size = size;
5260 local.align = align;
5261 if (TREE_CODE (local.type) == ARRAY_TYPE && TYPE_DOMAIN (local.type))
5262 local.min_index = TYPE_MIN_VALUE (TYPE_DOMAIN (local.type));
5263 else
5264 local.min_index = integer_zero_node;
5266 local.total_bytes = 0;
5267 local.byte_buffer_in_use = outer != NULL;
5268 local.byte = outer ? outer->byte : 0;
5269 local.last_relative_index = -1;
5270 /* The storage order is specified for every aggregate type. */
5271 if (AGGREGATE_TYPE_P (local.type))
5272 local.reverse = TYPE_REVERSE_STORAGE_ORDER (local.type);
5273 else
5274 local.reverse = reverse;
5276 gcc_assert (HOST_BITS_PER_WIDE_INT >= BITS_PER_UNIT);
5278 /* As CE goes through the elements of the constant, FIELD goes through the
5279 structure fields if the constant is a structure. If the constant is a
5280 union, we override this by getting the field from the TREE_LIST element.
5281 But the constant could also be an array. Then FIELD is zero.
5283 There is always a maximum of one element in the chain LINK for unions
5284 (even if the initializer in a source program incorrectly contains
5285 more one). */
5287 if (TREE_CODE (local.type) == RECORD_TYPE)
5288 local.field = TYPE_FIELDS (local.type);
5289 else
5290 local.field = NULL_TREE;
5292 for (cnt = 0;
5293 vec_safe_iterate (CONSTRUCTOR_ELTS (exp), cnt, &ce);
5294 cnt++, local.field = local.field ? DECL_CHAIN (local.field) : 0)
5296 local.val = ce->value;
5297 local.index = NULL_TREE;
5299 /* The element in a union constructor specifies the proper field
5300 or index. */
5301 if (RECORD_OR_UNION_TYPE_P (local.type) && ce->index != NULL_TREE)
5302 local.field = ce->index;
5304 else if (TREE_CODE (local.type) == ARRAY_TYPE)
5305 local.index = ce->index;
5307 if (local.field && flag_verbose_asm)
5308 fprintf (asm_out_file, "%s %s:\n",
5309 ASM_COMMENT_START,
5310 DECL_NAME (local.field)
5311 ? IDENTIFIER_POINTER (DECL_NAME (local.field))
5312 : "<anonymous>");
5314 /* Eliminate the marker that makes a cast not be an lvalue. */
5315 if (local.val != NULL_TREE)
5316 STRIP_NOPS (local.val);
5318 /* Output the current element, using the appropriate helper ... */
5320 /* For an array slice not part of an outer bitfield. */
5321 if (!outer
5322 && local.index != NULL_TREE
5323 && TREE_CODE (local.index) == RANGE_EXPR)
5324 output_constructor_array_range (&local);
5326 /* For a field that is neither a true bitfield nor part of an outer one,
5327 known to be at least byte aligned and multiple-of-bytes long. */
5328 else if (!outer
5329 && (local.field == NULL_TREE
5330 || !CONSTRUCTOR_BITFIELD_P (local.field)))
5331 output_constructor_regular_field (&local);
5333 /* For a true bitfield or part of an outer one. Only INTEGER_CSTs are
5334 supported for scalar fields, so we may need to convert first. */
5335 else
5337 if (TREE_CODE (local.val) == REAL_CST)
5338 local.val
5339 = fold_unary (VIEW_CONVERT_EXPR,
5340 build_nonstandard_integer_type
5341 (TYPE_PRECISION (TREE_TYPE (local.val)), 0),
5342 local.val);
5343 output_constructor_bitfield (&local, outer ? outer->bit_offset : 0);
5347 /* If we are not at toplevel, save the pending data for our caller.
5348 Otherwise output the pending data and padding zeros as needed. */
5349 if (outer)
5350 outer->byte = local.byte;
5351 else
5353 if (local.byte_buffer_in_use)
5355 assemble_integer (GEN_INT (local.byte), 1, BITS_PER_UNIT, 1);
5356 local.total_bytes++;
5359 if ((unsigned HOST_WIDE_INT)local.total_bytes < local.size)
5361 assemble_zeros (local.size - local.total_bytes);
5362 local.total_bytes = local.size;
5366 return local.total_bytes;
5369 /* Mark DECL as weak. */
5371 static void
5372 mark_weak (tree decl)
5374 if (DECL_WEAK (decl))
5375 return;
5377 struct symtab_node *n = symtab_node::get (decl);
5378 if (n && n->refuse_visibility_changes)
5379 error ("%+D declared weak after being used", decl);
5380 DECL_WEAK (decl) = 1;
5382 if (DECL_RTL_SET_P (decl)
5383 && MEM_P (DECL_RTL (decl))
5384 && XEXP (DECL_RTL (decl), 0)
5385 && GET_CODE (XEXP (DECL_RTL (decl), 0)) == SYMBOL_REF)
5386 SYMBOL_REF_WEAK (XEXP (DECL_RTL (decl), 0)) = 1;
5389 /* Merge weak status between NEWDECL and OLDDECL. */
5391 void
5392 merge_weak (tree newdecl, tree olddecl)
5394 if (DECL_WEAK (newdecl) == DECL_WEAK (olddecl))
5396 if (DECL_WEAK (newdecl) && TARGET_SUPPORTS_WEAK)
5398 tree *pwd;
5399 /* We put the NEWDECL on the weak_decls list at some point
5400 and OLDDECL as well. Keep just OLDDECL on the list. */
5401 for (pwd = &weak_decls; *pwd; pwd = &TREE_CHAIN (*pwd))
5402 if (TREE_VALUE (*pwd) == newdecl)
5404 *pwd = TREE_CHAIN (*pwd);
5405 break;
5408 return;
5411 if (DECL_WEAK (newdecl))
5413 tree wd;
5415 /* NEWDECL is weak, but OLDDECL is not. */
5417 /* If we already output the OLDDECL, we're in trouble; we can't
5418 go back and make it weak. This should never happen in
5419 unit-at-a-time compilation. */
5420 gcc_assert (!TREE_ASM_WRITTEN (olddecl));
5422 /* If we've already generated rtl referencing OLDDECL, we may
5423 have done so in a way that will not function properly with
5424 a weak symbol. Again in unit-at-a-time this should be
5425 impossible. */
5426 gcc_assert (!TREE_USED (olddecl)
5427 || !TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (olddecl)));
5429 /* PR 49899: You cannot convert a static function into a weak, public function. */
5430 if (! TREE_PUBLIC (olddecl) && TREE_PUBLIC (newdecl))
5431 error ("weak declaration of %q+D being applied to a already "
5432 "existing, static definition", newdecl);
5434 if (TARGET_SUPPORTS_WEAK)
5436 /* We put the NEWDECL on the weak_decls list at some point.
5437 Replace it with the OLDDECL. */
5438 for (wd = weak_decls; wd; wd = TREE_CHAIN (wd))
5439 if (TREE_VALUE (wd) == newdecl)
5441 TREE_VALUE (wd) = olddecl;
5442 break;
5444 /* We may not find the entry on the list. If NEWDECL is a
5445 weak alias, then we will have already called
5446 globalize_decl to remove the entry; in that case, we do
5447 not need to do anything. */
5450 /* Make the OLDDECL weak; it's OLDDECL that we'll be keeping. */
5451 mark_weak (olddecl);
5453 else
5454 /* OLDDECL was weak, but NEWDECL was not explicitly marked as
5455 weak. Just update NEWDECL to indicate that it's weak too. */
5456 mark_weak (newdecl);
5459 /* Declare DECL to be a weak symbol. */
5461 void
5462 declare_weak (tree decl)
5464 gcc_assert (TREE_CODE (decl) != FUNCTION_DECL || !TREE_ASM_WRITTEN (decl));
5465 if (! TREE_PUBLIC (decl))
5467 error ("weak declaration of %q+D must be public", decl);
5468 return;
5470 else if (!TARGET_SUPPORTS_WEAK)
5471 warning (0, "weak declaration of %q+D not supported", decl);
5473 mark_weak (decl);
5474 if (!lookup_attribute ("weak", DECL_ATTRIBUTES (decl)))
5475 DECL_ATTRIBUTES (decl)
5476 = tree_cons (get_identifier ("weak"), NULL, DECL_ATTRIBUTES (decl));
5479 static void
5480 weak_finish_1 (tree decl)
5482 #if defined (ASM_WEAKEN_DECL) || defined (ASM_WEAKEN_LABEL)
5483 const char *const name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
5484 #endif
5486 if (! TREE_USED (decl))
5487 return;
5489 #ifdef ASM_WEAKEN_DECL
5490 ASM_WEAKEN_DECL (asm_out_file, decl, name, NULL);
5491 #else
5492 #ifdef ASM_WEAKEN_LABEL
5493 ASM_WEAKEN_LABEL (asm_out_file, name);
5494 #else
5495 #ifdef ASM_OUTPUT_WEAK_ALIAS
5497 static bool warn_once = 0;
5498 if (! warn_once)
5500 warning (0, "only weak aliases are supported in this configuration");
5501 warn_once = 1;
5503 return;
5505 #endif
5506 #endif
5507 #endif
5510 /* Fiven an assembly name, find the decl it is associated with. */
5511 static tree
5512 find_decl (tree target)
5514 symtab_node *node = symtab_node::get_for_asmname (target);
5515 if (node)
5516 return node->decl;
5517 return NULL_TREE;
5520 /* This TREE_LIST contains weakref targets. */
5522 static GTY(()) tree weakref_targets;
5524 /* Emit any pending weak declarations. */
5526 void
5527 weak_finish (void)
5529 tree t;
5531 for (t = weakref_targets; t; t = TREE_CHAIN (t))
5533 tree alias_decl = TREE_PURPOSE (t);
5534 tree target = ultimate_transparent_alias_target (&TREE_VALUE (t));
5536 if (! TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (alias_decl)))
5537 /* Remove alias_decl from the weak list, but leave entries for
5538 the target alone. */
5539 target = NULL_TREE;
5540 #ifndef ASM_OUTPUT_WEAKREF
5541 else if (! TREE_SYMBOL_REFERENCED (target))
5543 /* Use ASM_WEAKEN_LABEL only if ASM_WEAKEN_DECL is not
5544 defined, otherwise we and weak_finish_1 would use
5545 different macros. */
5546 # if defined ASM_WEAKEN_LABEL && ! defined ASM_WEAKEN_DECL
5547 ASM_WEAKEN_LABEL (asm_out_file, IDENTIFIER_POINTER (target));
5548 # else
5549 tree decl = find_decl (target);
5551 if (! decl)
5553 decl = build_decl (DECL_SOURCE_LOCATION (alias_decl),
5554 TREE_CODE (alias_decl), target,
5555 TREE_TYPE (alias_decl));
5557 DECL_EXTERNAL (decl) = 1;
5558 TREE_PUBLIC (decl) = 1;
5559 DECL_ARTIFICIAL (decl) = 1;
5560 TREE_NOTHROW (decl) = TREE_NOTHROW (alias_decl);
5561 TREE_USED (decl) = 1;
5564 weak_finish_1 (decl);
5565 # endif
5567 #endif
5570 tree *p;
5571 tree t2;
5573 /* Remove the alias and the target from the pending weak list
5574 so that we do not emit any .weak directives for the former,
5575 nor multiple .weak directives for the latter. */
5576 for (p = &weak_decls; (t2 = *p) ; )
5578 if (TREE_VALUE (t2) == alias_decl
5579 || target == DECL_ASSEMBLER_NAME (TREE_VALUE (t2)))
5580 *p = TREE_CHAIN (t2);
5581 else
5582 p = &TREE_CHAIN (t2);
5585 /* Remove other weakrefs to the same target, to speed things up. */
5586 for (p = &TREE_CHAIN (t); (t2 = *p) ; )
5588 if (target == ultimate_transparent_alias_target (&TREE_VALUE (t2)))
5589 *p = TREE_CHAIN (t2);
5590 else
5591 p = &TREE_CHAIN (t2);
5596 for (t = weak_decls; t; t = TREE_CHAIN (t))
5598 tree decl = TREE_VALUE (t);
5600 weak_finish_1 (decl);
5604 /* Emit the assembly bits to indicate that DECL is globally visible. */
5606 static void
5607 globalize_decl (tree decl)
5610 #if defined (ASM_WEAKEN_LABEL) || defined (ASM_WEAKEN_DECL)
5611 if (DECL_WEAK (decl))
5613 const char *name = XSTR (XEXP (DECL_RTL (decl), 0), 0);
5614 tree *p, t;
5616 #ifdef ASM_WEAKEN_DECL
5617 ASM_WEAKEN_DECL (asm_out_file, decl, name, 0);
5618 #else
5619 ASM_WEAKEN_LABEL (asm_out_file, name);
5620 #endif
5622 /* Remove this function from the pending weak list so that
5623 we do not emit multiple .weak directives for it. */
5624 for (p = &weak_decls; (t = *p) ; )
5626 if (DECL_ASSEMBLER_NAME (decl) == DECL_ASSEMBLER_NAME (TREE_VALUE (t)))
5627 *p = TREE_CHAIN (t);
5628 else
5629 p = &TREE_CHAIN (t);
5632 /* Remove weakrefs to the same target from the pending weakref
5633 list, for the same reason. */
5634 for (p = &weakref_targets; (t = *p) ; )
5636 if (DECL_ASSEMBLER_NAME (decl)
5637 == ultimate_transparent_alias_target (&TREE_VALUE (t)))
5638 *p = TREE_CHAIN (t);
5639 else
5640 p = &TREE_CHAIN (t);
5643 return;
5645 #endif
5647 targetm.asm_out.globalize_decl_name (asm_out_file, decl);
5650 vec<alias_pair, va_gc> *alias_pairs;
5652 /* Output the assembler code for a define (equate) using ASM_OUTPUT_DEF
5653 or ASM_OUTPUT_DEF_FROM_DECLS. The function defines the symbol whose
5654 tree node is DECL to have the value of the tree node TARGET. */
5656 void
5657 do_assemble_alias (tree decl, tree target)
5659 tree id;
5661 /* Emulated TLS had better not get this var. */
5662 gcc_assert (!(!targetm.have_tls
5663 && VAR_P (decl)
5664 && DECL_THREAD_LOCAL_P (decl)));
5666 if (TREE_ASM_WRITTEN (decl))
5667 return;
5669 id = DECL_ASSEMBLER_NAME (decl);
5670 ultimate_transparent_alias_target (&id);
5671 ultimate_transparent_alias_target (&target);
5673 /* We must force creation of DECL_RTL for debug info generation, even though
5674 we don't use it here. */
5675 make_decl_rtl (decl);
5677 TREE_ASM_WRITTEN (decl) = 1;
5678 TREE_ASM_WRITTEN (DECL_ASSEMBLER_NAME (decl)) = 1;
5679 TREE_ASM_WRITTEN (id) = 1;
5681 if (lookup_attribute ("weakref", DECL_ATTRIBUTES (decl)))
5683 if (!TREE_SYMBOL_REFERENCED (target))
5684 weakref_targets = tree_cons (decl, target, weakref_targets);
5686 #ifdef ASM_OUTPUT_WEAKREF
5687 ASM_OUTPUT_WEAKREF (asm_out_file, decl,
5688 IDENTIFIER_POINTER (id),
5689 IDENTIFIER_POINTER (target));
5690 #else
5691 if (!TARGET_SUPPORTS_WEAK)
5693 error_at (DECL_SOURCE_LOCATION (decl),
5694 "weakref is not supported in this configuration");
5695 return;
5697 #endif
5698 return;
5701 #ifdef ASM_OUTPUT_DEF
5702 tree orig_decl = decl;
5704 if (TREE_CODE (decl) == FUNCTION_DECL
5705 && cgraph_node::get (decl)->instrumentation_clone
5706 && cgraph_node::get (decl)->instrumented_version)
5707 orig_decl = cgraph_node::get (decl)->instrumented_version->decl;
5709 /* Make name accessible from other files, if appropriate. */
5711 if (TREE_PUBLIC (decl) || TREE_PUBLIC (orig_decl))
5713 globalize_decl (decl);
5714 maybe_assemble_visibility (decl);
5716 if (lookup_attribute ("ifunc", DECL_ATTRIBUTES (decl)))
5718 #if defined (ASM_OUTPUT_TYPE_DIRECTIVE)
5719 if (targetm.has_ifunc_p ())
5720 ASM_OUTPUT_TYPE_DIRECTIVE
5721 (asm_out_file, IDENTIFIER_POINTER (id),
5722 IFUNC_ASM_TYPE);
5723 else
5724 #endif
5725 error_at (DECL_SOURCE_LOCATION (decl),
5726 "ifunc is not supported on this target");
5729 # ifdef ASM_OUTPUT_DEF_FROM_DECLS
5730 ASM_OUTPUT_DEF_FROM_DECLS (asm_out_file, decl, target);
5731 # else
5732 ASM_OUTPUT_DEF (asm_out_file,
5733 IDENTIFIER_POINTER (id),
5734 IDENTIFIER_POINTER (target));
5735 # endif
5736 #elif defined (ASM_OUTPUT_WEAK_ALIAS) || defined (ASM_WEAKEN_DECL)
5738 const char *name;
5739 tree *p, t;
5741 name = IDENTIFIER_POINTER (id);
5742 # ifdef ASM_WEAKEN_DECL
5743 ASM_WEAKEN_DECL (asm_out_file, decl, name, IDENTIFIER_POINTER (target));
5744 # else
5745 ASM_OUTPUT_WEAK_ALIAS (asm_out_file, name, IDENTIFIER_POINTER (target));
5746 # endif
5747 /* Remove this function from the pending weak list so that
5748 we do not emit multiple .weak directives for it. */
5749 for (p = &weak_decls; (t = *p) ; )
5750 if (DECL_ASSEMBLER_NAME (decl) == DECL_ASSEMBLER_NAME (TREE_VALUE (t))
5751 || id == DECL_ASSEMBLER_NAME (TREE_VALUE (t)))
5752 *p = TREE_CHAIN (t);
5753 else
5754 p = &TREE_CHAIN (t);
5756 /* Remove weakrefs to the same target from the pending weakref
5757 list, for the same reason. */
5758 for (p = &weakref_targets; (t = *p) ; )
5760 if (id == ultimate_transparent_alias_target (&TREE_VALUE (t)))
5761 *p = TREE_CHAIN (t);
5762 else
5763 p = &TREE_CHAIN (t);
5766 #endif
5769 /* Emit an assembler directive to make the symbol for DECL an alias to
5770 the symbol for TARGET. */
5772 void
5773 assemble_alias (tree decl, tree target)
5775 tree target_decl;
5777 if (lookup_attribute ("weakref", DECL_ATTRIBUTES (decl)))
5779 tree alias = DECL_ASSEMBLER_NAME (decl);
5781 ultimate_transparent_alias_target (&target);
5783 if (alias == target)
5784 error ("weakref %q+D ultimately targets itself", decl);
5785 if (TREE_PUBLIC (decl))
5786 error ("weakref %q+D must have static linkage", decl);
5788 else
5790 #if !defined (ASM_OUTPUT_DEF)
5791 # if !defined(ASM_OUTPUT_WEAK_ALIAS) && !defined (ASM_WEAKEN_DECL)
5792 error_at (DECL_SOURCE_LOCATION (decl),
5793 "alias definitions not supported in this configuration");
5794 TREE_ASM_WRITTEN (decl) = 1;
5795 return;
5796 # else
5797 if (!DECL_WEAK (decl))
5799 if (lookup_attribute ("ifunc", DECL_ATTRIBUTES (decl)))
5800 error_at (DECL_SOURCE_LOCATION (decl),
5801 "ifunc is not supported in this configuration");
5802 else
5803 error_at (DECL_SOURCE_LOCATION (decl),
5804 "only weak aliases are supported in this configuration");
5805 TREE_ASM_WRITTEN (decl) = 1;
5806 return;
5808 # endif
5809 #endif
5811 TREE_USED (decl) = 1;
5813 /* Allow aliases to aliases. */
5814 if (TREE_CODE (decl) == FUNCTION_DECL)
5815 cgraph_node::get_create (decl)->alias = true;
5816 else
5817 varpool_node::get_create (decl)->alias = true;
5819 /* If the target has already been emitted, we don't have to queue the
5820 alias. This saves a tad of memory. */
5821 if (symtab->global_info_ready)
5822 target_decl = find_decl (target);
5823 else
5824 target_decl= NULL;
5825 if ((target_decl && TREE_ASM_WRITTEN (target_decl))
5826 || symtab->state >= EXPANSION)
5827 do_assemble_alias (decl, target);
5828 else
5830 alias_pair p = {decl, target};
5831 vec_safe_push (alias_pairs, p);
5835 /* Record and output a table of translations from original function
5836 to its transaction aware clone. Note that tm_pure functions are
5837 considered to be their own clone. */
5839 struct tm_clone_hasher : ggc_cache_ptr_hash<tree_map>
5841 static hashval_t hash (tree_map *m) { return tree_map_hash (m); }
5842 static bool equal (tree_map *a, tree_map *b) { return tree_map_eq (a, b); }
5844 static int
5845 keep_cache_entry (tree_map *&e)
5847 return ggc_marked_p (e->base.from);
5851 static GTY((cache)) hash_table<tm_clone_hasher> *tm_clone_hash;
5853 void
5854 record_tm_clone_pair (tree o, tree n)
5856 struct tree_map **slot, *h;
5858 if (tm_clone_hash == NULL)
5859 tm_clone_hash = hash_table<tm_clone_hasher>::create_ggc (32);
5861 h = ggc_alloc<tree_map> ();
5862 h->hash = htab_hash_pointer (o);
5863 h->base.from = o;
5864 h->to = n;
5866 slot = tm_clone_hash->find_slot_with_hash (h, h->hash, INSERT);
5867 *slot = h;
5870 tree
5871 get_tm_clone_pair (tree o)
5873 if (tm_clone_hash)
5875 struct tree_map *h, in;
5877 in.base.from = o;
5878 in.hash = htab_hash_pointer (o);
5879 h = tm_clone_hash->find_with_hash (&in, in.hash);
5880 if (h)
5881 return h->to;
5883 return NULL_TREE;
5886 struct tm_alias_pair
5888 unsigned int uid;
5889 tree from;
5890 tree to;
5894 /* Dump the actual pairs to the .tm_clone_table section. */
5896 static void
5897 dump_tm_clone_pairs (vec<tm_alias_pair> tm_alias_pairs)
5899 unsigned i;
5900 tm_alias_pair *p;
5901 bool switched = false;
5903 FOR_EACH_VEC_ELT (tm_alias_pairs, i, p)
5905 tree src = p->from;
5906 tree dst = p->to;
5907 struct cgraph_node *src_n = cgraph_node::get (src);
5908 struct cgraph_node *dst_n = cgraph_node::get (dst);
5910 /* The function ipa_tm_create_version() marks the clone as needed if
5911 the original function was needed. But we also mark the clone as
5912 needed if we ever called the clone indirectly through
5913 TM_GETTMCLONE. If neither of these are true, we didn't generate
5914 a clone, and we didn't call it indirectly... no sense keeping it
5915 in the clone table. */
5916 if (!dst_n || !dst_n->definition)
5917 continue;
5919 /* This covers the case where we have optimized the original
5920 function away, and only access the transactional clone. */
5921 if (!src_n || !src_n->definition)
5922 continue;
5924 if (!switched)
5926 switch_to_section (targetm.asm_out.tm_clone_table_section ());
5927 assemble_align (POINTER_SIZE);
5928 switched = true;
5931 assemble_integer (XEXP (DECL_RTL (src), 0),
5932 POINTER_SIZE_UNITS, POINTER_SIZE, 1);
5933 assemble_integer (XEXP (DECL_RTL (dst), 0),
5934 POINTER_SIZE_UNITS, POINTER_SIZE, 1);
5938 /* Provide a default for the tm_clone_table section. */
5940 section *
5941 default_clone_table_section (void)
5943 return get_named_section (NULL, ".tm_clone_table", 3);
5946 /* Helper comparison function for qsorting by the DECL_UID stored in
5947 alias_pair->emitted_diags. */
5949 static int
5950 tm_alias_pair_cmp (const void *x, const void *y)
5952 const tm_alias_pair *p1 = (const tm_alias_pair *) x;
5953 const tm_alias_pair *p2 = (const tm_alias_pair *) y;
5954 if (p1->uid < p2->uid)
5955 return -1;
5956 if (p1->uid > p2->uid)
5957 return 1;
5958 return 0;
5961 void
5962 finish_tm_clone_pairs (void)
5964 vec<tm_alias_pair> tm_alias_pairs = vNULL;
5966 if (tm_clone_hash == NULL)
5967 return;
5969 /* We need a determenistic order for the .tm_clone_table, otherwise
5970 we will get bootstrap comparison failures, so dump the hash table
5971 to a vector, sort it, and dump the vector. */
5973 /* Dump the hashtable to a vector. */
5974 tree_map *map;
5975 hash_table<tm_clone_hasher>::iterator iter;
5976 FOR_EACH_HASH_TABLE_ELEMENT (*tm_clone_hash, map, tree_map *, iter)
5978 tm_alias_pair p = {DECL_UID (map->base.from), map->base.from, map->to};
5979 tm_alias_pairs.safe_push (p);
5981 /* Sort it. */
5982 tm_alias_pairs.qsort (tm_alias_pair_cmp);
5984 /* Dump it. */
5985 dump_tm_clone_pairs (tm_alias_pairs);
5987 tm_clone_hash->empty ();
5988 tm_clone_hash = NULL;
5989 tm_alias_pairs.release ();
5993 /* Emit an assembler directive to set symbol for DECL visibility to
5994 the visibility type VIS, which must not be VISIBILITY_DEFAULT. */
5996 void
5997 default_assemble_visibility (tree decl ATTRIBUTE_UNUSED,
5998 int vis ATTRIBUTE_UNUSED)
6000 #ifdef HAVE_GAS_HIDDEN
6001 static const char * const visibility_types[] = {
6002 NULL, "protected", "hidden", "internal"
6005 const char *name, *type;
6006 tree id;
6008 id = DECL_ASSEMBLER_NAME (decl);
6009 ultimate_transparent_alias_target (&id);
6010 name = IDENTIFIER_POINTER (id);
6012 type = visibility_types[vis];
6014 fprintf (asm_out_file, "\t.%s\t", type);
6015 assemble_name (asm_out_file, name);
6016 fprintf (asm_out_file, "\n");
6017 #else
6018 if (!DECL_ARTIFICIAL (decl))
6019 warning (OPT_Wattributes, "visibility attribute not supported "
6020 "in this configuration; ignored");
6021 #endif
6024 /* A helper function to call assemble_visibility when needed for a decl. */
6027 maybe_assemble_visibility (tree decl)
6029 enum symbol_visibility vis = DECL_VISIBILITY (decl);
6031 if (TREE_CODE (decl) == FUNCTION_DECL
6032 && cgraph_node::get (decl)
6033 && cgraph_node::get (decl)->instrumentation_clone
6034 && cgraph_node::get (decl)->instrumented_version)
6035 vis = DECL_VISIBILITY (cgraph_node::get (decl)->instrumented_version->decl);
6037 if (vis != VISIBILITY_DEFAULT)
6039 targetm.asm_out.assemble_visibility (decl, vis);
6040 return 1;
6042 else
6043 return 0;
6046 /* Returns 1 if the target configuration supports defining public symbols
6047 so that one of them will be chosen at link time instead of generating a
6048 multiply-defined symbol error, whether through the use of weak symbols or
6049 a target-specific mechanism for having duplicates discarded. */
6052 supports_one_only (void)
6054 if (SUPPORTS_ONE_ONLY)
6055 return 1;
6056 return TARGET_SUPPORTS_WEAK;
6059 /* Set up DECL as a public symbol that can be defined in multiple
6060 translation units without generating a linker error. */
6062 void
6063 make_decl_one_only (tree decl, tree comdat_group)
6065 struct symtab_node *symbol;
6066 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl));
6068 TREE_PUBLIC (decl) = 1;
6070 if (VAR_P (decl))
6071 symbol = varpool_node::get_create (decl);
6072 else
6073 symbol = cgraph_node::get_create (decl);
6075 if (SUPPORTS_ONE_ONLY)
6077 #ifdef MAKE_DECL_ONE_ONLY
6078 MAKE_DECL_ONE_ONLY (decl);
6079 #endif
6080 symbol->set_comdat_group (comdat_group);
6082 else if (VAR_P (decl)
6083 && (DECL_INITIAL (decl) == 0
6084 || (!in_lto_p && DECL_INITIAL (decl) == error_mark_node)))
6085 DECL_COMMON (decl) = 1;
6086 else
6088 gcc_assert (TARGET_SUPPORTS_WEAK);
6089 DECL_WEAK (decl) = 1;
6093 void
6094 init_varasm_once (void)
6096 section_htab = hash_table<section_hasher>::create_ggc (31);
6097 object_block_htab = hash_table<object_block_hasher>::create_ggc (31);
6098 const_desc_htab = hash_table<tree_descriptor_hasher>::create_ggc (1009);
6100 shared_constant_pool = create_constant_pool ();
6102 #ifdef TEXT_SECTION_ASM_OP
6103 text_section = get_unnamed_section (SECTION_CODE, output_section_asm_op,
6104 TEXT_SECTION_ASM_OP);
6105 #endif
6107 #ifdef DATA_SECTION_ASM_OP
6108 data_section = get_unnamed_section (SECTION_WRITE, output_section_asm_op,
6109 DATA_SECTION_ASM_OP);
6110 #endif
6112 #ifdef SDATA_SECTION_ASM_OP
6113 sdata_section = get_unnamed_section (SECTION_WRITE, output_section_asm_op,
6114 SDATA_SECTION_ASM_OP);
6115 #endif
6117 #ifdef READONLY_DATA_SECTION_ASM_OP
6118 readonly_data_section = get_unnamed_section (0, output_section_asm_op,
6119 READONLY_DATA_SECTION_ASM_OP);
6120 #endif
6122 #ifdef CTORS_SECTION_ASM_OP
6123 ctors_section = get_unnamed_section (0, output_section_asm_op,
6124 CTORS_SECTION_ASM_OP);
6125 #endif
6127 #ifdef DTORS_SECTION_ASM_OP
6128 dtors_section = get_unnamed_section (0, output_section_asm_op,
6129 DTORS_SECTION_ASM_OP);
6130 #endif
6132 #ifdef BSS_SECTION_ASM_OP
6133 bss_section = get_unnamed_section (SECTION_WRITE | SECTION_BSS,
6134 output_section_asm_op,
6135 BSS_SECTION_ASM_OP);
6136 #endif
6138 #ifdef SBSS_SECTION_ASM_OP
6139 sbss_section = get_unnamed_section (SECTION_WRITE | SECTION_BSS,
6140 output_section_asm_op,
6141 SBSS_SECTION_ASM_OP);
6142 #endif
6144 tls_comm_section = get_noswitch_section (SECTION_WRITE | SECTION_BSS
6145 | SECTION_COMMON, emit_tls_common);
6146 lcomm_section = get_noswitch_section (SECTION_WRITE | SECTION_BSS
6147 | SECTION_COMMON, emit_local);
6148 comm_section = get_noswitch_section (SECTION_WRITE | SECTION_BSS
6149 | SECTION_COMMON, emit_common);
6151 #if defined ASM_OUTPUT_ALIGNED_BSS
6152 bss_noswitch_section = get_noswitch_section (SECTION_WRITE | SECTION_BSS,
6153 emit_bss);
6154 #endif
6156 targetm.asm_out.init_sections ();
6158 if (readonly_data_section == NULL)
6159 readonly_data_section = text_section;
6161 #ifdef ASM_OUTPUT_EXTERNAL
6162 pending_assemble_externals_set = new hash_set<tree>;
6163 #endif
6166 enum tls_model
6167 decl_default_tls_model (const_tree decl)
6169 enum tls_model kind;
6170 bool is_local;
6172 is_local = targetm.binds_local_p (decl);
6173 if (!flag_shlib)
6175 if (is_local)
6176 kind = TLS_MODEL_LOCAL_EXEC;
6177 else
6178 kind = TLS_MODEL_INITIAL_EXEC;
6181 /* Local dynamic is inefficient when we're not combining the
6182 parts of the address. */
6183 else if (optimize && is_local)
6184 kind = TLS_MODEL_LOCAL_DYNAMIC;
6185 else
6186 kind = TLS_MODEL_GLOBAL_DYNAMIC;
6187 if (kind < flag_tls_default)
6188 kind = flag_tls_default;
6190 return kind;
6193 /* Select a set of attributes for section NAME based on the properties
6194 of DECL and whether or not RELOC indicates that DECL's initializer
6195 might contain runtime relocations.
6197 We make the section read-only and executable for a function decl,
6198 read-only for a const data decl, and writable for a non-const data decl. */
6200 unsigned int
6201 default_section_type_flags (tree decl, const char *name, int reloc)
6203 unsigned int flags;
6205 if (decl && TREE_CODE (decl) == FUNCTION_DECL)
6206 flags = SECTION_CODE;
6207 else if (decl)
6209 enum section_category category
6210 = categorize_decl_for_section (decl, reloc);
6211 if (decl_readonly_section_1 (category))
6212 flags = 0;
6213 else if (category == SECCAT_DATA_REL_RO
6214 || category == SECCAT_DATA_REL_RO_LOCAL)
6215 flags = SECTION_WRITE | SECTION_RELRO;
6216 else
6217 flags = SECTION_WRITE;
6219 else
6221 flags = SECTION_WRITE;
6222 if (strcmp (name, ".data.rel.ro") == 0
6223 || strcmp (name, ".data.rel.ro.local") == 0)
6224 flags |= SECTION_RELRO;
6227 if (decl && DECL_P (decl) && DECL_COMDAT_GROUP (decl))
6228 flags |= SECTION_LINKONCE;
6230 if (strcmp (name, ".vtable_map_vars") == 0)
6231 flags |= SECTION_LINKONCE;
6233 if (decl && VAR_P (decl) && DECL_THREAD_LOCAL_P (decl))
6234 flags |= SECTION_TLS | SECTION_WRITE;
6236 if (strcmp (name, ".bss") == 0
6237 || strncmp (name, ".bss.", 5) == 0
6238 || strncmp (name, ".gnu.linkonce.b.", 16) == 0
6239 || strcmp (name, ".persistent.bss") == 0
6240 || strcmp (name, ".sbss") == 0
6241 || strncmp (name, ".sbss.", 6) == 0
6242 || strncmp (name, ".gnu.linkonce.sb.", 17) == 0)
6243 flags |= SECTION_BSS;
6245 if (strcmp (name, ".tdata") == 0
6246 || strncmp (name, ".tdata.", 7) == 0
6247 || strncmp (name, ".gnu.linkonce.td.", 17) == 0)
6248 flags |= SECTION_TLS;
6250 if (strcmp (name, ".tbss") == 0
6251 || strncmp (name, ".tbss.", 6) == 0
6252 || strncmp (name, ".gnu.linkonce.tb.", 17) == 0)
6253 flags |= SECTION_TLS | SECTION_BSS;
6255 /* These three sections have special ELF types. They are neither
6256 SHT_PROGBITS nor SHT_NOBITS, so when changing sections we don't
6257 want to print a section type (@progbits or @nobits). If someone
6258 is silly enough to emit code or TLS variables to one of these
6259 sections, then don't handle them specially. */
6260 if (!(flags & (SECTION_CODE | SECTION_BSS | SECTION_TLS))
6261 && (strcmp (name, ".init_array") == 0
6262 || strcmp (name, ".fini_array") == 0
6263 || strcmp (name, ".preinit_array") == 0))
6264 flags |= SECTION_NOTYPE;
6266 return flags;
6269 /* Return true if the target supports some form of global BSS,
6270 either through bss_noswitch_section, or by selecting a BSS
6271 section in TARGET_ASM_SELECT_SECTION. */
6273 bool
6274 have_global_bss_p (void)
6276 return bss_noswitch_section || targetm.have_switchable_bss_sections;
6279 /* Output assembly to switch to section NAME with attribute FLAGS.
6280 Four variants for common object file formats. */
6282 void
6283 default_no_named_section (const char *name ATTRIBUTE_UNUSED,
6284 unsigned int flags ATTRIBUTE_UNUSED,
6285 tree decl ATTRIBUTE_UNUSED)
6287 /* Some object formats don't support named sections at all. The
6288 front-end should already have flagged this as an error. */
6289 gcc_unreachable ();
6292 #ifndef TLS_SECTION_ASM_FLAG
6293 #define TLS_SECTION_ASM_FLAG 'T'
6294 #endif
6296 void
6297 default_elf_asm_named_section (const char *name, unsigned int flags,
6298 tree decl)
6300 char flagchars[11], *f = flagchars;
6301 unsigned int numeric_value = 0;
6303 /* If we have already declared this section, we can use an
6304 abbreviated form to switch back to it -- unless this section is
6305 part of a COMDAT groups, in which case GAS requires the full
6306 declaration every time. */
6307 if (!(HAVE_COMDAT_GROUP && (flags & SECTION_LINKONCE))
6308 && (flags & SECTION_DECLARED))
6310 fprintf (asm_out_file, "\t.section\t%s\n", name);
6311 return;
6314 /* If we have a machine specific flag, then use the numeric value to pass
6315 this on to GAS. */
6316 if (targetm.asm_out.elf_flags_numeric (flags, &numeric_value))
6317 snprintf (f, sizeof (flagchars), "0x%08x", numeric_value);
6318 else
6320 if (!(flags & SECTION_DEBUG))
6321 *f++ = 'a';
6322 #if defined (HAVE_GAS_SECTION_EXCLUDE) && HAVE_GAS_SECTION_EXCLUDE == 1
6323 if (flags & SECTION_EXCLUDE)
6324 *f++ = 'e';
6325 #endif
6326 if (flags & SECTION_WRITE)
6327 *f++ = 'w';
6328 if (flags & SECTION_CODE)
6329 *f++ = 'x';
6330 if (flags & SECTION_SMALL)
6331 *f++ = 's';
6332 if (flags & SECTION_MERGE)
6333 *f++ = 'M';
6334 if (flags & SECTION_STRINGS)
6335 *f++ = 'S';
6336 if (flags & SECTION_TLS)
6337 *f++ = TLS_SECTION_ASM_FLAG;
6338 if (HAVE_COMDAT_GROUP && (flags & SECTION_LINKONCE))
6339 *f++ = 'G';
6340 #ifdef MACH_DEP_SECTION_ASM_FLAG
6341 if (flags & SECTION_MACH_DEP)
6342 *f++ = MACH_DEP_SECTION_ASM_FLAG;
6343 #endif
6344 *f = '\0';
6347 fprintf (asm_out_file, "\t.section\t%s,\"%s\"", name, flagchars);
6349 if (!(flags & SECTION_NOTYPE))
6351 const char *type;
6352 const char *format;
6354 if (flags & SECTION_BSS)
6355 type = "nobits";
6356 else
6357 type = "progbits";
6359 format = ",@%s";
6360 /* On platforms that use "@" as the assembly comment character,
6361 use "%" instead. */
6362 if (strcmp (ASM_COMMENT_START, "@") == 0)
6363 format = ",%%%s";
6364 fprintf (asm_out_file, format, type);
6366 if (flags & SECTION_ENTSIZE)
6367 fprintf (asm_out_file, ",%d", flags & SECTION_ENTSIZE);
6368 if (HAVE_COMDAT_GROUP && (flags & SECTION_LINKONCE))
6370 if (TREE_CODE (decl) == IDENTIFIER_NODE)
6371 fprintf (asm_out_file, ",%s,comdat", IDENTIFIER_POINTER (decl));
6372 else
6373 fprintf (asm_out_file, ",%s,comdat",
6374 IDENTIFIER_POINTER (DECL_COMDAT_GROUP (decl)));
6378 putc ('\n', asm_out_file);
6381 void
6382 default_coff_asm_named_section (const char *name, unsigned int flags,
6383 tree decl ATTRIBUTE_UNUSED)
6385 char flagchars[8], *f = flagchars;
6387 if (flags & SECTION_WRITE)
6388 *f++ = 'w';
6389 if (flags & SECTION_CODE)
6390 *f++ = 'x';
6391 *f = '\0';
6393 fprintf (asm_out_file, "\t.section\t%s,\"%s\"\n", name, flagchars);
6396 void
6397 default_pe_asm_named_section (const char *name, unsigned int flags,
6398 tree decl)
6400 default_coff_asm_named_section (name, flags, decl);
6402 if (flags & SECTION_LINKONCE)
6404 /* Functions may have been compiled at various levels of
6405 optimization so we can't use `same_size' here.
6406 Instead, have the linker pick one. */
6407 fprintf (asm_out_file, "\t.linkonce %s\n",
6408 (flags & SECTION_CODE ? "discard" : "same_size"));
6412 /* The lame default section selector. */
6414 section *
6415 default_select_section (tree decl, int reloc,
6416 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED)
6418 if (DECL_P (decl))
6420 if (decl_readonly_section (decl, reloc))
6421 return readonly_data_section;
6423 else if (TREE_CODE (decl) == CONSTRUCTOR)
6425 if (! ((flag_pic && reloc)
6426 || !TREE_READONLY (decl)
6427 || TREE_SIDE_EFFECTS (decl)
6428 || !TREE_CONSTANT (decl)))
6429 return readonly_data_section;
6431 else if (TREE_CODE (decl) == STRING_CST)
6432 return readonly_data_section;
6433 else if (! (flag_pic && reloc))
6434 return readonly_data_section;
6436 return data_section;
6439 enum section_category
6440 categorize_decl_for_section (const_tree decl, int reloc)
6442 enum section_category ret;
6444 if (TREE_CODE (decl) == FUNCTION_DECL)
6445 return SECCAT_TEXT;
6446 else if (TREE_CODE (decl) == STRING_CST)
6448 if ((flag_sanitize & SANITIZE_ADDRESS)
6449 && asan_protect_global (CONST_CAST_TREE (decl)))
6450 /* or !flag_merge_constants */
6451 return SECCAT_RODATA;
6452 else
6453 return SECCAT_RODATA_MERGE_STR;
6455 else if (VAR_P (decl))
6457 if (bss_initializer_p (decl))
6458 ret = SECCAT_BSS;
6459 else if (! TREE_READONLY (decl)
6460 || TREE_SIDE_EFFECTS (decl)
6461 || ! TREE_CONSTANT (DECL_INITIAL (decl)))
6463 /* Here the reloc_rw_mask is not testing whether the section should
6464 be read-only or not, but whether the dynamic link will have to
6465 do something. If so, we wish to segregate the data in order to
6466 minimize cache misses inside the dynamic linker. */
6467 if (reloc & targetm.asm_out.reloc_rw_mask ())
6468 ret = reloc == 1 ? SECCAT_DATA_REL_LOCAL : SECCAT_DATA_REL;
6469 else
6470 ret = SECCAT_DATA;
6472 else if (reloc & targetm.asm_out.reloc_rw_mask ())
6473 ret = reloc == 1 ? SECCAT_DATA_REL_RO_LOCAL : SECCAT_DATA_REL_RO;
6474 else if (reloc || flag_merge_constants < 2
6475 || ((flag_sanitize & SANITIZE_ADDRESS)
6476 && asan_protect_global (CONST_CAST_TREE (decl))))
6477 /* C and C++ don't allow different variables to share the same
6478 location. -fmerge-all-constants allows even that (at the
6479 expense of not conforming). */
6480 ret = SECCAT_RODATA;
6481 else if (TREE_CODE (DECL_INITIAL (decl)) == STRING_CST)
6482 ret = SECCAT_RODATA_MERGE_STR_INIT;
6483 else
6484 ret = SECCAT_RODATA_MERGE_CONST;
6486 else if (TREE_CODE (decl) == CONSTRUCTOR)
6488 if ((reloc & targetm.asm_out.reloc_rw_mask ())
6489 || TREE_SIDE_EFFECTS (decl)
6490 || ! TREE_CONSTANT (decl))
6491 ret = SECCAT_DATA;
6492 else
6493 ret = SECCAT_RODATA;
6495 else
6496 ret = SECCAT_RODATA;
6498 /* There are no read-only thread-local sections. */
6499 if (VAR_P (decl) && DECL_THREAD_LOCAL_P (decl))
6501 /* Note that this would be *just* SECCAT_BSS, except that there's
6502 no concept of a read-only thread-local-data section. */
6503 if (ret == SECCAT_BSS
6504 || (flag_zero_initialized_in_bss
6505 && initializer_zerop (DECL_INITIAL (decl))))
6506 ret = SECCAT_TBSS;
6507 else
6508 ret = SECCAT_TDATA;
6511 /* If the target uses small data sections, select it. */
6512 else if (targetm.in_small_data_p (decl))
6514 if (ret == SECCAT_BSS)
6515 ret = SECCAT_SBSS;
6516 else if (targetm.have_srodata_section && ret == SECCAT_RODATA)
6517 ret = SECCAT_SRODATA;
6518 else
6519 ret = SECCAT_SDATA;
6522 return ret;
6525 static bool
6526 decl_readonly_section_1 (enum section_category category)
6528 switch (category)
6530 case SECCAT_RODATA:
6531 case SECCAT_RODATA_MERGE_STR:
6532 case SECCAT_RODATA_MERGE_STR_INIT:
6533 case SECCAT_RODATA_MERGE_CONST:
6534 case SECCAT_SRODATA:
6535 return true;
6536 default:
6537 return false;
6541 bool
6542 decl_readonly_section (const_tree decl, int reloc)
6544 return decl_readonly_section_1 (categorize_decl_for_section (decl, reloc));
6547 /* Select a section based on the above categorization. */
6549 section *
6550 default_elf_select_section (tree decl, int reloc,
6551 unsigned HOST_WIDE_INT align)
6553 const char *sname;
6554 switch (categorize_decl_for_section (decl, reloc))
6556 case SECCAT_TEXT:
6557 /* We're not supposed to be called on FUNCTION_DECLs. */
6558 gcc_unreachable ();
6559 case SECCAT_RODATA:
6560 return readonly_data_section;
6561 case SECCAT_RODATA_MERGE_STR:
6562 return mergeable_string_section (decl, align, 0);
6563 case SECCAT_RODATA_MERGE_STR_INIT:
6564 return mergeable_string_section (DECL_INITIAL (decl), align, 0);
6565 case SECCAT_RODATA_MERGE_CONST:
6566 return mergeable_constant_section (DECL_MODE (decl), align, 0);
6567 case SECCAT_SRODATA:
6568 sname = ".sdata2";
6569 break;
6570 case SECCAT_DATA:
6571 return data_section;
6572 case SECCAT_DATA_REL:
6573 sname = ".data.rel";
6574 break;
6575 case SECCAT_DATA_REL_LOCAL:
6576 sname = ".data.rel.local";
6577 break;
6578 case SECCAT_DATA_REL_RO:
6579 sname = ".data.rel.ro";
6580 break;
6581 case SECCAT_DATA_REL_RO_LOCAL:
6582 sname = ".data.rel.ro.local";
6583 break;
6584 case SECCAT_SDATA:
6585 sname = ".sdata";
6586 break;
6587 case SECCAT_TDATA:
6588 sname = ".tdata";
6589 break;
6590 case SECCAT_BSS:
6591 if (bss_section)
6592 return bss_section;
6593 sname = ".bss";
6594 break;
6595 case SECCAT_SBSS:
6596 sname = ".sbss";
6597 break;
6598 case SECCAT_TBSS:
6599 sname = ".tbss";
6600 break;
6601 default:
6602 gcc_unreachable ();
6605 return get_named_section (decl, sname, reloc);
6608 /* Construct a unique section name based on the decl name and the
6609 categorization performed above. */
6611 void
6612 default_unique_section (tree decl, int reloc)
6614 /* We only need to use .gnu.linkonce if we don't have COMDAT groups. */
6615 bool one_only = DECL_ONE_ONLY (decl) && !HAVE_COMDAT_GROUP;
6616 const char *prefix, *name, *linkonce;
6617 char *string;
6618 tree id;
6620 switch (categorize_decl_for_section (decl, reloc))
6622 case SECCAT_TEXT:
6623 prefix = one_only ? ".t" : ".text";
6624 break;
6625 case SECCAT_RODATA:
6626 case SECCAT_RODATA_MERGE_STR:
6627 case SECCAT_RODATA_MERGE_STR_INIT:
6628 case SECCAT_RODATA_MERGE_CONST:
6629 prefix = one_only ? ".r" : ".rodata";
6630 break;
6631 case SECCAT_SRODATA:
6632 prefix = one_only ? ".s2" : ".sdata2";
6633 break;
6634 case SECCAT_DATA:
6635 prefix = one_only ? ".d" : ".data";
6636 break;
6637 case SECCAT_DATA_REL:
6638 prefix = one_only ? ".d.rel" : ".data.rel";
6639 break;
6640 case SECCAT_DATA_REL_LOCAL:
6641 prefix = one_only ? ".d.rel.local" : ".data.rel.local";
6642 break;
6643 case SECCAT_DATA_REL_RO:
6644 prefix = one_only ? ".d.rel.ro" : ".data.rel.ro";
6645 break;
6646 case SECCAT_DATA_REL_RO_LOCAL:
6647 prefix = one_only ? ".d.rel.ro.local" : ".data.rel.ro.local";
6648 break;
6649 case SECCAT_SDATA:
6650 prefix = one_only ? ".s" : ".sdata";
6651 break;
6652 case SECCAT_BSS:
6653 prefix = one_only ? ".b" : ".bss";
6654 break;
6655 case SECCAT_SBSS:
6656 prefix = one_only ? ".sb" : ".sbss";
6657 break;
6658 case SECCAT_TDATA:
6659 prefix = one_only ? ".td" : ".tdata";
6660 break;
6661 case SECCAT_TBSS:
6662 prefix = one_only ? ".tb" : ".tbss";
6663 break;
6664 default:
6665 gcc_unreachable ();
6668 id = DECL_ASSEMBLER_NAME (decl);
6669 ultimate_transparent_alias_target (&id);
6670 name = IDENTIFIER_POINTER (id);
6671 name = targetm.strip_name_encoding (name);
6673 /* If we're using one_only, then there needs to be a .gnu.linkonce
6674 prefix to the section name. */
6675 linkonce = one_only ? ".gnu.linkonce" : "";
6677 string = ACONCAT ((linkonce, prefix, ".", name, NULL));
6679 set_decl_section_name (decl, string);
6682 /* Subroutine of compute_reloc_for_rtx for leaf rtxes. */
6684 static int
6685 compute_reloc_for_rtx_1 (const_rtx x)
6687 switch (GET_CODE (x))
6689 case SYMBOL_REF:
6690 return SYMBOL_REF_LOCAL_P (x) ? 1 : 2;
6691 case LABEL_REF:
6692 return 1;
6693 default:
6694 return 0;
6698 /* Like compute_reloc_for_constant, except for an RTX. The return value
6699 is a mask for which bit 1 indicates a global relocation, and bit 0
6700 indicates a local relocation. */
6702 static int
6703 compute_reloc_for_rtx (const_rtx x)
6705 switch (GET_CODE (x))
6707 case SYMBOL_REF:
6708 case LABEL_REF:
6709 return compute_reloc_for_rtx_1 (x);
6711 case CONST:
6713 int reloc = 0;
6714 subrtx_iterator::array_type array;
6715 FOR_EACH_SUBRTX (iter, array, x, ALL)
6716 reloc |= compute_reloc_for_rtx_1 (*iter);
6717 return reloc;
6720 default:
6721 return 0;
6725 section *
6726 default_select_rtx_section (machine_mode mode ATTRIBUTE_UNUSED,
6727 rtx x,
6728 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED)
6730 if (compute_reloc_for_rtx (x) & targetm.asm_out.reloc_rw_mask ())
6731 return data_section;
6732 else
6733 return readonly_data_section;
6736 section *
6737 default_elf_select_rtx_section (machine_mode mode, rtx x,
6738 unsigned HOST_WIDE_INT align)
6740 int reloc = compute_reloc_for_rtx (x);
6742 /* ??? Handle small data here somehow. */
6744 if (reloc & targetm.asm_out.reloc_rw_mask ())
6746 if (reloc == 1)
6747 return get_named_section (NULL, ".data.rel.ro.local", 1);
6748 else
6749 return get_named_section (NULL, ".data.rel.ro", 3);
6752 return mergeable_constant_section (mode, align, 0);
6755 /* Set the generally applicable flags on the SYMBOL_REF for EXP. */
6757 void
6758 default_encode_section_info (tree decl, rtx rtl, int first ATTRIBUTE_UNUSED)
6760 rtx symbol;
6761 int flags;
6763 /* Careful not to prod global register variables. */
6764 if (!MEM_P (rtl))
6765 return;
6766 symbol = XEXP (rtl, 0);
6767 if (GET_CODE (symbol) != SYMBOL_REF)
6768 return;
6770 flags = SYMBOL_REF_FLAGS (symbol) & SYMBOL_FLAG_HAS_BLOCK_INFO;
6771 if (TREE_CODE (decl) == FUNCTION_DECL)
6772 flags |= SYMBOL_FLAG_FUNCTION;
6773 if (targetm.binds_local_p (decl))
6774 flags |= SYMBOL_FLAG_LOCAL;
6775 if (VAR_P (decl) && DECL_THREAD_LOCAL_P (decl))
6776 flags |= DECL_TLS_MODEL (decl) << SYMBOL_FLAG_TLS_SHIFT;
6777 else if (targetm.in_small_data_p (decl))
6778 flags |= SYMBOL_FLAG_SMALL;
6779 /* ??? Why is DECL_EXTERNAL ever set for non-PUBLIC names? Without
6780 being PUBLIC, the thing *must* be defined in this translation unit.
6781 Prevent this buglet from being propagated into rtl code as well. */
6782 if (DECL_P (decl) && DECL_EXTERNAL (decl) && TREE_PUBLIC (decl))
6783 flags |= SYMBOL_FLAG_EXTERNAL;
6785 SYMBOL_REF_FLAGS (symbol) = flags;
6788 /* By default, we do nothing for encode_section_info, so we need not
6789 do anything but discard the '*' marker. */
6791 const char *
6792 default_strip_name_encoding (const char *str)
6794 return str + (*str == '*');
6797 #ifdef ASM_OUTPUT_DEF
6798 /* The default implementation of TARGET_ASM_OUTPUT_ANCHOR. Define the
6799 anchor relative to ".", the current section position. */
6801 void
6802 default_asm_output_anchor (rtx symbol)
6804 char buffer[100];
6806 sprintf (buffer, "*. + " HOST_WIDE_INT_PRINT_DEC,
6807 SYMBOL_REF_BLOCK_OFFSET (symbol));
6808 ASM_OUTPUT_DEF (asm_out_file, XSTR (symbol, 0), buffer);
6810 #endif
6812 /* The default implementation of TARGET_USE_ANCHORS_FOR_SYMBOL_P. */
6814 bool
6815 default_use_anchors_for_symbol_p (const_rtx symbol)
6817 section *sect;
6818 tree decl;
6820 /* Don't use anchors for mergeable sections. The linker might move
6821 the objects around. */
6822 sect = SYMBOL_REF_BLOCK (symbol)->sect;
6823 if (sect->common.flags & SECTION_MERGE)
6824 return false;
6826 /* Don't use anchors for small data sections. The small data register
6827 acts as an anchor for such sections. */
6828 if (sect->common.flags & SECTION_SMALL)
6829 return false;
6831 decl = SYMBOL_REF_DECL (symbol);
6832 if (decl && DECL_P (decl))
6834 /* Don't use section anchors for decls that might be defined or
6835 usurped by other modules. */
6836 if (TREE_PUBLIC (decl) && !decl_binds_to_current_def_p (decl))
6837 return false;
6839 /* Don't use section anchors for decls that will be placed in a
6840 small data section. */
6841 /* ??? Ideally, this check would be redundant with the SECTION_SMALL
6842 one above. The problem is that we only use SECTION_SMALL for
6843 sections that should be marked as small in the section directive. */
6844 if (targetm.in_small_data_p (decl))
6845 return false;
6847 /* Don't use section anchors for decls that won't fit inside a single
6848 anchor range to reduce the amount of instructions required to refer
6849 to the entire declaration. */
6850 if (DECL_SIZE_UNIT (decl) == NULL_TREE
6851 || !tree_fits_uhwi_p (DECL_SIZE_UNIT (decl))
6852 || (tree_to_uhwi (DECL_SIZE_UNIT (decl))
6853 >= (unsigned HOST_WIDE_INT) targetm.max_anchor_offset))
6854 return false;
6857 return true;
6860 /* Return true when RESOLUTION indicate that symbol will be bound to the
6861 definition provided by current .o file. */
6863 static bool
6864 resolution_to_local_definition_p (enum ld_plugin_symbol_resolution resolution)
6866 return (resolution == LDPR_PREVAILING_DEF
6867 || resolution == LDPR_PREVAILING_DEF_IRONLY_EXP
6868 || resolution == LDPR_PREVAILING_DEF_IRONLY);
6871 /* Return true when RESOLUTION indicate that symbol will be bound locally
6872 within current executable or DSO. */
6874 static bool
6875 resolution_local_p (enum ld_plugin_symbol_resolution resolution)
6877 return (resolution == LDPR_PREVAILING_DEF
6878 || resolution == LDPR_PREVAILING_DEF_IRONLY
6879 || resolution == LDPR_PREVAILING_DEF_IRONLY_EXP
6880 || resolution == LDPR_PREEMPTED_REG
6881 || resolution == LDPR_PREEMPTED_IR
6882 || resolution == LDPR_RESOLVED_IR
6883 || resolution == LDPR_RESOLVED_EXEC);
6886 /* COMMON_LOCAL_P is true means that the linker can guarantee that an
6887 uninitialized common symbol in the executable will still be defined
6888 (through COPY relocation) in the executable. */
6890 bool
6891 default_binds_local_p_3 (const_tree exp, bool shlib, bool weak_dominate,
6892 bool extern_protected_data, bool common_local_p)
6894 /* A non-decl is an entry in the constant pool. */
6895 if (!DECL_P (exp))
6896 return true;
6898 /* Weakrefs may not bind locally, even though the weakref itself is always
6899 static and therefore local. Similarly, the resolver for ifunc functions
6900 might resolve to a non-local function.
6901 FIXME: We can resolve the weakref case more curefuly by looking at the
6902 weakref alias. */
6903 if (lookup_attribute ("weakref", DECL_ATTRIBUTES (exp))
6904 || (TREE_CODE (exp) == FUNCTION_DECL
6905 && lookup_attribute ("ifunc", DECL_ATTRIBUTES (exp))))
6906 return false;
6908 /* Static variables are always local. */
6909 if (! TREE_PUBLIC (exp))
6910 return true;
6912 /* With resolution file in hand, take look into resolutions.
6913 We can't just return true for resolved_locally symbols,
6914 because dynamic linking might overwrite symbols
6915 in shared libraries. */
6916 bool resolved_locally = false;
6918 bool uninited_common = (DECL_COMMON (exp)
6919 && (DECL_INITIAL (exp) == NULL
6920 || (!in_lto_p
6921 && DECL_INITIAL (exp) == error_mark_node)));
6923 /* A non-external variable is defined locally only if it isn't
6924 uninitialized COMMON variable or common_local_p is true. */
6925 bool defined_locally = (!DECL_EXTERNAL (exp)
6926 && (!uninited_common || common_local_p));
6927 if (symtab_node *node = symtab_node::get (exp))
6929 if (node->in_other_partition)
6930 defined_locally = true;
6931 if (node->can_be_discarded_p ())
6933 else if (resolution_to_local_definition_p (node->resolution))
6934 defined_locally = resolved_locally = true;
6935 else if (resolution_local_p (node->resolution))
6936 resolved_locally = true;
6938 if (defined_locally && weak_dominate && !shlib)
6939 resolved_locally = true;
6941 /* Undefined weak symbols are never defined locally. */
6942 if (DECL_WEAK (exp) && !defined_locally)
6943 return false;
6945 /* A symbol is local if the user has said explicitly that it will be,
6946 or if we have a definition for the symbol. We cannot infer visibility
6947 for undefined symbols. */
6948 if (DECL_VISIBILITY (exp) != VISIBILITY_DEFAULT
6949 && (TREE_CODE (exp) == FUNCTION_DECL
6950 || !extern_protected_data
6951 || DECL_VISIBILITY (exp) != VISIBILITY_PROTECTED)
6952 && (DECL_VISIBILITY_SPECIFIED (exp) || defined_locally))
6953 return true;
6955 /* If PIC, then assume that any global name can be overridden by
6956 symbols resolved from other modules. */
6957 if (shlib)
6958 return false;
6960 /* Variables defined outside this object might not be local. */
6961 if (DECL_EXTERNAL (exp) && !resolved_locally)
6962 return false;
6964 /* Non-dominant weak symbols are not defined locally. */
6965 if (DECL_WEAK (exp) && !resolved_locally)
6966 return false;
6968 /* Uninitialized COMMON variable may be unified with symbols
6969 resolved from other modules. */
6970 if (uninited_common && !resolved_locally)
6971 return false;
6973 /* Otherwise we're left with initialized (or non-common) global data
6974 which is of necessity defined locally. */
6975 return true;
6978 /* Assume ELF-ish defaults, since that's pretty much the most liberal
6979 wrt cross-module name binding. */
6981 bool
6982 default_binds_local_p (const_tree exp)
6984 return default_binds_local_p_3 (exp, flag_shlib != 0, true, false, false);
6987 /* Similar to default_binds_local_p, but common symbol may be local and
6988 extern protected data is non-local. */
6990 bool
6991 default_binds_local_p_2 (const_tree exp)
6993 return default_binds_local_p_3 (exp, flag_shlib != 0, true, true,
6994 !flag_pic);
6997 bool
6998 default_binds_local_p_1 (const_tree exp, int shlib)
7000 return default_binds_local_p_3 (exp, shlib != 0, false, false, false);
7003 /* Return true when references to DECL must bind to current definition in
7004 final executable.
7006 The condition is usually equivalent to whether the function binds to the
7007 current module (shared library or executable), that is to binds_local_p.
7008 We use this fact to avoid need for another target hook and implement
7009 the logic using binds_local_p and just special cases where
7010 decl_binds_to_current_def_p is stronger than binds_local_p. In particular
7011 the weak definitions (that can be overwritten at linktime by other
7012 definition from different object file) and when resolution info is available
7013 we simply use the knowledge passed to us by linker plugin. */
7014 bool
7015 decl_binds_to_current_def_p (const_tree decl)
7017 gcc_assert (DECL_P (decl));
7018 if (!targetm.binds_local_p (decl))
7019 return false;
7020 if (!TREE_PUBLIC (decl))
7021 return true;
7023 /* When resolution is available, just use it. */
7024 if (symtab_node *node = symtab_node::get (decl))
7026 if (node->resolution != LDPR_UNKNOWN
7027 && !node->can_be_discarded_p ())
7028 return resolution_to_local_definition_p (node->resolution);
7031 /* Otherwise we have to assume the worst for DECL_WEAK (hidden weaks
7032 binds locally but still can be overwritten), DECL_COMMON (can be merged
7033 with a non-common definition somewhere in the same module) or
7034 DECL_EXTERNAL.
7035 This rely on fact that binds_local_p behave as decl_replaceable_p
7036 for all other declaration types. */
7037 if (DECL_WEAK (decl))
7038 return false;
7039 if (DECL_COMMON (decl)
7040 && (DECL_INITIAL (decl) == NULL
7041 || (!in_lto_p && DECL_INITIAL (decl) == error_mark_node)))
7042 return false;
7043 if (DECL_EXTERNAL (decl))
7044 return false;
7045 return true;
7048 /* A replaceable function or variable is one which may be replaced
7049 at link-time with an entirely different definition, provided that the
7050 replacement has the same type. For example, functions declared
7051 with __attribute__((weak)) on most systems are replaceable.
7053 COMDAT functions are not replaceable, since all definitions of the
7054 function must be equivalent. It is important that COMDAT functions
7055 not be treated as replaceable so that use of C++ template
7056 instantiations is not penalized. */
7058 bool
7059 decl_replaceable_p (tree decl)
7061 gcc_assert (DECL_P (decl));
7062 if (!TREE_PUBLIC (decl) || DECL_COMDAT (decl))
7063 return false;
7064 if (!flag_semantic_interposition
7065 && !DECL_WEAK (decl))
7066 return false;
7067 return !decl_binds_to_current_def_p (decl);
7070 /* Default function to output code that will globalize a label. A
7071 target must define GLOBAL_ASM_OP or provide its own function to
7072 globalize a label. */
7073 #ifdef GLOBAL_ASM_OP
7074 void
7075 default_globalize_label (FILE * stream, const char *name)
7077 fputs (GLOBAL_ASM_OP, stream);
7078 assemble_name (stream, name);
7079 putc ('\n', stream);
7081 #endif /* GLOBAL_ASM_OP */
7083 /* Default function to output code that will globalize a declaration. */
7084 void
7085 default_globalize_decl_name (FILE * stream, tree decl)
7087 const char *name = XSTR (XEXP (DECL_RTL (decl), 0), 0);
7088 targetm.asm_out.globalize_label (stream, name);
7091 /* Default function to output a label for unwind information. The
7092 default is to do nothing. A target that needs nonlocal labels for
7093 unwind information must provide its own function to do this. */
7094 void
7095 default_emit_unwind_label (FILE * stream ATTRIBUTE_UNUSED,
7096 tree decl ATTRIBUTE_UNUSED,
7097 int for_eh ATTRIBUTE_UNUSED,
7098 int empty ATTRIBUTE_UNUSED)
7102 /* Default function to output a label to divide up the exception table.
7103 The default is to do nothing. A target that needs/wants to divide
7104 up the table must provide it's own function to do this. */
7105 void
7106 default_emit_except_table_label (FILE * stream ATTRIBUTE_UNUSED)
7110 /* This is how to output an internal numbered label where PREFIX is
7111 the class of label and LABELNO is the number within the class. */
7113 void
7114 default_generate_internal_label (char *buf, const char *prefix,
7115 unsigned long labelno)
7117 ASM_GENERATE_INTERNAL_LABEL (buf, prefix, labelno);
7120 /* This is how to output an internal numbered label where PREFIX is
7121 the class of label and LABELNO is the number within the class. */
7123 void
7124 default_internal_label (FILE *stream, const char *prefix,
7125 unsigned long labelno)
7127 char *const buf = (char *) alloca (40 + strlen (prefix));
7128 ASM_GENERATE_INTERNAL_LABEL (buf, prefix, labelno);
7129 ASM_OUTPUT_INTERNAL_LABEL (stream, buf);
7133 /* The default implementation of ASM_DECLARE_CONSTANT_NAME. */
7135 void
7136 default_asm_declare_constant_name (FILE *file, const char *name,
7137 const_tree exp ATTRIBUTE_UNUSED,
7138 HOST_WIDE_INT size ATTRIBUTE_UNUSED)
7140 assemble_label (file, name);
7143 /* This is the default behavior at the beginning of a file. It's
7144 controlled by two other target-hook toggles. */
7145 void
7146 default_file_start (void)
7148 if (targetm.asm_file_start_app_off
7149 && !(flag_verbose_asm || flag_debug_asm || flag_dump_rtl_in_asm))
7150 fputs (ASM_APP_OFF, asm_out_file);
7152 if (targetm.asm_file_start_file_directive)
7154 /* LTO produced units have no meaningful main_input_filename. */
7155 if (in_lto_p)
7156 output_file_directive (asm_out_file, "<artificial>");
7157 else
7158 output_file_directive (asm_out_file, main_input_filename);
7162 /* This is a generic routine suitable for use as TARGET_ASM_FILE_END
7163 which emits a special section directive used to indicate whether or
7164 not this object file needs an executable stack. This is primarily
7165 a GNU extension to ELF but could be used on other targets. */
7167 int trampolines_created;
7169 void
7170 file_end_indicate_exec_stack (void)
7172 unsigned int flags = SECTION_DEBUG;
7173 if (trampolines_created)
7174 flags |= SECTION_CODE;
7176 switch_to_section (get_section (".note.GNU-stack", flags, NULL));
7179 /* Emit a special section directive to indicate that this object file
7180 was compiled with -fsplit-stack. This is used to let the linker
7181 detect calls between split-stack code and non-split-stack code, so
7182 that it can modify the split-stack code to allocate a sufficiently
7183 large stack. We emit another special section if there are any
7184 functions in this file which have the no_split_stack attribute, to
7185 prevent the linker from warning about being unable to convert the
7186 functions if they call non-split-stack code. */
7188 void
7189 file_end_indicate_split_stack (void)
7191 if (flag_split_stack)
7193 switch_to_section (get_section (".note.GNU-split-stack", SECTION_DEBUG,
7194 NULL));
7195 if (saw_no_split_stack)
7196 switch_to_section (get_section (".note.GNU-no-split-stack",
7197 SECTION_DEBUG, NULL));
7201 /* Output DIRECTIVE (a C string) followed by a newline. This is used as
7202 a get_unnamed_section callback. */
7204 void
7205 output_section_asm_op (const void *directive)
7207 fprintf (asm_out_file, "%s\n", (const char *) directive);
7210 /* Emit assembly code to switch to section NEW_SECTION. Do nothing if
7211 the current section is NEW_SECTION. */
7213 void
7214 switch_to_section (section *new_section)
7216 if (in_section == new_section)
7217 return;
7219 if (new_section->common.flags & SECTION_FORGET)
7220 in_section = NULL;
7221 else
7222 in_section = new_section;
7224 switch (SECTION_STYLE (new_section))
7226 case SECTION_NAMED:
7227 targetm.asm_out.named_section (new_section->named.name,
7228 new_section->named.common.flags,
7229 new_section->named.decl);
7230 break;
7232 case SECTION_UNNAMED:
7233 new_section->unnamed.callback (new_section->unnamed.data);
7234 break;
7236 case SECTION_NOSWITCH:
7237 gcc_unreachable ();
7238 break;
7241 new_section->common.flags |= SECTION_DECLARED;
7244 /* If block symbol SYMBOL has not yet been assigned an offset, place
7245 it at the end of its block. */
7247 void
7248 place_block_symbol (rtx symbol)
7250 unsigned HOST_WIDE_INT size, mask, offset;
7251 struct constant_descriptor_rtx *desc;
7252 unsigned int alignment;
7253 struct object_block *block;
7254 tree decl;
7256 gcc_assert (SYMBOL_REF_BLOCK (symbol));
7257 if (SYMBOL_REF_BLOCK_OFFSET (symbol) >= 0)
7258 return;
7260 /* Work out the symbol's size and alignment. */
7261 if (CONSTANT_POOL_ADDRESS_P (symbol))
7263 desc = SYMBOL_REF_CONSTANT (symbol);
7264 alignment = desc->align;
7265 size = GET_MODE_SIZE (desc->mode);
7267 else if (TREE_CONSTANT_POOL_ADDRESS_P (symbol))
7269 decl = SYMBOL_REF_DECL (symbol);
7270 gcc_checking_assert (DECL_IN_CONSTANT_POOL (decl));
7271 alignment = DECL_ALIGN (decl);
7272 size = get_constant_size (DECL_INITIAL (decl));
7273 if ((flag_sanitize & SANITIZE_ADDRESS)
7274 && TREE_CODE (DECL_INITIAL (decl)) == STRING_CST
7275 && asan_protect_global (DECL_INITIAL (decl)))
7277 size += asan_red_zone_size (size);
7278 alignment = MAX (alignment,
7279 ASAN_RED_ZONE_SIZE * BITS_PER_UNIT);
7282 else
7284 struct symtab_node *snode;
7285 decl = SYMBOL_REF_DECL (symbol);
7287 snode = symtab_node::get (decl);
7288 if (snode->alias)
7290 rtx target = DECL_RTL (snode->ultimate_alias_target ()->decl);
7292 gcc_assert (MEM_P (target)
7293 && GET_CODE (XEXP (target, 0)) == SYMBOL_REF
7294 && SYMBOL_REF_HAS_BLOCK_INFO_P (XEXP (target, 0)));
7295 target = XEXP (target, 0);
7296 place_block_symbol (target);
7297 SYMBOL_REF_BLOCK_OFFSET (symbol) = SYMBOL_REF_BLOCK_OFFSET (target);
7298 return;
7300 alignment = get_variable_align (decl);
7301 size = tree_to_uhwi (DECL_SIZE_UNIT (decl));
7302 if ((flag_sanitize & SANITIZE_ADDRESS)
7303 && asan_protect_global (decl))
7305 size += asan_red_zone_size (size);
7306 alignment = MAX (alignment,
7307 ASAN_RED_ZONE_SIZE * BITS_PER_UNIT);
7311 /* Calculate the object's offset from the start of the block. */
7312 block = SYMBOL_REF_BLOCK (symbol);
7313 mask = alignment / BITS_PER_UNIT - 1;
7314 offset = (block->size + mask) & ~mask;
7315 SYMBOL_REF_BLOCK_OFFSET (symbol) = offset;
7317 /* Record the block's new alignment and size. */
7318 block->alignment = MAX (block->alignment, alignment);
7319 block->size = offset + size;
7321 vec_safe_push (block->objects, symbol);
7324 /* Return the anchor that should be used to address byte offset OFFSET
7325 from the first object in BLOCK. MODEL is the TLS model used
7326 to access it. */
7329 get_section_anchor (struct object_block *block, HOST_WIDE_INT offset,
7330 enum tls_model model)
7332 char label[100];
7333 unsigned int begin, middle, end;
7334 unsigned HOST_WIDE_INT min_offset, max_offset, range, bias, delta;
7335 rtx anchor;
7337 /* Work out the anchor's offset. Use an offset of 0 for the first
7338 anchor so that we don't pessimize the case where we take the address
7339 of a variable at the beginning of the block. This is particularly
7340 useful when a block has only one variable assigned to it.
7342 We try to place anchors RANGE bytes apart, so there can then be
7343 anchors at +/-RANGE, +/-2 * RANGE, and so on, up to the limits of
7344 a ptr_mode offset. With some target settings, the lowest such
7345 anchor might be out of range for the lowest ptr_mode offset;
7346 likewise the highest anchor for the highest offset. Use anchors
7347 at the extreme ends of the ptr_mode range in such cases.
7349 All arithmetic uses unsigned integers in order to avoid
7350 signed overflow. */
7351 max_offset = (unsigned HOST_WIDE_INT) targetm.max_anchor_offset;
7352 min_offset = (unsigned HOST_WIDE_INT) targetm.min_anchor_offset;
7353 range = max_offset - min_offset + 1;
7354 if (range == 0)
7355 offset = 0;
7356 else
7358 bias = HOST_WIDE_INT_1U << (GET_MODE_BITSIZE (ptr_mode) - 1);
7359 if (offset < 0)
7361 delta = -(unsigned HOST_WIDE_INT) offset + max_offset;
7362 delta -= delta % range;
7363 if (delta > bias)
7364 delta = bias;
7365 offset = (HOST_WIDE_INT) (-delta);
7367 else
7369 delta = (unsigned HOST_WIDE_INT) offset - min_offset;
7370 delta -= delta % range;
7371 if (delta > bias - 1)
7372 delta = bias - 1;
7373 offset = (HOST_WIDE_INT) delta;
7377 /* Do a binary search to see if there's already an anchor we can use.
7378 Set BEGIN to the new anchor's index if not. */
7379 begin = 0;
7380 end = vec_safe_length (block->anchors);
7381 while (begin != end)
7383 middle = (end + begin) / 2;
7384 anchor = (*block->anchors)[middle];
7385 if (SYMBOL_REF_BLOCK_OFFSET (anchor) > offset)
7386 end = middle;
7387 else if (SYMBOL_REF_BLOCK_OFFSET (anchor) < offset)
7388 begin = middle + 1;
7389 else if (SYMBOL_REF_TLS_MODEL (anchor) > model)
7390 end = middle;
7391 else if (SYMBOL_REF_TLS_MODEL (anchor) < model)
7392 begin = middle + 1;
7393 else
7394 return anchor;
7397 /* Create a new anchor with a unique label. */
7398 ASM_GENERATE_INTERNAL_LABEL (label, "LANCHOR", anchor_labelno++);
7399 anchor = create_block_symbol (ggc_strdup (label), block, offset);
7400 SYMBOL_REF_FLAGS (anchor) |= SYMBOL_FLAG_LOCAL | SYMBOL_FLAG_ANCHOR;
7401 SYMBOL_REF_FLAGS (anchor) |= model << SYMBOL_FLAG_TLS_SHIFT;
7403 /* Insert it at index BEGIN. */
7404 vec_safe_insert (block->anchors, begin, anchor);
7405 return anchor;
7408 /* Output the objects in BLOCK. */
7410 static void
7411 output_object_block (struct object_block *block)
7413 struct constant_descriptor_rtx *desc;
7414 unsigned int i;
7415 HOST_WIDE_INT offset;
7416 tree decl;
7417 rtx symbol;
7419 if (!block->objects)
7420 return;
7422 /* Switch to the section and make sure that the first byte is
7423 suitably aligned. */
7424 /* Special case VTV comdat sections similar to assemble_variable. */
7425 if (SECTION_STYLE (block->sect) == SECTION_NAMED
7426 && block->sect->named.name
7427 && (strcmp (block->sect->named.name, ".vtable_map_vars") == 0))
7428 handle_vtv_comdat_section (block->sect, block->sect->named.decl);
7429 else
7430 switch_to_section (block->sect);
7432 assemble_align (block->alignment);
7434 /* Define the values of all anchors relative to the current section
7435 position. */
7436 FOR_EACH_VEC_SAFE_ELT (block->anchors, i, symbol)
7437 targetm.asm_out.output_anchor (symbol);
7439 /* Output the objects themselves. */
7440 offset = 0;
7441 FOR_EACH_VEC_ELT (*block->objects, i, symbol)
7443 /* Move to the object's offset, padding with zeros if necessary. */
7444 assemble_zeros (SYMBOL_REF_BLOCK_OFFSET (symbol) - offset);
7445 offset = SYMBOL_REF_BLOCK_OFFSET (symbol);
7446 if (CONSTANT_POOL_ADDRESS_P (symbol))
7448 desc = SYMBOL_REF_CONSTANT (symbol);
7449 /* Pass 1 for align as we have already laid out everything in the block.
7450 So aligning shouldn't be necessary. */
7451 output_constant_pool_1 (desc, 1);
7452 offset += GET_MODE_SIZE (desc->mode);
7454 else if (TREE_CONSTANT_POOL_ADDRESS_P (symbol))
7456 HOST_WIDE_INT size;
7457 decl = SYMBOL_REF_DECL (symbol);
7458 assemble_constant_contents
7459 (DECL_INITIAL (decl), XSTR (symbol, 0), DECL_ALIGN (decl));
7461 size = get_constant_size (DECL_INITIAL (decl));
7462 offset += size;
7463 if ((flag_sanitize & SANITIZE_ADDRESS)
7464 && TREE_CODE (DECL_INITIAL (decl)) == STRING_CST
7465 && asan_protect_global (DECL_INITIAL (decl)))
7467 size = asan_red_zone_size (size);
7468 assemble_zeros (size);
7469 offset += size;
7472 else
7474 HOST_WIDE_INT size;
7475 decl = SYMBOL_REF_DECL (symbol);
7476 assemble_variable_contents (decl, XSTR (symbol, 0), false);
7477 size = tree_to_uhwi (DECL_SIZE_UNIT (decl));
7478 offset += size;
7479 if ((flag_sanitize & SANITIZE_ADDRESS)
7480 && asan_protect_global (decl))
7482 size = asan_red_zone_size (size);
7483 assemble_zeros (size);
7484 offset += size;
7490 /* A callback for qsort to compare object_blocks. */
7492 static int
7493 output_object_block_compare (const void *x, const void *y)
7495 object_block *p1 = *(object_block * const*)x;
7496 object_block *p2 = *(object_block * const*)y;
7498 if (p1->sect->common.flags & SECTION_NAMED
7499 && !(p2->sect->common.flags & SECTION_NAMED))
7500 return 1;
7502 if (!(p1->sect->common.flags & SECTION_NAMED)
7503 && p2->sect->common.flags & SECTION_NAMED)
7504 return -1;
7506 if (p1->sect->common.flags & SECTION_NAMED
7507 && p2->sect->common.flags & SECTION_NAMED)
7508 return strcmp (p1->sect->named.name, p2->sect->named.name);
7510 unsigned f1 = p1->sect->common.flags;
7511 unsigned f2 = p2->sect->common.flags;
7512 if (f1 == f2)
7513 return 0;
7514 return f1 < f2 ? -1 : 1;
7517 /* Output the definitions of all object_blocks. */
7519 void
7520 output_object_blocks (void)
7522 vec<object_block *, va_heap> v;
7523 v.create (object_block_htab->elements ());
7524 object_block *obj;
7525 hash_table<object_block_hasher>::iterator hi;
7527 FOR_EACH_HASH_TABLE_ELEMENT (*object_block_htab, obj, object_block *, hi)
7528 v.quick_push (obj);
7530 /* Sort them in order to output them in a deterministic manner,
7531 otherwise we may get .rodata sections in different orders with
7532 and without -g. */
7533 v.qsort (output_object_block_compare);
7534 unsigned i;
7535 FOR_EACH_VEC_ELT (v, i, obj)
7536 output_object_block (obj);
7538 v.release ();
7541 /* This function provides a possible implementation of the
7542 TARGET_ASM_RECORD_GCC_SWITCHES target hook for ELF targets. When triggered
7543 by -frecord-gcc-switches it creates a new mergeable, string section in the
7544 assembler output file called TARGET_ASM_RECORD_GCC_SWITCHES_SECTION which
7545 contains the switches in ASCII format.
7547 FIXME: This code does not correctly handle double quote characters
7548 that appear inside strings, (it strips them rather than preserving them).
7549 FIXME: ASM_OUTPUT_ASCII, as defined in config/elfos.h will not emit NUL
7550 characters - instead it treats them as sub-string separators. Since
7551 we want to emit NUL strings terminators into the object file we have to use
7552 ASM_OUTPUT_SKIP. */
7555 elf_record_gcc_switches (print_switch_type type, const char * name)
7557 switch (type)
7559 case SWITCH_TYPE_PASSED:
7560 ASM_OUTPUT_ASCII (asm_out_file, name, strlen (name));
7561 ASM_OUTPUT_SKIP (asm_out_file, HOST_WIDE_INT_1U);
7562 break;
7564 case SWITCH_TYPE_DESCRIPTIVE:
7565 if (name == NULL)
7567 /* Distinguish between invocations where name is NULL. */
7568 static bool started = false;
7570 if (!started)
7572 section * sec;
7574 sec = get_section (targetm.asm_out.record_gcc_switches_section,
7575 SECTION_DEBUG
7576 | SECTION_MERGE
7577 | SECTION_STRINGS
7578 | (SECTION_ENTSIZE & 1),
7579 NULL);
7580 switch_to_section (sec);
7581 started = true;
7585 default:
7586 break;
7589 /* The return value is currently ignored by the caller, but must be 0.
7590 For -fverbose-asm the return value would be the number of characters
7591 emitted into the assembler file. */
7592 return 0;
7595 /* Emit text to declare externally defined symbols. It is needed to
7596 properly support non-default visibility. */
7597 void
7598 default_elf_asm_output_external (FILE *file ATTRIBUTE_UNUSED,
7599 tree decl,
7600 const char *name ATTRIBUTE_UNUSED)
7602 /* We output the name if and only if TREE_SYMBOL_REFERENCED is
7603 set in order to avoid putting out names that are never really
7604 used. Always output visibility specified in the source. */
7605 if (TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (decl))
7606 && (DECL_VISIBILITY_SPECIFIED (decl)
7607 || targetm.binds_local_p (decl)))
7608 maybe_assemble_visibility (decl);
7611 /* The default hook for TARGET_ASM_OUTPUT_SOURCE_FILENAME. */
7613 void
7614 default_asm_output_source_filename (FILE *file, const char *name)
7616 #ifdef ASM_OUTPUT_SOURCE_FILENAME
7617 ASM_OUTPUT_SOURCE_FILENAME (file, name);
7618 #else
7619 fprintf (file, "\t.file\t");
7620 output_quoted_string (file, name);
7621 putc ('\n', file);
7622 #endif
7625 /* Output a file name in the form wanted by System V. */
7627 void
7628 output_file_directive (FILE *asm_file, const char *input_name)
7630 int len;
7631 const char *na;
7633 if (input_name == NULL)
7634 input_name = "<stdin>";
7635 else
7636 input_name = remap_debug_filename (input_name);
7638 len = strlen (input_name);
7639 na = input_name + len;
7641 /* NA gets INPUT_NAME sans directory names. */
7642 while (na > input_name)
7644 if (IS_DIR_SEPARATOR (na[-1]))
7645 break;
7646 na--;
7649 targetm.asm_out.output_source_filename (asm_file, na);
7652 /* Create a DEBUG_EXPR_DECL / DEBUG_EXPR pair from RTL expression
7653 EXP. */
7655 make_debug_expr_from_rtl (const_rtx exp)
7657 tree ddecl = make_node (DEBUG_EXPR_DECL), type;
7658 machine_mode mode = GET_MODE (exp);
7659 rtx dval;
7661 DECL_ARTIFICIAL (ddecl) = 1;
7662 if (REG_P (exp) && REG_EXPR (exp))
7663 type = TREE_TYPE (REG_EXPR (exp));
7664 else if (MEM_P (exp) && MEM_EXPR (exp))
7665 type = TREE_TYPE (MEM_EXPR (exp));
7666 else
7667 type = NULL_TREE;
7668 if (type && TYPE_MODE (type) == mode)
7669 TREE_TYPE (ddecl) = type;
7670 else
7671 TREE_TYPE (ddecl) = lang_hooks.types.type_for_mode (mode, 1);
7672 SET_DECL_MODE (ddecl, mode);
7673 dval = gen_rtx_DEBUG_EXPR (mode);
7674 DEBUG_EXPR_TREE_DECL (dval) = ddecl;
7675 SET_DECL_RTL (ddecl, dval);
7676 return dval;
7679 #ifdef ELF_ASCII_ESCAPES
7680 /* Default ASM_OUTPUT_LIMITED_STRING for ELF targets. */
7682 void
7683 default_elf_asm_output_limited_string (FILE *f, const char *s)
7685 int escape;
7686 unsigned char c;
7688 fputs (STRING_ASM_OP, f);
7689 putc ('"', f);
7690 while (*s != '\0')
7692 c = *s;
7693 escape = ELF_ASCII_ESCAPES[c];
7694 switch (escape)
7696 case 0:
7697 putc (c, f);
7698 break;
7699 case 1:
7700 putc ('\\', f);
7701 putc ('0'+((c>>6)&7), f);
7702 putc ('0'+((c>>3)&7), f);
7703 putc ('0'+(c&7), f);
7704 break;
7705 default:
7706 putc ('\\', f);
7707 putc (escape, f);
7708 break;
7710 s++;
7712 putc ('\"', f);
7713 putc ('\n', f);
7716 /* Default ASM_OUTPUT_ASCII for ELF targets. */
7718 void
7719 default_elf_asm_output_ascii (FILE *f, const char *s, unsigned int len)
7721 const char *limit = s + len;
7722 const char *last_null = NULL;
7723 unsigned bytes_in_chunk = 0;
7724 unsigned char c;
7725 int escape;
7727 for (; s < limit; s++)
7729 const char *p;
7731 if (bytes_in_chunk >= 60)
7733 putc ('\"', f);
7734 putc ('\n', f);
7735 bytes_in_chunk = 0;
7738 if (s > last_null)
7740 for (p = s; p < limit && *p != '\0'; p++)
7741 continue;
7742 last_null = p;
7744 else
7745 p = last_null;
7747 if (p < limit && (p - s) <= (long) ELF_STRING_LIMIT)
7749 if (bytes_in_chunk > 0)
7751 putc ('\"', f);
7752 putc ('\n', f);
7753 bytes_in_chunk = 0;
7756 default_elf_asm_output_limited_string (f, s);
7757 s = p;
7759 else
7761 if (bytes_in_chunk == 0)
7762 fputs (ASCII_DATA_ASM_OP "\"", f);
7764 c = *s;
7765 escape = ELF_ASCII_ESCAPES[c];
7766 switch (escape)
7768 case 0:
7769 putc (c, f);
7770 bytes_in_chunk++;
7771 break;
7772 case 1:
7773 putc ('\\', f);
7774 putc ('0'+((c>>6)&7), f);
7775 putc ('0'+((c>>3)&7), f);
7776 putc ('0'+(c&7), f);
7777 bytes_in_chunk += 4;
7778 break;
7779 default:
7780 putc ('\\', f);
7781 putc (escape, f);
7782 bytes_in_chunk += 2;
7783 break;
7789 if (bytes_in_chunk > 0)
7791 putc ('\"', f);
7792 putc ('\n', f);
7795 #endif
7797 static GTY(()) section *elf_init_array_section;
7798 static GTY(()) section *elf_fini_array_section;
7800 static section *
7801 get_elf_initfini_array_priority_section (int priority,
7802 bool constructor_p)
7804 section *sec;
7805 if (priority != DEFAULT_INIT_PRIORITY)
7807 char buf[18];
7808 sprintf (buf, "%s.%.5u",
7809 constructor_p ? ".init_array" : ".fini_array",
7810 priority);
7811 sec = get_section (buf, SECTION_WRITE | SECTION_NOTYPE, NULL_TREE);
7813 else
7815 if (constructor_p)
7817 if (elf_init_array_section == NULL)
7818 elf_init_array_section
7819 = get_section (".init_array",
7820 SECTION_WRITE | SECTION_NOTYPE, NULL_TREE);
7821 sec = elf_init_array_section;
7823 else
7825 if (elf_fini_array_section == NULL)
7826 elf_fini_array_section
7827 = get_section (".fini_array",
7828 SECTION_WRITE | SECTION_NOTYPE, NULL_TREE);
7829 sec = elf_fini_array_section;
7832 return sec;
7835 /* Use .init_array section for constructors. */
7837 void
7838 default_elf_init_array_asm_out_constructor (rtx symbol, int priority)
7840 section *sec = get_elf_initfini_array_priority_section (priority,
7841 true);
7842 assemble_addr_to_section (symbol, sec);
7845 /* Use .fini_array section for destructors. */
7847 void
7848 default_elf_fini_array_asm_out_destructor (rtx symbol, int priority)
7850 section *sec = get_elf_initfini_array_priority_section (priority,
7851 false);
7852 assemble_addr_to_section (symbol, sec);
7855 /* Default TARGET_ASM_OUTPUT_IDENT hook.
7857 This is a bit of a cheat. The real default is a no-op, but this
7858 hook is the default for all targets with a .ident directive. */
7860 void
7861 default_asm_output_ident_directive (const char *ident_str)
7863 const char *ident_asm_op = "\t.ident\t";
7865 /* If we are still in the front end, do not write out the string
7866 to asm_out_file. Instead, add a fake top-level asm statement.
7867 This allows the front ends to use this hook without actually
7868 writing to asm_out_file, to handle #ident or Pragma Ident. */
7869 if (symtab->state == PARSING)
7871 char *buf = ACONCAT ((ident_asm_op, "\"", ident_str, "\"\n", NULL));
7872 symtab->finalize_toplevel_asm (build_string (strlen (buf), buf));
7874 else
7875 fprintf (asm_out_file, "%s\"%s\"\n", ident_asm_op, ident_str);
7879 /* This function ensures that vtable_map variables are not only
7880 in the comdat section, but that each variable has its own unique
7881 comdat name. Without this the variables end up in the same section
7882 with a single comdat name.
7884 FIXME: resolve_unique_section needs to deal better with
7885 decls with both DECL_SECTION_NAME and DECL_ONE_ONLY. Once
7886 that is fixed, this if-else statement can be replaced with
7887 a single call to "switch_to_section (sect)". */
7889 static void
7890 handle_vtv_comdat_section (section *sect, const_tree decl ATTRIBUTE_UNUSED)
7892 #if defined (OBJECT_FORMAT_ELF)
7893 targetm.asm_out.named_section (sect->named.name,
7894 sect->named.common.flags
7895 | SECTION_LINKONCE,
7896 DECL_NAME (decl));
7897 in_section = sect;
7898 #else
7899 /* Neither OBJECT_FORMAT_PE, nor OBJECT_FORMAT_COFF is set here.
7900 Therefore the following check is used.
7901 In case a the target is PE or COFF a comdat group section
7902 is created, e.g. .vtable_map_vars$foo. The linker places
7903 everything in .vtable_map_vars at the end.
7905 A fix could be made in
7906 gcc/config/i386/winnt.c: i386_pe_unique_section. */
7907 if (TARGET_PECOFF)
7909 char *name;
7911 if (TREE_CODE (DECL_NAME (decl)) == IDENTIFIER_NODE)
7912 name = ACONCAT ((sect->named.name, "$",
7913 IDENTIFIER_POINTER (DECL_NAME (decl)), NULL));
7914 else
7915 name = ACONCAT ((sect->named.name, "$",
7916 IDENTIFIER_POINTER (DECL_COMDAT_GROUP (DECL_NAME (decl))),
7917 NULL));
7919 targetm.asm_out.named_section (name,
7920 sect->named.common.flags
7921 | SECTION_LINKONCE,
7922 DECL_NAME (decl));
7923 in_section = sect;
7925 else
7926 switch_to_section (sect);
7927 #endif
7930 #include "gt-varasm.h"