1 /* Output variables, constants and external declarations, for GNU compiler.
2 Copyright (C) 1987, 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997,
3 1998, 1999, 2000, 2001, 2002, 2003, 2004 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
23 /* This file handles generation of all the assembler code
24 *except* the instructions of a function.
25 This includes declarations of variables and their initial values.
27 We also output the assembler code for constants stored in memory
28 and are responsible for combining constants with the same value. */
32 #include "coretypes.h"
39 #include "hard-reg-set.h"
47 #include "langhooks.h"
51 #include "tree-mudflap.h"
53 #include "cfglayout.h"
55 #ifdef XCOFF_DEBUGGING_INFO
56 #include "xcoffout.h" /* Needed for external data
57 declarations for e.g. AIX 4.x. */
61 #define ASM_STABS_OP "\t.stabs\t"
64 /* The (assembler) name of the first globally-visible object output. */
65 const char *first_global_object_name
;
66 const char *weak_global_object_name
;
69 struct constant_descriptor_rtx
;
70 struct rtx_constant_pool
;
72 struct varasm_status
GTY(())
74 /* If we're using a per-function constant pool, this is it. */
75 struct rtx_constant_pool
*pool
;
77 /* Number of tree-constants deferred during the expansion of this
79 unsigned int deferred_constants
;
82 #define n_deferred_constants (cfun->varasm->deferred_constants)
84 /* Number for making the label on the next
85 constant that is stored in memory. */
87 static GTY(()) int const_labelno
;
89 /* Carry information from ASM_DECLARE_OBJECT_NAME
90 to ASM_FINISH_DECLARE_OBJECT. */
92 int size_directive_output
;
94 /* The last decl for which assemble_variable was called,
95 if it did ASM_DECLARE_OBJECT_NAME.
96 If the last call to assemble_variable didn't do that,
99 tree last_assemble_variable_decl
;
101 /* The following global variable indicates if the section label for the
102 "cold" section of code has been output yet to the assembler. The
103 label is useful when running gdb. This is part of the optimization that
104 partitions hot and cold basic blocks into separate sections of the .o
107 bool unlikely_section_label_printed
= false;
109 /* RTX_UNCHANGING_P in a MEM can mean it is stored into, for initialization.
110 So giving constant the alias set for the type will allow such
111 initializations to appear to conflict with the load of the constant. We
112 avoid this by giving all constants an alias set for just constants.
113 Since there will be no stores to that alias set, nothing will ever
114 conflict with them. */
116 static HOST_WIDE_INT const_alias_set
;
118 static const char *strip_reg_name (const char *);
119 static int contains_pointers_p (tree
);
120 #ifdef ASM_OUTPUT_EXTERNAL
121 static bool incorporeal_function_p (tree
);
123 static void decode_addr_const (tree
, struct addr_const
*);
124 static hashval_t
const_desc_hash (const void *);
125 static int const_desc_eq (const void *, const void *);
126 static hashval_t
const_hash_1 (const tree
);
127 static int compare_constant (const tree
, const tree
);
128 static tree
copy_constant (tree
);
129 static void output_constant_def_contents (rtx
);
130 static void output_addressed_constants (tree
);
131 static unsigned HOST_WIDE_INT
array_size_for_constructor (tree
);
132 static unsigned min_align (unsigned, unsigned);
133 static void output_constructor (tree
, unsigned HOST_WIDE_INT
, unsigned int);
134 static void globalize_decl (tree
);
135 static void maybe_assemble_visibility (tree
);
136 static int in_named_entry_eq (const void *, const void *);
137 static hashval_t
in_named_entry_hash (const void *);
138 #ifdef BSS_SECTION_ASM_OP
139 #ifdef ASM_OUTPUT_BSS
140 static void asm_output_bss (FILE *, tree
, const char *,
141 unsigned HOST_WIDE_INT
, unsigned HOST_WIDE_INT
);
143 #ifdef ASM_OUTPUT_ALIGNED_BSS
144 static void asm_output_aligned_bss (FILE *, tree
, const char *,
145 unsigned HOST_WIDE_INT
, int)
148 #endif /* BSS_SECTION_ASM_OP */
149 static bool asm_emit_uninitialised (tree
, const char*,
150 unsigned HOST_WIDE_INT
,
151 unsigned HOST_WIDE_INT
);
152 static void mark_weak (tree
);
154 enum in_section
{ no_section
, in_text
, in_unlikely_executed_text
, in_data
,
156 #ifdef BSS_SECTION_ASM_OP
159 #ifdef CTORS_SECTION_ASM_OP
162 #ifdef DTORS_SECTION_ASM_OP
165 #ifdef READONLY_DATA_SECTION_ASM_OP
168 #ifdef EXTRA_SECTIONS
172 static GTY(()) enum in_section in_section
= no_section
;
174 /* Return a nonzero value if DECL has a section attribute. */
175 #ifndef IN_NAMED_SECTION
176 #define IN_NAMED_SECTION(DECL) \
177 ((TREE_CODE (DECL) == FUNCTION_DECL || TREE_CODE (DECL) == VAR_DECL) \
178 && DECL_SECTION_NAME (DECL) != NULL_TREE)
181 /* Text of section name when in_section == in_named. */
182 static GTY(()) const char *in_named_name
;
184 /* Hash table of flags that have been used for a particular named section. */
186 struct in_named_entry
GTY(())
193 static GTY((param_is (struct in_named_entry
))) htab_t in_named_htab
;
195 /* Define functions like text_section for any extra sections. */
196 #ifdef EXTRA_SECTION_FUNCTIONS
197 EXTRA_SECTION_FUNCTIONS
200 /* Tell assembler to switch to text section. */
205 if (in_section
!= in_text
)
207 in_section
= in_text
;
208 fprintf (asm_out_file
, "%s\n", TEXT_SECTION_ASM_OP
);
209 ASM_OUTPUT_ALIGN (asm_out_file
, 2);
213 /* Tell assembler to switch to unlikely-to-be-executed text section. */
216 unlikely_text_section (void)
218 if ((in_section
!= in_unlikely_executed_text
)
219 && (in_section
!= in_named
220 || strcmp (in_named_name
, UNLIKELY_EXECUTED_TEXT_SECTION_NAME
) != 0))
222 if (targetm
.have_named_sections
)
223 named_section (NULL_TREE
, UNLIKELY_EXECUTED_TEXT_SECTION_NAME
, 0);
226 in_section
= in_unlikely_executed_text
;
227 fprintf (asm_out_file
, "%s\n", TEXT_SECTION_ASM_OP
);
230 if (!unlikely_section_label_printed
)
232 fprintf (asm_out_file
, "__%s_unlikely_section:\n",
233 current_function_name ());
234 unlikely_section_label_printed
= true;
236 /* Make sure that we have appropriate alignment for instructions
238 assemble_align (FUNCTION_BOUNDARY
);
243 /* Tell assembler to switch to data section. */
248 if (in_section
!= in_data
)
250 in_section
= in_data
;
251 fprintf (asm_out_file
, "%s\n", DATA_SECTION_ASM_OP
);
255 /* Tell assembler to switch to read-only data section. This is normally
259 readonly_data_section (void)
261 #ifdef READONLY_DATA_SECTION
262 READONLY_DATA_SECTION (); /* Note this can call data_section. */
264 #ifdef READONLY_DATA_SECTION_ASM_OP
265 if (in_section
!= in_readonly_data
)
267 in_section
= in_readonly_data
;
268 fputs (READONLY_DATA_SECTION_ASM_OP
, asm_out_file
);
269 fputc ('\n', asm_out_file
);
277 /* Determine if we're in the text section. */
280 in_text_section (void)
282 return in_section
== in_text
;
285 /* Determine if we're in the unlikely-to-be-executed text section. */
288 in_unlikely_text_section (void)
290 return in_section
== in_unlikely_executed_text
;
293 /* Determine if we're in the data section. */
296 in_data_section (void)
298 return in_section
== in_data
;
301 /* Helper routines for maintaining in_named_htab. */
304 in_named_entry_eq (const void *p1
, const void *p2
)
306 const struct in_named_entry
*old
= p1
;
307 const char *new = p2
;
309 return strcmp (old
->name
, new) == 0;
313 in_named_entry_hash (const void *p
)
315 const struct in_named_entry
*old
= p
;
316 return htab_hash_string (old
->name
);
319 /* If SECTION has been seen before as a named section, return the flags
320 that were used. Otherwise, return 0. Note, that 0 is a perfectly valid
321 set of flags for a section to have, so 0 does not mean that the section
322 has not been seen. */
325 get_named_section_flags (const char *section
)
327 struct in_named_entry
**slot
;
329 slot
= (struct in_named_entry
**)
330 htab_find_slot_with_hash (in_named_htab
, section
,
331 htab_hash_string (section
), NO_INSERT
);
333 return slot
? (*slot
)->flags
: 0;
336 /* Returns true if the section has been declared before. Sets internal
337 flag on this section in in_named_hash so subsequent calls on this
338 section will return false. */
341 named_section_first_declaration (const char *name
)
343 struct in_named_entry
**slot
;
345 slot
= (struct in_named_entry
**)
346 htab_find_slot_with_hash (in_named_htab
, name
,
347 htab_hash_string (name
), NO_INSERT
);
348 if (! (*slot
)->declared
)
350 (*slot
)->declared
= true;
360 /* Record FLAGS for SECTION. If SECTION was previously recorded with a
361 different set of flags, return false. */
364 set_named_section_flags (const char *section
, unsigned int flags
)
366 struct in_named_entry
**slot
, *entry
;
368 slot
= (struct in_named_entry
**)
369 htab_find_slot_with_hash (in_named_htab
, section
,
370 htab_hash_string (section
), INSERT
);
375 entry
= ggc_alloc (sizeof (*entry
));
377 entry
->name
= ggc_strdup (section
);
378 entry
->flags
= flags
;
379 entry
->declared
= false;
381 else if (entry
->flags
!= flags
)
387 /* Tell assembler to change to section NAME with attributes FLAGS. */
390 named_section_flags (const char *name
, unsigned int flags
)
392 if (in_section
!= in_named
|| strcmp (name
, in_named_name
) != 0)
394 if (! set_named_section_flags (name
, flags
))
397 targetm
.asm_out
.named_section (name
, flags
);
399 if (flags
& SECTION_FORGET
)
400 in_section
= no_section
;
403 in_named_name
= ggc_strdup (name
);
404 in_section
= in_named
;
409 /* Tell assembler to change to section NAME for DECL.
410 If DECL is NULL, just switch to section NAME.
411 If NAME is NULL, get the name from DECL.
412 If RELOC is 1, the initializer for DECL contains relocs. */
415 named_section (tree decl
, const char *name
, int reloc
)
419 if (decl
!= NULL_TREE
&& !DECL_P (decl
))
422 name
= TREE_STRING_POINTER (DECL_SECTION_NAME (decl
));
424 flags
= targetm
.section_type_flags (decl
, name
, reloc
);
426 /* Sanity check user variables for flag changes. Non-user
427 section flag changes will abort in named_section_flags.
428 However, don't complain if SECTION_OVERRIDE is set.
429 We trust that the setter knows that it is safe to ignore
430 the default flags for this decl. */
431 if (decl
&& ! set_named_section_flags (name
, flags
))
433 flags
= get_named_section_flags (name
);
434 if ((flags
& SECTION_OVERRIDE
) == 0)
435 error ("%J%D causes a section type conflict", decl
, decl
);
438 named_section_flags (name
, flags
);
441 /* If required, set DECL_SECTION_NAME to a unique name. */
444 resolve_unique_section (tree decl
, int reloc ATTRIBUTE_UNUSED
,
445 int flag_function_or_data_sections
)
447 if (DECL_SECTION_NAME (decl
) == NULL_TREE
448 && targetm
.have_named_sections
449 && (flag_function_or_data_sections
450 || DECL_ONE_ONLY (decl
)))
451 targetm
.asm_out
.unique_section (decl
, reloc
);
454 #ifdef BSS_SECTION_ASM_OP
456 /* Tell the assembler to switch to the bss section. */
461 if (in_section
!= in_bss
)
463 fprintf (asm_out_file
, "%s\n", BSS_SECTION_ASM_OP
);
468 #ifdef ASM_OUTPUT_BSS
470 /* Utility function for ASM_OUTPUT_BSS for targets to use if
471 they don't support alignments in .bss.
472 ??? It is believed that this function will work in most cases so such
473 support is localized here. */
476 asm_output_bss (FILE *file
, tree decl ATTRIBUTE_UNUSED
,
478 unsigned HOST_WIDE_INT size ATTRIBUTE_UNUSED
,
479 unsigned HOST_WIDE_INT rounded
)
481 targetm
.asm_out
.globalize_label (file
, name
);
483 #ifdef ASM_DECLARE_OBJECT_NAME
484 last_assemble_variable_decl
= decl
;
485 ASM_DECLARE_OBJECT_NAME (file
, name
, decl
);
487 /* Standard thing is just output label for the object. */
488 ASM_OUTPUT_LABEL (file
, name
);
489 #endif /* ASM_DECLARE_OBJECT_NAME */
490 ASM_OUTPUT_SKIP (file
, rounded
? rounded
: 1);
495 #ifdef ASM_OUTPUT_ALIGNED_BSS
497 /* Utility function for targets to use in implementing
498 ASM_OUTPUT_ALIGNED_BSS.
499 ??? It is believed that this function will work in most cases so such
500 support is localized here. */
503 asm_output_aligned_bss (FILE *file
, tree decl ATTRIBUTE_UNUSED
,
504 const char *name
, unsigned HOST_WIDE_INT size
,
508 ASM_OUTPUT_ALIGN (file
, floor_log2 (align
/ BITS_PER_UNIT
));
509 #ifdef ASM_DECLARE_OBJECT_NAME
510 last_assemble_variable_decl
= decl
;
511 ASM_DECLARE_OBJECT_NAME (file
, name
, decl
);
513 /* Standard thing is just output label for the object. */
514 ASM_OUTPUT_LABEL (file
, name
);
515 #endif /* ASM_DECLARE_OBJECT_NAME */
516 ASM_OUTPUT_SKIP (file
, size
? size
: 1);
521 #endif /* BSS_SECTION_ASM_OP */
523 /* Switch to the section for function DECL.
525 If DECL is NULL_TREE, switch to the text section.
526 ??? It's not clear that we will ever be passed NULL_TREE, but it's
527 safer to handle it. */
530 function_section (tree decl
)
532 if (scan_ahead_for_unlikely_executed_note (get_insns()))
533 unlikely_text_section ();
536 if (decl
!= NULL_TREE
537 && DECL_SECTION_NAME (decl
) != NULL_TREE
)
538 named_section (decl
, (char *) 0, 0);
544 /* Switch to section for variable DECL. RELOC is the same as the
545 argument to SELECT_SECTION. */
548 variable_section (tree decl
, int reloc
)
550 if (IN_NAMED_SECTION (decl
))
551 named_section (decl
, NULL
, reloc
);
553 targetm
.asm_out
.select_section (decl
, reloc
, DECL_ALIGN (decl
));
556 /* Tell assembler to switch to the section for string merging. */
559 mergeable_string_section (tree decl ATTRIBUTE_UNUSED
,
560 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
,
561 unsigned int flags ATTRIBUTE_UNUSED
)
563 if (HAVE_GAS_SHF_MERGE
&& flag_merge_constants
564 && TREE_CODE (decl
) == STRING_CST
565 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
567 && TREE_STRING_LENGTH (decl
) >= int_size_in_bytes (TREE_TYPE (decl
)))
569 enum machine_mode mode
;
570 unsigned int modesize
;
575 mode
= TYPE_MODE (TREE_TYPE (TREE_TYPE (decl
)));
576 modesize
= GET_MODE_BITSIZE (mode
);
577 if (modesize
>= 8 && modesize
<= 256
578 && (modesize
& (modesize
- 1)) == 0)
580 if (align
< modesize
)
583 str
= TREE_STRING_POINTER (decl
);
584 len
= TREE_STRING_LENGTH (decl
);
585 unit
= GET_MODE_SIZE (mode
);
587 /* Check for embedded NUL characters. */
588 for (i
= 0; i
< len
; i
+= unit
)
590 for (j
= 0; j
< unit
; j
++)
591 if (str
[i
+ j
] != '\0')
598 sprintf (name
, ".rodata.str%d.%d", modesize
/ 8,
600 flags
|= (modesize
/ 8) | SECTION_MERGE
| SECTION_STRINGS
;
601 if (!i
&& modesize
< align
)
603 /* A "" string with requested alignment greater than
604 character size might cause a problem:
605 if some other string required even bigger
606 alignment than "", then linker might think the
607 "" is just part of padding after some other string
608 and not put it into the hash table initially.
609 But this means "" could have smaller alignment
611 #ifdef ASM_OUTPUT_SECTION_START
612 named_section_flags (name
, flags
);
613 ASM_OUTPUT_SECTION_START (asm_out_file
);
615 readonly_data_section ();
620 named_section_flags (name
, flags
);
626 readonly_data_section ();
629 /* Tell assembler to switch to the section for constant merging. */
632 mergeable_constant_section (enum machine_mode mode ATTRIBUTE_UNUSED
,
633 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
,
634 unsigned int flags ATTRIBUTE_UNUSED
)
636 unsigned int modesize
= GET_MODE_BITSIZE (mode
);
638 if (HAVE_GAS_SHF_MERGE
&& flag_merge_constants
644 && (align
& (align
- 1)) == 0)
648 sprintf (name
, ".rodata.cst%d", (int) (align
/ 8));
649 flags
|= (align
/ 8) | SECTION_MERGE
;
650 named_section_flags (name
, flags
);
654 readonly_data_section ();
657 /* Given NAME, a putative register name, discard any customary prefixes. */
660 strip_reg_name (const char *name
)
662 #ifdef REGISTER_PREFIX
663 if (!strncmp (name
, REGISTER_PREFIX
, strlen (REGISTER_PREFIX
)))
664 name
+= strlen (REGISTER_PREFIX
);
666 if (name
[0] == '%' || name
[0] == '#')
671 /* The user has asked for a DECL to have a particular name. Set (or
672 change) it in such a way that we don't prefix an underscore to
675 set_user_assembler_name (tree decl
, const char *name
)
677 char *starred
= alloca (strlen (name
) + 2);
679 strcpy (starred
+ 1, name
);
680 change_decl_assembler_name (decl
, get_identifier (starred
));
681 SET_DECL_RTL (decl
, NULL_RTX
);
684 /* Decode an `asm' spec for a declaration as a register name.
685 Return the register number, or -1 if nothing specified,
686 or -2 if the ASMSPEC is not `cc' or `memory' and is not recognized,
687 or -3 if ASMSPEC is `cc' and is not recognized,
688 or -4 if ASMSPEC is `memory' and is not recognized.
689 Accept an exact spelling or a decimal number.
690 Prefixes such as % are optional. */
693 decode_reg_name (const char *asmspec
)
699 /* Get rid of confusing prefixes. */
700 asmspec
= strip_reg_name (asmspec
);
702 /* Allow a decimal number as a "register name". */
703 for (i
= strlen (asmspec
) - 1; i
>= 0; i
--)
704 if (! ISDIGIT (asmspec
[i
]))
706 if (asmspec
[0] != 0 && i
< 0)
709 if (i
< FIRST_PSEUDO_REGISTER
&& i
>= 0)
715 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
717 && ! strcmp (asmspec
, strip_reg_name (reg_names
[i
])))
720 #ifdef ADDITIONAL_REGISTER_NAMES
722 static const struct { const char *const name
; const int number
; } table
[]
723 = ADDITIONAL_REGISTER_NAMES
;
725 for (i
= 0; i
< (int) ARRAY_SIZE (table
); i
++)
726 if (! strcmp (asmspec
, table
[i
].name
))
727 return table
[i
].number
;
729 #endif /* ADDITIONAL_REGISTER_NAMES */
731 if (!strcmp (asmspec
, "memory"))
734 if (!strcmp (asmspec
, "cc"))
743 /* Create the DECL_RTL for a VAR_DECL or FUNCTION_DECL. DECL should
744 have static storage duration. In other words, it should not be an
745 automatic variable, including PARM_DECLs.
747 There is, however, one exception: this function handles variables
748 explicitly placed in a particular register by the user.
750 This is never called for PARM_DECL nodes. */
753 make_decl_rtl (tree decl
)
755 const char *name
= 0;
759 /* Check that we are not being given an automatic variable. */
760 /* A weak alias has TREE_PUBLIC set but not the other bits. */
761 if (TREE_CODE (decl
) == PARM_DECL
762 || TREE_CODE (decl
) == RESULT_DECL
763 || (TREE_CODE (decl
) == VAR_DECL
764 && !TREE_STATIC (decl
)
765 && !TREE_PUBLIC (decl
)
766 && !DECL_EXTERNAL (decl
)
767 && !DECL_REGISTER (decl
)))
769 /* And that we were not given a type or a label. */
770 else if (TREE_CODE (decl
) == TYPE_DECL
771 || TREE_CODE (decl
) == LABEL_DECL
)
774 /* For a duplicate declaration, we can be called twice on the
775 same DECL node. Don't discard the RTL already made. */
776 if (DECL_RTL_SET_P (decl
))
778 /* If the old RTL had the wrong mode, fix the mode. */
779 if (GET_MODE (DECL_RTL (decl
)) != DECL_MODE (decl
))
780 SET_DECL_RTL (decl
, adjust_address_nv (DECL_RTL (decl
),
781 DECL_MODE (decl
), 0));
783 if (TREE_CODE (decl
) != FUNCTION_DECL
&& DECL_REGISTER (decl
))
786 /* ??? Another way to do this would be to maintain a hashed
787 table of such critters. Instead of adding stuff to a DECL
788 to give certain attributes to it, we could use an external
789 hash map from DECL to set of attributes. */
791 /* Let the target reassign the RTL if it wants.
792 This is necessary, for example, when one machine specific
793 decl attribute overrides another. */
794 targetm
.encode_section_info (decl
, DECL_RTL (decl
), false);
796 /* Make this function static known to the mudflap runtime. */
797 if (flag_mudflap
&& TREE_CODE (decl
) == VAR_DECL
)
798 mudflap_enqueue_decl (decl
);
803 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
805 reg_number
= decode_reg_name (name
);
807 if (TREE_CODE (decl
) != FUNCTION_DECL
&& DECL_REGISTER (decl
))
809 /* First detect errors in declaring global registers. */
810 if (reg_number
== -1)
811 error ("%Jregister name not specified for '%D'", decl
, decl
);
812 else if (reg_number
< 0)
813 error ("%Jinvalid register name for '%D'", decl
, decl
);
814 else if (TYPE_MODE (TREE_TYPE (decl
)) == BLKmode
)
815 error ("%Jdata type of '%D' isn't suitable for a register",
817 else if (! HARD_REGNO_MODE_OK (reg_number
, TYPE_MODE (TREE_TYPE (decl
))))
818 error ("%Jregister specified for '%D' isn't suitable for data type",
820 /* Now handle properly declared static register variables. */
825 if (DECL_INITIAL (decl
) != 0 && TREE_STATIC (decl
))
827 DECL_INITIAL (decl
) = 0;
828 error ("global register variable has initial value");
830 if (TREE_THIS_VOLATILE (decl
))
831 warning ("volatile register variables don't work as you might wish");
833 /* If the user specified one of the eliminables registers here,
834 e.g., FRAME_POINTER_REGNUM, we don't want to get this variable
835 confused with that register and be eliminated. This usage is
836 somewhat suspect... */
838 SET_DECL_RTL (decl
, gen_rtx_raw_REG (DECL_MODE (decl
), reg_number
));
839 ORIGINAL_REGNO (DECL_RTL (decl
)) = reg_number
;
840 REG_USERVAR_P (DECL_RTL (decl
)) = 1;
842 if (TREE_STATIC (decl
))
844 /* Make this register global, so not usable for anything
846 #ifdef ASM_DECLARE_REGISTER_GLOBAL
847 ASM_DECLARE_REGISTER_GLOBAL (asm_out_file
, decl
, reg_number
, name
);
849 nregs
= hard_regno_nregs
[reg_number
][DECL_MODE (decl
)];
851 globalize_reg (reg_number
+ --nregs
);
854 /* As a register variable, it has no section. */
859 /* Now handle ordinary static variables and functions (in memory).
860 Also handle vars declared register invalidly. */
862 if (name
[0] == '*' && (reg_number
>= 0 || reg_number
== -3))
863 error ("%Jregister name given for non-register variable '%D'", decl
, decl
);
865 /* Specifying a section attribute on a variable forces it into a
866 non-.bss section, and thus it cannot be common. */
867 if (TREE_CODE (decl
) == VAR_DECL
868 && DECL_SECTION_NAME (decl
) != NULL_TREE
869 && DECL_INITIAL (decl
) == NULL_TREE
870 && DECL_COMMON (decl
))
871 DECL_COMMON (decl
) = 0;
873 /* Variables can't be both common and weak. */
874 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_WEAK (decl
))
875 DECL_COMMON (decl
) = 0;
877 x
= gen_rtx_SYMBOL_REF (Pmode
, name
);
878 SYMBOL_REF_WEAK (x
) = DECL_WEAK (decl
);
879 SYMBOL_REF_DECL (x
) = decl
;
881 x
= gen_rtx_MEM (DECL_MODE (decl
), x
);
882 if (TREE_CODE (decl
) != FUNCTION_DECL
)
883 set_mem_attributes (x
, decl
, 1);
884 SET_DECL_RTL (decl
, x
);
886 /* Optionally set flags or add text to the name to record information
887 such as that it is a function name.
888 If the name is changed, the macro ASM_OUTPUT_LABELREF
889 will have to know how to strip this information. */
890 targetm
.encode_section_info (decl
, DECL_RTL (decl
), true);
892 /* Make this function static known to the mudflap runtime. */
893 if (flag_mudflap
&& TREE_CODE (decl
) == VAR_DECL
)
894 mudflap_enqueue_decl (decl
);
897 /* Make the rtl for variable VAR be volatile.
898 Use this only for static variables. */
901 make_var_volatile (tree var
)
903 if (!MEM_P (DECL_RTL (var
)))
906 MEM_VOLATILE_P (DECL_RTL (var
)) = 1;
909 /* Output a string of literal assembler code
910 for an `asm' keyword used between functions. */
913 assemble_asm (tree string
)
917 if (TREE_CODE (string
) == ADDR_EXPR
)
918 string
= TREE_OPERAND (string
, 0);
920 fprintf (asm_out_file
, "\t%s\n", TREE_STRING_POINTER (string
));
923 /* Record an element in the table of global destructors. SYMBOL is
924 a SYMBOL_REF of the function to be called; PRIORITY is a number
925 between 0 and MAX_INIT_PRIORITY. */
928 default_stabs_asm_out_destructor (rtx symbol
, int priority ATTRIBUTE_UNUSED
)
930 /* Tell GNU LD that this is part of the static destructor set.
931 This will work for any system that uses stabs, most usefully
933 fprintf (asm_out_file
, "%s\"___DTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
934 assemble_name (asm_out_file
, XSTR (symbol
, 0));
935 fputc ('\n', asm_out_file
);
939 default_named_section_asm_out_destructor (rtx symbol
, int priority
)
941 const char *section
= ".dtors";
944 /* ??? This only works reliably with the GNU linker. */
945 if (priority
!= DEFAULT_INIT_PRIORITY
)
947 sprintf (buf
, ".dtors.%.5u",
948 /* Invert the numbering so the linker puts us in the proper
949 order; constructors are run from right to left, and the
950 linker sorts in increasing order. */
951 MAX_INIT_PRIORITY
- priority
);
955 named_section_flags (section
, SECTION_WRITE
);
956 assemble_align (POINTER_SIZE
);
957 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
960 #ifdef DTORS_SECTION_ASM_OP
964 if (in_section
!= in_dtors
)
966 in_section
= in_dtors
;
967 fputs (DTORS_SECTION_ASM_OP
, asm_out_file
);
968 fputc ('\n', asm_out_file
);
973 default_dtor_section_asm_out_destructor (rtx symbol
,
974 int priority ATTRIBUTE_UNUSED
)
977 assemble_align (POINTER_SIZE
);
978 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
982 /* Likewise for global constructors. */
985 default_stabs_asm_out_constructor (rtx symbol
, int priority ATTRIBUTE_UNUSED
)
987 /* Tell GNU LD that this is part of the static destructor set.
988 This will work for any system that uses stabs, most usefully
990 fprintf (asm_out_file
, "%s\"___CTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
991 assemble_name (asm_out_file
, XSTR (symbol
, 0));
992 fputc ('\n', asm_out_file
);
996 default_named_section_asm_out_constructor (rtx symbol
, int priority
)
998 const char *section
= ".ctors";
1001 /* ??? This only works reliably with the GNU linker. */
1002 if (priority
!= DEFAULT_INIT_PRIORITY
)
1004 sprintf (buf
, ".ctors.%.5u",
1005 /* Invert the numbering so the linker puts us in the proper
1006 order; constructors are run from right to left, and the
1007 linker sorts in increasing order. */
1008 MAX_INIT_PRIORITY
- priority
);
1012 named_section_flags (section
, SECTION_WRITE
);
1013 assemble_align (POINTER_SIZE
);
1014 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1017 #ifdef CTORS_SECTION_ASM_OP
1019 ctors_section (void)
1021 if (in_section
!= in_ctors
)
1023 in_section
= in_ctors
;
1024 fputs (CTORS_SECTION_ASM_OP
, asm_out_file
);
1025 fputc ('\n', asm_out_file
);
1030 default_ctor_section_asm_out_constructor (rtx symbol
,
1031 int priority ATTRIBUTE_UNUSED
)
1034 assemble_align (POINTER_SIZE
);
1035 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1039 /* CONSTANT_POOL_BEFORE_FUNCTION may be defined as an expression with
1040 a nonzero value if the constant pool should be output before the
1041 start of the function, or a zero value if the pool should output
1042 after the end of the function. The default is to put it before the
1045 #ifndef CONSTANT_POOL_BEFORE_FUNCTION
1046 #define CONSTANT_POOL_BEFORE_FUNCTION 1
1049 /* DECL is an object (either VAR_DECL or FUNCTION_DECL) which is going
1050 to be output to assembler.
1051 Set first_global_object_name and weak_global_object_name as appropriate. */
1054 notice_global_symbol (tree decl
)
1056 const char **type
= &first_global_object_name
;
1058 if (first_global_object_name
1059 || !TREE_PUBLIC (decl
) || DECL_EXTERNAL (decl
)
1060 || !DECL_NAME (decl
)
1061 || (TREE_CODE (decl
) != FUNCTION_DECL
1062 && (TREE_CODE (decl
) != VAR_DECL
1063 || (DECL_COMMON (decl
)
1064 && (DECL_INITIAL (decl
) == 0
1065 || DECL_INITIAL (decl
) == error_mark_node
))))
1066 || !MEM_P (DECL_RTL (decl
)))
1069 /* We win when global object is found, but it is useful to know about weak
1070 symbol as well so we can produce nicer unique names. */
1071 if (DECL_WEAK (decl
) || DECL_ONE_ONLY (decl
))
1072 type
= &weak_global_object_name
;
1078 rtx decl_rtl
= DECL_RTL (decl
);
1080 p
= targetm
.strip_name_encoding (XSTR (XEXP (decl_rtl
, 0), 0));
1087 /* Output assembler code for the constant pool of a function and associated
1088 with defining the name of the function. DECL describes the function.
1089 NAME is the function's name. For the constant pool, we use the current
1090 constant pool data. */
1093 assemble_start_function (tree decl
, const char *fnname
)
1097 unlikely_section_label_printed
= false;
1099 /* The following code does not need preprocessing in the assembler. */
1103 if (CONSTANT_POOL_BEFORE_FUNCTION
)
1104 output_constant_pool (fnname
, decl
);
1106 resolve_unique_section (decl
, 0, flag_function_sections
);
1107 function_section (decl
);
1109 /* Tell assembler to move to target machine's alignment for functions. */
1110 align
= floor_log2 (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
1111 if (align
< force_align_functions_log
)
1112 align
= force_align_functions_log
;
1115 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1118 /* Handle a user-specified function alignment.
1119 Note that we still need to align to FUNCTION_BOUNDARY, as above,
1120 because ASM_OUTPUT_MAX_SKIP_ALIGN might not do any alignment at all. */
1121 if (align_functions_log
> align
1122 && cfun
->function_frequency
!= FUNCTION_FREQUENCY_UNLIKELY_EXECUTED
)
1124 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
1125 ASM_OUTPUT_MAX_SKIP_ALIGN (asm_out_file
,
1126 align_functions_log
, align_functions
- 1);
1128 ASM_OUTPUT_ALIGN (asm_out_file
, align_functions_log
);
1132 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
1133 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file
, fnname
);
1136 (*debug_hooks
->begin_function
) (decl
);
1138 /* Make function name accessible from other files, if appropriate. */
1140 if (TREE_PUBLIC (decl
))
1142 notice_global_symbol (decl
);
1144 globalize_decl (decl
);
1146 maybe_assemble_visibility (decl
);
1149 /* Do any machine/system dependent processing of the function name. */
1150 #ifdef ASM_DECLARE_FUNCTION_NAME
1151 ASM_DECLARE_FUNCTION_NAME (asm_out_file
, fnname
, current_function_decl
);
1153 /* Standard thing is just output label for the function. */
1154 ASM_OUTPUT_LABEL (asm_out_file
, fnname
);
1155 #endif /* ASM_DECLARE_FUNCTION_NAME */
1158 /* Output assembler code associated with defining the size of the
1159 function. DECL describes the function. NAME is the function's name. */
1162 assemble_end_function (tree decl
, const char *fnname
)
1164 #ifdef ASM_DECLARE_FUNCTION_SIZE
1165 ASM_DECLARE_FUNCTION_SIZE (asm_out_file
, fnname
, decl
);
1167 if (! CONSTANT_POOL_BEFORE_FUNCTION
)
1169 output_constant_pool (fnname
, decl
);
1170 function_section (decl
); /* need to switch back */
1174 /* Assemble code to leave SIZE bytes of zeros. */
1177 assemble_zeros (unsigned HOST_WIDE_INT size
)
1179 /* Do no output if -fsyntax-only. */
1180 if (flag_syntax_only
)
1183 #ifdef ASM_NO_SKIP_IN_TEXT
1184 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
1185 so we must output 0s explicitly in the text section. */
1186 if ((ASM_NO_SKIP_IN_TEXT
&& in_text_section ())
1187 || (ASM_NO_SKIP_IN_TEXT
&& in_unlikely_text_section ()))
1189 unsigned HOST_WIDE_INT i
;
1190 for (i
= 0; i
< size
; i
++)
1191 assemble_integer (const0_rtx
, 1, BITS_PER_UNIT
, 1);
1196 ASM_OUTPUT_SKIP (asm_out_file
, size
);
1199 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
1202 assemble_align (int align
)
1204 if (align
> BITS_PER_UNIT
)
1206 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
1210 /* Assemble a string constant with the specified C string as contents. */
1213 assemble_string (const char *p
, int size
)
1218 /* If the string is very long, split it up. */
1222 int thissize
= size
- pos
;
1223 if (thissize
> maximum
)
1226 ASM_OUTPUT_ASCII (asm_out_file
, p
, thissize
);
1234 #if defined ASM_OUTPUT_ALIGNED_DECL_LOCAL
1235 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1236 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1238 #if defined ASM_OUTPUT_ALIGNED_LOCAL
1239 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1240 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, DECL_ALIGN (decl))
1242 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1243 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded)
1247 #if defined ASM_OUTPUT_ALIGNED_BSS
1248 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1249 ASM_OUTPUT_ALIGNED_BSS (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1251 #if defined ASM_OUTPUT_BSS
1252 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1253 ASM_OUTPUT_BSS (asm_out_file, decl, name, size, rounded)
1259 #if defined ASM_OUTPUT_ALIGNED_DECL_COMMON
1260 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1261 ASM_OUTPUT_ALIGNED_DECL_COMMON (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1263 #if defined ASM_OUTPUT_ALIGNED_COMMON
1264 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1265 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file, name, size, DECL_ALIGN (decl))
1267 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1268 ASM_OUTPUT_COMMON (asm_out_file, name, size, rounded)
1273 asm_emit_uninitialised (tree decl
, const char *name
,
1274 unsigned HOST_WIDE_INT size ATTRIBUTE_UNUSED
,
1275 unsigned HOST_WIDE_INT rounded ATTRIBUTE_UNUSED
)
1283 destination
= asm_dest_local
;
1285 /* ??? We should handle .bss via select_section mechanisms rather than
1286 via special target hooks. That would eliminate this special case. */
1287 if (TREE_PUBLIC (decl
))
1289 if (!DECL_COMMON (decl
))
1291 destination
= asm_dest_bss
;
1296 destination
= asm_dest_common
;
1299 if (destination
== asm_dest_bss
)
1300 globalize_decl (decl
);
1301 resolve_unique_section (decl
, 0, flag_data_sections
);
1303 if (flag_shared_data
)
1305 switch (destination
)
1307 #ifdef ASM_OUTPUT_SHARED_BSS
1309 ASM_OUTPUT_SHARED_BSS (asm_out_file
, decl
, name
, size
, rounded
);
1312 #ifdef ASM_OUTPUT_SHARED_COMMON
1313 case asm_dest_common
:
1314 ASM_OUTPUT_SHARED_COMMON (asm_out_file
, name
, size
, rounded
);
1317 #ifdef ASM_OUTPUT_SHARED_LOCAL
1318 case asm_dest_local
:
1319 ASM_OUTPUT_SHARED_LOCAL (asm_out_file
, name
, size
, rounded
);
1327 switch (destination
)
1331 ASM_EMIT_BSS (decl
, name
, size
, rounded
);
1334 case asm_dest_common
:
1335 ASM_EMIT_COMMON (decl
, name
, size
, rounded
);
1337 case asm_dest_local
:
1338 ASM_EMIT_LOCAL (decl
, name
, size
, rounded
);
1347 /* Assemble everything that is needed for a variable or function declaration.
1348 Not used for automatic variables, and not used for function definitions.
1349 Should not be called for variables of incomplete structure type.
1351 TOP_LEVEL is nonzero if this variable has file scope.
1352 AT_END is nonzero if this is the special handling, at end of compilation,
1353 to define things that have had only tentative definitions.
1354 DONT_OUTPUT_DATA if nonzero means don't actually output the
1355 initial value (that will be done by the caller). */
1358 assemble_variable (tree decl
, int top_level ATTRIBUTE_UNUSED
,
1359 int at_end ATTRIBUTE_UNUSED
, int dont_output_data
)
1366 if (lang_hooks
.decls
.prepare_assemble_variable
)
1367 lang_hooks
.decls
.prepare_assemble_variable (decl
);
1369 last_assemble_variable_decl
= 0;
1371 /* Normally no need to say anything here for external references,
1372 since assemble_external is called by the language-specific code
1373 when a declaration is first seen. */
1375 if (DECL_EXTERNAL (decl
))
1378 /* Output no assembler code for a function declaration.
1379 Only definitions of functions output anything. */
1381 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1384 /* Do nothing for global register variables. */
1385 if (DECL_RTL_SET_P (decl
) && REG_P (DECL_RTL (decl
)))
1387 TREE_ASM_WRITTEN (decl
) = 1;
1391 /* If type was incomplete when the variable was declared,
1392 see if it is complete now. */
1394 if (DECL_SIZE (decl
) == 0)
1395 layout_decl (decl
, 0);
1397 /* Still incomplete => don't allocate it; treat the tentative defn
1398 (which is what it must have been) as an `extern' reference. */
1400 if (!dont_output_data
&& DECL_SIZE (decl
) == 0)
1402 error ("%Jstorage size of `%D' isn't known", decl
, decl
);
1403 TREE_ASM_WRITTEN (decl
) = 1;
1407 /* The first declaration of a variable that comes through this function
1408 decides whether it is global (in C, has external linkage)
1409 or local (in C, has internal linkage). So do nothing more
1410 if this function has already run. */
1412 if (TREE_ASM_WRITTEN (decl
))
1415 /* Make sure targetm.encode_section_info is invoked before we set
1417 decl_rtl
= DECL_RTL (decl
);
1419 TREE_ASM_WRITTEN (decl
) = 1;
1421 /* Do no output if -fsyntax-only. */
1422 if (flag_syntax_only
)
1427 if (! dont_output_data
1428 && ! host_integerp (DECL_SIZE_UNIT (decl
), 1))
1430 error ("%Jsize of variable '%D' is too large", decl
, decl
);
1434 name
= XSTR (XEXP (decl_rtl
, 0), 0);
1435 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
))
1436 notice_global_symbol (decl
);
1438 /* Compute the alignment of this data. */
1440 align
= DECL_ALIGN (decl
);
1442 /* In the case for initialing an array whose length isn't specified,
1443 where we have not yet been able to do the layout,
1444 figure out the proper alignment now. */
1445 if (dont_output_data
&& DECL_SIZE (decl
) == 0
1446 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
)
1447 align
= MAX (align
, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl
))));
1449 /* Some object file formats have a maximum alignment which they support.
1450 In particular, a.out format supports a maximum alignment of 4. */
1451 #ifndef MAX_OFILE_ALIGNMENT
1452 #define MAX_OFILE_ALIGNMENT BIGGEST_ALIGNMENT
1454 if (align
> MAX_OFILE_ALIGNMENT
)
1456 warning ("%Jalignment of '%D' is greater than maximum object "
1457 "file alignment. Using %d", decl
, decl
,
1458 MAX_OFILE_ALIGNMENT
/BITS_PER_UNIT
);
1459 align
= MAX_OFILE_ALIGNMENT
;
1462 /* On some machines, it is good to increase alignment sometimes. */
1463 if (! DECL_USER_ALIGN (decl
))
1465 #ifdef DATA_ALIGNMENT
1466 align
= DATA_ALIGNMENT (TREE_TYPE (decl
), align
);
1468 #ifdef CONSTANT_ALIGNMENT
1469 if (DECL_INITIAL (decl
) != 0 && DECL_INITIAL (decl
) != error_mark_node
)
1470 align
= CONSTANT_ALIGNMENT (DECL_INITIAL (decl
), align
);
1474 /* Reset the alignment in case we have made it tighter, so we can benefit
1475 from it in get_pointer_alignment. */
1476 DECL_ALIGN (decl
) = align
;
1477 set_mem_align (decl_rtl
, align
);
1479 if (TREE_PUBLIC (decl
))
1480 maybe_assemble_visibility (decl
);
1482 /* Output any data that we will need to use the address of. */
1483 if (DECL_INITIAL (decl
) == error_mark_node
)
1484 reloc
= contains_pointers_p (TREE_TYPE (decl
)) ? 3 : 0;
1485 else if (DECL_INITIAL (decl
))
1487 reloc
= compute_reloc_for_constant (DECL_INITIAL (decl
));
1488 output_addressed_constants (DECL_INITIAL (decl
));
1490 resolve_unique_section (decl
, reloc
, flag_data_sections
);
1492 /* Handle uninitialized definitions. */
1494 /* If the decl has been given an explicit section name, then it
1495 isn't common, and shouldn't be handled as such. */
1496 if (DECL_SECTION_NAME (decl
) || dont_output_data
)
1498 /* We don't implement common thread-local data at present. */
1499 else if (DECL_THREAD_LOCAL (decl
))
1501 if (DECL_COMMON (decl
))
1502 sorry ("thread-local COMMON data not implemented");
1504 else if (DECL_INITIAL (decl
) == 0
1505 || DECL_INITIAL (decl
) == error_mark_node
1506 || (flag_zero_initialized_in_bss
1507 /* Leave constant zeroes in .rodata so they can be shared. */
1508 && !TREE_READONLY (decl
)
1509 && initializer_zerop (DECL_INITIAL (decl
))))
1511 unsigned HOST_WIDE_INT size
= tree_low_cst (DECL_SIZE_UNIT (decl
), 1);
1512 unsigned HOST_WIDE_INT rounded
= size
;
1514 /* Don't allocate zero bytes of common,
1515 since that means "undefined external" in the linker. */
1519 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1520 so that each uninitialized object starts on such a boundary. */
1521 rounded
+= (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1;
1522 rounded
= (rounded
/ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1523 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1525 #if !defined(ASM_OUTPUT_ALIGNED_COMMON) && !defined(ASM_OUTPUT_ALIGNED_DECL_COMMON) && !defined(ASM_OUTPUT_ALIGNED_BSS)
1526 if ((unsigned HOST_WIDE_INT
) DECL_ALIGN (decl
) / BITS_PER_UNIT
> rounded
)
1527 warning ("%Jrequested alignment for '%D' is greater than "
1528 "implemented alignment of %d", decl
, decl
, rounded
);
1531 /* If the target cannot output uninitialized but not common global data
1532 in .bss, then we have to use .data, so fall through. */
1533 if (asm_emit_uninitialised (decl
, name
, size
, rounded
))
1537 /* Handle initialized definitions.
1538 Also handle uninitialized global definitions if -fno-common and the
1539 target doesn't support ASM_OUTPUT_BSS. */
1541 /* First make the assembler name(s) global if appropriate. */
1542 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
))
1543 globalize_decl (decl
);
1545 /* Switch to the appropriate section. */
1546 variable_section (decl
, reloc
);
1548 /* dbxout.c needs to know this. */
1549 if (in_text_section () || in_unlikely_text_section ())
1550 DECL_IN_TEXT_SECTION (decl
) = 1;
1552 /* Output the alignment of this data. */
1553 if (align
> BITS_PER_UNIT
)
1555 ASM_OUTPUT_ALIGN (asm_out_file
,
1556 floor_log2 (DECL_ALIGN (decl
) / BITS_PER_UNIT
));
1559 /* Do any machine/system dependent processing of the object. */
1560 #ifdef ASM_DECLARE_OBJECT_NAME
1561 last_assemble_variable_decl
= decl
;
1562 ASM_DECLARE_OBJECT_NAME (asm_out_file
, name
, decl
);
1564 /* Standard thing is just output label for the object. */
1565 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1566 #endif /* ASM_DECLARE_OBJECT_NAME */
1568 if (!dont_output_data
)
1570 if (DECL_INITIAL (decl
)
1571 && DECL_INITIAL (decl
) != error_mark_node
1572 && !initializer_zerop (DECL_INITIAL (decl
)))
1573 /* Output the actual data. */
1574 output_constant (DECL_INITIAL (decl
),
1575 tree_low_cst (DECL_SIZE_UNIT (decl
), 1),
1578 /* Leave space for it. */
1579 assemble_zeros (tree_low_cst (DECL_SIZE_UNIT (decl
), 1));
1583 /* Return 1 if type TYPE contains any pointers. */
1586 contains_pointers_p (tree type
)
1588 switch (TREE_CODE (type
))
1591 case REFERENCE_TYPE
:
1592 /* I'm not sure whether OFFSET_TYPE needs this treatment,
1593 so I'll play safe and return 1. */
1599 case QUAL_UNION_TYPE
:
1602 /* For a type that has fields, see if the fields have pointers. */
1603 for (fields
= TYPE_FIELDS (type
); fields
; fields
= TREE_CHAIN (fields
))
1604 if (TREE_CODE (fields
) == FIELD_DECL
1605 && contains_pointers_p (TREE_TYPE (fields
)))
1611 /* An array type contains pointers if its element type does. */
1612 return contains_pointers_p (TREE_TYPE (type
));
1619 #ifdef ASM_OUTPUT_EXTERNAL
1620 /* True if DECL is a function decl for which no out-of-line copy exists.
1621 It is assumed that DECL's assembler name has been set. */
1624 incorporeal_function_p (tree decl
)
1626 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_BUILT_IN (decl
))
1630 if (DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
1631 && DECL_FUNCTION_CODE (decl
) == BUILT_IN_ALLOCA
)
1634 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
1635 if (strncmp (name
, "__builtin_", strlen ("__builtin_")) == 0)
1642 /* Output something to declare an external symbol to the assembler.
1643 (Most assemblers don't need this, so we normally output nothing.)
1644 Do nothing if DECL is not external. */
1647 assemble_external (tree decl ATTRIBUTE_UNUSED
)
1649 /* Because most platforms do not define ASM_OUTPUT_EXTERNAL, the
1650 main body of this code is only rarely exercised. To provide some
1651 testing, on all platforms, we make sure that the ASM_OUT_FILE is
1652 open. If it's not, we should not be calling this function. */
1656 #ifdef ASM_OUTPUT_EXTERNAL
1657 if (DECL_P (decl
) && DECL_EXTERNAL (decl
) && TREE_PUBLIC (decl
))
1659 rtx rtl
= DECL_RTL (decl
);
1661 if (MEM_P (rtl
) && GET_CODE (XEXP (rtl
, 0)) == SYMBOL_REF
1662 && !SYMBOL_REF_USED (XEXP (rtl
, 0))
1663 && !incorporeal_function_p (decl
))
1665 /* Some systems do require some output. */
1666 SYMBOL_REF_USED (XEXP (rtl
, 0)) = 1;
1667 ASM_OUTPUT_EXTERNAL (asm_out_file
, decl
, XSTR (XEXP (rtl
, 0), 0));
1673 /* Similar, for calling a library function FUN. */
1676 assemble_external_libcall (rtx fun
)
1678 /* Declare library function name external when first used, if nec. */
1679 if (! SYMBOL_REF_USED (fun
))
1681 SYMBOL_REF_USED (fun
) = 1;
1682 targetm
.asm_out
.external_libcall (fun
);
1686 /* Assemble a label named NAME. */
1689 assemble_label (const char *name
)
1691 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1694 /* Set the symbol_referenced flag for ID. */
1696 mark_referenced (tree id
)
1698 TREE_SYMBOL_REFERENCED (id
) = 1;
1701 /* Set the symbol_referenced flag for DECL and notify callgraph. */
1703 mark_decl_referenced (tree decl
)
1705 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1706 cgraph_mark_needed_node (cgraph_node (decl
));
1707 else if (TREE_CODE (decl
) == VAR_DECL
)
1708 cgraph_varpool_mark_needed_node (cgraph_varpool_node (decl
));
1709 /* else do nothing - we can get various sorts of CST nodes here,
1710 which do not need to be marked. */
1713 /* Output to FILE a reference to the assembler name of a C-level name NAME.
1714 If NAME starts with a *, the rest of NAME is output verbatim.
1715 Otherwise NAME is transformed in an implementation-defined way
1716 (usually by the addition of an underscore).
1717 Many macros in the tm file are defined to call this function. */
1720 assemble_name (FILE *file
, const char *name
)
1722 const char *real_name
;
1725 real_name
= targetm
.strip_name_encoding (name
);
1727 id
= maybe_get_identifier (real_name
);
1729 mark_referenced (id
);
1732 fputs (&name
[1], file
);
1734 ASM_OUTPUT_LABELREF (file
, name
);
1737 /* Allocate SIZE bytes writable static space with a gensym name
1738 and return an RTX to refer to its address. */
1741 assemble_static_space (unsigned HOST_WIDE_INT size
)
1744 const char *namestring
;
1748 if (flag_shared_data
)
1752 ASM_GENERATE_INTERNAL_LABEL (name
, "LF", const_labelno
);
1754 namestring
= ggc_strdup (name
);
1756 x
= gen_rtx_SYMBOL_REF (Pmode
, namestring
);
1757 SYMBOL_REF_FLAGS (x
) = SYMBOL_FLAG_LOCAL
;
1759 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
1760 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file
, NULL_TREE
, name
, size
,
1763 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1764 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file
, name
, size
, BIGGEST_ALIGNMENT
);
1767 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1768 so that each uninitialized object starts on such a boundary. */
1769 /* Variable `rounded' might or might not be used in ASM_OUTPUT_LOCAL. */
1770 unsigned HOST_WIDE_INT rounded ATTRIBUTE_UNUSED
1771 = ((size
+ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1)
1772 / (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1773 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1774 ASM_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
1781 /* Assemble the static constant template for function entry trampolines.
1782 This is done at most once per compilation.
1783 Returns an RTX for the address of the template. */
1785 static GTY(()) rtx initial_trampoline
;
1787 #ifdef TRAMPOLINE_TEMPLATE
1789 assemble_trampoline_template (void)
1796 if (initial_trampoline
)
1797 return initial_trampoline
;
1799 /* By default, put trampoline templates in read-only data section. */
1801 #ifdef TRAMPOLINE_SECTION
1802 TRAMPOLINE_SECTION ();
1804 readonly_data_section ();
1807 /* Write the assembler code to define one. */
1808 align
= floor_log2 (TRAMPOLINE_ALIGNMENT
/ BITS_PER_UNIT
);
1811 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1814 targetm
.asm_out
.internal_label (asm_out_file
, "LTRAMP", 0);
1815 TRAMPOLINE_TEMPLATE (asm_out_file
);
1817 /* Record the rtl to refer to it. */
1818 ASM_GENERATE_INTERNAL_LABEL (label
, "LTRAMP", 0);
1819 name
= ggc_strdup (label
);
1820 symbol
= gen_rtx_SYMBOL_REF (Pmode
, name
);
1821 SYMBOL_REF_FLAGS (symbol
) = SYMBOL_FLAG_LOCAL
;
1823 initial_trampoline
= gen_rtx_MEM (BLKmode
, symbol
);
1824 set_mem_align (initial_trampoline
, TRAMPOLINE_ALIGNMENT
);
1826 return initial_trampoline
;
1830 /* A and B are either alignments or offsets. Return the minimum alignment
1831 that may be assumed after adding the two together. */
1833 static inline unsigned
1834 min_align (unsigned int a
, unsigned int b
)
1836 return (a
| b
) & -(a
| b
);
1839 /* Return the assembler directive for creating a given kind of integer
1840 object. SIZE is the number of bytes in the object and ALIGNED_P
1841 indicates whether it is known to be aligned. Return NULL if the
1842 assembly dialect has no such directive.
1844 The returned string should be printed at the start of a new line and
1845 be followed immediately by the object's initial value. */
1848 integer_asm_op (int size
, int aligned_p
)
1850 struct asm_int_op
*ops
;
1853 ops
= &targetm
.asm_out
.aligned_op
;
1855 ops
= &targetm
.asm_out
.unaligned_op
;
1860 return targetm
.asm_out
.byte_op
;
1874 /* Use directive OP to assemble an integer object X. Print OP at the
1875 start of the line, followed immediately by the value of X. */
1878 assemble_integer_with_op (const char *op
, rtx x
)
1880 fputs (op
, asm_out_file
);
1881 output_addr_const (asm_out_file
, x
);
1882 fputc ('\n', asm_out_file
);
1885 /* The default implementation of the asm_out.integer target hook. */
1888 default_assemble_integer (rtx x ATTRIBUTE_UNUSED
,
1889 unsigned int size ATTRIBUTE_UNUSED
,
1890 int aligned_p ATTRIBUTE_UNUSED
)
1892 const char *op
= integer_asm_op (size
, aligned_p
);
1893 return op
&& (assemble_integer_with_op (op
, x
), true);
1896 /* Assemble the integer constant X into an object of SIZE bytes. ALIGN is
1897 the alignment of the integer in bits. Return 1 if we were able to output
1898 the constant, otherwise 0. If FORCE is nonzero, abort if we can't output
1902 assemble_integer (rtx x
, unsigned int size
, unsigned int align
, int force
)
1906 aligned_p
= (align
>= MIN (size
* BITS_PER_UNIT
, BIGGEST_ALIGNMENT
));
1908 /* See if the target hook can handle this kind of object. */
1909 if (targetm
.asm_out
.integer (x
, size
, aligned_p
))
1912 /* If the object is a multi-byte one, try splitting it up. Split
1913 it into words it if is multi-word, otherwise split it into bytes. */
1916 enum machine_mode omode
, imode
;
1917 unsigned int subalign
;
1918 unsigned int subsize
, i
;
1920 subsize
= size
> UNITS_PER_WORD
? UNITS_PER_WORD
: 1;
1921 subalign
= MIN (align
, subsize
* BITS_PER_UNIT
);
1922 omode
= mode_for_size (subsize
* BITS_PER_UNIT
, MODE_INT
, 0);
1923 imode
= mode_for_size (size
* BITS_PER_UNIT
, MODE_INT
, 0);
1925 for (i
= 0; i
< size
; i
+= subsize
)
1927 rtx partial
= simplify_subreg (omode
, x
, imode
, i
);
1928 if (!partial
|| !assemble_integer (partial
, subsize
, subalign
, 0))
1934 /* If we've printed some of it, but not all of it, there's no going
1947 assemble_real (REAL_VALUE_TYPE d
, enum machine_mode mode
, unsigned int align
)
1951 int bitsize
, nelts
, nunits
, units_per
;
1953 /* This is hairy. We have a quantity of known size. real_to_target
1954 will put it into an array of *host* longs, 32 bits per element
1955 (even if long is more than 32 bits). We need to determine the
1956 number of array elements that are occupied (nelts) and the number
1957 of *target* min-addressable units that will be occupied in the
1958 object file (nunits). We cannot assume that 32 divides the
1959 mode's bitsize (size * BITS_PER_UNIT) evenly.
1961 size * BITS_PER_UNIT is used here to make sure that padding bits
1962 (which might appear at either end of the value; real_to_target
1963 will include the padding bits in its output array) are included. */
1965 nunits
= GET_MODE_SIZE (mode
);
1966 bitsize
= nunits
* BITS_PER_UNIT
;
1967 nelts
= CEIL (bitsize
, 32);
1968 units_per
= 32 / BITS_PER_UNIT
;
1970 real_to_target (data
, &d
, mode
);
1972 /* Put out the first word with the specified alignment. */
1973 assemble_integer (GEN_INT (data
[0]), MIN (nunits
, units_per
), align
, 1);
1974 nunits
-= units_per
;
1976 /* Subsequent words need only 32-bit alignment. */
1977 align
= min_align (align
, 32);
1979 for (i
= 1; i
< nelts
; i
++)
1981 assemble_integer (GEN_INT (data
[i
]), MIN (nunits
, units_per
), align
, 1);
1982 nunits
-= units_per
;
1986 /* Given an expression EXP with a constant value,
1987 reduce it to the sum of an assembler symbol and an integer.
1988 Store them both in the structure *VALUE.
1989 Abort if EXP does not reduce. */
1991 struct addr_const
GTY(())
1994 HOST_WIDE_INT offset
;
1998 decode_addr_const (tree exp
, struct addr_const
*value
)
2000 tree target
= TREE_OPERAND (exp
, 0);
2006 if (TREE_CODE (target
) == COMPONENT_REF
2007 && host_integerp (byte_position (TREE_OPERAND (target
, 1)), 0))
2010 offset
+= int_byte_position (TREE_OPERAND (target
, 1));
2011 target
= TREE_OPERAND (target
, 0);
2013 else if (TREE_CODE (target
) == ARRAY_REF
2014 || TREE_CODE (target
) == ARRAY_RANGE_REF
)
2016 offset
+= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (target
)), 1)
2017 * tree_low_cst (TREE_OPERAND (target
, 1), 0));
2018 target
= TREE_OPERAND (target
, 0);
2024 switch (TREE_CODE (target
))
2028 x
= DECL_RTL (target
);
2032 x
= gen_rtx_MEM (FUNCTION_MODE
,
2033 gen_rtx_LABEL_REF (VOIDmode
, force_label_rtx (target
)));
2041 x
= output_constant_def (target
, 1);
2053 value
->offset
= offset
;
2056 /* Uniquize all constants that appear in memory.
2057 Each constant in memory thus far output is recorded
2058 in `const_desc_table'. */
2060 struct constant_descriptor_tree
GTY(())
2062 /* A MEM for the constant. */
2065 /* The value of the constant. */
2069 static GTY((param_is (struct constant_descriptor_tree
)))
2070 htab_t const_desc_htab
;
2072 static struct constant_descriptor_tree
* build_constant_desc (tree
);
2073 static void maybe_output_constant_def_contents (struct constant_descriptor_tree
*, int);
2075 /* Compute a hash code for a constant expression. */
2078 const_desc_hash (const void *ptr
)
2080 return const_hash_1 (((struct constant_descriptor_tree
*)ptr
)->value
);
2084 const_hash_1 (const tree exp
)
2089 enum tree_code code
= TREE_CODE (exp
);
2091 /* Either set P and LEN to the address and len of something to hash and
2092 exit the switch or return a value. */
2097 p
= (char *) &TREE_INT_CST (exp
);
2098 len
= sizeof TREE_INT_CST (exp
);
2102 return real_hash (TREE_REAL_CST_PTR (exp
));
2105 p
= TREE_STRING_POINTER (exp
);
2106 len
= TREE_STRING_LENGTH (exp
);
2110 return (const_hash_1 (TREE_REALPART (exp
)) * 5
2111 + const_hash_1 (TREE_IMAGPART (exp
)));
2114 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2118 len
= int_size_in_bytes (TREE_TYPE (exp
));
2120 get_set_constructor_bytes (exp
, (unsigned char *) tmp
, len
);
2128 hi
= 5 + int_size_in_bytes (TREE_TYPE (exp
));
2130 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2131 if (TREE_VALUE (link
))
2132 hi
= hi
* 603 + const_hash_1 (TREE_VALUE (link
));
2140 struct addr_const value
;
2142 decode_addr_const (exp
, &value
);
2143 if (GET_CODE (value
.base
) == SYMBOL_REF
)
2145 /* Don't hash the address of the SYMBOL_REF;
2146 only use the offset and the symbol name. */
2148 p
= XSTR (value
.base
, 0);
2149 for (i
= 0; p
[i
] != 0; i
++)
2150 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2152 else if (GET_CODE (value
.base
) == LABEL_REF
)
2153 hi
= value
.offset
+ CODE_LABEL_NUMBER (XEXP (value
.base
, 0)) * 13;
2161 return (const_hash_1 (TREE_OPERAND (exp
, 0)) * 9
2162 + const_hash_1 (TREE_OPERAND (exp
, 1)));
2166 case NON_LVALUE_EXPR
:
2167 return const_hash_1 (TREE_OPERAND (exp
, 0)) * 7 + 2;
2170 /* A language specific constant. Just hash the code. */
2174 /* Compute hashing function. */
2176 for (i
= 0; i
< len
; i
++)
2177 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2182 /* Wrapper of compare_constant, for the htab interface. */
2184 const_desc_eq (const void *p1
, const void *p2
)
2186 return compare_constant (((struct constant_descriptor_tree
*)p1
)->value
,
2187 ((struct constant_descriptor_tree
*)p2
)->value
);
2190 /* Compare t1 and t2, and return 1 only if they are known to result in
2191 the same bit pattern on output. */
2194 compare_constant (const tree t1
, const tree t2
)
2196 enum tree_code typecode
;
2198 if (t1
== NULL_TREE
)
2199 return t2
== NULL_TREE
;
2200 if (t2
== NULL_TREE
)
2203 if (TREE_CODE (t1
) != TREE_CODE (t2
))
2206 switch (TREE_CODE (t1
))
2209 /* Integer constants are the same only if the same width of type. */
2210 if (TYPE_PRECISION (TREE_TYPE (t1
)) != TYPE_PRECISION (TREE_TYPE (t2
)))
2212 return tree_int_cst_equal (t1
, t2
);
2215 /* Real constants are the same only if the same width of type. */
2216 if (TYPE_PRECISION (TREE_TYPE (t1
)) != TYPE_PRECISION (TREE_TYPE (t2
)))
2219 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
2222 if (TYPE_MODE (TREE_TYPE (t1
)) != TYPE_MODE (TREE_TYPE (t2
)))
2225 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
2226 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
2227 TREE_STRING_LENGTH (t1
)));
2230 return (compare_constant (TREE_REALPART (t1
), TREE_REALPART (t2
))
2231 && compare_constant (TREE_IMAGPART (t1
), TREE_IMAGPART (t2
)));
2234 typecode
= TREE_CODE (TREE_TYPE (t1
));
2235 if (typecode
!= TREE_CODE (TREE_TYPE (t2
)))
2238 if (typecode
== SET_TYPE
)
2240 int len
= int_size_in_bytes (TREE_TYPE (t2
));
2241 unsigned char *tmp1
, *tmp2
;
2243 if (int_size_in_bytes (TREE_TYPE (t1
)) != len
)
2246 tmp1
= alloca (len
);
2247 tmp2
= alloca (len
);
2249 if (get_set_constructor_bytes (t1
, tmp1
, len
) != NULL_TREE
)
2251 if (get_set_constructor_bytes (t2
, tmp2
, len
) != NULL_TREE
)
2254 return memcmp (tmp1
, tmp2
, len
) == 0;
2260 if (typecode
== ARRAY_TYPE
)
2262 HOST_WIDE_INT size_1
= int_size_in_bytes (TREE_TYPE (t1
));
2263 /* For arrays, check that the sizes all match. */
2264 if (TYPE_MODE (TREE_TYPE (t1
)) != TYPE_MODE (TREE_TYPE (t2
))
2266 || size_1
!= int_size_in_bytes (TREE_TYPE (t2
)))
2271 /* For record and union constructors, require exact type
2273 if (TREE_TYPE (t1
) != TREE_TYPE (t2
))
2277 for (l1
= CONSTRUCTOR_ELTS (t1
), l2
= CONSTRUCTOR_ELTS (t2
);
2279 l1
= TREE_CHAIN (l1
), l2
= TREE_CHAIN (l2
))
2281 /* Check that each value is the same... */
2282 if (! compare_constant (TREE_VALUE (l1
), TREE_VALUE (l2
)))
2284 /* ... and that they apply to the same fields! */
2285 if (typecode
== ARRAY_TYPE
)
2287 if (! compare_constant (TREE_PURPOSE (l1
),
2293 if (TREE_PURPOSE (l1
) != TREE_PURPOSE (l2
))
2298 return l1
== NULL_TREE
&& l2
== NULL_TREE
;
2304 struct addr_const value1
, value2
;
2306 decode_addr_const (t1
, &value1
);
2307 decode_addr_const (t2
, &value2
);
2308 return (value1
.offset
== value2
.offset
2309 && strcmp (XSTR (value1
.base
, 0), XSTR (value2
.base
, 0)) == 0);
2315 return (compare_constant (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0))
2316 && compare_constant(TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1)));
2320 case NON_LVALUE_EXPR
:
2321 case VIEW_CONVERT_EXPR
:
2322 return compare_constant (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
2327 nt1
= lang_hooks
.expand_constant (t1
);
2328 nt2
= lang_hooks
.expand_constant (t2
);
2329 if (nt1
!= t1
|| nt2
!= t2
)
2330 return compare_constant (nt1
, nt2
);
2336 /* Should not get here. */
2340 /* Make a copy of the whole tree structure for a constant. This
2341 handles the same types of nodes that compare_constant handles. */
2344 copy_constant (tree exp
)
2346 switch (TREE_CODE (exp
))
2349 /* For ADDR_EXPR, we do not want to copy the decl whose address
2350 is requested. We do want to copy constants though. */
2351 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, 0))) == 'c')
2352 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2353 copy_constant (TREE_OPERAND (exp
, 0)));
2355 return copy_node (exp
);
2360 return copy_node (exp
);
2363 return build_complex (TREE_TYPE (exp
),
2364 copy_constant (TREE_REALPART (exp
)),
2365 copy_constant (TREE_IMAGPART (exp
)));
2369 return build2 (TREE_CODE (exp
), TREE_TYPE (exp
),
2370 copy_constant (TREE_OPERAND (exp
, 0)),
2371 copy_constant (TREE_OPERAND (exp
, 1)));
2375 case NON_LVALUE_EXPR
:
2376 case VIEW_CONVERT_EXPR
:
2377 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2378 copy_constant (TREE_OPERAND (exp
, 0)));
2382 tree copy
= copy_node (exp
);
2383 tree list
= copy_list (CONSTRUCTOR_ELTS (exp
));
2386 CONSTRUCTOR_ELTS (copy
) = list
;
2387 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
2388 TREE_VALUE (tail
) = copy_constant (TREE_VALUE (tail
));
2389 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2390 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
2391 TREE_PURPOSE (tail
) = copy_constant (TREE_PURPOSE (tail
));
2399 t
= lang_hooks
.expand_constant (exp
);
2401 return copy_constant (t
);
2408 /* Subroutine of output_constant_def:
2409 No constant equal to EXP is known to have been output.
2410 Make a constant descriptor to enter EXP in the hash table.
2411 Assign the label number and construct RTL to refer to the
2412 constant's location in memory.
2413 Caller is responsible for updating the hash table. */
2415 static struct constant_descriptor_tree
*
2416 build_constant_desc (tree exp
)
2422 struct constant_descriptor_tree
*desc
;
2424 desc
= ggc_alloc (sizeof (*desc
));
2425 desc
->value
= copy_constant (exp
);
2427 /* Propagate marked-ness to copied constant. */
2428 if (flag_mudflap
&& mf_marked_p (exp
))
2429 mf_mark (desc
->value
);
2431 /* Create a string containing the label name, in LABEL. */
2432 labelno
= const_labelno
++;
2433 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", labelno
);
2435 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
2436 symbol
= gen_rtx_SYMBOL_REF (Pmode
, ggc_strdup (label
));
2437 SYMBOL_REF_FLAGS (symbol
) = SYMBOL_FLAG_LOCAL
;
2438 SYMBOL_REF_DECL (symbol
) = desc
->value
;
2439 TREE_CONSTANT_POOL_ADDRESS_P (symbol
) = 1;
2441 rtl
= gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp
)), symbol
);
2442 set_mem_attributes (rtl
, exp
, 1);
2443 set_mem_alias_set (rtl
, 0);
2444 set_mem_alias_set (rtl
, const_alias_set
);
2446 /* Set flags or add text to the name to record information, such as
2447 that it is a local symbol. If the name is changed, the macro
2448 ASM_OUTPUT_LABELREF will have to know how to strip this
2449 information. This call might invalidate our local variable
2450 SYMBOL; we can't use it afterward. */
2452 targetm
.encode_section_info (exp
, rtl
, true);
2459 /* Return an rtx representing a reference to constant data in memory
2460 for the constant expression EXP.
2462 If assembler code for such a constant has already been output,
2463 return an rtx to refer to it.
2464 Otherwise, output such a constant in memory
2465 and generate an rtx for it.
2467 If DEFER is nonzero, this constant can be deferred and output only
2468 if referenced in the function after all optimizations.
2470 `const_desc_table' records which constants already have label strings. */
2473 output_constant_def (tree exp
, int defer
)
2475 struct constant_descriptor_tree
*desc
;
2476 struct constant_descriptor_tree key
;
2479 /* Look up EXP in the table of constant descriptors. If we didn't find
2480 it, create a new one. */
2482 loc
= htab_find_slot (const_desc_htab
, &key
, INSERT
);
2487 desc
= build_constant_desc (exp
);
2491 maybe_output_constant_def_contents (desc
, defer
);
2495 /* Subroutine of output_constant_def: Decide whether or not we need to
2496 output the constant DESC now, and if so, do it. */
2498 maybe_output_constant_def_contents (struct constant_descriptor_tree
*desc
,
2501 rtx symbol
= XEXP (desc
->rtl
, 0);
2502 tree exp
= desc
->value
;
2504 if (flag_syntax_only
)
2507 if (TREE_ASM_WRITTEN (exp
))
2508 /* Already output; don't do it again. */
2511 /* We can always defer constants as long as the context allows
2515 /* Increment n_deferred_constants if it exists. It needs to be at
2516 least as large as the number of constants actually referred to
2517 by the function. If it's too small we'll stop looking too early
2518 and fail to emit constants; if it's too large we'll only look
2519 through the entire function when we could have stopped earlier. */
2521 n_deferred_constants
++;
2525 output_constant_def_contents (symbol
);
2528 /* We must output the constant data referred to by SYMBOL; do so. */
2531 output_constant_def_contents (rtx symbol
)
2533 tree exp
= SYMBOL_REF_DECL (symbol
);
2534 const char *label
= XSTR (symbol
, 0);
2537 /* Make sure any other constants whose addresses appear in EXP
2538 are assigned label numbers. */
2539 int reloc
= compute_reloc_for_constant (exp
);
2541 /* Align the location counter as required by EXP's data type. */
2542 int align
= TYPE_ALIGN (TREE_TYPE (exp
));
2543 #ifdef CONSTANT_ALIGNMENT
2544 align
= CONSTANT_ALIGNMENT (exp
, align
);
2547 output_addressed_constants (exp
);
2549 /* We are no longer deferring this constant. */
2550 TREE_ASM_WRITTEN (exp
) = 1;
2552 if (IN_NAMED_SECTION (exp
))
2553 named_section (exp
, NULL
, reloc
);
2555 targetm
.asm_out
.select_section (exp
, reloc
, align
);
2557 if (align
> BITS_PER_UNIT
)
2559 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
2562 size
= int_size_in_bytes (TREE_TYPE (exp
));
2563 if (TREE_CODE (exp
) == STRING_CST
)
2564 size
= MAX (TREE_STRING_LENGTH (exp
), size
);
2566 /* Do any machine/system dependent processing of the constant. */
2567 #ifdef ASM_DECLARE_CONSTANT_NAME
2568 ASM_DECLARE_CONSTANT_NAME (asm_out_file
, label
, exp
, size
);
2570 /* Standard thing is just output label for the constant. */
2571 ASM_OUTPUT_LABEL (asm_out_file
, label
);
2572 #endif /* ASM_DECLARE_CONSTANT_NAME */
2574 /* Output the value of EXP. */
2575 output_constant (exp
, size
, align
);
2577 mudflap_enqueue_constant (exp
);
2580 /* Look up EXP in the table of constant descriptors. Return the rtl
2581 if it has been emitted, else null. */
2584 lookup_constant_def (tree exp
)
2586 struct constant_descriptor_tree
*desc
;
2587 struct constant_descriptor_tree key
;
2590 desc
= htab_find (const_desc_htab
, &key
);
2592 return (desc
? desc
->rtl
: NULL_RTX
);
2595 /* Used in the hash tables to avoid outputting the same constant
2596 twice. Unlike 'struct constant_descriptor_tree', RTX constants
2597 are output once per function, not once per file. */
2598 /* ??? Only a few targets need per-function constant pools. Most
2599 can use one per-file pool. Should add a targetm bit to tell the
2602 struct rtx_constant_pool
GTY(())
2604 /* Pointers to first and last constant in pool, as ordered by offset. */
2605 struct constant_descriptor_rtx
*first
;
2606 struct constant_descriptor_rtx
*last
;
2608 /* Hash facility for making memory-constants from constant rtl-expressions.
2609 It is used on RISC machines where immediate integer arguments and
2610 constant addresses are restricted so that such constants must be stored
2612 htab_t
GTY((param_is (struct constant_descriptor_rtx
))) const_rtx_htab
;
2613 htab_t
GTY((param_is (struct constant_descriptor_rtx
))) const_rtx_sym_htab
;
2615 /* Current offset in constant pool (does not include any
2616 machine-specific header). */
2617 HOST_WIDE_INT offset
;
2620 struct constant_descriptor_rtx
GTY((chain_next ("%h.next")))
2622 struct constant_descriptor_rtx
*next
;
2626 HOST_WIDE_INT offset
;
2628 enum machine_mode mode
;
2634 /* Hash and compare functions for const_rtx_htab. */
2637 const_desc_rtx_hash (const void *ptr
)
2639 const struct constant_descriptor_rtx
*desc
= ptr
;
2644 const_desc_rtx_eq (const void *a
, const void *b
)
2646 const struct constant_descriptor_rtx
*x
= a
;
2647 const struct constant_descriptor_rtx
*y
= b
;
2649 if (x
->mode
!= y
->mode
)
2651 return rtx_equal_p (x
->constant
, y
->constant
);
2654 /* Hash and compare functions for const_rtx_sym_htab. */
2657 const_desc_rtx_sym_hash (const void *ptr
)
2659 const struct constant_descriptor_rtx
*desc
= ptr
;
2660 return htab_hash_string (XSTR (desc
->sym
, 0));
2664 const_desc_rtx_sym_eq (const void *a
, const void *b
)
2666 const struct constant_descriptor_rtx
*x
= a
;
2667 const struct constant_descriptor_rtx
*y
= b
;
2668 return XSTR (x
->sym
, 0) == XSTR (y
->sym
, 0);
2671 /* This is the worker function for const_rtx_hash, called via for_each_rtx. */
2674 const_rtx_hash_1 (rtx
*xp
, void *data
)
2676 unsigned HOST_WIDE_INT hwi
;
2677 enum machine_mode mode
;
2683 code
= GET_CODE (x
);
2684 mode
= GET_MODE (x
);
2685 h
= (hashval_t
) code
* 1048573 + mode
;
2693 const int shift
= sizeof (hashval_t
) * CHAR_BIT
;
2694 const int n
= sizeof (HOST_WIDE_INT
) / sizeof (hashval_t
);
2697 h
^= (hashval_t
) hwi
;
2698 for (i
= 1; i
< n
; ++i
)
2701 h
^= (hashval_t
) hwi
;
2707 if (mode
== VOIDmode
)
2709 hwi
= CONST_DOUBLE_LOW (x
) ^ CONST_DOUBLE_HIGH (x
);
2713 h
^= real_hash (CONST_DOUBLE_REAL_VALUE (x
));
2717 h
^= htab_hash_string (XSTR (x
, 0));
2721 h
= h
* 251 + CODE_LABEL_NUMBER (XEXP (x
, 0));
2725 case UNSPEC_VOLATILE
:
2726 h
= h
* 251 + XINT (x
, 1);
2734 *hp
= *hp
* 509 + h
;
2738 /* Compute a hash value for X, which should be a constant. */
2741 const_rtx_hash (rtx x
)
2744 for_each_rtx (&x
, const_rtx_hash_1
, &h
);
2749 /* Initialize constant pool hashing for a new function. */
2752 init_varasm_status (struct function
*f
)
2754 struct varasm_status
*p
;
2755 struct rtx_constant_pool
*pool
;
2757 p
= ggc_alloc (sizeof (struct varasm_status
));
2760 pool
= ggc_alloc (sizeof (struct rtx_constant_pool
));
2762 p
->deferred_constants
= 0;
2764 pool
->const_rtx_htab
= htab_create_ggc (31, const_desc_rtx_hash
,
2765 const_desc_rtx_eq
, NULL
);
2766 pool
->const_rtx_sym_htab
= htab_create_ggc (31, const_desc_rtx_sym_hash
,
2767 const_desc_rtx_sym_eq
, NULL
);
2768 pool
->first
= pool
->last
= NULL
;
2772 /* Given a MINUS expression, simplify it if both sides
2773 include the same symbol. */
2776 simplify_subtraction (rtx x
)
2778 rtx r
= simplify_rtx (x
);
2782 /* Given a constant rtx X, make (or find) a memory constant for its value
2783 and return a MEM rtx to refer to it in memory. */
2786 force_const_mem (enum machine_mode mode
, rtx x
)
2788 struct constant_descriptor_rtx
*desc
, tmp
;
2789 struct rtx_constant_pool
*pool
= cfun
->varasm
->pool
;
2796 /* If we're not allowed to drop X into the constant pool, don't. */
2797 if (targetm
.cannot_force_const_mem (x
))
2800 /* Lookup the value in the hashtable. */
2803 hash
= const_rtx_hash (x
);
2804 slot
= htab_find_slot_with_hash (pool
->const_rtx_htab
, &tmp
, hash
, INSERT
);
2807 /* If the constant was already present, return its memory. */
2809 return copy_rtx (desc
->mem
);
2811 /* Otherwise, create a new descriptor. */
2812 desc
= ggc_alloc (sizeof (*desc
));
2815 /* Align the location counter as required by EXP's data type. */
2816 align
= GET_MODE_ALIGNMENT (mode
== VOIDmode
? word_mode
: mode
);
2817 #ifdef CONSTANT_ALIGNMENT
2819 tree type
= lang_hooks
.types
.type_for_mode (mode
, 0);
2820 if (type
!= NULL_TREE
)
2821 align
= CONSTANT_ALIGNMENT (make_tree (type
, x
), align
);
2825 pool
->offset
+= (align
/ BITS_PER_UNIT
) - 1;
2826 pool
->offset
&= ~ ((align
/ BITS_PER_UNIT
) - 1);
2829 desc
->constant
= tmp
.constant
;
2830 desc
->offset
= pool
->offset
;
2833 desc
->align
= align
;
2834 desc
->labelno
= const_labelno
;
2837 pool
->offset
+= GET_MODE_SIZE (mode
);
2839 pool
->last
->next
= desc
;
2841 pool
->first
= pool
->last
= desc
;
2844 /* Create a string containing the label name, in LABEL. */
2845 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
2848 /* Construct the SYMBOL_REF. Make sure to mark it as belonging to
2849 the constants pool. */
2850 desc
->sym
= symbol
= gen_rtx_SYMBOL_REF (Pmode
, ggc_strdup (label
));
2851 SYMBOL_REF_FLAGS (symbol
) = SYMBOL_FLAG_LOCAL
;
2852 CONSTANT_POOL_ADDRESS_P (symbol
) = 1;
2853 current_function_uses_const_pool
= 1;
2855 /* Insert the descriptor into the symbol cross-reference table too. */
2856 slot
= htab_find_slot (pool
->const_rtx_sym_htab
, desc
, INSERT
);
2861 /* Construct the MEM. */
2862 desc
->mem
= def
= gen_rtx_MEM (mode
, symbol
);
2863 set_mem_attributes (def
, lang_hooks
.types
.type_for_mode (mode
, 0), 1);
2864 RTX_UNCHANGING_P (def
) = 1;
2866 /* If we're dropping a label to the constant pool, make sure we
2868 if (GET_CODE (x
) == LABEL_REF
)
2869 LABEL_PRESERVE_P (XEXP (x
, 0)) = 1;
2871 return copy_rtx (def
);
2874 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
2875 the corresponding constant_descriptor_rtx structure. */
2877 static struct constant_descriptor_rtx
*
2878 find_pool_constant (struct rtx_constant_pool
*pool
, rtx sym
)
2880 struct constant_descriptor_rtx tmp
;
2882 return htab_find (pool
->const_rtx_sym_htab
, &tmp
);
2885 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
2888 get_pool_constant (rtx addr
)
2890 return find_pool_constant (cfun
->varasm
->pool
, addr
)->constant
;
2893 /* Given a constant pool SYMBOL_REF, return the corresponding constant
2894 and whether it has been output or not. */
2897 get_pool_constant_mark (rtx addr
, bool *pmarked
)
2899 struct constant_descriptor_rtx
*desc
;
2901 desc
= find_pool_constant (cfun
->varasm
->pool
, addr
);
2902 *pmarked
= (desc
->mark
!= 0);
2903 return desc
->constant
;
2906 /* Likewise, but for the constant pool of a specific function. */
2909 get_pool_constant_for_function (struct function
*f
, rtx addr
)
2911 return find_pool_constant (f
->varasm
->pool
, addr
)->constant
;
2914 /* Similar, return the mode. */
2917 get_pool_mode (rtx addr
)
2919 return find_pool_constant (cfun
->varasm
->pool
, addr
)->mode
;
2923 get_pool_mode_for_function (struct function
*f
, rtx addr
)
2925 return find_pool_constant (f
->varasm
->pool
, addr
)->mode
;
2928 /* Similar, return the offset in the constant pool. */
2931 get_pool_offset (rtx addr
)
2933 return find_pool_constant (cfun
->varasm
->pool
, addr
)->offset
;
2936 /* Return the size of the constant pool. */
2939 get_pool_size (void)
2941 return cfun
->varasm
->pool
->offset
;
2944 /* Worker function for output_constant_pool_1. Emit assembly for X
2945 in MODE with known alignment ALIGN. */
2948 output_constant_pool_2 (enum machine_mode mode
, rtx x
, unsigned int align
)
2950 switch (GET_MODE_CLASS (mode
))
2953 if (GET_CODE (x
) != CONST_DOUBLE
)
2958 REAL_VALUE_FROM_CONST_DOUBLE (r
, x
);
2959 assemble_real (r
, mode
, align
);
2964 case MODE_PARTIAL_INT
:
2965 assemble_integer (x
, GET_MODE_SIZE (mode
), align
, 1);
2968 case MODE_VECTOR_FLOAT
:
2969 case MODE_VECTOR_INT
:
2972 enum machine_mode submode
= GET_MODE_INNER (mode
);
2973 unsigned int subalign
= MIN (align
, GET_MODE_BITSIZE (submode
));
2975 if (GET_CODE (x
) != CONST_VECTOR
)
2977 units
= CONST_VECTOR_NUNITS (x
);
2979 for (i
= 0; i
< units
; i
++)
2981 rtx elt
= CONST_VECTOR_ELT (x
, i
);
2982 output_constant_pool_2 (submode
, elt
, i
? subalign
: align
);
2992 /* Worker function for output_constant_pool. Emit POOL. */
2995 output_constant_pool_1 (struct constant_descriptor_rtx
*desc
)
3003 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3004 whose CODE_LABEL has been deleted. This can occur if a jump table
3005 is eliminated by optimization. If so, write a constant of zero
3006 instead. Note that this can also happen by turning the
3007 CODE_LABEL into a NOTE. */
3008 /* ??? This seems completely and utterly wrong. Certainly it's
3009 not true for NOTE_INSN_DELETED_LABEL, but I disbelieve proper
3010 functioning even with INSN_DELETED_P and friends. */
3013 switch (GET_CODE (x
))
3016 if (GET_CODE (XEXP (x
, 0)) != PLUS
3017 || GET_CODE (XEXP (XEXP (x
, 0), 0)) != LABEL_REF
)
3019 tmp
= XEXP (XEXP (x
, 0), 0);
3024 if (INSN_DELETED_P (tmp
)
3026 && NOTE_LINE_NUMBER (tmp
) == NOTE_INSN_DELETED
))
3037 /* First switch to correct section. */
3038 targetm
.asm_out
.select_rtx_section (desc
->mode
, x
, desc
->align
);
3040 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3041 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file
, x
, desc
->mode
,
3042 desc
->align
, desc
->labelno
, done
);
3045 assemble_align (desc
->align
);
3047 /* Output the label. */
3048 targetm
.asm_out
.internal_label (asm_out_file
, "LC", desc
->labelno
);
3050 /* Output the data. */
3051 output_constant_pool_2 (desc
->mode
, x
, desc
->align
);
3053 /* Make sure all constants in SECTION_MERGE and not SECTION_STRINGS
3054 sections have proper size. */
3055 if (desc
->align
> GET_MODE_BITSIZE (desc
->mode
)
3056 && in_section
== in_named
3057 && get_named_section_flags (in_named_name
) & SECTION_MERGE
)
3058 assemble_align (desc
->align
);
3060 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3066 /* Given a SYMBOL_REF CURRENT_RTX, mark it and all constants it refers
3067 to as used. Emit referenced deferred strings. This function can
3068 be used with for_each_rtx to mark all SYMBOL_REFs in an rtx. */
3071 mark_constant (rtx
*current_rtx
, void *data
)
3073 struct rtx_constant_pool
*pool
= data
;
3074 rtx x
= *current_rtx
;
3076 if (x
== NULL_RTX
|| GET_CODE (x
) != SYMBOL_REF
)
3079 if (CONSTANT_POOL_ADDRESS_P (x
))
3081 struct constant_descriptor_rtx
*desc
= find_pool_constant (pool
, x
);
3082 if (desc
->mark
== 0)
3085 for_each_rtx (&desc
->constant
, mark_constant
, pool
);
3088 else if (TREE_CONSTANT_POOL_ADDRESS_P (x
))
3090 tree exp
= SYMBOL_REF_DECL (x
);
3091 if (!TREE_ASM_WRITTEN (exp
))
3093 n_deferred_constants
--;
3094 output_constant_def_contents (x
);
3101 /* Look through appropriate parts of INSN, marking all entries in the
3102 constant pool which are actually being used. Entries that are only
3103 referenced by other constants are also marked as used. Emit
3104 deferred strings that are used. */
3107 mark_constants (struct rtx_constant_pool
*pool
, rtx insn
)
3112 /* Insns may appear inside a SEQUENCE. Only check the patterns of
3113 insns, not any notes that may be attached. We don't want to mark
3114 a constant just because it happens to appear in a REG_EQUIV note. */
3115 if (GET_CODE (PATTERN (insn
)) == SEQUENCE
)
3117 rtx seq
= PATTERN (insn
);
3118 int i
, n
= XVECLEN (seq
, 0);
3119 for (i
= 0; i
< n
; ++i
)
3121 rtx subinsn
= XVECEXP (seq
, 0, i
);
3122 if (INSN_P (subinsn
))
3123 for_each_rtx (&PATTERN (subinsn
), mark_constant
, pool
);
3127 for_each_rtx (&PATTERN (insn
), mark_constant
, pool
);
3130 /* Look through the instructions for this function, and mark all the
3131 entries in POOL which are actually being used. Emit deferred constants
3132 which have indeed been used. */
3135 mark_constant_pool (struct rtx_constant_pool
*pool
)
3139 if (pool
->first
== 0 && n_deferred_constants
== 0)
3142 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
3143 mark_constants (pool
, insn
);
3145 for (link
= current_function_epilogue_delay_list
;
3147 link
= XEXP (link
, 1))
3148 mark_constants (pool
, XEXP (link
, 0));
3151 /* Write all the constants in the constant pool. */
3154 output_constant_pool (const char *fnname ATTRIBUTE_UNUSED
,
3155 tree fndecl ATTRIBUTE_UNUSED
)
3157 struct rtx_constant_pool
*pool
= cfun
->varasm
->pool
;
3158 struct constant_descriptor_rtx
*desc
;
3160 /* It is possible for gcc to call force_const_mem and then to later
3161 discard the instructions which refer to the constant. In such a
3162 case we do not need to output the constant. */
3163 mark_constant_pool (pool
);
3165 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3166 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file
, fnname
, fndecl
, pool
->offset
);
3169 for (desc
= pool
->first
; desc
; desc
= desc
->next
)
3170 output_constant_pool_1 (desc
);
3172 #ifdef ASM_OUTPUT_POOL_EPILOGUE
3173 ASM_OUTPUT_POOL_EPILOGUE (asm_out_file
, fnname
, fndecl
, pool
->offset
);
3177 /* Determine what kind of relocations EXP may need. */
3180 compute_reloc_for_constant (tree exp
)
3182 int reloc
= 0, reloc2
;
3185 /* Give the front-end a chance to convert VALUE to something that
3186 looks more like a constant to the back-end. */
3187 exp
= lang_hooks
.expand_constant (exp
);
3189 switch (TREE_CODE (exp
))
3193 /* Go inside any operations that get_inner_reference can handle and see
3194 if what's inside is a constant: no need to do anything here for
3195 addresses of variables or functions. */
3196 for (tem
= TREE_OPERAND (exp
, 0); handled_component_p (tem
);
3197 tem
= TREE_OPERAND (tem
, 0))
3200 if (TREE_PUBLIC (tem
))
3207 reloc
= compute_reloc_for_constant (TREE_OPERAND (exp
, 0));
3208 reloc
|= compute_reloc_for_constant (TREE_OPERAND (exp
, 1));
3212 reloc
= compute_reloc_for_constant (TREE_OPERAND (exp
, 0));
3213 reloc2
= compute_reloc_for_constant (TREE_OPERAND (exp
, 1));
3214 /* The difference of two local labels is computable at link time. */
3215 if (reloc
== 1 && reloc2
== 1)
3223 case NON_LVALUE_EXPR
:
3224 reloc
= compute_reloc_for_constant (TREE_OPERAND (exp
, 0));
3228 for (tem
= CONSTRUCTOR_ELTS (exp
); tem
; tem
= TREE_CHAIN (tem
))
3229 if (TREE_VALUE (tem
) != 0)
3230 reloc
|= compute_reloc_for_constant (TREE_VALUE (tem
));
3240 /* Find all the constants whose addresses are referenced inside of EXP,
3241 and make sure assembler code with a label has been output for each one.
3242 Indicate whether an ADDR_EXPR has been encountered. */
3245 output_addressed_constants (tree exp
)
3249 /* Give the front-end a chance to convert VALUE to something that
3250 looks more like a constant to the back-end. */
3251 exp
= lang_hooks
.expand_constant (exp
);
3253 switch (TREE_CODE (exp
))
3257 /* Go inside any operations that get_inner_reference can handle and see
3258 if what's inside is a constant: no need to do anything here for
3259 addresses of variables or functions. */
3260 for (tem
= TREE_OPERAND (exp
, 0); handled_component_p (tem
);
3261 tem
= TREE_OPERAND (tem
, 0))
3264 if (TREE_CODE_CLASS (TREE_CODE (tem
)) == 'c'
3265 || TREE_CODE (tem
) == CONSTRUCTOR
)
3266 output_constant_def (tem
, 0);
3271 output_addressed_constants (TREE_OPERAND (exp
, 1));
3276 case NON_LVALUE_EXPR
:
3277 output_addressed_constants (TREE_OPERAND (exp
, 0));
3281 for (tem
= CONSTRUCTOR_ELTS (exp
); tem
; tem
= TREE_CHAIN (tem
))
3282 if (TREE_VALUE (tem
) != 0)
3283 output_addressed_constants (TREE_VALUE (tem
));
3292 /* Return nonzero if VALUE is a valid constant-valued expression
3293 for use in initializing a static variable; one that can be an
3294 element of a "constant" initializer.
3296 Return null_pointer_node if the value is absolute;
3297 if it is relocatable, return the variable that determines the relocation.
3298 We assume that VALUE has been folded as much as possible;
3299 therefore, we do not need to check for such things as
3300 arithmetic-combinations of integers. */
3303 initializer_constant_valid_p (tree value
, tree endtype
)
3305 /* Give the front-end a chance to convert VALUE to something that
3306 looks more like a constant to the back-end. */
3307 value
= lang_hooks
.expand_constant (value
);
3309 switch (TREE_CODE (value
))
3312 if ((TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
3313 || TREE_CODE (TREE_TYPE (value
)) == RECORD_TYPE
)
3314 && TREE_CONSTANT (value
)
3315 && CONSTRUCTOR_ELTS (value
))
3318 bool absolute
= true;
3320 for (elt
= CONSTRUCTOR_ELTS (value
); elt
; elt
= TREE_CHAIN (elt
))
3323 value
= TREE_VALUE (elt
);
3324 reloc
= initializer_constant_valid_p (value
, TREE_TYPE (value
));
3327 if (reloc
!= null_pointer_node
)
3330 /* For a non-absolute relocation, there is no single
3331 variable that can be "the variable that determines the
3333 return absolute
? null_pointer_node
: error_mark_node
;
3336 return TREE_STATIC (value
) ? null_pointer_node
: NULL_TREE
;
3343 return null_pointer_node
;
3347 return staticp (TREE_OPERAND (value
, 0)) ? TREE_OPERAND (value
, 0) : 0;
3349 case VIEW_CONVERT_EXPR
:
3350 case NON_LVALUE_EXPR
:
3351 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3355 /* Allow conversions between pointer types. */
3356 if (POINTER_TYPE_P (TREE_TYPE (value
))
3357 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3358 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3360 /* Allow conversions between real types. */
3361 if (FLOAT_TYPE_P (TREE_TYPE (value
))
3362 && FLOAT_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3363 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3365 /* Allow length-preserving conversions between integer types. */
3366 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
3367 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
3368 && (TYPE_PRECISION (TREE_TYPE (value
))
3369 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
3370 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3372 /* Allow conversions between other integer types only if
3374 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
3375 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3377 tree inner
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3379 if (inner
== null_pointer_node
)
3380 return null_pointer_node
;
3384 /* Allow (int) &foo provided int is as wide as a pointer. */
3385 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
3386 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
3387 && (TYPE_PRECISION (TREE_TYPE (value
))
3388 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
3389 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3392 /* Likewise conversions from int to pointers, but also allow
3393 conversions from 0. */
3394 if ((POINTER_TYPE_P (TREE_TYPE (value
))
3395 || TREE_CODE (TREE_TYPE (value
)) == OFFSET_TYPE
)
3396 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3398 if (integer_zerop (TREE_OPERAND (value
, 0)))
3399 return null_pointer_node
;
3400 else if (TYPE_PRECISION (TREE_TYPE (value
))
3401 <= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0))))
3402 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3406 /* Allow conversions to struct or union types if the value
3408 if (TREE_CODE (TREE_TYPE (value
)) == RECORD_TYPE
3409 || TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
)
3410 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3415 if (! INTEGRAL_TYPE_P (endtype
)
3416 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
3418 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3420 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
3422 /* If either term is absolute, use the other terms relocation. */
3423 if (valid0
== null_pointer_node
)
3425 if (valid1
== null_pointer_node
)
3431 if (! INTEGRAL_TYPE_P (endtype
)
3432 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
3434 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3436 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
3438 /* Win if second argument is absolute. */
3439 if (valid1
== null_pointer_node
)
3441 /* Win if both arguments have the same relocation.
3442 Then the value is absolute. */
3443 if (valid0
== valid1
&& valid0
!= 0)
3444 return null_pointer_node
;
3446 /* Since GCC guarantees that string constants are unique in the
3447 generated code, a subtraction between two copies of the same
3448 constant string is absolute. */
3449 if (valid0
&& TREE_CODE (valid0
) == STRING_CST
&&
3450 valid1
&& TREE_CODE (valid1
) == STRING_CST
&&
3451 TREE_STRING_POINTER (valid0
) == TREE_STRING_POINTER (valid1
))
3452 return null_pointer_node
;
3455 /* Support differences between labels. */
3456 if (INTEGRAL_TYPE_P (endtype
))
3459 op0
= TREE_OPERAND (value
, 0);
3460 op1
= TREE_OPERAND (value
, 1);
3462 /* Like STRIP_NOPS except allow the operand mode to widen.
3463 This works around a feature of fold that simplifies
3464 (int)(p1 - p2) to ((int)p1 - (int)p2) under the theory
3465 that the narrower operation is cheaper. */
3467 while (TREE_CODE (op0
) == NOP_EXPR
3468 || TREE_CODE (op0
) == CONVERT_EXPR
3469 || TREE_CODE (op0
) == NON_LVALUE_EXPR
)
3471 tree inner
= TREE_OPERAND (op0
, 0);
3472 if (inner
== error_mark_node
3473 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner
)))
3474 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op0
)))
3475 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner
)))))
3480 while (TREE_CODE (op1
) == NOP_EXPR
3481 || TREE_CODE (op1
) == CONVERT_EXPR
3482 || TREE_CODE (op1
) == NON_LVALUE_EXPR
)
3484 tree inner
= TREE_OPERAND (op1
, 0);
3485 if (inner
== error_mark_node
3486 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner
)))
3487 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op1
)))
3488 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner
)))))
3493 if (TREE_CODE (op0
) == ADDR_EXPR
3494 && TREE_CODE (TREE_OPERAND (op0
, 0)) == LABEL_DECL
3495 && TREE_CODE (op1
) == ADDR_EXPR
3496 && TREE_CODE (TREE_OPERAND (op1
, 0)) == LABEL_DECL
)
3497 return null_pointer_node
;
3508 /* Output assembler code for constant EXP to FILE, with no label.
3509 This includes the pseudo-op such as ".int" or ".byte", and a newline.
3510 Assumes output_addressed_constants has been done on EXP already.
3512 Generate exactly SIZE bytes of assembler data, padding at the end
3513 with zeros if necessary. SIZE must always be specified.
3515 SIZE is important for structure constructors,
3516 since trailing members may have been omitted from the constructor.
3517 It is also important for initialization of arrays from string constants
3518 since the full length of the string constant might not be wanted.
3519 It is also needed for initialization of unions, where the initializer's
3520 type is just one member, and that may not be as long as the union.
3522 There a case in which we would fail to output exactly SIZE bytes:
3523 for a structure constructor that wants to produce more than SIZE bytes.
3524 But such constructors will never be generated for any possible input.
3526 ALIGN is the alignment of the data in bits. */
3529 output_constant (tree exp
, unsigned HOST_WIDE_INT size
, unsigned int align
)
3531 enum tree_code code
;
3532 unsigned HOST_WIDE_INT thissize
;
3534 /* Some front-ends use constants other than the standard language-independent
3535 varieties, but which may still be output directly. Give the front-end a
3536 chance to convert EXP to a language-independent representation. */
3537 exp
= lang_hooks
.expand_constant (exp
);
3539 if (size
== 0 || flag_syntax_only
)
3542 /* Eliminate any conversions since we'll be outputting the underlying
3544 while (TREE_CODE (exp
) == NOP_EXPR
|| TREE_CODE (exp
) == CONVERT_EXPR
3545 || TREE_CODE (exp
) == NON_LVALUE_EXPR
3546 || TREE_CODE (exp
) == VIEW_CONVERT_EXPR
)
3547 exp
= TREE_OPERAND (exp
, 0);
3549 code
= TREE_CODE (TREE_TYPE (exp
));
3550 thissize
= int_size_in_bytes (TREE_TYPE (exp
));
3552 /* Allow a constructor with no elements for any data type.
3553 This means to fill the space with zeros. */
3554 if (TREE_CODE (exp
) == CONSTRUCTOR
&& CONSTRUCTOR_ELTS (exp
) == 0)
3556 assemble_zeros (size
);
3560 if (TREE_CODE (exp
) == FDESC_EXPR
)
3562 #ifdef ASM_OUTPUT_FDESC
3563 HOST_WIDE_INT part
= tree_low_cst (TREE_OPERAND (exp
, 1), 0);
3564 tree decl
= TREE_OPERAND (exp
, 0);
3565 ASM_OUTPUT_FDESC (asm_out_file
, decl
, part
);
3572 /* Now output the underlying data. If we've handling the padding, return.
3573 Otherwise, break and ensure SIZE is the size written. */
3581 case REFERENCE_TYPE
:
3583 if (! assemble_integer (expand_expr (exp
, NULL_RTX
, VOIDmode
,
3584 EXPAND_INITIALIZER
),
3585 MIN (size
, thissize
), align
, 0))
3586 error ("initializer for integer value is too complicated");
3590 if (TREE_CODE (exp
) != REAL_CST
)
3591 error ("initializer for floating value is not a floating constant");
3593 assemble_real (TREE_REAL_CST (exp
), TYPE_MODE (TREE_TYPE (exp
)), align
);
3597 output_constant (TREE_REALPART (exp
), thissize
/ 2, align
);
3598 output_constant (TREE_IMAGPART (exp
), thissize
/ 2,
3599 min_align (align
, BITS_PER_UNIT
* (thissize
/ 2)));
3604 if (TREE_CODE (exp
) == CONSTRUCTOR
)
3606 output_constructor (exp
, size
, align
);
3609 else if (TREE_CODE (exp
) == STRING_CST
)
3611 thissize
= MIN ((unsigned HOST_WIDE_INT
)TREE_STRING_LENGTH (exp
),
3613 assemble_string (TREE_STRING_POINTER (exp
), thissize
);
3615 else if (TREE_CODE (exp
) == VECTOR_CST
)
3619 unsigned int nalign
;
3620 enum machine_mode inner
;
3622 inner
= TYPE_MODE (TREE_TYPE (TREE_TYPE (exp
)));
3623 nalign
= MIN (align
, GET_MODE_ALIGNMENT (inner
));
3625 elt_size
= GET_MODE_SIZE (inner
);
3627 link
= TREE_VECTOR_CST_ELTS (exp
);
3628 output_constant (TREE_VALUE (link
), elt_size
, align
);
3629 while ((link
= TREE_CHAIN (link
)) != NULL
)
3630 output_constant (TREE_VALUE (link
), elt_size
, nalign
);
3638 if (TREE_CODE (exp
) == CONSTRUCTOR
)
3639 output_constructor (exp
, size
, align
);
3645 if (TREE_CODE (exp
) == INTEGER_CST
)
3646 assemble_integer (expand_expr (exp
, NULL_RTX
,
3647 VOIDmode
, EXPAND_INITIALIZER
),
3648 thissize
, align
, 1);
3649 else if (TREE_CODE (exp
) == CONSTRUCTOR
)
3651 unsigned char *buffer
= alloca (thissize
);
3652 if (get_set_constructor_bytes (exp
, buffer
, thissize
))
3654 assemble_string ((char *) buffer
, thissize
);
3657 error ("unknown set constructor type");
3667 if (size
> thissize
)
3668 assemble_zeros (size
- thissize
);
3672 /* Subroutine of output_constructor, used for computing the size of
3673 arrays of unspecified length. VAL must be a CONSTRUCTOR of an array
3674 type with an unspecified upper bound. */
3676 static unsigned HOST_WIDE_INT
3677 array_size_for_constructor (tree val
)
3681 /* This code used to attempt to handle string constants that are not
3682 arrays of single-bytes, but nothing else does, so there's no point in
3684 if (TREE_CODE (val
) == STRING_CST
)
3685 return TREE_STRING_LENGTH (val
);
3687 max_index
= NULL_TREE
;
3688 for (i
= CONSTRUCTOR_ELTS (val
); i
; i
= TREE_CHAIN (i
))
3690 tree index
= TREE_PURPOSE (i
);
3692 if (TREE_CODE (index
) == RANGE_EXPR
)
3693 index
= TREE_OPERAND (index
, 1);
3694 if (max_index
== NULL_TREE
|| tree_int_cst_lt (max_index
, index
))
3698 if (max_index
== NULL_TREE
)
3701 /* Compute the total number of array elements. */
3702 i
= size_binop (MINUS_EXPR
, convert (sizetype
, max_index
),
3704 TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (val
)))));
3705 i
= size_binop (PLUS_EXPR
, i
, convert (sizetype
, integer_one_node
));
3707 /* Multiply by the array element unit size to find number of bytes. */
3708 i
= size_binop (MULT_EXPR
, i
, TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (val
))));
3710 return tree_low_cst (i
, 1);
3713 /* Subroutine of output_constant, used for CONSTRUCTORs (aggregate constants).
3714 Generate at least SIZE bytes, padding if necessary. */
3717 output_constructor (tree exp
, unsigned HOST_WIDE_INT size
,
3720 tree type
= TREE_TYPE (exp
);
3721 tree link
, field
= 0;
3723 /* Number of bytes output or skipped so far.
3724 In other words, current position within the constructor. */
3725 HOST_WIDE_INT total_bytes
= 0;
3726 /* Nonzero means BYTE contains part of a byte, to be output. */
3727 int byte_buffer_in_use
= 0;
3730 if (HOST_BITS_PER_WIDE_INT
< BITS_PER_UNIT
)
3733 if (TREE_CODE (type
) == RECORD_TYPE
)
3734 field
= TYPE_FIELDS (type
);
3736 if (TREE_CODE (type
) == ARRAY_TYPE
3737 && TYPE_DOMAIN (type
) != 0)
3738 min_index
= TYPE_MIN_VALUE (TYPE_DOMAIN (type
));
3740 /* As LINK goes through the elements of the constant,
3741 FIELD goes through the structure fields, if the constant is a structure.
3742 if the constant is a union, then we override this,
3743 by getting the field from the TREE_LIST element.
3744 But the constant could also be an array. Then FIELD is zero.
3746 There is always a maximum of one element in the chain LINK for unions
3747 (even if the initializer in a source program incorrectly contains
3749 for (link
= CONSTRUCTOR_ELTS (exp
);
3751 link
= TREE_CHAIN (link
),
3752 field
= field
? TREE_CHAIN (field
) : 0)
3754 tree val
= TREE_VALUE (link
);
3757 /* The element in a union constructor specifies the proper field
3759 if ((TREE_CODE (type
) == RECORD_TYPE
|| TREE_CODE (type
) == UNION_TYPE
3760 || TREE_CODE (type
) == QUAL_UNION_TYPE
)
3761 && TREE_PURPOSE (link
) != 0)
3762 field
= TREE_PURPOSE (link
);
3764 else if (TREE_CODE (type
) == ARRAY_TYPE
)
3765 index
= TREE_PURPOSE (link
);
3767 #ifdef ASM_COMMENT_START
3768 if (field
&& flag_verbose_asm
)
3769 fprintf (asm_out_file
, "%s %s:\n",
3772 ? IDENTIFIER_POINTER (DECL_NAME (field
))
3776 /* Eliminate the marker that makes a cast not be an lvalue. */
3780 if (index
&& TREE_CODE (index
) == RANGE_EXPR
)
3782 unsigned HOST_WIDE_INT fieldsize
3783 = int_size_in_bytes (TREE_TYPE (type
));
3784 HOST_WIDE_INT lo_index
= tree_low_cst (TREE_OPERAND (index
, 0), 0);
3785 HOST_WIDE_INT hi_index
= tree_low_cst (TREE_OPERAND (index
, 1), 0);
3786 HOST_WIDE_INT index
;
3787 unsigned int align2
= min_align (align
, fieldsize
* BITS_PER_UNIT
);
3789 for (index
= lo_index
; index
<= hi_index
; index
++)
3791 /* Output the element's initial value. */
3793 assemble_zeros (fieldsize
);
3795 output_constant (val
, fieldsize
, align2
);
3797 /* Count its size. */
3798 total_bytes
+= fieldsize
;
3801 else if (field
== 0 || !DECL_BIT_FIELD (field
))
3803 /* An element that is not a bit-field. */
3805 unsigned HOST_WIDE_INT fieldsize
;
3806 /* Since this structure is static,
3807 we know the positions are constant. */
3808 HOST_WIDE_INT pos
= field
? int_byte_position (field
) : 0;
3809 unsigned int align2
;
3812 pos
= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (val
)), 1)
3813 * (tree_low_cst (index
, 0) - tree_low_cst (min_index
, 0)));
3815 /* Output any buffered-up bit-fields preceding this element. */
3816 if (byte_buffer_in_use
)
3818 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
3820 byte_buffer_in_use
= 0;
3823 /* Advance to offset of this element.
3824 Note no alignment needed in an array, since that is guaranteed
3825 if each element has the proper size. */
3826 if ((field
!= 0 || index
!= 0) && pos
!= total_bytes
)
3828 assemble_zeros (pos
- total_bytes
);
3832 /* Find the alignment of this element. */
3833 align2
= min_align (align
, BITS_PER_UNIT
* pos
);
3835 /* Determine size this element should occupy. */
3840 /* If this is an array with an unspecified upper bound,
3841 the initializer determines the size. */
3842 /* ??? This ought to only checked if DECL_SIZE_UNIT is NULL,
3843 but we cannot do this until the deprecated support for
3844 initializing zero-length array members is removed. */
3845 if (TREE_CODE (TREE_TYPE (field
)) == ARRAY_TYPE
3846 && TYPE_DOMAIN (TREE_TYPE (field
))
3847 && ! TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (field
))))
3849 fieldsize
= array_size_for_constructor (val
);
3850 /* Given a non-empty initialization, this field had
3852 if (fieldsize
!= 0 && TREE_CHAIN (field
) != NULL_TREE
)
3855 else if (DECL_SIZE_UNIT (field
))
3857 /* ??? This can't be right. If the decl size overflows
3858 a host integer we will silently emit no data. */
3859 if (host_integerp (DECL_SIZE_UNIT (field
), 1))
3860 fieldsize
= tree_low_cst (DECL_SIZE_UNIT (field
), 1);
3864 fieldsize
= int_size_in_bytes (TREE_TYPE (type
));
3866 /* Output the element's initial value. */
3868 assemble_zeros (fieldsize
);
3870 output_constant (val
, fieldsize
, align2
);
3872 /* Count its size. */
3873 total_bytes
+= fieldsize
;
3875 else if (val
!= 0 && TREE_CODE (val
) != INTEGER_CST
)
3876 error ("invalid initial value for member `%s'",
3877 IDENTIFIER_POINTER (DECL_NAME (field
)));
3880 /* Element that is a bit-field. */
3882 HOST_WIDE_INT next_offset
= int_bit_position (field
);
3883 HOST_WIDE_INT end_offset
3884 = (next_offset
+ tree_low_cst (DECL_SIZE (field
), 1));
3887 val
= integer_zero_node
;
3889 /* If this field does not start in this (or, next) byte,
3891 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
3893 /* Output remnant of any bit field in previous bytes. */
3894 if (byte_buffer_in_use
)
3896 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
3898 byte_buffer_in_use
= 0;
3901 /* If still not at proper byte, advance to there. */
3902 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
3904 assemble_zeros (next_offset
/ BITS_PER_UNIT
- total_bytes
);
3905 total_bytes
= next_offset
/ BITS_PER_UNIT
;
3909 if (! byte_buffer_in_use
)
3912 /* We must split the element into pieces that fall within
3913 separate bytes, and combine each byte with previous or
3914 following bit-fields. */
3916 /* next_offset is the offset n fbits from the beginning of
3917 the structure to the next bit of this element to be processed.
3918 end_offset is the offset of the first bit past the end of
3920 while (next_offset
< end_offset
)
3924 HOST_WIDE_INT value
;
3925 HOST_WIDE_INT next_byte
= next_offset
/ BITS_PER_UNIT
;
3926 HOST_WIDE_INT next_bit
= next_offset
% BITS_PER_UNIT
;
3928 /* Advance from byte to byte
3929 within this element when necessary. */
3930 while (next_byte
!= total_bytes
)
3932 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
3937 /* Number of bits we can process at once
3938 (all part of the same byte). */
3939 this_time
= MIN (end_offset
- next_offset
,
3940 BITS_PER_UNIT
- next_bit
);
3941 if (BYTES_BIG_ENDIAN
)
3943 /* On big-endian machine, take the most significant bits
3944 first (of the bits that are significant)
3945 and put them into bytes from the most significant end. */
3946 shift
= end_offset
- next_offset
- this_time
;
3948 /* Don't try to take a bunch of bits that cross
3949 the word boundary in the INTEGER_CST. We can
3950 only select bits from the LOW or HIGH part
3952 if (shift
< HOST_BITS_PER_WIDE_INT
3953 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
3955 this_time
= shift
+ this_time
- HOST_BITS_PER_WIDE_INT
;
3956 shift
= HOST_BITS_PER_WIDE_INT
;
3959 /* Now get the bits from the appropriate constant word. */
3960 if (shift
< HOST_BITS_PER_WIDE_INT
)
3961 value
= TREE_INT_CST_LOW (val
);
3962 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
3964 value
= TREE_INT_CST_HIGH (val
);
3965 shift
-= HOST_BITS_PER_WIDE_INT
;
3970 /* Get the result. This works only when:
3971 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
3972 byte
|= (((value
>> shift
)
3973 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
3974 << (BITS_PER_UNIT
- this_time
- next_bit
));
3978 /* On little-endian machines,
3979 take first the least significant bits of the value
3980 and pack them starting at the least significant
3981 bits of the bytes. */
3982 shift
= next_offset
- int_bit_position (field
);
3984 /* Don't try to take a bunch of bits that cross
3985 the word boundary in the INTEGER_CST. We can
3986 only select bits from the LOW or HIGH part
3988 if (shift
< HOST_BITS_PER_WIDE_INT
3989 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
3990 this_time
= (HOST_BITS_PER_WIDE_INT
- shift
);
3992 /* Now get the bits from the appropriate constant word. */
3993 if (shift
< HOST_BITS_PER_WIDE_INT
)
3994 value
= TREE_INT_CST_LOW (val
);
3995 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
3997 value
= TREE_INT_CST_HIGH (val
);
3998 shift
-= HOST_BITS_PER_WIDE_INT
;
4003 /* Get the result. This works only when:
4004 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4005 byte
|= (((value
>> shift
)
4006 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4010 next_offset
+= this_time
;
4011 byte_buffer_in_use
= 1;
4016 if (byte_buffer_in_use
)
4018 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4022 if ((unsigned HOST_WIDE_INT
)total_bytes
< size
)
4023 assemble_zeros (size
- total_bytes
);
4026 /* This TREE_LIST contains any weak symbol declarations waiting
4028 static GTY(()) tree weak_decls
;
4030 /* Mark DECL as weak. */
4033 mark_weak (tree decl
)
4035 DECL_WEAK (decl
) = 1;
4037 if (DECL_RTL_SET_P (decl
)
4038 && MEM_P (DECL_RTL (decl
))
4039 && XEXP (DECL_RTL (decl
), 0)
4040 && GET_CODE (XEXP (DECL_RTL (decl
), 0)) == SYMBOL_REF
)
4041 SYMBOL_REF_WEAK (XEXP (DECL_RTL (decl
), 0)) = 1;
4044 /* Merge weak status between NEWDECL and OLDDECL. */
4047 merge_weak (tree newdecl
, tree olddecl
)
4049 if (DECL_WEAK (newdecl
) == DECL_WEAK (olddecl
))
4052 if (DECL_WEAK (newdecl
))
4056 /* NEWDECL is weak, but OLDDECL is not. */
4058 /* If we already output the OLDDECL, we're in trouble; we can't
4059 go back and make it weak. This error cannot caught in
4060 declare_weak because the NEWDECL and OLDDECL was not yet
4061 been merged; therefore, TREE_ASM_WRITTEN was not set. */
4062 if (TREE_ASM_WRITTEN (olddecl
))
4063 error ("%Jweak declaration of '%D' must precede definition",
4066 /* If we've already generated rtl referencing OLDDECL, we may
4067 have done so in a way that will not function properly with
4069 else if (TREE_USED (olddecl
)
4070 && TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (olddecl
)))
4071 warning ("%Jweak declaration of '%D' after first use results "
4072 "in unspecified behavior", newdecl
, newdecl
);
4076 /* We put the NEWDECL on the weak_decls list at some point.
4077 Replace it with the OLDDECL. */
4078 for (wd
= weak_decls
; wd
; wd
= TREE_CHAIN (wd
))
4079 if (TREE_VALUE (wd
) == newdecl
)
4081 TREE_VALUE (wd
) = olddecl
;
4084 /* We may not find the entry on the list. If NEWDECL is a
4085 weak alias, then we will have already called
4086 globalize_decl to remove the entry; in that case, we do
4087 not need to do anything. */
4090 /* Make the OLDDECL weak; it's OLDDECL that we'll be keeping. */
4091 mark_weak (olddecl
);
4094 /* OLDDECL was weak, but NEWDECL was not explicitly marked as
4095 weak. Just update NEWDECL to indicate that it's weak too. */
4096 mark_weak (newdecl
);
4099 /* Declare DECL to be a weak symbol. */
4102 declare_weak (tree decl
)
4104 if (! TREE_PUBLIC (decl
))
4105 error ("%Jweak declaration of '%D' must be public", decl
, decl
);
4106 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& TREE_ASM_WRITTEN (decl
))
4107 error ("%Jweak declaration of '%D' must precede definition", decl
, decl
);
4108 else if (SUPPORTS_WEAK
)
4110 if (! DECL_WEAK (decl
))
4111 weak_decls
= tree_cons (NULL
, decl
, weak_decls
);
4114 warning ("%Jweak declaration of '%D' not supported", decl
, decl
);
4119 /* Emit any pending weak declarations. */
4126 for (t
= weak_decls
; t
; t
= TREE_CHAIN (t
))
4128 tree decl
= TREE_VALUE (t
);
4129 #if defined (ASM_WEAKEN_DECL) || defined (ASM_WEAKEN_LABEL)
4130 const char *const name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
4133 if (! TREE_USED (decl
))
4136 #ifdef ASM_WEAKEN_DECL
4137 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, NULL
);
4139 #ifdef ASM_WEAKEN_LABEL
4140 ASM_WEAKEN_LABEL (asm_out_file
, name
);
4142 #ifdef ASM_OUTPUT_WEAK_ALIAS
4143 warning ("only weak aliases are supported in this configuration");
4151 /* Emit the assembly bits to indicate that DECL is globally visible. */
4154 globalize_decl (tree decl
)
4156 const char *name
= XSTR (XEXP (DECL_RTL (decl
), 0), 0);
4158 #if defined (ASM_WEAKEN_LABEL) || defined (ASM_WEAKEN_DECL)
4159 if (DECL_WEAK (decl
))
4163 #ifdef ASM_WEAKEN_DECL
4164 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, 0);
4166 ASM_WEAKEN_LABEL (asm_out_file
, name
);
4169 /* Remove this function from the pending weak list so that
4170 we do not emit multiple .weak directives for it. */
4171 for (p
= &weak_decls
; (t
= *p
) ; )
4173 if (DECL_ASSEMBLER_NAME (decl
) == DECL_ASSEMBLER_NAME (TREE_VALUE (t
)))
4174 *p
= TREE_CHAIN (t
);
4176 p
= &TREE_CHAIN (t
);
4180 #elif defined(ASM_MAKE_LABEL_LINKONCE)
4181 if (DECL_ONE_ONLY (decl
))
4182 ASM_MAKE_LABEL_LINKONCE (asm_out_file
, name
);
4185 targetm
.asm_out
.globalize_label (asm_out_file
, name
);
4188 /* Emit an assembler directive to make the symbol for DECL an alias to
4189 the symbol for TARGET. */
4192 assemble_alias (tree decl
, tree target ATTRIBUTE_UNUSED
)
4196 /* We must force creation of DECL_RTL for debug info generation, even though
4197 we don't use it here. */
4198 make_decl_rtl (decl
);
4200 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
4202 #ifdef ASM_OUTPUT_DEF
4203 /* Make name accessible from other files, if appropriate. */
4205 if (TREE_PUBLIC (decl
))
4207 globalize_decl (decl
);
4208 maybe_assemble_visibility (decl
);
4211 #ifdef ASM_OUTPUT_DEF_FROM_DECLS
4212 ASM_OUTPUT_DEF_FROM_DECLS (asm_out_file
, decl
, target
);
4214 ASM_OUTPUT_DEF (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4216 #else /* !ASM_OUTPUT_DEF */
4217 #if defined (ASM_OUTPUT_WEAK_ALIAS) || defined (ASM_WEAKEN_DECL)
4218 if (DECL_WEAK (decl
))
4221 #ifdef ASM_WEAKEN_DECL
4222 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, IDENTIFIER_POINTER (target
));
4224 ASM_OUTPUT_WEAK_ALIAS (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4226 /* Remove this function from the pending weak list so that
4227 we do not emit multiple .weak directives for it. */
4228 for (p
= &weak_decls
; (t
= *p
) ; )
4229 if (DECL_ASSEMBLER_NAME (decl
)
4230 == DECL_ASSEMBLER_NAME (TREE_VALUE (t
)))
4231 *p
= TREE_CHAIN (t
);
4233 p
= &TREE_CHAIN (t
);
4236 warning ("only weak aliases are supported in this configuration");
4239 warning ("alias definitions not supported in this configuration; ignored");
4243 TREE_USED (decl
) = 1;
4244 TREE_ASM_WRITTEN (decl
) = 1;
4245 TREE_ASM_WRITTEN (DECL_ASSEMBLER_NAME (decl
)) = 1;
4248 /* Emit an assembler directive to set symbol for DECL visibility to
4249 the visibility type VIS, which must not be VISIBILITY_DEFAULT. */
4252 default_assemble_visibility (tree decl
, int vis
)
4254 static const char * const visibility_types
[] = {
4255 NULL
, "internal", "hidden", "protected"
4258 const char *name
, *type
;
4260 name
= (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
4261 type
= visibility_types
[vis
];
4263 #ifdef HAVE_GAS_HIDDEN
4264 fprintf (asm_out_file
, "\t.%s\t", type
);
4265 assemble_name (asm_out_file
, name
);
4266 fprintf (asm_out_file
, "\n");
4268 warning ("visibility attribute not supported in this configuration; ignored");
4272 /* A helper function to call assemble_visibility when needed for a decl. */
4275 maybe_assemble_visibility (tree decl
)
4277 enum symbol_visibility vis
= DECL_VISIBILITY (decl
);
4279 if (vis
!= VISIBILITY_DEFAULT
)
4280 targetm
.asm_out
.visibility (decl
, vis
);
4283 /* Returns 1 if the target configuration supports defining public symbols
4284 so that one of them will be chosen at link time instead of generating a
4285 multiply-defined symbol error, whether through the use of weak symbols or
4286 a target-specific mechanism for having duplicates discarded. */
4289 supports_one_only (void)
4291 if (SUPPORTS_ONE_ONLY
)
4293 return SUPPORTS_WEAK
;
4296 /* Set up DECL as a public symbol that can be defined in multiple
4297 translation units without generating a linker error. */
4300 make_decl_one_only (tree decl
)
4302 if (TREE_CODE (decl
) != VAR_DECL
&& TREE_CODE (decl
) != FUNCTION_DECL
)
4305 TREE_PUBLIC (decl
) = 1;
4307 if (SUPPORTS_ONE_ONLY
)
4309 #ifdef MAKE_DECL_ONE_ONLY
4310 MAKE_DECL_ONE_ONLY (decl
);
4312 DECL_ONE_ONLY (decl
) = 1;
4314 else if (TREE_CODE (decl
) == VAR_DECL
4315 && (DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
))
4316 DECL_COMMON (decl
) = 1;
4317 else if (SUPPORTS_WEAK
)
4318 DECL_WEAK (decl
) = 1;
4324 init_varasm_once (void)
4326 in_named_htab
= htab_create_ggc (31, in_named_entry_hash
,
4327 in_named_entry_eq
, NULL
);
4328 const_desc_htab
= htab_create_ggc (1009, const_desc_hash
,
4329 const_desc_eq
, NULL
);
4331 const_alias_set
= new_alias_set ();
4335 decl_tls_model (tree decl
)
4337 enum tls_model kind
;
4338 tree attr
= lookup_attribute ("tls_model", DECL_ATTRIBUTES (decl
));
4343 attr
= TREE_VALUE (TREE_VALUE (attr
));
4344 if (TREE_CODE (attr
) != STRING_CST
)
4346 if (!strcmp (TREE_STRING_POINTER (attr
), "local-exec"))
4347 kind
= TLS_MODEL_LOCAL_EXEC
;
4348 else if (!strcmp (TREE_STRING_POINTER (attr
), "initial-exec"))
4349 kind
= TLS_MODEL_INITIAL_EXEC
;
4350 else if (!strcmp (TREE_STRING_POINTER (attr
), "local-dynamic"))
4351 kind
= optimize
? TLS_MODEL_LOCAL_DYNAMIC
: TLS_MODEL_GLOBAL_DYNAMIC
;
4352 else if (!strcmp (TREE_STRING_POINTER (attr
), "global-dynamic"))
4353 kind
= TLS_MODEL_GLOBAL_DYNAMIC
;
4359 is_local
= targetm
.binds_local_p (decl
);
4363 kind
= TLS_MODEL_LOCAL_EXEC
;
4365 kind
= TLS_MODEL_INITIAL_EXEC
;
4367 /* Local dynamic is inefficient when we're not combining the
4368 parts of the address. */
4369 else if (optimize
&& is_local
)
4370 kind
= TLS_MODEL_LOCAL_DYNAMIC
;
4372 kind
= TLS_MODEL_GLOBAL_DYNAMIC
;
4373 if (kind
< flag_tls_default
)
4374 kind
= flag_tls_default
;
4379 /* Select a set of attributes for section NAME based on the properties
4380 of DECL and whether or not RELOC indicates that DECL's initializer
4381 might contain runtime relocations.
4383 We make the section read-only and executable for a function decl,
4384 read-only for a const data decl, and writable for a non-const data decl. */
4387 default_section_type_flags (tree decl
, const char *name
, int reloc
)
4389 return default_section_type_flags_1 (decl
, name
, reloc
, flag_pic
);
4393 default_section_type_flags_1 (tree decl
, const char *name
, int reloc
,
4398 if (decl
&& TREE_CODE (decl
) == FUNCTION_DECL
)
4399 flags
= SECTION_CODE
;
4400 else if (decl
&& decl_readonly_section_1 (decl
, reloc
, shlib
))
4402 else if (strcmp (name
, UNLIKELY_EXECUTED_TEXT_SECTION_NAME
) == 0)
4403 flags
= SECTION_CODE
;
4405 flags
= SECTION_WRITE
;
4407 if (decl
&& DECL_ONE_ONLY (decl
))
4408 flags
|= SECTION_LINKONCE
;
4410 if (decl
&& TREE_CODE (decl
) == VAR_DECL
&& DECL_THREAD_LOCAL (decl
))
4411 flags
|= SECTION_TLS
| SECTION_WRITE
;
4413 if (strcmp (name
, ".bss") == 0
4414 || strncmp (name
, ".bss.", 5) == 0
4415 || strncmp (name
, ".gnu.linkonce.b.", 16) == 0
4416 || strcmp (name
, ".sbss") == 0
4417 || strncmp (name
, ".sbss.", 6) == 0
4418 || strncmp (name
, ".gnu.linkonce.sb.", 17) == 0
4419 || strcmp (name
, ".tbss") == 0
4420 || strncmp (name
, ".gnu.linkonce.tb.", 17) == 0)
4421 flags
|= SECTION_BSS
;
4423 if (strcmp (name
, ".tdata") == 0
4424 || strcmp (name
, ".tbss") == 0
4425 || strncmp (name
, ".gnu.linkonce.td.", 17) == 0
4426 || strncmp (name
, ".gnu.linkonce.tb.", 17) == 0)
4427 flags
|= SECTION_TLS
;
4429 /* These three sections have special ELF types. They are neither
4430 SHT_PROGBITS nor SHT_NOBITS, so when changing sections we don't
4431 want to print a section type (@progbits or @nobits). If someone
4432 is silly enough to emit code or TLS variables to one of these
4433 sections, then don't handle them specially. */
4434 if (!(flags
& (SECTION_CODE
| SECTION_BSS
| SECTION_TLS
))
4435 && (strcmp (name
, ".init_array") == 0
4436 || strcmp (name
, ".fini_array") == 0
4437 || strcmp (name
, ".preinit_array") == 0))
4438 flags
|= SECTION_NOTYPE
;
4443 /* Output assembly to switch to section NAME with attribute FLAGS.
4444 Four variants for common object file formats. */
4447 default_no_named_section (const char *name ATTRIBUTE_UNUSED
,
4448 unsigned int flags ATTRIBUTE_UNUSED
)
4450 /* Some object formats don't support named sections at all. The
4451 front-end should already have flagged this as an error. */
4456 default_elf_asm_named_section (const char *name
, unsigned int flags
)
4458 char flagchars
[10], *f
= flagchars
;
4460 if (! named_section_first_declaration (name
))
4462 fprintf (asm_out_file
, "\t.section\t%s\n", name
);
4466 if (!(flags
& SECTION_DEBUG
))
4468 if (flags
& SECTION_WRITE
)
4470 if (flags
& SECTION_CODE
)
4472 if (flags
& SECTION_SMALL
)
4474 if (flags
& SECTION_MERGE
)
4476 if (flags
& SECTION_STRINGS
)
4478 if (flags
& SECTION_TLS
)
4482 fprintf (asm_out_file
, "\t.section\t%s,\"%s\"", name
, flagchars
);
4484 if (!(flags
& SECTION_NOTYPE
))
4488 if (flags
& SECTION_BSS
)
4493 fprintf (asm_out_file
, ",@%s", type
);
4495 if (flags
& SECTION_ENTSIZE
)
4496 fprintf (asm_out_file
, ",%d", flags
& SECTION_ENTSIZE
);
4499 putc ('\n', asm_out_file
);
4503 default_coff_asm_named_section (const char *name
, unsigned int flags
)
4505 char flagchars
[8], *f
= flagchars
;
4507 if (flags
& SECTION_WRITE
)
4509 if (flags
& SECTION_CODE
)
4513 fprintf (asm_out_file
, "\t.section\t%s,\"%s\"\n", name
, flagchars
);
4517 default_pe_asm_named_section (const char *name
, unsigned int flags
)
4519 default_coff_asm_named_section (name
, flags
);
4521 if (flags
& SECTION_LINKONCE
)
4523 /* Functions may have been compiled at various levels of
4524 optimization so we can't use `same_size' here.
4525 Instead, have the linker pick one. */
4526 fprintf (asm_out_file
, "\t.linkonce %s\n",
4527 (flags
& SECTION_CODE
? "discard" : "same_size"));
4531 /* The lame default section selector. */
4534 default_select_section (tree decl
, int reloc
,
4535 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
)
4537 bool readonly
= false;
4541 if (decl_readonly_section (decl
, reloc
))
4544 else if (TREE_CODE (decl
) == CONSTRUCTOR
)
4546 if (! ((flag_pic
&& reloc
)
4547 || !TREE_READONLY (decl
)
4548 || TREE_SIDE_EFFECTS (decl
)
4549 || !TREE_CONSTANT (decl
)))
4552 else if (TREE_CODE (decl
) == STRING_CST
)
4554 else if (! (flag_pic
&& reloc
))
4558 readonly_data_section ();
4563 /* A helper function for default_elf_select_section and
4564 default_elf_unique_section. Categorizes the DECL. */
4566 enum section_category
4571 SECCAT_RODATA_MERGE_STR
,
4572 SECCAT_RODATA_MERGE_STR_INIT
,
4573 SECCAT_RODATA_MERGE_CONST
,
4578 /* To optimize loading of shared programs, define following subsections
4580 _REL Contains data that has relocations, so they get grouped
4581 together and dynamic linker will visit fewer pages in memory.
4582 _RO Contains data that is otherwise read-only. This is useful
4583 with prelinking as most relocations won't be dynamically
4584 linked and thus stay read only.
4585 _LOCAL Marks data containing relocations only to local objects.
4586 These relocations will get fully resolved by prelinking. */
4588 SECCAT_DATA_REL_LOCAL
,
4590 SECCAT_DATA_REL_RO_LOCAL
,
4600 static enum section_category
4601 categorize_decl_for_section (tree
, int, int);
4603 static enum section_category
4604 categorize_decl_for_section (tree decl
, int reloc
, int shlib
)
4606 enum section_category ret
;
4608 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4610 else if (TREE_CODE (decl
) == STRING_CST
)
4612 if (flag_mudflap
) /* or !flag_merge_constants */
4613 return SECCAT_RODATA
;
4615 return SECCAT_RODATA_MERGE_STR
;
4617 else if (TREE_CODE (decl
) == VAR_DECL
)
4619 if (DECL_INITIAL (decl
) == NULL
4620 || DECL_INITIAL (decl
) == error_mark_node
4621 || (flag_zero_initialized_in_bss
4622 /* Leave constant zeroes in .rodata so they can be shared. */
4623 && !TREE_READONLY (decl
)
4624 && initializer_zerop (DECL_INITIAL (decl
))))
4626 else if (! TREE_READONLY (decl
)
4627 || TREE_SIDE_EFFECTS (decl
)
4628 || ! TREE_CONSTANT (DECL_INITIAL (decl
)))
4630 if (shlib
&& (reloc
& 2))
4631 ret
= SECCAT_DATA_REL
;
4632 else if (shlib
&& reloc
)
4633 ret
= SECCAT_DATA_REL_LOCAL
;
4637 else if (shlib
&& (reloc
& 2))
4638 ret
= SECCAT_DATA_REL_RO
;
4639 else if (shlib
&& reloc
)
4640 ret
= SECCAT_DATA_REL_RO_LOCAL
;
4641 else if (reloc
|| flag_merge_constants
< 2)
4642 /* C and C++ don't allow different variables to share the same
4643 location. -fmerge-all-constants allows even that (at the
4644 expense of not conforming). */
4645 ret
= SECCAT_RODATA
;
4646 else if (TREE_CODE (DECL_INITIAL (decl
)) == STRING_CST
)
4647 ret
= SECCAT_RODATA_MERGE_STR_INIT
;
4649 ret
= SECCAT_RODATA_MERGE_CONST
;
4651 else if (TREE_CODE (decl
) == CONSTRUCTOR
)
4653 if ((shlib
&& reloc
)
4654 || TREE_SIDE_EFFECTS (decl
)
4655 || ! TREE_CONSTANT (decl
))
4658 ret
= SECCAT_RODATA
;
4661 ret
= SECCAT_RODATA
;
4663 /* There are no read-only thread-local sections. */
4664 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_THREAD_LOCAL (decl
))
4666 /* Note that this would be *just* SECCAT_BSS, except that there's
4667 no concept of a read-only thread-local-data section. */
4668 if (ret
== SECCAT_BSS
4669 || (flag_zero_initialized_in_bss
4670 && initializer_zerop (DECL_INITIAL (decl
))))
4676 /* If the target uses small data sections, select it. */
4677 else if (targetm
.in_small_data_p (decl
))
4679 if (ret
== SECCAT_BSS
)
4681 else if (targetm
.have_srodata_section
&& ret
== SECCAT_RODATA
)
4682 ret
= SECCAT_SRODATA
;
4691 decl_readonly_section (tree decl
, int reloc
)
4693 return decl_readonly_section_1 (decl
, reloc
, flag_pic
);
4697 decl_readonly_section_1 (tree decl
, int reloc
, int shlib
)
4699 switch (categorize_decl_for_section (decl
, reloc
, shlib
))
4702 case SECCAT_RODATA_MERGE_STR
:
4703 case SECCAT_RODATA_MERGE_STR_INIT
:
4704 case SECCAT_RODATA_MERGE_CONST
:
4705 case SECCAT_SRODATA
:
4714 /* Select a section based on the above categorization. */
4717 default_elf_select_section (tree decl
, int reloc
,
4718 unsigned HOST_WIDE_INT align
)
4720 default_elf_select_section_1 (decl
, reloc
, align
, flag_pic
);
4724 default_elf_select_section_1 (tree decl
, int reloc
,
4725 unsigned HOST_WIDE_INT align
, int shlib
)
4727 switch (categorize_decl_for_section (decl
, reloc
, shlib
))
4730 /* We're not supposed to be called on FUNCTION_DECLs. */
4733 readonly_data_section ();
4735 case SECCAT_RODATA_MERGE_STR
:
4736 mergeable_string_section (decl
, align
, 0);
4738 case SECCAT_RODATA_MERGE_STR_INIT
:
4739 mergeable_string_section (DECL_INITIAL (decl
), align
, 0);
4741 case SECCAT_RODATA_MERGE_CONST
:
4742 mergeable_constant_section (DECL_MODE (decl
), align
, 0);
4744 case SECCAT_SRODATA
:
4745 named_section (NULL_TREE
, ".sdata2", reloc
);
4750 case SECCAT_DATA_REL
:
4751 named_section (NULL_TREE
, ".data.rel", reloc
);
4753 case SECCAT_DATA_REL_LOCAL
:
4754 named_section (NULL_TREE
, ".data.rel.local", reloc
);
4756 case SECCAT_DATA_REL_RO
:
4757 named_section (NULL_TREE
, ".data.rel.ro", reloc
);
4759 case SECCAT_DATA_REL_RO_LOCAL
:
4760 named_section (NULL_TREE
, ".data.rel.ro.local", reloc
);
4763 named_section (NULL_TREE
, ".sdata", reloc
);
4766 named_section (NULL_TREE
, ".tdata", reloc
);
4769 #ifdef BSS_SECTION_ASM_OP
4772 named_section (NULL_TREE
, ".bss", reloc
);
4776 named_section (NULL_TREE
, ".sbss", reloc
);
4779 named_section (NULL_TREE
, ".tbss", reloc
);
4786 /* Construct a unique section name based on the decl name and the
4787 categorization performed above. */
4790 default_unique_section (tree decl
, int reloc
)
4792 default_unique_section_1 (decl
, reloc
, flag_pic
);
4796 default_unique_section_1 (tree decl
, int reloc
, int shlib
)
4798 bool one_only
= DECL_ONE_ONLY (decl
);
4799 const char *prefix
, *name
;
4803 switch (categorize_decl_for_section (decl
, reloc
, shlib
))
4806 prefix
= one_only
? ".gnu.linkonce.t." : ".text.";
4809 case SECCAT_RODATA_MERGE_STR
:
4810 case SECCAT_RODATA_MERGE_STR_INIT
:
4811 case SECCAT_RODATA_MERGE_CONST
:
4812 prefix
= one_only
? ".gnu.linkonce.r." : ".rodata.";
4814 case SECCAT_SRODATA
:
4815 prefix
= one_only
? ".gnu.linkonce.s2." : ".sdata2.";
4818 case SECCAT_DATA_REL
:
4819 case SECCAT_DATA_REL_LOCAL
:
4820 case SECCAT_DATA_REL_RO
:
4821 case SECCAT_DATA_REL_RO_LOCAL
:
4822 prefix
= one_only
? ".gnu.linkonce.d." : ".data.";
4825 prefix
= one_only
? ".gnu.linkonce.s." : ".sdata.";
4828 prefix
= one_only
? ".gnu.linkonce.b." : ".bss.";
4831 prefix
= one_only
? ".gnu.linkonce.sb." : ".sbss.";
4834 prefix
= one_only
? ".gnu.linkonce.td." : ".tdata.";
4837 prefix
= one_only
? ".gnu.linkonce.tb." : ".tbss.";
4842 plen
= strlen (prefix
);
4844 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
4845 name
= targetm
.strip_name_encoding (name
);
4846 nlen
= strlen (name
);
4848 string
= alloca (nlen
+ plen
+ 1);
4849 memcpy (string
, prefix
, plen
);
4850 memcpy (string
+ plen
, name
, nlen
+ 1);
4852 DECL_SECTION_NAME (decl
) = build_string (nlen
+ plen
, string
);
4856 default_select_rtx_section (enum machine_mode mode ATTRIBUTE_UNUSED
,
4858 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
)
4861 switch (GET_CODE (x
))
4873 readonly_data_section ();
4877 default_elf_select_rtx_section (enum machine_mode mode
, rtx x
,
4878 unsigned HOST_WIDE_INT align
)
4880 /* ??? Handle small data here somehow. */
4883 switch (GET_CODE (x
))
4887 named_section (NULL_TREE
, ".data.rel.ro", 3);
4891 named_section (NULL_TREE
, ".data.rel.ro.local", 1);
4898 mergeable_constant_section (mode
, align
, 0);
4901 /* Set the generally applicable flags on the SYMBOL_REF for EXP. */
4904 default_encode_section_info (tree decl
, rtx rtl
, int first ATTRIBUTE_UNUSED
)
4909 /* Careful not to prod global register variables. */
4912 symbol
= XEXP (rtl
, 0);
4913 if (GET_CODE (symbol
) != SYMBOL_REF
)
4917 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4918 flags
|= SYMBOL_FLAG_FUNCTION
;
4919 if (targetm
.binds_local_p (decl
))
4920 flags
|= SYMBOL_FLAG_LOCAL
;
4921 if (targetm
.in_small_data_p (decl
))
4922 flags
|= SYMBOL_FLAG_SMALL
;
4923 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_THREAD_LOCAL (decl
))
4924 flags
|= decl_tls_model (decl
) << SYMBOL_FLAG_TLS_SHIFT
;
4925 /* ??? Why is DECL_EXTERNAL ever set for non-PUBLIC names? Without
4926 being PUBLIC, the thing *must* be defined in this translation unit.
4927 Prevent this buglet from being propagated into rtl code as well. */
4928 if (DECL_P (decl
) && DECL_EXTERNAL (decl
) && TREE_PUBLIC (decl
))
4929 flags
|= SYMBOL_FLAG_EXTERNAL
;
4931 SYMBOL_REF_FLAGS (symbol
) = flags
;
4934 /* By default, we do nothing for encode_section_info, so we need not
4935 do anything but discard the '*' marker. */
4938 default_strip_name_encoding (const char *str
)
4940 return str
+ (*str
== '*');
4943 /* Assume ELF-ish defaults, since that's pretty much the most liberal
4944 wrt cross-module name binding. */
4947 default_binds_local_p (tree exp
)
4949 return default_binds_local_p_1 (exp
, flag_shlib
);
4953 default_binds_local_p_1 (tree exp
, int shlib
)
4957 /* A non-decl is an entry in the constant pool. */
4960 /* Static variables are always local. */
4961 else if (! TREE_PUBLIC (exp
))
4963 /* A variable is local if the user explicitly tells us so. */
4964 else if (DECL_VISIBILITY_SPECIFIED (exp
) && DECL_VISIBILITY (exp
) != VISIBILITY_DEFAULT
)
4966 /* Otherwise, variables defined outside this object may not be local. */
4967 else if (DECL_EXTERNAL (exp
))
4969 /* Linkonce and weak data are never local. */
4970 else if (DECL_ONE_ONLY (exp
) || DECL_WEAK (exp
))
4972 /* If none of the above and visibility is not default, make local. */
4973 else if (DECL_VISIBILITY (exp
) != VISIBILITY_DEFAULT
)
4975 /* If PIC, then assume that any global name can be overridden by
4976 symbols resolved from other modules. */
4979 /* Uninitialized COMMON variable may be unified with symbols
4980 resolved from other modules. */
4981 else if (DECL_COMMON (exp
)
4982 && (DECL_INITIAL (exp
) == NULL
4983 || DECL_INITIAL (exp
) == error_mark_node
))
4985 /* Otherwise we're left with initialized (or non-common) global data
4986 which is of necessity defined locally. */
4993 /* Determine whether or not a pointer mode is valid. Assume defaults
4994 of ptr_mode or Pmode - can be overridden. */
4996 default_valid_pointer_mode (enum machine_mode mode
)
4998 return (mode
== ptr_mode
|| mode
== Pmode
);
5001 /* Default function to output code that will globalize a label. A
5002 target must define GLOBAL_ASM_OP or provide it's own function to
5003 globalize a label. */
5004 #ifdef GLOBAL_ASM_OP
5006 default_globalize_label (FILE * stream
, const char *name
)
5008 fputs (GLOBAL_ASM_OP
, stream
);
5009 assemble_name (stream
, name
);
5010 putc ('\n', stream
);
5012 #endif /* GLOBAL_ASM_OP */
5014 /* Default function to output a label for unwind information. The
5015 default is to do nothing. A target that needs nonlocal labels for
5016 unwind information must provide its own function to do this. */
5018 default_emit_unwind_label (FILE * stream ATTRIBUTE_UNUSED
,
5019 tree decl ATTRIBUTE_UNUSED
,
5020 int for_eh ATTRIBUTE_UNUSED
,
5021 int empty ATTRIBUTE_UNUSED
)
5025 /* This is how to output an internal numbered label where PREFIX is
5026 the class of label and LABELNO is the number within the class. */
5029 default_internal_label (FILE *stream
, const char *prefix
,
5030 unsigned long labelno
)
5032 char *const buf
= alloca (40 + strlen (prefix
));
5033 ASM_GENERATE_INTERNAL_LABEL (buf
, prefix
, labelno
);
5034 ASM_OUTPUT_LABEL (stream
, buf
);
5037 /* This is the default behavior at the beginning of a file. It's
5038 controlled by two other target-hook toggles. */
5040 default_file_start (void)
5042 if (targetm
.file_start_app_off
&& !flag_verbose_asm
)
5043 fputs (ASM_APP_OFF
, asm_out_file
);
5045 if (targetm
.file_start_file_directive
)
5046 output_file_directive (asm_out_file
, main_input_filename
);
5049 /* This is a generic routine suitable for use as TARGET_ASM_FILE_END
5050 which emits a special section directive used to indicate whether or
5051 not this object file needs an executable stack. This is primarily
5052 a GNU extension to ELF but could be used on other targets. */
5054 int trampolines_created
;
5057 file_end_indicate_exec_stack (void)
5059 unsigned int flags
= SECTION_DEBUG
;
5060 if (trampolines_created
)
5061 flags
|= SECTION_CODE
;
5063 named_section_flags (".note.GNU-stack", flags
);
5066 #include "gt-varasm.h"