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 /* Decode an `asm' spec for a declaration as a register name.
672 Return the register number, or -1 if nothing specified,
673 or -2 if the ASMSPEC is not `cc' or `memory' and is not recognized,
674 or -3 if ASMSPEC is `cc' and is not recognized,
675 or -4 if ASMSPEC is `memory' and is not recognized.
676 Accept an exact spelling or a decimal number.
677 Prefixes such as % are optional. */
680 decode_reg_name (const char *asmspec
)
686 /* Get rid of confusing prefixes. */
687 asmspec
= strip_reg_name (asmspec
);
689 /* Allow a decimal number as a "register name". */
690 for (i
= strlen (asmspec
) - 1; i
>= 0; i
--)
691 if (! ISDIGIT (asmspec
[i
]))
693 if (asmspec
[0] != 0 && i
< 0)
696 if (i
< FIRST_PSEUDO_REGISTER
&& i
>= 0)
702 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
704 && ! strcmp (asmspec
, strip_reg_name (reg_names
[i
])))
707 #ifdef ADDITIONAL_REGISTER_NAMES
709 static const struct { const char *const name
; const int number
; } table
[]
710 = ADDITIONAL_REGISTER_NAMES
;
712 for (i
= 0; i
< (int) ARRAY_SIZE (table
); i
++)
713 if (! strcmp (asmspec
, table
[i
].name
))
714 return table
[i
].number
;
716 #endif /* ADDITIONAL_REGISTER_NAMES */
718 if (!strcmp (asmspec
, "memory"))
721 if (!strcmp (asmspec
, "cc"))
730 /* Create the DECL_RTL for a VAR_DECL or FUNCTION_DECL. DECL should
731 have static storage duration. In other words, it should not be an
732 automatic variable, including PARM_DECLs.
734 There is, however, one exception: this function handles variables
735 explicitly placed in a particular register by the user.
737 ASMSPEC, if not 0, is the string which the user specified as the
738 assembler symbol name.
740 This is never called for PARM_DECL nodes. */
743 make_decl_rtl (tree decl
, const char *asmspec
)
745 const char *name
= 0;
749 /* Check that we are not being given an automatic variable. */
750 /* A weak alias has TREE_PUBLIC set but not the other bits. */
751 if (TREE_CODE (decl
) == PARM_DECL
752 || TREE_CODE (decl
) == RESULT_DECL
753 || (TREE_CODE (decl
) == VAR_DECL
754 && !TREE_STATIC (decl
)
755 && !TREE_PUBLIC (decl
)
756 && !DECL_EXTERNAL (decl
)
757 && !DECL_REGISTER (decl
)))
759 /* And that we were not given a type or a label. */
760 else if (TREE_CODE (decl
) == TYPE_DECL
761 || TREE_CODE (decl
) == LABEL_DECL
)
764 /* For a duplicate declaration, we can be called twice on the
765 same DECL node. Don't discard the RTL already made. */
766 if (DECL_RTL_SET_P (decl
))
768 /* If the old RTL had the wrong mode, fix the mode. */
769 if (GET_MODE (DECL_RTL (decl
)) != DECL_MODE (decl
))
770 SET_DECL_RTL (decl
, adjust_address_nv (DECL_RTL (decl
),
771 DECL_MODE (decl
), 0));
773 /* ??? Another way to do this would be to maintain a hashed
774 table of such critters. Instead of adding stuff to a DECL
775 to give certain attributes to it, we could use an external
776 hash map from DECL to set of attributes. */
778 /* Let the target reassign the RTL if it wants.
779 This is necessary, for example, when one machine specific
780 decl attribute overrides another. */
781 targetm
.encode_section_info (decl
, DECL_RTL (decl
), false);
783 /* Make this function static known to the mudflap runtime. */
784 if (flag_mudflap
&& TREE_CODE (decl
) == VAR_DECL
)
785 mudflap_enqueue_decl (decl
);
790 reg_number
= decode_reg_name (asmspec
);
791 if (reg_number
== -2)
793 /* ASMSPEC is given, and not the name of a register. Mark the
794 name with a star so assemble_name won't munge it. */
795 char *starred
= alloca (strlen (asmspec
) + 2);
797 strcpy (starred
+ 1, asmspec
);
798 change_decl_assembler_name (decl
, get_identifier (starred
));
801 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
803 if (TREE_CODE (decl
) != FUNCTION_DECL
&& DECL_REGISTER (decl
))
805 /* First detect errors in declaring global registers. */
806 if (reg_number
== -1)
807 error ("%Jregister name not specified for '%D'", decl
, decl
);
808 else if (reg_number
< 0)
809 error ("%Jinvalid register name for '%D'", decl
, decl
);
810 else if (TYPE_MODE (TREE_TYPE (decl
)) == BLKmode
)
811 error ("%Jdata type of '%D' isn't suitable for a register",
813 else if (! HARD_REGNO_MODE_OK (reg_number
, TYPE_MODE (TREE_TYPE (decl
))))
814 error ("%Jregister specified for '%D' isn't suitable for data type",
816 /* Now handle properly declared static register variables. */
821 if (DECL_INITIAL (decl
) != 0 && TREE_STATIC (decl
))
823 DECL_INITIAL (decl
) = 0;
824 error ("global register variable has initial value");
826 if (TREE_THIS_VOLATILE (decl
))
827 warning ("volatile register variables don't work as you might wish");
829 /* If the user specified one of the eliminables registers here,
830 e.g., FRAME_POINTER_REGNUM, we don't want to get this variable
831 confused with that register and be eliminated. This usage is
832 somewhat suspect... */
834 SET_DECL_RTL (decl
, gen_rtx_raw_REG (DECL_MODE (decl
), reg_number
));
835 ORIGINAL_REGNO (DECL_RTL (decl
)) = reg_number
;
836 REG_USERVAR_P (DECL_RTL (decl
)) = 1;
838 if (TREE_STATIC (decl
))
840 /* Make this register global, so not usable for anything
842 #ifdef ASM_DECLARE_REGISTER_GLOBAL
843 ASM_DECLARE_REGISTER_GLOBAL (asm_out_file
, decl
, reg_number
, name
);
845 nregs
= hard_regno_nregs
[reg_number
][DECL_MODE (decl
)];
847 globalize_reg (reg_number
+ --nregs
);
850 /* As a register variable, it has no section. */
855 /* Now handle ordinary static variables and functions (in memory).
856 Also handle vars declared register invalidly. */
858 if (reg_number
>= 0 || reg_number
== -3)
859 error ("%Jregister name given for non-register variable '%D'", decl
, decl
);
861 /* Specifying a section attribute on a variable forces it into a
862 non-.bss section, and thus it cannot be common. */
863 if (TREE_CODE (decl
) == VAR_DECL
864 && DECL_SECTION_NAME (decl
) != NULL_TREE
865 && DECL_INITIAL (decl
) == NULL_TREE
866 && DECL_COMMON (decl
))
867 DECL_COMMON (decl
) = 0;
869 /* Variables can't be both common and weak. */
870 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_WEAK (decl
))
871 DECL_COMMON (decl
) = 0;
873 x
= gen_rtx_SYMBOL_REF (Pmode
, name
);
874 SYMBOL_REF_WEAK (x
) = DECL_WEAK (decl
);
875 SYMBOL_REF_DECL (x
) = decl
;
877 x
= gen_rtx_MEM (DECL_MODE (decl
), x
);
878 if (TREE_CODE (decl
) != FUNCTION_DECL
)
879 set_mem_attributes (x
, decl
, 1);
880 SET_DECL_RTL (decl
, x
);
882 /* Optionally set flags or add text to the name to record information
883 such as that it is a function name.
884 If the name is changed, the macro ASM_OUTPUT_LABELREF
885 will have to know how to strip this information. */
886 targetm
.encode_section_info (decl
, DECL_RTL (decl
), true);
888 /* Make this function static known to the mudflap runtime. */
889 if (flag_mudflap
&& TREE_CODE (decl
) == VAR_DECL
)
890 mudflap_enqueue_decl (decl
);
893 /* Make the rtl for variable VAR be volatile.
894 Use this only for static variables. */
897 make_var_volatile (tree var
)
899 if (!MEM_P (DECL_RTL (var
)))
902 MEM_VOLATILE_P (DECL_RTL (var
)) = 1;
905 /* Output a string of literal assembler code
906 for an `asm' keyword used between functions. */
909 assemble_asm (tree string
)
913 if (TREE_CODE (string
) == ADDR_EXPR
)
914 string
= TREE_OPERAND (string
, 0);
916 fprintf (asm_out_file
, "\t%s\n", TREE_STRING_POINTER (string
));
919 /* Record an element in the table of global destructors. SYMBOL is
920 a SYMBOL_REF of the function to be called; PRIORITY is a number
921 between 0 and MAX_INIT_PRIORITY. */
924 default_stabs_asm_out_destructor (rtx symbol
, int priority ATTRIBUTE_UNUSED
)
926 /* Tell GNU LD that this is part of the static destructor set.
927 This will work for any system that uses stabs, most usefully
929 fprintf (asm_out_file
, "%s\"___DTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
930 assemble_name (asm_out_file
, XSTR (symbol
, 0));
931 fputc ('\n', asm_out_file
);
935 default_named_section_asm_out_destructor (rtx symbol
, int priority
)
937 const char *section
= ".dtors";
940 /* ??? This only works reliably with the GNU linker. */
941 if (priority
!= DEFAULT_INIT_PRIORITY
)
943 sprintf (buf
, ".dtors.%.5u",
944 /* Invert the numbering so the linker puts us in the proper
945 order; constructors are run from right to left, and the
946 linker sorts in increasing order. */
947 MAX_INIT_PRIORITY
- priority
);
951 named_section_flags (section
, SECTION_WRITE
);
952 assemble_align (POINTER_SIZE
);
953 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
956 #ifdef DTORS_SECTION_ASM_OP
960 if (in_section
!= in_dtors
)
962 in_section
= in_dtors
;
963 fputs (DTORS_SECTION_ASM_OP
, asm_out_file
);
964 fputc ('\n', asm_out_file
);
969 default_dtor_section_asm_out_destructor (rtx symbol
,
970 int priority ATTRIBUTE_UNUSED
)
973 assemble_align (POINTER_SIZE
);
974 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
978 /* Likewise for global constructors. */
981 default_stabs_asm_out_constructor (rtx symbol
, int priority ATTRIBUTE_UNUSED
)
983 /* Tell GNU LD that this is part of the static destructor set.
984 This will work for any system that uses stabs, most usefully
986 fprintf (asm_out_file
, "%s\"___CTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
987 assemble_name (asm_out_file
, XSTR (symbol
, 0));
988 fputc ('\n', asm_out_file
);
992 default_named_section_asm_out_constructor (rtx symbol
, int priority
)
994 const char *section
= ".ctors";
997 /* ??? This only works reliably with the GNU linker. */
998 if (priority
!= DEFAULT_INIT_PRIORITY
)
1000 sprintf (buf
, ".ctors.%.5u",
1001 /* Invert the numbering so the linker puts us in the proper
1002 order; constructors are run from right to left, and the
1003 linker sorts in increasing order. */
1004 MAX_INIT_PRIORITY
- priority
);
1008 named_section_flags (section
, SECTION_WRITE
);
1009 assemble_align (POINTER_SIZE
);
1010 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1013 #ifdef CTORS_SECTION_ASM_OP
1015 ctors_section (void)
1017 if (in_section
!= in_ctors
)
1019 in_section
= in_ctors
;
1020 fputs (CTORS_SECTION_ASM_OP
, asm_out_file
);
1021 fputc ('\n', asm_out_file
);
1026 default_ctor_section_asm_out_constructor (rtx symbol
,
1027 int priority ATTRIBUTE_UNUSED
)
1030 assemble_align (POINTER_SIZE
);
1031 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1035 /* CONSTANT_POOL_BEFORE_FUNCTION may be defined as an expression with
1036 a nonzero value if the constant pool should be output before the
1037 start of the function, or a zero value if the pool should output
1038 after the end of the function. The default is to put it before the
1041 #ifndef CONSTANT_POOL_BEFORE_FUNCTION
1042 #define CONSTANT_POOL_BEFORE_FUNCTION 1
1045 /* DECL is an object (either VAR_DECL or FUNCTION_DECL) which is going
1046 to be output to assembler.
1047 Set first_global_object_name and weak_global_object_name as appropriate. */
1050 notice_global_symbol (tree decl
)
1052 const char **type
= &first_global_object_name
;
1054 if (first_global_object_name
1055 || !TREE_PUBLIC (decl
) || DECL_EXTERNAL (decl
)
1056 || !DECL_NAME (decl
)
1057 || (TREE_CODE (decl
) != FUNCTION_DECL
1058 && (TREE_CODE (decl
) != VAR_DECL
1059 || (DECL_COMMON (decl
)
1060 && (DECL_INITIAL (decl
) == 0
1061 || DECL_INITIAL (decl
) == error_mark_node
))))
1062 || !MEM_P (DECL_RTL (decl
)))
1065 /* We win when global object is found, but it is useful to know about weak
1066 symbol as well so we can produce nicer unique names. */
1067 if (DECL_WEAK (decl
) || DECL_ONE_ONLY (decl
))
1068 type
= &weak_global_object_name
;
1074 rtx decl_rtl
= DECL_RTL (decl
);
1076 p
= targetm
.strip_name_encoding (XSTR (XEXP (decl_rtl
, 0), 0));
1083 /* Output assembler code for the constant pool of a function and associated
1084 with defining the name of the function. DECL describes the function.
1085 NAME is the function's name. For the constant pool, we use the current
1086 constant pool data. */
1089 assemble_start_function (tree decl
, const char *fnname
)
1093 unlikely_section_label_printed
= false;
1095 /* The following code does not need preprocessing in the assembler. */
1099 if (CONSTANT_POOL_BEFORE_FUNCTION
)
1100 output_constant_pool (fnname
, decl
);
1102 resolve_unique_section (decl
, 0, flag_function_sections
);
1103 function_section (decl
);
1105 /* Tell assembler to move to target machine's alignment for functions. */
1106 align
= floor_log2 (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
1107 if (align
< force_align_functions_log
)
1108 align
= force_align_functions_log
;
1111 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1114 /* Handle a user-specified function alignment.
1115 Note that we still need to align to FUNCTION_BOUNDARY, as above,
1116 because ASM_OUTPUT_MAX_SKIP_ALIGN might not do any alignment at all. */
1117 if (align_functions_log
> align
1118 && cfun
->function_frequency
!= FUNCTION_FREQUENCY_UNLIKELY_EXECUTED
)
1120 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
1121 ASM_OUTPUT_MAX_SKIP_ALIGN (asm_out_file
,
1122 align_functions_log
, align_functions
- 1);
1124 ASM_OUTPUT_ALIGN (asm_out_file
, align_functions_log
);
1128 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
1129 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file
, fnname
);
1132 (*debug_hooks
->begin_function
) (decl
);
1134 /* Make function name accessible from other files, if appropriate. */
1136 if (TREE_PUBLIC (decl
))
1138 notice_global_symbol (decl
);
1140 globalize_decl (decl
);
1142 maybe_assemble_visibility (decl
);
1145 /* Do any machine/system dependent processing of the function name. */
1146 #ifdef ASM_DECLARE_FUNCTION_NAME
1147 ASM_DECLARE_FUNCTION_NAME (asm_out_file
, fnname
, current_function_decl
);
1149 /* Standard thing is just output label for the function. */
1150 ASM_OUTPUT_LABEL (asm_out_file
, fnname
);
1151 #endif /* ASM_DECLARE_FUNCTION_NAME */
1154 /* Output assembler code associated with defining the size of the
1155 function. DECL describes the function. NAME is the function's name. */
1158 assemble_end_function (tree decl
, const char *fnname
)
1160 #ifdef ASM_DECLARE_FUNCTION_SIZE
1161 ASM_DECLARE_FUNCTION_SIZE (asm_out_file
, fnname
, decl
);
1163 if (! CONSTANT_POOL_BEFORE_FUNCTION
)
1165 output_constant_pool (fnname
, decl
);
1166 function_section (decl
); /* need to switch back */
1170 /* Assemble code to leave SIZE bytes of zeros. */
1173 assemble_zeros (unsigned HOST_WIDE_INT size
)
1175 /* Do no output if -fsyntax-only. */
1176 if (flag_syntax_only
)
1179 #ifdef ASM_NO_SKIP_IN_TEXT
1180 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
1181 so we must output 0s explicitly in the text section. */
1182 if ((ASM_NO_SKIP_IN_TEXT
&& in_text_section ())
1183 || (ASM_NO_SKIP_IN_TEXT
&& in_unlikely_text_section ()))
1185 unsigned HOST_WIDE_INT i
;
1186 for (i
= 0; i
< size
; i
++)
1187 assemble_integer (const0_rtx
, 1, BITS_PER_UNIT
, 1);
1192 ASM_OUTPUT_SKIP (asm_out_file
, size
);
1195 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
1198 assemble_align (int align
)
1200 if (align
> BITS_PER_UNIT
)
1202 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
1206 /* Assemble a string constant with the specified C string as contents. */
1209 assemble_string (const char *p
, int size
)
1214 /* If the string is very long, split it up. */
1218 int thissize
= size
- pos
;
1219 if (thissize
> maximum
)
1222 ASM_OUTPUT_ASCII (asm_out_file
, p
, thissize
);
1230 #if defined ASM_OUTPUT_ALIGNED_DECL_LOCAL
1231 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1232 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1234 #if defined ASM_OUTPUT_ALIGNED_LOCAL
1235 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1236 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, DECL_ALIGN (decl))
1238 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1239 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded)
1243 #if defined ASM_OUTPUT_ALIGNED_BSS
1244 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1245 ASM_OUTPUT_ALIGNED_BSS (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1247 #if defined ASM_OUTPUT_BSS
1248 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1249 ASM_OUTPUT_BSS (asm_out_file, decl, name, size, rounded)
1255 #if defined ASM_OUTPUT_ALIGNED_DECL_COMMON
1256 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1257 ASM_OUTPUT_ALIGNED_DECL_COMMON (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1259 #if defined ASM_OUTPUT_ALIGNED_COMMON
1260 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1261 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file, name, size, DECL_ALIGN (decl))
1263 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1264 ASM_OUTPUT_COMMON (asm_out_file, name, size, rounded)
1269 asm_emit_uninitialised (tree decl
, const char *name
,
1270 unsigned HOST_WIDE_INT size ATTRIBUTE_UNUSED
,
1271 unsigned HOST_WIDE_INT rounded ATTRIBUTE_UNUSED
)
1279 destination
= asm_dest_local
;
1281 /* ??? We should handle .bss via select_section mechanisms rather than
1282 via special target hooks. That would eliminate this special case. */
1283 if (TREE_PUBLIC (decl
))
1285 if (!DECL_COMMON (decl
))
1287 destination
= asm_dest_bss
;
1292 destination
= asm_dest_common
;
1295 if (destination
== asm_dest_bss
)
1296 globalize_decl (decl
);
1297 resolve_unique_section (decl
, 0, flag_data_sections
);
1299 if (flag_shared_data
)
1301 switch (destination
)
1303 #ifdef ASM_OUTPUT_SHARED_BSS
1305 ASM_OUTPUT_SHARED_BSS (asm_out_file
, decl
, name
, size
, rounded
);
1308 #ifdef ASM_OUTPUT_SHARED_COMMON
1309 case asm_dest_common
:
1310 ASM_OUTPUT_SHARED_COMMON (asm_out_file
, name
, size
, rounded
);
1313 #ifdef ASM_OUTPUT_SHARED_LOCAL
1314 case asm_dest_local
:
1315 ASM_OUTPUT_SHARED_LOCAL (asm_out_file
, name
, size
, rounded
);
1323 switch (destination
)
1327 ASM_EMIT_BSS (decl
, name
, size
, rounded
);
1330 case asm_dest_common
:
1331 ASM_EMIT_COMMON (decl
, name
, size
, rounded
);
1333 case asm_dest_local
:
1334 ASM_EMIT_LOCAL (decl
, name
, size
, rounded
);
1343 /* Assemble everything that is needed for a variable or function declaration.
1344 Not used for automatic variables, and not used for function definitions.
1345 Should not be called for variables of incomplete structure type.
1347 TOP_LEVEL is nonzero if this variable has file scope.
1348 AT_END is nonzero if this is the special handling, at end of compilation,
1349 to define things that have had only tentative definitions.
1350 DONT_OUTPUT_DATA if nonzero means don't actually output the
1351 initial value (that will be done by the caller). */
1354 assemble_variable (tree decl
, int top_level ATTRIBUTE_UNUSED
,
1355 int at_end ATTRIBUTE_UNUSED
, int dont_output_data
)
1362 if (lang_hooks
.decls
.prepare_assemble_variable
)
1363 lang_hooks
.decls
.prepare_assemble_variable (decl
);
1365 last_assemble_variable_decl
= 0;
1367 /* Normally no need to say anything here for external references,
1368 since assemble_external is called by the language-specific code
1369 when a declaration is first seen. */
1371 if (DECL_EXTERNAL (decl
))
1374 /* Output no assembler code for a function declaration.
1375 Only definitions of functions output anything. */
1377 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1380 /* Do nothing for global register variables. */
1381 if (DECL_RTL_SET_P (decl
) && REG_P (DECL_RTL (decl
)))
1383 TREE_ASM_WRITTEN (decl
) = 1;
1387 /* If type was incomplete when the variable was declared,
1388 see if it is complete now. */
1390 if (DECL_SIZE (decl
) == 0)
1391 layout_decl (decl
, 0);
1393 /* Still incomplete => don't allocate it; treat the tentative defn
1394 (which is what it must have been) as an `extern' reference. */
1396 if (!dont_output_data
&& DECL_SIZE (decl
) == 0)
1398 error ("%Jstorage size of `%D' isn't known", decl
, decl
);
1399 TREE_ASM_WRITTEN (decl
) = 1;
1403 /* The first declaration of a variable that comes through this function
1404 decides whether it is global (in C, has external linkage)
1405 or local (in C, has internal linkage). So do nothing more
1406 if this function has already run. */
1408 if (TREE_ASM_WRITTEN (decl
))
1411 /* Make sure targetm.encode_section_info is invoked before we set
1413 decl_rtl
= DECL_RTL (decl
);
1415 TREE_ASM_WRITTEN (decl
) = 1;
1417 /* Do no output if -fsyntax-only. */
1418 if (flag_syntax_only
)
1423 if (! dont_output_data
1424 && ! host_integerp (DECL_SIZE_UNIT (decl
), 1))
1426 error ("%Jsize of variable '%D' is too large", decl
, decl
);
1430 name
= XSTR (XEXP (decl_rtl
, 0), 0);
1431 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
))
1432 notice_global_symbol (decl
);
1434 /* Compute the alignment of this data. */
1436 align
= DECL_ALIGN (decl
);
1438 /* In the case for initialing an array whose length isn't specified,
1439 where we have not yet been able to do the layout,
1440 figure out the proper alignment now. */
1441 if (dont_output_data
&& DECL_SIZE (decl
) == 0
1442 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
)
1443 align
= MAX (align
, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl
))));
1445 /* Some object file formats have a maximum alignment which they support.
1446 In particular, a.out format supports a maximum alignment of 4. */
1447 #ifndef MAX_OFILE_ALIGNMENT
1448 #define MAX_OFILE_ALIGNMENT BIGGEST_ALIGNMENT
1450 if (align
> MAX_OFILE_ALIGNMENT
)
1452 warning ("%Jalignment of '%D' is greater than maximum object "
1453 "file alignment. Using %d", decl
, decl
,
1454 MAX_OFILE_ALIGNMENT
/BITS_PER_UNIT
);
1455 align
= MAX_OFILE_ALIGNMENT
;
1458 /* On some machines, it is good to increase alignment sometimes. */
1459 if (! DECL_USER_ALIGN (decl
))
1461 #ifdef DATA_ALIGNMENT
1462 align
= DATA_ALIGNMENT (TREE_TYPE (decl
), align
);
1464 #ifdef CONSTANT_ALIGNMENT
1465 if (DECL_INITIAL (decl
) != 0 && DECL_INITIAL (decl
) != error_mark_node
)
1466 align
= CONSTANT_ALIGNMENT (DECL_INITIAL (decl
), align
);
1470 /* Reset the alignment in case we have made it tighter, so we can benefit
1471 from it in get_pointer_alignment. */
1472 DECL_ALIGN (decl
) = align
;
1473 set_mem_align (decl_rtl
, align
);
1475 if (TREE_PUBLIC (decl
))
1476 maybe_assemble_visibility (decl
);
1478 /* Output any data that we will need to use the address of. */
1479 if (DECL_INITIAL (decl
) == error_mark_node
)
1480 reloc
= contains_pointers_p (TREE_TYPE (decl
)) ? 3 : 0;
1481 else if (DECL_INITIAL (decl
))
1483 reloc
= compute_reloc_for_constant (DECL_INITIAL (decl
));
1484 output_addressed_constants (DECL_INITIAL (decl
));
1486 resolve_unique_section (decl
, reloc
, flag_data_sections
);
1488 /* Handle uninitialized definitions. */
1490 /* If the decl has been given an explicit section name, then it
1491 isn't common, and shouldn't be handled as such. */
1492 if (DECL_SECTION_NAME (decl
) || dont_output_data
)
1494 /* We don't implement common thread-local data at present. */
1495 else if (DECL_THREAD_LOCAL (decl
))
1497 if (DECL_COMMON (decl
))
1498 sorry ("thread-local COMMON data not implemented");
1500 else if (DECL_INITIAL (decl
) == 0
1501 || DECL_INITIAL (decl
) == error_mark_node
1502 || (flag_zero_initialized_in_bss
1503 /* Leave constant zeroes in .rodata so they can be shared. */
1504 && !TREE_READONLY (decl
)
1505 && initializer_zerop (DECL_INITIAL (decl
))))
1507 unsigned HOST_WIDE_INT size
= tree_low_cst (DECL_SIZE_UNIT (decl
), 1);
1508 unsigned HOST_WIDE_INT rounded
= size
;
1510 /* Don't allocate zero bytes of common,
1511 since that means "undefined external" in the linker. */
1515 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1516 so that each uninitialized object starts on such a boundary. */
1517 rounded
+= (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1;
1518 rounded
= (rounded
/ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1519 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1521 #if !defined(ASM_OUTPUT_ALIGNED_COMMON) && !defined(ASM_OUTPUT_ALIGNED_DECL_COMMON) && !defined(ASM_OUTPUT_ALIGNED_BSS)
1522 if ((unsigned HOST_WIDE_INT
) DECL_ALIGN (decl
) / BITS_PER_UNIT
> rounded
)
1523 warning ("%Jrequested alignment for '%D' is greater than "
1524 "implemented alignment of %d", decl
, decl
, rounded
);
1527 /* If the target cannot output uninitialized but not common global data
1528 in .bss, then we have to use .data, so fall through. */
1529 if (asm_emit_uninitialised (decl
, name
, size
, rounded
))
1533 /* Handle initialized definitions.
1534 Also handle uninitialized global definitions if -fno-common and the
1535 target doesn't support ASM_OUTPUT_BSS. */
1537 /* First make the assembler name(s) global if appropriate. */
1538 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
))
1539 globalize_decl (decl
);
1541 /* Switch to the appropriate section. */
1542 variable_section (decl
, reloc
);
1544 /* dbxout.c needs to know this. */
1545 if (in_text_section () || in_unlikely_text_section ())
1546 DECL_IN_TEXT_SECTION (decl
) = 1;
1548 /* Output the alignment of this data. */
1549 if (align
> BITS_PER_UNIT
)
1551 ASM_OUTPUT_ALIGN (asm_out_file
,
1552 floor_log2 (DECL_ALIGN (decl
) / BITS_PER_UNIT
));
1555 /* Do any machine/system dependent processing of the object. */
1556 #ifdef ASM_DECLARE_OBJECT_NAME
1557 last_assemble_variable_decl
= decl
;
1558 ASM_DECLARE_OBJECT_NAME (asm_out_file
, name
, decl
);
1560 /* Standard thing is just output label for the object. */
1561 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1562 #endif /* ASM_DECLARE_OBJECT_NAME */
1564 if (!dont_output_data
)
1566 if (DECL_INITIAL (decl
)
1567 && DECL_INITIAL (decl
) != error_mark_node
1568 && !initializer_zerop (DECL_INITIAL (decl
)))
1569 /* Output the actual data. */
1570 output_constant (DECL_INITIAL (decl
),
1571 tree_low_cst (DECL_SIZE_UNIT (decl
), 1),
1574 /* Leave space for it. */
1575 assemble_zeros (tree_low_cst (DECL_SIZE_UNIT (decl
), 1));
1579 /* Return 1 if type TYPE contains any pointers. */
1582 contains_pointers_p (tree type
)
1584 switch (TREE_CODE (type
))
1587 case REFERENCE_TYPE
:
1588 /* I'm not sure whether OFFSET_TYPE needs this treatment,
1589 so I'll play safe and return 1. */
1595 case QUAL_UNION_TYPE
:
1598 /* For a type that has fields, see if the fields have pointers. */
1599 for (fields
= TYPE_FIELDS (type
); fields
; fields
= TREE_CHAIN (fields
))
1600 if (TREE_CODE (fields
) == FIELD_DECL
1601 && contains_pointers_p (TREE_TYPE (fields
)))
1607 /* An array type contains pointers if its element type does. */
1608 return contains_pointers_p (TREE_TYPE (type
));
1615 #ifdef ASM_OUTPUT_EXTERNAL
1616 /* True if DECL is a function decl for which no out-of-line copy exists.
1617 It is assumed that DECL's assembler name has been set. */
1620 incorporeal_function_p (tree decl
)
1622 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_BUILT_IN (decl
))
1626 if (DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
1627 && DECL_FUNCTION_CODE (decl
) == BUILT_IN_ALLOCA
)
1630 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
1631 if (strncmp (name
, "__builtin_", strlen ("__builtin_")) == 0)
1638 /* Output something to declare an external symbol to the assembler.
1639 (Most assemblers don't need this, so we normally output nothing.)
1640 Do nothing if DECL is not external. */
1643 assemble_external (tree decl ATTRIBUTE_UNUSED
)
1645 /* Because most platforms do not define ASM_OUTPUT_EXTERNAL, the
1646 main body of this code is only rarely exercised. To provide some
1647 testing, on all platforms, we make sure that the ASM_OUT_FILE is
1648 open. If it's not, we should not be calling this function. */
1652 #ifdef ASM_OUTPUT_EXTERNAL
1653 if (DECL_P (decl
) && DECL_EXTERNAL (decl
) && TREE_PUBLIC (decl
))
1655 rtx rtl
= DECL_RTL (decl
);
1657 if (MEM_P (rtl
) && GET_CODE (XEXP (rtl
, 0)) == SYMBOL_REF
1658 && !SYMBOL_REF_USED (XEXP (rtl
, 0))
1659 && !incorporeal_function_p (decl
))
1661 /* Some systems do require some output. */
1662 SYMBOL_REF_USED (XEXP (rtl
, 0)) = 1;
1663 ASM_OUTPUT_EXTERNAL (asm_out_file
, decl
, XSTR (XEXP (rtl
, 0), 0));
1669 /* Similar, for calling a library function FUN. */
1672 assemble_external_libcall (rtx fun
)
1674 /* Declare library function name external when first used, if nec. */
1675 if (! SYMBOL_REF_USED (fun
))
1677 SYMBOL_REF_USED (fun
) = 1;
1678 targetm
.asm_out
.external_libcall (fun
);
1682 /* Assemble a label named NAME. */
1685 assemble_label (const char *name
)
1687 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1690 /* Set the symbol_referenced flag for ID. */
1692 mark_referenced (tree id
)
1694 TREE_SYMBOL_REFERENCED (id
) = 1;
1697 /* Set the symbol_referenced flag for DECL and notify callgraph. */
1699 mark_decl_referenced (tree decl
)
1701 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1702 cgraph_mark_needed_node (cgraph_node (decl
));
1703 else if (TREE_CODE (decl
) == VAR_DECL
)
1704 cgraph_varpool_mark_needed_node (cgraph_varpool_node (decl
));
1705 /* else do nothing - we can get various sorts of CST nodes here,
1706 which do not need to be marked. */
1709 /* Output to FILE a reference to the assembler name of a C-level name NAME.
1710 If NAME starts with a *, the rest of NAME is output verbatim.
1711 Otherwise NAME is transformed in an implementation-defined way
1712 (usually by the addition of an underscore).
1713 Many macros in the tm file are defined to call this function. */
1716 assemble_name (FILE *file
, const char *name
)
1718 const char *real_name
;
1721 real_name
= targetm
.strip_name_encoding (name
);
1723 id
= maybe_get_identifier (real_name
);
1725 mark_referenced (id
);
1728 fputs (&name
[1], file
);
1730 ASM_OUTPUT_LABELREF (file
, name
);
1733 /* Allocate SIZE bytes writable static space with a gensym name
1734 and return an RTX to refer to its address. */
1737 assemble_static_space (unsigned HOST_WIDE_INT size
)
1740 const char *namestring
;
1744 if (flag_shared_data
)
1748 ASM_GENERATE_INTERNAL_LABEL (name
, "LF", const_labelno
);
1750 namestring
= ggc_strdup (name
);
1752 x
= gen_rtx_SYMBOL_REF (Pmode
, namestring
);
1753 SYMBOL_REF_FLAGS (x
) = SYMBOL_FLAG_LOCAL
;
1755 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
1756 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file
, NULL_TREE
, name
, size
,
1759 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1760 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file
, name
, size
, BIGGEST_ALIGNMENT
);
1763 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1764 so that each uninitialized object starts on such a boundary. */
1765 /* Variable `rounded' might or might not be used in ASM_OUTPUT_LOCAL. */
1766 unsigned HOST_WIDE_INT rounded ATTRIBUTE_UNUSED
1767 = ((size
+ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1)
1768 / (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1769 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1770 ASM_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
1777 /* Assemble the static constant template for function entry trampolines.
1778 This is done at most once per compilation.
1779 Returns an RTX for the address of the template. */
1781 static GTY(()) rtx initial_trampoline
;
1783 #ifdef TRAMPOLINE_TEMPLATE
1785 assemble_trampoline_template (void)
1792 if (initial_trampoline
)
1793 return initial_trampoline
;
1795 /* By default, put trampoline templates in read-only data section. */
1797 #ifdef TRAMPOLINE_SECTION
1798 TRAMPOLINE_SECTION ();
1800 readonly_data_section ();
1803 /* Write the assembler code to define one. */
1804 align
= floor_log2 (TRAMPOLINE_ALIGNMENT
/ BITS_PER_UNIT
);
1807 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1810 targetm
.asm_out
.internal_label (asm_out_file
, "LTRAMP", 0);
1811 TRAMPOLINE_TEMPLATE (asm_out_file
);
1813 /* Record the rtl to refer to it. */
1814 ASM_GENERATE_INTERNAL_LABEL (label
, "LTRAMP", 0);
1815 name
= ggc_strdup (label
);
1816 symbol
= gen_rtx_SYMBOL_REF (Pmode
, name
);
1817 SYMBOL_REF_FLAGS (symbol
) = SYMBOL_FLAG_LOCAL
;
1819 initial_trampoline
= gen_rtx_MEM (BLKmode
, symbol
);
1820 set_mem_align (initial_trampoline
, TRAMPOLINE_ALIGNMENT
);
1822 return initial_trampoline
;
1826 /* A and B are either alignments or offsets. Return the minimum alignment
1827 that may be assumed after adding the two together. */
1829 static inline unsigned
1830 min_align (unsigned int a
, unsigned int b
)
1832 return (a
| b
) & -(a
| b
);
1835 /* Return the assembler directive for creating a given kind of integer
1836 object. SIZE is the number of bytes in the object and ALIGNED_P
1837 indicates whether it is known to be aligned. Return NULL if the
1838 assembly dialect has no such directive.
1840 The returned string should be printed at the start of a new line and
1841 be followed immediately by the object's initial value. */
1844 integer_asm_op (int size
, int aligned_p
)
1846 struct asm_int_op
*ops
;
1849 ops
= &targetm
.asm_out
.aligned_op
;
1851 ops
= &targetm
.asm_out
.unaligned_op
;
1856 return targetm
.asm_out
.byte_op
;
1870 /* Use directive OP to assemble an integer object X. Print OP at the
1871 start of the line, followed immediately by the value of X. */
1874 assemble_integer_with_op (const char *op
, rtx x
)
1876 fputs (op
, asm_out_file
);
1877 output_addr_const (asm_out_file
, x
);
1878 fputc ('\n', asm_out_file
);
1881 /* The default implementation of the asm_out.integer target hook. */
1884 default_assemble_integer (rtx x ATTRIBUTE_UNUSED
,
1885 unsigned int size ATTRIBUTE_UNUSED
,
1886 int aligned_p ATTRIBUTE_UNUSED
)
1888 const char *op
= integer_asm_op (size
, aligned_p
);
1889 return op
&& (assemble_integer_with_op (op
, x
), true);
1892 /* Assemble the integer constant X into an object of SIZE bytes. ALIGN is
1893 the alignment of the integer in bits. Return 1 if we were able to output
1894 the constant, otherwise 0. If FORCE is nonzero, abort if we can't output
1898 assemble_integer (rtx x
, unsigned int size
, unsigned int align
, int force
)
1902 aligned_p
= (align
>= MIN (size
* BITS_PER_UNIT
, BIGGEST_ALIGNMENT
));
1904 /* See if the target hook can handle this kind of object. */
1905 if (targetm
.asm_out
.integer (x
, size
, aligned_p
))
1908 /* If the object is a multi-byte one, try splitting it up. Split
1909 it into words it if is multi-word, otherwise split it into bytes. */
1912 enum machine_mode omode
, imode
;
1913 unsigned int subalign
;
1914 unsigned int subsize
, i
;
1916 subsize
= size
> UNITS_PER_WORD
? UNITS_PER_WORD
: 1;
1917 subalign
= MIN (align
, subsize
* BITS_PER_UNIT
);
1918 omode
= mode_for_size (subsize
* BITS_PER_UNIT
, MODE_INT
, 0);
1919 imode
= mode_for_size (size
* BITS_PER_UNIT
, MODE_INT
, 0);
1921 for (i
= 0; i
< size
; i
+= subsize
)
1923 rtx partial
= simplify_subreg (omode
, x
, imode
, i
);
1924 if (!partial
|| !assemble_integer (partial
, subsize
, subalign
, 0))
1930 /* If we've printed some of it, but not all of it, there's no going
1943 assemble_real (REAL_VALUE_TYPE d
, enum machine_mode mode
, unsigned int align
)
1947 int bitsize
, nelts
, nunits
, units_per
;
1949 /* This is hairy. We have a quantity of known size. real_to_target
1950 will put it into an array of *host* longs, 32 bits per element
1951 (even if long is more than 32 bits). We need to determine the
1952 number of array elements that are occupied (nelts) and the number
1953 of *target* min-addressable units that will be occupied in the
1954 object file (nunits). We cannot assume that 32 divides the
1955 mode's bitsize (size * BITS_PER_UNIT) evenly.
1957 size * BITS_PER_UNIT is used here to make sure that padding bits
1958 (which might appear at either end of the value; real_to_target
1959 will include the padding bits in its output array) are included. */
1961 nunits
= GET_MODE_SIZE (mode
);
1962 bitsize
= nunits
* BITS_PER_UNIT
;
1963 nelts
= CEIL (bitsize
, 32);
1964 units_per
= 32 / BITS_PER_UNIT
;
1966 real_to_target (data
, &d
, mode
);
1968 /* Put out the first word with the specified alignment. */
1969 assemble_integer (GEN_INT (data
[0]), MIN (nunits
, units_per
), align
, 1);
1970 nunits
-= units_per
;
1972 /* Subsequent words need only 32-bit alignment. */
1973 align
= min_align (align
, 32);
1975 for (i
= 1; i
< nelts
; i
++)
1977 assemble_integer (GEN_INT (data
[i
]), MIN (nunits
, units_per
), align
, 1);
1978 nunits
-= units_per
;
1982 /* Given an expression EXP with a constant value,
1983 reduce it to the sum of an assembler symbol and an integer.
1984 Store them both in the structure *VALUE.
1985 Abort if EXP does not reduce. */
1987 struct addr_const
GTY(())
1990 HOST_WIDE_INT offset
;
1994 decode_addr_const (tree exp
, struct addr_const
*value
)
1996 tree target
= TREE_OPERAND (exp
, 0);
2002 if (TREE_CODE (target
) == COMPONENT_REF
2003 && host_integerp (byte_position (TREE_OPERAND (target
, 1)), 0))
2006 offset
+= int_byte_position (TREE_OPERAND (target
, 1));
2007 target
= TREE_OPERAND (target
, 0);
2009 else if (TREE_CODE (target
) == ARRAY_REF
2010 || TREE_CODE (target
) == ARRAY_RANGE_REF
)
2012 offset
+= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (target
)), 1)
2013 * tree_low_cst (TREE_OPERAND (target
, 1), 0));
2014 target
= TREE_OPERAND (target
, 0);
2020 switch (TREE_CODE (target
))
2024 x
= DECL_RTL (target
);
2028 x
= gen_rtx_MEM (FUNCTION_MODE
,
2029 gen_rtx_LABEL_REF (VOIDmode
, force_label_rtx (target
)));
2037 x
= output_constant_def (target
, 1);
2049 value
->offset
= offset
;
2052 /* Uniquize all constants that appear in memory.
2053 Each constant in memory thus far output is recorded
2054 in `const_desc_table'. */
2056 struct constant_descriptor_tree
GTY(())
2058 /* A MEM for the constant. */
2061 /* The value of the constant. */
2065 static GTY((param_is (struct constant_descriptor_tree
)))
2066 htab_t const_desc_htab
;
2068 static struct constant_descriptor_tree
* build_constant_desc (tree
);
2069 static void maybe_output_constant_def_contents (struct constant_descriptor_tree
*, int);
2071 /* Compute a hash code for a constant expression. */
2074 const_desc_hash (const void *ptr
)
2076 return const_hash_1 (((struct constant_descriptor_tree
*)ptr
)->value
);
2080 const_hash_1 (const tree exp
)
2085 enum tree_code code
= TREE_CODE (exp
);
2087 /* Either set P and LEN to the address and len of something to hash and
2088 exit the switch or return a value. */
2093 p
= (char *) &TREE_INT_CST (exp
);
2094 len
= sizeof TREE_INT_CST (exp
);
2098 return real_hash (TREE_REAL_CST_PTR (exp
));
2101 p
= TREE_STRING_POINTER (exp
);
2102 len
= TREE_STRING_LENGTH (exp
);
2106 return (const_hash_1 (TREE_REALPART (exp
)) * 5
2107 + const_hash_1 (TREE_IMAGPART (exp
)));
2110 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2114 len
= int_size_in_bytes (TREE_TYPE (exp
));
2116 get_set_constructor_bytes (exp
, (unsigned char *) tmp
, len
);
2124 hi
= 5 + int_size_in_bytes (TREE_TYPE (exp
));
2126 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2127 if (TREE_VALUE (link
))
2128 hi
= hi
* 603 + const_hash_1 (TREE_VALUE (link
));
2136 struct addr_const value
;
2138 decode_addr_const (exp
, &value
);
2139 if (GET_CODE (value
.base
) == SYMBOL_REF
)
2141 /* Don't hash the address of the SYMBOL_REF;
2142 only use the offset and the symbol name. */
2144 p
= XSTR (value
.base
, 0);
2145 for (i
= 0; p
[i
] != 0; i
++)
2146 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2148 else if (GET_CODE (value
.base
) == LABEL_REF
)
2149 hi
= value
.offset
+ CODE_LABEL_NUMBER (XEXP (value
.base
, 0)) * 13;
2157 return (const_hash_1 (TREE_OPERAND (exp
, 0)) * 9
2158 + const_hash_1 (TREE_OPERAND (exp
, 1)));
2162 case NON_LVALUE_EXPR
:
2163 return const_hash_1 (TREE_OPERAND (exp
, 0)) * 7 + 2;
2166 /* A language specific constant. Just hash the code. */
2170 /* Compute hashing function. */
2172 for (i
= 0; i
< len
; i
++)
2173 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2178 /* Wrapper of compare_constant, for the htab interface. */
2180 const_desc_eq (const void *p1
, const void *p2
)
2182 return compare_constant (((struct constant_descriptor_tree
*)p1
)->value
,
2183 ((struct constant_descriptor_tree
*)p2
)->value
);
2186 /* Compare t1 and t2, and return 1 only if they are known to result in
2187 the same bit pattern on output. */
2190 compare_constant (const tree t1
, const tree t2
)
2192 enum tree_code typecode
;
2194 if (t1
== NULL_TREE
)
2195 return t2
== NULL_TREE
;
2196 if (t2
== NULL_TREE
)
2199 if (TREE_CODE (t1
) != TREE_CODE (t2
))
2202 switch (TREE_CODE (t1
))
2205 /* Integer constants are the same only if the same width of type. */
2206 if (TYPE_PRECISION (TREE_TYPE (t1
)) != TYPE_PRECISION (TREE_TYPE (t2
)))
2208 return tree_int_cst_equal (t1
, t2
);
2211 /* Real constants are the same only if the same width of type. */
2212 if (TYPE_PRECISION (TREE_TYPE (t1
)) != TYPE_PRECISION (TREE_TYPE (t2
)))
2215 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
2218 if (TYPE_MODE (TREE_TYPE (t1
)) != TYPE_MODE (TREE_TYPE (t2
)))
2221 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
2222 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
2223 TREE_STRING_LENGTH (t1
)));
2226 return (compare_constant (TREE_REALPART (t1
), TREE_REALPART (t2
))
2227 && compare_constant (TREE_IMAGPART (t1
), TREE_IMAGPART (t2
)));
2230 typecode
= TREE_CODE (TREE_TYPE (t1
));
2231 if (typecode
!= TREE_CODE (TREE_TYPE (t2
)))
2234 if (typecode
== SET_TYPE
)
2236 int len
= int_size_in_bytes (TREE_TYPE (t2
));
2237 unsigned char *tmp1
, *tmp2
;
2239 if (int_size_in_bytes (TREE_TYPE (t1
)) != len
)
2242 tmp1
= alloca (len
);
2243 tmp2
= alloca (len
);
2245 if (get_set_constructor_bytes (t1
, tmp1
, len
) != NULL_TREE
)
2247 if (get_set_constructor_bytes (t2
, tmp2
, len
) != NULL_TREE
)
2250 return memcmp (tmp1
, tmp2
, len
) == 0;
2256 if (typecode
== ARRAY_TYPE
)
2258 HOST_WIDE_INT size_1
= int_size_in_bytes (TREE_TYPE (t1
));
2259 /* For arrays, check that the sizes all match. */
2260 if (TYPE_MODE (TREE_TYPE (t1
)) != TYPE_MODE (TREE_TYPE (t2
))
2262 || size_1
!= int_size_in_bytes (TREE_TYPE (t2
)))
2267 /* For record and union constructors, require exact type
2269 if (TREE_TYPE (t1
) != TREE_TYPE (t2
))
2273 for (l1
= CONSTRUCTOR_ELTS (t1
), l2
= CONSTRUCTOR_ELTS (t2
);
2275 l1
= TREE_CHAIN (l1
), l2
= TREE_CHAIN (l2
))
2277 /* Check that each value is the same... */
2278 if (! compare_constant (TREE_VALUE (l1
), TREE_VALUE (l2
)))
2280 /* ... and that they apply to the same fields! */
2281 if (typecode
== ARRAY_TYPE
)
2283 if (! compare_constant (TREE_PURPOSE (l1
),
2289 if (TREE_PURPOSE (l1
) != TREE_PURPOSE (l2
))
2294 return l1
== NULL_TREE
&& l2
== NULL_TREE
;
2300 struct addr_const value1
, value2
;
2302 decode_addr_const (t1
, &value1
);
2303 decode_addr_const (t2
, &value2
);
2304 return (value1
.offset
== value2
.offset
2305 && strcmp (XSTR (value1
.base
, 0), XSTR (value2
.base
, 0)) == 0);
2311 return (compare_constant (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0))
2312 && compare_constant(TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1)));
2316 case NON_LVALUE_EXPR
:
2317 case VIEW_CONVERT_EXPR
:
2318 return compare_constant (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
2323 nt1
= lang_hooks
.expand_constant (t1
);
2324 nt2
= lang_hooks
.expand_constant (t2
);
2325 if (nt1
!= t1
|| nt2
!= t2
)
2326 return compare_constant (nt1
, nt2
);
2332 /* Should not get here. */
2336 /* Make a copy of the whole tree structure for a constant. This
2337 handles the same types of nodes that compare_constant handles. */
2340 copy_constant (tree exp
)
2342 switch (TREE_CODE (exp
))
2345 /* For ADDR_EXPR, we do not want to copy the decl whose address
2346 is requested. We do want to copy constants though. */
2347 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, 0))) == 'c')
2348 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2349 copy_constant (TREE_OPERAND (exp
, 0)));
2351 return copy_node (exp
);
2356 return copy_node (exp
);
2359 return build_complex (TREE_TYPE (exp
),
2360 copy_constant (TREE_REALPART (exp
)),
2361 copy_constant (TREE_IMAGPART (exp
)));
2365 return build (TREE_CODE (exp
), TREE_TYPE (exp
),
2366 copy_constant (TREE_OPERAND (exp
, 0)),
2367 copy_constant (TREE_OPERAND (exp
, 1)));
2371 case NON_LVALUE_EXPR
:
2372 case VIEW_CONVERT_EXPR
:
2373 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2374 copy_constant (TREE_OPERAND (exp
, 0)));
2378 tree copy
= copy_node (exp
);
2379 tree list
= copy_list (CONSTRUCTOR_ELTS (exp
));
2382 CONSTRUCTOR_ELTS (copy
) = list
;
2383 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
2384 TREE_VALUE (tail
) = copy_constant (TREE_VALUE (tail
));
2385 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2386 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
2387 TREE_PURPOSE (tail
) = copy_constant (TREE_PURPOSE (tail
));
2395 t
= lang_hooks
.expand_constant (exp
);
2397 return copy_constant (t
);
2404 /* Subroutine of output_constant_def:
2405 No constant equal to EXP is known to have been output.
2406 Make a constant descriptor to enter EXP in the hash table.
2407 Assign the label number and construct RTL to refer to the
2408 constant's location in memory.
2409 Caller is responsible for updating the hash table. */
2411 static struct constant_descriptor_tree
*
2412 build_constant_desc (tree exp
)
2418 struct constant_descriptor_tree
*desc
;
2420 desc
= ggc_alloc (sizeof (*desc
));
2421 desc
->value
= copy_constant (exp
);
2423 /* Propagate marked-ness to copied constant. */
2424 if (flag_mudflap
&& mf_marked_p (exp
))
2425 mf_mark (desc
->value
);
2427 /* Create a string containing the label name, in LABEL. */
2428 labelno
= const_labelno
++;
2429 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", labelno
);
2431 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
2432 symbol
= gen_rtx_SYMBOL_REF (Pmode
, ggc_strdup (label
));
2433 SYMBOL_REF_FLAGS (symbol
) = SYMBOL_FLAG_LOCAL
;
2434 SYMBOL_REF_DECL (symbol
) = desc
->value
;
2435 TREE_CONSTANT_POOL_ADDRESS_P (symbol
) = 1;
2437 rtl
= gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp
)), symbol
);
2438 set_mem_attributes (rtl
, exp
, 1);
2439 set_mem_alias_set (rtl
, 0);
2440 set_mem_alias_set (rtl
, const_alias_set
);
2442 /* Set flags or add text to the name to record information, such as
2443 that it is a local symbol. If the name is changed, the macro
2444 ASM_OUTPUT_LABELREF will have to know how to strip this
2445 information. This call might invalidate our local variable
2446 SYMBOL; we can't use it afterward. */
2448 targetm
.encode_section_info (exp
, rtl
, true);
2455 /* Return an rtx representing a reference to constant data in memory
2456 for the constant expression EXP.
2458 If assembler code for such a constant has already been output,
2459 return an rtx to refer to it.
2460 Otherwise, output such a constant in memory
2461 and generate an rtx for it.
2463 If DEFER is nonzero, this constant can be deferred and output only
2464 if referenced in the function after all optimizations.
2466 `const_desc_table' records which constants already have label strings. */
2469 output_constant_def (tree exp
, int defer
)
2471 struct constant_descriptor_tree
*desc
;
2472 struct constant_descriptor_tree key
;
2475 /* Look up EXP in the table of constant descriptors. If we didn't find
2476 it, create a new one. */
2478 loc
= htab_find_slot (const_desc_htab
, &key
, INSERT
);
2483 desc
= build_constant_desc (exp
);
2487 maybe_output_constant_def_contents (desc
, defer
);
2491 /* Subroutine of output_constant_def: Decide whether or not we need to
2492 output the constant DESC now, and if so, do it. */
2494 maybe_output_constant_def_contents (struct constant_descriptor_tree
*desc
,
2497 rtx symbol
= XEXP (desc
->rtl
, 0);
2498 tree exp
= desc
->value
;
2500 if (flag_syntax_only
)
2503 if (TREE_ASM_WRITTEN (exp
))
2504 /* Already output; don't do it again. */
2507 /* We can always defer constants as long as the context allows
2511 /* Increment n_deferred_constants if it exists. It needs to be at
2512 least as large as the number of constants actually referred to
2513 by the function. If it's too small we'll stop looking too early
2514 and fail to emit constants; if it's too large we'll only look
2515 through the entire function when we could have stopped earlier. */
2517 n_deferred_constants
++;
2521 output_constant_def_contents (symbol
);
2524 /* We must output the constant data referred to by SYMBOL; do so. */
2527 output_constant_def_contents (rtx symbol
)
2529 tree exp
= SYMBOL_REF_DECL (symbol
);
2530 const char *label
= XSTR (symbol
, 0);
2533 /* Make sure any other constants whose addresses appear in EXP
2534 are assigned label numbers. */
2535 int reloc
= compute_reloc_for_constant (exp
);
2537 /* Align the location counter as required by EXP's data type. */
2538 int align
= TYPE_ALIGN (TREE_TYPE (exp
));
2539 #ifdef CONSTANT_ALIGNMENT
2540 align
= CONSTANT_ALIGNMENT (exp
, align
);
2543 output_addressed_constants (exp
);
2545 /* We are no longer deferring this constant. */
2546 TREE_ASM_WRITTEN (exp
) = 1;
2548 if (IN_NAMED_SECTION (exp
))
2549 named_section (exp
, NULL
, reloc
);
2551 targetm
.asm_out
.select_section (exp
, reloc
, align
);
2553 if (align
> BITS_PER_UNIT
)
2555 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
2558 size
= int_size_in_bytes (TREE_TYPE (exp
));
2559 if (TREE_CODE (exp
) == STRING_CST
)
2560 size
= MAX (TREE_STRING_LENGTH (exp
), size
);
2562 /* Do any machine/system dependent processing of the constant. */
2563 #ifdef ASM_DECLARE_CONSTANT_NAME
2564 ASM_DECLARE_CONSTANT_NAME (asm_out_file
, label
, exp
, size
);
2566 /* Standard thing is just output label for the constant. */
2567 ASM_OUTPUT_LABEL (asm_out_file
, label
);
2568 #endif /* ASM_DECLARE_CONSTANT_NAME */
2570 /* Output the value of EXP. */
2571 output_constant (exp
, size
, align
);
2573 mudflap_enqueue_constant (exp
);
2576 /* Look up EXP in the table of constant descriptors. Return the rtl
2577 if it has been emitted, else null. */
2580 lookup_constant_def (tree exp
)
2582 struct constant_descriptor_tree
*desc
;
2583 struct constant_descriptor_tree key
;
2586 desc
= htab_find (const_desc_htab
, &key
);
2588 return (desc
? desc
->rtl
: NULL_RTX
);
2591 /* Used in the hash tables to avoid outputting the same constant
2592 twice. Unlike 'struct constant_descriptor_tree', RTX constants
2593 are output once per function, not once per file. */
2594 /* ??? Only a few targets need per-function constant pools. Most
2595 can use one per-file pool. Should add a targetm bit to tell the
2598 struct rtx_constant_pool
GTY(())
2600 /* Pointers to first and last constant in pool, as ordered by offset. */
2601 struct constant_descriptor_rtx
*first
;
2602 struct constant_descriptor_rtx
*last
;
2604 /* Hash facility for making memory-constants from constant rtl-expressions.
2605 It is used on RISC machines where immediate integer arguments and
2606 constant addresses are restricted so that such constants must be stored
2608 htab_t
GTY((param_is (struct constant_descriptor_rtx
))) const_rtx_htab
;
2609 htab_t
GTY((param_is (struct constant_descriptor_rtx
))) const_rtx_sym_htab
;
2611 /* Current offset in constant pool (does not include any
2612 machine-specific header). */
2613 HOST_WIDE_INT offset
;
2616 struct constant_descriptor_rtx
GTY((chain_next ("%h.next")))
2618 struct constant_descriptor_rtx
*next
;
2622 HOST_WIDE_INT offset
;
2624 enum machine_mode mode
;
2630 /* Hash and compare functions for const_rtx_htab. */
2633 const_desc_rtx_hash (const void *ptr
)
2635 const struct constant_descriptor_rtx
*desc
= ptr
;
2640 const_desc_rtx_eq (const void *a
, const void *b
)
2642 const struct constant_descriptor_rtx
*x
= a
;
2643 const struct constant_descriptor_rtx
*y
= b
;
2645 if (x
->mode
!= y
->mode
)
2647 return rtx_equal_p (x
->constant
, y
->constant
);
2650 /* Hash and compare functions for const_rtx_sym_htab. */
2653 const_desc_rtx_sym_hash (const void *ptr
)
2655 const struct constant_descriptor_rtx
*desc
= ptr
;
2656 return htab_hash_string (XSTR (desc
->sym
, 0));
2660 const_desc_rtx_sym_eq (const void *a
, const void *b
)
2662 const struct constant_descriptor_rtx
*x
= a
;
2663 const struct constant_descriptor_rtx
*y
= b
;
2664 return XSTR (x
->sym
, 0) == XSTR (y
->sym
, 0);
2667 /* This is the worker function for const_rtx_hash, called via for_each_rtx. */
2670 const_rtx_hash_1 (rtx
*xp
, void *data
)
2672 unsigned HOST_WIDE_INT hwi
;
2673 enum machine_mode mode
;
2679 code
= GET_CODE (x
);
2680 mode
= GET_MODE (x
);
2681 h
= (hashval_t
) code
* 1048573 + mode
;
2689 const int shift
= sizeof (hashval_t
) * CHAR_BIT
;
2690 const int n
= sizeof (HOST_WIDE_INT
) / sizeof (hashval_t
);
2693 h
^= (hashval_t
) hwi
;
2694 for (i
= 1; i
< n
; ++i
)
2697 h
^= (hashval_t
) hwi
;
2703 if (mode
== VOIDmode
)
2705 hwi
= CONST_DOUBLE_LOW (x
) ^ CONST_DOUBLE_HIGH (x
);
2709 h
^= real_hash (CONST_DOUBLE_REAL_VALUE (x
));
2713 h
^= htab_hash_string (XSTR (x
, 0));
2717 h
= h
* 251 + CODE_LABEL_NUMBER (XEXP (x
, 0));
2721 case UNSPEC_VOLATILE
:
2722 h
= h
* 251 + XINT (x
, 1);
2730 *hp
= *hp
* 509 + h
;
2734 /* Compute a hash value for X, which should be a constant. */
2737 const_rtx_hash (rtx x
)
2740 for_each_rtx (&x
, const_rtx_hash_1
, &h
);
2745 /* Initialize constant pool hashing for a new function. */
2748 init_varasm_status (struct function
*f
)
2750 struct varasm_status
*p
;
2751 struct rtx_constant_pool
*pool
;
2753 p
= ggc_alloc (sizeof (struct varasm_status
));
2756 pool
= ggc_alloc (sizeof (struct rtx_constant_pool
));
2758 p
->deferred_constants
= 0;
2760 pool
->const_rtx_htab
= htab_create_ggc (31, const_desc_rtx_hash
,
2761 const_desc_rtx_eq
, NULL
);
2762 pool
->const_rtx_sym_htab
= htab_create_ggc (31, const_desc_rtx_sym_hash
,
2763 const_desc_rtx_sym_eq
, NULL
);
2764 pool
->first
= pool
->last
= NULL
;
2768 /* Given a MINUS expression, simplify it if both sides
2769 include the same symbol. */
2772 simplify_subtraction (rtx x
)
2774 rtx r
= simplify_rtx (x
);
2778 /* Given a constant rtx X, make (or find) a memory constant for its value
2779 and return a MEM rtx to refer to it in memory. */
2782 force_const_mem (enum machine_mode mode
, rtx x
)
2784 struct constant_descriptor_rtx
*desc
, tmp
;
2785 struct rtx_constant_pool
*pool
= cfun
->varasm
->pool
;
2792 /* If we're not allowed to drop X into the constant pool, don't. */
2793 if (targetm
.cannot_force_const_mem (x
))
2796 /* Lookup the value in the hashtable. */
2799 hash
= const_rtx_hash (x
);
2800 slot
= htab_find_slot_with_hash (pool
->const_rtx_htab
, &tmp
, hash
, INSERT
);
2803 /* If the constant was already present, return its memory. */
2805 return copy_rtx (desc
->mem
);
2807 /* Otherwise, create a new descriptor. */
2808 desc
= ggc_alloc (sizeof (*desc
));
2811 /* Align the location counter as required by EXP's data type. */
2812 align
= GET_MODE_ALIGNMENT (mode
== VOIDmode
? word_mode
: mode
);
2813 #ifdef CONSTANT_ALIGNMENT
2815 tree type
= lang_hooks
.types
.type_for_mode (mode
, 0);
2816 if (type
!= NULL_TREE
)
2817 align
= CONSTANT_ALIGNMENT (make_tree (type
, x
), align
);
2821 pool
->offset
+= (align
/ BITS_PER_UNIT
) - 1;
2822 pool
->offset
&= ~ ((align
/ BITS_PER_UNIT
) - 1);
2825 desc
->constant
= tmp
.constant
;
2826 desc
->offset
= pool
->offset
;
2829 desc
->align
= align
;
2830 desc
->labelno
= const_labelno
;
2833 pool
->offset
+= GET_MODE_SIZE (mode
);
2835 pool
->last
->next
= desc
;
2837 pool
->first
= pool
->last
= desc
;
2840 /* Create a string containing the label name, in LABEL. */
2841 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
2844 /* Construct the SYMBOL_REF. Make sure to mark it as belonging to
2845 the constants pool. */
2846 desc
->sym
= symbol
= gen_rtx_SYMBOL_REF (Pmode
, ggc_strdup (label
));
2847 SYMBOL_REF_FLAGS (symbol
) = SYMBOL_FLAG_LOCAL
;
2848 CONSTANT_POOL_ADDRESS_P (symbol
) = 1;
2849 current_function_uses_const_pool
= 1;
2851 /* Insert the descriptor into the symbol cross-reference table too. */
2852 slot
= htab_find_slot (pool
->const_rtx_sym_htab
, desc
, INSERT
);
2857 /* Construct the MEM. */
2858 desc
->mem
= def
= gen_rtx_MEM (mode
, symbol
);
2859 set_mem_attributes (def
, lang_hooks
.types
.type_for_mode (mode
, 0), 1);
2860 RTX_UNCHANGING_P (def
) = 1;
2862 /* If we're dropping a label to the constant pool, make sure we
2864 if (GET_CODE (x
) == LABEL_REF
)
2865 LABEL_PRESERVE_P (XEXP (x
, 0)) = 1;
2867 return copy_rtx (def
);
2870 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
2871 the corresponding constant_descriptor_rtx structure. */
2873 static struct constant_descriptor_rtx
*
2874 find_pool_constant (struct rtx_constant_pool
*pool
, rtx sym
)
2876 struct constant_descriptor_rtx tmp
;
2878 return htab_find (pool
->const_rtx_sym_htab
, &tmp
);
2881 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
2884 get_pool_constant (rtx addr
)
2886 return find_pool_constant (cfun
->varasm
->pool
, addr
)->constant
;
2889 /* Given a constant pool SYMBOL_REF, return the corresponding constant
2890 and whether it has been output or not. */
2893 get_pool_constant_mark (rtx addr
, bool *pmarked
)
2895 struct constant_descriptor_rtx
*desc
;
2897 desc
= find_pool_constant (cfun
->varasm
->pool
, addr
);
2898 *pmarked
= (desc
->mark
!= 0);
2899 return desc
->constant
;
2902 /* Likewise, but for the constant pool of a specific function. */
2905 get_pool_constant_for_function (struct function
*f
, rtx addr
)
2907 return find_pool_constant (f
->varasm
->pool
, addr
)->constant
;
2910 /* Similar, return the mode. */
2913 get_pool_mode (rtx addr
)
2915 return find_pool_constant (cfun
->varasm
->pool
, addr
)->mode
;
2919 get_pool_mode_for_function (struct function
*f
, rtx addr
)
2921 return find_pool_constant (f
->varasm
->pool
, addr
)->mode
;
2924 /* Similar, return the offset in the constant pool. */
2927 get_pool_offset (rtx addr
)
2929 return find_pool_constant (cfun
->varasm
->pool
, addr
)->offset
;
2932 /* Return the size of the constant pool. */
2935 get_pool_size (void)
2937 return cfun
->varasm
->pool
->offset
;
2940 /* Worker function for output_constant_pool_1. Emit assembly for X
2941 in MODE with known alignment ALIGN. */
2944 output_constant_pool_2 (enum machine_mode mode
, rtx x
, unsigned int align
)
2946 switch (GET_MODE_CLASS (mode
))
2949 if (GET_CODE (x
) != CONST_DOUBLE
)
2954 REAL_VALUE_FROM_CONST_DOUBLE (r
, x
);
2955 assemble_real (r
, mode
, align
);
2960 case MODE_PARTIAL_INT
:
2961 assemble_integer (x
, GET_MODE_SIZE (mode
), align
, 1);
2964 case MODE_VECTOR_FLOAT
:
2965 case MODE_VECTOR_INT
:
2968 enum machine_mode submode
= GET_MODE_INNER (mode
);
2969 unsigned int subalign
= MIN (align
, GET_MODE_BITSIZE (submode
));
2971 if (GET_CODE (x
) != CONST_VECTOR
)
2973 units
= CONST_VECTOR_NUNITS (x
);
2975 for (i
= 0; i
< units
; i
++)
2977 rtx elt
= CONST_VECTOR_ELT (x
, i
);
2978 output_constant_pool_2 (submode
, elt
, i
? subalign
: align
);
2988 /* Worker function for output_constant_pool. Emit POOL. */
2991 output_constant_pool_1 (struct constant_descriptor_rtx
*desc
)
2999 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3000 whose CODE_LABEL has been deleted. This can occur if a jump table
3001 is eliminated by optimization. If so, write a constant of zero
3002 instead. Note that this can also happen by turning the
3003 CODE_LABEL into a NOTE. */
3004 /* ??? This seems completely and utterly wrong. Certainly it's
3005 not true for NOTE_INSN_DELETED_LABEL, but I disbelieve proper
3006 functioning even with INSN_DELETED_P and friends. */
3009 switch (GET_CODE (x
))
3012 if (GET_CODE (XEXP (x
, 0)) != PLUS
3013 || GET_CODE (XEXP (XEXP (x
, 0), 0)) != LABEL_REF
)
3015 tmp
= XEXP (XEXP (x
, 0), 0);
3020 if (INSN_DELETED_P (tmp
)
3021 || (GET_CODE (tmp
) == NOTE
3022 && NOTE_LINE_NUMBER (tmp
) == NOTE_INSN_DELETED
))
3033 /* First switch to correct section. */
3034 targetm
.asm_out
.select_rtx_section (desc
->mode
, x
, desc
->align
);
3036 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3037 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file
, x
, desc
->mode
,
3038 desc
->align
, desc
->labelno
, done
);
3041 assemble_align (desc
->align
);
3043 /* Output the label. */
3044 targetm
.asm_out
.internal_label (asm_out_file
, "LC", desc
->labelno
);
3046 /* Output the data. */
3047 output_constant_pool_2 (desc
->mode
, x
, desc
->align
);
3049 /* Make sure all constants in SECTION_MERGE and not SECTION_STRINGS
3050 sections have proper size. */
3051 if (desc
->align
> GET_MODE_BITSIZE (desc
->mode
)
3052 && in_section
== in_named
3053 && get_named_section_flags (in_named_name
) & SECTION_MERGE
)
3054 assemble_align (desc
->align
);
3056 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3062 /* Given a SYMBOL_REF CURRENT_RTX, mark it and all constants it refers
3063 to as used. Emit referenced deferred strings. This function can
3064 be used with for_each_rtx to mark all SYMBOL_REFs in an rtx. */
3067 mark_constant (rtx
*current_rtx
, void *data
)
3069 struct rtx_constant_pool
*pool
= data
;
3070 rtx x
= *current_rtx
;
3072 if (x
== NULL_RTX
|| GET_CODE (x
) != SYMBOL_REF
)
3075 if (CONSTANT_POOL_ADDRESS_P (x
))
3077 struct constant_descriptor_rtx
*desc
= find_pool_constant (pool
, x
);
3078 if (desc
->mark
== 0)
3081 for_each_rtx (&desc
->constant
, mark_constant
, pool
);
3084 else if (TREE_CONSTANT_POOL_ADDRESS_P (x
))
3086 tree exp
= SYMBOL_REF_DECL (x
);
3087 if (!TREE_ASM_WRITTEN (exp
))
3089 n_deferred_constants
--;
3090 output_constant_def_contents (x
);
3097 /* Look through appropriate parts of INSN, marking all entries in the
3098 constant pool which are actually being used. Entries that are only
3099 referenced by other constants are also marked as used. Emit
3100 deferred strings that are used. */
3103 mark_constants (struct rtx_constant_pool
*pool
, rtx insn
)
3108 /* Insns may appear inside a SEQUENCE. Only check the patterns of
3109 insns, not any notes that may be attached. We don't want to mark
3110 a constant just because it happens to appear in a REG_EQUIV note. */
3111 if (GET_CODE (PATTERN (insn
)) == SEQUENCE
)
3113 rtx seq
= PATTERN (insn
);
3114 int i
, n
= XVECLEN (seq
, 0);
3115 for (i
= 0; i
< n
; ++i
)
3117 rtx subinsn
= XVECEXP (seq
, 0, i
);
3118 if (INSN_P (subinsn
))
3119 for_each_rtx (&PATTERN (subinsn
), mark_constant
, pool
);
3123 for_each_rtx (&PATTERN (insn
), mark_constant
, pool
);
3126 /* Look through the instructions for this function, and mark all the
3127 entries in POOL which are actually being used. Emit deferred constants
3128 which have indeed been used. */
3131 mark_constant_pool (struct rtx_constant_pool
*pool
)
3135 if (pool
->first
== 0 && n_deferred_constants
== 0)
3138 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
3139 mark_constants (pool
, insn
);
3141 for (link
= current_function_epilogue_delay_list
;
3143 link
= XEXP (link
, 1))
3144 mark_constants (pool
, XEXP (link
, 0));
3147 /* Write all the constants in the constant pool. */
3150 output_constant_pool (const char *fnname ATTRIBUTE_UNUSED
,
3151 tree fndecl ATTRIBUTE_UNUSED
)
3153 struct rtx_constant_pool
*pool
= cfun
->varasm
->pool
;
3154 struct constant_descriptor_rtx
*desc
;
3156 /* It is possible for gcc to call force_const_mem and then to later
3157 discard the instructions which refer to the constant. In such a
3158 case we do not need to output the constant. */
3159 mark_constant_pool (pool
);
3161 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3162 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file
, fnname
, fndecl
, pool
->offset
);
3165 for (desc
= pool
->first
; desc
; desc
= desc
->next
)
3166 output_constant_pool_1 (desc
);
3168 #ifdef ASM_OUTPUT_POOL_EPILOGUE
3169 ASM_OUTPUT_POOL_EPILOGUE (asm_out_file
, fnname
, fndecl
, pool
->offset
);
3173 /* Determine what kind of relocations EXP may need. */
3176 compute_reloc_for_constant (tree exp
)
3178 int reloc
= 0, reloc2
;
3181 /* Give the front-end a chance to convert VALUE to something that
3182 looks more like a constant to the back-end. */
3183 exp
= lang_hooks
.expand_constant (exp
);
3185 switch (TREE_CODE (exp
))
3189 /* Go inside any operations that get_inner_reference can handle and see
3190 if what's inside is a constant: no need to do anything here for
3191 addresses of variables or functions. */
3192 for (tem
= TREE_OPERAND (exp
, 0); handled_component_p (tem
);
3193 tem
= TREE_OPERAND (tem
, 0))
3196 if (TREE_PUBLIC (tem
))
3203 reloc
= compute_reloc_for_constant (TREE_OPERAND (exp
, 0));
3204 reloc
|= compute_reloc_for_constant (TREE_OPERAND (exp
, 1));
3208 reloc
= compute_reloc_for_constant (TREE_OPERAND (exp
, 0));
3209 reloc2
= compute_reloc_for_constant (TREE_OPERAND (exp
, 1));
3210 /* The difference of two local labels is computable at link time. */
3211 if (reloc
== 1 && reloc2
== 1)
3219 case NON_LVALUE_EXPR
:
3220 reloc
= compute_reloc_for_constant (TREE_OPERAND (exp
, 0));
3224 for (tem
= CONSTRUCTOR_ELTS (exp
); tem
; tem
= TREE_CHAIN (tem
))
3225 if (TREE_VALUE (tem
) != 0)
3226 reloc
|= compute_reloc_for_constant (TREE_VALUE (tem
));
3236 /* Find all the constants whose addresses are referenced inside of EXP,
3237 and make sure assembler code with a label has been output for each one.
3238 Indicate whether an ADDR_EXPR has been encountered. */
3241 output_addressed_constants (tree exp
)
3245 /* Give the front-end a chance to convert VALUE to something that
3246 looks more like a constant to the back-end. */
3247 exp
= lang_hooks
.expand_constant (exp
);
3249 switch (TREE_CODE (exp
))
3253 /* Go inside any operations that get_inner_reference can handle and see
3254 if what's inside is a constant: no need to do anything here for
3255 addresses of variables or functions. */
3256 for (tem
= TREE_OPERAND (exp
, 0); handled_component_p (tem
);
3257 tem
= TREE_OPERAND (tem
, 0))
3260 if (TREE_CODE_CLASS (TREE_CODE (tem
)) == 'c'
3261 || TREE_CODE (tem
) == CONSTRUCTOR
)
3262 output_constant_def (tem
, 0);
3267 output_addressed_constants (TREE_OPERAND (exp
, 1));
3272 case NON_LVALUE_EXPR
:
3273 output_addressed_constants (TREE_OPERAND (exp
, 0));
3277 for (tem
= CONSTRUCTOR_ELTS (exp
); tem
; tem
= TREE_CHAIN (tem
))
3278 if (TREE_VALUE (tem
) != 0)
3279 output_addressed_constants (TREE_VALUE (tem
));
3288 /* Return nonzero if VALUE is a valid constant-valued expression
3289 for use in initializing a static variable; one that can be an
3290 element of a "constant" initializer.
3292 Return null_pointer_node if the value is absolute;
3293 if it is relocatable, return the variable that determines the relocation.
3294 We assume that VALUE has been folded as much as possible;
3295 therefore, we do not need to check for such things as
3296 arithmetic-combinations of integers. */
3299 initializer_constant_valid_p (tree value
, tree endtype
)
3301 /* Give the front-end a chance to convert VALUE to something that
3302 looks more like a constant to the back-end. */
3303 value
= lang_hooks
.expand_constant (value
);
3305 switch (TREE_CODE (value
))
3308 if ((TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
3309 || TREE_CODE (TREE_TYPE (value
)) == RECORD_TYPE
)
3310 && TREE_CONSTANT (value
)
3311 && CONSTRUCTOR_ELTS (value
))
3314 bool absolute
= true;
3316 for (elt
= CONSTRUCTOR_ELTS (value
); elt
; elt
= TREE_CHAIN (elt
))
3319 value
= TREE_VALUE (elt
);
3320 reloc
= initializer_constant_valid_p (value
, TREE_TYPE (value
));
3323 if (reloc
!= null_pointer_node
)
3326 /* For a non-absolute relocation, there is no single
3327 variable that can be "the variable that determines the
3329 return absolute
? null_pointer_node
: error_mark_node
;
3332 return TREE_STATIC (value
) ? null_pointer_node
: NULL_TREE
;
3339 return null_pointer_node
;
3343 return staticp (TREE_OPERAND (value
, 0)) ? TREE_OPERAND (value
, 0) : 0;
3345 case VIEW_CONVERT_EXPR
:
3346 case NON_LVALUE_EXPR
:
3347 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3351 /* Allow conversions between pointer types. */
3352 if (POINTER_TYPE_P (TREE_TYPE (value
))
3353 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3354 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3356 /* Allow conversions between real types. */
3357 if (FLOAT_TYPE_P (TREE_TYPE (value
))
3358 && FLOAT_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3359 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3361 /* Allow length-preserving conversions between integer types. */
3362 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
3363 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
3364 && (TYPE_PRECISION (TREE_TYPE (value
))
3365 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
3366 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3368 /* Allow conversions between other integer types only if
3370 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
3371 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3373 tree inner
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3375 if (inner
== null_pointer_node
)
3376 return null_pointer_node
;
3380 /* Allow (int) &foo provided int is as wide as a pointer. */
3381 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
3382 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
3383 && (TYPE_PRECISION (TREE_TYPE (value
))
3384 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
3385 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3388 /* Likewise conversions from int to pointers, but also allow
3389 conversions from 0. */
3390 if ((POINTER_TYPE_P (TREE_TYPE (value
))
3391 || TREE_CODE (TREE_TYPE (value
)) == OFFSET_TYPE
)
3392 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3394 if (integer_zerop (TREE_OPERAND (value
, 0)))
3395 return null_pointer_node
;
3396 else if (TYPE_PRECISION (TREE_TYPE (value
))
3397 <= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0))))
3398 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3402 /* Allow conversions to struct or union types if the value
3404 if (TREE_CODE (TREE_TYPE (value
)) == RECORD_TYPE
3405 || TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
)
3406 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3411 if (! INTEGRAL_TYPE_P (endtype
)
3412 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
3414 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3416 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
3418 /* If either term is absolute, use the other terms relocation. */
3419 if (valid0
== null_pointer_node
)
3421 if (valid1
== null_pointer_node
)
3427 if (! INTEGRAL_TYPE_P (endtype
)
3428 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
3430 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3432 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
3434 /* Win if second argument is absolute. */
3435 if (valid1
== null_pointer_node
)
3437 /* Win if both arguments have the same relocation.
3438 Then the value is absolute. */
3439 if (valid0
== valid1
&& valid0
!= 0)
3440 return null_pointer_node
;
3442 /* Since GCC guarantees that string constants are unique in the
3443 generated code, a subtraction between two copies of the same
3444 constant string is absolute. */
3445 if (valid0
&& TREE_CODE (valid0
) == STRING_CST
&&
3446 valid1
&& TREE_CODE (valid1
) == STRING_CST
&&
3447 TREE_STRING_POINTER (valid0
) == TREE_STRING_POINTER (valid1
))
3448 return null_pointer_node
;
3451 /* Support differences between labels. */
3452 if (INTEGRAL_TYPE_P (endtype
))
3455 op0
= TREE_OPERAND (value
, 0);
3456 op1
= TREE_OPERAND (value
, 1);
3458 /* Like STRIP_NOPS except allow the operand mode to widen.
3459 This works around a feature of fold that simplifies
3460 (int)(p1 - p2) to ((int)p1 - (int)p2) under the theory
3461 that the narrower operation is cheaper. */
3463 while (TREE_CODE (op0
) == NOP_EXPR
3464 || TREE_CODE (op0
) == CONVERT_EXPR
3465 || TREE_CODE (op0
) == NON_LVALUE_EXPR
)
3467 tree inner
= TREE_OPERAND (op0
, 0);
3468 if (inner
== error_mark_node
3469 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner
)))
3470 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op0
)))
3471 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner
)))))
3476 while (TREE_CODE (op1
) == NOP_EXPR
3477 || TREE_CODE (op1
) == CONVERT_EXPR
3478 || TREE_CODE (op1
) == NON_LVALUE_EXPR
)
3480 tree inner
= TREE_OPERAND (op1
, 0);
3481 if (inner
== error_mark_node
3482 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner
)))
3483 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op1
)))
3484 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner
)))))
3489 if (TREE_CODE (op0
) == ADDR_EXPR
3490 && TREE_CODE (TREE_OPERAND (op0
, 0)) == LABEL_DECL
3491 && TREE_CODE (op1
) == ADDR_EXPR
3492 && TREE_CODE (TREE_OPERAND (op1
, 0)) == LABEL_DECL
)
3493 return null_pointer_node
;
3504 /* Output assembler code for constant EXP to FILE, with no label.
3505 This includes the pseudo-op such as ".int" or ".byte", and a newline.
3506 Assumes output_addressed_constants has been done on EXP already.
3508 Generate exactly SIZE bytes of assembler data, padding at the end
3509 with zeros if necessary. SIZE must always be specified.
3511 SIZE is important for structure constructors,
3512 since trailing members may have been omitted from the constructor.
3513 It is also important for initialization of arrays from string constants
3514 since the full length of the string constant might not be wanted.
3515 It is also needed for initialization of unions, where the initializer's
3516 type is just one member, and that may not be as long as the union.
3518 There a case in which we would fail to output exactly SIZE bytes:
3519 for a structure constructor that wants to produce more than SIZE bytes.
3520 But such constructors will never be generated for any possible input.
3522 ALIGN is the alignment of the data in bits. */
3525 output_constant (tree exp
, unsigned HOST_WIDE_INT size
, unsigned int align
)
3527 enum tree_code code
;
3528 unsigned HOST_WIDE_INT thissize
;
3530 /* Some front-ends use constants other than the standard language-independent
3531 varieties, but which may still be output directly. Give the front-end a
3532 chance to convert EXP to a language-independent representation. */
3533 exp
= lang_hooks
.expand_constant (exp
);
3535 if (size
== 0 || flag_syntax_only
)
3538 /* Eliminate any conversions since we'll be outputting the underlying
3540 while (TREE_CODE (exp
) == NOP_EXPR
|| TREE_CODE (exp
) == CONVERT_EXPR
3541 || TREE_CODE (exp
) == NON_LVALUE_EXPR
3542 || TREE_CODE (exp
) == VIEW_CONVERT_EXPR
)
3543 exp
= TREE_OPERAND (exp
, 0);
3545 code
= TREE_CODE (TREE_TYPE (exp
));
3546 thissize
= int_size_in_bytes (TREE_TYPE (exp
));
3548 /* Allow a constructor with no elements for any data type.
3549 This means to fill the space with zeros. */
3550 if (TREE_CODE (exp
) == CONSTRUCTOR
&& CONSTRUCTOR_ELTS (exp
) == 0)
3552 assemble_zeros (size
);
3556 if (TREE_CODE (exp
) == FDESC_EXPR
)
3558 #ifdef ASM_OUTPUT_FDESC
3559 HOST_WIDE_INT part
= tree_low_cst (TREE_OPERAND (exp
, 1), 0);
3560 tree decl
= TREE_OPERAND (exp
, 0);
3561 ASM_OUTPUT_FDESC (asm_out_file
, decl
, part
);
3568 /* Now output the underlying data. If we've handling the padding, return.
3569 Otherwise, break and ensure SIZE is the size written. */
3577 case REFERENCE_TYPE
:
3579 if (! assemble_integer (expand_expr (exp
, NULL_RTX
, VOIDmode
,
3580 EXPAND_INITIALIZER
),
3581 MIN (size
, thissize
), align
, 0))
3582 error ("initializer for integer value is too complicated");
3586 if (TREE_CODE (exp
) != REAL_CST
)
3587 error ("initializer for floating value is not a floating constant");
3589 assemble_real (TREE_REAL_CST (exp
), TYPE_MODE (TREE_TYPE (exp
)), align
);
3593 output_constant (TREE_REALPART (exp
), thissize
/ 2, align
);
3594 output_constant (TREE_IMAGPART (exp
), thissize
/ 2,
3595 min_align (align
, BITS_PER_UNIT
* (thissize
/ 2)));
3600 if (TREE_CODE (exp
) == CONSTRUCTOR
)
3602 output_constructor (exp
, size
, align
);
3605 else if (TREE_CODE (exp
) == STRING_CST
)
3607 thissize
= MIN ((unsigned HOST_WIDE_INT
)TREE_STRING_LENGTH (exp
),
3609 assemble_string (TREE_STRING_POINTER (exp
), thissize
);
3611 else if (TREE_CODE (exp
) == VECTOR_CST
)
3615 unsigned int nalign
;
3616 enum machine_mode inner
;
3618 inner
= GET_MODE_INNER (TYPE_MODE (TREE_TYPE (exp
)));
3619 nalign
= MIN (align
, GET_MODE_ALIGNMENT (inner
));
3621 elt_size
= GET_MODE_UNIT_SIZE (TYPE_MODE (TREE_TYPE (exp
)));
3623 link
= TREE_VECTOR_CST_ELTS (exp
);
3624 output_constant (TREE_VALUE (link
), elt_size
, align
);
3625 while ((link
= TREE_CHAIN (link
)) != NULL
)
3626 output_constant (TREE_VALUE (link
), elt_size
, nalign
);
3634 if (TREE_CODE (exp
) == CONSTRUCTOR
)
3635 output_constructor (exp
, size
, align
);
3641 if (TREE_CODE (exp
) == INTEGER_CST
)
3642 assemble_integer (expand_expr (exp
, NULL_RTX
,
3643 VOIDmode
, EXPAND_INITIALIZER
),
3644 thissize
, align
, 1);
3645 else if (TREE_CODE (exp
) == CONSTRUCTOR
)
3647 unsigned char *buffer
= alloca (thissize
);
3648 if (get_set_constructor_bytes (exp
, buffer
, thissize
))
3650 assemble_string ((char *) buffer
, thissize
);
3653 error ("unknown set constructor type");
3663 if (size
> thissize
)
3664 assemble_zeros (size
- thissize
);
3668 /* Subroutine of output_constructor, used for computing the size of
3669 arrays of unspecified length. VAL must be a CONSTRUCTOR of an array
3670 type with an unspecified upper bound. */
3672 static unsigned HOST_WIDE_INT
3673 array_size_for_constructor (tree val
)
3677 /* This code used to attempt to handle string constants that are not
3678 arrays of single-bytes, but nothing else does, so there's no point in
3680 if (TREE_CODE (val
) == STRING_CST
)
3681 return TREE_STRING_LENGTH (val
);
3683 max_index
= NULL_TREE
;
3684 for (i
= CONSTRUCTOR_ELTS (val
); i
; i
= TREE_CHAIN (i
))
3686 tree index
= TREE_PURPOSE (i
);
3688 if (TREE_CODE (index
) == RANGE_EXPR
)
3689 index
= TREE_OPERAND (index
, 1);
3690 if (max_index
== NULL_TREE
|| tree_int_cst_lt (max_index
, index
))
3694 if (max_index
== NULL_TREE
)
3697 /* Compute the total number of array elements. */
3698 i
= size_binop (MINUS_EXPR
, convert (sizetype
, max_index
),
3700 TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (val
)))));
3701 i
= size_binop (PLUS_EXPR
, i
, convert (sizetype
, integer_one_node
));
3703 /* Multiply by the array element unit size to find number of bytes. */
3704 i
= size_binop (MULT_EXPR
, i
, TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (val
))));
3706 return tree_low_cst (i
, 1);
3709 /* Subroutine of output_constant, used for CONSTRUCTORs (aggregate constants).
3710 Generate at least SIZE bytes, padding if necessary. */
3713 output_constructor (tree exp
, unsigned HOST_WIDE_INT size
,
3716 tree type
= TREE_TYPE (exp
);
3717 tree link
, field
= 0;
3719 /* Number of bytes output or skipped so far.
3720 In other words, current position within the constructor. */
3721 HOST_WIDE_INT total_bytes
= 0;
3722 /* Nonzero means BYTE contains part of a byte, to be output. */
3723 int byte_buffer_in_use
= 0;
3726 if (HOST_BITS_PER_WIDE_INT
< BITS_PER_UNIT
)
3729 if (TREE_CODE (type
) == RECORD_TYPE
)
3730 field
= TYPE_FIELDS (type
);
3732 if (TREE_CODE (type
) == ARRAY_TYPE
3733 && TYPE_DOMAIN (type
) != 0)
3734 min_index
= TYPE_MIN_VALUE (TYPE_DOMAIN (type
));
3736 /* As LINK goes through the elements of the constant,
3737 FIELD goes through the structure fields, if the constant is a structure.
3738 if the constant is a union, then we override this,
3739 by getting the field from the TREE_LIST element.
3740 But the constant could also be an array. Then FIELD is zero.
3742 There is always a maximum of one element in the chain LINK for unions
3743 (even if the initializer in a source program incorrectly contains
3745 for (link
= CONSTRUCTOR_ELTS (exp
);
3747 link
= TREE_CHAIN (link
),
3748 field
= field
? TREE_CHAIN (field
) : 0)
3750 tree val
= TREE_VALUE (link
);
3753 /* The element in a union constructor specifies the proper field
3755 if ((TREE_CODE (type
) == RECORD_TYPE
|| TREE_CODE (type
) == UNION_TYPE
3756 || TREE_CODE (type
) == QUAL_UNION_TYPE
)
3757 && TREE_PURPOSE (link
) != 0)
3758 field
= TREE_PURPOSE (link
);
3760 else if (TREE_CODE (type
) == ARRAY_TYPE
)
3761 index
= TREE_PURPOSE (link
);
3763 #ifdef ASM_COMMENT_START
3764 if (field
&& flag_verbose_asm
)
3765 fprintf (asm_out_file
, "%s %s:\n",
3768 ? IDENTIFIER_POINTER (DECL_NAME (field
))
3772 /* Eliminate the marker that makes a cast not be an lvalue. */
3776 if (index
&& TREE_CODE (index
) == RANGE_EXPR
)
3778 unsigned HOST_WIDE_INT fieldsize
3779 = int_size_in_bytes (TREE_TYPE (type
));
3780 HOST_WIDE_INT lo_index
= tree_low_cst (TREE_OPERAND (index
, 0), 0);
3781 HOST_WIDE_INT hi_index
= tree_low_cst (TREE_OPERAND (index
, 1), 0);
3782 HOST_WIDE_INT index
;
3783 unsigned int align2
= min_align (align
, fieldsize
* BITS_PER_UNIT
);
3785 for (index
= lo_index
; index
<= hi_index
; index
++)
3787 /* Output the element's initial value. */
3789 assemble_zeros (fieldsize
);
3791 output_constant (val
, fieldsize
, align2
);
3793 /* Count its size. */
3794 total_bytes
+= fieldsize
;
3797 else if (field
== 0 || !DECL_BIT_FIELD (field
))
3799 /* An element that is not a bit-field. */
3801 unsigned HOST_WIDE_INT fieldsize
;
3802 /* Since this structure is static,
3803 we know the positions are constant. */
3804 HOST_WIDE_INT pos
= field
? int_byte_position (field
) : 0;
3805 unsigned int align2
;
3808 pos
= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (val
)), 1)
3809 * (tree_low_cst (index
, 0) - tree_low_cst (min_index
, 0)));
3811 /* Output any buffered-up bit-fields preceding this element. */
3812 if (byte_buffer_in_use
)
3814 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
3816 byte_buffer_in_use
= 0;
3819 /* Advance to offset of this element.
3820 Note no alignment needed in an array, since that is guaranteed
3821 if each element has the proper size. */
3822 if ((field
!= 0 || index
!= 0) && pos
!= total_bytes
)
3824 assemble_zeros (pos
- total_bytes
);
3828 /* Find the alignment of this element. */
3829 align2
= min_align (align
, BITS_PER_UNIT
* pos
);
3831 /* Determine size this element should occupy. */
3836 /* If this is an array with an unspecified upper bound,
3837 the initializer determines the size. */
3838 /* ??? This ought to only checked if DECL_SIZE_UNIT is NULL,
3839 but we cannot do this until the deprecated support for
3840 initializing zero-length array members is removed. */
3841 if (TREE_CODE (TREE_TYPE (field
)) == ARRAY_TYPE
3842 && TYPE_DOMAIN (TREE_TYPE (field
))
3843 && ! TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (field
))))
3845 fieldsize
= array_size_for_constructor (val
);
3846 /* Given a non-empty initialization, this field had
3848 if (fieldsize
!= 0 && TREE_CHAIN (field
) != NULL_TREE
)
3851 else if (DECL_SIZE_UNIT (field
))
3853 /* ??? This can't be right. If the decl size overflows
3854 a host integer we will silently emit no data. */
3855 if (host_integerp (DECL_SIZE_UNIT (field
), 1))
3856 fieldsize
= tree_low_cst (DECL_SIZE_UNIT (field
), 1);
3860 fieldsize
= int_size_in_bytes (TREE_TYPE (type
));
3862 /* Output the element's initial value. */
3864 assemble_zeros (fieldsize
);
3866 output_constant (val
, fieldsize
, align2
);
3868 /* Count its size. */
3869 total_bytes
+= fieldsize
;
3871 else if (val
!= 0 && TREE_CODE (val
) != INTEGER_CST
)
3872 error ("invalid initial value for member `%s'",
3873 IDENTIFIER_POINTER (DECL_NAME (field
)));
3876 /* Element that is a bit-field. */
3878 HOST_WIDE_INT next_offset
= int_bit_position (field
);
3879 HOST_WIDE_INT end_offset
3880 = (next_offset
+ tree_low_cst (DECL_SIZE (field
), 1));
3883 val
= integer_zero_node
;
3885 /* If this field does not start in this (or, next) byte,
3887 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
3889 /* Output remnant of any bit field in previous bytes. */
3890 if (byte_buffer_in_use
)
3892 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
3894 byte_buffer_in_use
= 0;
3897 /* If still not at proper byte, advance to there. */
3898 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
3900 assemble_zeros (next_offset
/ BITS_PER_UNIT
- total_bytes
);
3901 total_bytes
= next_offset
/ BITS_PER_UNIT
;
3905 if (! byte_buffer_in_use
)
3908 /* We must split the element into pieces that fall within
3909 separate bytes, and combine each byte with previous or
3910 following bit-fields. */
3912 /* next_offset is the offset n fbits from the beginning of
3913 the structure to the next bit of this element to be processed.
3914 end_offset is the offset of the first bit past the end of
3916 while (next_offset
< end_offset
)
3920 HOST_WIDE_INT value
;
3921 HOST_WIDE_INT next_byte
= next_offset
/ BITS_PER_UNIT
;
3922 HOST_WIDE_INT next_bit
= next_offset
% BITS_PER_UNIT
;
3924 /* Advance from byte to byte
3925 within this element when necessary. */
3926 while (next_byte
!= total_bytes
)
3928 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
3933 /* Number of bits we can process at once
3934 (all part of the same byte). */
3935 this_time
= MIN (end_offset
- next_offset
,
3936 BITS_PER_UNIT
- next_bit
);
3937 if (BYTES_BIG_ENDIAN
)
3939 /* On big-endian machine, take the most significant bits
3940 first (of the bits that are significant)
3941 and put them into bytes from the most significant end. */
3942 shift
= end_offset
- next_offset
- this_time
;
3944 /* Don't try to take a bunch of bits that cross
3945 the word boundary in the INTEGER_CST. We can
3946 only select bits from the LOW or HIGH part
3948 if (shift
< HOST_BITS_PER_WIDE_INT
3949 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
3951 this_time
= shift
+ this_time
- HOST_BITS_PER_WIDE_INT
;
3952 shift
= HOST_BITS_PER_WIDE_INT
;
3955 /* Now get the bits from the appropriate constant word. */
3956 if (shift
< HOST_BITS_PER_WIDE_INT
)
3957 value
= TREE_INT_CST_LOW (val
);
3958 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
3960 value
= TREE_INT_CST_HIGH (val
);
3961 shift
-= HOST_BITS_PER_WIDE_INT
;
3966 /* Get the result. This works only when:
3967 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
3968 byte
|= (((value
>> shift
)
3969 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
3970 << (BITS_PER_UNIT
- this_time
- next_bit
));
3974 /* On little-endian machines,
3975 take first the least significant bits of the value
3976 and pack them starting at the least significant
3977 bits of the bytes. */
3978 shift
= next_offset
- int_bit_position (field
);
3980 /* Don't try to take a bunch of bits that cross
3981 the word boundary in the INTEGER_CST. We can
3982 only select bits from the LOW or HIGH part
3984 if (shift
< HOST_BITS_PER_WIDE_INT
3985 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
3986 this_time
= (HOST_BITS_PER_WIDE_INT
- shift
);
3988 /* Now get the bits from the appropriate constant word. */
3989 if (shift
< HOST_BITS_PER_WIDE_INT
)
3990 value
= TREE_INT_CST_LOW (val
);
3991 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
3993 value
= TREE_INT_CST_HIGH (val
);
3994 shift
-= HOST_BITS_PER_WIDE_INT
;
3999 /* Get the result. This works only when:
4000 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4001 byte
|= (((value
>> shift
)
4002 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4006 next_offset
+= this_time
;
4007 byte_buffer_in_use
= 1;
4012 if (byte_buffer_in_use
)
4014 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4018 if ((unsigned HOST_WIDE_INT
)total_bytes
< size
)
4019 assemble_zeros (size
- total_bytes
);
4022 /* This TREE_LIST contains any weak symbol declarations waiting
4024 static GTY(()) tree weak_decls
;
4026 /* Mark DECL as weak. */
4029 mark_weak (tree decl
)
4031 DECL_WEAK (decl
) = 1;
4033 if (DECL_RTL_SET_P (decl
)
4034 && MEM_P (DECL_RTL (decl
))
4035 && XEXP (DECL_RTL (decl
), 0)
4036 && GET_CODE (XEXP (DECL_RTL (decl
), 0)) == SYMBOL_REF
)
4037 SYMBOL_REF_WEAK (XEXP (DECL_RTL (decl
), 0)) = 1;
4040 /* Merge weak status between NEWDECL and OLDDECL. */
4043 merge_weak (tree newdecl
, tree olddecl
)
4045 if (DECL_WEAK (newdecl
) == DECL_WEAK (olddecl
))
4048 if (DECL_WEAK (newdecl
))
4052 /* NEWDECL is weak, but OLDDECL is not. */
4054 /* If we already output the OLDDECL, we're in trouble; we can't
4055 go back and make it weak. This error cannot caught in
4056 declare_weak because the NEWDECL and OLDDECL was not yet
4057 been merged; therefore, TREE_ASM_WRITTEN was not set. */
4058 if (TREE_ASM_WRITTEN (olddecl
))
4059 error ("%Jweak declaration of '%D' must precede definition",
4062 /* If we've already generated rtl referencing OLDDECL, we may
4063 have done so in a way that will not function properly with
4065 else if (TREE_USED (olddecl
)
4066 && TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (olddecl
)))
4067 warning ("%Jweak declaration of '%D' after first use results "
4068 "in unspecified behavior", newdecl
, newdecl
);
4072 /* We put the NEWDECL on the weak_decls list at some point.
4073 Replace it with the OLDDECL. */
4074 for (wd
= weak_decls
; wd
; wd
= TREE_CHAIN (wd
))
4075 if (TREE_VALUE (wd
) == newdecl
)
4077 TREE_VALUE (wd
) = olddecl
;
4080 /* We may not find the entry on the list. If NEWDECL is a
4081 weak alias, then we will have already called
4082 globalize_decl to remove the entry; in that case, we do
4083 not need to do anything. */
4086 /* Make the OLDDECL weak; it's OLDDECL that we'll be keeping. */
4087 mark_weak (olddecl
);
4090 /* OLDDECL was weak, but NEWDECL was not explicitly marked as
4091 weak. Just update NEWDECL to indicate that it's weak too. */
4092 mark_weak (newdecl
);
4095 /* Declare DECL to be a weak symbol. */
4098 declare_weak (tree decl
)
4100 if (! TREE_PUBLIC (decl
))
4101 error ("%Jweak declaration of '%D' must be public", decl
, decl
);
4102 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& TREE_ASM_WRITTEN (decl
))
4103 error ("%Jweak declaration of '%D' must precede definition", decl
, decl
);
4104 else if (SUPPORTS_WEAK
)
4106 if (! DECL_WEAK (decl
))
4107 weak_decls
= tree_cons (NULL
, decl
, weak_decls
);
4110 warning ("%Jweak declaration of '%D' not supported", decl
, decl
);
4115 /* Emit any pending weak declarations. */
4122 for (t
= weak_decls
; t
; t
= TREE_CHAIN (t
))
4124 tree decl
= TREE_VALUE (t
);
4125 #if defined (ASM_WEAKEN_DECL) || defined (ASM_WEAKEN_LABEL)
4126 const char *const name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
4129 if (! TREE_USED (decl
))
4132 #ifdef ASM_WEAKEN_DECL
4133 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, NULL
);
4135 #ifdef ASM_WEAKEN_LABEL
4136 ASM_WEAKEN_LABEL (asm_out_file
, name
);
4138 #ifdef ASM_OUTPUT_WEAK_ALIAS
4139 warning ("only weak aliases are supported in this configuration");
4147 /* Emit the assembly bits to indicate that DECL is globally visible. */
4150 globalize_decl (tree decl
)
4152 const char *name
= XSTR (XEXP (DECL_RTL (decl
), 0), 0);
4154 #if defined (ASM_WEAKEN_LABEL) || defined (ASM_WEAKEN_DECL)
4155 if (DECL_WEAK (decl
))
4159 #ifdef ASM_WEAKEN_DECL
4160 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, 0);
4162 ASM_WEAKEN_LABEL (asm_out_file
, name
);
4165 /* Remove this function from the pending weak list so that
4166 we do not emit multiple .weak directives for it. */
4167 for (p
= &weak_decls
; (t
= *p
) ; )
4169 if (DECL_ASSEMBLER_NAME (decl
) == DECL_ASSEMBLER_NAME (TREE_VALUE (t
)))
4170 *p
= TREE_CHAIN (t
);
4172 p
= &TREE_CHAIN (t
);
4176 #elif defined(ASM_MAKE_LABEL_LINKONCE)
4177 if (DECL_ONE_ONLY (decl
))
4178 ASM_MAKE_LABEL_LINKONCE (asm_out_file
, name
);
4181 targetm
.asm_out
.globalize_label (asm_out_file
, name
);
4184 /* Emit an assembler directive to make the symbol for DECL an alias to
4185 the symbol for TARGET. */
4188 assemble_alias (tree decl
, tree target ATTRIBUTE_UNUSED
)
4192 /* We must force creation of DECL_RTL for debug info generation, even though
4193 we don't use it here. */
4194 make_decl_rtl (decl
, NULL
);
4196 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
4198 #ifdef ASM_OUTPUT_DEF
4199 /* Make name accessible from other files, if appropriate. */
4201 if (TREE_PUBLIC (decl
))
4203 globalize_decl (decl
);
4204 maybe_assemble_visibility (decl
);
4207 #ifdef ASM_OUTPUT_DEF_FROM_DECLS
4208 ASM_OUTPUT_DEF_FROM_DECLS (asm_out_file
, decl
, target
);
4210 ASM_OUTPUT_DEF (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4212 #else /* !ASM_OUTPUT_DEF */
4213 #if defined (ASM_OUTPUT_WEAK_ALIAS) || defined (ASM_WEAKEN_DECL)
4214 if (DECL_WEAK (decl
))
4217 #ifdef ASM_WEAKEN_DECL
4218 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, IDENTIFIER_POINTER (target
));
4220 ASM_OUTPUT_WEAK_ALIAS (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4222 /* Remove this function from the pending weak list so that
4223 we do not emit multiple .weak directives for it. */
4224 for (p
= &weak_decls
; (t
= *p
) ; )
4225 if (DECL_ASSEMBLER_NAME (decl
)
4226 == DECL_ASSEMBLER_NAME (TREE_VALUE (t
)))
4227 *p
= TREE_CHAIN (t
);
4229 p
= &TREE_CHAIN (t
);
4232 warning ("only weak aliases are supported in this configuration");
4235 warning ("alias definitions not supported in this configuration; ignored");
4239 TREE_USED (decl
) = 1;
4240 TREE_ASM_WRITTEN (decl
) = 1;
4241 TREE_ASM_WRITTEN (DECL_ASSEMBLER_NAME (decl
)) = 1;
4244 /* Emit an assembler directive to set symbol for DECL visibility to
4245 the visibility type VIS, which must not be VISIBILITY_DEFAULT. */
4248 default_assemble_visibility (tree decl
, int vis
)
4250 static const char * const visibility_types
[] = {
4251 NULL
, "internal", "hidden", "protected"
4254 const char *name
, *type
;
4256 name
= (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
4257 type
= visibility_types
[vis
];
4259 #ifdef HAVE_GAS_HIDDEN
4260 fprintf (asm_out_file
, "\t.%s\t", type
);
4261 assemble_name (asm_out_file
, name
);
4262 fprintf (asm_out_file
, "\n");
4264 warning ("visibility attribute not supported in this configuration; ignored");
4268 /* A helper function to call assemble_visibility when needed for a decl. */
4271 maybe_assemble_visibility (tree decl
)
4273 enum symbol_visibility vis
= DECL_VISIBILITY (decl
);
4275 if (vis
!= VISIBILITY_DEFAULT
)
4276 targetm
.asm_out
.visibility (decl
, vis
);
4279 /* Returns 1 if the target configuration supports defining public symbols
4280 so that one of them will be chosen at link time instead of generating a
4281 multiply-defined symbol error, whether through the use of weak symbols or
4282 a target-specific mechanism for having duplicates discarded. */
4285 supports_one_only (void)
4287 if (SUPPORTS_ONE_ONLY
)
4289 return SUPPORTS_WEAK
;
4292 /* Set up DECL as a public symbol that can be defined in multiple
4293 translation units without generating a linker error. */
4296 make_decl_one_only (tree decl
)
4298 if (TREE_CODE (decl
) != VAR_DECL
&& TREE_CODE (decl
) != FUNCTION_DECL
)
4301 TREE_PUBLIC (decl
) = 1;
4303 if (SUPPORTS_ONE_ONLY
)
4305 #ifdef MAKE_DECL_ONE_ONLY
4306 MAKE_DECL_ONE_ONLY (decl
);
4308 DECL_ONE_ONLY (decl
) = 1;
4310 else if (TREE_CODE (decl
) == VAR_DECL
4311 && (DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
))
4312 DECL_COMMON (decl
) = 1;
4313 else if (SUPPORTS_WEAK
)
4314 DECL_WEAK (decl
) = 1;
4320 init_varasm_once (void)
4322 in_named_htab
= htab_create_ggc (31, in_named_entry_hash
,
4323 in_named_entry_eq
, NULL
);
4324 const_desc_htab
= htab_create_ggc (1009, const_desc_hash
,
4325 const_desc_eq
, NULL
);
4327 const_alias_set
= new_alias_set ();
4331 decl_tls_model (tree decl
)
4333 enum tls_model kind
;
4334 tree attr
= lookup_attribute ("tls_model", DECL_ATTRIBUTES (decl
));
4339 attr
= TREE_VALUE (TREE_VALUE (attr
));
4340 if (TREE_CODE (attr
) != STRING_CST
)
4342 if (!strcmp (TREE_STRING_POINTER (attr
), "local-exec"))
4343 kind
= TLS_MODEL_LOCAL_EXEC
;
4344 else if (!strcmp (TREE_STRING_POINTER (attr
), "initial-exec"))
4345 kind
= TLS_MODEL_INITIAL_EXEC
;
4346 else if (!strcmp (TREE_STRING_POINTER (attr
), "local-dynamic"))
4347 kind
= optimize
? TLS_MODEL_LOCAL_DYNAMIC
: TLS_MODEL_GLOBAL_DYNAMIC
;
4348 else if (!strcmp (TREE_STRING_POINTER (attr
), "global-dynamic"))
4349 kind
= TLS_MODEL_GLOBAL_DYNAMIC
;
4355 is_local
= targetm
.binds_local_p (decl
);
4359 kind
= TLS_MODEL_LOCAL_EXEC
;
4361 kind
= TLS_MODEL_INITIAL_EXEC
;
4363 /* Local dynamic is inefficient when we're not combining the
4364 parts of the address. */
4365 else if (optimize
&& is_local
)
4366 kind
= TLS_MODEL_LOCAL_DYNAMIC
;
4368 kind
= TLS_MODEL_GLOBAL_DYNAMIC
;
4369 if (kind
< flag_tls_default
)
4370 kind
= flag_tls_default
;
4375 /* Select a set of attributes for section NAME based on the properties
4376 of DECL and whether or not RELOC indicates that DECL's initializer
4377 might contain runtime relocations.
4379 We make the section read-only and executable for a function decl,
4380 read-only for a const data decl, and writable for a non-const data decl. */
4383 default_section_type_flags (tree decl
, const char *name
, int reloc
)
4385 return default_section_type_flags_1 (decl
, name
, reloc
, flag_pic
);
4389 default_section_type_flags_1 (tree decl
, const char *name
, int reloc
,
4394 if (decl
&& TREE_CODE (decl
) == FUNCTION_DECL
)
4395 flags
= SECTION_CODE
;
4396 else if (decl
&& decl_readonly_section_1 (decl
, reloc
, shlib
))
4398 else if (strcmp (name
, UNLIKELY_EXECUTED_TEXT_SECTION_NAME
) == 0)
4399 flags
= SECTION_CODE
;
4401 flags
= SECTION_WRITE
;
4403 if (decl
&& DECL_ONE_ONLY (decl
))
4404 flags
|= SECTION_LINKONCE
;
4406 if (decl
&& TREE_CODE (decl
) == VAR_DECL
&& DECL_THREAD_LOCAL (decl
))
4407 flags
|= SECTION_TLS
| SECTION_WRITE
;
4409 if (strcmp (name
, ".bss") == 0
4410 || strncmp (name
, ".bss.", 5) == 0
4411 || strncmp (name
, ".gnu.linkonce.b.", 16) == 0
4412 || strcmp (name
, ".sbss") == 0
4413 || strncmp (name
, ".sbss.", 6) == 0
4414 || strncmp (name
, ".gnu.linkonce.sb.", 17) == 0
4415 || strcmp (name
, ".tbss") == 0
4416 || strncmp (name
, ".gnu.linkonce.tb.", 17) == 0)
4417 flags
|= SECTION_BSS
;
4419 if (strcmp (name
, ".tdata") == 0
4420 || strcmp (name
, ".tbss") == 0
4421 || strncmp (name
, ".gnu.linkonce.td.", 17) == 0
4422 || strncmp (name
, ".gnu.linkonce.tb.", 17) == 0)
4423 flags
|= SECTION_TLS
;
4425 /* These three sections have special ELF types. They are neither
4426 SHT_PROGBITS nor SHT_NOBITS, so when changing sections we don't
4427 want to print a section type (@progbits or @nobits). If someone
4428 is silly enough to emit code or TLS variables to one of these
4429 sections, then don't handle them specially. */
4430 if (!(flags
& (SECTION_CODE
| SECTION_BSS
| SECTION_TLS
))
4431 && (strcmp (name
, ".init_array") == 0
4432 || strcmp (name
, ".fini_array") == 0
4433 || strcmp (name
, ".preinit_array") == 0))
4434 flags
|= SECTION_NOTYPE
;
4439 /* Output assembly to switch to section NAME with attribute FLAGS.
4440 Four variants for common object file formats. */
4443 default_no_named_section (const char *name ATTRIBUTE_UNUSED
,
4444 unsigned int flags ATTRIBUTE_UNUSED
)
4446 /* Some object formats don't support named sections at all. The
4447 front-end should already have flagged this as an error. */
4452 default_elf_asm_named_section (const char *name
, unsigned int flags
)
4454 char flagchars
[10], *f
= flagchars
;
4456 if (! named_section_first_declaration (name
))
4458 fprintf (asm_out_file
, "\t.section\t%s\n", name
);
4462 if (!(flags
& SECTION_DEBUG
))
4464 if (flags
& SECTION_WRITE
)
4466 if (flags
& SECTION_CODE
)
4468 if (flags
& SECTION_SMALL
)
4470 if (flags
& SECTION_MERGE
)
4472 if (flags
& SECTION_STRINGS
)
4474 if (flags
& SECTION_TLS
)
4478 fprintf (asm_out_file
, "\t.section\t%s,\"%s\"", name
, flagchars
);
4480 if (!(flags
& SECTION_NOTYPE
))
4484 if (flags
& SECTION_BSS
)
4489 fprintf (asm_out_file
, ",@%s", type
);
4491 if (flags
& SECTION_ENTSIZE
)
4492 fprintf (asm_out_file
, ",%d", flags
& SECTION_ENTSIZE
);
4495 putc ('\n', asm_out_file
);
4499 default_coff_asm_named_section (const char *name
, unsigned int flags
)
4501 char flagchars
[8], *f
= flagchars
;
4503 if (flags
& SECTION_WRITE
)
4505 if (flags
& SECTION_CODE
)
4509 fprintf (asm_out_file
, "\t.section\t%s,\"%s\"\n", name
, flagchars
);
4513 default_pe_asm_named_section (const char *name
, unsigned int flags
)
4515 default_coff_asm_named_section (name
, flags
);
4517 if (flags
& SECTION_LINKONCE
)
4519 /* Functions may have been compiled at various levels of
4520 optimization so we can't use `same_size' here.
4521 Instead, have the linker pick one. */
4522 fprintf (asm_out_file
, "\t.linkonce %s\n",
4523 (flags
& SECTION_CODE
? "discard" : "same_size"));
4527 /* The lame default section selector. */
4530 default_select_section (tree decl
, int reloc
,
4531 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
)
4533 bool readonly
= false;
4537 if (decl_readonly_section (decl
, reloc
))
4540 else if (TREE_CODE (decl
) == CONSTRUCTOR
)
4542 if (! ((flag_pic
&& reloc
)
4543 || !TREE_READONLY (decl
)
4544 || TREE_SIDE_EFFECTS (decl
)
4545 || !TREE_CONSTANT (decl
)))
4548 else if (TREE_CODE (decl
) == STRING_CST
)
4550 else if (! (flag_pic
&& reloc
))
4554 readonly_data_section ();
4559 /* A helper function for default_elf_select_section and
4560 default_elf_unique_section. Categorizes the DECL. */
4562 enum section_category
4567 SECCAT_RODATA_MERGE_STR
,
4568 SECCAT_RODATA_MERGE_STR_INIT
,
4569 SECCAT_RODATA_MERGE_CONST
,
4574 /* To optimize loading of shared programs, define following subsections
4576 _REL Contains data that has relocations, so they get grouped
4577 together and dynamic linker will visit fewer pages in memory.
4578 _RO Contains data that is otherwise read-only. This is useful
4579 with prelinking as most relocations won't be dynamically
4580 linked and thus stay read only.
4581 _LOCAL Marks data containing relocations only to local objects.
4582 These relocations will get fully resolved by prelinking. */
4584 SECCAT_DATA_REL_LOCAL
,
4586 SECCAT_DATA_REL_RO_LOCAL
,
4596 static enum section_category
4597 categorize_decl_for_section (tree
, int, int);
4599 static enum section_category
4600 categorize_decl_for_section (tree decl
, int reloc
, int shlib
)
4602 enum section_category ret
;
4604 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4606 else if (TREE_CODE (decl
) == STRING_CST
)
4608 if (flag_mudflap
) /* or !flag_merge_constants */
4609 return SECCAT_RODATA
;
4611 return SECCAT_RODATA_MERGE_STR
;
4613 else if (TREE_CODE (decl
) == VAR_DECL
)
4615 if (DECL_INITIAL (decl
) == NULL
4616 || DECL_INITIAL (decl
) == error_mark_node
4617 || (flag_zero_initialized_in_bss
4618 /* Leave constant zeroes in .rodata so they can be shared. */
4619 && !TREE_READONLY (decl
)
4620 && initializer_zerop (DECL_INITIAL (decl
))))
4622 else if (! TREE_READONLY (decl
)
4623 || TREE_SIDE_EFFECTS (decl
)
4624 || ! TREE_CONSTANT (DECL_INITIAL (decl
)))
4626 if (shlib
&& (reloc
& 2))
4627 ret
= SECCAT_DATA_REL
;
4628 else if (shlib
&& reloc
)
4629 ret
= SECCAT_DATA_REL_LOCAL
;
4633 else if (shlib
&& (reloc
& 2))
4634 ret
= SECCAT_DATA_REL_RO
;
4635 else if (shlib
&& reloc
)
4636 ret
= SECCAT_DATA_REL_RO_LOCAL
;
4637 else if (reloc
|| flag_merge_constants
< 2)
4638 /* C and C++ don't allow different variables to share the same
4639 location. -fmerge-all-constants allows even that (at the
4640 expense of not conforming). */
4641 ret
= SECCAT_RODATA
;
4642 else if (TREE_CODE (DECL_INITIAL (decl
)) == STRING_CST
)
4643 ret
= SECCAT_RODATA_MERGE_STR_INIT
;
4645 ret
= SECCAT_RODATA_MERGE_CONST
;
4647 else if (TREE_CODE (decl
) == CONSTRUCTOR
)
4649 if ((shlib
&& reloc
)
4650 || TREE_SIDE_EFFECTS (decl
)
4651 || ! TREE_CONSTANT (decl
))
4654 ret
= SECCAT_RODATA
;
4657 ret
= SECCAT_RODATA
;
4659 /* There are no read-only thread-local sections. */
4660 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_THREAD_LOCAL (decl
))
4662 /* Note that this would be *just* SECCAT_BSS, except that there's
4663 no concept of a read-only thread-local-data section. */
4664 if (ret
== SECCAT_BSS
4665 || (flag_zero_initialized_in_bss
4666 && initializer_zerop (DECL_INITIAL (decl
))))
4672 /* If the target uses small data sections, select it. */
4673 else if (targetm
.in_small_data_p (decl
))
4675 if (ret
== SECCAT_BSS
)
4677 else if (targetm
.have_srodata_section
&& ret
== SECCAT_RODATA
)
4678 ret
= SECCAT_SRODATA
;
4687 decl_readonly_section (tree decl
, int reloc
)
4689 return decl_readonly_section_1 (decl
, reloc
, flag_pic
);
4693 decl_readonly_section_1 (tree decl
, int reloc
, int shlib
)
4695 switch (categorize_decl_for_section (decl
, reloc
, shlib
))
4698 case SECCAT_RODATA_MERGE_STR
:
4699 case SECCAT_RODATA_MERGE_STR_INIT
:
4700 case SECCAT_RODATA_MERGE_CONST
:
4701 case SECCAT_SRODATA
:
4710 /* Select a section based on the above categorization. */
4713 default_elf_select_section (tree decl
, int reloc
,
4714 unsigned HOST_WIDE_INT align
)
4716 default_elf_select_section_1 (decl
, reloc
, align
, flag_pic
);
4720 default_elf_select_section_1 (tree decl
, int reloc
,
4721 unsigned HOST_WIDE_INT align
, int shlib
)
4723 switch (categorize_decl_for_section (decl
, reloc
, shlib
))
4726 /* We're not supposed to be called on FUNCTION_DECLs. */
4729 readonly_data_section ();
4731 case SECCAT_RODATA_MERGE_STR
:
4732 mergeable_string_section (decl
, align
, 0);
4734 case SECCAT_RODATA_MERGE_STR_INIT
:
4735 mergeable_string_section (DECL_INITIAL (decl
), align
, 0);
4737 case SECCAT_RODATA_MERGE_CONST
:
4738 mergeable_constant_section (DECL_MODE (decl
), align
, 0);
4740 case SECCAT_SRODATA
:
4741 named_section (NULL_TREE
, ".sdata2", reloc
);
4746 case SECCAT_DATA_REL
:
4747 named_section (NULL_TREE
, ".data.rel", reloc
);
4749 case SECCAT_DATA_REL_LOCAL
:
4750 named_section (NULL_TREE
, ".data.rel.local", reloc
);
4752 case SECCAT_DATA_REL_RO
:
4753 named_section (NULL_TREE
, ".data.rel.ro", reloc
);
4755 case SECCAT_DATA_REL_RO_LOCAL
:
4756 named_section (NULL_TREE
, ".data.rel.ro.local", reloc
);
4759 named_section (NULL_TREE
, ".sdata", reloc
);
4762 named_section (NULL_TREE
, ".tdata", reloc
);
4765 #ifdef BSS_SECTION_ASM_OP
4768 named_section (NULL_TREE
, ".bss", reloc
);
4772 named_section (NULL_TREE
, ".sbss", reloc
);
4775 named_section (NULL_TREE
, ".tbss", reloc
);
4782 /* Construct a unique section name based on the decl name and the
4783 categorization performed above. */
4786 default_unique_section (tree decl
, int reloc
)
4788 default_unique_section_1 (decl
, reloc
, flag_pic
);
4792 default_unique_section_1 (tree decl
, int reloc
, int shlib
)
4794 bool one_only
= DECL_ONE_ONLY (decl
);
4795 const char *prefix
, *name
;
4799 switch (categorize_decl_for_section (decl
, reloc
, shlib
))
4802 prefix
= one_only
? ".gnu.linkonce.t." : ".text.";
4805 case SECCAT_RODATA_MERGE_STR
:
4806 case SECCAT_RODATA_MERGE_STR_INIT
:
4807 case SECCAT_RODATA_MERGE_CONST
:
4808 prefix
= one_only
? ".gnu.linkonce.r." : ".rodata.";
4810 case SECCAT_SRODATA
:
4811 prefix
= one_only
? ".gnu.linkonce.s2." : ".sdata2.";
4814 case SECCAT_DATA_REL
:
4815 case SECCAT_DATA_REL_LOCAL
:
4816 case SECCAT_DATA_REL_RO
:
4817 case SECCAT_DATA_REL_RO_LOCAL
:
4818 prefix
= one_only
? ".gnu.linkonce.d." : ".data.";
4821 prefix
= one_only
? ".gnu.linkonce.s." : ".sdata.";
4824 prefix
= one_only
? ".gnu.linkonce.b." : ".bss.";
4827 prefix
= one_only
? ".gnu.linkonce.sb." : ".sbss.";
4830 prefix
= one_only
? ".gnu.linkonce.td." : ".tdata.";
4833 prefix
= one_only
? ".gnu.linkonce.tb." : ".tbss.";
4838 plen
= strlen (prefix
);
4840 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
4841 name
= targetm
.strip_name_encoding (name
);
4842 nlen
= strlen (name
);
4844 string
= alloca (nlen
+ plen
+ 1);
4845 memcpy (string
, prefix
, plen
);
4846 memcpy (string
+ plen
, name
, nlen
+ 1);
4848 DECL_SECTION_NAME (decl
) = build_string (nlen
+ plen
, string
);
4852 default_select_rtx_section (enum machine_mode mode ATTRIBUTE_UNUSED
,
4854 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
)
4857 switch (GET_CODE (x
))
4869 readonly_data_section ();
4873 default_elf_select_rtx_section (enum machine_mode mode
, rtx x
,
4874 unsigned HOST_WIDE_INT align
)
4876 /* ??? Handle small data here somehow. */
4879 switch (GET_CODE (x
))
4883 named_section (NULL_TREE
, ".data.rel.ro", 3);
4887 named_section (NULL_TREE
, ".data.rel.ro.local", 1);
4894 mergeable_constant_section (mode
, align
, 0);
4897 /* Set the generally applicable flags on the SYMBOL_REF for EXP. */
4900 default_encode_section_info (tree decl
, rtx rtl
, int first ATTRIBUTE_UNUSED
)
4905 /* Careful not to prod global register variables. */
4908 symbol
= XEXP (rtl
, 0);
4909 if (GET_CODE (symbol
) != SYMBOL_REF
)
4913 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4914 flags
|= SYMBOL_FLAG_FUNCTION
;
4915 if (targetm
.binds_local_p (decl
))
4916 flags
|= SYMBOL_FLAG_LOCAL
;
4917 if (targetm
.in_small_data_p (decl
))
4918 flags
|= SYMBOL_FLAG_SMALL
;
4919 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_THREAD_LOCAL (decl
))
4920 flags
|= decl_tls_model (decl
) << SYMBOL_FLAG_TLS_SHIFT
;
4921 /* ??? Why is DECL_EXTERNAL ever set for non-PUBLIC names? Without
4922 being PUBLIC, the thing *must* be defined in this translation unit.
4923 Prevent this buglet from being propagated into rtl code as well. */
4924 if (DECL_P (decl
) && DECL_EXTERNAL (decl
) && TREE_PUBLIC (decl
))
4925 flags
|= SYMBOL_FLAG_EXTERNAL
;
4927 SYMBOL_REF_FLAGS (symbol
) = flags
;
4930 /* By default, we do nothing for encode_section_info, so we need not
4931 do anything but discard the '*' marker. */
4934 default_strip_name_encoding (const char *str
)
4936 return str
+ (*str
== '*');
4939 /* Assume ELF-ish defaults, since that's pretty much the most liberal
4940 wrt cross-module name binding. */
4943 default_binds_local_p (tree exp
)
4945 return default_binds_local_p_1 (exp
, flag_shlib
);
4949 default_binds_local_p_1 (tree exp
, int shlib
)
4953 /* A non-decl is an entry in the constant pool. */
4956 /* Static variables are always local. */
4957 else if (! TREE_PUBLIC (exp
))
4959 /* A variable is local if the user tells us so. */
4960 else if (DECL_VISIBILITY (exp
) != VISIBILITY_DEFAULT
)
4962 /* Otherwise, variables defined outside this object may not be local. */
4963 else if (DECL_EXTERNAL (exp
))
4965 /* Linkonce and weak data are never local. */
4966 else if (DECL_ONE_ONLY (exp
) || DECL_WEAK (exp
))
4968 /* If PIC, then assume that any global name can be overridden by
4969 symbols resolved from other modules. */
4972 /* Uninitialized COMMON variable may be unified with symbols
4973 resolved from other modules. */
4974 else if (DECL_COMMON (exp
)
4975 && (DECL_INITIAL (exp
) == NULL
4976 || DECL_INITIAL (exp
) == error_mark_node
))
4978 /* Otherwise we're left with initialized (or non-common) global data
4979 which is of necessity defined locally. */
4986 /* Determine whether or not a pointer mode is valid. Assume defaults
4987 of ptr_mode or Pmode - can be overridden. */
4989 default_valid_pointer_mode (enum machine_mode mode
)
4991 return (mode
== ptr_mode
|| mode
== Pmode
);
4994 /* Default function to output code that will globalize a label. A
4995 target must define GLOBAL_ASM_OP or provide it's own function to
4996 globalize a label. */
4997 #ifdef GLOBAL_ASM_OP
4999 default_globalize_label (FILE * stream
, const char *name
)
5001 fputs (GLOBAL_ASM_OP
, stream
);
5002 assemble_name (stream
, name
);
5003 putc ('\n', stream
);
5005 #endif /* GLOBAL_ASM_OP */
5007 /* Default function to output a label for unwind information. The
5008 default is to do nothing. A target that needs nonlocal labels for
5009 unwind information must provide its own function to do this. */
5011 default_emit_unwind_label (FILE * stream ATTRIBUTE_UNUSED
,
5012 tree decl ATTRIBUTE_UNUSED
,
5013 int for_eh ATTRIBUTE_UNUSED
,
5014 int empty ATTRIBUTE_UNUSED
)
5018 /* This is how to output an internal numbered label where PREFIX is
5019 the class of label and LABELNO is the number within the class. */
5022 default_internal_label (FILE *stream
, const char *prefix
,
5023 unsigned long labelno
)
5025 char *const buf
= alloca (40 + strlen (prefix
));
5026 ASM_GENERATE_INTERNAL_LABEL (buf
, prefix
, labelno
);
5027 ASM_OUTPUT_LABEL (stream
, buf
);
5030 /* This is the default behavior at the beginning of a file. It's
5031 controlled by two other target-hook toggles. */
5033 default_file_start (void)
5035 if (targetm
.file_start_app_off
&& !flag_verbose_asm
)
5036 fputs (ASM_APP_OFF
, asm_out_file
);
5038 if (targetm
.file_start_file_directive
)
5039 output_file_directive (asm_out_file
, main_input_filename
);
5042 /* This is a generic routine suitable for use as TARGET_ASM_FILE_END
5043 which emits a special section directive used to indicate whether or
5044 not this object file needs an executable stack. This is primarily
5045 a GNU extension to ELF but could be used on other targets. */
5047 int trampolines_created
;
5050 file_end_indicate_exec_stack (void)
5052 unsigned int flags
= SECTION_DEBUG
;
5053 if (trampolines_created
)
5054 flags
|= SECTION_CODE
;
5056 named_section_flags (".note.GNU-stack", flags
);
5059 #include "gt-varasm.h"