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 ASM_OUTPUT_BSS
139 static void asm_output_bss (FILE *, tree
, const char *,
140 unsigned HOST_WIDE_INT
, unsigned HOST_WIDE_INT
);
142 #ifdef BSS_SECTION_ASM_OP
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 (GET_CODE (DECL_RTL (var
)) != MEM
)
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 || GET_CODE (DECL_RTL (decl
)) != MEM
)
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
) && GET_CODE (DECL_RTL (decl
)) == REG
)
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
) && DECL_INITIAL (decl
) != error_mark_node
)
1567 /* Output the actual data. */
1568 output_constant (DECL_INITIAL (decl
),
1569 tree_low_cst (DECL_SIZE_UNIT (decl
), 1),
1572 /* Leave space for it. */
1573 assemble_zeros (tree_low_cst (DECL_SIZE_UNIT (decl
), 1));
1577 /* Return 1 if type TYPE contains any pointers. */
1580 contains_pointers_p (tree type
)
1582 switch (TREE_CODE (type
))
1585 case REFERENCE_TYPE
:
1586 /* I'm not sure whether OFFSET_TYPE needs this treatment,
1587 so I'll play safe and return 1. */
1593 case QUAL_UNION_TYPE
:
1596 /* For a type that has fields, see if the fields have pointers. */
1597 for (fields
= TYPE_FIELDS (type
); fields
; fields
= TREE_CHAIN (fields
))
1598 if (TREE_CODE (fields
) == FIELD_DECL
1599 && contains_pointers_p (TREE_TYPE (fields
)))
1605 /* An array type contains pointers if its element type does. */
1606 return contains_pointers_p (TREE_TYPE (type
));
1613 #ifdef ASM_OUTPUT_EXTERNAL
1614 /* True if DECL is a function decl for which no out-of-line copy exists.
1615 It is assumed that DECL's assembler name has been set. */
1618 incorporeal_function_p (tree decl
)
1620 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_BUILT_IN (decl
))
1624 if (DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
1625 && DECL_FUNCTION_CODE (decl
) == BUILT_IN_ALLOCA
)
1628 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
1629 if (strncmp (name
, "__builtin_", strlen ("__builtin_")) == 0)
1636 /* Output something to declare an external symbol to the assembler.
1637 (Most assemblers don't need this, so we normally output nothing.)
1638 Do nothing if DECL is not external. */
1641 assemble_external (tree decl ATTRIBUTE_UNUSED
)
1643 /* Because most platforms do not define ASM_OUTPUT_EXTERNAL, the
1644 main body of this code is only rarely exercised. To provide some
1645 testing, on all platforms, we make sure that the ASM_OUT_FILE is
1646 open. If it's not, we should not be calling this function. */
1650 #ifdef ASM_OUTPUT_EXTERNAL
1651 if (DECL_P (decl
) && DECL_EXTERNAL (decl
) && TREE_PUBLIC (decl
))
1653 rtx rtl
= DECL_RTL (decl
);
1655 if (GET_CODE (rtl
) == MEM
&& GET_CODE (XEXP (rtl
, 0)) == SYMBOL_REF
1656 && !SYMBOL_REF_USED (XEXP (rtl
, 0))
1657 && !incorporeal_function_p (decl
))
1659 /* Some systems do require some output. */
1660 SYMBOL_REF_USED (XEXP (rtl
, 0)) = 1;
1661 ASM_OUTPUT_EXTERNAL (asm_out_file
, decl
, XSTR (XEXP (rtl
, 0), 0));
1667 /* Similar, for calling a library function FUN. */
1670 assemble_external_libcall (rtx fun
)
1672 /* Declare library function name external when first used, if nec. */
1673 if (! SYMBOL_REF_USED (fun
))
1675 SYMBOL_REF_USED (fun
) = 1;
1676 targetm
.asm_out
.external_libcall (fun
);
1680 /* Assemble a label named NAME. */
1683 assemble_label (const char *name
)
1685 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1688 /* Set the symbol_referenced flag for ID and notify callgraph code. */
1690 mark_referenced (tree id
)
1692 if (!TREE_SYMBOL_REFERENCED (id
))
1694 struct cgraph_node
*node
;
1695 struct cgraph_varpool_node
*vnode
;
1697 if (!cgraph_global_info_ready
)
1699 node
= cgraph_node_for_identifier (id
);
1701 cgraph_mark_needed_node (node
);
1704 vnode
= cgraph_varpool_node_for_identifier (id
);
1706 cgraph_varpool_mark_needed_node (vnode
);
1708 TREE_SYMBOL_REFERENCED (id
) = 1;
1711 /* Output to FILE a reference to the assembler name of a C-level name NAME.
1712 If NAME starts with a *, the rest of NAME is output verbatim.
1713 Otherwise NAME is transformed in an implementation-defined way
1714 (usually by the addition of an underscore).
1715 Many macros in the tm file are defined to call this function. */
1718 assemble_name (FILE *file
, const char *name
)
1720 const char *real_name
;
1723 real_name
= targetm
.strip_name_encoding (name
);
1725 id
= maybe_get_identifier (real_name
);
1727 mark_referenced (id
);
1730 fputs (&name
[1], file
);
1732 ASM_OUTPUT_LABELREF (file
, name
);
1735 /* Allocate SIZE bytes writable static space with a gensym name
1736 and return an RTX to refer to its address. */
1739 assemble_static_space (unsigned HOST_WIDE_INT size
)
1742 const char *namestring
;
1746 if (flag_shared_data
)
1750 ASM_GENERATE_INTERNAL_LABEL (name
, "LF", const_labelno
);
1752 namestring
= ggc_strdup (name
);
1754 x
= gen_rtx_SYMBOL_REF (Pmode
, namestring
);
1755 SYMBOL_REF_FLAGS (x
) = SYMBOL_FLAG_LOCAL
;
1757 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
1758 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file
, NULL_TREE
, name
, size
,
1761 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1762 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file
, name
, size
, BIGGEST_ALIGNMENT
);
1765 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1766 so that each uninitialized object starts on such a boundary. */
1767 /* Variable `rounded' might or might not be used in ASM_OUTPUT_LOCAL. */
1768 unsigned HOST_WIDE_INT rounded ATTRIBUTE_UNUSED
1769 = ((size
+ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1)
1770 / (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1771 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1772 ASM_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
1779 /* Assemble the static constant template for function entry trampolines.
1780 This is done at most once per compilation.
1781 Returns an RTX for the address of the template. */
1783 static GTY(()) rtx initial_trampoline
;
1785 #ifdef TRAMPOLINE_TEMPLATE
1787 assemble_trampoline_template (void)
1794 if (initial_trampoline
)
1795 return initial_trampoline
;
1797 /* By default, put trampoline templates in read-only data section. */
1799 #ifdef TRAMPOLINE_SECTION
1800 TRAMPOLINE_SECTION ();
1802 readonly_data_section ();
1805 /* Write the assembler code to define one. */
1806 align
= floor_log2 (TRAMPOLINE_ALIGNMENT
/ BITS_PER_UNIT
);
1809 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1812 targetm
.asm_out
.internal_label (asm_out_file
, "LTRAMP", 0);
1813 TRAMPOLINE_TEMPLATE (asm_out_file
);
1815 /* Record the rtl to refer to it. */
1816 ASM_GENERATE_INTERNAL_LABEL (label
, "LTRAMP", 0);
1817 name
= ggc_strdup (label
);
1818 symbol
= gen_rtx_SYMBOL_REF (Pmode
, name
);
1819 SYMBOL_REF_FLAGS (symbol
) = SYMBOL_FLAG_LOCAL
;
1821 initial_trampoline
= gen_rtx_MEM (BLKmode
, symbol
);
1822 set_mem_align (initial_trampoline
, TRAMPOLINE_ALIGNMENT
);
1824 return initial_trampoline
;
1828 /* A and B are either alignments or offsets. Return the minimum alignment
1829 that may be assumed after adding the two together. */
1831 static inline unsigned
1832 min_align (unsigned int a
, unsigned int b
)
1834 return (a
| b
) & -(a
| b
);
1837 /* Return the assembler directive for creating a given kind of integer
1838 object. SIZE is the number of bytes in the object and ALIGNED_P
1839 indicates whether it is known to be aligned. Return NULL if the
1840 assembly dialect has no such directive.
1842 The returned string should be printed at the start of a new line and
1843 be followed immediately by the object's initial value. */
1846 integer_asm_op (int size
, int aligned_p
)
1848 struct asm_int_op
*ops
;
1851 ops
= &targetm
.asm_out
.aligned_op
;
1853 ops
= &targetm
.asm_out
.unaligned_op
;
1858 return targetm
.asm_out
.byte_op
;
1872 /* Use directive OP to assemble an integer object X. Print OP at the
1873 start of the line, followed immediately by the value of X. */
1876 assemble_integer_with_op (const char *op
, rtx x
)
1878 fputs (op
, asm_out_file
);
1879 output_addr_const (asm_out_file
, x
);
1880 fputc ('\n', asm_out_file
);
1883 /* The default implementation of the asm_out.integer target hook. */
1886 default_assemble_integer (rtx x ATTRIBUTE_UNUSED
,
1887 unsigned int size ATTRIBUTE_UNUSED
,
1888 int aligned_p ATTRIBUTE_UNUSED
)
1890 const char *op
= integer_asm_op (size
, aligned_p
);
1891 return op
&& (assemble_integer_with_op (op
, x
), true);
1894 /* Assemble the integer constant X into an object of SIZE bytes. ALIGN is
1895 the alignment of the integer in bits. Return 1 if we were able to output
1896 the constant, otherwise 0. If FORCE is nonzero, abort if we can't output
1900 assemble_integer (rtx x
, unsigned int size
, unsigned int align
, int force
)
1904 aligned_p
= (align
>= MIN (size
* BITS_PER_UNIT
, BIGGEST_ALIGNMENT
));
1906 /* See if the target hook can handle this kind of object. */
1907 if (targetm
.asm_out
.integer (x
, size
, aligned_p
))
1910 /* If the object is a multi-byte one, try splitting it up. Split
1911 it into words it if is multi-word, otherwise split it into bytes. */
1914 enum machine_mode omode
, imode
;
1915 unsigned int subalign
;
1916 unsigned int subsize
, i
;
1918 subsize
= size
> UNITS_PER_WORD
? UNITS_PER_WORD
: 1;
1919 subalign
= MIN (align
, subsize
* BITS_PER_UNIT
);
1920 omode
= mode_for_size (subsize
* BITS_PER_UNIT
, MODE_INT
, 0);
1921 imode
= mode_for_size (size
* BITS_PER_UNIT
, MODE_INT
, 0);
1923 for (i
= 0; i
< size
; i
+= subsize
)
1925 rtx partial
= simplify_subreg (omode
, x
, imode
, i
);
1926 if (!partial
|| !assemble_integer (partial
, subsize
, subalign
, 0))
1932 /* If we've printed some of it, but not all of it, there's no going
1945 assemble_real (REAL_VALUE_TYPE d
, enum machine_mode mode
, unsigned int align
)
1949 int bitsize
, nelts
, nunits
, units_per
;
1951 /* This is hairy. We have a quantity of known size. real_to_target
1952 will put it into an array of *host* longs, 32 bits per element
1953 (even if long is more than 32 bits). We need to determine the
1954 number of array elements that are occupied (nelts) and the number
1955 of *target* min-addressable units that will be occupied in the
1956 object file (nunits). We cannot assume that 32 divides the
1957 mode's bitsize (size * BITS_PER_UNIT) evenly.
1959 size * BITS_PER_UNIT is used here to make sure that padding bits
1960 (which might appear at either end of the value; real_to_target
1961 will include the padding bits in its output array) are included. */
1963 nunits
= GET_MODE_SIZE (mode
);
1964 bitsize
= nunits
* BITS_PER_UNIT
;
1965 nelts
= CEIL (bitsize
, 32);
1966 units_per
= 32 / BITS_PER_UNIT
;
1968 real_to_target (data
, &d
, mode
);
1970 /* Put out the first word with the specified alignment. */
1971 assemble_integer (GEN_INT (data
[0]), MIN (nunits
, units_per
), align
, 1);
1972 nunits
-= units_per
;
1974 /* Subsequent words need only 32-bit alignment. */
1975 align
= min_align (align
, 32);
1977 for (i
= 1; i
< nelts
; i
++)
1979 assemble_integer (GEN_INT (data
[i
]), MIN (nunits
, units_per
), align
, 1);
1980 nunits
-= units_per
;
1984 /* Given an expression EXP with a constant value,
1985 reduce it to the sum of an assembler symbol and an integer.
1986 Store them both in the structure *VALUE.
1987 Abort if EXP does not reduce. */
1989 struct addr_const
GTY(())
1992 HOST_WIDE_INT offset
;
1996 decode_addr_const (tree exp
, struct addr_const
*value
)
1998 tree target
= TREE_OPERAND (exp
, 0);
2004 if (TREE_CODE (target
) == COMPONENT_REF
2005 && host_integerp (byte_position (TREE_OPERAND (target
, 1)), 0))
2008 offset
+= int_byte_position (TREE_OPERAND (target
, 1));
2009 target
= TREE_OPERAND (target
, 0);
2011 else if (TREE_CODE (target
) == ARRAY_REF
2012 || TREE_CODE (target
) == ARRAY_RANGE_REF
)
2014 offset
+= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (target
)), 1)
2015 * tree_low_cst (TREE_OPERAND (target
, 1), 0));
2016 target
= TREE_OPERAND (target
, 0);
2022 switch (TREE_CODE (target
))
2026 x
= DECL_RTL (target
);
2030 x
= gen_rtx_MEM (FUNCTION_MODE
,
2031 gen_rtx_LABEL_REF (VOIDmode
, force_label_rtx (target
)));
2039 x
= output_constant_def (target
, 1);
2046 if (GET_CODE (x
) != MEM
)
2051 value
->offset
= offset
;
2054 /* Uniquize all constants that appear in memory.
2055 Each constant in memory thus far output is recorded
2056 in `const_desc_table'. */
2058 struct constant_descriptor_tree
GTY(())
2060 /* A MEM for the constant. */
2063 /* The value of the constant. */
2067 static GTY((param_is (struct constant_descriptor_tree
)))
2068 htab_t const_desc_htab
;
2070 static struct constant_descriptor_tree
* build_constant_desc (tree
);
2071 static void maybe_output_constant_def_contents (struct constant_descriptor_tree
*, int);
2073 /* Compute a hash code for a constant expression. */
2076 const_desc_hash (const void *ptr
)
2078 return const_hash_1 (((struct constant_descriptor_tree
*)ptr
)->value
);
2082 const_hash_1 (const tree exp
)
2087 enum tree_code code
= TREE_CODE (exp
);
2089 /* Either set P and LEN to the address and len of something to hash and
2090 exit the switch or return a value. */
2095 p
= (char *) &TREE_INT_CST (exp
);
2096 len
= sizeof TREE_INT_CST (exp
);
2100 return real_hash (TREE_REAL_CST_PTR (exp
));
2103 p
= TREE_STRING_POINTER (exp
);
2104 len
= TREE_STRING_LENGTH (exp
);
2108 return (const_hash_1 (TREE_REALPART (exp
)) * 5
2109 + const_hash_1 (TREE_IMAGPART (exp
)));
2112 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2116 len
= int_size_in_bytes (TREE_TYPE (exp
));
2118 get_set_constructor_bytes (exp
, (unsigned char *) tmp
, len
);
2126 hi
= 5 + int_size_in_bytes (TREE_TYPE (exp
));
2128 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2129 if (TREE_VALUE (link
))
2130 hi
= hi
* 603 + const_hash_1 (TREE_VALUE (link
));
2138 struct addr_const value
;
2140 decode_addr_const (exp
, &value
);
2141 if (GET_CODE (value
.base
) == SYMBOL_REF
)
2143 /* Don't hash the address of the SYMBOL_REF;
2144 only use the offset and the symbol name. */
2146 p
= XSTR (value
.base
, 0);
2147 for (i
= 0; p
[i
] != 0; i
++)
2148 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2150 else if (GET_CODE (value
.base
) == LABEL_REF
)
2151 hi
= value
.offset
+ CODE_LABEL_NUMBER (XEXP (value
.base
, 0)) * 13;
2159 return (const_hash_1 (TREE_OPERAND (exp
, 0)) * 9
2160 + const_hash_1 (TREE_OPERAND (exp
, 1)));
2164 case NON_LVALUE_EXPR
:
2165 return const_hash_1 (TREE_OPERAND (exp
, 0)) * 7 + 2;
2168 /* A language specific constant. Just hash the code. */
2172 /* Compute hashing function. */
2174 for (i
= 0; i
< len
; i
++)
2175 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2180 /* Wrapper of compare_constant, for the htab interface. */
2182 const_desc_eq (const void *p1
, const void *p2
)
2184 return compare_constant (((struct constant_descriptor_tree
*)p1
)->value
,
2185 ((struct constant_descriptor_tree
*)p2
)->value
);
2188 /* Compare t1 and t2, and return 1 only if they are known to result in
2189 the same bit pattern on output. */
2192 compare_constant (const tree t1
, const tree t2
)
2194 enum tree_code typecode
;
2196 if (t1
== NULL_TREE
)
2197 return t2
== NULL_TREE
;
2198 if (t2
== NULL_TREE
)
2201 if (TREE_CODE (t1
) != TREE_CODE (t2
))
2204 switch (TREE_CODE (t1
))
2207 /* Integer constants are the same only if the same width of type. */
2208 if (TYPE_PRECISION (TREE_TYPE (t1
)) != TYPE_PRECISION (TREE_TYPE (t2
)))
2210 return tree_int_cst_equal (t1
, t2
);
2213 /* Real constants are the same only if the same width of type. */
2214 if (TYPE_PRECISION (TREE_TYPE (t1
)) != TYPE_PRECISION (TREE_TYPE (t2
)))
2217 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
2220 if (TYPE_MODE (TREE_TYPE (t1
)) != TYPE_MODE (TREE_TYPE (t2
)))
2223 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
2224 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
2225 TREE_STRING_LENGTH (t1
)));
2228 return (compare_constant (TREE_REALPART (t1
), TREE_REALPART (t2
))
2229 && compare_constant (TREE_IMAGPART (t1
), TREE_IMAGPART (t2
)));
2232 typecode
= TREE_CODE (TREE_TYPE (t1
));
2233 if (typecode
!= TREE_CODE (TREE_TYPE (t2
)))
2236 if (typecode
== SET_TYPE
)
2238 int len
= int_size_in_bytes (TREE_TYPE (t2
));
2239 unsigned char *tmp1
, *tmp2
;
2241 if (int_size_in_bytes (TREE_TYPE (t1
)) != len
)
2244 tmp1
= alloca (len
);
2245 tmp2
= alloca (len
);
2247 if (get_set_constructor_bytes (t1
, tmp1
, len
) != NULL_TREE
)
2249 if (get_set_constructor_bytes (t2
, tmp2
, len
) != NULL_TREE
)
2252 return memcmp (tmp1
, tmp2
, len
) == 0;
2258 if (typecode
== ARRAY_TYPE
)
2260 HOST_WIDE_INT size_1
= int_size_in_bytes (TREE_TYPE (t1
));
2261 /* For arrays, check that the sizes all match. */
2262 if (TYPE_MODE (TREE_TYPE (t1
)) != TYPE_MODE (TREE_TYPE (t2
))
2264 || size_1
!= int_size_in_bytes (TREE_TYPE (t2
)))
2269 /* For record and union constructors, require exact type
2271 if (TREE_TYPE (t1
) != TREE_TYPE (t2
))
2275 for (l1
= CONSTRUCTOR_ELTS (t1
), l2
= CONSTRUCTOR_ELTS (t2
);
2277 l1
= TREE_CHAIN (l1
), l2
= TREE_CHAIN (l2
))
2279 /* Check that each value is the same... */
2280 if (! compare_constant (TREE_VALUE (l1
), TREE_VALUE (l2
)))
2282 /* ... and that they apply to the same fields! */
2283 if (typecode
== ARRAY_TYPE
)
2285 if (! compare_constant (TREE_PURPOSE (l1
),
2291 if (TREE_PURPOSE (l1
) != TREE_PURPOSE (l2
))
2296 return l1
== NULL_TREE
&& l2
== NULL_TREE
;
2302 struct addr_const value1
, value2
;
2304 decode_addr_const (t1
, &value1
);
2305 decode_addr_const (t2
, &value2
);
2306 return (value1
.offset
== value2
.offset
2307 && strcmp (XSTR (value1
.base
, 0), XSTR (value2
.base
, 0)) == 0);
2313 return (compare_constant (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0))
2314 && compare_constant(TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1)));
2318 case NON_LVALUE_EXPR
:
2319 case VIEW_CONVERT_EXPR
:
2320 return compare_constant (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
2325 nt1
= lang_hooks
.expand_constant (t1
);
2326 nt2
= lang_hooks
.expand_constant (t2
);
2327 if (nt1
!= t1
|| nt2
!= t2
)
2328 return compare_constant (nt1
, nt2
);
2334 /* Should not get here. */
2338 /* Make a copy of the whole tree structure for a constant. This
2339 handles the same types of nodes that compare_constant handles. */
2342 copy_constant (tree exp
)
2344 switch (TREE_CODE (exp
))
2347 /* For ADDR_EXPR, we do not want to copy the decl whose address
2348 is requested. We do want to copy constants though. */
2349 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, 0))) == 'c')
2350 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2351 copy_constant (TREE_OPERAND (exp
, 0)));
2353 return copy_node (exp
);
2358 return copy_node (exp
);
2361 return build_complex (TREE_TYPE (exp
),
2362 copy_constant (TREE_REALPART (exp
)),
2363 copy_constant (TREE_IMAGPART (exp
)));
2367 return build (TREE_CODE (exp
), TREE_TYPE (exp
),
2368 copy_constant (TREE_OPERAND (exp
, 0)),
2369 copy_constant (TREE_OPERAND (exp
, 1)));
2373 case NON_LVALUE_EXPR
:
2374 case VIEW_CONVERT_EXPR
:
2375 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2376 copy_constant (TREE_OPERAND (exp
, 0)));
2380 tree copy
= copy_node (exp
);
2381 tree list
= copy_list (CONSTRUCTOR_ELTS (exp
));
2384 CONSTRUCTOR_ELTS (copy
) = list
;
2385 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
2386 TREE_VALUE (tail
) = copy_constant (TREE_VALUE (tail
));
2387 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2388 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
2389 TREE_PURPOSE (tail
) = copy_constant (TREE_PURPOSE (tail
));
2397 t
= lang_hooks
.expand_constant (exp
);
2399 return copy_constant (t
);
2406 /* Subroutine of output_constant_def:
2407 No constant equal to EXP is known to have been output.
2408 Make a constant descriptor to enter EXP in the hash table.
2409 Assign the label number and construct RTL to refer to the
2410 constant's location in memory.
2411 Caller is responsible for updating the hash table. */
2413 static struct constant_descriptor_tree
*
2414 build_constant_desc (tree exp
)
2420 struct constant_descriptor_tree
*desc
;
2422 desc
= ggc_alloc (sizeof (*desc
));
2423 desc
->value
= copy_constant (exp
);
2425 /* Propagate marked-ness to copied constant. */
2426 if (flag_mudflap
&& mf_marked_p (exp
))
2427 mf_mark (desc
->value
);
2429 /* Create a string containing the label name, in LABEL. */
2430 labelno
= const_labelno
++;
2431 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", labelno
);
2433 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
2434 symbol
= gen_rtx_SYMBOL_REF (Pmode
, ggc_strdup (label
));
2435 SYMBOL_REF_FLAGS (symbol
) = SYMBOL_FLAG_LOCAL
;
2436 SYMBOL_REF_DECL (symbol
) = desc
->value
;
2437 TREE_CONSTANT_POOL_ADDRESS_P (symbol
) = 1;
2439 rtl
= gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp
)), symbol
);
2440 set_mem_attributes (rtl
, exp
, 1);
2441 set_mem_alias_set (rtl
, 0);
2442 set_mem_alias_set (rtl
, const_alias_set
);
2444 /* Set flags or add text to the name to record information, such as
2445 that it is a local symbol. If the name is changed, the macro
2446 ASM_OUTPUT_LABELREF will have to know how to strip this
2447 information. This call might invalidate our local variable
2448 SYMBOL; we can't use it afterward. */
2450 targetm
.encode_section_info (exp
, rtl
, true);
2457 /* Return an rtx representing a reference to constant data in memory
2458 for the constant expression EXP.
2460 If assembler code for such a constant has already been output,
2461 return an rtx to refer to it.
2462 Otherwise, output such a constant in memory
2463 and generate an rtx for it.
2465 If DEFER is nonzero, this constant can be deferred and output only
2466 if referenced in the function after all optimizations.
2468 `const_desc_table' records which constants already have label strings. */
2471 output_constant_def (tree exp
, int defer
)
2473 struct constant_descriptor_tree
*desc
;
2474 struct constant_descriptor_tree key
;
2477 /* Look up EXP in the table of constant descriptors. If we didn't find
2478 it, create a new one. */
2480 loc
= htab_find_slot (const_desc_htab
, &key
, INSERT
);
2485 desc
= build_constant_desc (exp
);
2489 maybe_output_constant_def_contents (desc
, defer
);
2493 /* Subroutine of output_constant_def: Decide whether or not we need to
2494 output the constant DESC now, and if so, do it. */
2496 maybe_output_constant_def_contents (struct constant_descriptor_tree
*desc
,
2499 rtx symbol
= XEXP (desc
->rtl
, 0);
2500 tree exp
= desc
->value
;
2502 if (flag_syntax_only
)
2505 if (TREE_ASM_WRITTEN (exp
))
2506 /* Already output; don't do it again. */
2509 /* We can always defer constants as long as the context allows
2513 /* Increment n_deferred_constants if it exists. It needs to be at
2514 least as large as the number of constants actually referred to
2515 by the function. If it's too small we'll stop looking too early
2516 and fail to emit constants; if it's too large we'll only look
2517 through the entire function when we could have stopped earlier. */
2519 n_deferred_constants
++;
2523 output_constant_def_contents (symbol
);
2526 /* We must output the constant data referred to by SYMBOL; do so. */
2529 output_constant_def_contents (rtx symbol
)
2531 tree exp
= SYMBOL_REF_DECL (symbol
);
2532 const char *label
= XSTR (symbol
, 0);
2535 /* Make sure any other constants whose addresses appear in EXP
2536 are assigned label numbers. */
2537 int reloc
= compute_reloc_for_constant (exp
);
2539 /* Align the location counter as required by EXP's data type. */
2540 int align
= TYPE_ALIGN (TREE_TYPE (exp
));
2541 #ifdef CONSTANT_ALIGNMENT
2542 align
= CONSTANT_ALIGNMENT (exp
, align
);
2545 output_addressed_constants (exp
);
2547 /* We are no longer deferring this constant. */
2548 TREE_ASM_WRITTEN (exp
) = 1;
2550 if (IN_NAMED_SECTION (exp
))
2551 named_section (exp
, NULL
, reloc
);
2553 targetm
.asm_out
.select_section (exp
, reloc
, align
);
2555 if (align
> BITS_PER_UNIT
)
2557 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
2560 size
= int_size_in_bytes (TREE_TYPE (exp
));
2561 if (TREE_CODE (exp
) == STRING_CST
)
2562 size
= MAX (TREE_STRING_LENGTH (exp
), size
);
2564 /* Do any machine/system dependent processing of the constant. */
2565 #ifdef ASM_DECLARE_CONSTANT_NAME
2566 ASM_DECLARE_CONSTANT_NAME (asm_out_file
, label
, exp
, size
);
2568 /* Standard thing is just output label for the constant. */
2569 ASM_OUTPUT_LABEL (asm_out_file
, label
);
2570 #endif /* ASM_DECLARE_CONSTANT_NAME */
2572 /* Output the value of EXP. */
2573 output_constant (exp
, size
, align
);
2575 mudflap_enqueue_constant (exp
);
2578 /* Look up EXP in the table of constant descriptors. Return the rtl
2579 if it has been emitted, else null. */
2582 lookup_constant_def (tree exp
)
2584 struct constant_descriptor_tree
*desc
;
2585 struct constant_descriptor_tree key
;
2588 desc
= htab_find (const_desc_htab
, &key
);
2590 return (desc
? desc
->rtl
: NULL_RTX
);
2593 /* Used in the hash tables to avoid outputting the same constant
2594 twice. Unlike 'struct constant_descriptor_tree', RTX constants
2595 are output once per function, not once per file. */
2596 /* ??? Only a few targets need per-function constant pools. Most
2597 can use one per-file pool. Should add a targetm bit to tell the
2600 struct rtx_constant_pool
GTY(())
2602 /* Pointers to first and last constant in pool, as ordered by offset. */
2603 struct constant_descriptor_rtx
*first
;
2604 struct constant_descriptor_rtx
*last
;
2606 /* Hash facility for making memory-constants from constant rtl-expressions.
2607 It is used on RISC machines where immediate integer arguments and
2608 constant addresses are restricted so that such constants must be stored
2610 htab_t
GTY((param_is (struct constant_descriptor_rtx
))) const_rtx_htab
;
2611 htab_t
GTY((param_is (struct constant_descriptor_rtx
))) const_rtx_sym_htab
;
2613 /* Current offset in constant pool (does not include any
2614 machine-specific header). */
2615 HOST_WIDE_INT offset
;
2618 struct constant_descriptor_rtx
GTY((chain_next ("%h.next")))
2620 struct constant_descriptor_rtx
*next
;
2624 HOST_WIDE_INT offset
;
2626 enum machine_mode mode
;
2632 /* Hash and compare functions for const_rtx_htab. */
2635 const_desc_rtx_hash (const void *ptr
)
2637 const struct constant_descriptor_rtx
*desc
= ptr
;
2642 const_desc_rtx_eq (const void *a
, const void *b
)
2644 const struct constant_descriptor_rtx
*x
= a
;
2645 const struct constant_descriptor_rtx
*y
= b
;
2647 if (x
->mode
!= y
->mode
)
2649 return rtx_equal_p (x
->constant
, y
->constant
);
2652 /* Hash and compare functions for const_rtx_sym_htab. */
2655 const_desc_rtx_sym_hash (const void *ptr
)
2657 const struct constant_descriptor_rtx
*desc
= ptr
;
2658 return htab_hash_string (XSTR (desc
->sym
, 0));
2662 const_desc_rtx_sym_eq (const void *a
, const void *b
)
2664 const struct constant_descriptor_rtx
*x
= a
;
2665 const struct constant_descriptor_rtx
*y
= b
;
2666 return XSTR (x
->sym
, 0) == XSTR (y
->sym
, 0);
2669 /* This is the worker function for const_rtx_hash, called via for_each_rtx. */
2672 const_rtx_hash_1 (rtx
*xp
, void *data
)
2674 unsigned HOST_WIDE_INT hwi
;
2675 enum machine_mode mode
;
2681 code
= GET_CODE (x
);
2682 mode
= GET_MODE (x
);
2683 h
= (hashval_t
) code
* 1048573 + mode
;
2691 const int shift
= sizeof (hashval_t
) * CHAR_BIT
;
2692 const int n
= sizeof (HOST_WIDE_INT
) / sizeof (hashval_t
);
2695 h
^= (hashval_t
) hwi
;
2696 for (i
= 1; i
< n
; ++i
)
2699 h
^= (hashval_t
) hwi
;
2705 if (mode
== VOIDmode
)
2707 hwi
= CONST_DOUBLE_LOW (x
) ^ CONST_DOUBLE_HIGH (x
);
2711 h
^= real_hash (CONST_DOUBLE_REAL_VALUE (x
));
2715 h
^= htab_hash_string (XSTR (x
, 0));
2719 h
= h
* 251 + CODE_LABEL_NUMBER (XEXP (x
, 0));
2723 case UNSPEC_VOLATILE
:
2724 h
= h
* 251 + XINT (x
, 1);
2732 *hp
= *hp
* 509 + h
;
2736 /* Compute a hash value for X, which should be a constant. */
2739 const_rtx_hash (rtx x
)
2742 for_each_rtx (&x
, const_rtx_hash_1
, &h
);
2747 /* Initialize constant pool hashing for a new function. */
2750 init_varasm_status (struct function
*f
)
2752 struct varasm_status
*p
;
2753 struct rtx_constant_pool
*pool
;
2755 p
= ggc_alloc (sizeof (struct varasm_status
));
2758 pool
= ggc_alloc (sizeof (struct rtx_constant_pool
));
2760 p
->deferred_constants
= 0;
2762 pool
->const_rtx_htab
= htab_create_ggc (31, const_desc_rtx_hash
,
2763 const_desc_rtx_eq
, NULL
);
2764 pool
->const_rtx_sym_htab
= htab_create_ggc (31, const_desc_rtx_sym_hash
,
2765 const_desc_rtx_sym_eq
, NULL
);
2766 pool
->first
= pool
->last
= NULL
;
2770 /* Given a MINUS expression, simplify it if both sides
2771 include the same symbol. */
2774 simplify_subtraction (rtx x
)
2776 rtx r
= simplify_rtx (x
);
2780 /* Given a constant rtx X, make (or find) a memory constant for its value
2781 and return a MEM rtx to refer to it in memory. */
2784 force_const_mem (enum machine_mode mode
, rtx x
)
2786 struct constant_descriptor_rtx
*desc
, tmp
;
2787 struct rtx_constant_pool
*pool
= cfun
->varasm
->pool
;
2794 /* If we're not allowed to drop X into the constant pool, don't. */
2795 if (targetm
.cannot_force_const_mem (x
))
2798 /* Lookup the value in the hashtable. */
2801 hash
= const_rtx_hash (x
);
2802 slot
= htab_find_slot_with_hash (pool
->const_rtx_htab
, &tmp
, hash
, INSERT
);
2805 /* If the constant was already present, return its memory. */
2807 return copy_rtx (desc
->mem
);
2809 /* Otherwise, create a new descriptor. */
2810 desc
= ggc_alloc (sizeof (*desc
));
2813 /* Align the location counter as required by EXP's data type. */
2814 align
= GET_MODE_ALIGNMENT (mode
== VOIDmode
? word_mode
: mode
);
2815 #ifdef CONSTANT_ALIGNMENT
2817 tree type
= lang_hooks
.types
.type_for_mode (mode
, 0);
2818 if (type
!= NULL_TREE
)
2819 align
= CONSTANT_ALIGNMENT (make_tree (type
, x
), align
);
2823 pool
->offset
+= (align
/ BITS_PER_UNIT
) - 1;
2824 pool
->offset
&= ~ ((align
/ BITS_PER_UNIT
) - 1);
2827 desc
->constant
= tmp
.constant
;
2828 desc
->offset
= pool
->offset
;
2831 desc
->align
= align
;
2832 desc
->labelno
= const_labelno
;
2835 pool
->offset
+= GET_MODE_SIZE (mode
);
2837 pool
->last
->next
= desc
;
2839 pool
->first
= pool
->last
= desc
;
2842 /* Create a string containing the label name, in LABEL. */
2843 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
2846 /* Construct the SYMBOL_REF. Make sure to mark it as belonging to
2847 the constants pool. */
2848 desc
->sym
= symbol
= gen_rtx_SYMBOL_REF (Pmode
, ggc_strdup (label
));
2849 SYMBOL_REF_FLAGS (symbol
) = SYMBOL_FLAG_LOCAL
;
2850 CONSTANT_POOL_ADDRESS_P (symbol
) = 1;
2851 current_function_uses_const_pool
= 1;
2853 /* Insert the descriptor into the symbol cross-reference table too. */
2854 slot
= htab_find_slot (pool
->const_rtx_sym_htab
, desc
, INSERT
);
2859 /* Construct the MEM. */
2860 desc
->mem
= def
= gen_rtx_MEM (mode
, symbol
);
2861 set_mem_attributes (def
, lang_hooks
.types
.type_for_mode (mode
, 0), 1);
2862 RTX_UNCHANGING_P (def
) = 1;
2864 /* If we're dropping a label to the constant pool, make sure we
2866 if (GET_CODE (x
) == LABEL_REF
)
2867 LABEL_PRESERVE_P (XEXP (x
, 0)) = 1;
2869 return copy_rtx (def
);
2872 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
2873 the corresponding constant_descriptor_rtx structure. */
2875 static struct constant_descriptor_rtx
*
2876 find_pool_constant (struct rtx_constant_pool
*pool
, rtx sym
)
2878 struct constant_descriptor_rtx tmp
;
2880 return htab_find (pool
->const_rtx_sym_htab
, &tmp
);
2883 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
2886 get_pool_constant (rtx addr
)
2888 return find_pool_constant (cfun
->varasm
->pool
, addr
)->constant
;
2891 /* Given a constant pool SYMBOL_REF, return the corresponding constant
2892 and whether it has been output or not. */
2895 get_pool_constant_mark (rtx addr
, bool *pmarked
)
2897 struct constant_descriptor_rtx
*desc
;
2899 desc
= find_pool_constant (cfun
->varasm
->pool
, addr
);
2900 *pmarked
= (desc
->mark
!= 0);
2901 return desc
->constant
;
2904 /* Likewise, but for the constant pool of a specific function. */
2907 get_pool_constant_for_function (struct function
*f
, rtx addr
)
2909 return find_pool_constant (f
->varasm
->pool
, addr
)->constant
;
2912 /* Similar, return the mode. */
2915 get_pool_mode (rtx addr
)
2917 return find_pool_constant (cfun
->varasm
->pool
, addr
)->mode
;
2921 get_pool_mode_for_function (struct function
*f
, rtx addr
)
2923 return find_pool_constant (f
->varasm
->pool
, addr
)->mode
;
2926 /* Similar, return the offset in the constant pool. */
2929 get_pool_offset (rtx addr
)
2931 return find_pool_constant (cfun
->varasm
->pool
, addr
)->offset
;
2934 /* Return the size of the constant pool. */
2937 get_pool_size (void)
2939 return cfun
->varasm
->pool
->offset
;
2942 /* Worker function for output_constant_pool_1. Emit assembly for X
2943 in MODE with known alignment ALIGN. */
2946 output_constant_pool_2 (enum machine_mode mode
, rtx x
, unsigned int align
)
2948 switch (GET_MODE_CLASS (mode
))
2951 if (GET_CODE (x
) != CONST_DOUBLE
)
2956 REAL_VALUE_FROM_CONST_DOUBLE (r
, x
);
2957 assemble_real (r
, mode
, align
);
2962 case MODE_PARTIAL_INT
:
2963 assemble_integer (x
, GET_MODE_SIZE (mode
), align
, 1);
2966 case MODE_VECTOR_FLOAT
:
2967 case MODE_VECTOR_INT
:
2970 enum machine_mode submode
= GET_MODE_INNER (mode
);
2971 unsigned int subalign
= MIN (align
, GET_MODE_BITSIZE (submode
));
2973 if (GET_CODE (x
) != CONST_VECTOR
)
2975 units
= CONST_VECTOR_NUNITS (x
);
2977 for (i
= 0; i
< units
; i
++)
2979 rtx elt
= CONST_VECTOR_ELT (x
, i
);
2980 output_constant_pool_2 (submode
, elt
, i
? subalign
: align
);
2990 /* Worker function for output_constant_pool. Emit POOL. */
2993 output_constant_pool_1 (struct constant_descriptor_rtx
*desc
)
3001 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3002 whose CODE_LABEL has been deleted. This can occur if a jump table
3003 is eliminated by optimization. If so, write a constant of zero
3004 instead. Note that this can also happen by turning the
3005 CODE_LABEL into a NOTE. */
3006 /* ??? This seems completely and utterly wrong. Certainly it's
3007 not true for NOTE_INSN_DELETED_LABEL, but I disbelieve proper
3008 functioning even with INSN_DELETED_P and friends. */
3011 switch (GET_CODE (x
))
3014 if (GET_CODE (XEXP (x
, 0)) != PLUS
3015 || GET_CODE (XEXP (XEXP (x
, 0), 0)) != LABEL_REF
)
3017 tmp
= XEXP (XEXP (x
, 0), 0);
3022 if (INSN_DELETED_P (tmp
)
3023 || (GET_CODE (tmp
) == NOTE
3024 && NOTE_LINE_NUMBER (tmp
) == NOTE_INSN_DELETED
))
3035 /* First switch to correct section. */
3036 targetm
.asm_out
.select_rtx_section (desc
->mode
, x
, desc
->align
);
3038 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3039 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file
, x
, desc
->mode
,
3040 desc
->align
, desc
->labelno
, done
);
3043 assemble_align (desc
->align
);
3045 /* Output the label. */
3046 targetm
.asm_out
.internal_label (asm_out_file
, "LC", desc
->labelno
);
3048 /* Output the data. */
3049 output_constant_pool_2 (desc
->mode
, x
, desc
->align
);
3051 /* Make sure all constants in SECTION_MERGE and not SECTION_STRINGS
3052 sections have proper size. */
3053 if (desc
->align
> GET_MODE_BITSIZE (desc
->mode
)
3054 && in_section
== in_named
3055 && get_named_section_flags (in_named_name
) & SECTION_MERGE
)
3056 assemble_align (desc
->align
);
3058 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3064 /* Given a SYMBOL_REF CURRENT_RTX, mark it and all constants it refers
3065 to as used. Emit referenced deferred strings. This function can
3066 be used with for_each_rtx to mark all SYMBOL_REFs in an rtx. */
3069 mark_constant (rtx
*current_rtx
, void *data
)
3071 struct rtx_constant_pool
*pool
= data
;
3072 rtx x
= *current_rtx
;
3074 if (x
== NULL_RTX
|| GET_CODE (x
) != SYMBOL_REF
)
3077 if (CONSTANT_POOL_ADDRESS_P (x
))
3079 struct constant_descriptor_rtx
*desc
= find_pool_constant (pool
, x
);
3080 if (desc
->mark
== 0)
3083 for_each_rtx (&desc
->constant
, mark_constant
, pool
);
3086 else if (TREE_CONSTANT_POOL_ADDRESS_P (x
))
3088 tree exp
= SYMBOL_REF_DECL (x
);
3089 if (!TREE_ASM_WRITTEN (exp
))
3091 n_deferred_constants
--;
3092 output_constant_def_contents (x
);
3099 /* Look through appropriate parts of INSN, marking all entries in the
3100 constant pool which are actually being used. Entries that are only
3101 referenced by other constants are also marked as used. Emit
3102 deferred strings that are used. */
3105 mark_constants (struct rtx_constant_pool
*pool
, rtx insn
)
3110 /* Insns may appear inside a SEQUENCE. Only check the patterns of
3111 insns, not any notes that may be attached. We don't want to mark
3112 a constant just because it happens to appear in a REG_EQUIV note. */
3113 if (GET_CODE (PATTERN (insn
)) == SEQUENCE
)
3115 rtx seq
= PATTERN (insn
);
3116 int i
, n
= XVECLEN (seq
, 0);
3117 for (i
= 0; i
< n
; ++i
)
3119 rtx subinsn
= XVECEXP (seq
, 0, i
);
3120 if (INSN_P (subinsn
))
3121 for_each_rtx (&PATTERN (subinsn
), mark_constant
, pool
);
3125 for_each_rtx (&PATTERN (insn
), mark_constant
, pool
);
3128 /* Look through the instructions for this function, and mark all the
3129 entries in POOL which are actually being used. Emit deferred constants
3130 which have indeed been used. */
3133 mark_constant_pool (struct rtx_constant_pool
*pool
)
3137 if (pool
->first
== 0 && n_deferred_constants
== 0)
3140 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
3141 mark_constants (pool
, insn
);
3143 for (link
= current_function_epilogue_delay_list
;
3145 link
= XEXP (link
, 1))
3146 mark_constants (pool
, XEXP (link
, 0));
3149 /* Write all the constants in the constant pool. */
3152 output_constant_pool (const char *fnname ATTRIBUTE_UNUSED
,
3153 tree fndecl ATTRIBUTE_UNUSED
)
3155 struct rtx_constant_pool
*pool
= cfun
->varasm
->pool
;
3156 struct constant_descriptor_rtx
*desc
;
3158 /* It is possible for gcc to call force_const_mem and then to later
3159 discard the instructions which refer to the constant. In such a
3160 case we do not need to output the constant. */
3161 mark_constant_pool (pool
);
3163 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3164 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file
, fnname
, fndecl
, pool
->offset
);
3167 for (desc
= pool
->first
; desc
; desc
= desc
->next
)
3168 output_constant_pool_1 (desc
);
3170 #ifdef ASM_OUTPUT_POOL_EPILOGUE
3171 ASM_OUTPUT_POOL_EPILOGUE (asm_out_file
, fnname
, fndecl
, pool
->offset
);
3175 /* Determine what kind of relocations EXP may need. */
3178 compute_reloc_for_constant (tree exp
)
3180 int reloc
= 0, reloc2
;
3183 /* Give the front-end a chance to convert VALUE to something that
3184 looks more like a constant to the back-end. */
3185 exp
= lang_hooks
.expand_constant (exp
);
3187 switch (TREE_CODE (exp
))
3191 /* Go inside any operations that get_inner_reference can handle and see
3192 if what's inside is a constant: no need to do anything here for
3193 addresses of variables or functions. */
3194 for (tem
= TREE_OPERAND (exp
, 0); handled_component_p (tem
);
3195 tem
= TREE_OPERAND (tem
, 0))
3198 if (TREE_PUBLIC (tem
))
3205 reloc
= compute_reloc_for_constant (TREE_OPERAND (exp
, 0));
3206 reloc
|= compute_reloc_for_constant (TREE_OPERAND (exp
, 1));
3210 reloc
= compute_reloc_for_constant (TREE_OPERAND (exp
, 0));
3211 reloc2
= compute_reloc_for_constant (TREE_OPERAND (exp
, 1));
3212 /* The difference of two local labels is computable at link time. */
3213 if (reloc
== 1 && reloc2
== 1)
3221 case NON_LVALUE_EXPR
:
3222 reloc
= compute_reloc_for_constant (TREE_OPERAND (exp
, 0));
3226 for (tem
= CONSTRUCTOR_ELTS (exp
); tem
; tem
= TREE_CHAIN (tem
))
3227 if (TREE_VALUE (tem
) != 0)
3228 reloc
|= compute_reloc_for_constant (TREE_VALUE (tem
));
3238 /* Find all the constants whose addresses are referenced inside of EXP,
3239 and make sure assembler code with a label has been output for each one.
3240 Indicate whether an ADDR_EXPR has been encountered. */
3243 output_addressed_constants (tree exp
)
3247 /* Give the front-end a chance to convert VALUE to something that
3248 looks more like a constant to the back-end. */
3249 exp
= lang_hooks
.expand_constant (exp
);
3251 switch (TREE_CODE (exp
))
3255 /* Go inside any operations that get_inner_reference can handle and see
3256 if what's inside is a constant: no need to do anything here for
3257 addresses of variables or functions. */
3258 for (tem
= TREE_OPERAND (exp
, 0); handled_component_p (tem
);
3259 tem
= TREE_OPERAND (tem
, 0))
3262 if (TREE_CODE_CLASS (TREE_CODE (tem
)) == 'c'
3263 || TREE_CODE (tem
) == CONSTRUCTOR
)
3264 output_constant_def (tem
, 0);
3269 output_addressed_constants (TREE_OPERAND (exp
, 1));
3274 case NON_LVALUE_EXPR
:
3275 output_addressed_constants (TREE_OPERAND (exp
, 0));
3279 for (tem
= CONSTRUCTOR_ELTS (exp
); tem
; tem
= TREE_CHAIN (tem
))
3280 if (TREE_VALUE (tem
) != 0)
3281 output_addressed_constants (TREE_VALUE (tem
));
3290 /* Return nonzero if VALUE is a valid constant-valued expression
3291 for use in initializing a static variable; one that can be an
3292 element of a "constant" initializer.
3294 Return null_pointer_node if the value is absolute;
3295 if it is relocatable, return the variable that determines the relocation.
3296 We assume that VALUE has been folded as much as possible;
3297 therefore, we do not need to check for such things as
3298 arithmetic-combinations of integers. */
3301 initializer_constant_valid_p (tree value
, tree endtype
)
3303 /* Give the front-end a chance to convert VALUE to something that
3304 looks more like a constant to the back-end. */
3305 value
= lang_hooks
.expand_constant (value
);
3307 switch (TREE_CODE (value
))
3310 if ((TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
3311 || TREE_CODE (TREE_TYPE (value
)) == RECORD_TYPE
)
3312 && TREE_CONSTANT (value
)
3313 && CONSTRUCTOR_ELTS (value
))
3316 bool absolute
= true;
3318 for (elt
= CONSTRUCTOR_ELTS (value
); elt
; elt
= TREE_CHAIN (elt
))
3321 value
= TREE_VALUE (elt
);
3322 reloc
= initializer_constant_valid_p (value
, TREE_TYPE (value
));
3325 if (reloc
!= null_pointer_node
)
3328 /* For a non-absolute relocation, there is no single
3329 variable that can be "the variable that determines the
3331 return absolute
? null_pointer_node
: error_mark_node
;
3334 return TREE_STATIC (value
) ? null_pointer_node
: NULL_TREE
;
3341 return null_pointer_node
;
3345 return staticp (TREE_OPERAND (value
, 0)) ? TREE_OPERAND (value
, 0) : 0;
3347 case VIEW_CONVERT_EXPR
:
3348 case NON_LVALUE_EXPR
:
3349 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3353 /* Allow conversions between pointer types. */
3354 if (POINTER_TYPE_P (TREE_TYPE (value
))
3355 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3356 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3358 /* Allow conversions between real types. */
3359 if (FLOAT_TYPE_P (TREE_TYPE (value
))
3360 && FLOAT_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3361 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3363 /* Allow length-preserving conversions between integer types. */
3364 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
3365 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
3366 && (TYPE_PRECISION (TREE_TYPE (value
))
3367 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
3368 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3370 /* Allow conversions between other integer types only if
3372 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
3373 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3375 tree inner
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3377 if (inner
== null_pointer_node
)
3378 return null_pointer_node
;
3382 /* Allow (int) &foo provided int is as wide as a pointer. */
3383 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
3384 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
3385 && (TYPE_PRECISION (TREE_TYPE (value
))
3386 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
3387 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3390 /* Likewise conversions from int to pointers, but also allow
3391 conversions from 0. */
3392 if ((POINTER_TYPE_P (TREE_TYPE (value
))
3393 || TREE_CODE (TREE_TYPE (value
)) == OFFSET_TYPE
)
3394 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3396 if (integer_zerop (TREE_OPERAND (value
, 0)))
3397 return null_pointer_node
;
3398 else if (TYPE_PRECISION (TREE_TYPE (value
))
3399 <= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0))))
3400 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3404 /* Allow conversions to struct or union types if the value
3406 if (TREE_CODE (TREE_TYPE (value
)) == RECORD_TYPE
3407 || TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
)
3408 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3413 if (! INTEGRAL_TYPE_P (endtype
)
3414 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
3416 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3418 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
3420 /* If either term is absolute, use the other terms relocation. */
3421 if (valid0
== null_pointer_node
)
3423 if (valid1
== null_pointer_node
)
3429 if (! INTEGRAL_TYPE_P (endtype
)
3430 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
3432 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3434 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
3436 /* Win if second argument is absolute. */
3437 if (valid1
== null_pointer_node
)
3439 /* Win if both arguments have the same relocation.
3440 Then the value is absolute. */
3441 if (valid0
== valid1
&& valid0
!= 0)
3442 return null_pointer_node
;
3444 /* Since GCC guarantees that string constants are unique in the
3445 generated code, a subtraction between two copies of the same
3446 constant string is absolute. */
3447 if (valid0
&& TREE_CODE (valid0
) == STRING_CST
&&
3448 valid1
&& TREE_CODE (valid1
) == STRING_CST
&&
3449 TREE_STRING_POINTER (valid0
) == TREE_STRING_POINTER (valid1
))
3450 return null_pointer_node
;
3453 /* Support differences between labels. */
3454 if (INTEGRAL_TYPE_P (endtype
))
3457 op0
= TREE_OPERAND (value
, 0);
3458 op1
= TREE_OPERAND (value
, 1);
3460 /* Like STRIP_NOPS except allow the operand mode to widen.
3461 This works around a feature of fold that simplifies
3462 (int)(p1 - p2) to ((int)p1 - (int)p2) under the theory
3463 that the narrower operation is cheaper. */
3465 while (TREE_CODE (op0
) == NOP_EXPR
3466 || TREE_CODE (op0
) == CONVERT_EXPR
3467 || TREE_CODE (op0
) == NON_LVALUE_EXPR
)
3469 tree inner
= TREE_OPERAND (op0
, 0);
3470 if (inner
== error_mark_node
3471 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner
)))
3472 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op0
)))
3473 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner
)))))
3478 while (TREE_CODE (op1
) == NOP_EXPR
3479 || TREE_CODE (op1
) == CONVERT_EXPR
3480 || TREE_CODE (op1
) == NON_LVALUE_EXPR
)
3482 tree inner
= TREE_OPERAND (op1
, 0);
3483 if (inner
== error_mark_node
3484 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner
)))
3485 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op1
)))
3486 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner
)))))
3491 if (TREE_CODE (op0
) == ADDR_EXPR
3492 && TREE_CODE (TREE_OPERAND (op0
, 0)) == LABEL_DECL
3493 && TREE_CODE (op1
) == ADDR_EXPR
3494 && TREE_CODE (TREE_OPERAND (op1
, 0)) == LABEL_DECL
)
3495 return null_pointer_node
;
3506 /* Output assembler code for constant EXP to FILE, with no label.
3507 This includes the pseudo-op such as ".int" or ".byte", and a newline.
3508 Assumes output_addressed_constants has been done on EXP already.
3510 Generate exactly SIZE bytes of assembler data, padding at the end
3511 with zeros if necessary. SIZE must always be specified.
3513 SIZE is important for structure constructors,
3514 since trailing members may have been omitted from the constructor.
3515 It is also important for initialization of arrays from string constants
3516 since the full length of the string constant might not be wanted.
3517 It is also needed for initialization of unions, where the initializer's
3518 type is just one member, and that may not be as long as the union.
3520 There a case in which we would fail to output exactly SIZE bytes:
3521 for a structure constructor that wants to produce more than SIZE bytes.
3522 But such constructors will never be generated for any possible input.
3524 ALIGN is the alignment of the data in bits. */
3527 output_constant (tree exp
, unsigned HOST_WIDE_INT size
, unsigned int align
)
3529 enum tree_code code
;
3530 unsigned HOST_WIDE_INT thissize
;
3532 /* Some front-ends use constants other than the standard language-independent
3533 varieties, but which may still be output directly. Give the front-end a
3534 chance to convert EXP to a language-independent representation. */
3535 exp
= lang_hooks
.expand_constant (exp
);
3537 if (size
== 0 || flag_syntax_only
)
3540 /* Eliminate any conversions since we'll be outputting the underlying
3542 while (TREE_CODE (exp
) == NOP_EXPR
|| TREE_CODE (exp
) == CONVERT_EXPR
3543 || TREE_CODE (exp
) == NON_LVALUE_EXPR
3544 || TREE_CODE (exp
) == VIEW_CONVERT_EXPR
)
3545 exp
= TREE_OPERAND (exp
, 0);
3547 code
= TREE_CODE (TREE_TYPE (exp
));
3548 thissize
= int_size_in_bytes (TREE_TYPE (exp
));
3550 /* Allow a constructor with no elements for any data type.
3551 This means to fill the space with zeros. */
3552 if (TREE_CODE (exp
) == CONSTRUCTOR
&& CONSTRUCTOR_ELTS (exp
) == 0)
3554 assemble_zeros (size
);
3558 if (TREE_CODE (exp
) == FDESC_EXPR
)
3560 #ifdef ASM_OUTPUT_FDESC
3561 HOST_WIDE_INT part
= tree_low_cst (TREE_OPERAND (exp
, 1), 0);
3562 tree decl
= TREE_OPERAND (exp
, 0);
3563 ASM_OUTPUT_FDESC (asm_out_file
, decl
, part
);
3570 /* Now output the underlying data. If we've handling the padding, return.
3571 Otherwise, break and ensure THISSIZE is the size written. */
3579 case REFERENCE_TYPE
:
3581 if (! assemble_integer (expand_expr (exp
, NULL_RTX
, VOIDmode
,
3582 EXPAND_INITIALIZER
),
3584 error ("initializer for integer value is too complicated");
3588 if (TREE_CODE (exp
) != REAL_CST
)
3589 error ("initializer for floating value is not a floating constant");
3591 assemble_real (TREE_REAL_CST (exp
), TYPE_MODE (TREE_TYPE (exp
)), align
);
3595 output_constant (TREE_REALPART (exp
), thissize
/ 2, align
);
3596 output_constant (TREE_IMAGPART (exp
), thissize
/ 2,
3597 min_align (align
, BITS_PER_UNIT
* (thissize
/ 2)));
3602 if (TREE_CODE (exp
) == CONSTRUCTOR
)
3604 output_constructor (exp
, size
, align
);
3607 else if (TREE_CODE (exp
) == STRING_CST
)
3609 thissize
= MIN ((unsigned HOST_WIDE_INT
)TREE_STRING_LENGTH (exp
),
3611 assemble_string (TREE_STRING_POINTER (exp
), thissize
);
3613 else if (TREE_CODE (exp
) == VECTOR_CST
)
3617 unsigned int nalign
;
3618 enum machine_mode inner
;
3620 inner
= GET_MODE_INNER (TYPE_MODE (TREE_TYPE (exp
)));
3621 nalign
= MIN (align
, GET_MODE_ALIGNMENT (inner
));
3623 elt_size
= GET_MODE_UNIT_SIZE (TYPE_MODE (TREE_TYPE (exp
)));
3625 link
= TREE_VECTOR_CST_ELTS (exp
);
3626 output_constant (TREE_VALUE (link
), elt_size
, align
);
3627 while ((link
= TREE_CHAIN (link
)) != NULL
)
3628 output_constant (TREE_VALUE (link
), elt_size
, nalign
);
3636 if (TREE_CODE (exp
) == CONSTRUCTOR
)
3637 output_constructor (exp
, size
, align
);
3643 if (TREE_CODE (exp
) == INTEGER_CST
)
3644 assemble_integer (expand_expr (exp
, NULL_RTX
,
3645 VOIDmode
, EXPAND_INITIALIZER
),
3646 thissize
, align
, 1);
3647 else if (TREE_CODE (exp
) == CONSTRUCTOR
)
3649 unsigned char *buffer
= alloca (thissize
);
3650 if (get_set_constructor_bytes (exp
, buffer
, thissize
))
3652 assemble_string ((char *) buffer
, thissize
);
3655 error ("unknown set constructor type");
3665 if (size
> thissize
)
3666 assemble_zeros (size
- thissize
);
3670 /* Subroutine of output_constructor, used for computing the size of
3671 arrays of unspecified length. VAL must be a CONSTRUCTOR of an array
3672 type with an unspecified upper bound. */
3674 static unsigned HOST_WIDE_INT
3675 array_size_for_constructor (tree val
)
3679 /* This code used to attempt to handle string constants that are not
3680 arrays of single-bytes, but nothing else does, so there's no point in
3682 if (TREE_CODE (val
) == STRING_CST
)
3683 return TREE_STRING_LENGTH (val
);
3685 max_index
= NULL_TREE
;
3686 for (i
= CONSTRUCTOR_ELTS (val
); i
; i
= TREE_CHAIN (i
))
3688 tree index
= TREE_PURPOSE (i
);
3690 if (TREE_CODE (index
) == RANGE_EXPR
)
3691 index
= TREE_OPERAND (index
, 1);
3692 if (max_index
== NULL_TREE
|| tree_int_cst_lt (max_index
, index
))
3696 if (max_index
== NULL_TREE
)
3699 /* Compute the total number of array elements. */
3700 i
= size_binop (MINUS_EXPR
, convert (sizetype
, max_index
),
3702 TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (val
)))));
3703 i
= size_binop (PLUS_EXPR
, i
, convert (sizetype
, integer_one_node
));
3705 /* Multiply by the array element unit size to find number of bytes. */
3706 i
= size_binop (MULT_EXPR
, i
, TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (val
))));
3708 return tree_low_cst (i
, 1);
3711 /* Subroutine of output_constant, used for CONSTRUCTORs (aggregate constants).
3712 Generate at least SIZE bytes, padding if necessary. */
3715 output_constructor (tree exp
, unsigned HOST_WIDE_INT size
,
3718 tree type
= TREE_TYPE (exp
);
3719 tree link
, field
= 0;
3721 /* Number of bytes output or skipped so far.
3722 In other words, current position within the constructor. */
3723 HOST_WIDE_INT total_bytes
= 0;
3724 /* Nonzero means BYTE contains part of a byte, to be output. */
3725 int byte_buffer_in_use
= 0;
3728 if (HOST_BITS_PER_WIDE_INT
< BITS_PER_UNIT
)
3731 if (TREE_CODE (type
) == RECORD_TYPE
)
3732 field
= TYPE_FIELDS (type
);
3734 if (TREE_CODE (type
) == ARRAY_TYPE
3735 && TYPE_DOMAIN (type
) != 0)
3736 min_index
= TYPE_MIN_VALUE (TYPE_DOMAIN (type
));
3738 /* As LINK goes through the elements of the constant,
3739 FIELD goes through the structure fields, if the constant is a structure.
3740 if the constant is a union, then we override this,
3741 by getting the field from the TREE_LIST element.
3742 But the constant could also be an array. Then FIELD is zero.
3744 There is always a maximum of one element in the chain LINK for unions
3745 (even if the initializer in a source program incorrectly contains
3747 for (link
= CONSTRUCTOR_ELTS (exp
);
3749 link
= TREE_CHAIN (link
),
3750 field
= field
? TREE_CHAIN (field
) : 0)
3752 tree val
= TREE_VALUE (link
);
3755 /* The element in a union constructor specifies the proper field
3757 if ((TREE_CODE (type
) == RECORD_TYPE
|| TREE_CODE (type
) == UNION_TYPE
3758 || TREE_CODE (type
) == QUAL_UNION_TYPE
)
3759 && TREE_PURPOSE (link
) != 0)
3760 field
= TREE_PURPOSE (link
);
3762 else if (TREE_CODE (type
) == ARRAY_TYPE
)
3763 index
= TREE_PURPOSE (link
);
3765 #ifdef ASM_COMMENT_START
3766 if (field
&& flag_verbose_asm
)
3767 fprintf (asm_out_file
, "%s %s:\n",
3770 ? IDENTIFIER_POINTER (DECL_NAME (field
))
3774 /* Eliminate the marker that makes a cast not be an lvalue. */
3778 if (index
&& TREE_CODE (index
) == RANGE_EXPR
)
3780 unsigned HOST_WIDE_INT fieldsize
3781 = int_size_in_bytes (TREE_TYPE (type
));
3782 HOST_WIDE_INT lo_index
= tree_low_cst (TREE_OPERAND (index
, 0), 0);
3783 HOST_WIDE_INT hi_index
= tree_low_cst (TREE_OPERAND (index
, 1), 0);
3784 HOST_WIDE_INT index
;
3785 unsigned int align2
= min_align (align
, fieldsize
* BITS_PER_UNIT
);
3787 for (index
= lo_index
; index
<= hi_index
; index
++)
3789 /* Output the element's initial value. */
3791 assemble_zeros (fieldsize
);
3793 output_constant (val
, fieldsize
, align2
);
3795 /* Count its size. */
3796 total_bytes
+= fieldsize
;
3799 else if (field
== 0 || !DECL_BIT_FIELD (field
))
3801 /* An element that is not a bit-field. */
3803 unsigned HOST_WIDE_INT fieldsize
;
3804 /* Since this structure is static,
3805 we know the positions are constant. */
3806 HOST_WIDE_INT pos
= field
? int_byte_position (field
) : 0;
3807 unsigned int align2
;
3810 pos
= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (val
)), 1)
3811 * (tree_low_cst (index
, 0) - tree_low_cst (min_index
, 0)));
3813 /* Output any buffered-up bit-fields preceding this element. */
3814 if (byte_buffer_in_use
)
3816 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
3818 byte_buffer_in_use
= 0;
3821 /* Advance to offset of this element.
3822 Note no alignment needed in an array, since that is guaranteed
3823 if each element has the proper size. */
3824 if ((field
!= 0 || index
!= 0) && pos
!= total_bytes
)
3826 assemble_zeros (pos
- total_bytes
);
3830 /* Find the alignment of this element. */
3831 align2
= min_align (align
, BITS_PER_UNIT
* pos
);
3833 /* Determine size this element should occupy. */
3838 /* If this is an array with an unspecified upper bound,
3839 the initializer determines the size. */
3840 /* ??? This ought to only checked if DECL_SIZE_UNIT is NULL,
3841 but we cannot do this until the deprecated support for
3842 initializing zero-length array members is removed. */
3843 if (TREE_CODE (TREE_TYPE (field
)) == ARRAY_TYPE
3844 && TYPE_DOMAIN (TREE_TYPE (field
))
3845 && ! TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (field
))))
3847 fieldsize
= array_size_for_constructor (val
);
3848 /* Given a non-empty initialization, this field had
3850 if (fieldsize
!= 0 && TREE_CHAIN (field
) != NULL_TREE
)
3853 else if (DECL_SIZE_UNIT (field
))
3855 /* ??? This can't be right. If the decl size overflows
3856 a host integer we will silently emit no data. */
3857 if (host_integerp (DECL_SIZE_UNIT (field
), 1))
3858 fieldsize
= tree_low_cst (DECL_SIZE_UNIT (field
), 1);
3862 fieldsize
= int_size_in_bytes (TREE_TYPE (type
));
3864 /* Output the element's initial value. */
3866 assemble_zeros (fieldsize
);
3868 output_constant (val
, fieldsize
, align2
);
3870 /* Count its size. */
3871 total_bytes
+= fieldsize
;
3873 else if (val
!= 0 && TREE_CODE (val
) != INTEGER_CST
)
3874 error ("invalid initial value for member `%s'",
3875 IDENTIFIER_POINTER (DECL_NAME (field
)));
3878 /* Element that is a bit-field. */
3880 HOST_WIDE_INT next_offset
= int_bit_position (field
);
3881 HOST_WIDE_INT end_offset
3882 = (next_offset
+ tree_low_cst (DECL_SIZE (field
), 1));
3885 val
= integer_zero_node
;
3887 /* If this field does not start in this (or, next) byte,
3889 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
3891 /* Output remnant of any bit field in previous bytes. */
3892 if (byte_buffer_in_use
)
3894 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
3896 byte_buffer_in_use
= 0;
3899 /* If still not at proper byte, advance to there. */
3900 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
3902 assemble_zeros (next_offset
/ BITS_PER_UNIT
- total_bytes
);
3903 total_bytes
= next_offset
/ BITS_PER_UNIT
;
3907 if (! byte_buffer_in_use
)
3910 /* We must split the element into pieces that fall within
3911 separate bytes, and combine each byte with previous or
3912 following bit-fields. */
3914 /* next_offset is the offset n fbits from the beginning of
3915 the structure to the next bit of this element to be processed.
3916 end_offset is the offset of the first bit past the end of
3918 while (next_offset
< end_offset
)
3922 HOST_WIDE_INT value
;
3923 HOST_WIDE_INT next_byte
= next_offset
/ BITS_PER_UNIT
;
3924 HOST_WIDE_INT next_bit
= next_offset
% BITS_PER_UNIT
;
3926 /* Advance from byte to byte
3927 within this element when necessary. */
3928 while (next_byte
!= total_bytes
)
3930 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
3935 /* Number of bits we can process at once
3936 (all part of the same byte). */
3937 this_time
= MIN (end_offset
- next_offset
,
3938 BITS_PER_UNIT
- next_bit
);
3939 if (BYTES_BIG_ENDIAN
)
3941 /* On big-endian machine, take the most significant bits
3942 first (of the bits that are significant)
3943 and put them into bytes from the most significant end. */
3944 shift
= end_offset
- next_offset
- this_time
;
3946 /* Don't try to take a bunch of bits that cross
3947 the word boundary in the INTEGER_CST. We can
3948 only select bits from the LOW or HIGH part
3950 if (shift
< HOST_BITS_PER_WIDE_INT
3951 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
3953 this_time
= shift
+ this_time
- HOST_BITS_PER_WIDE_INT
;
3954 shift
= HOST_BITS_PER_WIDE_INT
;
3957 /* Now get the bits from the appropriate constant word. */
3958 if (shift
< HOST_BITS_PER_WIDE_INT
)
3959 value
= TREE_INT_CST_LOW (val
);
3960 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
3962 value
= TREE_INT_CST_HIGH (val
);
3963 shift
-= HOST_BITS_PER_WIDE_INT
;
3968 /* Get the result. This works only when:
3969 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
3970 byte
|= (((value
>> shift
)
3971 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
3972 << (BITS_PER_UNIT
- this_time
- next_bit
));
3976 /* On little-endian machines,
3977 take first the least significant bits of the value
3978 and pack them starting at the least significant
3979 bits of the bytes. */
3980 shift
= next_offset
- int_bit_position (field
);
3982 /* Don't try to take a bunch of bits that cross
3983 the word boundary in the INTEGER_CST. We can
3984 only select bits from the LOW or HIGH part
3986 if (shift
< HOST_BITS_PER_WIDE_INT
3987 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
3988 this_time
= (HOST_BITS_PER_WIDE_INT
- shift
);
3990 /* Now get the bits from the appropriate constant word. */
3991 if (shift
< HOST_BITS_PER_WIDE_INT
)
3992 value
= TREE_INT_CST_LOW (val
);
3993 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
3995 value
= TREE_INT_CST_HIGH (val
);
3996 shift
-= HOST_BITS_PER_WIDE_INT
;
4001 /* Get the result. This works only when:
4002 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4003 byte
|= (((value
>> shift
)
4004 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4008 next_offset
+= this_time
;
4009 byte_buffer_in_use
= 1;
4014 if (byte_buffer_in_use
)
4016 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4020 if ((unsigned HOST_WIDE_INT
)total_bytes
< size
)
4021 assemble_zeros (size
- total_bytes
);
4024 /* This TREE_LIST contains any weak symbol declarations waiting
4026 static GTY(()) tree weak_decls
;
4028 /* Mark DECL as weak. */
4031 mark_weak (tree decl
)
4033 DECL_WEAK (decl
) = 1;
4035 if (DECL_RTL_SET_P (decl
)
4036 && GET_CODE (DECL_RTL (decl
)) == MEM
4037 && XEXP (DECL_RTL (decl
), 0)
4038 && GET_CODE (XEXP (DECL_RTL (decl
), 0)) == SYMBOL_REF
)
4039 SYMBOL_REF_WEAK (XEXP (DECL_RTL (decl
), 0)) = 1;
4042 /* Merge weak status between NEWDECL and OLDDECL. */
4045 merge_weak (tree newdecl
, tree olddecl
)
4047 if (DECL_WEAK (newdecl
) == DECL_WEAK (olddecl
))
4050 if (DECL_WEAK (newdecl
))
4054 /* NEWDECL is weak, but OLDDECL is not. */
4056 /* If we already output the OLDDECL, we're in trouble; we can't
4057 go back and make it weak. This error cannot caught in
4058 declare_weak because the NEWDECL and OLDDECL was not yet
4059 been merged; therefore, TREE_ASM_WRITTEN was not set. */
4060 if (TREE_ASM_WRITTEN (olddecl
))
4061 error ("%Jweak declaration of '%D' must precede definition",
4064 /* If we've already generated rtl referencing OLDDECL, we may
4065 have done so in a way that will not function properly with
4067 else if (TREE_USED (olddecl
)
4068 && TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (olddecl
)))
4069 warning ("%Jweak declaration of '%D' after first use results "
4070 "in unspecified behavior", newdecl
, newdecl
);
4074 /* We put the NEWDECL on the weak_decls list at some point.
4075 Replace it with the OLDDECL. */
4076 for (wd
= weak_decls
; wd
; wd
= TREE_CHAIN (wd
))
4077 if (TREE_VALUE (wd
) == newdecl
)
4079 TREE_VALUE (wd
) = olddecl
;
4082 /* We may not find the entry on the list. If NEWDECL is a
4083 weak alias, then we will have already called
4084 globalize_decl to remove the entry; in that case, we do
4085 not need to do anything. */
4088 /* Make the OLDDECL weak; it's OLDDECL that we'll be keeping. */
4089 mark_weak (olddecl
);
4092 /* OLDDECL was weak, but NEWDECL was not explicitly marked as
4093 weak. Just update NEWDECL to indicate that it's weak too. */
4094 mark_weak (newdecl
);
4097 /* Declare DECL to be a weak symbol. */
4100 declare_weak (tree decl
)
4102 if (! TREE_PUBLIC (decl
))
4103 error ("%Jweak declaration of '%D' must be public", decl
, decl
);
4104 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& TREE_ASM_WRITTEN (decl
))
4105 error ("%Jweak declaration of '%D' must precede definition", decl
, decl
);
4106 else if (SUPPORTS_WEAK
)
4108 if (! DECL_WEAK (decl
))
4109 weak_decls
= tree_cons (NULL
, decl
, weak_decls
);
4112 warning ("%Jweak declaration of '%D' not supported", decl
, decl
);
4117 /* Emit any pending weak declarations. */
4124 for (t
= weak_decls
; t
; t
= TREE_CHAIN (t
))
4126 tree decl
= TREE_VALUE (t
);
4127 #if defined (ASM_WEAKEN_DECL) || defined (ASM_WEAKEN_LABEL)
4128 const char *const name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
4131 if (! TREE_USED (decl
))
4134 #ifdef ASM_WEAKEN_DECL
4135 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, NULL
);
4137 #ifdef ASM_WEAKEN_LABEL
4138 ASM_WEAKEN_LABEL (asm_out_file
, name
);
4140 #ifdef ASM_OUTPUT_WEAK_ALIAS
4141 warning ("only weak aliases are supported in this configuration");
4149 /* Emit the assembly bits to indicate that DECL is globally visible. */
4152 globalize_decl (tree decl
)
4154 const char *name
= XSTR (XEXP (DECL_RTL (decl
), 0), 0);
4156 #if defined (ASM_WEAKEN_LABEL) || defined (ASM_WEAKEN_DECL)
4157 if (DECL_WEAK (decl
))
4161 #ifdef ASM_WEAKEN_DECL
4162 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, 0);
4164 ASM_WEAKEN_LABEL (asm_out_file
, name
);
4167 /* Remove this function from the pending weak list so that
4168 we do not emit multiple .weak directives for it. */
4169 for (p
= &weak_decls
; (t
= *p
) ; )
4171 if (DECL_ASSEMBLER_NAME (decl
) == DECL_ASSEMBLER_NAME (TREE_VALUE (t
)))
4172 *p
= TREE_CHAIN (t
);
4174 p
= &TREE_CHAIN (t
);
4178 #elif defined(ASM_MAKE_LABEL_LINKONCE)
4179 if (DECL_ONE_ONLY (decl
))
4180 ASM_MAKE_LABEL_LINKONCE (asm_out_file
, name
);
4183 targetm
.asm_out
.globalize_label (asm_out_file
, name
);
4186 /* Emit an assembler directive to make the symbol for DECL an alias to
4187 the symbol for TARGET. */
4190 assemble_alias (tree decl
, tree target ATTRIBUTE_UNUSED
)
4194 /* We must force creation of DECL_RTL for debug info generation, even though
4195 we don't use it here. */
4196 make_decl_rtl (decl
, NULL
);
4198 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
4200 #ifdef ASM_OUTPUT_DEF
4201 /* Make name accessible from other files, if appropriate. */
4203 if (TREE_PUBLIC (decl
))
4205 globalize_decl (decl
);
4206 maybe_assemble_visibility (decl
);
4209 #ifdef ASM_OUTPUT_DEF_FROM_DECLS
4210 ASM_OUTPUT_DEF_FROM_DECLS (asm_out_file
, decl
, target
);
4212 ASM_OUTPUT_DEF (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4214 #else /* !ASM_OUTPUT_DEF */
4215 #if defined (ASM_OUTPUT_WEAK_ALIAS) || defined (ASM_WEAKEN_DECL)
4216 if (DECL_WEAK (decl
))
4219 #ifdef ASM_WEAKEN_DECL
4220 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, IDENTIFIER_POINTER (target
));
4222 ASM_OUTPUT_WEAK_ALIAS (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4224 /* Remove this function from the pending weak list so that
4225 we do not emit multiple .weak directives for it. */
4226 for (p
= &weak_decls
; (t
= *p
) ; )
4227 if (DECL_ASSEMBLER_NAME (decl
)
4228 == DECL_ASSEMBLER_NAME (TREE_VALUE (t
)))
4229 *p
= TREE_CHAIN (t
);
4231 p
= &TREE_CHAIN (t
);
4234 warning ("only weak aliases are supported in this configuration");
4237 warning ("alias definitions not supported in this configuration; ignored");
4241 TREE_USED (decl
) = 1;
4242 TREE_ASM_WRITTEN (decl
) = 1;
4243 TREE_ASM_WRITTEN (DECL_ASSEMBLER_NAME (decl
)) = 1;
4246 /* Emit an assembler directive to set symbol for DECL visibility to
4247 the visibility type VIS, which must not be VISIBILITY_DEFAULT. */
4250 default_assemble_visibility (tree decl
, int vis
)
4252 static const char * const visibility_types
[] = {
4253 NULL
, "internal", "hidden", "protected"
4256 const char *name
, *type
;
4258 name
= (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
4259 type
= visibility_types
[vis
];
4261 #ifdef HAVE_GAS_HIDDEN
4262 fprintf (asm_out_file
, "\t.%s\t", type
);
4263 assemble_name (asm_out_file
, name
);
4264 fprintf (asm_out_file
, "\n");
4266 warning ("visibility attribute not supported in this configuration; ignored");
4270 /* A helper function to call assemble_visibility when needed for a decl. */
4273 maybe_assemble_visibility (tree decl
)
4275 enum symbol_visibility vis
= DECL_VISIBILITY (decl
);
4277 if (vis
!= VISIBILITY_DEFAULT
)
4278 targetm
.asm_out
.visibility (decl
, vis
);
4281 /* Returns 1 if the target configuration supports defining public symbols
4282 so that one of them will be chosen at link time instead of generating a
4283 multiply-defined symbol error, whether through the use of weak symbols or
4284 a target-specific mechanism for having duplicates discarded. */
4287 supports_one_only (void)
4289 if (SUPPORTS_ONE_ONLY
)
4291 return SUPPORTS_WEAK
;
4294 /* Set up DECL as a public symbol that can be defined in multiple
4295 translation units without generating a linker error. */
4298 make_decl_one_only (tree decl
)
4300 if (TREE_CODE (decl
) != VAR_DECL
&& TREE_CODE (decl
) != FUNCTION_DECL
)
4303 TREE_PUBLIC (decl
) = 1;
4305 if (SUPPORTS_ONE_ONLY
)
4307 #ifdef MAKE_DECL_ONE_ONLY
4308 MAKE_DECL_ONE_ONLY (decl
);
4310 DECL_ONE_ONLY (decl
) = 1;
4312 else if (TREE_CODE (decl
) == VAR_DECL
4313 && (DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
))
4314 DECL_COMMON (decl
) = 1;
4315 else if (SUPPORTS_WEAK
)
4316 DECL_WEAK (decl
) = 1;
4322 init_varasm_once (void)
4324 in_named_htab
= htab_create_ggc (31, in_named_entry_hash
,
4325 in_named_entry_eq
, NULL
);
4326 const_desc_htab
= htab_create_ggc (1009, const_desc_hash
,
4327 const_desc_eq
, NULL
);
4329 const_alias_set
= new_alias_set ();
4333 decl_tls_model (tree decl
)
4335 enum tls_model kind
;
4336 tree attr
= lookup_attribute ("tls_model", DECL_ATTRIBUTES (decl
));
4341 attr
= TREE_VALUE (TREE_VALUE (attr
));
4342 if (TREE_CODE (attr
) != STRING_CST
)
4344 if (!strcmp (TREE_STRING_POINTER (attr
), "local-exec"))
4345 kind
= TLS_MODEL_LOCAL_EXEC
;
4346 else if (!strcmp (TREE_STRING_POINTER (attr
), "initial-exec"))
4347 kind
= TLS_MODEL_INITIAL_EXEC
;
4348 else if (!strcmp (TREE_STRING_POINTER (attr
), "local-dynamic"))
4349 kind
= optimize
? TLS_MODEL_LOCAL_DYNAMIC
: TLS_MODEL_GLOBAL_DYNAMIC
;
4350 else if (!strcmp (TREE_STRING_POINTER (attr
), "global-dynamic"))
4351 kind
= TLS_MODEL_GLOBAL_DYNAMIC
;
4357 is_local
= targetm
.binds_local_p (decl
);
4361 kind
= TLS_MODEL_LOCAL_EXEC
;
4363 kind
= TLS_MODEL_INITIAL_EXEC
;
4365 /* Local dynamic is inefficient when we're not combining the
4366 parts of the address. */
4367 else if (optimize
&& is_local
)
4368 kind
= TLS_MODEL_LOCAL_DYNAMIC
;
4370 kind
= TLS_MODEL_GLOBAL_DYNAMIC
;
4371 if (kind
< flag_tls_default
)
4372 kind
= flag_tls_default
;
4377 /* Select a set of attributes for section NAME based on the properties
4378 of DECL and whether or not RELOC indicates that DECL's initializer
4379 might contain runtime relocations.
4381 We make the section read-only and executable for a function decl,
4382 read-only for a const data decl, and writable for a non-const data decl. */
4385 default_section_type_flags (tree decl
, const char *name
, int reloc
)
4387 return default_section_type_flags_1 (decl
, name
, reloc
, flag_pic
);
4391 default_section_type_flags_1 (tree decl
, const char *name
, int reloc
,
4396 if (decl
&& TREE_CODE (decl
) == FUNCTION_DECL
)
4397 flags
= SECTION_CODE
;
4398 else if (decl
&& decl_readonly_section_1 (decl
, reloc
, shlib
))
4400 else if (strcmp (name
, UNLIKELY_EXECUTED_TEXT_SECTION_NAME
) == 0)
4401 flags
= SECTION_CODE
;
4403 flags
= SECTION_WRITE
;
4405 if (decl
&& DECL_ONE_ONLY (decl
))
4406 flags
|= SECTION_LINKONCE
;
4408 if (decl
&& TREE_CODE (decl
) == VAR_DECL
&& DECL_THREAD_LOCAL (decl
))
4409 flags
|= SECTION_TLS
| SECTION_WRITE
;
4411 if (strcmp (name
, ".bss") == 0
4412 || strncmp (name
, ".bss.", 5) == 0
4413 || strncmp (name
, ".gnu.linkonce.b.", 16) == 0
4414 || strcmp (name
, ".sbss") == 0
4415 || strncmp (name
, ".sbss.", 6) == 0
4416 || strncmp (name
, ".gnu.linkonce.sb.", 17) == 0
4417 || strcmp (name
, ".tbss") == 0
4418 || strncmp (name
, ".gnu.linkonce.tb.", 17) == 0)
4419 flags
|= SECTION_BSS
;
4421 if (strcmp (name
, ".tdata") == 0
4422 || strcmp (name
, ".tbss") == 0
4423 || strncmp (name
, ".gnu.linkonce.td.", 17) == 0
4424 || strncmp (name
, ".gnu.linkonce.tb.", 17) == 0)
4425 flags
|= SECTION_TLS
;
4427 /* These three sections have special ELF types. They are neither
4428 SHT_PROGBITS nor SHT_NOBITS, so when changing sections we don't
4429 want to print a section type (@progbits or @nobits). If someone
4430 is silly enough to emit code or TLS variables to one of these
4431 sections, then don't handle them specially. */
4432 if (!(flags
& (SECTION_CODE
| SECTION_BSS
| SECTION_TLS
))
4433 && (strcmp (name
, ".init_array") == 0
4434 || strcmp (name
, ".fini_array") == 0
4435 || strcmp (name
, ".preinit_array") == 0))
4436 flags
|= SECTION_NOTYPE
;
4441 /* Output assembly to switch to section NAME with attribute FLAGS.
4442 Four variants for common object file formats. */
4445 default_no_named_section (const char *name ATTRIBUTE_UNUSED
,
4446 unsigned int flags ATTRIBUTE_UNUSED
)
4448 /* Some object formats don't support named sections at all. The
4449 front-end should already have flagged this as an error. */
4454 default_elf_asm_named_section (const char *name
, unsigned int flags
)
4456 char flagchars
[10], *f
= flagchars
;
4458 if (! named_section_first_declaration (name
))
4460 fprintf (asm_out_file
, "\t.section\t%s\n", name
);
4464 if (!(flags
& SECTION_DEBUG
))
4466 if (flags
& SECTION_WRITE
)
4468 if (flags
& SECTION_CODE
)
4470 if (flags
& SECTION_SMALL
)
4472 if (flags
& SECTION_MERGE
)
4474 if (flags
& SECTION_STRINGS
)
4476 if (flags
& SECTION_TLS
)
4480 fprintf (asm_out_file
, "\t.section\t%s,\"%s\"", name
, flagchars
);
4482 if (!(flags
& SECTION_NOTYPE
))
4486 if (flags
& SECTION_BSS
)
4491 fprintf (asm_out_file
, ",@%s", type
);
4493 if (flags
& SECTION_ENTSIZE
)
4494 fprintf (asm_out_file
, ",%d", flags
& SECTION_ENTSIZE
);
4497 putc ('\n', asm_out_file
);
4501 default_coff_asm_named_section (const char *name
, unsigned int flags
)
4503 char flagchars
[8], *f
= flagchars
;
4505 if (flags
& SECTION_WRITE
)
4507 if (flags
& SECTION_CODE
)
4511 fprintf (asm_out_file
, "\t.section\t%s,\"%s\"\n", name
, flagchars
);
4515 default_pe_asm_named_section (const char *name
, unsigned int flags
)
4517 default_coff_asm_named_section (name
, flags
);
4519 if (flags
& SECTION_LINKONCE
)
4521 /* Functions may have been compiled at various levels of
4522 optimization so we can't use `same_size' here.
4523 Instead, have the linker pick one. */
4524 fprintf (asm_out_file
, "\t.linkonce %s\n",
4525 (flags
& SECTION_CODE
? "discard" : "same_size"));
4529 /* The lame default section selector. */
4532 default_select_section (tree decl
, int reloc
,
4533 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
)
4535 bool readonly
= false;
4539 if (decl_readonly_section (decl
, reloc
))
4542 else if (TREE_CODE (decl
) == CONSTRUCTOR
)
4544 if (! ((flag_pic
&& reloc
)
4545 || !TREE_READONLY (decl
)
4546 || TREE_SIDE_EFFECTS (decl
)
4547 || !TREE_CONSTANT (decl
)))
4550 else if (TREE_CODE (decl
) == STRING_CST
)
4552 else if (! (flag_pic
&& reloc
))
4556 readonly_data_section ();
4561 /* A helper function for default_elf_select_section and
4562 default_elf_unique_section. Categorizes the DECL. */
4564 enum section_category
4569 SECCAT_RODATA_MERGE_STR
,
4570 SECCAT_RODATA_MERGE_STR_INIT
,
4571 SECCAT_RODATA_MERGE_CONST
,
4576 /* To optimize loading of shared programs, define following subsections
4578 _REL Contains data that has relocations, so they get grouped
4579 together and dynamic linker will visit fewer pages in memory.
4580 _RO Contains data that is otherwise read-only. This is useful
4581 with prelinking as most relocations won't be dynamically
4582 linked and thus stay read only.
4583 _LOCAL Marks data containing relocations only to local objects.
4584 These relocations will get fully resolved by prelinking. */
4586 SECCAT_DATA_REL_LOCAL
,
4588 SECCAT_DATA_REL_RO_LOCAL
,
4598 static enum section_category
4599 categorize_decl_for_section (tree
, int, int);
4601 static enum section_category
4602 categorize_decl_for_section (tree decl
, int reloc
, int shlib
)
4604 enum section_category ret
;
4606 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4608 else if (TREE_CODE (decl
) == STRING_CST
)
4610 if (flag_mudflap
) /* or !flag_merge_constants */
4611 return SECCAT_RODATA
;
4613 return SECCAT_RODATA_MERGE_STR
;
4615 else if (TREE_CODE (decl
) == VAR_DECL
)
4617 if (DECL_INITIAL (decl
) == NULL
4618 || DECL_INITIAL (decl
) == error_mark_node
)
4620 else if (! TREE_READONLY (decl
)
4621 || TREE_SIDE_EFFECTS (decl
)
4622 || ! TREE_CONSTANT (DECL_INITIAL (decl
)))
4624 if (shlib
&& (reloc
& 2))
4625 ret
= SECCAT_DATA_REL
;
4626 else if (shlib
&& reloc
)
4627 ret
= SECCAT_DATA_REL_LOCAL
;
4631 else if (shlib
&& (reloc
& 2))
4632 ret
= SECCAT_DATA_REL_RO
;
4633 else if (shlib
&& reloc
)
4634 ret
= SECCAT_DATA_REL_RO_LOCAL
;
4635 else if (reloc
|| flag_merge_constants
< 2)
4636 /* C and C++ don't allow different variables to share the same
4637 location. -fmerge-all-constants allows even that (at the
4638 expense of not conforming). */
4639 ret
= SECCAT_RODATA
;
4640 else if (TREE_CODE (DECL_INITIAL (decl
)) == STRING_CST
)
4641 ret
= SECCAT_RODATA_MERGE_STR_INIT
;
4643 ret
= SECCAT_RODATA_MERGE_CONST
;
4645 else if (TREE_CODE (decl
) == CONSTRUCTOR
)
4647 if ((shlib
&& reloc
)
4648 || TREE_SIDE_EFFECTS (decl
)
4649 || ! TREE_CONSTANT (decl
))
4652 ret
= SECCAT_RODATA
;
4655 ret
= SECCAT_RODATA
;
4657 /* There are no read-only thread-local sections. */
4658 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_THREAD_LOCAL (decl
))
4660 if (ret
== SECCAT_BSS
)
4666 /* If the target uses small data sections, select it. */
4667 else if (targetm
.in_small_data_p (decl
))
4669 if (ret
== SECCAT_BSS
)
4671 else if (targetm
.have_srodata_section
&& ret
== SECCAT_RODATA
)
4672 ret
= SECCAT_SRODATA
;
4681 decl_readonly_section (tree decl
, int reloc
)
4683 return decl_readonly_section_1 (decl
, reloc
, flag_pic
);
4687 decl_readonly_section_1 (tree decl
, int reloc
, int shlib
)
4689 switch (categorize_decl_for_section (decl
, reloc
, shlib
))
4692 case SECCAT_RODATA_MERGE_STR
:
4693 case SECCAT_RODATA_MERGE_STR_INIT
:
4694 case SECCAT_RODATA_MERGE_CONST
:
4695 case SECCAT_SRODATA
:
4704 /* Select a section based on the above categorization. */
4707 default_elf_select_section (tree decl
, int reloc
,
4708 unsigned HOST_WIDE_INT align
)
4710 default_elf_select_section_1 (decl
, reloc
, align
, flag_pic
);
4714 default_elf_select_section_1 (tree decl
, int reloc
,
4715 unsigned HOST_WIDE_INT align
, int shlib
)
4717 switch (categorize_decl_for_section (decl
, reloc
, shlib
))
4720 /* We're not supposed to be called on FUNCTION_DECLs. */
4723 readonly_data_section ();
4725 case SECCAT_RODATA_MERGE_STR
:
4726 mergeable_string_section (decl
, align
, 0);
4728 case SECCAT_RODATA_MERGE_STR_INIT
:
4729 mergeable_string_section (DECL_INITIAL (decl
), align
, 0);
4731 case SECCAT_RODATA_MERGE_CONST
:
4732 mergeable_constant_section (DECL_MODE (decl
), align
, 0);
4734 case SECCAT_SRODATA
:
4735 named_section (NULL_TREE
, ".sdata2", reloc
);
4740 case SECCAT_DATA_REL
:
4741 named_section (NULL_TREE
, ".data.rel", reloc
);
4743 case SECCAT_DATA_REL_LOCAL
:
4744 named_section (NULL_TREE
, ".data.rel.local", reloc
);
4746 case SECCAT_DATA_REL_RO
:
4747 named_section (NULL_TREE
, ".data.rel.ro", reloc
);
4749 case SECCAT_DATA_REL_RO_LOCAL
:
4750 named_section (NULL_TREE
, ".data.rel.ro.local", reloc
);
4753 named_section (NULL_TREE
, ".sdata", reloc
);
4756 named_section (NULL_TREE
, ".tdata", reloc
);
4759 #ifdef BSS_SECTION_ASM_OP
4762 named_section (NULL_TREE
, ".bss", reloc
);
4766 named_section (NULL_TREE
, ".sbss", reloc
);
4769 named_section (NULL_TREE
, ".tbss", reloc
);
4776 /* Construct a unique section name based on the decl name and the
4777 categorization performed above. */
4780 default_unique_section (tree decl
, int reloc
)
4782 default_unique_section_1 (decl
, reloc
, flag_pic
);
4786 default_unique_section_1 (tree decl
, int reloc
, int shlib
)
4788 bool one_only
= DECL_ONE_ONLY (decl
);
4789 const char *prefix
, *name
;
4793 switch (categorize_decl_for_section (decl
, reloc
, shlib
))
4796 prefix
= one_only
? ".gnu.linkonce.t." : ".text.";
4799 case SECCAT_RODATA_MERGE_STR
:
4800 case SECCAT_RODATA_MERGE_STR_INIT
:
4801 case SECCAT_RODATA_MERGE_CONST
:
4802 prefix
= one_only
? ".gnu.linkonce.r." : ".rodata.";
4804 case SECCAT_SRODATA
:
4805 prefix
= one_only
? ".gnu.linkonce.s2." : ".sdata2.";
4808 case SECCAT_DATA_REL
:
4809 case SECCAT_DATA_REL_LOCAL
:
4810 case SECCAT_DATA_REL_RO
:
4811 case SECCAT_DATA_REL_RO_LOCAL
:
4812 prefix
= one_only
? ".gnu.linkonce.d." : ".data.";
4815 prefix
= one_only
? ".gnu.linkonce.s." : ".sdata.";
4818 prefix
= one_only
? ".gnu.linkonce.b." : ".bss.";
4821 prefix
= one_only
? ".gnu.linkonce.sb." : ".sbss.";
4824 prefix
= one_only
? ".gnu.linkonce.td." : ".tdata.";
4827 prefix
= one_only
? ".gnu.linkonce.tb." : ".tbss.";
4832 plen
= strlen (prefix
);
4834 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
4835 name
= targetm
.strip_name_encoding (name
);
4836 nlen
= strlen (name
);
4838 string
= alloca (nlen
+ plen
+ 1);
4839 memcpy (string
, prefix
, plen
);
4840 memcpy (string
+ plen
, name
, nlen
+ 1);
4842 DECL_SECTION_NAME (decl
) = build_string (nlen
+ plen
, string
);
4846 default_select_rtx_section (enum machine_mode mode ATTRIBUTE_UNUSED
,
4848 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
)
4851 switch (GET_CODE (x
))
4863 readonly_data_section ();
4867 default_elf_select_rtx_section (enum machine_mode mode
, rtx x
,
4868 unsigned HOST_WIDE_INT align
)
4870 /* ??? Handle small data here somehow. */
4873 switch (GET_CODE (x
))
4877 named_section (NULL_TREE
, ".data.rel.ro", 3);
4881 named_section (NULL_TREE
, ".data.rel.ro.local", 1);
4888 mergeable_constant_section (mode
, align
, 0);
4891 /* Set the generally applicable flags on the SYMBOL_REF for EXP. */
4894 default_encode_section_info (tree decl
, rtx rtl
, int first ATTRIBUTE_UNUSED
)
4899 /* Careful not to prod global register variables. */
4900 if (GET_CODE (rtl
) != MEM
)
4902 symbol
= XEXP (rtl
, 0);
4903 if (GET_CODE (symbol
) != SYMBOL_REF
)
4907 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4908 flags
|= SYMBOL_FLAG_FUNCTION
;
4909 if (targetm
.binds_local_p (decl
))
4910 flags
|= SYMBOL_FLAG_LOCAL
;
4911 if (targetm
.in_small_data_p (decl
))
4912 flags
|= SYMBOL_FLAG_SMALL
;
4913 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_THREAD_LOCAL (decl
))
4914 flags
|= decl_tls_model (decl
) << SYMBOL_FLAG_TLS_SHIFT
;
4915 /* ??? Why is DECL_EXTERNAL ever set for non-PUBLIC names? Without
4916 being PUBLIC, the thing *must* be defined in this translation unit.
4917 Prevent this buglet from being propagated into rtl code as well. */
4918 if (DECL_P (decl
) && DECL_EXTERNAL (decl
) && TREE_PUBLIC (decl
))
4919 flags
|= SYMBOL_FLAG_EXTERNAL
;
4921 SYMBOL_REF_FLAGS (symbol
) = flags
;
4924 /* By default, we do nothing for encode_section_info, so we need not
4925 do anything but discard the '*' marker. */
4928 default_strip_name_encoding (const char *str
)
4930 return str
+ (*str
== '*');
4933 /* Assume ELF-ish defaults, since that's pretty much the most liberal
4934 wrt cross-module name binding. */
4937 default_binds_local_p (tree exp
)
4939 return default_binds_local_p_1 (exp
, flag_shlib
);
4943 default_binds_local_p_1 (tree exp
, int shlib
)
4947 /* A non-decl is an entry in the constant pool. */
4950 /* Static variables are always local. */
4951 else if (! TREE_PUBLIC (exp
))
4953 /* A variable is local if the user tells us so. */
4954 else if (DECL_VISIBILITY (exp
) != VISIBILITY_DEFAULT
)
4956 /* Otherwise, variables defined outside this object may not be local. */
4957 else if (DECL_EXTERNAL (exp
))
4959 /* Linkonce and weak data are never local. */
4960 else if (DECL_ONE_ONLY (exp
) || DECL_WEAK (exp
))
4962 /* If PIC, then assume that any global name can be overridden by
4963 symbols resolved from other modules. */
4966 /* Uninitialized COMMON variable may be unified with symbols
4967 resolved from other modules. */
4968 else if (DECL_COMMON (exp
)
4969 && (DECL_INITIAL (exp
) == NULL
4970 || DECL_INITIAL (exp
) == error_mark_node
))
4972 /* Otherwise we're left with initialized (or non-common) global data
4973 which is of necessity defined locally. */
4980 /* Determine whether or not a pointer mode is valid. Assume defaults
4981 of ptr_mode or Pmode - can be overridden. */
4983 default_valid_pointer_mode (enum machine_mode mode
)
4985 return (mode
== ptr_mode
|| mode
== Pmode
);
4988 /* Default function to output code that will globalize a label. A
4989 target must define GLOBAL_ASM_OP or provide it's own function to
4990 globalize a label. */
4991 #ifdef GLOBAL_ASM_OP
4993 default_globalize_label (FILE * stream
, const char *name
)
4995 fputs (GLOBAL_ASM_OP
, stream
);
4996 assemble_name (stream
, name
);
4997 putc ('\n', stream
);
4999 #endif /* GLOBAL_ASM_OP */
5001 /* Default function to output a label for unwind information. The
5002 default is to do nothing. A target that needs nonlocal labels for
5003 unwind information must provide its own function to do this. */
5005 default_emit_unwind_label (FILE * stream ATTRIBUTE_UNUSED
,
5006 tree decl ATTRIBUTE_UNUSED
,
5007 int empty ATTRIBUTE_UNUSED
)
5011 /* This is how to output an internal numbered label where PREFIX is
5012 the class of label and LABELNO is the number within the class. */
5015 default_internal_label (FILE *stream
, const char *prefix
,
5016 unsigned long labelno
)
5018 char *const buf
= alloca (40 + strlen (prefix
));
5019 ASM_GENERATE_INTERNAL_LABEL (buf
, prefix
, labelno
);
5020 ASM_OUTPUT_LABEL (stream
, buf
);
5023 /* This is the default behavior at the beginning of a file. It's
5024 controlled by two other target-hook toggles. */
5026 default_file_start (void)
5028 if (targetm
.file_start_app_off
&& !flag_verbose_asm
)
5029 fputs (ASM_APP_OFF
, asm_out_file
);
5031 if (targetm
.file_start_file_directive
)
5032 output_file_directive (asm_out_file
, main_input_filename
);
5035 /* This is a generic routine suitable for use as TARGET_ASM_FILE_END
5036 which emits a special section directive used to indicate whether or
5037 not this object file needs an executable stack. This is primarily
5038 a GNU extension to ELF but could be used on other targets. */
5040 int trampolines_created
;
5043 file_end_indicate_exec_stack (void)
5045 unsigned int flags
= SECTION_DEBUG
;
5046 if (trampolines_created
)
5047 flags
|= SECTION_CODE
;
5049 named_section_flags (".note.GNU-stack", flags
);
5052 #include "gt-varasm.h"