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 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. */
37 #include "hard-reg-set.h"
47 #include "langhooks.h"
52 #ifdef XCOFF_DEBUGGING_INFO
53 #include "xcoffout.h" /* Needed for external data
54 declarations for e.g. AIX 4.x. */
57 #ifndef TRAMPOLINE_ALIGNMENT
58 #define TRAMPOLINE_ALIGNMENT FUNCTION_BOUNDARY
62 #define ASM_STABS_OP "\t.stabs\t"
65 /* The (assembler) name of the first globally-visible object output. */
66 const char *first_global_object_name
;
67 const char *weak_global_object_name
;
69 extern struct obstack permanent_obstack
;
70 #define obstack_chunk_alloc xmalloc
73 struct constant_descriptor
;
77 #define MAX_RTX_HASH_TABLE 61
81 /* Hash facility for making memory-constants
82 from constant rtl-expressions. It is used on RISC machines
83 where immediate integer arguments and constant addresses are restricted
84 so that such constants must be stored in memory.
86 This pool of constants is reinitialized for each function
87 so each function gets its own constants-pool that comes right before
89 struct constant_descriptor
**x_const_rtx_hash_table
;
90 struct pool_constant
**x_const_rtx_sym_hash_table
;
92 /* Pointers to first and last constant in pool. */
93 struct pool_constant
*x_first_pool
, *x_last_pool
;
95 /* Current offset in constant pool (does not include any machine-specific
97 HOST_WIDE_INT x_pool_offset
;
99 /* Chain of all CONST_DOUBLE rtx's constructed for the current function.
100 They are chained through the CONST_DOUBLE_CHAIN. */
101 rtx x_const_double_chain
;
104 #define const_rtx_hash_table (cfun->varasm->x_const_rtx_hash_table)
105 #define const_rtx_sym_hash_table (cfun->varasm->x_const_rtx_sym_hash_table)
106 #define first_pool (cfun->varasm->x_first_pool)
107 #define last_pool (cfun->varasm->x_last_pool)
108 #define pool_offset (cfun->varasm->x_pool_offset)
109 #define const_double_chain (cfun->varasm->x_const_double_chain)
111 /* Number for making the label on the next
112 constant that is stored in memory. */
116 /* Number for making the label on the next
117 static variable internal to a function. */
121 /* Carry information from ASM_DECLARE_OBJECT_NAME
122 to ASM_FINISH_DECLARE_OBJECT. */
124 int size_directive_output
;
126 /* The last decl for which assemble_variable was called,
127 if it did ASM_DECLARE_OBJECT_NAME.
128 If the last call to assemble_variable didn't do that,
131 tree last_assemble_variable_decl
;
133 /* RTX_UNCHANGING_P in a MEM can mean it is stored into, for initialization.
134 So giving constant the alias set for the type will allow such
135 initializations to appear to conflict with the load of the constant. We
136 avoid this by giving all constants an alias set for just constants.
137 Since there will be no stores to that alias set, nothing will ever
138 conflict with them. */
140 static HOST_WIDE_INT const_alias_set
;
142 static const char *strip_reg_name
PARAMS ((const char *));
143 static int contains_pointers_p
PARAMS ((tree
));
144 static void decode_addr_const
PARAMS ((tree
, struct addr_const
*));
145 static int const_hash
PARAMS ((tree
));
146 static int compare_constant
PARAMS ((tree
,
147 struct constant_descriptor
*));
148 static const unsigned char *compare_constant_1
PARAMS ((tree
, const unsigned char *));
149 static struct constant_descriptor
*record_constant
PARAMS ((tree
));
150 static void record_constant_1
PARAMS ((tree
));
151 static tree copy_constant
PARAMS ((tree
));
152 static void output_constant_def_contents
PARAMS ((tree
, int, int));
153 static void decode_rtx_const
PARAMS ((enum machine_mode
, rtx
,
154 struct rtx_const
*));
155 static int const_hash_rtx
PARAMS ((enum machine_mode
, rtx
));
156 static int compare_constant_rtx
PARAMS ((enum machine_mode
, rtx
,
157 struct constant_descriptor
*));
158 static struct constant_descriptor
*record_constant_rtx
PARAMS ((enum machine_mode
,
160 static struct pool_constant
*find_pool_constant
PARAMS ((struct function
*, rtx
));
161 static void mark_constant_pool
PARAMS ((void));
162 static void mark_constants
PARAMS ((rtx
));
163 static int mark_constant
PARAMS ((rtx
*current_rtx
, void *data
));
164 static int output_addressed_constants
PARAMS ((tree
));
165 static void output_after_function_constants
PARAMS ((void));
166 static unsigned HOST_WIDE_INT array_size_for_constructor
PARAMS ((tree
));
167 static unsigned min_align
PARAMS ((unsigned, unsigned));
168 static void output_constructor
PARAMS ((tree
, HOST_WIDE_INT
,
170 static void globalize_decl
PARAMS ((tree
));
171 static void maybe_assemble_visibility
PARAMS ((tree
));
172 static int in_named_entry_eq
PARAMS ((const PTR
, const PTR
));
173 static hashval_t in_named_entry_hash
PARAMS ((const PTR
));
174 #ifdef ASM_OUTPUT_BSS
175 static void asm_output_bss
PARAMS ((FILE *, tree
, const char *, int, int));
177 #ifdef BSS_SECTION_ASM_OP
178 #ifdef ASM_OUTPUT_ALIGNED_BSS
179 static void asm_output_aligned_bss
PARAMS ((FILE *, tree
, const char *,
182 #endif /* BSS_SECTION_ASM_OP */
183 static void mark_pool_constant
PARAMS ((struct pool_constant
*));
184 static void mark_const_hash_entry
PARAMS ((void *));
185 static int mark_const_str_htab_1
PARAMS ((void **, void *));
186 static void mark_const_str_htab
PARAMS ((void *));
187 static hashval_t const_str_htab_hash
PARAMS ((const void *x
));
188 static int const_str_htab_eq
PARAMS ((const void *x
, const void *y
));
189 static void const_str_htab_del
PARAMS ((void *));
190 static void asm_emit_uninitialised
PARAMS ((tree
, const char*, int, int));
191 static void resolve_unique_section
PARAMS ((tree
, int));
193 static enum in_section
{ no_section
, in_text
, in_data
, in_named
194 #ifdef BSS_SECTION_ASM_OP
197 #ifdef CTORS_SECTION_ASM_OP
200 #ifdef DTORS_SECTION_ASM_OP
203 #ifdef EXTRA_SECTIONS
206 } in_section
= no_section
;
208 /* Return a non-zero value if DECL has a section attribute. */
209 #ifndef IN_NAMED_SECTION
210 #define IN_NAMED_SECTION(DECL) \
211 ((TREE_CODE (DECL) == FUNCTION_DECL || TREE_CODE (DECL) == VAR_DECL) \
212 && DECL_SECTION_NAME (DECL) != NULL_TREE)
215 /* Text of section name when in_section == in_named. */
216 static const char *in_named_name
;
218 /* Hash table of flags that have been used for a particular named section. */
220 struct in_named_entry
227 static htab_t in_named_htab
;
229 /* Define functions like text_section for any extra sections. */
230 #ifdef EXTRA_SECTION_FUNCTIONS
231 EXTRA_SECTION_FUNCTIONS
234 /* Tell assembler to switch to text section. */
239 if (in_section
!= in_text
)
244 fprintf (asm_out_file
, "%s\n", TEXT_SECTION_ASM_OP
);
246 in_section
= in_text
;
250 /* Tell assembler to switch to data section. */
255 if (in_section
!= in_data
)
257 if (flag_shared_data
)
259 #ifdef SHARED_SECTION_ASM_OP
260 fprintf (asm_out_file
, "%s\n", SHARED_SECTION_ASM_OP
);
262 fprintf (asm_out_file
, "%s\n", DATA_SECTION_ASM_OP
);
266 fprintf (asm_out_file
, "%s\n", DATA_SECTION_ASM_OP
);
268 in_section
= in_data
;
271 /* Tell assembler to ALWAYS switch to data section, in case
272 it's not sure where it is. */
275 force_data_section ()
277 in_section
= no_section
;
281 /* Tell assembler to switch to read-only data section. This is normally
285 readonly_data_section ()
287 #ifdef READONLY_DATA_SECTION
288 READONLY_DATA_SECTION (); /* Note this can call data_section. */
294 /* Determine if we're in the text section. */
299 return in_section
== in_text
;
302 /* Determine if we're in the data section. */
307 return in_section
== in_data
;
310 /* Helper routines for maintaining in_named_htab. */
313 in_named_entry_eq (p1
, p2
)
317 const struct in_named_entry
*old
= p1
;
318 const char *new = p2
;
320 return strcmp (old
->name
, new) == 0;
324 in_named_entry_hash (p
)
327 const struct in_named_entry
*old
= p
;
328 return htab_hash_string (old
->name
);
331 /* If SECTION has been seen before as a named section, return the flags
332 that were used. Otherwise, return 0. Note, that 0 is a perfectly valid
333 set of flags for a section to have, so 0 does not mean that the section
334 has not been seen. */
337 get_named_section_flags (section
)
340 struct in_named_entry
**slot
;
342 slot
= (struct in_named_entry
**)
343 htab_find_slot_with_hash (in_named_htab
, section
,
344 htab_hash_string (section
), NO_INSERT
);
346 return slot
? (*slot
)->flags
: 0;
349 /* Returns true if the section has been declared before. Sets internal
350 flag on this section in in_named_hash so subsequent calls on this
351 section will return false. */
354 named_section_first_declaration (name
)
357 struct in_named_entry
**slot
;
359 slot
= (struct in_named_entry
**)
360 htab_find_slot_with_hash (in_named_htab
, name
,
361 htab_hash_string (name
), NO_INSERT
);
362 if (! (*slot
)->declared
)
364 (*slot
)->declared
= true;
374 /* Record FLAGS for SECTION. If SECTION was previously recorded with a
375 different set of flags, return false. */
378 set_named_section_flags (section
, flags
)
382 struct in_named_entry
**slot
, *entry
;
384 slot
= (struct in_named_entry
**)
385 htab_find_slot_with_hash (in_named_htab
, section
,
386 htab_hash_string (section
), INSERT
);
391 entry
= (struct in_named_entry
*) xmalloc (sizeof (*entry
));
393 entry
->name
= ggc_strdup (section
);
394 entry
->flags
= flags
;
395 entry
->declared
= false;
397 else if (entry
->flags
!= flags
)
403 /* Tell assembler to change to section NAME with attributes FLAGS. */
406 named_section_flags (name
, flags
)
410 if (in_section
!= in_named
|| strcmp (name
, in_named_name
) != 0)
412 if (! set_named_section_flags (name
, flags
))
415 (* targetm
.asm_out
.named_section
) (name
, flags
);
417 if (flags
& SECTION_FORGET
)
418 in_section
= no_section
;
421 in_named_name
= ggc_strdup (name
);
422 in_section
= in_named
;
427 /* Tell assembler to change to section NAME for DECL.
428 If DECL is NULL, just switch to section NAME.
429 If NAME is NULL, get the name from DECL.
430 If RELOC is 1, the initializer for DECL contains relocs. */
433 named_section (decl
, name
, reloc
)
440 if (decl
!= NULL_TREE
&& !DECL_P (decl
))
443 name
= TREE_STRING_POINTER (DECL_SECTION_NAME (decl
));
445 flags
= (* targetm
.section_type_flags
) (decl
, name
, reloc
);
447 /* Sanity check user variables for flag changes. Non-user
448 section flag changes will abort in named_section_flags.
449 However, don't complain if SECTION_OVERRIDE is set.
450 We trust that the setter knows that it is safe to ignore
451 the default flags for this decl. */
452 if (decl
&& ! set_named_section_flags (name
, flags
))
454 flags
= get_named_section_flags (name
);
455 if ((flags
& SECTION_OVERRIDE
) == 0)
456 error_with_decl (decl
, "%s causes a section type conflict");
459 named_section_flags (name
, flags
);
462 /* If required, set DECL_SECTION_NAME to a unique name. */
465 resolve_unique_section (decl
, reloc
)
467 int reloc ATTRIBUTE_UNUSED
;
469 if (DECL_SECTION_NAME (decl
) == NULL_TREE
470 && (flag_function_sections
471 || (targetm
.have_named_sections
472 && DECL_ONE_ONLY (decl
))))
473 UNIQUE_SECTION (decl
, reloc
);
476 #ifdef BSS_SECTION_ASM_OP
478 /* Tell the assembler to switch to the bss section. */
483 if (in_section
!= in_bss
)
485 #ifdef SHARED_BSS_SECTION_ASM_OP
486 if (flag_shared_data
)
487 fprintf (asm_out_file
, "%s\n", SHARED_BSS_SECTION_ASM_OP
);
490 fprintf (asm_out_file
, "%s\n", BSS_SECTION_ASM_OP
);
496 #ifdef ASM_OUTPUT_BSS
498 /* Utility function for ASM_OUTPUT_BSS for targets to use if
499 they don't support alignments in .bss.
500 ??? It is believed that this function will work in most cases so such
501 support is localized here. */
504 asm_output_bss (file
, decl
, name
, size
, rounded
)
506 tree decl ATTRIBUTE_UNUSED
;
508 int size ATTRIBUTE_UNUSED
, rounded
;
510 ASM_GLOBALIZE_LABEL (file
, name
);
512 #ifdef ASM_DECLARE_OBJECT_NAME
513 last_assemble_variable_decl
= decl
;
514 ASM_DECLARE_OBJECT_NAME (file
, name
, decl
);
516 /* Standard thing is just output label for the object. */
517 ASM_OUTPUT_LABEL (file
, name
);
518 #endif /* ASM_DECLARE_OBJECT_NAME */
519 ASM_OUTPUT_SKIP (file
, rounded
);
524 #ifdef ASM_OUTPUT_ALIGNED_BSS
526 /* Utility function for targets to use in implementing
527 ASM_OUTPUT_ALIGNED_BSS.
528 ??? It is believed that this function will work in most cases so such
529 support is localized here. */
532 asm_output_aligned_bss (file
, decl
, name
, size
, align
)
534 tree decl ATTRIBUTE_UNUSED
;
538 ASM_GLOBALIZE_LABEL (file
, name
);
540 ASM_OUTPUT_ALIGN (file
, floor_log2 (align
/ BITS_PER_UNIT
));
541 #ifdef ASM_DECLARE_OBJECT_NAME
542 last_assemble_variable_decl
= decl
;
543 ASM_DECLARE_OBJECT_NAME (file
, name
, decl
);
545 /* Standard thing is just output label for the object. */
546 ASM_OUTPUT_LABEL (file
, name
);
547 #endif /* ASM_DECLARE_OBJECT_NAME */
548 ASM_OUTPUT_SKIP (file
, size
? size
: 1);
553 #endif /* BSS_SECTION_ASM_OP */
555 /* Switch to the section for function DECL.
557 If DECL is NULL_TREE, switch to the text section.
558 ??? It's not clear that we will ever be passed NULL_TREE, but it's
559 safer to handle it. */
562 function_section (decl
)
565 if (decl
!= NULL_TREE
566 && DECL_SECTION_NAME (decl
) != NULL_TREE
)
567 named_section (decl
, (char *) 0, 0);
572 /* Switch to section for variable DECL.
574 RELOC is the `reloc' argument to SELECT_SECTION. */
577 variable_section (decl
, reloc
)
581 if (IN_NAMED_SECTION (decl
))
582 named_section (decl
, NULL
, reloc
);
585 /* C++ can have const variables that get initialized from constructors,
586 and thus can not be in a readonly section. We prevent this by
587 verifying that the initial value is constant for objects put in a
590 error_mark_node is used by the C front end to indicate that the
591 initializer has not been seen yet. In this case, we assume that
592 the initializer must be constant.
594 C++ uses error_mark_node for variables that have complicated
595 initializers, but these variables go in BSS so we won't be called
598 #ifdef SELECT_SECTION
599 SELECT_SECTION (decl
, reloc
, DECL_ALIGN (decl
));
601 if (DECL_READONLY_SECTION (decl
, reloc
))
602 readonly_data_section ();
609 /* Tell assembler to switch to the section for the exception handling
613 default_exception_section ()
615 if (targetm
.have_named_sections
)
616 named_section (NULL_TREE
, ".gcc_except_table", 0);
620 readonly_data_section ();
623 /* Tell assembler to switch to the section for string merging. */
626 mergeable_string_section (decl
, align
, flags
)
627 tree decl ATTRIBUTE_UNUSED
;
628 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
;
629 unsigned int flags ATTRIBUTE_UNUSED
;
631 #ifdef HAVE_GAS_SHF_MERGE
632 if (flag_merge_constants
633 && TREE_CODE (decl
) == STRING_CST
634 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
636 && TREE_STRING_LENGTH (decl
) >= int_size_in_bytes (TREE_TYPE (decl
)))
638 enum machine_mode mode
;
639 unsigned int modesize
;
644 mode
= TYPE_MODE (TREE_TYPE (TREE_TYPE (decl
)));
645 modesize
= GET_MODE_BITSIZE (mode
);
646 if (modesize
>= 8 && modesize
<= 256
647 && (modesize
& (modesize
- 1)) == 0)
649 if (align
< modesize
)
652 str
= TREE_STRING_POINTER (decl
);
653 len
= TREE_STRING_LENGTH (decl
);
654 unit
= GET_MODE_SIZE (mode
);
656 /* Check for embedded NUL characters. */
657 for (i
= 0; i
< len
; i
+= unit
)
659 for (j
= 0; j
< unit
; j
++)
660 if (str
[i
+ j
] != '\0')
667 sprintf (name
, ".rodata.str%d.%d", modesize
/ 8,
669 flags
|= (modesize
/ 8) | SECTION_MERGE
| SECTION_STRINGS
;
670 if (!i
&& modesize
< align
)
672 /* A "" string with requested alignment greater than
673 character size might cause a problem:
674 if some other string required even bigger
675 alignment than "", then linker might think the
676 "" is just part of padding after some other string
677 and not put it into the hash table initially.
678 But this means "" could have smaller alignment
680 #ifdef ASM_OUTPUT_SECTION_START
681 named_section_flags (name
, flags
);
682 ASM_OUTPUT_SECTION_START (asm_out_file
);
684 readonly_data_section ();
689 named_section_flags (name
, flags
);
695 readonly_data_section ();
698 /* Tell assembler to switch to the section for constant merging. */
701 mergeable_constant_section (mode
, align
, flags
)
702 enum machine_mode mode ATTRIBUTE_UNUSED
;
703 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
;
704 unsigned int flags ATTRIBUTE_UNUSED
;
706 #ifdef HAVE_GAS_SHF_MERGE
707 unsigned int modesize
= GET_MODE_BITSIZE (mode
);
709 if (flag_merge_constants
715 && (align
& (align
- 1)) == 0)
719 sprintf (name
, ".rodata.cst%d", (int) (align
/ 8));
720 flags
|= (align
/ 8) | SECTION_MERGE
;
721 named_section_flags (name
, flags
);
725 readonly_data_section ();
728 /* Given NAME, a putative register name, discard any customary prefixes. */
731 strip_reg_name (name
)
734 #ifdef REGISTER_PREFIX
735 if (!strncmp (name
, REGISTER_PREFIX
, strlen (REGISTER_PREFIX
)))
736 name
+= strlen (REGISTER_PREFIX
);
738 if (name
[0] == '%' || name
[0] == '#')
743 /* Decode an `asm' spec for a declaration as a register name.
744 Return the register number, or -1 if nothing specified,
745 or -2 if the ASMSPEC is not `cc' or `memory' and is not recognized,
746 or -3 if ASMSPEC is `cc' and is not recognized,
747 or -4 if ASMSPEC is `memory' and is not recognized.
748 Accept an exact spelling or a decimal number.
749 Prefixes such as % are optional. */
752 decode_reg_name (asmspec
)
759 /* Get rid of confusing prefixes. */
760 asmspec
= strip_reg_name (asmspec
);
762 /* Allow a decimal number as a "register name". */
763 for (i
= strlen (asmspec
) - 1; i
>= 0; i
--)
764 if (! ISDIGIT (asmspec
[i
]))
766 if (asmspec
[0] != 0 && i
< 0)
769 if (i
< FIRST_PSEUDO_REGISTER
&& i
>= 0)
775 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
777 && ! strcmp (asmspec
, strip_reg_name (reg_names
[i
])))
780 #ifdef ADDITIONAL_REGISTER_NAMES
782 static const struct { const char *const name
; const int number
; } table
[]
783 = ADDITIONAL_REGISTER_NAMES
;
785 for (i
= 0; i
< (int) ARRAY_SIZE (table
); i
++)
786 if (! strcmp (asmspec
, table
[i
].name
))
787 return table
[i
].number
;
789 #endif /* ADDITIONAL_REGISTER_NAMES */
791 if (!strcmp (asmspec
, "memory"))
794 if (!strcmp (asmspec
, "cc"))
803 /* Create the DECL_RTL for a VAR_DECL or FUNCTION_DECL. DECL should
804 have static storage duration. In other words, it should not be an
805 automatic variable, including PARM_DECLs.
807 There is, however, one exception: this function handles variables
808 explicitly placed in a particular register by the user.
810 ASMSPEC, if not 0, is the string which the user specified as the
811 assembler symbol name.
813 This is never called for PARM_DECL nodes. */
816 make_decl_rtl (decl
, asmspec
)
820 int top_level
= (DECL_CONTEXT (decl
) == NULL_TREE
);
821 const char *name
= 0;
822 const char *new_name
= 0;
826 /* Check that we are not being given an automatic variable. */
827 /* A weak alias has TREE_PUBLIC set but not the other bits. */
828 if (TREE_CODE (decl
) == PARM_DECL
829 || TREE_CODE (decl
) == RESULT_DECL
830 || (TREE_CODE (decl
) == VAR_DECL
831 && !TREE_STATIC (decl
)
832 && !TREE_PUBLIC (decl
)
833 && !DECL_EXTERNAL (decl
)
834 && !DECL_REGISTER (decl
)))
836 /* And that we were not given a type or a label. */
837 else if (TREE_CODE (decl
) == TYPE_DECL
838 || TREE_CODE (decl
) == LABEL_DECL
)
841 /* For a duplicate declaration, we can be called twice on the
842 same DECL node. Don't discard the RTL already made. */
843 if (DECL_RTL_SET_P (decl
))
845 /* If the old RTL had the wrong mode, fix the mode. */
846 if (GET_MODE (DECL_RTL (decl
)) != DECL_MODE (decl
))
847 SET_DECL_RTL (decl
, adjust_address_nv (DECL_RTL (decl
),
848 DECL_MODE (decl
), 0));
850 /* ??? Another way to do this would be to do what halfpic.c does
851 and maintain a hashed table of such critters. */
852 /* Let the target reassign the RTL if it wants.
853 This is necessary, for example, when one machine specific
854 decl attribute overrides another. */
855 #ifdef ENCODE_SECTION_INFO
856 ENCODE_SECTION_INFO (decl
, false);
861 new_name
= name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
863 reg_number
= decode_reg_name (asmspec
);
864 if (reg_number
== -2)
866 /* ASMSPEC is given, and not the name of a register. Mark the
867 name with a star so assemble_name won't munge it. */
868 char *starred
= alloca (strlen (asmspec
) + 2);
870 strcpy (starred
+ 1, asmspec
);
874 if (TREE_CODE (decl
) != FUNCTION_DECL
&& DECL_REGISTER (decl
))
876 /* First detect errors in declaring global registers. */
877 if (reg_number
== -1)
878 error_with_decl (decl
, "register name not specified for `%s'");
879 else if (reg_number
< 0)
880 error_with_decl (decl
, "invalid register name for `%s'");
881 else if (TYPE_MODE (TREE_TYPE (decl
)) == BLKmode
)
882 error_with_decl (decl
,
883 "data type of `%s' isn't suitable for a register");
884 else if (! HARD_REGNO_MODE_OK (reg_number
, TYPE_MODE (TREE_TYPE (decl
))))
885 error_with_decl (decl
,
886 "register specified for `%s' isn't suitable for data type");
887 /* Now handle properly declared static register variables. */
892 if (DECL_INITIAL (decl
) != 0 && TREE_STATIC (decl
))
894 DECL_INITIAL (decl
) = 0;
895 error ("global register variable has initial value");
897 if (TREE_THIS_VOLATILE (decl
))
898 warning ("volatile register variables don't work as you might wish");
900 /* If the user specified one of the eliminables registers here,
901 e.g., FRAME_POINTER_REGNUM, we don't want to get this variable
902 confused with that register and be eliminated. This usage is
903 somewhat suspect... */
905 SET_DECL_RTL (decl
, gen_rtx_raw_REG (DECL_MODE (decl
), reg_number
));
906 ORIGINAL_REGNO (DECL_RTL (decl
)) = reg_number
;
907 REG_USERVAR_P (DECL_RTL (decl
)) = 1;
909 if (TREE_STATIC (decl
))
911 /* Make this register global, so not usable for anything
913 #ifdef ASM_DECLARE_REGISTER_GLOBAL
914 ASM_DECLARE_REGISTER_GLOBAL (asm_out_file
, decl
, reg_number
, name
);
916 nregs
= HARD_REGNO_NREGS (reg_number
, DECL_MODE (decl
));
918 globalize_reg (reg_number
+ --nregs
);
921 /* As a register variable, it has no section. */
926 /* Now handle ordinary static variables and functions (in memory).
927 Also handle vars declared register invalidly. */
929 if (reg_number
>= 0 || reg_number
== -3)
930 error_with_decl (decl
,
931 "register name given for non-register variable `%s'");
933 /* Specifying a section attribute on a variable forces it into a
934 non-.bss section, and thus it cannot be common. */
935 if (TREE_CODE (decl
) == VAR_DECL
936 && DECL_SECTION_NAME (decl
) != NULL_TREE
937 && DECL_INITIAL (decl
) == NULL_TREE
938 && DECL_COMMON (decl
))
939 DECL_COMMON (decl
) = 0;
941 /* Can't use just the variable's own name for a variable
942 whose scope is less than the whole file, unless it's a member
943 of a local class (which will already be unambiguous).
944 Concatenate a distinguishing number. */
945 if (!top_level
&& !TREE_PUBLIC (decl
)
946 && ! (DECL_CONTEXT (decl
) && TYPE_P (DECL_CONTEXT (decl
)))
948 && name
== IDENTIFIER_POINTER (DECL_NAME (decl
)))
952 ASM_FORMAT_PRIVATE_NAME (label
, name
, var_labelno
);
957 if (name
!= new_name
)
959 SET_DECL_ASSEMBLER_NAME (decl
, get_identifier (new_name
));
960 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
963 /* If this variable is to be treated as volatile, show its
964 tree node has side effects. */
965 if ((flag_volatile_global
&& TREE_CODE (decl
) == VAR_DECL
966 && TREE_PUBLIC (decl
))
967 || ((flag_volatile_static
&& TREE_CODE (decl
) == VAR_DECL
968 && (TREE_PUBLIC (decl
) || TREE_STATIC (decl
)))))
969 TREE_SIDE_EFFECTS (decl
) = 1;
971 x
= gen_rtx_MEM (DECL_MODE (decl
), gen_rtx_SYMBOL_REF (Pmode
, name
));
972 SYMBOL_REF_WEAK (XEXP (x
, 0)) = DECL_WEAK (decl
);
973 if (TREE_CODE (decl
) != FUNCTION_DECL
)
974 set_mem_attributes (x
, decl
, 1);
975 SET_DECL_RTL (decl
, x
);
977 /* Optionally set flags or add text to the name to record information
978 such as that it is a function name.
979 If the name is changed, the macro ASM_OUTPUT_LABELREF
980 will have to know how to strip this information. */
981 #ifdef ENCODE_SECTION_INFO
982 ENCODE_SECTION_INFO (decl
, true);
986 /* Make the rtl for variable VAR be volatile.
987 Use this only for static variables. */
990 make_var_volatile (var
)
993 if (GET_CODE (DECL_RTL (var
)) != MEM
)
996 MEM_VOLATILE_P (DECL_RTL (var
)) = 1;
999 /* Output alignment directive to align for constant expression EXP. */
1002 assemble_constant_align (exp
)
1007 /* Align the location counter as required by EXP's data type. */
1008 align
= TYPE_ALIGN (TREE_TYPE (exp
));
1009 #ifdef CONSTANT_ALIGNMENT
1010 align
= CONSTANT_ALIGNMENT (exp
, align
);
1013 if (align
> BITS_PER_UNIT
)
1015 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
1019 /* Output a string of literal assembler code
1020 for an `asm' keyword used between functions. */
1023 assemble_asm (string
)
1028 if (TREE_CODE (string
) == ADDR_EXPR
)
1029 string
= TREE_OPERAND (string
, 0);
1031 fprintf (asm_out_file
, "\t%s\n", TREE_STRING_POINTER (string
));
1034 /* Record an element in the table of global destructors. SYMBOL is
1035 a SYMBOL_REF of the function to be called; PRIORITY is a number
1036 between 0 and MAX_INIT_PRIORITY. */
1039 default_stabs_asm_out_destructor (symbol
, priority
)
1041 int priority ATTRIBUTE_UNUSED
;
1043 /* Tell GNU LD that this is part of the static destructor set.
1044 This will work for any system that uses stabs, most usefully
1046 fprintf (asm_out_file
, "%s\"___DTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
1047 assemble_name (asm_out_file
, XSTR (symbol
, 0));
1048 fputc ('\n', asm_out_file
);
1052 default_named_section_asm_out_destructor (symbol
, priority
)
1056 const char *section
= ".dtors";
1059 /* ??? This only works reliably with the GNU linker. */
1060 if (priority
!= DEFAULT_INIT_PRIORITY
)
1062 sprintf (buf
, ".dtors.%.5u",
1063 /* Invert the numbering so the linker puts us in the proper
1064 order; constructors are run from right to left, and the
1065 linker sorts in increasing order. */
1066 MAX_INIT_PRIORITY
- priority
);
1070 named_section_flags (section
, SECTION_WRITE
);
1071 assemble_align (POINTER_SIZE
);
1072 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1075 #ifdef DTORS_SECTION_ASM_OP
1079 if (in_section
!= in_dtors
)
1081 in_section
= in_dtors
;
1082 fputs (DTORS_SECTION_ASM_OP
, asm_out_file
);
1083 fputc ('\n', asm_out_file
);
1088 default_dtor_section_asm_out_destructor (symbol
, priority
)
1090 int priority ATTRIBUTE_UNUSED
;
1093 assemble_align (POINTER_SIZE
);
1094 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1098 /* Likewise for global constructors. */
1101 default_stabs_asm_out_constructor (symbol
, priority
)
1103 int priority ATTRIBUTE_UNUSED
;
1105 /* Tell GNU LD that this is part of the static destructor set.
1106 This will work for any system that uses stabs, most usefully
1108 fprintf (asm_out_file
, "%s\"___CTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
1109 assemble_name (asm_out_file
, XSTR (symbol
, 0));
1110 fputc ('\n', asm_out_file
);
1114 default_named_section_asm_out_constructor (symbol
, priority
)
1118 const char *section
= ".ctors";
1121 /* ??? This only works reliably with the GNU linker. */
1122 if (priority
!= DEFAULT_INIT_PRIORITY
)
1124 sprintf (buf
, ".ctors.%.5u",
1125 /* Invert the numbering so the linker puts us in the proper
1126 order; constructors are run from right to left, and the
1127 linker sorts in increasing order. */
1128 MAX_INIT_PRIORITY
- priority
);
1132 named_section_flags (section
, SECTION_WRITE
);
1133 assemble_align (POINTER_SIZE
);
1134 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1137 #ifdef CTORS_SECTION_ASM_OP
1141 if (in_section
!= in_ctors
)
1143 in_section
= in_ctors
;
1144 fputs (CTORS_SECTION_ASM_OP
, asm_out_file
);
1145 fputc ('\n', asm_out_file
);
1150 default_ctor_section_asm_out_constructor (symbol
, priority
)
1152 int priority ATTRIBUTE_UNUSED
;
1155 assemble_align (POINTER_SIZE
);
1156 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1160 /* CONSTANT_POOL_BEFORE_FUNCTION may be defined as an expression with
1161 a non-zero value if the constant pool should be output before the
1162 start of the function, or a zero value if the pool should output
1163 after the end of the function. The default is to put it before the
1166 #ifndef CONSTANT_POOL_BEFORE_FUNCTION
1167 #define CONSTANT_POOL_BEFORE_FUNCTION 1
1170 /* Output assembler code for the constant pool of a function and associated
1171 with defining the name of the function. DECL describes the function.
1172 NAME is the function's name. For the constant pool, we use the current
1173 constant pool data. */
1176 assemble_start_function (decl
, fnname
)
1182 /* The following code does not need preprocessing in the assembler. */
1186 if (CONSTANT_POOL_BEFORE_FUNCTION
)
1187 output_constant_pool (fnname
, decl
);
1189 resolve_unique_section (decl
, 0);
1190 function_section (decl
);
1192 /* Tell assembler to move to target machine's alignment for functions. */
1193 align
= floor_log2 (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
1196 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1199 /* Handle a user-specified function alignment.
1200 Note that we still need to align to FUNCTION_BOUNDARY, as above,
1201 because ASM_OUTPUT_MAX_SKIP_ALIGN might not do any alignment at all. */
1202 if (align_functions_log
> align
)
1204 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
1205 ASM_OUTPUT_MAX_SKIP_ALIGN (asm_out_file
,
1206 align_functions_log
, align_functions
-1);
1208 ASM_OUTPUT_ALIGN (asm_out_file
, align_functions_log
);
1212 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
1213 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file
, fnname
);
1216 (*debug_hooks
->begin_function
) (decl
);
1218 /* Make function name accessible from other files, if appropriate. */
1220 if (TREE_PUBLIC (decl
))
1222 if (! first_global_object_name
)
1227 STRIP_NAME_ENCODING (p
, fnname
);
1228 name
= permalloc (strlen (p
) + 1);
1231 if (! DECL_WEAK (decl
) && ! DECL_ONE_ONLY (decl
))
1232 first_global_object_name
= name
;
1234 weak_global_object_name
= name
;
1237 globalize_decl (decl
);
1239 maybe_assemble_visibility (decl
);
1242 /* Do any machine/system dependent processing of the function name */
1243 #ifdef ASM_DECLARE_FUNCTION_NAME
1244 ASM_DECLARE_FUNCTION_NAME (asm_out_file
, fnname
, current_function_decl
);
1246 /* Standard thing is just output label for the function. */
1247 ASM_OUTPUT_LABEL (asm_out_file
, fnname
);
1248 #endif /* ASM_DECLARE_FUNCTION_NAME */
1251 /* Output assembler code associated with defining the size of the
1252 function. DECL describes the function. NAME is the function's name. */
1255 assemble_end_function (decl
, fnname
)
1259 #ifdef ASM_DECLARE_FUNCTION_SIZE
1260 ASM_DECLARE_FUNCTION_SIZE (asm_out_file
, fnname
, decl
);
1262 if (! CONSTANT_POOL_BEFORE_FUNCTION
)
1264 output_constant_pool (fnname
, decl
);
1265 function_section (decl
); /* need to switch back */
1268 /* Output any constants which should appear after the function. */
1269 output_after_function_constants ();
1272 /* Assemble code to leave SIZE bytes of zeros. */
1275 assemble_zeros (size
)
1278 /* Do no output if -fsyntax-only. */
1279 if (flag_syntax_only
)
1282 #ifdef ASM_NO_SKIP_IN_TEXT
1283 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
1284 so we must output 0s explicitly in the text section. */
1285 if (ASM_NO_SKIP_IN_TEXT
&& in_text_section ())
1288 for (i
= 0; i
< size
; i
++)
1289 assemble_integer (const0_rtx
, 1, BITS_PER_UNIT
, 1);
1294 ASM_OUTPUT_SKIP (asm_out_file
, size
);
1297 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
1300 assemble_align (align
)
1303 if (align
> BITS_PER_UNIT
)
1305 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
1309 /* Assemble a string constant with the specified C string as contents. */
1312 assemble_string (p
, size
)
1319 /* If the string is very long, split it up. */
1323 int thissize
= size
- pos
;
1324 if (thissize
> maximum
)
1327 ASM_OUTPUT_ASCII (asm_out_file
, p
, thissize
);
1335 #if defined ASM_OUTPUT_ALIGNED_DECL_LOCAL
1336 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1337 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1339 #if defined ASM_OUTPUT_ALIGNED_LOCAL
1340 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1341 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, DECL_ALIGN (decl))
1343 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1344 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded)
1348 #if defined ASM_OUTPUT_ALIGNED_BSS
1349 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1350 ASM_OUTPUT_ALIGNED_BSS (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1352 #if defined ASM_OUTPUT_BSS
1353 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1354 ASM_OUTPUT_BSS (asm_out_file, decl, name, size, rounded)
1360 #if defined ASM_OUTPUT_ALIGNED_DECL_COMMON
1361 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1362 ASM_OUTPUT_ALIGNED_DECL_COMMON (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1364 #if defined ASM_OUTPUT_ALIGNED_COMMON
1365 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1366 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file, name, size, DECL_ALIGN (decl))
1368 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1369 ASM_OUTPUT_COMMON (asm_out_file, name, size, rounded)
1374 asm_emit_uninitialised (decl
, name
, size
, rounded
)
1377 int size ATTRIBUTE_UNUSED
;
1378 int rounded ATTRIBUTE_UNUSED
;
1386 destination
= asm_dest_local
;
1388 if (TREE_PUBLIC (decl
))
1390 #if defined ASM_EMIT_BSS
1391 if (! DECL_COMMON (decl
))
1392 destination
= asm_dest_bss
;
1395 destination
= asm_dest_common
;
1398 switch (destination
)
1400 case asm_dest_common
:
1401 if (! DECL_WEAK (decl
))
1404 globalize_decl (decl
);
1409 if (flag_shared_data
)
1411 switch (destination
)
1413 #ifdef ASM_OUTPUT_SHARED_BSS
1415 ASM_OUTPUT_SHARED_BSS (asm_out_file
, decl
, name
, size
, rounded
);
1418 #ifdef ASM_OUTPUT_SHARED_COMMON
1419 case asm_dest_common
:
1420 ASM_OUTPUT_SHARED_COMMON (asm_out_file
, name
, size
, rounded
);
1423 #ifdef ASM_OUTPUT_SHARED_LOCAL
1424 case asm_dest_local
:
1425 ASM_OUTPUT_SHARED_LOCAL (asm_out_file
, name
, size
, rounded
);
1433 resolve_unique_section (decl
, 0);
1435 switch (destination
)
1439 ASM_EMIT_BSS (decl
, name
, size
, rounded
);
1442 case asm_dest_common
:
1443 ASM_EMIT_COMMON (decl
, name
, size
, rounded
);
1445 case asm_dest_local
:
1446 ASM_EMIT_LOCAL (decl
, name
, size
, rounded
);
1455 /* Assemble everything that is needed for a variable or function declaration.
1456 Not used for automatic variables, and not used for function definitions.
1457 Should not be called for variables of incomplete structure type.
1459 TOP_LEVEL is nonzero if this variable has file scope.
1460 AT_END is nonzero if this is the special handling, at end of compilation,
1461 to define things that have had only tentative definitions.
1462 DONT_OUTPUT_DATA if nonzero means don't actually output the
1463 initial value (that will be done by the caller). */
1466 assemble_variable (decl
, top_level
, at_end
, dont_output_data
)
1468 int top_level ATTRIBUTE_UNUSED
;
1469 int at_end ATTRIBUTE_UNUSED
;
1470 int dont_output_data
;
1477 last_assemble_variable_decl
= 0;
1479 /* Normally no need to say anything here for external references,
1480 since assemble_external is called by the language-specific code
1481 when a declaration is first seen. */
1483 if (DECL_EXTERNAL (decl
))
1486 /* Output no assembler code for a function declaration.
1487 Only definitions of functions output anything. */
1489 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1492 /* Do nothing for global register variables. */
1493 if (DECL_RTL_SET_P (decl
) && GET_CODE (DECL_RTL (decl
)) == REG
)
1495 TREE_ASM_WRITTEN (decl
) = 1;
1499 /* If type was incomplete when the variable was declared,
1500 see if it is complete now. */
1502 if (DECL_SIZE (decl
) == 0)
1503 layout_decl (decl
, 0);
1505 /* Still incomplete => don't allocate it; treat the tentative defn
1506 (which is what it must have been) as an `extern' reference. */
1508 if (!dont_output_data
&& DECL_SIZE (decl
) == 0)
1510 error_with_file_and_line (DECL_SOURCE_FILE (decl
),
1511 DECL_SOURCE_LINE (decl
),
1512 "storage size of `%s' isn't known",
1513 IDENTIFIER_POINTER (DECL_NAME (decl
)));
1514 TREE_ASM_WRITTEN (decl
) = 1;
1518 /* The first declaration of a variable that comes through this function
1519 decides whether it is global (in C, has external linkage)
1520 or local (in C, has internal linkage). So do nothing more
1521 if this function has already run. */
1523 if (TREE_ASM_WRITTEN (decl
))
1526 /* Make sure ENCODE_SECTION_INFO is invoked before we set ASM_WRITTEN. */
1527 decl_rtl
= DECL_RTL (decl
);
1529 TREE_ASM_WRITTEN (decl
) = 1;
1531 /* Do no output if -fsyntax-only. */
1532 if (flag_syntax_only
)
1537 if (! dont_output_data
1538 && ! host_integerp (DECL_SIZE_UNIT (decl
), 1))
1540 error_with_decl (decl
, "size of variable `%s' is too large");
1544 name
= XSTR (XEXP (decl_rtl
, 0), 0);
1545 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
)
1546 && ! first_global_object_name
1547 && ! (DECL_COMMON (decl
) && (DECL_INITIAL (decl
) == 0
1548 || DECL_INITIAL (decl
) == error_mark_node
))
1549 && ! DECL_WEAK (decl
)
1550 && ! DECL_ONE_ONLY (decl
))
1555 STRIP_NAME_ENCODING (p
, name
);
1556 xname
= permalloc (strlen (p
) + 1);
1558 first_global_object_name
= xname
;
1561 /* Compute the alignment of this data. */
1563 align
= DECL_ALIGN (decl
);
1565 /* In the case for initialing an array whose length isn't specified,
1566 where we have not yet been able to do the layout,
1567 figure out the proper alignment now. */
1568 if (dont_output_data
&& DECL_SIZE (decl
) == 0
1569 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
)
1570 align
= MAX (align
, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl
))));
1572 /* Some object file formats have a maximum alignment which they support.
1573 In particular, a.out format supports a maximum alignment of 4. */
1574 #ifndef MAX_OFILE_ALIGNMENT
1575 #define MAX_OFILE_ALIGNMENT BIGGEST_ALIGNMENT
1577 if (align
> MAX_OFILE_ALIGNMENT
)
1579 warning_with_decl (decl
,
1580 "alignment of `%s' is greater than maximum object file alignment. Using %d",
1581 MAX_OFILE_ALIGNMENT
/BITS_PER_UNIT
);
1582 align
= MAX_OFILE_ALIGNMENT
;
1585 /* On some machines, it is good to increase alignment sometimes. */
1586 if (! DECL_USER_ALIGN (decl
))
1588 #ifdef DATA_ALIGNMENT
1589 align
= DATA_ALIGNMENT (TREE_TYPE (decl
), align
);
1591 #ifdef CONSTANT_ALIGNMENT
1592 if (DECL_INITIAL (decl
) != 0 && DECL_INITIAL (decl
) != error_mark_node
)
1593 align
= CONSTANT_ALIGNMENT (DECL_INITIAL (decl
), align
);
1597 /* Reset the alignment in case we have made it tighter, so we can benefit
1598 from it in get_pointer_alignment. */
1599 DECL_ALIGN (decl
) = align
;
1600 set_mem_align (decl_rtl
, align
);
1602 if (TREE_PUBLIC (decl
))
1603 maybe_assemble_visibility (decl
);
1605 /* Output any data that we will need to use the address of. */
1606 if (DECL_INITIAL (decl
) == error_mark_node
)
1607 reloc
= contains_pointers_p (TREE_TYPE (decl
)) ? 3 : 0;
1608 else if (DECL_INITIAL (decl
))
1609 reloc
= output_addressed_constants (DECL_INITIAL (decl
));
1610 resolve_unique_section (decl
, reloc
);
1612 /* Handle uninitialized definitions. */
1614 if ((DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
1615 #if defined ASM_EMIT_BSS
1616 || (flag_zero_initialized_in_bss
1617 && initializer_zerop (DECL_INITIAL (decl
)))
1620 /* If the target can't output uninitialized but not common global data
1621 in .bss, then we have to use .data. */
1622 #if ! defined ASM_EMIT_BSS
1623 && DECL_COMMON (decl
)
1625 && DECL_SECTION_NAME (decl
) == NULL_TREE
1626 && ! dont_output_data
)
1628 unsigned HOST_WIDE_INT size
= tree_low_cst (DECL_SIZE_UNIT (decl
), 1);
1629 unsigned HOST_WIDE_INT rounded
= size
;
1631 /* Don't allocate zero bytes of common,
1632 since that means "undefined external" in the linker. */
1636 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1637 so that each uninitialized object starts on such a boundary. */
1638 rounded
+= (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1;
1639 rounded
= (rounded
/ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1640 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1642 /* Don't continue this line--convex cc version 4.1 would lose. */
1643 #if !defined(ASM_OUTPUT_ALIGNED_COMMON) && !defined(ASM_OUTPUT_ALIGNED_DECL_COMMON) && !defined(ASM_OUTPUT_ALIGNED_BSS)
1644 if ((unsigned HOST_WIDE_INT
) DECL_ALIGN (decl
) / BITS_PER_UNIT
> rounded
)
1646 (decl
, "requested alignment for %s is greater than implemented alignment of %d",rounded
);
1649 asm_emit_uninitialised (decl
, name
, size
, rounded
);
1654 /* Handle initialized definitions.
1655 Also handle uninitialized global definitions if -fno-common and the
1656 target doesn't support ASM_OUTPUT_BSS. */
1658 /* First make the assembler name(s) global if appropriate. */
1659 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
))
1660 globalize_decl (decl
);
1662 /* Switch to the appropriate section. */
1663 variable_section (decl
, reloc
);
1665 /* dbxout.c needs to know this. */
1666 if (in_text_section ())
1667 DECL_IN_TEXT_SECTION (decl
) = 1;
1669 /* Output the alignment of this data. */
1670 if (align
> BITS_PER_UNIT
)
1672 ASM_OUTPUT_ALIGN (asm_out_file
,
1673 floor_log2 (DECL_ALIGN (decl
) / BITS_PER_UNIT
));
1676 /* Do any machine/system dependent processing of the object. */
1677 #ifdef ASM_DECLARE_OBJECT_NAME
1678 last_assemble_variable_decl
= decl
;
1679 ASM_DECLARE_OBJECT_NAME (asm_out_file
, name
, decl
);
1681 /* Standard thing is just output label for the object. */
1682 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1683 #endif /* ASM_DECLARE_OBJECT_NAME */
1685 if (!dont_output_data
)
1687 if (DECL_INITIAL (decl
) && DECL_INITIAL (decl
) != error_mark_node
)
1688 /* Output the actual data. */
1689 output_constant (DECL_INITIAL (decl
),
1690 tree_low_cst (DECL_SIZE_UNIT (decl
), 1),
1693 /* Leave space for it. */
1694 assemble_zeros (tree_low_cst (DECL_SIZE_UNIT (decl
), 1));
1698 /* Return 1 if type TYPE contains any pointers. */
1701 contains_pointers_p (type
)
1704 switch (TREE_CODE (type
))
1707 case REFERENCE_TYPE
:
1708 /* I'm not sure whether OFFSET_TYPE needs this treatment,
1709 so I'll play safe and return 1. */
1715 case QUAL_UNION_TYPE
:
1718 /* For a type that has fields, see if the fields have pointers. */
1719 for (fields
= TYPE_FIELDS (type
); fields
; fields
= TREE_CHAIN (fields
))
1720 if (TREE_CODE (fields
) == FIELD_DECL
1721 && contains_pointers_p (TREE_TYPE (fields
)))
1727 /* An array type contains pointers if its element type does. */
1728 return contains_pointers_p (TREE_TYPE (type
));
1735 /* Output something to declare an external symbol to the assembler.
1736 (Most assemblers don't need this, so we normally output nothing.)
1737 Do nothing if DECL is not external. */
1740 assemble_external (decl
)
1741 tree decl ATTRIBUTE_UNUSED
;
1743 /* Because most platforms do not define ASM_OUTPUT_EXTERNAL, the
1744 main body of this code is only rarely exercised. To provide some
1745 testing, on all platforms, we make sure that the ASM_OUT_FILE is
1746 open. If it's not, we should not be calling this function. */
1750 #ifdef ASM_OUTPUT_EXTERNAL
1751 if (DECL_P (decl
) && DECL_EXTERNAL (decl
) && TREE_PUBLIC (decl
))
1753 rtx rtl
= DECL_RTL (decl
);
1755 if (GET_CODE (rtl
) == MEM
&& GET_CODE (XEXP (rtl
, 0)) == SYMBOL_REF
1756 && ! SYMBOL_REF_USED (XEXP (rtl
, 0)))
1758 /* Some systems do require some output. */
1759 SYMBOL_REF_USED (XEXP (rtl
, 0)) = 1;
1760 ASM_OUTPUT_EXTERNAL (asm_out_file
, decl
, XSTR (XEXP (rtl
, 0), 0));
1766 /* Similar, for calling a library function FUN. */
1769 assemble_external_libcall (fun
)
1770 rtx fun ATTRIBUTE_UNUSED
;
1772 #ifdef ASM_OUTPUT_EXTERNAL_LIBCALL
1773 /* Declare library function name external when first used, if nec. */
1774 if (! SYMBOL_REF_USED (fun
))
1776 SYMBOL_REF_USED (fun
) = 1;
1777 ASM_OUTPUT_EXTERNAL_LIBCALL (asm_out_file
, fun
);
1782 /* Declare the label NAME global. */
1785 assemble_global (name
)
1786 const char *name ATTRIBUTE_UNUSED
;
1788 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
1791 /* Assemble a label named NAME. */
1794 assemble_label (name
)
1797 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1800 /* Output to FILE a reference to the assembler name of a C-level name NAME.
1801 If NAME starts with a *, the rest of NAME is output verbatim.
1802 Otherwise NAME is transformed in an implementation-defined way
1803 (usually by the addition of an underscore).
1804 Many macros in the tm file are defined to call this function. */
1807 assemble_name (file
, name
)
1811 const char *real_name
;
1814 STRIP_NAME_ENCODING (real_name
, name
);
1816 id
= maybe_get_identifier (real_name
);
1818 TREE_SYMBOL_REFERENCED (id
) = 1;
1821 fputs (&name
[1], file
);
1823 ASM_OUTPUT_LABELREF (file
, name
);
1826 /* Allocate SIZE bytes writable static space with a gensym name
1827 and return an RTX to refer to its address. */
1830 assemble_static_space (size
)
1834 const char *namestring
;
1838 if (flag_shared_data
)
1842 ASM_GENERATE_INTERNAL_LABEL (name
, "LF", const_labelno
);
1844 namestring
= ggc_strdup (name
);
1846 x
= gen_rtx_SYMBOL_REF (Pmode
, namestring
);
1848 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
1849 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file
, NULL_TREE
, name
, size
,
1852 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1853 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file
, name
, size
, BIGGEST_ALIGNMENT
);
1856 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1857 so that each uninitialized object starts on such a boundary. */
1858 /* Variable `rounded' might or might not be used in ASM_OUTPUT_LOCAL. */
1859 int rounded ATTRIBUTE_UNUSED
1860 = ((size
+ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1)
1861 / (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1862 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1863 ASM_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
1870 /* Assemble the static constant template for function entry trampolines.
1871 This is done at most once per compilation.
1872 Returns an RTX for the address of the template. */
1874 #ifdef TRAMPOLINE_TEMPLATE
1876 assemble_trampoline_template ()
1882 /* By default, put trampoline templates in read-only data section. */
1884 #ifdef TRAMPOLINE_SECTION
1885 TRAMPOLINE_SECTION ();
1887 readonly_data_section ();
1890 /* Write the assembler code to define one. */
1891 align
= floor_log2 (TRAMPOLINE_ALIGNMENT
/ BITS_PER_UNIT
);
1894 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1897 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LTRAMP", 0);
1898 TRAMPOLINE_TEMPLATE (asm_out_file
);
1900 /* Record the rtl to refer to it. */
1901 ASM_GENERATE_INTERNAL_LABEL (label
, "LTRAMP", 0);
1902 name
= ggc_strdup (label
);
1903 return gen_rtx_SYMBOL_REF (Pmode
, name
);
1907 /* A and B are either alignments or offsets. Return the minimum alignment
1908 that may be assumed after adding the two together. */
1910 static inline unsigned
1914 return (a
| b
) & -(a
| b
);
1917 /* Return the assembler directive for creating a given kind of integer
1918 object. SIZE is the number of bytes in the object and ALIGNED_P
1919 indicates whether it is known to be aligned. Return NULL if the
1920 assembly dialect has no such directive.
1922 The returned string should be printed at the start of a new line and
1923 be followed immediately by the object's initial value. */
1926 integer_asm_op (size
, aligned_p
)
1930 struct asm_int_op
*ops
;
1933 ops
= &targetm
.asm_out
.aligned_op
;
1935 ops
= &targetm
.asm_out
.unaligned_op
;
1940 return targetm
.asm_out
.byte_op
;
1954 /* Use directive OP to assemble an integer object X. Print OP at the
1955 start of the line, followed immediately by the value of X. */
1958 assemble_integer_with_op (op
, x
)
1962 fputs (op
, asm_out_file
);
1963 output_addr_const (asm_out_file
, x
);
1964 fputc ('\n', asm_out_file
);
1967 /* The default implementation of the asm_out.integer target hook. */
1970 default_assemble_integer (x
, size
, aligned_p
)
1971 rtx x ATTRIBUTE_UNUSED
;
1972 unsigned int size ATTRIBUTE_UNUSED
;
1973 int aligned_p ATTRIBUTE_UNUSED
;
1975 const char *op
= integer_asm_op (size
, aligned_p
);
1976 return op
&& (assemble_integer_with_op (op
, x
), true);
1979 /* Assemble the integer constant X into an object of SIZE bytes. ALIGN is
1980 the alignment of the integer in bits. Return 1 if we were able to output
1981 the constant, otherwise 0. If FORCE is non-zero, abort if we can't output
1985 assemble_integer (x
, size
, align
, force
)
1993 aligned_p
= (align
>= MIN (size
* BITS_PER_UNIT
, BIGGEST_ALIGNMENT
));
1995 /* See if the target hook can handle this kind of object. */
1996 if ((*targetm
.asm_out
.integer
) (x
, size
, aligned_p
))
1999 /* If the object is a multi-byte one, try splitting it up. Split
2000 it into words it if is multi-word, otherwise split it into bytes. */
2003 enum machine_mode omode
, imode
;
2004 unsigned int subalign
;
2005 unsigned int subsize
, i
;
2007 subsize
= size
> UNITS_PER_WORD
? UNITS_PER_WORD
: 1;
2008 subalign
= MIN (align
, subsize
* BITS_PER_UNIT
);
2009 omode
= mode_for_size (subsize
* BITS_PER_UNIT
, MODE_INT
, 0);
2010 imode
= mode_for_size (size
* BITS_PER_UNIT
, MODE_INT
, 0);
2012 for (i
= 0; i
< size
; i
+= subsize
)
2014 rtx partial
= simplify_subreg (omode
, x
, imode
, i
);
2015 if (!partial
|| !assemble_integer (partial
, subsize
, subalign
, 0))
2021 /* If we've printed some of it, but not all of it, there's no going
2034 assemble_real (d
, mode
, align
)
2036 enum machine_mode mode
;
2041 unsigned int nalign
= min_align (align
, 32);
2043 switch (BITS_PER_UNIT
)
2049 REAL_VALUE_TO_TARGET_SINGLE (d
, l
);
2050 assemble_integer (GEN_INT (l
), 4, align
, 1);
2053 REAL_VALUE_TO_TARGET_DOUBLE (d
, data
);
2054 assemble_integer (GEN_INT (data
[0]), 4, align
, 1);
2055 assemble_integer (GEN_INT (data
[1]), 4, nalign
, 1);
2058 REAL_VALUE_TO_TARGET_LONG_DOUBLE (d
, data
);
2059 assemble_integer (GEN_INT (data
[0]), 4, align
, 1);
2060 assemble_integer (GEN_INT (data
[1]), 4, nalign
, 1);
2061 assemble_integer (GEN_INT (data
[2]), 4, nalign
, 1);
2064 REAL_VALUE_TO_TARGET_LONG_DOUBLE (d
, data
);
2065 assemble_integer (GEN_INT (data
[0]), 4, align
, 1);
2066 assemble_integer (GEN_INT (data
[1]), 4, nalign
, 1);
2067 assemble_integer (GEN_INT (data
[2]), 4, nalign
, 1);
2068 assemble_integer (GEN_INT (data
[3]), 4, nalign
, 1);
2079 REAL_VALUE_TO_TARGET_SINGLE (d
, l
);
2080 assemble_integer (GEN_INT (l
), 2, align
, 1);
2083 REAL_VALUE_TO_TARGET_DOUBLE (d
, data
);
2084 assemble_integer (GEN_INT (data
[0]), 2, align
, 1);
2085 assemble_integer (GEN_INT (data
[1]), 1, nalign
, 1);
2096 REAL_VALUE_TO_TARGET_SINGLE (d
, l
);
2097 assemble_integer (GEN_INT (l
), 1, align
, 1);
2100 REAL_VALUE_TO_TARGET_DOUBLE (d
, data
);
2101 assemble_integer (GEN_INT (data
[0]), 1, align
, 1);
2102 assemble_integer (GEN_INT (data
[1]), 1, nalign
, 1);
2114 /* Here we combine duplicate floating constants to make
2115 CONST_DOUBLE rtx's, and force those out to memory when necessary. */
2117 /* Return a CONST_DOUBLE or CONST_INT for a value specified as a pair of ints.
2118 For an integer, I0 is the low-order word and I1 is the high-order word.
2119 For a real number, I0 is the word with the low address
2120 and I1 is the word with the high address. */
2123 immed_double_const (i0
, i1
, mode
)
2124 HOST_WIDE_INT i0
, i1
;
2125 enum machine_mode mode
;
2129 if (GET_MODE_CLASS (mode
) == MODE_INT
2130 || GET_MODE_CLASS (mode
) == MODE_PARTIAL_INT
)
2132 /* We clear out all bits that don't belong in MODE, unless they and our
2133 sign bit are all one. So we get either a reasonable negative value
2134 or a reasonable unsigned value for this mode. */
2135 int width
= GET_MODE_BITSIZE (mode
);
2136 if (width
< HOST_BITS_PER_WIDE_INT
2137 && ((i0
& ((HOST_WIDE_INT
) (-1) << (width
- 1)))
2138 != ((HOST_WIDE_INT
) (-1) << (width
- 1))))
2139 i0
&= ((HOST_WIDE_INT
) 1 << width
) - 1, i1
= 0;
2140 else if (width
== HOST_BITS_PER_WIDE_INT
2141 && ! (i1
== ~0 && i0
< 0))
2143 else if (width
> 2 * HOST_BITS_PER_WIDE_INT
)
2144 /* We cannot represent this value as a constant. */
2147 /* If this would be an entire word for the target, but is not for
2148 the host, then sign-extend on the host so that the number will look
2149 the same way on the host that it would on the target.
2151 For example, when building a 64 bit alpha hosted 32 bit sparc
2152 targeted compiler, then we want the 32 bit unsigned value -1 to be
2153 represented as a 64 bit value -1, and not as 0x00000000ffffffff.
2154 The later confuses the sparc backend. */
2156 if (width
< HOST_BITS_PER_WIDE_INT
2157 && (i0
& ((HOST_WIDE_INT
) 1 << (width
- 1))))
2158 i0
|= ((HOST_WIDE_INT
) (-1) << width
);
2160 /* If MODE fits within HOST_BITS_PER_WIDE_INT, always use a CONST_INT.
2162 ??? Strictly speaking, this is wrong if we create a CONST_INT
2163 for a large unsigned constant with the size of MODE being
2164 HOST_BITS_PER_WIDE_INT and later try to interpret that constant in a
2165 wider mode. In that case we will mis-interpret it as a negative
2168 Unfortunately, the only alternative is to make a CONST_DOUBLE
2169 for any constant in any mode if it is an unsigned constant larger
2170 than the maximum signed integer in an int on the host. However,
2171 doing this will break everyone that always expects to see a CONST_INT
2172 for SImode and smaller.
2174 We have always been making CONST_INTs in this case, so nothing new
2177 if (width
<= HOST_BITS_PER_WIDE_INT
)
2178 i1
= (i0
< 0) ? ~(HOST_WIDE_INT
) 0 : 0;
2180 /* If this integer fits in one word, return a CONST_INT. */
2181 if ((i1
== 0 && i0
>= 0)
2182 || (i1
== ~0 && i0
< 0))
2183 return GEN_INT (i0
);
2185 /* We use VOIDmode for integers. */
2189 /* Search the chain for an existing CONST_DOUBLE with the right value.
2190 If one is found, return it. */
2192 for (r
= const_double_chain
; r
; r
= CONST_DOUBLE_CHAIN (r
))
2193 if (CONST_DOUBLE_LOW (r
) == i0
&& CONST_DOUBLE_HIGH (r
) == i1
2194 && GET_MODE (r
) == mode
)
2197 /* No; make a new one and add it to the chain. */
2198 r
= gen_rtx_CONST_DOUBLE (mode
, i0
, i1
);
2200 /* Don't touch const_double_chain if not inside any function. */
2201 if (current_function_decl
!= 0)
2203 CONST_DOUBLE_CHAIN (r
) = const_double_chain
;
2204 const_double_chain
= r
;
2210 /* Return a CONST_DOUBLE for a specified `double' value
2211 and machine mode. */
2214 immed_real_const_1 (d
, mode
)
2216 enum machine_mode mode
;
2218 union real_extract u
;
2221 /* Get the desired `double' value as a sequence of ints
2222 since that is how they are stored in a CONST_DOUBLE. */
2226 /* Detect special cases. Check for NaN first, because some ports
2227 (specifically the i386) do not emit correct ieee-fp code by default, and
2228 thus will generate a core dump here if we pass a NaN to REAL_VALUES_EQUAL
2229 and if REAL_VALUES_EQUAL does a floating point comparison. */
2230 if (! REAL_VALUE_ISNAN (d
) && REAL_VALUES_IDENTICAL (dconst0
, d
))
2231 return CONST0_RTX (mode
);
2232 else if (! REAL_VALUE_ISNAN (d
) && REAL_VALUES_EQUAL (dconst1
, d
))
2233 return CONST1_RTX (mode
);
2234 else if (! REAL_VALUE_ISNAN (d
) && REAL_VALUES_EQUAL (dconst2
, d
))
2235 return CONST2_RTX (mode
);
2237 if (sizeof u
== sizeof (HOST_WIDE_INT
))
2238 return immed_double_const (u
.i
[0], 0, mode
);
2239 if (sizeof u
== 2 * sizeof (HOST_WIDE_INT
))
2240 return immed_double_const (u
.i
[0], u
.i
[1], mode
);
2242 /* The rest of this function handles the case where
2243 a float value requires more than 2 ints of space.
2244 It will be deleted as dead code on machines that don't need it. */
2246 /* Search the chain for an existing CONST_DOUBLE with the right value.
2247 If one is found, return it. */
2249 for (r
= const_double_chain
; r
; r
= CONST_DOUBLE_CHAIN (r
))
2250 if (! memcmp ((char *) &CONST_DOUBLE_LOW (r
), (char *) &u
, sizeof u
)
2251 && GET_MODE (r
) == mode
)
2254 /* No; make a new one and add it to the chain.
2256 We may be called by an optimizer which may be discarding any memory
2257 allocated during its processing (such as combine and loop). However,
2258 we will be leaving this constant on the chain, so we cannot tolerate
2260 r
= rtx_alloc (CONST_DOUBLE
);
2262 memcpy ((char *) &CONST_DOUBLE_LOW (r
), (char *) &u
, sizeof u
);
2264 /* If we aren't inside a function, don't put r on the
2265 const_double_chain. */
2266 if (current_function_decl
!= 0)
2268 CONST_DOUBLE_CHAIN (r
) = const_double_chain
;
2269 const_double_chain
= r
;
2272 CONST_DOUBLE_CHAIN (r
) = NULL_RTX
;
2277 /* Return a CONST_DOUBLE rtx for a value specified by EXP,
2278 which must be a REAL_CST tree node. */
2281 immed_real_const (exp
)
2284 return immed_real_const_1 (TREE_REAL_CST (exp
), TYPE_MODE (TREE_TYPE (exp
)));
2287 /* At the end of a function, forget the memory-constants
2288 previously made for CONST_DOUBLEs. Mark them as not on real_constant_chain.
2289 Also clear out real_constant_chain and clear out all the chain-pointers. */
2292 clear_const_double_mem ()
2296 for (r
= const_double_chain
; r
; r
= next
)
2298 next
= CONST_DOUBLE_CHAIN (r
);
2299 CONST_DOUBLE_CHAIN (r
) = 0;
2301 const_double_chain
= 0;
2304 /* Given an expression EXP with a constant value,
2305 reduce it to the sum of an assembler symbol and an integer.
2306 Store them both in the structure *VALUE.
2307 Abort if EXP does not reduce. */
2312 HOST_WIDE_INT offset
;
2316 decode_addr_const (exp
, value
)
2318 struct addr_const
*value
;
2320 tree target
= TREE_OPERAND (exp
, 0);
2326 if (TREE_CODE (target
) == COMPONENT_REF
2327 && host_integerp (byte_position (TREE_OPERAND (target
, 1)), 0))
2330 offset
+= int_byte_position (TREE_OPERAND (target
, 1));
2331 target
= TREE_OPERAND (target
, 0);
2333 else if (TREE_CODE (target
) == ARRAY_REF
2334 || TREE_CODE (target
) == ARRAY_RANGE_REF
)
2336 offset
+= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (target
)), 1)
2337 * tree_low_cst (TREE_OPERAND (target
, 1), 0));
2338 target
= TREE_OPERAND (target
, 0);
2344 switch (TREE_CODE (target
))
2348 x
= DECL_RTL (target
);
2352 x
= gen_rtx_MEM (FUNCTION_MODE
,
2353 gen_rtx_LABEL_REF (VOIDmode
,
2354 label_rtx (TREE_OPERAND (exp
, 0))));
2362 /* This constant should have been output already, but we can't simply
2363 use TREE_CST_RTL since INTEGER_CST doesn't have one. */
2364 x
= output_constant_def (target
, 1);
2371 if (GET_CODE (x
) != MEM
)
2376 value
->offset
= offset
;
2379 /* We do RTX_UNSPEC + XINT (blah), so nothing can go after RTX_UNSPEC. */
2380 enum kind
{ RTX_UNKNOWN
, RTX_DOUBLE
, RTX_INT
, RTX_VECTOR
, RTX_UNSPEC
};
2383 ENUM_BITFIELD(kind
) kind
: 16;
2384 ENUM_BITFIELD(machine_mode
) mode
: 16;
2386 union real_extract du
;
2387 struct addr_const addr
;
2388 struct {HOST_WIDE_INT high
, low
;} di
;
2390 /* The max vector size we have is 8 wide. This should be enough. */
2391 HOST_WIDE_INT veclo
[16];
2392 HOST_WIDE_INT vechi
[16];
2396 /* Uniquize all constants that appear in memory.
2397 Each constant in memory thus far output is recorded
2398 in `const_hash_table' with a `struct constant_descriptor'
2399 that contains a polish representation of the value of
2402 We cannot store the trees in the hash table
2403 because the trees may be temporary. */
2405 struct constant_descriptor
2407 struct constant_descriptor
*next
;
2410 /* Make sure the data is reasonably aligned. */
2413 unsigned char contents
[1];
2414 #ifdef HAVE_LONG_DOUBLE
2423 #define MAX_HASH_TABLE 1009
2424 static struct constant_descriptor
*const_hash_table
[MAX_HASH_TABLE
];
2426 /* We maintain a hash table of STRING_CST values. Unless we are asked to force
2427 out a string constant, we defer output of the constants until we know
2428 they are actually used. This will be if something takes its address or if
2429 there is a usage of the string in the RTL of a function. */
2431 #define STRHASH(x) ((hashval_t) ((long) (x) >> 3))
2433 struct deferred_string
2440 static htab_t const_str_htab
;
2442 /* Mark a const_hash_table descriptor for GC. */
2445 mark_const_hash_entry (ptr
)
2448 struct constant_descriptor
*desc
= * (struct constant_descriptor
**) ptr
;
2452 ggc_mark_rtx (desc
->rtl
);
2457 /* Mark the hash-table element X (which is really a pointer to an
2458 struct deferred_string *). */
2461 mark_const_str_htab_1 (x
, data
)
2463 void *data ATTRIBUTE_UNUSED
;
2465 ggc_mark_tree (((struct deferred_string
*) *x
)->exp
);
2469 /* Mark a const_str_htab for GC. */
2472 mark_const_str_htab (htab
)
2475 htab_traverse (*((htab_t
*) htab
), mark_const_str_htab_1
, NULL
);
2478 /* Returns a hash code for X (which is a really a
2479 struct deferred_string *). */
2482 const_str_htab_hash (x
)
2485 return STRHASH (((const struct deferred_string
*) x
)->label
);
2488 /* Returns non-zero if the value represented by X (which is really a
2489 struct deferred_string *) is the same as that given by Y
2490 (which is really a char *). */
2493 const_str_htab_eq (x
, y
)
2497 return (((const struct deferred_string
*) x
)->label
== (const char *) y
);
2500 /* Delete the hash table entry dfsp. */
2503 const_str_htab_del (dfsp
)
2509 /* Compute a hash code for a constant expression. */
2517 enum tree_code code
= TREE_CODE (exp
);
2519 /* Either set P and LEN to the address and len of something to hash and
2520 exit the switch or return a value. */
2525 p
= (char *) &TREE_INT_CST (exp
);
2526 len
= sizeof TREE_INT_CST (exp
);
2530 p
= (char *) &TREE_REAL_CST (exp
);
2531 len
= sizeof TREE_REAL_CST (exp
);
2535 p
= TREE_STRING_POINTER (exp
);
2536 len
= TREE_STRING_LENGTH (exp
);
2540 return (const_hash (TREE_REALPART (exp
)) * 5
2541 + const_hash (TREE_IMAGPART (exp
)));
2544 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2548 len
= int_size_in_bytes (TREE_TYPE (exp
));
2549 tmp
= (char *) alloca (len
);
2550 get_set_constructor_bytes (exp
, (unsigned char *) tmp
, len
);
2558 /* For record type, include the type in the hashing.
2559 We do not do so for array types
2560 because (1) the sizes of the elements are sufficient
2561 and (2) distinct array types can have the same constructor.
2562 Instead, we include the array size because the constructor could
2564 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2565 hi
= ((unsigned long) TREE_TYPE (exp
) & ((1 << HASHBITS
) - 1))
2568 hi
= ((5 + int_size_in_bytes (TREE_TYPE (exp
)))
2569 & ((1 << HASHBITS
) - 1)) % MAX_HASH_TABLE
;
2571 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2572 if (TREE_VALUE (link
))
2574 = (hi
* 603 + const_hash (TREE_VALUE (link
))) % MAX_HASH_TABLE
;
2581 struct addr_const value
;
2583 decode_addr_const (exp
, &value
);
2584 if (GET_CODE (value
.base
) == SYMBOL_REF
)
2586 /* Don't hash the address of the SYMBOL_REF;
2587 only use the offset and the symbol name. */
2589 p
= XSTR (value
.base
, 0);
2590 for (i
= 0; p
[i
] != 0; i
++)
2591 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2593 else if (GET_CODE (value
.base
) == LABEL_REF
)
2594 hi
= value
.offset
+ CODE_LABEL_NUMBER (XEXP (value
.base
, 0)) * 13;
2598 hi
&= (1 << HASHBITS
) - 1;
2599 hi
%= MAX_HASH_TABLE
;
2605 return (const_hash (TREE_OPERAND (exp
, 0)) * 9
2606 + const_hash (TREE_OPERAND (exp
, 1)));
2610 case NON_LVALUE_EXPR
:
2611 return const_hash (TREE_OPERAND (exp
, 0)) * 7 + 2;
2614 /* A language specific constant. Just hash the code. */
2615 return (int) code
% MAX_HASH_TABLE
;
2618 /* Compute hashing function */
2620 for (i
= 0; i
< len
; i
++)
2621 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2623 hi
&= (1 << HASHBITS
) - 1;
2624 hi
%= MAX_HASH_TABLE
;
2628 /* Compare a constant expression EXP with a constant-descriptor DESC.
2629 Return 1 if DESC describes a constant with the same value as EXP. */
2632 compare_constant (exp
, desc
)
2634 struct constant_descriptor
*desc
;
2636 return 0 != compare_constant_1 (exp
, desc
->u
.contents
);
2639 /* Compare constant expression EXP with a substring P of a constant descriptor.
2640 If they match, return a pointer to the end of the substring matched.
2641 If they do not match, return 0.
2643 Since descriptors are written in polish prefix notation,
2644 this function can be used recursively to test one operand of EXP
2645 against a subdescriptor, and if it succeeds it returns the
2646 address of the subdescriptor for the next operand. */
2648 static const unsigned char *
2649 compare_constant_1 (exp
, p
)
2651 const unsigned char *p
;
2653 const unsigned char *strp
;
2655 enum tree_code code
= TREE_CODE (exp
);
2657 if (code
!= (enum tree_code
) *p
++)
2660 /* Either set STRP, P and LEN to pointers and length to compare and exit the
2661 switch, or return the result of the comparison. */
2666 /* Integer constants are the same only if the same width of type. */
2667 if (*p
++ != TYPE_PRECISION (TREE_TYPE (exp
)))
2670 strp
= (unsigned char *) &TREE_INT_CST (exp
);
2671 len
= sizeof TREE_INT_CST (exp
);
2675 /* Real constants are the same only if the same width of type. */
2676 if (*p
++ != TYPE_PRECISION (TREE_TYPE (exp
)))
2679 strp
= (unsigned char *) &TREE_REAL_CST (exp
);
2680 len
= sizeof TREE_REAL_CST (exp
);
2684 if (flag_writable_strings
)
2687 if ((enum machine_mode
) *p
++ != TYPE_MODE (TREE_TYPE (exp
)))
2690 strp
= (const unsigned char *) TREE_STRING_POINTER (exp
);
2691 len
= TREE_STRING_LENGTH (exp
);
2692 if (memcmp ((char *) &TREE_STRING_LENGTH (exp
), p
,
2693 sizeof TREE_STRING_LENGTH (exp
)))
2696 p
+= sizeof TREE_STRING_LENGTH (exp
);
2700 p
= compare_constant_1 (TREE_REALPART (exp
), p
);
2704 return compare_constant_1 (TREE_IMAGPART (exp
), p
);
2707 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2709 int xlen
= len
= int_size_in_bytes (TREE_TYPE (exp
));
2710 unsigned char *tmp
= (unsigned char *) alloca (len
);
2712 get_set_constructor_bytes (exp
, tmp
, len
);
2713 strp
= (unsigned char *) tmp
;
2714 if (memcmp ((char *) &xlen
, p
, sizeof xlen
))
2723 int length
= list_length (CONSTRUCTOR_ELTS (exp
));
2725 enum machine_mode mode
= TYPE_MODE (TREE_TYPE (exp
));
2726 int have_purpose
= 0;
2728 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2729 if (TREE_PURPOSE (link
))
2732 if (memcmp ((char *) &length
, p
, sizeof length
))
2737 /* For record constructors, insist that the types match.
2738 For arrays, just verify both constructors are for arrays.
2739 Then insist that either both or none have any TREE_PURPOSE
2741 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2742 type
= TREE_TYPE (exp
);
2746 if (memcmp ((char *) &type
, p
, sizeof type
))
2749 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2751 if (memcmp ((char *) &mode
, p
, sizeof mode
))
2759 if (memcmp ((char *) &have_purpose
, p
, sizeof have_purpose
))
2762 p
+= sizeof have_purpose
;
2764 /* For arrays, insist that the size in bytes match. */
2765 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2767 HOST_WIDE_INT size
= int_size_in_bytes (TREE_TYPE (exp
));
2769 if (memcmp ((char *) &size
, p
, sizeof size
))
2775 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2777 if (TREE_VALUE (link
))
2779 if ((p
= compare_constant_1 (TREE_VALUE (link
), p
)) == 0)
2786 if (memcmp ((char *) &zero
, p
, sizeof zero
))
2792 if (TREE_PURPOSE (link
)
2793 && TREE_CODE (TREE_PURPOSE (link
)) == FIELD_DECL
)
2795 if (memcmp ((char *) &TREE_PURPOSE (link
), p
,
2796 sizeof TREE_PURPOSE (link
)))
2799 p
+= sizeof TREE_PURPOSE (link
);
2801 else if (TREE_PURPOSE (link
))
2803 if ((p
= compare_constant_1 (TREE_PURPOSE (link
), p
)) == 0)
2806 else if (have_purpose
)
2810 if (memcmp ((char *) &zero
, p
, sizeof zero
))
2822 struct addr_const value
;
2824 decode_addr_const (exp
, &value
);
2825 strp
= (unsigned char *) &value
.offset
;
2826 len
= sizeof value
.offset
;
2827 /* Compare the offset. */
2829 if (*p
++ != *strp
++)
2832 /* Compare symbol name. */
2833 strp
= (const unsigned char *) XSTR (value
.base
, 0);
2834 len
= strlen ((const char *) strp
) + 1;
2841 p
= compare_constant_1 (TREE_OPERAND (exp
, 0), p
);
2845 return compare_constant_1 (TREE_OPERAND (exp
, 1), p
);
2849 case NON_LVALUE_EXPR
:
2850 return compare_constant_1 (TREE_OPERAND (exp
, 0), p
);
2854 tree
new = (*lang_hooks
.expand_constant
) (exp
);
2857 return compare_constant_1 (new, p
);
2863 /* Compare constant contents. */
2865 if (*p
++ != *strp
++)
2871 /* Construct a constant descriptor for the expression EXP.
2872 It is up to the caller to enter the descriptor in the hash table. */
2874 static struct constant_descriptor
*
2875 record_constant (exp
)
2878 struct constant_descriptor
*next
= 0;
2883 /* Make a struct constant_descriptor. The first three pointers will
2884 be filled in later. Here we just leave space for them. */
2886 obstack_grow (&permanent_obstack
, (char *) &next
, sizeof next
);
2887 obstack_grow (&permanent_obstack
, (char *) &label
, sizeof label
);
2888 obstack_grow (&permanent_obstack
, (char *) &rtl
, sizeof rtl
);
2890 /* Align the descriptor for the data payload. */
2891 pad
= (offsetof (struct constant_descriptor
, u
)
2892 - offsetof(struct constant_descriptor
, rtl
)
2893 - sizeof(next
->rtl
));
2895 obstack_blank (&permanent_obstack
, pad
);
2897 record_constant_1 (exp
);
2898 return (struct constant_descriptor
*) obstack_finish (&permanent_obstack
);
2901 /* Add a description of constant expression EXP
2902 to the object growing in `permanent_obstack'.
2903 No need to return its address; the caller will get that
2904 from the obstack when the object is complete. */
2907 record_constant_1 (exp
)
2910 const unsigned char *strp
;
2912 enum tree_code code
= TREE_CODE (exp
);
2914 obstack_1grow (&permanent_obstack
, (unsigned int) code
);
2919 obstack_1grow (&permanent_obstack
, TYPE_PRECISION (TREE_TYPE (exp
)));
2920 strp
= (unsigned char *) &TREE_INT_CST (exp
);
2921 len
= sizeof TREE_INT_CST (exp
);
2925 obstack_1grow (&permanent_obstack
, TYPE_PRECISION (TREE_TYPE (exp
)));
2926 strp
= (unsigned char *) &TREE_REAL_CST (exp
);
2927 len
= sizeof TREE_REAL_CST (exp
);
2931 if (flag_writable_strings
)
2934 obstack_1grow (&permanent_obstack
, TYPE_MODE (TREE_TYPE (exp
)));
2935 strp
= (const unsigned char *) TREE_STRING_POINTER (exp
);
2936 len
= TREE_STRING_LENGTH (exp
);
2937 obstack_grow (&permanent_obstack
, (char *) &TREE_STRING_LENGTH (exp
),
2938 sizeof TREE_STRING_LENGTH (exp
));
2942 record_constant_1 (TREE_REALPART (exp
));
2943 record_constant_1 (TREE_IMAGPART (exp
));
2947 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2949 int nbytes
= int_size_in_bytes (TREE_TYPE (exp
));
2950 obstack_grow (&permanent_obstack
, &nbytes
, sizeof (nbytes
));
2951 obstack_blank (&permanent_obstack
, nbytes
);
2952 get_set_constructor_bytes
2953 (exp
, (unsigned char *) permanent_obstack
.next_free
-nbytes
,
2960 int length
= list_length (CONSTRUCTOR_ELTS (exp
));
2961 enum machine_mode mode
= TYPE_MODE (TREE_TYPE (exp
));
2963 int have_purpose
= 0;
2965 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2966 if (TREE_PURPOSE (link
))
2969 obstack_grow (&permanent_obstack
, (char *) &length
, sizeof length
);
2971 /* For record constructors, insist that the types match.
2972 For arrays, just verify both constructors are for arrays
2973 of the same mode. Then insist that either both or none
2974 have any TREE_PURPOSE values. */
2975 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2976 type
= TREE_TYPE (exp
);
2980 obstack_grow (&permanent_obstack
, (char *) &type
, sizeof type
);
2981 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2982 obstack_grow (&permanent_obstack
, &mode
, sizeof mode
);
2984 obstack_grow (&permanent_obstack
, (char *) &have_purpose
,
2985 sizeof have_purpose
);
2987 /* For arrays, insist that the size in bytes match. */
2988 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2990 HOST_WIDE_INT size
= int_size_in_bytes (TREE_TYPE (exp
));
2991 obstack_grow (&permanent_obstack
, (char *) &size
, sizeof size
);
2994 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2996 if (TREE_VALUE (link
))
2997 record_constant_1 (TREE_VALUE (link
));
3002 obstack_grow (&permanent_obstack
,
3003 (char *) &zero
, sizeof zero
);
3006 if (TREE_PURPOSE (link
)
3007 && TREE_CODE (TREE_PURPOSE (link
)) == FIELD_DECL
)
3008 obstack_grow (&permanent_obstack
,
3009 (char *) &TREE_PURPOSE (link
),
3010 sizeof TREE_PURPOSE (link
));
3011 else if (TREE_PURPOSE (link
))
3012 record_constant_1 (TREE_PURPOSE (link
));
3013 else if (have_purpose
)
3017 obstack_grow (&permanent_obstack
,
3018 (char *) &zero
, sizeof zero
);
3026 struct addr_const value
;
3028 decode_addr_const (exp
, &value
);
3029 /* Record the offset. */
3030 obstack_grow (&permanent_obstack
,
3031 (char *) &value
.offset
, sizeof value
.offset
);
3033 switch (GET_CODE (value
.base
))
3036 /* Record the symbol name. */
3037 obstack_grow (&permanent_obstack
, XSTR (value
.base
, 0),
3038 strlen (XSTR (value
.base
, 0)) + 1);
3041 /* Record the address of the CODE_LABEL. It may not have
3042 been emitted yet, so it's UID may be zero. But pointer
3043 identity is good enough. */
3044 obstack_grow (&permanent_obstack
, &XEXP (value
.base
, 0),
3056 record_constant_1 (TREE_OPERAND (exp
, 0));
3057 record_constant_1 (TREE_OPERAND (exp
, 1));
3062 case NON_LVALUE_EXPR
:
3063 record_constant_1 (TREE_OPERAND (exp
, 0));
3068 tree
new = (*lang_hooks
.expand_constant
) (exp
);
3071 record_constant_1 (new);
3076 /* Record constant contents. */
3077 obstack_grow (&permanent_obstack
, strp
, len
);
3080 /* Record a list of constant expressions that were passed to
3081 output_constant_def but that could not be output right away. */
3083 struct deferred_constant
3085 struct deferred_constant
*next
;
3091 static struct deferred_constant
*deferred_constants
;
3093 /* Another list of constants which should be output after the
3095 static struct deferred_constant
*after_function_constants
;
3097 /* Nonzero means defer output of addressed subconstants
3098 (i.e., those for which output_constant_def is called.) */
3099 static int defer_addressed_constants_flag
;
3101 /* Start deferring output of subconstants. */
3104 defer_addressed_constants ()
3106 defer_addressed_constants_flag
++;
3109 /* Stop deferring output of subconstants,
3110 and output now all those that have been deferred. */
3113 output_deferred_addressed_constants ()
3115 struct deferred_constant
*p
, *next
;
3117 defer_addressed_constants_flag
--;
3119 if (defer_addressed_constants_flag
> 0)
3122 for (p
= deferred_constants
; p
; p
= next
)
3124 output_constant_def_contents (p
->exp
, p
->reloc
, p
->labelno
);
3129 deferred_constants
= 0;
3132 /* Output any constants which should appear after a function. */
3135 output_after_function_constants ()
3137 struct deferred_constant
*p
, *next
;
3139 for (p
= after_function_constants
; p
; p
= next
)
3141 output_constant_def_contents (p
->exp
, p
->reloc
, p
->labelno
);
3146 after_function_constants
= 0;
3149 /* Make a copy of the whole tree structure for a constant.
3150 This handles the same types of nodes that compare_constant
3151 and record_constant handle. */
3157 switch (TREE_CODE (exp
))
3160 /* For ADDR_EXPR, we do not want to copy the decl whose address
3161 is requested. We do want to copy constants though. */
3162 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, 0))) == 'c')
3163 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
3164 copy_constant (TREE_OPERAND (exp
, 0)));
3166 return copy_node (exp
);
3171 return copy_node (exp
);
3174 return build_complex (TREE_TYPE (exp
),
3175 copy_constant (TREE_REALPART (exp
)),
3176 copy_constant (TREE_IMAGPART (exp
)));
3180 return build (TREE_CODE (exp
), TREE_TYPE (exp
),
3181 copy_constant (TREE_OPERAND (exp
, 0)),
3182 copy_constant (TREE_OPERAND (exp
, 1)));
3186 case NON_LVALUE_EXPR
:
3187 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
3188 copy_constant (TREE_OPERAND (exp
, 0)));
3192 tree copy
= copy_node (exp
);
3193 tree list
= copy_list (CONSTRUCTOR_ELTS (exp
));
3196 CONSTRUCTOR_ELTS (copy
) = list
;
3197 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
3198 TREE_VALUE (tail
) = copy_constant (TREE_VALUE (tail
));
3199 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
3200 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
3201 TREE_PURPOSE (tail
) = copy_constant (TREE_PURPOSE (tail
));
3211 /* Return an rtx representing a reference to constant data in memory
3212 for the constant expression EXP.
3214 If assembler code for such a constant has already been output,
3215 return an rtx to refer to it.
3216 Otherwise, output such a constant in memory (or defer it for later)
3217 and generate an rtx for it.
3219 If DEFER is non-zero, the output of string constants can be deferred
3220 and output only if referenced in the function after all optimizations.
3222 The TREE_CST_RTL of EXP is set up to point to that rtx.
3223 The const_hash_table records which constants already have label strings. */
3226 output_constant_def (exp
, defer
)
3231 struct constant_descriptor
*desc
;
3232 struct deferred_string
**defstr
;
3236 int after_function
= 0;
3240 /* We can't just use the saved RTL if this is a defererred string constant
3241 and we are not to defer anymode. */
3242 if (TREE_CODE (exp
) != INTEGER_CST
&& TREE_CST_RTL (exp
)
3243 && (defer
|| !STRING_POOL_ADDRESS_P (XEXP (TREE_CST_RTL (exp
), 0))))
3244 return TREE_CST_RTL (exp
);
3246 /* Make sure any other constants whose addresses appear in EXP
3247 are assigned label numbers. */
3249 reloc
= output_addressed_constants (exp
);
3251 /* Compute hash code of EXP. Search the descriptors for that hash code
3252 to see if any of them describes EXP. If yes, the descriptor records
3253 the label number already assigned. */
3255 hash
= const_hash (exp
) % MAX_HASH_TABLE
;
3257 for (desc
= const_hash_table
[hash
]; desc
; desc
= desc
->next
)
3258 if (compare_constant (exp
, desc
))
3263 /* No constant equal to EXP is known to have been output.
3264 Make a constant descriptor to enter EXP in the hash table.
3265 Assign the label number and record it in the descriptor for
3266 future calls to this function to find. */
3268 /* Create a string containing the label name, in LABEL. */
3269 labelno
= const_labelno
++;
3270 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", labelno
);
3272 desc
= record_constant (exp
);
3273 desc
->next
= const_hash_table
[hash
];
3274 desc
->label
= ggc_strdup (label
);
3275 const_hash_table
[hash
] = desc
;
3277 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
3279 = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp
)),
3280 gen_rtx_SYMBOL_REF (Pmode
, desc
->label
));
3282 set_mem_attributes (rtl
, exp
, 1);
3283 set_mem_alias_set (rtl
, 0);
3284 set_mem_alias_set (rtl
, const_alias_set
);
3291 if (TREE_CODE (exp
) != INTEGER_CST
)
3292 TREE_CST_RTL (exp
) = rtl
;
3294 /* Optionally set flags or add text to the name to record information
3295 such as that it is a function name. If the name is changed, the macro
3296 ASM_OUTPUT_LABELREF will have to know how to strip this information. */
3297 #ifdef ENCODE_SECTION_INFO
3298 /* A previously-processed constant would already have section info
3302 ENCODE_SECTION_INFO (exp
, true);
3304 desc
->label
= XSTR (XEXP (desc
->rtl
, 0), 0);
3308 #ifdef CONSTANT_AFTER_FUNCTION_P
3309 if (current_function_decl
!= 0
3310 && CONSTANT_AFTER_FUNCTION_P (exp
))
3315 && STRING_POOL_ADDRESS_P (XEXP (rtl
, 0))
3316 && (!defer
|| defer_addressed_constants_flag
|| after_function
))
3318 defstr
= (struct deferred_string
**)
3319 htab_find_slot_with_hash (const_str_htab
, desc
->label
,
3320 STRHASH (desc
->label
), NO_INSERT
);
3323 /* If the string is currently deferred but we need to output it now,
3324 remove it from deferred string hash table. */
3326 labelno
= (*defstr
)->labelno
;
3327 STRING_POOL_ADDRESS_P (XEXP (rtl
, 0)) = 0;
3328 htab_clear_slot (const_str_htab
, (void **) defstr
);
3332 /* If this is the first time we've seen this particular constant,
3333 output it (or defer its output for later). */
3336 if (defer_addressed_constants_flag
|| after_function
)
3338 struct deferred_constant
*p
3339 = (struct deferred_constant
*)
3340 xmalloc (sizeof (struct deferred_constant
));
3342 p
->exp
= copy_constant (exp
);
3344 p
->labelno
= labelno
;
3347 p
->next
= after_function_constants
;
3348 after_function_constants
= p
;
3352 p
->next
= deferred_constants
;
3353 deferred_constants
= p
;
3358 /* Do no output if -fsyntax-only. */
3359 if (! flag_syntax_only
)
3361 if (TREE_CODE (exp
) != STRING_CST
3363 || flag_writable_strings
3364 || (defstr
= (struct deferred_string
**)
3365 htab_find_slot_with_hash (const_str_htab
,
3367 STRHASH (desc
->label
),
3369 output_constant_def_contents (exp
, reloc
, labelno
);
3372 struct deferred_string
*p
;
3374 p
= (struct deferred_string
*)
3375 xmalloc (sizeof (struct deferred_string
));
3377 p
->exp
= copy_constant (exp
);
3378 p
->label
= desc
->label
;
3379 p
->labelno
= labelno
;
3381 STRING_POOL_ADDRESS_P (XEXP (rtl
, 0)) = 1;
3390 /* Now output assembler code to define the label for EXP,
3391 and follow it with the data of EXP. */
3394 output_constant_def_contents (exp
, reloc
, labelno
)
3401 /* Align the location counter as required by EXP's data type. */
3402 align
= TYPE_ALIGN (TREE_TYPE (exp
));
3403 #ifdef CONSTANT_ALIGNMENT
3404 align
= CONSTANT_ALIGNMENT (exp
, align
);
3407 if (IN_NAMED_SECTION (exp
))
3408 named_section (exp
, NULL
, reloc
);
3411 /* First switch to text section, except for writable strings. */
3412 #ifdef SELECT_SECTION
3413 SELECT_SECTION (exp
, reloc
, align
);
3415 if (((TREE_CODE (exp
) == STRING_CST
) && flag_writable_strings
)
3416 || (flag_pic
&& reloc
))
3419 readonly_data_section ();
3423 if (align
> BITS_PER_UNIT
)
3425 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
3428 /* Output the label itself. */
3429 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LC", labelno
);
3431 /* Output the value of EXP. */
3432 output_constant (exp
,
3433 (TREE_CODE (exp
) == STRING_CST
3434 ? MAX (TREE_STRING_LENGTH (exp
),
3435 int_size_in_bytes (TREE_TYPE (exp
)))
3436 : int_size_in_bytes (TREE_TYPE (exp
))),
3441 /* Structure to represent sufficient information about a constant so that
3442 it can be output when the constant pool is output, so that function
3443 integration can be done, and to simplify handling on machines that reference
3444 constant pool as base+displacement. */
3446 struct pool_constant
3448 struct constant_descriptor
*desc
;
3449 struct pool_constant
*next
, *next_sym
;
3451 enum machine_mode mode
;
3454 HOST_WIDE_INT offset
;
3458 /* Hash code for a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true.
3459 The argument is XSTR (... , 0) */
3461 #define SYMHASH(LABEL) \
3462 ((((unsigned long) (LABEL)) & ((1 << HASHBITS) - 1)) % MAX_RTX_HASH_TABLE)
3464 /* Initialize constant pool hashing for a new function. */
3467 init_varasm_status (f
)
3470 struct varasm_status
*p
;
3471 p
= (struct varasm_status
*) xmalloc (sizeof (struct varasm_status
));
3473 p
->x_const_rtx_hash_table
3474 = ((struct constant_descriptor
**)
3475 xcalloc (MAX_RTX_HASH_TABLE
, sizeof (struct constant_descriptor
*)));
3476 p
->x_const_rtx_sym_hash_table
3477 = ((struct pool_constant
**)
3478 xcalloc (MAX_RTX_HASH_TABLE
, sizeof (struct pool_constant
*)));
3480 p
->x_first_pool
= p
->x_last_pool
= 0;
3481 p
->x_pool_offset
= 0;
3482 p
->x_const_double_chain
= 0;
3485 /* Mark PC for GC. */
3488 mark_pool_constant (pc
)
3489 struct pool_constant
*pc
;
3494 ggc_mark_rtx (pc
->constant
);
3495 ggc_mark_rtx (pc
->desc
->rtl
);
3500 /* Mark P for GC. */
3503 mark_varasm_status (p
)
3504 struct varasm_status
*p
;
3509 mark_pool_constant (p
->x_first_pool
);
3510 ggc_mark_rtx (p
->x_const_double_chain
);
3513 /* Clear out all parts of the state in F that can safely be discarded
3514 after the function has been compiled, to let garbage collection
3515 reclaim the memory. */
3518 free_varasm_status (f
)
3521 struct varasm_status
*p
;
3526 /* Clear out the hash tables. */
3527 for (i
= 0; i
< MAX_RTX_HASH_TABLE
; ++i
)
3529 struct constant_descriptor
*cd
;
3531 cd
= p
->x_const_rtx_hash_table
[i
];
3534 struct constant_descriptor
*next
= cd
->next
;
3541 free (p
->x_const_rtx_hash_table
);
3542 free (p
->x_const_rtx_sym_hash_table
);
3549 /* Express an rtx for a constant integer (perhaps symbolic)
3550 as the sum of a symbol or label plus an explicit integer.
3551 They are stored into VALUE. */
3554 decode_rtx_const (mode
, x
, value
)
3555 enum machine_mode mode
;
3557 struct rtx_const
*value
;
3559 /* Clear the whole structure, including any gaps. */
3560 memset (value
, 0, sizeof (struct rtx_const
));
3562 value
->kind
= RTX_INT
; /* Most usual kind. */
3565 switch (GET_CODE (x
))
3568 value
->kind
= RTX_DOUBLE
;
3569 if (GET_MODE (x
) != VOIDmode
)
3571 value
->mode
= GET_MODE (x
);
3572 memcpy ((char *) &value
->un
.du
,
3573 (char *) &CONST_DOUBLE_LOW (x
), sizeof value
->un
.du
);
3577 value
->un
.di
.low
= CONST_DOUBLE_LOW (x
);
3578 value
->un
.di
.high
= CONST_DOUBLE_HIGH (x
);
3587 units
= CONST_VECTOR_NUNITS (x
);
3588 value
->kind
= RTX_VECTOR
;
3591 for (i
= 0; i
< units
; ++i
)
3593 elt
= CONST_VECTOR_ELT (x
, i
);
3594 if (GET_MODE_CLASS (mode
) == MODE_VECTOR_INT
)
3596 value
->un
.veclo
[i
] = (HOST_WIDE_INT
) INTVAL (elt
);
3597 value
->un
.vechi
[i
] = 0;
3599 else if (GET_MODE_CLASS (mode
) == MODE_VECTOR_FLOAT
)
3601 value
->un
.veclo
[i
] = (HOST_WIDE_INT
) CONST_DOUBLE_LOW (elt
);
3602 value
->un
.vechi
[i
] = (HOST_WIDE_INT
) CONST_DOUBLE_HIGH (elt
);
3611 value
->un
.addr
.offset
= INTVAL (x
);
3617 value
->un
.addr
.base
= x
;
3622 if (GET_CODE (x
) == PLUS
&& GET_CODE (XEXP (x
, 1)) == CONST_INT
)
3624 value
->un
.addr
.base
= XEXP (x
, 0);
3625 value
->un
.addr
.offset
= INTVAL (XEXP (x
, 1));
3627 else if (GET_CODE (x
) == MINUS
&& GET_CODE (XEXP (x
, 1)) == CONST_INT
)
3629 value
->un
.addr
.base
= XEXP (x
, 0);
3630 value
->un
.addr
.offset
= - INTVAL (XEXP (x
, 1));
3634 value
->un
.addr
.base
= x
;
3635 value
->un
.addr
.offset
= 0;
3640 value
->kind
= RTX_UNKNOWN
;
3644 if (value
->kind
== RTX_INT
&& value
->un
.addr
.base
!= 0
3645 && GET_CODE (value
->un
.addr
.base
) == UNSPEC
)
3647 /* For a simple UNSPEC, the base is set to the
3648 operand, the kind field is set to the index of
3649 the unspec expression.
3650 Together with the code below, in case that
3651 the operand is a SYMBOL_REF or LABEL_REF,
3652 the address of the string or the code_label
3653 is taken as base. */
3654 if (XVECLEN (value
->un
.addr
.base
, 0) == 1)
3656 value
->kind
= RTX_UNSPEC
+ XINT (value
->un
.addr
.base
, 1);
3657 value
->un
.addr
.base
= XVECEXP (value
->un
.addr
.base
, 0, 0);
3661 if (value
->kind
> RTX_DOUBLE
&& value
->un
.addr
.base
!= 0)
3662 switch (GET_CODE (value
->un
.addr
.base
))
3665 /* Use the string's address, not the SYMBOL_REF's address,
3666 for the sake of addresses of library routines. */
3667 value
->un
.addr
.base
= (rtx
) XSTR (value
->un
.addr
.base
, 0);
3671 /* For a LABEL_REF, compare labels. */
3672 value
->un
.addr
.base
= XEXP (value
->un
.addr
.base
, 0);
3679 /* Given a MINUS expression, simplify it if both sides
3680 include the same symbol. */
3683 simplify_subtraction (x
)
3686 struct rtx_const val0
, val1
;
3688 decode_rtx_const (GET_MODE (x
), XEXP (x
, 0), &val0
);
3689 decode_rtx_const (GET_MODE (x
), XEXP (x
, 1), &val1
);
3691 if (val0
.kind
> RTX_DOUBLE
3692 && val0
.kind
== val1
.kind
3693 && val0
.un
.addr
.base
== val1
.un
.addr
.base
)
3694 return GEN_INT (val0
.un
.addr
.offset
- val1
.un
.addr
.offset
);
3699 /* Compute a hash code for a constant RTL expression. */
3702 const_hash_rtx (mode
, x
)
3703 enum machine_mode mode
;
3709 struct rtx_const value
;
3710 decode_rtx_const (mode
, x
, &value
);
3712 /* Compute hashing function */
3714 for (i
= 0; i
< sizeof value
/ sizeof (int); i
++)
3715 hi
+= ((int *) &value
)[i
];
3717 hi
&= (1 << HASHBITS
) - 1;
3718 hi
%= MAX_RTX_HASH_TABLE
;
3722 /* Compare a constant rtl object X with a constant-descriptor DESC.
3723 Return 1 if DESC describes a constant with the same value as X. */
3726 compare_constant_rtx (mode
, x
, desc
)
3727 enum machine_mode mode
;
3729 struct constant_descriptor
*desc
;
3731 int *p
= (int *) desc
->u
.contents
;
3734 struct rtx_const value
;
3736 decode_rtx_const (mode
, x
, &value
);
3737 strp
= (int *) &value
;
3738 len
= sizeof value
/ sizeof (int);
3740 /* Compare constant contents. */
3742 if (*p
++ != *strp
++)
3748 /* Construct a constant descriptor for the rtl-expression X.
3749 It is up to the caller to enter the descriptor in the hash table. */
3751 static struct constant_descriptor
*
3752 record_constant_rtx (mode
, x
)
3753 enum machine_mode mode
;
3756 struct constant_descriptor
*ptr
;
3758 ptr
= ((struct constant_descriptor
*)
3759 xcalloc (1, (offsetof (struct constant_descriptor
, u
)
3760 + sizeof (struct rtx_const
))));
3761 decode_rtx_const (mode
, x
, (struct rtx_const
*) ptr
->u
.contents
);
3766 /* Given a constant rtx X, return a MEM for the location in memory at which
3767 this constant has been placed. Return 0 if it not has been placed yet. */
3770 mem_for_const_double (x
)
3773 enum machine_mode mode
= GET_MODE (x
);
3774 struct constant_descriptor
*desc
;
3776 for (desc
= const_rtx_hash_table
[const_hash_rtx (mode
, x
)]; desc
;
3778 if (compare_constant_rtx (mode
, x
, desc
))
3784 /* Given a constant rtx X, make (or find) a memory constant for its value
3785 and return a MEM rtx to refer to it in memory. */
3788 force_const_mem (mode
, x
)
3789 enum machine_mode mode
;
3793 struct constant_descriptor
*desc
;
3796 struct pool_constant
*pool
;
3799 /* Compute hash code of X. Search the descriptors for that hash code
3800 to see if any of them describes X. If yes, we have an rtx to use. */
3801 hash
= const_hash_rtx (mode
, x
);
3802 for (desc
= const_rtx_hash_table
[hash
]; desc
; desc
= desc
->next
)
3803 if (compare_constant_rtx (mode
, x
, desc
))
3806 /* No constant equal to X is known to have been output.
3807 Make a constant descriptor to enter X in the hash table
3808 and make a MEM for it. */
3809 desc
= record_constant_rtx (mode
, x
);
3810 desc
->next
= const_rtx_hash_table
[hash
];
3811 const_rtx_hash_table
[hash
] = desc
;
3813 /* Align the location counter as required by EXP's data type. */
3814 align
= GET_MODE_ALIGNMENT (mode
== VOIDmode
? word_mode
: mode
);
3815 #ifdef CONSTANT_ALIGNMENT
3816 align
= CONSTANT_ALIGNMENT (make_tree (type_for_mode (mode
, 0), x
), align
);
3819 pool_offset
+= (align
/ BITS_PER_UNIT
) - 1;
3820 pool_offset
&= ~ ((align
/ BITS_PER_UNIT
) - 1);
3822 if (GET_CODE (x
) == LABEL_REF
)
3823 LABEL_PRESERVE_P (XEXP (x
, 0)) = 1;
3825 /* Allocate a pool constant descriptor, fill it in, and chain it in. */
3826 pool
= (struct pool_constant
*) ggc_alloc (sizeof (struct pool_constant
));
3830 pool
->labelno
= const_labelno
;
3831 pool
->align
= align
;
3832 pool
->offset
= pool_offset
;
3839 last_pool
->next
= pool
;
3842 pool_offset
+= GET_MODE_SIZE (mode
);
3844 /* Create a string containing the label name, in LABEL. */
3845 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
3849 /* Construct the SYMBOL_REF and the MEM. */
3851 pool
->desc
->rtl
= def
3852 = gen_rtx_MEM (mode
, gen_rtx_SYMBOL_REF (Pmode
, ggc_strdup (label
)));
3853 set_mem_alias_set (def
, const_alias_set
);
3854 set_mem_attributes (def
, type_for_mode (mode
, 0), 1);
3855 RTX_UNCHANGING_P (def
) = 1;
3857 /* Add label to symbol hash table. */
3858 hash
= SYMHASH (XSTR (XEXP (def
, 0), 0));
3859 pool
->next_sym
= const_rtx_sym_hash_table
[hash
];
3860 const_rtx_sym_hash_table
[hash
] = pool
;
3862 /* Mark the symbol_ref as belonging to this constants pool. */
3863 CONSTANT_POOL_ADDRESS_P (XEXP (def
, 0)) = 1;
3864 current_function_uses_const_pool
= 1;
3869 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
3870 the corresponding pool_constant structure. */
3872 static struct pool_constant
*
3873 find_pool_constant (f
, addr
)
3877 struct pool_constant
*pool
;
3878 const char *label
= XSTR (addr
, 0);
3880 for (pool
= f
->varasm
->x_const_rtx_sym_hash_table
[SYMHASH (label
)]; pool
;
3881 pool
= pool
->next_sym
)
3882 if (XSTR (XEXP (pool
->desc
->rtl
, 0), 0) == label
)
3888 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
3891 get_pool_constant (addr
)
3894 return (find_pool_constant (cfun
, addr
))->constant
;
3897 /* Given a constant pool SYMBOL_REF, return the corresponding constant
3898 and whether it has been output or not. */
3901 get_pool_constant_mark (addr
, pmarked
)
3905 struct pool_constant
*pool
= find_pool_constant (cfun
, addr
);
3906 *pmarked
= (pool
->mark
!= 0);
3907 return pool
->constant
;
3910 /* Likewise, but for the constant pool of a specific function. */
3913 get_pool_constant_for_function (f
, addr
)
3917 return (find_pool_constant (f
, addr
))->constant
;
3920 /* Similar, return the mode. */
3923 get_pool_mode (addr
)
3926 return (find_pool_constant (cfun
, addr
))->mode
;
3930 get_pool_mode_for_function (f
, addr
)
3934 return (find_pool_constant (f
, addr
))->mode
;
3937 /* Similar, return the offset in the constant pool. */
3940 get_pool_offset (addr
)
3943 return (find_pool_constant (cfun
, addr
))->offset
;
3946 /* Return the size of the constant pool. */
3954 /* Write all the constants in the constant pool. */
3957 output_constant_pool (fnname
, fndecl
)
3958 const char *fnname ATTRIBUTE_UNUSED
;
3959 tree fndecl ATTRIBUTE_UNUSED
;
3961 struct pool_constant
*pool
;
3963 union real_extract u
;
3965 /* It is possible for gcc to call force_const_mem and then to later
3966 discard the instructions which refer to the constant. In such a
3967 case we do not need to output the constant. */
3968 mark_constant_pool ();
3970 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3971 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3974 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3983 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3984 whose CODE_LABEL has been deleted. This can occur if a jump table
3985 is eliminated by optimization. If so, write a constant of zero
3986 instead. Note that this can also happen by turning the
3987 CODE_LABEL into a NOTE. */
3988 /* ??? This seems completely and utterly wrong. Certainly it's
3989 not true for NOTE_INSN_DELETED_LABEL, but I disbelieve proper
3990 functioning even with INSN_DELETED_P and friends. */
3993 switch (GET_CODE (x
))
3996 if (GET_CODE (XEXP (x
, 0)) != PLUS
3997 || GET_CODE (XEXP (XEXP (x
, 0), 0)) != LABEL_REF
)
3999 tmp
= XEXP (XEXP (x
, 0), 0);
4004 if (INSN_DELETED_P (tmp
)
4005 || (GET_CODE (tmp
) == NOTE
4006 && NOTE_LINE_NUMBER (tmp
) == NOTE_INSN_DELETED
))
4017 /* First switch to correct section. */
4018 #ifdef SELECT_RTX_SECTION
4019 SELECT_RTX_SECTION (pool
->mode
, x
, pool
->align
);
4021 readonly_data_section ();
4024 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
4025 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file
, x
, pool
->mode
,
4026 pool
->align
, pool
->labelno
, done
);
4029 assemble_align (pool
->align
);
4031 /* Output the label. */
4032 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LC", pool
->labelno
);
4034 /* Output the value of the constant itself. */
4035 switch (GET_MODE_CLASS (pool
->mode
))
4038 if (GET_CODE (x
) != CONST_DOUBLE
)
4041 memcpy ((char *) &u
, (char *) &CONST_DOUBLE_LOW (x
), sizeof u
);
4042 assemble_real (u
.d
, pool
->mode
, pool
->align
);
4046 case MODE_PARTIAL_INT
:
4047 assemble_integer (x
, GET_MODE_SIZE (pool
->mode
), pool
->align
, 1);
4050 case MODE_VECTOR_FLOAT
:
4055 if (GET_CODE (x
) != CONST_VECTOR
)
4058 units
= CONST_VECTOR_NUNITS (x
);
4060 for (i
= 0; i
< units
; i
++)
4062 elt
= CONST_VECTOR_ELT (x
, i
);
4063 memcpy ((char *) &u
,
4064 (char *) &CONST_DOUBLE_LOW (elt
),
4066 assemble_real (u
.d
, GET_MODE_INNER (pool
->mode
), pool
->align
);
4071 case MODE_VECTOR_INT
:
4076 if (GET_CODE (x
) != CONST_VECTOR
)
4079 units
= CONST_VECTOR_NUNITS (x
);
4081 for (i
= 0; i
< units
; i
++)
4083 elt
= CONST_VECTOR_ELT (x
, i
);
4084 assemble_integer (elt
, GET_MODE_UNIT_SIZE (pool
->mode
),
4094 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
4099 #ifdef ASM_OUTPUT_POOL_EPILOGUE
4100 ASM_OUTPUT_POOL_EPILOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
4103 /* Done with this pool. */
4104 first_pool
= last_pool
= 0;
4107 /* Look through the instructions for this function, and mark all the
4108 entries in the constant pool which are actually being used.
4109 Emit used deferred strings. */
4112 mark_constant_pool ()
4115 struct pool_constant
*pool
;
4117 if (first_pool
== 0 && htab_elements (const_str_htab
) == 0)
4120 for (pool
= first_pool
; pool
; pool
= pool
->next
)
4123 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
4125 mark_constants (PATTERN (insn
));
4127 for (insn
= current_function_epilogue_delay_list
;
4129 insn
= XEXP (insn
, 1))
4131 mark_constants (PATTERN (insn
));
4134 /* Look through appropriate parts of X, marking all entries in the
4135 constant pool which are actually being used. Entries that are only
4136 referenced by other constants are also marked as used. Emit
4137 deferred strings that are used. */
4144 const char *format_ptr
;
4149 if (GET_CODE (x
) == SYMBOL_REF
)
4151 mark_constant (&x
, NULL
);
4155 /* Insns may appear inside a SEQUENCE. Only check the patterns of
4156 insns, not any notes that may be attached. We don't want to mark
4157 a constant just because it happens to appear in a REG_EQUIV note. */
4160 mark_constants (PATTERN (x
));
4164 format_ptr
= GET_RTX_FORMAT (GET_CODE (x
));
4166 for (i
= 0; i
< GET_RTX_LENGTH (GET_CODE (x
)); i
++)
4168 switch (*format_ptr
++)
4171 mark_constants (XEXP (x
, i
));
4175 if (XVEC (x
, i
) != 0)
4179 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
4180 mark_constants (XVECEXP (x
, i
, j
));
4199 /* Given a SYMBOL_REF CURRENT_RTX, mark it and all constants it refers
4200 to as used. Emit referenced deferred strings. This function can
4201 be used with for_each_rtx to mark all SYMBOL_REFs in an rtx. */
4204 mark_constant (current_rtx
, data
)
4206 void *data ATTRIBUTE_UNUSED
;
4208 rtx x
= *current_rtx
;
4213 else if (GET_CODE (x
) == SYMBOL_REF
)
4215 if (CONSTANT_POOL_ADDRESS_P (x
))
4217 struct pool_constant
*pool
= find_pool_constant (cfun
, x
);
4218 if (pool
->mark
== 0) {
4220 for_each_rtx (&(pool
->constant
), &mark_constant
, NULL
);
4225 else if (STRING_POOL_ADDRESS_P (x
))
4227 struct deferred_string
**defstr
;
4229 defstr
= (struct deferred_string
**)
4230 htab_find_slot_with_hash (const_str_htab
, XSTR (x
, 0),
4231 STRHASH (XSTR (x
, 0)), NO_INSERT
);
4234 struct deferred_string
*p
= *defstr
;
4236 STRING_POOL_ADDRESS_P (x
) = 0;
4237 output_constant_def_contents (p
->exp
, 0, p
->labelno
);
4238 htab_clear_slot (const_str_htab
, (void **) defstr
);
4245 /* Find all the constants whose addresses are referenced inside of EXP,
4246 and make sure assembler code with a label has been output for each one.
4247 Indicate whether an ADDR_EXPR has been encountered. */
4250 output_addressed_constants (exp
)
4256 /* Give the front-end a chance to convert VALUE to something that
4257 looks more like a constant to the back-end. */
4258 exp
= (*lang_hooks
.expand_constant
) (exp
);
4260 switch (TREE_CODE (exp
))
4263 /* Go inside any operations that get_inner_reference can handle and see
4264 if what's inside is a constant: no need to do anything here for
4265 addresses of variables or functions. */
4266 for (tem
= TREE_OPERAND (exp
, 0); handled_component_p (tem
);
4267 tem
= TREE_OPERAND (tem
, 0))
4270 if (TREE_CODE_CLASS (TREE_CODE (tem
)) == 'c'
4271 || TREE_CODE (tem
) == CONSTRUCTOR
)
4272 output_constant_def (tem
, 0);
4274 if (TREE_PUBLIC (tem
))
4282 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
4283 reloc
|= output_addressed_constants (TREE_OPERAND (exp
, 1));
4288 case NON_LVALUE_EXPR
:
4289 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
4293 for (tem
= CONSTRUCTOR_ELTS (exp
); tem
; tem
= TREE_CHAIN (tem
))
4294 if (TREE_VALUE (tem
) != 0)
4295 reloc
|= output_addressed_constants (TREE_VALUE (tem
));
4305 /* Return nonzero if VALUE is a valid constant-valued expression
4306 for use in initializing a static variable; one that can be an
4307 element of a "constant" initializer.
4309 Return null_pointer_node if the value is absolute;
4310 if it is relocatable, return the variable that determines the relocation.
4311 We assume that VALUE has been folded as much as possible;
4312 therefore, we do not need to check for such things as
4313 arithmetic-combinations of integers. */
4316 initializer_constant_valid_p (value
, endtype
)
4320 /* Give the front-end a chance to convert VALUE to something that
4321 looks more like a constant to the back-end. */
4322 value
= (*lang_hooks
.expand_constant
) (value
);
4324 switch (TREE_CODE (value
))
4327 if ((TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
4328 || TREE_CODE (TREE_TYPE (value
)) == RECORD_TYPE
)
4329 && TREE_CONSTANT (value
)
4330 && CONSTRUCTOR_ELTS (value
))
4332 initializer_constant_valid_p (TREE_VALUE (CONSTRUCTOR_ELTS (value
)),
4335 return TREE_STATIC (value
) ? null_pointer_node
: 0;
4342 return null_pointer_node
;
4346 return staticp (TREE_OPERAND (value
, 0)) ? TREE_OPERAND (value
, 0) : 0;
4348 case VIEW_CONVERT_EXPR
:
4349 case NON_LVALUE_EXPR
:
4350 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
4354 /* Allow conversions between pointer types. */
4355 if (POINTER_TYPE_P (TREE_TYPE (value
))
4356 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
4357 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
4359 /* Allow conversions between real types. */
4360 if (FLOAT_TYPE_P (TREE_TYPE (value
))
4361 && FLOAT_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
4362 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
4364 /* Allow length-preserving conversions between integer types. */
4365 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
4366 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
4367 && (TYPE_PRECISION (TREE_TYPE (value
))
4368 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
4369 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
4371 /* Allow conversions between other integer types only if
4373 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
4374 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
4376 tree inner
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4378 if (inner
== null_pointer_node
)
4379 return null_pointer_node
;
4383 /* Allow (int) &foo provided int is as wide as a pointer. */
4384 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
4385 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
4386 && (TYPE_PRECISION (TREE_TYPE (value
))
4387 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
4388 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4391 /* Likewise conversions from int to pointers, but also allow
4392 conversions from 0. */
4393 if (POINTER_TYPE_P (TREE_TYPE (value
))
4394 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
4396 if (integer_zerop (TREE_OPERAND (value
, 0)))
4397 return null_pointer_node
;
4398 else if (TYPE_PRECISION (TREE_TYPE (value
))
4399 <= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0))))
4400 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4404 /* Allow conversions to union types if the value inside is okay. */
4405 if (TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
)
4406 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4411 if (! INTEGRAL_TYPE_P (endtype
)
4412 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
4414 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4416 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
4418 /* If either term is absolute, use the other terms relocation. */
4419 if (valid0
== null_pointer_node
)
4421 if (valid1
== null_pointer_node
)
4427 if (! INTEGRAL_TYPE_P (endtype
)
4428 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
4430 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4432 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
4434 /* Win if second argument is absolute. */
4435 if (valid1
== null_pointer_node
)
4437 /* Win if both arguments have the same relocation.
4438 Then the value is absolute. */
4439 if (valid0
== valid1
&& valid0
!= 0)
4440 return null_pointer_node
;
4442 /* Since GCC guarantees that string constants are unique in the
4443 generated code, a subtraction between two copies of the same
4444 constant string is absolute. */
4445 if (valid0
&& TREE_CODE (valid0
) == STRING_CST
&&
4446 valid1
&& TREE_CODE (valid1
) == STRING_CST
&&
4447 TREE_STRING_POINTER (valid0
) == TREE_STRING_POINTER (valid1
))
4448 return null_pointer_node
;
4451 /* Support differences between labels. */
4452 if (INTEGRAL_TYPE_P (endtype
))
4455 op0
= TREE_OPERAND (value
, 0);
4456 op1
= TREE_OPERAND (value
, 1);
4458 /* Like STRIP_NOPS except allow the operand mode to widen.
4459 This works around a feature of fold that simplfies
4460 (int)(p1 - p2) to ((int)p1 - (int)p2) under the theory
4461 that the narrower operation is cheaper. */
4463 while (TREE_CODE (op0
) == NOP_EXPR
4464 || TREE_CODE (op0
) == CONVERT_EXPR
4465 || TREE_CODE (op0
) == NON_LVALUE_EXPR
)
4467 tree inner
= TREE_OPERAND (op0
, 0);
4468 if (inner
== error_mark_node
4469 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner
)))
4470 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op0
)))
4471 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner
)))))
4476 while (TREE_CODE (op1
) == NOP_EXPR
4477 || TREE_CODE (op1
) == CONVERT_EXPR
4478 || TREE_CODE (op1
) == NON_LVALUE_EXPR
)
4480 tree inner
= TREE_OPERAND (op1
, 0);
4481 if (inner
== error_mark_node
4482 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner
)))
4483 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op1
)))
4484 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner
)))))
4489 if (TREE_CODE (op0
) == ADDR_EXPR
4490 && TREE_CODE (TREE_OPERAND (op0
, 0)) == LABEL_DECL
4491 && TREE_CODE (op1
) == ADDR_EXPR
4492 && TREE_CODE (TREE_OPERAND (op1
, 0)) == LABEL_DECL
)
4493 return null_pointer_node
;
4504 /* Output assembler code for constant EXP to FILE, with no label.
4505 This includes the pseudo-op such as ".int" or ".byte", and a newline.
4506 Assumes output_addressed_constants has been done on EXP already.
4508 Generate exactly SIZE bytes of assembler data, padding at the end
4509 with zeros if necessary. SIZE must always be specified.
4511 SIZE is important for structure constructors,
4512 since trailing members may have been omitted from the constructor.
4513 It is also important for initialization of arrays from string constants
4514 since the full length of the string constant might not be wanted.
4515 It is also needed for initialization of unions, where the initializer's
4516 type is just one member, and that may not be as long as the union.
4518 There a case in which we would fail to output exactly SIZE bytes:
4519 for a structure constructor that wants to produce more than SIZE bytes.
4520 But such constructors will never be generated for any possible input.
4522 ALIGN is the alignment of the data in bits. */
4525 output_constant (exp
, size
, align
)
4530 enum tree_code code
;
4531 HOST_WIDE_INT thissize
;
4533 /* Some front-ends use constants other than the standard language-indepdent
4534 varieties, but which may still be output directly. Give the front-end a
4535 chance to convert EXP to a language-independent representation. */
4536 exp
= (*lang_hooks
.expand_constant
) (exp
);
4538 if (size
== 0 || flag_syntax_only
)
4541 /* Eliminate any conversions since we'll be outputting the underlying
4543 while (TREE_CODE (exp
) == NOP_EXPR
|| TREE_CODE (exp
) == CONVERT_EXPR
4544 || TREE_CODE (exp
) == NON_LVALUE_EXPR
4545 || TREE_CODE (exp
) == VIEW_CONVERT_EXPR
)
4546 exp
= TREE_OPERAND (exp
, 0);
4548 code
= TREE_CODE (TREE_TYPE (exp
));
4549 thissize
= int_size_in_bytes (TREE_TYPE (exp
));
4551 /* Allow a constructor with no elements for any data type.
4552 This means to fill the space with zeros. */
4553 if (TREE_CODE (exp
) == CONSTRUCTOR
&& CONSTRUCTOR_ELTS (exp
) == 0)
4555 assemble_zeros (size
);
4559 if (TREE_CODE (exp
) == FDESC_EXPR
)
4561 #ifdef ASM_OUTPUT_FDESC
4562 HOST_WIDE_INT part
= tree_low_cst (TREE_OPERAND (exp
, 1), 0);
4563 tree decl
= TREE_OPERAND (exp
, 0);
4564 ASM_OUTPUT_FDESC (asm_out_file
, decl
, part
);
4571 /* Now output the underlying data. If we've handling the padding, return.
4572 Otherwise, break and ensure THISSIZE is the size written. */
4580 case REFERENCE_TYPE
:
4581 if (! assemble_integer (expand_expr (exp
, NULL_RTX
, VOIDmode
,
4582 EXPAND_INITIALIZER
),
4584 error ("initializer for integer value is too complicated");
4588 if (TREE_CODE (exp
) != REAL_CST
)
4589 error ("initializer for floating value is not a floating constant");
4591 assemble_real (TREE_REAL_CST (exp
),
4592 mode_for_size (size
* BITS_PER_UNIT
, MODE_FLOAT
, 0),
4597 output_constant (TREE_REALPART (exp
), thissize
/ 2, align
);
4598 output_constant (TREE_IMAGPART (exp
), thissize
/ 2,
4599 min_align (align
, BITS_PER_UNIT
* (thissize
/ 2)));
4604 if (TREE_CODE (exp
) == CONSTRUCTOR
)
4606 output_constructor (exp
, size
, align
);
4609 else if (TREE_CODE (exp
) == STRING_CST
)
4611 thissize
= MIN (TREE_STRING_LENGTH (exp
), size
);
4612 assemble_string (TREE_STRING_POINTER (exp
), thissize
);
4620 if (TREE_CODE (exp
) == CONSTRUCTOR
)
4621 output_constructor (exp
, size
, align
);
4627 if (TREE_CODE (exp
) == INTEGER_CST
)
4628 assemble_integer (expand_expr (exp
, NULL_RTX
,
4629 VOIDmode
, EXPAND_INITIALIZER
),
4630 thissize
, align
, 1);
4631 else if (TREE_CODE (exp
) == CONSTRUCTOR
)
4633 unsigned char *buffer
= (unsigned char *) alloca (thissize
);
4634 if (get_set_constructor_bytes (exp
, buffer
, thissize
))
4636 assemble_string ((char *) buffer
, thissize
);
4639 error ("unknown set constructor type");
4651 assemble_zeros (size
);
4655 /* Subroutine of output_constructor, used for computing the size of
4656 arrays of unspecified length. VAL must be a CONSTRUCTOR of an array
4657 type with an unspecified upper bound. */
4659 static unsigned HOST_WIDE_INT
4660 array_size_for_constructor (val
)
4665 /* This code used to attempt to handle string constants that are not
4666 arrays of single-bytes, but nothing else does, so there's no point in
4668 if (TREE_CODE (val
) == STRING_CST
)
4669 return TREE_STRING_LENGTH (val
);
4671 max_index
= NULL_TREE
;
4672 for (i
= CONSTRUCTOR_ELTS (val
); i
; i
= TREE_CHAIN (i
))
4674 tree index
= TREE_PURPOSE (i
);
4676 if (TREE_CODE (index
) == RANGE_EXPR
)
4677 index
= TREE_OPERAND (index
, 1);
4678 if (max_index
== NULL_TREE
|| tree_int_cst_lt (max_index
, index
))
4682 if (max_index
== NULL_TREE
)
4685 /* Compute the total number of array elements. */
4686 i
= size_binop (MINUS_EXPR
, convert (sizetype
, max_index
),
4688 TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (val
)))));
4689 i
= size_binop (PLUS_EXPR
, i
, convert (sizetype
, integer_one_node
));
4691 /* Multiply by the array element unit size to find number of bytes. */
4692 i
= size_binop (MULT_EXPR
, i
, TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (val
))));
4694 return tree_low_cst (i
, 1);
4697 /* Subroutine of output_constant, used for CONSTRUCTORs (aggregate constants).
4698 Generate at least SIZE bytes, padding if necessary. */
4701 output_constructor (exp
, size
, align
)
4706 tree type
= TREE_TYPE (exp
);
4707 tree link
, field
= 0;
4709 /* Number of bytes output or skipped so far.
4710 In other words, current position within the constructor. */
4711 HOST_WIDE_INT total_bytes
= 0;
4712 /* Non-zero means BYTE contains part of a byte, to be output. */
4713 int byte_buffer_in_use
= 0;
4716 if (HOST_BITS_PER_WIDE_INT
< BITS_PER_UNIT
)
4719 if (TREE_CODE (type
) == RECORD_TYPE
)
4720 field
= TYPE_FIELDS (type
);
4722 if (TREE_CODE (type
) == ARRAY_TYPE
4723 && TYPE_DOMAIN (type
) != 0)
4724 min_index
= TYPE_MIN_VALUE (TYPE_DOMAIN (type
));
4726 /* As LINK goes through the elements of the constant,
4727 FIELD goes through the structure fields, if the constant is a structure.
4728 if the constant is a union, then we override this,
4729 by getting the field from the TREE_LIST element.
4730 But the constant could also be an array. Then FIELD is zero.
4732 There is always a maximum of one element in the chain LINK for unions
4733 (even if the initializer in a source program incorrectly contains
4735 for (link
= CONSTRUCTOR_ELTS (exp
);
4737 link
= TREE_CHAIN (link
),
4738 field
= field
? TREE_CHAIN (field
) : 0)
4740 tree val
= TREE_VALUE (link
);
4743 /* The element in a union constructor specifies the proper field
4745 if ((TREE_CODE (type
) == RECORD_TYPE
|| TREE_CODE (type
) == UNION_TYPE
4746 || TREE_CODE (type
) == QUAL_UNION_TYPE
)
4747 && TREE_PURPOSE (link
) != 0)
4748 field
= TREE_PURPOSE (link
);
4750 else if (TREE_CODE (type
) == ARRAY_TYPE
)
4751 index
= TREE_PURPOSE (link
);
4753 /* Eliminate the marker that makes a cast not be an lvalue. */
4757 if (index
&& TREE_CODE (index
) == RANGE_EXPR
)
4759 unsigned HOST_WIDE_INT fieldsize
4760 = int_size_in_bytes (TREE_TYPE (type
));
4761 HOST_WIDE_INT lo_index
= tree_low_cst (TREE_OPERAND (index
, 0), 0);
4762 HOST_WIDE_INT hi_index
= tree_low_cst (TREE_OPERAND (index
, 1), 0);
4763 HOST_WIDE_INT index
;
4764 unsigned int align2
= min_align (align
, fieldsize
* BITS_PER_UNIT
);
4766 for (index
= lo_index
; index
<= hi_index
; index
++)
4768 /* Output the element's initial value. */
4770 assemble_zeros (fieldsize
);
4772 output_constant (val
, fieldsize
, align2
);
4774 /* Count its size. */
4775 total_bytes
+= fieldsize
;
4778 else if (field
== 0 || !DECL_BIT_FIELD (field
))
4780 /* An element that is not a bit-field. */
4782 unsigned HOST_WIDE_INT fieldsize
;
4783 /* Since this structure is static,
4784 we know the positions are constant. */
4785 HOST_WIDE_INT pos
= field
? int_byte_position (field
) : 0;
4786 unsigned int align2
;
4789 pos
= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (val
)), 1)
4790 * (tree_low_cst (index
, 0) - tree_low_cst (min_index
, 0)));
4792 /* Output any buffered-up bit-fields preceding this element. */
4793 if (byte_buffer_in_use
)
4795 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4797 byte_buffer_in_use
= 0;
4800 /* Advance to offset of this element.
4801 Note no alignment needed in an array, since that is guaranteed
4802 if each element has the proper size. */
4803 if ((field
!= 0 || index
!= 0) && pos
!= total_bytes
)
4805 assemble_zeros (pos
- total_bytes
);
4809 /* Find the alignment of this element. */
4810 align2
= min_align (align
, BITS_PER_UNIT
* pos
);
4812 /* Determine size this element should occupy. */
4817 /* If this is an array with an unspecified upper bound,
4818 the initializer determines the size. */
4819 /* ??? This ought to only checked if DECL_SIZE_UNIT is NULL,
4820 but we cannot do this until the deprecated support for
4821 initializing zero-length array members is removed. */
4822 if (TREE_CODE (TREE_TYPE (field
)) == ARRAY_TYPE
4823 && TYPE_DOMAIN (TREE_TYPE (field
))
4824 && ! TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (field
))))
4826 fieldsize
= array_size_for_constructor (val
);
4827 /* Given a non-empty initialization, this field had
4829 if (fieldsize
!= 0 && TREE_CHAIN (field
) != NULL_TREE
)
4832 else if (DECL_SIZE_UNIT (field
))
4834 /* ??? This can't be right. If the decl size overflows
4835 a host integer we will silently emit no data. */
4836 if (host_integerp (DECL_SIZE_UNIT (field
), 1))
4837 fieldsize
= tree_low_cst (DECL_SIZE_UNIT (field
), 1);
4841 fieldsize
= int_size_in_bytes (TREE_TYPE (type
));
4843 /* Output the element's initial value. */
4845 assemble_zeros (fieldsize
);
4847 output_constant (val
, fieldsize
, align2
);
4849 /* Count its size. */
4850 total_bytes
+= fieldsize
;
4852 else if (val
!= 0 && TREE_CODE (val
) != INTEGER_CST
)
4853 error ("invalid initial value for member `%s'",
4854 IDENTIFIER_POINTER (DECL_NAME (field
)));
4857 /* Element that is a bit-field. */
4859 HOST_WIDE_INT next_offset
= int_bit_position (field
);
4860 HOST_WIDE_INT end_offset
4861 = (next_offset
+ tree_low_cst (DECL_SIZE (field
), 1));
4864 val
= integer_zero_node
;
4866 /* If this field does not start in this (or, next) byte,
4868 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4870 /* Output remnant of any bit field in previous bytes. */
4871 if (byte_buffer_in_use
)
4873 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4875 byte_buffer_in_use
= 0;
4878 /* If still not at proper byte, advance to there. */
4879 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4881 assemble_zeros (next_offset
/ BITS_PER_UNIT
- total_bytes
);
4882 total_bytes
= next_offset
/ BITS_PER_UNIT
;
4886 if (! byte_buffer_in_use
)
4889 /* We must split the element into pieces that fall within
4890 separate bytes, and combine each byte with previous or
4891 following bit-fields. */
4893 /* next_offset is the offset n fbits from the beginning of
4894 the structure to the next bit of this element to be processed.
4895 end_offset is the offset of the first bit past the end of
4897 while (next_offset
< end_offset
)
4901 HOST_WIDE_INT value
;
4902 HOST_WIDE_INT next_byte
= next_offset
/ BITS_PER_UNIT
;
4903 HOST_WIDE_INT next_bit
= next_offset
% BITS_PER_UNIT
;
4905 /* Advance from byte to byte
4906 within this element when necessary. */
4907 while (next_byte
!= total_bytes
)
4909 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4914 /* Number of bits we can process at once
4915 (all part of the same byte). */
4916 this_time
= MIN (end_offset
- next_offset
,
4917 BITS_PER_UNIT
- next_bit
);
4918 if (BYTES_BIG_ENDIAN
)
4920 /* On big-endian machine, take the most significant bits
4921 first (of the bits that are significant)
4922 and put them into bytes from the most significant end. */
4923 shift
= end_offset
- next_offset
- this_time
;
4925 /* Don't try to take a bunch of bits that cross
4926 the word boundary in the INTEGER_CST. We can
4927 only select bits from the LOW or HIGH part
4929 if (shift
< HOST_BITS_PER_WIDE_INT
4930 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4932 this_time
= shift
+ this_time
- HOST_BITS_PER_WIDE_INT
;
4933 shift
= HOST_BITS_PER_WIDE_INT
;
4936 /* Now get the bits from the appropriate constant word. */
4937 if (shift
< HOST_BITS_PER_WIDE_INT
)
4938 value
= TREE_INT_CST_LOW (val
);
4939 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4941 value
= TREE_INT_CST_HIGH (val
);
4942 shift
-= HOST_BITS_PER_WIDE_INT
;
4947 /* Get the result. This works only when:
4948 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4949 byte
|= (((value
>> shift
)
4950 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4951 << (BITS_PER_UNIT
- this_time
- next_bit
));
4955 /* On little-endian machines,
4956 take first the least significant bits of the value
4957 and pack them starting at the least significant
4958 bits of the bytes. */
4959 shift
= next_offset
- int_bit_position (field
);
4961 /* Don't try to take a bunch of bits that cross
4962 the word boundary in the INTEGER_CST. We can
4963 only select bits from the LOW or HIGH part
4965 if (shift
< HOST_BITS_PER_WIDE_INT
4966 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4967 this_time
= (HOST_BITS_PER_WIDE_INT
- shift
);
4969 /* Now get the bits from the appropriate constant word. */
4970 if (shift
< HOST_BITS_PER_WIDE_INT
)
4971 value
= TREE_INT_CST_LOW (val
);
4972 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4974 value
= TREE_INT_CST_HIGH (val
);
4975 shift
-= HOST_BITS_PER_WIDE_INT
;
4980 /* Get the result. This works only when:
4981 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4982 byte
|= (((value
>> shift
)
4983 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4987 next_offset
+= this_time
;
4988 byte_buffer_in_use
= 1;
4993 if (byte_buffer_in_use
)
4995 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4999 if (total_bytes
< size
)
5000 assemble_zeros (size
- total_bytes
);
5003 /* This TREE_LIST contains any weak symbol declarations waiting
5005 static tree weak_decls
;
5007 /* Declare DECL to be a weak symbol. */
5013 if (! TREE_PUBLIC (decl
))
5014 error_with_decl (decl
, "weak declaration of `%s' must be public");
5015 else if (TREE_ASM_WRITTEN (decl
))
5016 error_with_decl (decl
, "weak declaration of `%s' must precede definition");
5017 else if (SUPPORTS_WEAK
)
5019 if (! DECL_WEAK (decl
))
5020 weak_decls
= tree_cons (NULL
, decl
, weak_decls
);
5023 warning_with_decl (decl
, "weak declaration of `%s' not supported");
5025 DECL_WEAK (decl
) = 1;
5028 /* Emit any pending weak declarations. */
5035 for (t
= weak_decls
; t
; t
= TREE_CHAIN (t
))
5037 tree decl
= TREE_VALUE (t
);
5038 const char *name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
5040 if (! TREE_USED (decl
))
5043 #ifdef ASM_WEAKEN_DECL
5044 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, NULL
);
5046 #ifdef ASM_WEAKEN_LABEL
5047 ASM_WEAKEN_LABEL (asm_out_file
, name
);
5049 #ifdef ASM_OUTPUT_WEAK_ALIAS
5050 warning ("only weak aliases are supported in this configuration");
5058 /* Emit the assembly bits to indicate that DECL is globally visible. */
5061 globalize_decl (decl
)
5064 const char *name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
5066 #if defined (ASM_WEAKEN_LABEL) || defined (ASM_WEAKEN_DECL)
5067 if (DECL_WEAK (decl
))
5071 #ifdef ASM_WEAKEN_DECL
5072 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, 0);
5074 ASM_WEAKEN_LABEL (asm_out_file
, name
);
5077 /* Remove this function from the pending weak list so that
5078 we do not emit multiple .weak directives for it. */
5079 for (p
= &weak_decls
; (t
= *p
) ; p
= &TREE_CHAIN (t
))
5080 if (TREE_VALUE (t
) == decl
)
5082 *p
= TREE_CHAIN (t
);
5089 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
5092 /* Emit an assembler directive to make the symbol for DECL an alias to
5093 the symbol for TARGET. */
5096 assemble_alias (decl
, target
)
5097 tree decl
, target ATTRIBUTE_UNUSED
;
5101 /* We must force creation of DECL_RTL for debug info generation, even though
5102 we don't use it here. */
5103 make_decl_rtl (decl
, NULL
);
5105 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
5107 #ifdef ASM_OUTPUT_DEF
5108 /* Make name accessible from other files, if appropriate. */
5110 if (TREE_PUBLIC (decl
))
5112 globalize_decl (decl
);
5113 maybe_assemble_visibility (decl
);
5116 #ifdef ASM_OUTPUT_DEF_FROM_DECLS
5117 ASM_OUTPUT_DEF_FROM_DECLS (asm_out_file
, decl
, target
);
5119 ASM_OUTPUT_DEF (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
5121 TREE_ASM_WRITTEN (decl
) = 1;
5122 #else /* !ASM_OUTPUT_DEF */
5123 #if defined (ASM_OUTPUT_WEAK_ALIAS) || defined (ASM_WEAKEN_DECL)
5124 if (! DECL_WEAK (decl
))
5125 warning ("only weak aliases are supported in this configuration");
5127 #ifdef ASM_WEAKEN_DECL
5128 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, IDENTIFIER_POINTER (target
));
5130 ASM_OUTPUT_WEAK_ALIAS (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
5132 TREE_ASM_WRITTEN (decl
) = 1;
5134 warning ("alias definitions not supported in this configuration; ignored");
5139 /* Emit an assembler directive to set symbol for DECL visibility to
5143 assemble_visibility (decl
, visibility_type
)
5145 const char *visibility_type ATTRIBUTE_UNUSED
;
5149 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
5151 #ifdef HAVE_GAS_HIDDEN
5152 fprintf (asm_out_file
, "\t.%s\t%s\n", visibility_type
, name
);
5154 warning ("visibility attribute not supported in this configuration; ignored");
5158 /* A helper function to call assemble_visibility when needed for a decl. */
5161 maybe_assemble_visibility (decl
)
5164 tree visibility
= lookup_attribute ("visibility", DECL_ATTRIBUTES (decl
));
5168 = TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (visibility
)));
5169 assemble_visibility (decl
, type
);
5173 /* Returns 1 if the target configuration supports defining public symbols
5174 so that one of them will be chosen at link time instead of generating a
5175 multiply-defined symbol error, whether through the use of weak symbols or
5176 a target-specific mechanism for having duplicates discarded. */
5179 supports_one_only ()
5181 if (SUPPORTS_ONE_ONLY
)
5183 return SUPPORTS_WEAK
;
5186 /* Set up DECL as a public symbol that can be defined in multiple
5187 translation units without generating a linker error. */
5190 make_decl_one_only (decl
)
5193 if (TREE_CODE (decl
) != VAR_DECL
&& TREE_CODE (decl
) != FUNCTION_DECL
)
5196 TREE_PUBLIC (decl
) = 1;
5198 if (TREE_CODE (decl
) == VAR_DECL
5199 && (DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
))
5200 DECL_COMMON (decl
) = 1;
5201 else if (SUPPORTS_ONE_ONLY
)
5203 #ifdef MAKE_DECL_ONE_ONLY
5204 MAKE_DECL_ONE_ONLY (decl
);
5206 DECL_ONE_ONLY (decl
) = 1;
5208 else if (SUPPORTS_WEAK
)
5209 DECL_WEAK (decl
) = 1;
5217 const_str_htab
= htab_create (128, const_str_htab_hash
, const_str_htab_eq
,
5218 const_str_htab_del
);
5219 in_named_htab
= htab_create (31, in_named_entry_hash
,
5220 in_named_entry_eq
, NULL
);
5222 ggc_add_root (const_hash_table
, MAX_HASH_TABLE
, sizeof const_hash_table
[0],
5223 mark_const_hash_entry
);
5224 ggc_add_root (&const_str_htab
, 1, sizeof const_str_htab
,
5225 mark_const_str_htab
);
5226 ggc_add_tree_root (&weak_decls
, 1);
5228 const_alias_set
= new_alias_set ();
5231 /* Select a set of attributes for section NAME based on the properties
5232 of DECL and whether or not RELOC indicates that DECL's initializer
5233 might contain runtime relocations.
5235 We make the section read-only and executable for a function decl,
5236 read-only for a const data decl, and writable for a non-const data decl. */
5239 default_section_type_flags (decl
, name
, reloc
)
5246 if (decl
&& TREE_CODE (decl
) == FUNCTION_DECL
)
5247 flags
= SECTION_CODE
;
5248 else if (decl
&& DECL_READONLY_SECTION (decl
, reloc
))
5251 flags
= SECTION_WRITE
;
5253 if (decl
&& DECL_ONE_ONLY (decl
))
5254 flags
|= SECTION_LINKONCE
;
5256 if (strcmp (name
, ".bss") == 0
5257 || strncmp (name
, ".bss.", 5) == 0
5258 || strncmp (name
, ".gnu.linkonce.b.", 16) == 0
5259 || strcmp (name
, ".sbss") == 0
5260 || strncmp (name
, ".sbss.", 6) == 0
5261 || strncmp (name
, ".gnu.linkonce.sb.", 17) == 0)
5262 flags
|= SECTION_BSS
;
5267 /* Output assembly to switch to section NAME with attribute FLAGS.
5268 Four variants for common object file formats. */
5271 default_no_named_section (name
, flags
)
5272 const char *name ATTRIBUTE_UNUSED
;
5273 unsigned int flags ATTRIBUTE_UNUSED
;
5275 /* Some object formats don't support named sections at all. The
5276 front-end should already have flagged this as an error. */
5281 default_elf_asm_named_section (name
, flags
)
5285 char flagchars
[10], *f
= flagchars
;
5288 if (! named_section_first_declaration (name
))
5290 fprintf (asm_out_file
, "\t.section\t%s\n", name
);
5294 if (!(flags
& SECTION_DEBUG
))
5296 if (flags
& SECTION_WRITE
)
5298 if (flags
& SECTION_CODE
)
5300 if (flags
& SECTION_SMALL
)
5302 if (flags
& SECTION_MERGE
)
5304 if (flags
& SECTION_STRINGS
)
5308 if (flags
& SECTION_BSS
)
5313 if (flags
& SECTION_ENTSIZE
)
5314 fprintf (asm_out_file
, "\t.section\t%s,\"%s\",@%s,%d\n",
5315 name
, flagchars
, type
, flags
& SECTION_ENTSIZE
);
5317 fprintf (asm_out_file
, "\t.section\t%s,\"%s\",@%s\n",
5318 name
, flagchars
, type
);
5322 default_coff_asm_named_section (name
, flags
)
5326 char flagchars
[8], *f
= flagchars
;
5328 if (flags
& SECTION_WRITE
)
5330 if (flags
& SECTION_CODE
)
5334 fprintf (asm_out_file
, "\t.section\t%s,\"%s\"\n", name
, flagchars
);
5338 default_pe_asm_named_section (name
, flags
)
5342 default_coff_asm_named_section (name
, flags
);
5344 if (flags
& SECTION_LINKONCE
)
5346 /* Functions may have been compiled at various levels of
5347 optimization so we can't use `same_size' here.
5348 Instead, have the linker pick one. */
5349 fprintf (asm_out_file
, "\t.linkonce %s\n",
5350 (flags
& SECTION_CODE
? "discard" : "same_size"));
5354 /* Used for vtable gc in GNU binutils. Record that the pointer at OFFSET
5355 from SYMBOL is used in all classes derived from SYMBOL. */
5358 assemble_vtable_entry (symbol
, offset
)
5360 HOST_WIDE_INT offset
;
5362 fputs ("\t.vtable_entry ", asm_out_file
);
5363 output_addr_const (asm_out_file
, symbol
);
5364 fputs (", ", asm_out_file
);
5365 fprintf (asm_out_file
, HOST_WIDE_INT_PRINT_DEC
, offset
);
5366 fputc ('\n', asm_out_file
);
5369 /* Used for vtable gc in GNU binutils. Record the class hierarchy by noting
5370 that the vtable symbol CHILD is derived from the vtable symbol PARENT. */
5373 assemble_vtable_inherit (child
, parent
)
5376 fputs ("\t.vtable_inherit ", asm_out_file
);
5377 output_addr_const (asm_out_file
, child
);
5378 fputs (", ", asm_out_file
);
5379 output_addr_const (asm_out_file
, parent
);
5380 fputc ('\n', asm_out_file
);