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"
46 #include "langhooks.h"
51 #ifdef XCOFF_DEBUGGING_INFO
52 #include "xcoffout.h" /* Needed for external data
53 declarations for e.g. AIX 4.x. */
56 #ifndef TRAMPOLINE_ALIGNMENT
57 #define TRAMPOLINE_ALIGNMENT FUNCTION_BOUNDARY
61 #define ASM_STABS_OP "\t.stabs\t"
64 /* The (assembler) name of the first globally-visible object output. */
65 const char *first_global_object_name
;
66 const char *weak_global_object_name
;
68 extern struct obstack permanent_obstack
;
69 #define obstack_chunk_alloc xmalloc
72 struct constant_descriptor
;
76 #define MAX_RTX_HASH_TABLE 61
80 /* Hash facility for making memory-constants
81 from constant rtl-expressions. It is used on RISC machines
82 where immediate integer arguments and constant addresses are restricted
83 so that such constants must be stored in memory.
85 This pool of constants is reinitialized for each function
86 so each function gets its own constants-pool that comes right before
88 struct constant_descriptor
**x_const_rtx_hash_table
;
89 struct pool_constant
**x_const_rtx_sym_hash_table
;
91 /* Pointers to first and last constant in pool. */
92 struct pool_constant
*x_first_pool
, *x_last_pool
;
94 /* Current offset in constant pool (does not include any machine-specific
96 HOST_WIDE_INT x_pool_offset
;
98 /* Chain of all CONST_DOUBLE rtx's constructed for the current function.
99 They are chained through the CONST_DOUBLE_CHAIN. */
100 rtx x_const_double_chain
;
103 #define const_rtx_hash_table (cfun->varasm->x_const_rtx_hash_table)
104 #define const_rtx_sym_hash_table (cfun->varasm->x_const_rtx_sym_hash_table)
105 #define first_pool (cfun->varasm->x_first_pool)
106 #define last_pool (cfun->varasm->x_last_pool)
107 #define pool_offset (cfun->varasm->x_pool_offset)
108 #define const_double_chain (cfun->varasm->x_const_double_chain)
110 /* Number for making the label on the next
111 constant that is stored in memory. */
115 /* Number for making the label on the next
116 static variable internal to a function. */
120 /* Carry information from ASM_DECLARE_OBJECT_NAME
121 to ASM_FINISH_DECLARE_OBJECT. */
123 int size_directive_output
;
125 /* The last decl for which assemble_variable was called,
126 if it did ASM_DECLARE_OBJECT_NAME.
127 If the last call to assemble_variable didn't do that,
130 tree last_assemble_variable_decl
;
132 /* RTX_UNCHANGING_P in a MEM can mean it is stored into, for initialization.
133 So giving constant the alias set for the type will allow such
134 initializations to appear to conflict with the load of the constant. We
135 avoid this by giving all constants an alias set for just constants.
136 Since there will be no stores to that alias set, nothing will ever
137 conflict with them. */
139 static HOST_WIDE_INT const_alias_set
;
141 static const char *strip_reg_name
PARAMS ((const char *));
142 static int contains_pointers_p
PARAMS ((tree
));
143 static void decode_addr_const
PARAMS ((tree
, struct addr_const
*));
144 static int const_hash
PARAMS ((tree
));
145 static int compare_constant
PARAMS ((tree
,
146 struct constant_descriptor
*));
147 static const unsigned char *compare_constant_1
PARAMS ((tree
, const unsigned char *));
148 static struct constant_descriptor
*record_constant
PARAMS ((tree
));
149 static void record_constant_1
PARAMS ((tree
));
150 static tree copy_constant
PARAMS ((tree
));
151 static void output_constant_def_contents
PARAMS ((tree
, int, int));
152 static void decode_rtx_const
PARAMS ((enum machine_mode
, rtx
,
153 struct rtx_const
*));
154 static int const_hash_rtx
PARAMS ((enum machine_mode
, rtx
));
155 static int compare_constant_rtx
PARAMS ((enum machine_mode
, rtx
,
156 struct constant_descriptor
*));
157 static struct constant_descriptor
*record_constant_rtx
PARAMS ((enum machine_mode
,
159 static struct pool_constant
*find_pool_constant
PARAMS ((struct function
*, rtx
));
160 static void mark_constant_pool
PARAMS ((void));
161 static void mark_constants
PARAMS ((rtx
));
162 static int mark_constant
PARAMS ((rtx
*current_rtx
, void *data
));
163 static int output_addressed_constants
PARAMS ((tree
));
164 static void output_after_function_constants
PARAMS ((void));
165 static unsigned HOST_WIDE_INT array_size_for_constructor
PARAMS ((tree
));
166 static unsigned min_align
PARAMS ((unsigned, unsigned));
167 static void output_constructor
PARAMS ((tree
, HOST_WIDE_INT
,
169 #ifdef ASM_WEAKEN_LABEL
170 static void remove_from_pending_weak_list
PARAMS ((const char *));
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 /* ??? Another way to do this would be to pass a flag bit to
853 ENCODE_SECTION_INFO saying whether this is a new decl or not. */
854 /* Let the target reassign the RTL if it wants.
855 This is necessary, for example, when one machine specific
856 decl attribute overrides another. */
857 #ifdef REDO_SECTION_INFO_P
858 if (REDO_SECTION_INFO_P (decl
))
859 ENCODE_SECTION_INFO (decl
);
864 new_name
= name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
866 reg_number
= decode_reg_name (asmspec
);
867 if (reg_number
== -2)
869 /* ASMSPEC is given, and not the name of a register. Mark the
870 name with a star so assemble_name won't munge it. */
871 char *starred
= alloca (strlen (asmspec
) + 2);
873 strcpy (starred
+ 1, asmspec
);
877 if (TREE_CODE (decl
) != FUNCTION_DECL
&& DECL_REGISTER (decl
))
879 /* First detect errors in declaring global registers. */
880 if (reg_number
== -1)
881 error_with_decl (decl
, "register name not specified for `%s'");
882 else if (reg_number
< 0)
883 error_with_decl (decl
, "invalid register name for `%s'");
884 else if (TYPE_MODE (TREE_TYPE (decl
)) == BLKmode
)
885 error_with_decl (decl
,
886 "data type of `%s' isn't suitable for a register");
887 else if (! HARD_REGNO_MODE_OK (reg_number
, TYPE_MODE (TREE_TYPE (decl
))))
888 error_with_decl (decl
,
889 "register specified for `%s' isn't suitable for data type");
890 /* Now handle properly declared static register variables. */
895 if (DECL_INITIAL (decl
) != 0 && TREE_STATIC (decl
))
897 DECL_INITIAL (decl
) = 0;
898 error ("global register variable has initial value");
900 if (TREE_THIS_VOLATILE (decl
))
901 warning ("volatile register variables don't work as you might wish");
903 /* If the user specified one of the eliminables registers here,
904 e.g., FRAME_POINTER_REGNUM, we don't want to get this variable
905 confused with that register and be eliminated. This usage is
906 somewhat suspect... */
908 SET_DECL_RTL (decl
, gen_rtx_raw_REG (DECL_MODE (decl
), reg_number
));
909 ORIGINAL_REGNO (DECL_RTL (decl
)) = reg_number
;
910 REG_USERVAR_P (DECL_RTL (decl
)) = 1;
912 if (TREE_STATIC (decl
))
914 /* Make this register global, so not usable for anything
916 #ifdef ASM_DECLARE_REGISTER_GLOBAL
917 ASM_DECLARE_REGISTER_GLOBAL (asm_out_file
, decl
, reg_number
, name
);
919 nregs
= HARD_REGNO_NREGS (reg_number
, DECL_MODE (decl
));
921 globalize_reg (reg_number
+ --nregs
);
924 /* As a register variable, it has no section. */
929 /* Now handle ordinary static variables and functions (in memory).
930 Also handle vars declared register invalidly. */
932 if (reg_number
>= 0 || reg_number
== -3)
933 error_with_decl (decl
,
934 "register name given for non-register variable `%s'");
936 /* Specifying a section attribute on a variable forces it into a
937 non-.bss section, and thus it cannot be common. */
938 if (TREE_CODE (decl
) == VAR_DECL
939 && DECL_SECTION_NAME (decl
) != NULL_TREE
940 && DECL_INITIAL (decl
) == NULL_TREE
941 && DECL_COMMON (decl
))
942 DECL_COMMON (decl
) = 0;
944 /* Can't use just the variable's own name for a variable
945 whose scope is less than the whole file, unless it's a member
946 of a local class (which will already be unambiguous).
947 Concatenate a distinguishing number. */
948 if (!top_level
&& !TREE_PUBLIC (decl
)
949 && ! (DECL_CONTEXT (decl
) && TYPE_P (DECL_CONTEXT (decl
)))
951 && name
== IDENTIFIER_POINTER (DECL_NAME (decl
)))
955 ASM_FORMAT_PRIVATE_NAME (label
, name
, var_labelno
);
960 if (name
!= new_name
)
962 SET_DECL_ASSEMBLER_NAME (decl
, get_identifier (new_name
));
963 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
966 /* If this variable is to be treated as volatile, show its
967 tree node has side effects. */
968 if ((flag_volatile_global
&& TREE_CODE (decl
) == VAR_DECL
969 && TREE_PUBLIC (decl
))
970 || ((flag_volatile_static
&& TREE_CODE (decl
) == VAR_DECL
971 && (TREE_PUBLIC (decl
) || TREE_STATIC (decl
)))))
972 TREE_SIDE_EFFECTS (decl
) = 1;
974 x
= gen_rtx_MEM (DECL_MODE (decl
), gen_rtx_SYMBOL_REF (Pmode
, name
));
975 SYMBOL_REF_WEAK (XEXP (x
, 0)) = DECL_WEAK (decl
);
976 if (TREE_CODE (decl
) != FUNCTION_DECL
)
977 set_mem_attributes (x
, decl
, 1);
978 SET_DECL_RTL (decl
, x
);
980 /* Optionally set flags or add text to the name to record information
981 such as that it is a function name.
982 If the name is changed, the macro ASM_OUTPUT_LABELREF
983 will have to know how to strip this information. */
984 #ifdef ENCODE_SECTION_INFO
985 ENCODE_SECTION_INFO (decl
);
989 /* Make the rtl for variable VAR be volatile.
990 Use this only for static variables. */
993 make_var_volatile (var
)
996 if (GET_CODE (DECL_RTL (var
)) != MEM
)
999 MEM_VOLATILE_P (DECL_RTL (var
)) = 1;
1002 /* Output alignment directive to align for constant expression EXP. */
1005 assemble_constant_align (exp
)
1010 /* Align the location counter as required by EXP's data type. */
1011 align
= TYPE_ALIGN (TREE_TYPE (exp
));
1012 #ifdef CONSTANT_ALIGNMENT
1013 align
= CONSTANT_ALIGNMENT (exp
, align
);
1016 if (align
> BITS_PER_UNIT
)
1018 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
1022 /* Output a string of literal assembler code
1023 for an `asm' keyword used between functions. */
1026 assemble_asm (string
)
1031 if (TREE_CODE (string
) == ADDR_EXPR
)
1032 string
= TREE_OPERAND (string
, 0);
1034 fprintf (asm_out_file
, "\t%s\n", TREE_STRING_POINTER (string
));
1037 /* Record an element in the table of global destructors. SYMBOL is
1038 a SYMBOL_REF of the function to be called; PRIORITY is a number
1039 between 0 and MAX_INIT_PRIORITY. */
1042 default_stabs_asm_out_destructor (symbol
, priority
)
1044 int priority ATTRIBUTE_UNUSED
;
1046 /* Tell GNU LD that this is part of the static destructor set.
1047 This will work for any system that uses stabs, most usefully
1049 fprintf (asm_out_file
, "%s\"___DTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
1050 assemble_name (asm_out_file
, XSTR (symbol
, 0));
1051 fputc ('\n', asm_out_file
);
1055 default_named_section_asm_out_destructor (symbol
, priority
)
1059 const char *section
= ".dtors";
1062 /* ??? This only works reliably with the GNU linker. */
1063 if (priority
!= DEFAULT_INIT_PRIORITY
)
1065 sprintf (buf
, ".dtors.%.5u",
1066 /* Invert the numbering so the linker puts us in the proper
1067 order; constructors are run from right to left, and the
1068 linker sorts in increasing order. */
1069 MAX_INIT_PRIORITY
- priority
);
1073 named_section_flags (section
, SECTION_WRITE
);
1074 assemble_align (POINTER_SIZE
);
1075 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1078 #ifdef DTORS_SECTION_ASM_OP
1082 if (in_section
!= in_dtors
)
1084 in_section
= in_dtors
;
1085 fputs (DTORS_SECTION_ASM_OP
, asm_out_file
);
1086 fputc ('\n', asm_out_file
);
1091 default_dtor_section_asm_out_destructor (symbol
, priority
)
1093 int priority ATTRIBUTE_UNUSED
;
1096 assemble_align (POINTER_SIZE
);
1097 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1101 /* Likewise for global constructors. */
1104 default_stabs_asm_out_constructor (symbol
, priority
)
1106 int priority ATTRIBUTE_UNUSED
;
1108 /* Tell GNU LD that this is part of the static destructor set.
1109 This will work for any system that uses stabs, most usefully
1111 fprintf (asm_out_file
, "%s\"___CTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
1112 assemble_name (asm_out_file
, XSTR (symbol
, 0));
1113 fputc ('\n', asm_out_file
);
1117 default_named_section_asm_out_constructor (symbol
, priority
)
1121 const char *section
= ".ctors";
1124 /* ??? This only works reliably with the GNU linker. */
1125 if (priority
!= DEFAULT_INIT_PRIORITY
)
1127 sprintf (buf
, ".ctors.%.5u",
1128 /* Invert the numbering so the linker puts us in the proper
1129 order; constructors are run from right to left, and the
1130 linker sorts in increasing order. */
1131 MAX_INIT_PRIORITY
- priority
);
1135 named_section_flags (section
, SECTION_WRITE
);
1136 assemble_align (POINTER_SIZE
);
1137 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1140 #ifdef CTORS_SECTION_ASM_OP
1144 if (in_section
!= in_ctors
)
1146 in_section
= in_ctors
;
1147 fputs (CTORS_SECTION_ASM_OP
, asm_out_file
);
1148 fputc ('\n', asm_out_file
);
1153 default_ctor_section_asm_out_constructor (symbol
, priority
)
1155 int priority ATTRIBUTE_UNUSED
;
1158 assemble_align (POINTER_SIZE
);
1159 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1163 /* CONSTANT_POOL_BEFORE_FUNCTION may be defined as an expression with
1164 a non-zero value if the constant pool should be output before the
1165 start of the function, or a zero value if the pool should output
1166 after the end of the function. The default is to put it before the
1169 #ifndef CONSTANT_POOL_BEFORE_FUNCTION
1170 #define CONSTANT_POOL_BEFORE_FUNCTION 1
1173 /* Output assembler code for the constant pool of a function and associated
1174 with defining the name of the function. DECL describes the function.
1175 NAME is the function's name. For the constant pool, we use the current
1176 constant pool data. */
1179 assemble_start_function (decl
, fnname
)
1185 /* The following code does not need preprocessing in the assembler. */
1189 if (CONSTANT_POOL_BEFORE_FUNCTION
)
1190 output_constant_pool (fnname
, decl
);
1192 resolve_unique_section (decl
, 0);
1193 function_section (decl
);
1195 /* Tell assembler to move to target machine's alignment for functions. */
1196 align
= floor_log2 (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
1199 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1202 /* Handle a user-specified function alignment.
1203 Note that we still need to align to FUNCTION_BOUNDARY, as above,
1204 because ASM_OUTPUT_MAX_SKIP_ALIGN might not do any alignment at all. */
1205 if (align_functions_log
> align
)
1207 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
1208 ASM_OUTPUT_MAX_SKIP_ALIGN (asm_out_file
,
1209 align_functions_log
, align_functions
-1);
1211 ASM_OUTPUT_ALIGN (asm_out_file
, align_functions_log
);
1215 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
1216 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file
, fnname
);
1219 (*debug_hooks
->begin_function
) (decl
);
1221 /* Make function name accessible from other files, if appropriate. */
1223 if (TREE_PUBLIC (decl
))
1225 if (! first_global_object_name
)
1230 STRIP_NAME_ENCODING (p
, fnname
);
1231 name
= permalloc (strlen (p
) + 1);
1234 if (! DECL_WEAK (decl
) && ! DECL_ONE_ONLY (decl
))
1235 first_global_object_name
= name
;
1237 weak_global_object_name
= name
;
1240 #ifdef ASM_WEAKEN_LABEL
1241 if (DECL_WEAK (decl
))
1243 ASM_WEAKEN_LABEL (asm_out_file
, fnname
);
1244 /* Remove this function from the pending weak list so that
1245 we do not emit multiple .weak directives for it. */
1246 remove_from_pending_weak_list
1247 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
1251 ASM_GLOBALIZE_LABEL (asm_out_file
, fnname
);
1254 /* Do any machine/system dependent processing of the function name */
1255 #ifdef ASM_DECLARE_FUNCTION_NAME
1256 ASM_DECLARE_FUNCTION_NAME (asm_out_file
, fnname
, current_function_decl
);
1258 /* Standard thing is just output label for the function. */
1259 ASM_OUTPUT_LABEL (asm_out_file
, fnname
);
1260 #endif /* ASM_DECLARE_FUNCTION_NAME */
1263 /* Output assembler code associated with defining the size of the
1264 function. DECL describes the function. NAME is the function's name. */
1267 assemble_end_function (decl
, fnname
)
1271 #ifdef ASM_DECLARE_FUNCTION_SIZE
1272 ASM_DECLARE_FUNCTION_SIZE (asm_out_file
, fnname
, decl
);
1274 if (! CONSTANT_POOL_BEFORE_FUNCTION
)
1276 output_constant_pool (fnname
, decl
);
1277 function_section (decl
); /* need to switch back */
1280 /* Output any constants which should appear after the function. */
1281 output_after_function_constants ();
1284 /* Assemble code to leave SIZE bytes of zeros. */
1287 assemble_zeros (size
)
1290 /* Do no output if -fsyntax-only. */
1291 if (flag_syntax_only
)
1294 #ifdef ASM_NO_SKIP_IN_TEXT
1295 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
1296 so we must output 0s explicitly in the text section. */
1297 if (ASM_NO_SKIP_IN_TEXT
&& in_text_section ())
1300 for (i
= 0; i
< size
; i
++)
1301 assemble_integer (const0_rtx
, 1, BITS_PER_UNIT
, 1);
1306 ASM_OUTPUT_SKIP (asm_out_file
, size
);
1309 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
1312 assemble_align (align
)
1315 if (align
> BITS_PER_UNIT
)
1317 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
1321 /* Assemble a string constant with the specified C string as contents. */
1324 assemble_string (p
, size
)
1331 /* If the string is very long, split it up. */
1335 int thissize
= size
- pos
;
1336 if (thissize
> maximum
)
1339 ASM_OUTPUT_ASCII (asm_out_file
, p
, thissize
);
1347 #if defined ASM_OUTPUT_ALIGNED_DECL_LOCAL
1348 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1349 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1351 #if defined ASM_OUTPUT_ALIGNED_LOCAL
1352 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1353 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, DECL_ALIGN (decl))
1355 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1356 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded)
1360 #if defined ASM_OUTPUT_ALIGNED_BSS
1361 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1362 ASM_OUTPUT_ALIGNED_BSS (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1364 #if defined ASM_OUTPUT_BSS
1365 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1366 ASM_OUTPUT_BSS (asm_out_file, decl, name, size, rounded)
1372 #if defined ASM_OUTPUT_ALIGNED_DECL_COMMON
1373 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1374 ASM_OUTPUT_ALIGNED_DECL_COMMON (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1376 #if defined ASM_OUTPUT_ALIGNED_COMMON
1377 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1378 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file, name, size, DECL_ALIGN (decl))
1380 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1381 ASM_OUTPUT_COMMON (asm_out_file, name, size, rounded)
1386 asm_emit_uninitialised (decl
, name
, size
, rounded
)
1389 int size ATTRIBUTE_UNUSED
;
1390 int rounded ATTRIBUTE_UNUSED
;
1398 destination
= asm_dest_local
;
1400 if (TREE_PUBLIC (decl
))
1402 #if defined ASM_EMIT_BSS
1403 if (! DECL_COMMON (decl
))
1404 destination
= asm_dest_bss
;
1407 destination
= asm_dest_common
;
1410 if (flag_shared_data
)
1412 switch (destination
)
1414 #ifdef ASM_OUTPUT_SHARED_BSS
1416 ASM_OUTPUT_SHARED_BSS (asm_out_file
, decl
, name
, size
, rounded
);
1419 #ifdef ASM_OUTPUT_SHARED_COMMON
1420 case asm_dest_common
:
1421 ASM_OUTPUT_SHARED_COMMON (asm_out_file
, name
, size
, rounded
);
1424 #ifdef ASM_OUTPUT_SHARED_LOCAL
1425 case asm_dest_local
:
1426 ASM_OUTPUT_SHARED_LOCAL (asm_out_file
, name
, size
, rounded
);
1434 resolve_unique_section (decl
, 0);
1436 switch (destination
)
1440 ASM_EMIT_BSS (decl
, name
, size
, rounded
);
1443 case asm_dest_common
:
1444 ASM_EMIT_COMMON (decl
, name
, size
, rounded
);
1446 case asm_dest_local
:
1447 ASM_EMIT_LOCAL (decl
, name
, size
, rounded
);
1456 /* Assemble everything that is needed for a variable or function declaration.
1457 Not used for automatic variables, and not used for function definitions.
1458 Should not be called for variables of incomplete structure type.
1460 TOP_LEVEL is nonzero if this variable has file scope.
1461 AT_END is nonzero if this is the special handling, at end of compilation,
1462 to define things that have had only tentative definitions.
1463 DONT_OUTPUT_DATA if nonzero means don't actually output the
1464 initial value (that will be done by the caller). */
1467 assemble_variable (decl
, top_level
, at_end
, dont_output_data
)
1469 int top_level ATTRIBUTE_UNUSED
;
1470 int at_end ATTRIBUTE_UNUSED
;
1471 int dont_output_data
;
1478 last_assemble_variable_decl
= 0;
1480 /* Normally no need to say anything here for external references,
1481 since assemble_external is called by the language-specific code
1482 when a declaration is first seen. */
1484 if (DECL_EXTERNAL (decl
))
1487 /* Output no assembler code for a function declaration.
1488 Only definitions of functions output anything. */
1490 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1493 /* Do nothing for global register variables. */
1494 if (DECL_RTL_SET_P (decl
) && GET_CODE (DECL_RTL (decl
)) == REG
)
1496 TREE_ASM_WRITTEN (decl
) = 1;
1500 /* If type was incomplete when the variable was declared,
1501 see if it is complete now. */
1503 if (DECL_SIZE (decl
) == 0)
1504 layout_decl (decl
, 0);
1506 /* Still incomplete => don't allocate it; treat the tentative defn
1507 (which is what it must have been) as an `extern' reference. */
1509 if (!dont_output_data
&& DECL_SIZE (decl
) == 0)
1511 error_with_file_and_line (DECL_SOURCE_FILE (decl
),
1512 DECL_SOURCE_LINE (decl
),
1513 "storage size of `%s' isn't known",
1514 IDENTIFIER_POINTER (DECL_NAME (decl
)));
1515 TREE_ASM_WRITTEN (decl
) = 1;
1519 /* The first declaration of a variable that comes through this function
1520 decides whether it is global (in C, has external linkage)
1521 or local (in C, has internal linkage). So do nothing more
1522 if this function has already run. */
1524 if (TREE_ASM_WRITTEN (decl
))
1527 /* Make sure ENCODE_SECTION_INFO is invoked before we set ASM_WRITTEN. */
1528 decl_rtl
= DECL_RTL (decl
);
1530 TREE_ASM_WRITTEN (decl
) = 1;
1532 /* Do no output if -fsyntax-only. */
1533 if (flag_syntax_only
)
1538 if (! dont_output_data
1539 && ! host_integerp (DECL_SIZE_UNIT (decl
), 1))
1541 error_with_decl (decl
, "size of variable `%s' is too large");
1545 name
= XSTR (XEXP (decl_rtl
, 0), 0);
1546 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
)
1547 && ! first_global_object_name
1548 && ! (DECL_COMMON (decl
) && (DECL_INITIAL (decl
) == 0
1549 || DECL_INITIAL (decl
) == error_mark_node
))
1550 && ! DECL_WEAK (decl
)
1551 && ! DECL_ONE_ONLY (decl
))
1556 STRIP_NAME_ENCODING (p
, name
);
1557 xname
= permalloc (strlen (p
) + 1);
1559 first_global_object_name
= xname
;
1562 /* Compute the alignment of this data. */
1564 align
= DECL_ALIGN (decl
);
1566 /* In the case for initialing an array whose length isn't specified,
1567 where we have not yet been able to do the layout,
1568 figure out the proper alignment now. */
1569 if (dont_output_data
&& DECL_SIZE (decl
) == 0
1570 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
)
1571 align
= MAX (align
, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl
))));
1573 /* Some object file formats have a maximum alignment which they support.
1574 In particular, a.out format supports a maximum alignment of 4. */
1575 #ifndef MAX_OFILE_ALIGNMENT
1576 #define MAX_OFILE_ALIGNMENT BIGGEST_ALIGNMENT
1578 if (align
> MAX_OFILE_ALIGNMENT
)
1580 warning_with_decl (decl
,
1581 "alignment of `%s' is greater than maximum object file alignment. Using %d",
1582 MAX_OFILE_ALIGNMENT
/BITS_PER_UNIT
);
1583 align
= MAX_OFILE_ALIGNMENT
;
1586 /* On some machines, it is good to increase alignment sometimes. */
1587 if (! DECL_USER_ALIGN (decl
))
1589 #ifdef DATA_ALIGNMENT
1590 align
= DATA_ALIGNMENT (TREE_TYPE (decl
), align
);
1592 #ifdef CONSTANT_ALIGNMENT
1593 if (DECL_INITIAL (decl
) != 0 && DECL_INITIAL (decl
) != error_mark_node
)
1594 align
= CONSTANT_ALIGNMENT (DECL_INITIAL (decl
), align
);
1598 /* Reset the alignment in case we have made it tighter, so we can benefit
1599 from it in get_pointer_alignment. */
1600 DECL_ALIGN (decl
) = align
;
1601 set_mem_align (decl_rtl
, align
);
1603 /* Handle uninitialized definitions. */
1605 if ((DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
)
1606 /* If the target can't output uninitialized but not common global data
1607 in .bss, then we have to use .data. */
1608 #if ! defined ASM_EMIT_BSS
1609 && DECL_COMMON (decl
)
1611 && DECL_SECTION_NAME (decl
) == NULL_TREE
1612 && ! dont_output_data
)
1614 unsigned HOST_WIDE_INT size
= tree_low_cst (DECL_SIZE_UNIT (decl
), 1);
1615 unsigned HOST_WIDE_INT rounded
= size
;
1617 /* Don't allocate zero bytes of common,
1618 since that means "undefined external" in the linker. */
1622 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1623 so that each uninitialized object starts on such a boundary. */
1624 rounded
+= (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1;
1625 rounded
= (rounded
/ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1626 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1628 /* Don't continue this line--convex cc version 4.1 would lose. */
1629 #if !defined(ASM_OUTPUT_ALIGNED_COMMON) && !defined(ASM_OUTPUT_ALIGNED_DECL_COMMON) && !defined(ASM_OUTPUT_ALIGNED_BSS)
1630 if ((unsigned HOST_WIDE_INT
) DECL_ALIGN (decl
) / BITS_PER_UNIT
> rounded
)
1632 (decl
, "requested alignment for %s is greater than implemented alignment of %d",rounded
);
1635 asm_emit_uninitialised (decl
, name
, size
, rounded
);
1640 /* Handle initialized definitions.
1641 Also handle uninitialized global definitions if -fno-common and the
1642 target doesn't support ASM_OUTPUT_BSS. */
1644 /* First make the assembler name(s) global if appropriate. */
1645 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
))
1647 #ifdef ASM_WEAKEN_LABEL
1648 if (DECL_WEAK (decl
))
1650 ASM_WEAKEN_LABEL (asm_out_file
, name
);
1651 /* Remove this variable from the pending weak list so that
1652 we do not emit multiple .weak directives for it. */
1653 remove_from_pending_weak_list
1654 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
1658 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
1661 /* Output any data that we will need to use the address of. */
1662 if (DECL_INITIAL (decl
) == error_mark_node
)
1663 reloc
= contains_pointers_p (TREE_TYPE (decl
)) ? 3 : 0;
1664 else if (DECL_INITIAL (decl
))
1665 reloc
= output_addressed_constants (DECL_INITIAL (decl
));
1667 /* Switch to the appropriate section. */
1668 resolve_unique_section (decl
, reloc
);
1669 variable_section (decl
, reloc
);
1671 /* dbxout.c needs to know this. */
1672 if (in_text_section ())
1673 DECL_IN_TEXT_SECTION (decl
) = 1;
1675 /* Output the alignment of this data. */
1676 if (align
> BITS_PER_UNIT
)
1678 ASM_OUTPUT_ALIGN (asm_out_file
,
1679 floor_log2 (DECL_ALIGN (decl
) / BITS_PER_UNIT
));
1682 /* Do any machine/system dependent processing of the object. */
1683 #ifdef ASM_DECLARE_OBJECT_NAME
1684 last_assemble_variable_decl
= decl
;
1685 ASM_DECLARE_OBJECT_NAME (asm_out_file
, name
, decl
);
1687 /* Standard thing is just output label for the object. */
1688 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1689 #endif /* ASM_DECLARE_OBJECT_NAME */
1691 if (!dont_output_data
)
1693 if (DECL_INITIAL (decl
))
1694 /* Output the actual data. */
1695 output_constant (DECL_INITIAL (decl
),
1696 tree_low_cst (DECL_SIZE_UNIT (decl
), 1),
1699 /* Leave space for it. */
1700 assemble_zeros (tree_low_cst (DECL_SIZE_UNIT (decl
), 1));
1704 /* Return 1 if type TYPE contains any pointers. */
1707 contains_pointers_p (type
)
1710 switch (TREE_CODE (type
))
1713 case REFERENCE_TYPE
:
1714 /* I'm not sure whether OFFSET_TYPE needs this treatment,
1715 so I'll play safe and return 1. */
1721 case QUAL_UNION_TYPE
:
1724 /* For a type that has fields, see if the fields have pointers. */
1725 for (fields
= TYPE_FIELDS (type
); fields
; fields
= TREE_CHAIN (fields
))
1726 if (TREE_CODE (fields
) == FIELD_DECL
1727 && contains_pointers_p (TREE_TYPE (fields
)))
1733 /* An array type contains pointers if its element type does. */
1734 return contains_pointers_p (TREE_TYPE (type
));
1741 /* Output something to declare an external symbol to the assembler.
1742 (Most assemblers don't need this, so we normally output nothing.)
1743 Do nothing if DECL is not external. */
1746 assemble_external (decl
)
1747 tree decl ATTRIBUTE_UNUSED
;
1749 /* Because most platforms do not define ASM_OUTPUT_EXTERNAL, the
1750 main body of this code is only rarely exercised. To provide some
1751 testing, on all platforms, we make sure that the ASM_OUT_FILE is
1752 open. If it's not, we should not be calling this function. */
1756 #ifdef ASM_OUTPUT_EXTERNAL
1757 if (DECL_P (decl
) && DECL_EXTERNAL (decl
) && TREE_PUBLIC (decl
))
1759 rtx rtl
= DECL_RTL (decl
);
1761 if (GET_CODE (rtl
) == MEM
&& GET_CODE (XEXP (rtl
, 0)) == SYMBOL_REF
1762 && ! SYMBOL_REF_USED (XEXP (rtl
, 0)))
1764 /* Some systems do require some output. */
1765 SYMBOL_REF_USED (XEXP (rtl
, 0)) = 1;
1766 ASM_OUTPUT_EXTERNAL (asm_out_file
, decl
, XSTR (XEXP (rtl
, 0), 0));
1772 /* Similar, for calling a library function FUN. */
1775 assemble_external_libcall (fun
)
1776 rtx fun ATTRIBUTE_UNUSED
;
1778 #ifdef ASM_OUTPUT_EXTERNAL_LIBCALL
1779 /* Declare library function name external when first used, if nec. */
1780 if (! SYMBOL_REF_USED (fun
))
1782 SYMBOL_REF_USED (fun
) = 1;
1783 ASM_OUTPUT_EXTERNAL_LIBCALL (asm_out_file
, fun
);
1788 /* Declare the label NAME global. */
1791 assemble_global (name
)
1792 const char *name ATTRIBUTE_UNUSED
;
1794 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
1797 /* Assemble a label named NAME. */
1800 assemble_label (name
)
1803 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1806 /* Output to FILE a reference to the assembler name of a C-level name NAME.
1807 If NAME starts with a *, the rest of NAME is output verbatim.
1808 Otherwise NAME is transformed in an implementation-defined way
1809 (usually by the addition of an underscore).
1810 Many macros in the tm file are defined to call this function. */
1813 assemble_name (file
, name
)
1817 const char *real_name
;
1820 STRIP_NAME_ENCODING (real_name
, name
);
1822 id
= maybe_get_identifier (real_name
);
1824 TREE_SYMBOL_REFERENCED (id
) = 1;
1827 fputs (&name
[1], file
);
1829 ASM_OUTPUT_LABELREF (file
, name
);
1832 /* Allocate SIZE bytes writable static space with a gensym name
1833 and return an RTX to refer to its address. */
1836 assemble_static_space (size
)
1840 const char *namestring
;
1844 if (flag_shared_data
)
1848 ASM_GENERATE_INTERNAL_LABEL (name
, "LF", const_labelno
);
1850 namestring
= ggc_strdup (name
);
1852 x
= gen_rtx_SYMBOL_REF (Pmode
, namestring
);
1854 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
1855 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file
, NULL_TREE
, name
, size
,
1858 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1859 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file
, name
, size
, BIGGEST_ALIGNMENT
);
1862 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1863 so that each uninitialized object starts on such a boundary. */
1864 /* Variable `rounded' might or might not be used in ASM_OUTPUT_LOCAL. */
1865 int rounded ATTRIBUTE_UNUSED
1866 = ((size
+ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1)
1867 / (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1868 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1869 ASM_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
1876 /* Assemble the static constant template for function entry trampolines.
1877 This is done at most once per compilation.
1878 Returns an RTX for the address of the template. */
1880 #ifdef TRAMPOLINE_TEMPLATE
1882 assemble_trampoline_template ()
1888 /* By default, put trampoline templates in read-only data section. */
1890 #ifdef TRAMPOLINE_SECTION
1891 TRAMPOLINE_SECTION ();
1893 readonly_data_section ();
1896 /* Write the assembler code to define one. */
1897 align
= floor_log2 (TRAMPOLINE_ALIGNMENT
/ BITS_PER_UNIT
);
1900 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1903 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LTRAMP", 0);
1904 TRAMPOLINE_TEMPLATE (asm_out_file
);
1906 /* Record the rtl to refer to it. */
1907 ASM_GENERATE_INTERNAL_LABEL (label
, "LTRAMP", 0);
1908 name
= ggc_strdup (label
);
1909 return gen_rtx_SYMBOL_REF (Pmode
, name
);
1913 /* A and B are either alignments or offsets. Return the minimum alignment
1914 that may be assumed after adding the two together. */
1916 static inline unsigned
1920 return (a
| b
) & -(a
| b
);
1923 /* Return the assembler directive for creating a given kind of integer
1924 object. SIZE is the number of bytes in the object and ALIGNED_P
1925 indicates whether it is known to be aligned. Return NULL if the
1926 assembly dialect has no such directive.
1928 The returned string should be printed at the start of a new line and
1929 be followed immediately by the object's initial value. */
1932 integer_asm_op (size
, aligned_p
)
1936 struct asm_int_op
*ops
;
1939 ops
= &targetm
.asm_out
.aligned_op
;
1941 ops
= &targetm
.asm_out
.unaligned_op
;
1946 return targetm
.asm_out
.byte_op
;
1960 /* Use directive OP to assemble an integer object X. Print OP at the
1961 start of the line, followed immediately by the value of X. */
1964 assemble_integer_with_op (op
, x
)
1968 fputs (op
, asm_out_file
);
1969 output_addr_const (asm_out_file
, x
);
1970 fputc ('\n', asm_out_file
);
1973 /* The default implementation of the asm_out.integer target hook. */
1976 default_assemble_integer (x
, size
, aligned_p
)
1977 rtx x ATTRIBUTE_UNUSED
;
1978 unsigned int size ATTRIBUTE_UNUSED
;
1979 int aligned_p ATTRIBUTE_UNUSED
;
1981 const char *op
= integer_asm_op (size
, aligned_p
);
1982 return op
&& (assemble_integer_with_op (op
, x
), true);
1985 /* Assemble the integer constant X into an object of SIZE bytes. ALIGN is
1986 the alignment of the integer in bits. Return 1 if we were able to output
1987 the constant, otherwise 0. If FORCE is non-zero, abort if we can't output
1991 assemble_integer (x
, size
, align
, force
)
1999 aligned_p
= (align
>= MIN (size
* BITS_PER_UNIT
, BIGGEST_ALIGNMENT
));
2001 /* See if the target hook can handle this kind of object. */
2002 if ((*targetm
.asm_out
.integer
) (x
, size
, aligned_p
))
2005 /* If the object is a multi-byte one, try splitting it up. Split
2006 it into words it if is multi-word, otherwise split it into bytes. */
2009 enum machine_mode omode
, imode
;
2010 unsigned int subalign
;
2011 unsigned int subsize
, i
;
2013 subsize
= size
> UNITS_PER_WORD
? UNITS_PER_WORD
: 1;
2014 subalign
= MIN (align
, subsize
* BITS_PER_UNIT
);
2015 omode
= mode_for_size (subsize
* BITS_PER_UNIT
, MODE_INT
, 0);
2016 imode
= mode_for_size (size
* BITS_PER_UNIT
, MODE_INT
, 0);
2018 for (i
= 0; i
< size
; i
+= subsize
)
2020 rtx partial
= simplify_subreg (omode
, x
, imode
, i
);
2021 if (!partial
|| !assemble_integer (partial
, subsize
, subalign
, 0))
2027 /* If we've printed some of it, but not all of it, there's no going
2040 assemble_real (d
, mode
, align
)
2042 enum machine_mode mode
;
2047 unsigned int nalign
= min_align (align
, 32);
2049 switch (BITS_PER_UNIT
)
2055 REAL_VALUE_TO_TARGET_SINGLE (d
, l
);
2056 assemble_integer (GEN_INT (l
), 4, align
, 1);
2059 REAL_VALUE_TO_TARGET_DOUBLE (d
, data
);
2060 assemble_integer (GEN_INT (data
[0]), 4, align
, 1);
2061 assemble_integer (GEN_INT (data
[1]), 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);
2070 REAL_VALUE_TO_TARGET_LONG_DOUBLE (d
, data
);
2071 assemble_integer (GEN_INT (data
[0]), 4, align
, 1);
2072 assemble_integer (GEN_INT (data
[1]), 4, nalign
, 1);
2073 assemble_integer (GEN_INT (data
[2]), 4, nalign
, 1);
2074 assemble_integer (GEN_INT (data
[3]), 4, nalign
, 1);
2085 REAL_VALUE_TO_TARGET_SINGLE (d
, l
);
2086 assemble_integer (GEN_INT (l
), 2, align
, 1);
2089 REAL_VALUE_TO_TARGET_DOUBLE (d
, data
);
2090 assemble_integer (GEN_INT (data
[0]), 2, align
, 1);
2091 assemble_integer (GEN_INT (data
[1]), 1, nalign
, 1);
2102 REAL_VALUE_TO_TARGET_SINGLE (d
, l
);
2103 assemble_integer (GEN_INT (l
), 1, align
, 1);
2106 REAL_VALUE_TO_TARGET_DOUBLE (d
, data
);
2107 assemble_integer (GEN_INT (data
[0]), 1, align
, 1);
2108 assemble_integer (GEN_INT (data
[1]), 1, nalign
, 1);
2120 /* Here we combine duplicate floating constants to make
2121 CONST_DOUBLE rtx's, and force those out to memory when necessary. */
2123 /* Return a CONST_DOUBLE or CONST_INT for a value specified as a pair of ints.
2124 For an integer, I0 is the low-order word and I1 is the high-order word.
2125 For a real number, I0 is the word with the low address
2126 and I1 is the word with the high address. */
2129 immed_double_const (i0
, i1
, mode
)
2130 HOST_WIDE_INT i0
, i1
;
2131 enum machine_mode mode
;
2135 if (GET_MODE_CLASS (mode
) == MODE_INT
2136 || GET_MODE_CLASS (mode
) == MODE_PARTIAL_INT
)
2138 /* We clear out all bits that don't belong in MODE, unless they and our
2139 sign bit are all one. So we get either a reasonable negative value
2140 or a reasonable unsigned value for this mode. */
2141 int width
= GET_MODE_BITSIZE (mode
);
2142 if (width
< HOST_BITS_PER_WIDE_INT
2143 && ((i0
& ((HOST_WIDE_INT
) (-1) << (width
- 1)))
2144 != ((HOST_WIDE_INT
) (-1) << (width
- 1))))
2145 i0
&= ((HOST_WIDE_INT
) 1 << width
) - 1, i1
= 0;
2146 else if (width
== HOST_BITS_PER_WIDE_INT
2147 && ! (i1
== ~0 && i0
< 0))
2149 else if (width
> 2 * HOST_BITS_PER_WIDE_INT
)
2150 /* We cannot represent this value as a constant. */
2153 /* If this would be an entire word for the target, but is not for
2154 the host, then sign-extend on the host so that the number will look
2155 the same way on the host that it would on the target.
2157 For example, when building a 64 bit alpha hosted 32 bit sparc
2158 targeted compiler, then we want the 32 bit unsigned value -1 to be
2159 represented as a 64 bit value -1, and not as 0x00000000ffffffff.
2160 The later confuses the sparc backend. */
2162 if (width
< HOST_BITS_PER_WIDE_INT
2163 && (i0
& ((HOST_WIDE_INT
) 1 << (width
- 1))))
2164 i0
|= ((HOST_WIDE_INT
) (-1) << width
);
2166 /* If MODE fits within HOST_BITS_PER_WIDE_INT, always use a CONST_INT.
2168 ??? Strictly speaking, this is wrong if we create a CONST_INT
2169 for a large unsigned constant with the size of MODE being
2170 HOST_BITS_PER_WIDE_INT and later try to interpret that constant in a
2171 wider mode. In that case we will mis-interpret it as a negative
2174 Unfortunately, the only alternative is to make a CONST_DOUBLE
2175 for any constant in any mode if it is an unsigned constant larger
2176 than the maximum signed integer in an int on the host. However,
2177 doing this will break everyone that always expects to see a CONST_INT
2178 for SImode and smaller.
2180 We have always been making CONST_INTs in this case, so nothing new
2183 if (width
<= HOST_BITS_PER_WIDE_INT
)
2184 i1
= (i0
< 0) ? ~(HOST_WIDE_INT
) 0 : 0;
2186 /* If this integer fits in one word, return a CONST_INT. */
2187 if ((i1
== 0 && i0
>= 0)
2188 || (i1
== ~0 && i0
< 0))
2189 return GEN_INT (i0
);
2191 /* We use VOIDmode for integers. */
2195 /* Search the chain for an existing CONST_DOUBLE with the right value.
2196 If one is found, return it. */
2198 for (r
= const_double_chain
; r
; r
= CONST_DOUBLE_CHAIN (r
))
2199 if (CONST_DOUBLE_LOW (r
) == i0
&& CONST_DOUBLE_HIGH (r
) == i1
2200 && GET_MODE (r
) == mode
)
2203 /* No; make a new one and add it to the chain. */
2204 r
= gen_rtx_CONST_DOUBLE (mode
, i0
, i1
);
2206 /* Don't touch const_double_chain if not inside any function. */
2207 if (current_function_decl
!= 0)
2209 CONST_DOUBLE_CHAIN (r
) = const_double_chain
;
2210 const_double_chain
= r
;
2216 /* Return a CONST_DOUBLE for a specified `double' value
2217 and machine mode. */
2220 immed_real_const_1 (d
, mode
)
2222 enum machine_mode mode
;
2224 union real_extract u
;
2227 /* Get the desired `double' value as a sequence of ints
2228 since that is how they are stored in a CONST_DOUBLE. */
2232 /* Detect special cases. Check for NaN first, because some ports
2233 (specifically the i386) do not emit correct ieee-fp code by default, and
2234 thus will generate a core dump here if we pass a NaN to REAL_VALUES_EQUAL
2235 and if REAL_VALUES_EQUAL does a floating point comparison. */
2236 if (! REAL_VALUE_ISNAN (d
) && REAL_VALUES_IDENTICAL (dconst0
, d
))
2237 return CONST0_RTX (mode
);
2238 else if (! REAL_VALUE_ISNAN (d
) && REAL_VALUES_EQUAL (dconst1
, d
))
2239 return CONST1_RTX (mode
);
2240 else if (! REAL_VALUE_ISNAN (d
) && REAL_VALUES_EQUAL (dconst2
, d
))
2241 return CONST2_RTX (mode
);
2243 if (sizeof u
== sizeof (HOST_WIDE_INT
))
2244 return immed_double_const (u
.i
[0], 0, mode
);
2245 if (sizeof u
== 2 * sizeof (HOST_WIDE_INT
))
2246 return immed_double_const (u
.i
[0], u
.i
[1], mode
);
2248 /* The rest of this function handles the case where
2249 a float value requires more than 2 ints of space.
2250 It will be deleted as dead code on machines that don't need it. */
2252 /* Search the chain for an existing CONST_DOUBLE with the right value.
2253 If one is found, return it. */
2255 for (r
= const_double_chain
; r
; r
= CONST_DOUBLE_CHAIN (r
))
2256 if (! memcmp ((char *) &CONST_DOUBLE_LOW (r
), (char *) &u
, sizeof u
)
2257 && GET_MODE (r
) == mode
)
2260 /* No; make a new one and add it to the chain.
2262 We may be called by an optimizer which may be discarding any memory
2263 allocated during its processing (such as combine and loop). However,
2264 we will be leaving this constant on the chain, so we cannot tolerate
2266 r
= rtx_alloc (CONST_DOUBLE
);
2268 memcpy ((char *) &CONST_DOUBLE_LOW (r
), (char *) &u
, sizeof u
);
2270 /* If we aren't inside a function, don't put r on the
2271 const_double_chain. */
2272 if (current_function_decl
!= 0)
2274 CONST_DOUBLE_CHAIN (r
) = const_double_chain
;
2275 const_double_chain
= r
;
2278 CONST_DOUBLE_CHAIN (r
) = NULL_RTX
;
2283 /* Return a CONST_DOUBLE rtx for a value specified by EXP,
2284 which must be a REAL_CST tree node. */
2287 immed_real_const (exp
)
2290 return immed_real_const_1 (TREE_REAL_CST (exp
), TYPE_MODE (TREE_TYPE (exp
)));
2293 /* At the end of a function, forget the memory-constants
2294 previously made for CONST_DOUBLEs. Mark them as not on real_constant_chain.
2295 Also clear out real_constant_chain and clear out all the chain-pointers. */
2298 clear_const_double_mem ()
2302 for (r
= const_double_chain
; r
; r
= next
)
2304 next
= CONST_DOUBLE_CHAIN (r
);
2305 CONST_DOUBLE_CHAIN (r
) = 0;
2307 const_double_chain
= 0;
2310 /* Given an expression EXP with a constant value,
2311 reduce it to the sum of an assembler symbol and an integer.
2312 Store them both in the structure *VALUE.
2313 Abort if EXP does not reduce. */
2318 HOST_WIDE_INT offset
;
2322 decode_addr_const (exp
, value
)
2324 struct addr_const
*value
;
2326 tree target
= TREE_OPERAND (exp
, 0);
2332 if (TREE_CODE (target
) == COMPONENT_REF
2333 && host_integerp (byte_position (TREE_OPERAND (target
, 1)), 0))
2336 offset
+= int_byte_position (TREE_OPERAND (target
, 1));
2337 target
= TREE_OPERAND (target
, 0);
2339 else if (TREE_CODE (target
) == ARRAY_REF
2340 || TREE_CODE (target
) == ARRAY_RANGE_REF
)
2342 offset
+= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (target
)), 1)
2343 * tree_low_cst (TREE_OPERAND (target
, 1), 0));
2344 target
= TREE_OPERAND (target
, 0);
2350 switch (TREE_CODE (target
))
2354 x
= DECL_RTL (target
);
2358 x
= gen_rtx_MEM (FUNCTION_MODE
,
2359 gen_rtx_LABEL_REF (VOIDmode
,
2360 label_rtx (TREE_OPERAND (exp
, 0))));
2368 /* This constant should have been output already, but we can't simply
2369 use TREE_CST_RTL since INTEGER_CST doesn't have one. */
2370 x
= output_constant_def (target
, 1);
2377 if (GET_CODE (x
) != MEM
)
2382 value
->offset
= offset
;
2385 /* We do RTX_UNSPEC + XINT (blah), so nothing can go after RTX_UNSPEC. */
2386 enum kind
{ RTX_UNKNOWN
, RTX_DOUBLE
, RTX_INT
, RTX_VECTOR
, RTX_UNSPEC
};
2389 ENUM_BITFIELD(kind
) kind
: 16;
2390 ENUM_BITFIELD(machine_mode
) mode
: 16;
2392 union real_extract du
;
2393 struct addr_const addr
;
2394 struct {HOST_WIDE_INT high
, low
;} di
;
2396 /* The max vector size we have is 8 wide. This should be enough. */
2397 HOST_WIDE_INT veclo
[16];
2398 HOST_WIDE_INT vechi
[16];
2402 /* Uniquize all constants that appear in memory.
2403 Each constant in memory thus far output is recorded
2404 in `const_hash_table' with a `struct constant_descriptor'
2405 that contains a polish representation of the value of
2408 We cannot store the trees in the hash table
2409 because the trees may be temporary. */
2411 struct constant_descriptor
2413 struct constant_descriptor
*next
;
2416 /* Make sure the data is reasonably aligned. */
2419 unsigned char contents
[1];
2420 #ifdef HAVE_LONG_DOUBLE
2429 #define MAX_HASH_TABLE 1009
2430 static struct constant_descriptor
*const_hash_table
[MAX_HASH_TABLE
];
2432 /* We maintain a hash table of STRING_CST values. Unless we are asked to force
2433 out a string constant, we defer output of the constants until we know
2434 they are actually used. This will be if something takes its address or if
2435 there is a usage of the string in the RTL of a function. */
2437 #define STRHASH(x) ((hashval_t) ((long) (x) >> 3))
2439 struct deferred_string
2446 static htab_t const_str_htab
;
2448 /* Mark a const_hash_table descriptor for GC. */
2451 mark_const_hash_entry (ptr
)
2454 struct constant_descriptor
*desc
= * (struct constant_descriptor
**) ptr
;
2458 ggc_mark_rtx (desc
->rtl
);
2463 /* Mark the hash-table element X (which is really a pointer to an
2464 struct deferred_string *). */
2467 mark_const_str_htab_1 (x
, data
)
2469 void *data ATTRIBUTE_UNUSED
;
2471 ggc_mark_tree (((struct deferred_string
*) *x
)->exp
);
2475 /* Mark a const_str_htab for GC. */
2478 mark_const_str_htab (htab
)
2481 htab_traverse (*((htab_t
*) htab
), mark_const_str_htab_1
, NULL
);
2484 /* Returns a hash code for X (which is a really a
2485 struct deferred_string *). */
2488 const_str_htab_hash (x
)
2491 return STRHASH (((const struct deferred_string
*) x
)->label
);
2494 /* Returns non-zero if the value represented by X (which is really a
2495 struct deferred_string *) is the same as that given by Y
2496 (which is really a char *). */
2499 const_str_htab_eq (x
, y
)
2503 return (((const struct deferred_string
*) x
)->label
== (const char *) y
);
2506 /* Delete the hash table entry dfsp. */
2509 const_str_htab_del (dfsp
)
2515 /* Compute a hash code for a constant expression. */
2523 enum tree_code code
= TREE_CODE (exp
);
2525 /* Either set P and LEN to the address and len of something to hash and
2526 exit the switch or return a value. */
2531 p
= (char *) &TREE_INT_CST (exp
);
2532 len
= sizeof TREE_INT_CST (exp
);
2536 p
= (char *) &TREE_REAL_CST (exp
);
2537 len
= sizeof TREE_REAL_CST (exp
);
2541 p
= TREE_STRING_POINTER (exp
);
2542 len
= TREE_STRING_LENGTH (exp
);
2546 return (const_hash (TREE_REALPART (exp
)) * 5
2547 + const_hash (TREE_IMAGPART (exp
)));
2550 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2554 len
= int_size_in_bytes (TREE_TYPE (exp
));
2555 tmp
= (char *) alloca (len
);
2556 get_set_constructor_bytes (exp
, (unsigned char *) tmp
, len
);
2564 /* For record type, include the type in the hashing.
2565 We do not do so for array types
2566 because (1) the sizes of the elements are sufficient
2567 and (2) distinct array types can have the same constructor.
2568 Instead, we include the array size because the constructor could
2570 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2571 hi
= ((unsigned long) TREE_TYPE (exp
) & ((1 << HASHBITS
) - 1))
2574 hi
= ((5 + int_size_in_bytes (TREE_TYPE (exp
)))
2575 & ((1 << HASHBITS
) - 1)) % MAX_HASH_TABLE
;
2577 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2578 if (TREE_VALUE (link
))
2580 = (hi
* 603 + const_hash (TREE_VALUE (link
))) % MAX_HASH_TABLE
;
2587 struct addr_const value
;
2589 decode_addr_const (exp
, &value
);
2590 if (GET_CODE (value
.base
) == SYMBOL_REF
)
2592 /* Don't hash the address of the SYMBOL_REF;
2593 only use the offset and the symbol name. */
2595 p
= XSTR (value
.base
, 0);
2596 for (i
= 0; p
[i
] != 0; i
++)
2597 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2599 else if (GET_CODE (value
.base
) == LABEL_REF
)
2600 hi
= value
.offset
+ CODE_LABEL_NUMBER (XEXP (value
.base
, 0)) * 13;
2604 hi
&= (1 << HASHBITS
) - 1;
2605 hi
%= MAX_HASH_TABLE
;
2611 return (const_hash (TREE_OPERAND (exp
, 0)) * 9
2612 + const_hash (TREE_OPERAND (exp
, 1)));
2616 case NON_LVALUE_EXPR
:
2617 return const_hash (TREE_OPERAND (exp
, 0)) * 7 + 2;
2620 /* A language specific constant. Just hash the code. */
2621 return (int) code
% MAX_HASH_TABLE
;
2624 /* Compute hashing function */
2626 for (i
= 0; i
< len
; i
++)
2627 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2629 hi
&= (1 << HASHBITS
) - 1;
2630 hi
%= MAX_HASH_TABLE
;
2634 /* Compare a constant expression EXP with a constant-descriptor DESC.
2635 Return 1 if DESC describes a constant with the same value as EXP. */
2638 compare_constant (exp
, desc
)
2640 struct constant_descriptor
*desc
;
2642 return 0 != compare_constant_1 (exp
, desc
->u
.contents
);
2645 /* Compare constant expression EXP with a substring P of a constant descriptor.
2646 If they match, return a pointer to the end of the substring matched.
2647 If they do not match, return 0.
2649 Since descriptors are written in polish prefix notation,
2650 this function can be used recursively to test one operand of EXP
2651 against a subdescriptor, and if it succeeds it returns the
2652 address of the subdescriptor for the next operand. */
2654 static const unsigned char *
2655 compare_constant_1 (exp
, p
)
2657 const unsigned char *p
;
2659 const unsigned char *strp
;
2661 enum tree_code code
= TREE_CODE (exp
);
2663 if (code
!= (enum tree_code
) *p
++)
2666 /* Either set STRP, P and LEN to pointers and length to compare and exit the
2667 switch, or return the result of the comparison. */
2672 /* Integer constants are the same only if the same width of type. */
2673 if (*p
++ != TYPE_PRECISION (TREE_TYPE (exp
)))
2676 strp
= (unsigned char *) &TREE_INT_CST (exp
);
2677 len
= sizeof TREE_INT_CST (exp
);
2681 /* Real constants are the same only if the same width of type. */
2682 if (*p
++ != TYPE_PRECISION (TREE_TYPE (exp
)))
2685 strp
= (unsigned char *) &TREE_REAL_CST (exp
);
2686 len
= sizeof TREE_REAL_CST (exp
);
2690 if (flag_writable_strings
)
2693 if ((enum machine_mode
) *p
++ != TYPE_MODE (TREE_TYPE (exp
)))
2696 strp
= (const unsigned char *) TREE_STRING_POINTER (exp
);
2697 len
= TREE_STRING_LENGTH (exp
);
2698 if (memcmp ((char *) &TREE_STRING_LENGTH (exp
), p
,
2699 sizeof TREE_STRING_LENGTH (exp
)))
2702 p
+= sizeof TREE_STRING_LENGTH (exp
);
2706 p
= compare_constant_1 (TREE_REALPART (exp
), p
);
2710 return compare_constant_1 (TREE_IMAGPART (exp
), p
);
2713 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2715 int xlen
= len
= int_size_in_bytes (TREE_TYPE (exp
));
2716 unsigned char *tmp
= (unsigned char *) alloca (len
);
2718 get_set_constructor_bytes (exp
, tmp
, len
);
2719 strp
= (unsigned char *) tmp
;
2720 if (memcmp ((char *) &xlen
, p
, sizeof xlen
))
2729 int length
= list_length (CONSTRUCTOR_ELTS (exp
));
2731 enum machine_mode mode
= TYPE_MODE (TREE_TYPE (exp
));
2732 int have_purpose
= 0;
2734 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2735 if (TREE_PURPOSE (link
))
2738 if (memcmp ((char *) &length
, p
, sizeof length
))
2743 /* For record constructors, insist that the types match.
2744 For arrays, just verify both constructors are for arrays.
2745 Then insist that either both or none have any TREE_PURPOSE
2747 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2748 type
= TREE_TYPE (exp
);
2752 if (memcmp ((char *) &type
, p
, sizeof type
))
2755 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2757 if (memcmp ((char *) &mode
, p
, sizeof mode
))
2765 if (memcmp ((char *) &have_purpose
, p
, sizeof have_purpose
))
2768 p
+= sizeof have_purpose
;
2770 /* For arrays, insist that the size in bytes match. */
2771 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2773 HOST_WIDE_INT size
= int_size_in_bytes (TREE_TYPE (exp
));
2775 if (memcmp ((char *) &size
, p
, sizeof size
))
2781 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2783 if (TREE_VALUE (link
))
2785 if ((p
= compare_constant_1 (TREE_VALUE (link
), p
)) == 0)
2792 if (memcmp ((char *) &zero
, p
, sizeof zero
))
2798 if (TREE_PURPOSE (link
)
2799 && TREE_CODE (TREE_PURPOSE (link
)) == FIELD_DECL
)
2801 if (memcmp ((char *) &TREE_PURPOSE (link
), p
,
2802 sizeof TREE_PURPOSE (link
)))
2805 p
+= sizeof TREE_PURPOSE (link
);
2807 else if (TREE_PURPOSE (link
))
2809 if ((p
= compare_constant_1 (TREE_PURPOSE (link
), p
)) == 0)
2812 else if (have_purpose
)
2816 if (memcmp ((char *) &zero
, p
, sizeof zero
))
2828 struct addr_const value
;
2830 decode_addr_const (exp
, &value
);
2831 strp
= (unsigned char *) &value
.offset
;
2832 len
= sizeof value
.offset
;
2833 /* Compare the offset. */
2835 if (*p
++ != *strp
++)
2838 /* Compare symbol name. */
2839 strp
= (const unsigned char *) XSTR (value
.base
, 0);
2840 len
= strlen ((const char *) strp
) + 1;
2847 p
= compare_constant_1 (TREE_OPERAND (exp
, 0), p
);
2851 return compare_constant_1 (TREE_OPERAND (exp
, 1), p
);
2855 case NON_LVALUE_EXPR
:
2856 return compare_constant_1 (TREE_OPERAND (exp
, 0), p
);
2860 tree
new = (*lang_hooks
.expand_constant
) (exp
);
2863 return compare_constant_1 (new, p
);
2869 /* Compare constant contents. */
2871 if (*p
++ != *strp
++)
2877 /* Construct a constant descriptor for the expression EXP.
2878 It is up to the caller to enter the descriptor in the hash table. */
2880 static struct constant_descriptor
*
2881 record_constant (exp
)
2884 struct constant_descriptor
*next
= 0;
2889 /* Make a struct constant_descriptor. The first three pointers will
2890 be filled in later. Here we just leave space for them. */
2892 obstack_grow (&permanent_obstack
, (char *) &next
, sizeof next
);
2893 obstack_grow (&permanent_obstack
, (char *) &label
, sizeof label
);
2894 obstack_grow (&permanent_obstack
, (char *) &rtl
, sizeof rtl
);
2896 /* Align the descriptor for the data payload. */
2897 pad
= (offsetof (struct constant_descriptor
, u
)
2898 - offsetof(struct constant_descriptor
, rtl
)
2899 - sizeof(next
->rtl
));
2901 obstack_blank (&permanent_obstack
, pad
);
2903 record_constant_1 (exp
);
2904 return (struct constant_descriptor
*) obstack_finish (&permanent_obstack
);
2907 /* Add a description of constant expression EXP
2908 to the object growing in `permanent_obstack'.
2909 No need to return its address; the caller will get that
2910 from the obstack when the object is complete. */
2913 record_constant_1 (exp
)
2916 const unsigned char *strp
;
2918 enum tree_code code
= TREE_CODE (exp
);
2920 obstack_1grow (&permanent_obstack
, (unsigned int) code
);
2925 obstack_1grow (&permanent_obstack
, TYPE_PRECISION (TREE_TYPE (exp
)));
2926 strp
= (unsigned char *) &TREE_INT_CST (exp
);
2927 len
= sizeof TREE_INT_CST (exp
);
2931 obstack_1grow (&permanent_obstack
, TYPE_PRECISION (TREE_TYPE (exp
)));
2932 strp
= (unsigned char *) &TREE_REAL_CST (exp
);
2933 len
= sizeof TREE_REAL_CST (exp
);
2937 if (flag_writable_strings
)
2940 obstack_1grow (&permanent_obstack
, TYPE_MODE (TREE_TYPE (exp
)));
2941 strp
= (const unsigned char *) TREE_STRING_POINTER (exp
);
2942 len
= TREE_STRING_LENGTH (exp
);
2943 obstack_grow (&permanent_obstack
, (char *) &TREE_STRING_LENGTH (exp
),
2944 sizeof TREE_STRING_LENGTH (exp
));
2948 record_constant_1 (TREE_REALPART (exp
));
2949 record_constant_1 (TREE_IMAGPART (exp
));
2953 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2955 int nbytes
= int_size_in_bytes (TREE_TYPE (exp
));
2956 obstack_grow (&permanent_obstack
, &nbytes
, sizeof (nbytes
));
2957 obstack_blank (&permanent_obstack
, nbytes
);
2958 get_set_constructor_bytes
2959 (exp
, (unsigned char *) permanent_obstack
.next_free
-nbytes
,
2966 int length
= list_length (CONSTRUCTOR_ELTS (exp
));
2967 enum machine_mode mode
= TYPE_MODE (TREE_TYPE (exp
));
2969 int have_purpose
= 0;
2971 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2972 if (TREE_PURPOSE (link
))
2975 obstack_grow (&permanent_obstack
, (char *) &length
, sizeof length
);
2977 /* For record constructors, insist that the types match.
2978 For arrays, just verify both constructors are for arrays
2979 of the same mode. Then insist that either both or none
2980 have any TREE_PURPOSE values. */
2981 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2982 type
= TREE_TYPE (exp
);
2986 obstack_grow (&permanent_obstack
, (char *) &type
, sizeof type
);
2987 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2988 obstack_grow (&permanent_obstack
, &mode
, sizeof mode
);
2990 obstack_grow (&permanent_obstack
, (char *) &have_purpose
,
2991 sizeof have_purpose
);
2993 /* For arrays, insist that the size in bytes match. */
2994 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2996 HOST_WIDE_INT size
= int_size_in_bytes (TREE_TYPE (exp
));
2997 obstack_grow (&permanent_obstack
, (char *) &size
, sizeof size
);
3000 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
3002 if (TREE_VALUE (link
))
3003 record_constant_1 (TREE_VALUE (link
));
3008 obstack_grow (&permanent_obstack
,
3009 (char *) &zero
, sizeof zero
);
3012 if (TREE_PURPOSE (link
)
3013 && TREE_CODE (TREE_PURPOSE (link
)) == FIELD_DECL
)
3014 obstack_grow (&permanent_obstack
,
3015 (char *) &TREE_PURPOSE (link
),
3016 sizeof TREE_PURPOSE (link
));
3017 else if (TREE_PURPOSE (link
))
3018 record_constant_1 (TREE_PURPOSE (link
));
3019 else if (have_purpose
)
3023 obstack_grow (&permanent_obstack
,
3024 (char *) &zero
, sizeof zero
);
3032 struct addr_const value
;
3034 decode_addr_const (exp
, &value
);
3035 /* Record the offset. */
3036 obstack_grow (&permanent_obstack
,
3037 (char *) &value
.offset
, sizeof value
.offset
);
3039 switch (GET_CODE (value
.base
))
3042 /* Record the symbol name. */
3043 obstack_grow (&permanent_obstack
, XSTR (value
.base
, 0),
3044 strlen (XSTR (value
.base
, 0)) + 1);
3047 /* Record the address of the CODE_LABEL. It may not have
3048 been emitted yet, so it's UID may be zero. But pointer
3049 identity is good enough. */
3050 obstack_grow (&permanent_obstack
, &XEXP (value
.base
, 0),
3062 record_constant_1 (TREE_OPERAND (exp
, 0));
3063 record_constant_1 (TREE_OPERAND (exp
, 1));
3068 case NON_LVALUE_EXPR
:
3069 record_constant_1 (TREE_OPERAND (exp
, 0));
3074 tree
new = (*lang_hooks
.expand_constant
) (exp
);
3077 record_constant_1 (new);
3082 /* Record constant contents. */
3083 obstack_grow (&permanent_obstack
, strp
, len
);
3086 /* Record a list of constant expressions that were passed to
3087 output_constant_def but that could not be output right away. */
3089 struct deferred_constant
3091 struct deferred_constant
*next
;
3097 static struct deferred_constant
*deferred_constants
;
3099 /* Another list of constants which should be output after the
3101 static struct deferred_constant
*after_function_constants
;
3103 /* Nonzero means defer output of addressed subconstants
3104 (i.e., those for which output_constant_def is called.) */
3105 static int defer_addressed_constants_flag
;
3107 /* Start deferring output of subconstants. */
3110 defer_addressed_constants ()
3112 defer_addressed_constants_flag
++;
3115 /* Stop deferring output of subconstants,
3116 and output now all those that have been deferred. */
3119 output_deferred_addressed_constants ()
3121 struct deferred_constant
*p
, *next
;
3123 defer_addressed_constants_flag
--;
3125 if (defer_addressed_constants_flag
> 0)
3128 for (p
= deferred_constants
; p
; p
= next
)
3130 output_constant_def_contents (p
->exp
, p
->reloc
, p
->labelno
);
3135 deferred_constants
= 0;
3138 /* Output any constants which should appear after a function. */
3141 output_after_function_constants ()
3143 struct deferred_constant
*p
, *next
;
3145 for (p
= after_function_constants
; p
; p
= next
)
3147 output_constant_def_contents (p
->exp
, p
->reloc
, p
->labelno
);
3152 after_function_constants
= 0;
3155 /* Make a copy of the whole tree structure for a constant.
3156 This handles the same types of nodes that compare_constant
3157 and record_constant handle. */
3163 switch (TREE_CODE (exp
))
3166 /* For ADDR_EXPR, we do not want to copy the decl whose address
3167 is requested. We do want to copy constants though. */
3168 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, 0))) == 'c')
3169 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
3170 copy_constant (TREE_OPERAND (exp
, 0)));
3172 return copy_node (exp
);
3177 return copy_node (exp
);
3180 return build_complex (TREE_TYPE (exp
),
3181 copy_constant (TREE_REALPART (exp
)),
3182 copy_constant (TREE_IMAGPART (exp
)));
3186 return build (TREE_CODE (exp
), TREE_TYPE (exp
),
3187 copy_constant (TREE_OPERAND (exp
, 0)),
3188 copy_constant (TREE_OPERAND (exp
, 1)));
3192 case NON_LVALUE_EXPR
:
3193 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
3194 copy_constant (TREE_OPERAND (exp
, 0)));
3198 tree copy
= copy_node (exp
);
3199 tree list
= copy_list (CONSTRUCTOR_ELTS (exp
));
3202 CONSTRUCTOR_ELTS (copy
) = list
;
3203 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
3204 TREE_VALUE (tail
) = copy_constant (TREE_VALUE (tail
));
3205 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
3206 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
3207 TREE_PURPOSE (tail
) = copy_constant (TREE_PURPOSE (tail
));
3217 /* Return an rtx representing a reference to constant data in memory
3218 for the constant expression EXP.
3220 If assembler code for such a constant has already been output,
3221 return an rtx to refer to it.
3222 Otherwise, output such a constant in memory (or defer it for later)
3223 and generate an rtx for it.
3225 If DEFER is non-zero, the output of string constants can be deferred
3226 and output only if referenced in the function after all optimizations.
3228 The TREE_CST_RTL of EXP is set up to point to that rtx.
3229 The const_hash_table records which constants already have label strings. */
3232 output_constant_def (exp
, defer
)
3237 struct constant_descriptor
*desc
;
3238 struct deferred_string
**defstr
;
3242 int after_function
= 0;
3246 /* We can't just use the saved RTL if this is a defererred string constant
3247 and we are not to defer anymode. */
3248 if (TREE_CODE (exp
) != INTEGER_CST
&& TREE_CST_RTL (exp
)
3249 && (defer
|| !STRING_POOL_ADDRESS_P (XEXP (TREE_CST_RTL (exp
), 0))))
3250 return TREE_CST_RTL (exp
);
3252 /* Make sure any other constants whose addresses appear in EXP
3253 are assigned label numbers. */
3255 reloc
= output_addressed_constants (exp
);
3257 /* Compute hash code of EXP. Search the descriptors for that hash code
3258 to see if any of them describes EXP. If yes, the descriptor records
3259 the label number already assigned. */
3261 hash
= const_hash (exp
) % MAX_HASH_TABLE
;
3263 for (desc
= const_hash_table
[hash
]; desc
; desc
= desc
->next
)
3264 if (compare_constant (exp
, desc
))
3269 /* No constant equal to EXP is known to have been output.
3270 Make a constant descriptor to enter EXP in the hash table.
3271 Assign the label number and record it in the descriptor for
3272 future calls to this function to find. */
3274 /* Create a string containing the label name, in LABEL. */
3275 labelno
= const_labelno
++;
3276 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", labelno
);
3278 desc
= record_constant (exp
);
3279 desc
->next
= const_hash_table
[hash
];
3280 desc
->label
= ggc_strdup (label
);
3281 const_hash_table
[hash
] = desc
;
3283 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
3285 = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp
)),
3286 gen_rtx_SYMBOL_REF (Pmode
, desc
->label
));
3288 set_mem_attributes (rtl
, exp
, 1);
3289 set_mem_alias_set (rtl
, 0);
3290 set_mem_alias_set (rtl
, const_alias_set
);
3297 if (TREE_CODE (exp
) != INTEGER_CST
)
3298 TREE_CST_RTL (exp
) = rtl
;
3300 /* Optionally set flags or add text to the name to record information
3301 such as that it is a function name. If the name is changed, the macro
3302 ASM_OUTPUT_LABELREF will have to know how to strip this information. */
3303 #ifdef ENCODE_SECTION_INFO
3304 /* A previously-processed constant would already have section info
3308 ENCODE_SECTION_INFO (exp
);
3310 desc
->label
= XSTR (XEXP (desc
->rtl
, 0), 0);
3314 #ifdef CONSTANT_AFTER_FUNCTION_P
3315 if (current_function_decl
!= 0
3316 && CONSTANT_AFTER_FUNCTION_P (exp
))
3321 && STRING_POOL_ADDRESS_P (XEXP (rtl
, 0))
3322 && (!defer
|| defer_addressed_constants_flag
|| after_function
))
3324 defstr
= (struct deferred_string
**)
3325 htab_find_slot_with_hash (const_str_htab
, desc
->label
,
3326 STRHASH (desc
->label
), NO_INSERT
);
3329 /* If the string is currently deferred but we need to output it now,
3330 remove it from deferred string hash table. */
3332 labelno
= (*defstr
)->labelno
;
3333 STRING_POOL_ADDRESS_P (XEXP (rtl
, 0)) = 0;
3334 htab_clear_slot (const_str_htab
, (void **) defstr
);
3338 /* If this is the first time we've seen this particular constant,
3339 output it (or defer its output for later). */
3342 if (defer_addressed_constants_flag
|| after_function
)
3344 struct deferred_constant
*p
3345 = (struct deferred_constant
*)
3346 xmalloc (sizeof (struct deferred_constant
));
3348 p
->exp
= copy_constant (exp
);
3350 p
->labelno
= labelno
;
3353 p
->next
= after_function_constants
;
3354 after_function_constants
= p
;
3358 p
->next
= deferred_constants
;
3359 deferred_constants
= p
;
3364 /* Do no output if -fsyntax-only. */
3365 if (! flag_syntax_only
)
3367 if (TREE_CODE (exp
) != STRING_CST
3369 || flag_writable_strings
3370 || (defstr
= (struct deferred_string
**)
3371 htab_find_slot_with_hash (const_str_htab
,
3373 STRHASH (desc
->label
),
3375 output_constant_def_contents (exp
, reloc
, labelno
);
3378 struct deferred_string
*p
;
3380 p
= (struct deferred_string
*)
3381 xmalloc (sizeof (struct deferred_string
));
3383 p
->exp
= copy_constant (exp
);
3384 p
->label
= desc
->label
;
3385 p
->labelno
= labelno
;
3387 STRING_POOL_ADDRESS_P (XEXP (rtl
, 0)) = 1;
3396 /* Now output assembler code to define the label for EXP,
3397 and follow it with the data of EXP. */
3400 output_constant_def_contents (exp
, reloc
, labelno
)
3407 /* Align the location counter as required by EXP's data type. */
3408 align
= TYPE_ALIGN (TREE_TYPE (exp
));
3409 #ifdef CONSTANT_ALIGNMENT
3410 align
= CONSTANT_ALIGNMENT (exp
, align
);
3413 if (IN_NAMED_SECTION (exp
))
3414 named_section (exp
, NULL
, reloc
);
3417 /* First switch to text section, except for writable strings. */
3418 #ifdef SELECT_SECTION
3419 SELECT_SECTION (exp
, reloc
, align
);
3421 if (((TREE_CODE (exp
) == STRING_CST
) && flag_writable_strings
)
3422 || (flag_pic
&& reloc
))
3425 readonly_data_section ();
3429 if (align
> BITS_PER_UNIT
)
3431 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
3434 /* Output the label itself. */
3435 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LC", labelno
);
3437 /* Output the value of EXP. */
3438 output_constant (exp
,
3439 (TREE_CODE (exp
) == STRING_CST
3440 ? MAX (TREE_STRING_LENGTH (exp
),
3441 int_size_in_bytes (TREE_TYPE (exp
)))
3442 : int_size_in_bytes (TREE_TYPE (exp
))),
3447 /* Structure to represent sufficient information about a constant so that
3448 it can be output when the constant pool is output, so that function
3449 integration can be done, and to simplify handling on machines that reference
3450 constant pool as base+displacement. */
3452 struct pool_constant
3454 struct constant_descriptor
*desc
;
3455 struct pool_constant
*next
, *next_sym
;
3457 enum machine_mode mode
;
3460 HOST_WIDE_INT offset
;
3464 /* Hash code for a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true.
3465 The argument is XSTR (... , 0) */
3467 #define SYMHASH(LABEL) \
3468 ((((unsigned long) (LABEL)) & ((1 << HASHBITS) - 1)) % MAX_RTX_HASH_TABLE)
3470 /* Initialize constant pool hashing for a new function. */
3473 init_varasm_status (f
)
3476 struct varasm_status
*p
;
3477 p
= (struct varasm_status
*) xmalloc (sizeof (struct varasm_status
));
3479 p
->x_const_rtx_hash_table
3480 = ((struct constant_descriptor
**)
3481 xcalloc (MAX_RTX_HASH_TABLE
, sizeof (struct constant_descriptor
*)));
3482 p
->x_const_rtx_sym_hash_table
3483 = ((struct pool_constant
**)
3484 xcalloc (MAX_RTX_HASH_TABLE
, sizeof (struct pool_constant
*)));
3486 p
->x_first_pool
= p
->x_last_pool
= 0;
3487 p
->x_pool_offset
= 0;
3488 p
->x_const_double_chain
= 0;
3491 /* Mark PC for GC. */
3494 mark_pool_constant (pc
)
3495 struct pool_constant
*pc
;
3500 ggc_mark_rtx (pc
->constant
);
3501 ggc_mark_rtx (pc
->desc
->rtl
);
3506 /* Mark P for GC. */
3509 mark_varasm_status (p
)
3510 struct varasm_status
*p
;
3515 mark_pool_constant (p
->x_first_pool
);
3516 ggc_mark_rtx (p
->x_const_double_chain
);
3519 /* Clear out all parts of the state in F that can safely be discarded
3520 after the function has been compiled, to let garbage collection
3521 reclaim the memory. */
3524 free_varasm_status (f
)
3527 struct varasm_status
*p
;
3532 /* Clear out the hash tables. */
3533 for (i
= 0; i
< MAX_RTX_HASH_TABLE
; ++i
)
3535 struct constant_descriptor
*cd
;
3537 cd
= p
->x_const_rtx_hash_table
[i
];
3540 struct constant_descriptor
*next
= cd
->next
;
3547 free (p
->x_const_rtx_hash_table
);
3548 free (p
->x_const_rtx_sym_hash_table
);
3555 /* Express an rtx for a constant integer (perhaps symbolic)
3556 as the sum of a symbol or label plus an explicit integer.
3557 They are stored into VALUE. */
3560 decode_rtx_const (mode
, x
, value
)
3561 enum machine_mode mode
;
3563 struct rtx_const
*value
;
3565 /* Clear the whole structure, including any gaps. */
3566 memset (value
, 0, sizeof (struct rtx_const
));
3568 value
->kind
= RTX_INT
; /* Most usual kind. */
3571 switch (GET_CODE (x
))
3574 value
->kind
= RTX_DOUBLE
;
3575 if (GET_MODE (x
) != VOIDmode
)
3577 value
->mode
= GET_MODE (x
);
3578 memcpy ((char *) &value
->un
.du
,
3579 (char *) &CONST_DOUBLE_LOW (x
), sizeof value
->un
.du
);
3583 value
->un
.di
.low
= CONST_DOUBLE_LOW (x
);
3584 value
->un
.di
.high
= CONST_DOUBLE_HIGH (x
);
3593 units
= CONST_VECTOR_NUNITS (x
);
3594 value
->kind
= RTX_VECTOR
;
3597 for (i
= 0; i
< units
; ++i
)
3599 elt
= CONST_VECTOR_ELT (x
, i
);
3600 if (GET_MODE_CLASS (mode
) == MODE_VECTOR_INT
)
3602 value
->un
.veclo
[i
] = (HOST_WIDE_INT
) INTVAL (elt
);
3603 value
->un
.vechi
[i
] = 0;
3605 else if (GET_MODE_CLASS (mode
) == MODE_VECTOR_FLOAT
)
3607 value
->un
.veclo
[i
] = (HOST_WIDE_INT
) CONST_DOUBLE_LOW (elt
);
3608 value
->un
.vechi
[i
] = (HOST_WIDE_INT
) CONST_DOUBLE_HIGH (elt
);
3617 value
->un
.addr
.offset
= INTVAL (x
);
3623 value
->un
.addr
.base
= x
;
3628 if (GET_CODE (x
) == PLUS
&& GET_CODE (XEXP (x
, 1)) == CONST_INT
)
3630 value
->un
.addr
.base
= XEXP (x
, 0);
3631 value
->un
.addr
.offset
= INTVAL (XEXP (x
, 1));
3633 else if (GET_CODE (x
) == MINUS
&& GET_CODE (XEXP (x
, 1)) == CONST_INT
)
3635 value
->un
.addr
.base
= XEXP (x
, 0);
3636 value
->un
.addr
.offset
= - INTVAL (XEXP (x
, 1));
3640 value
->un
.addr
.base
= x
;
3641 value
->un
.addr
.offset
= 0;
3646 value
->kind
= RTX_UNKNOWN
;
3650 if (value
->kind
== RTX_INT
&& value
->un
.addr
.base
!= 0
3651 && GET_CODE (value
->un
.addr
.base
) == UNSPEC
)
3653 /* For a simple UNSPEC, the base is set to the
3654 operand, the kind field is set to the index of
3655 the unspec expression.
3656 Together with the code below, in case that
3657 the operand is a SYMBOL_REF or LABEL_REF,
3658 the address of the string or the code_label
3659 is taken as base. */
3660 if (XVECLEN (value
->un
.addr
.base
, 0) == 1)
3662 value
->kind
= RTX_UNSPEC
+ XINT (value
->un
.addr
.base
, 1);
3663 value
->un
.addr
.base
= XVECEXP (value
->un
.addr
.base
, 0, 0);
3667 if (value
->kind
> RTX_DOUBLE
&& value
->un
.addr
.base
!= 0)
3668 switch (GET_CODE (value
->un
.addr
.base
))
3671 /* Use the string's address, not the SYMBOL_REF's address,
3672 for the sake of addresses of library routines. */
3673 value
->un
.addr
.base
= (rtx
) XSTR (value
->un
.addr
.base
, 0);
3677 /* For a LABEL_REF, compare labels. */
3678 value
->un
.addr
.base
= XEXP (value
->un
.addr
.base
, 0);
3685 /* Given a MINUS expression, simplify it if both sides
3686 include the same symbol. */
3689 simplify_subtraction (x
)
3692 struct rtx_const val0
, val1
;
3694 decode_rtx_const (GET_MODE (x
), XEXP (x
, 0), &val0
);
3695 decode_rtx_const (GET_MODE (x
), XEXP (x
, 1), &val1
);
3697 if (val0
.kind
> RTX_DOUBLE
3698 && val0
.kind
== val1
.kind
3699 && val0
.un
.addr
.base
== val1
.un
.addr
.base
)
3700 return GEN_INT (val0
.un
.addr
.offset
- val1
.un
.addr
.offset
);
3705 /* Compute a hash code for a constant RTL expression. */
3708 const_hash_rtx (mode
, x
)
3709 enum machine_mode mode
;
3715 struct rtx_const value
;
3716 decode_rtx_const (mode
, x
, &value
);
3718 /* Compute hashing function */
3720 for (i
= 0; i
< sizeof value
/ sizeof (int); i
++)
3721 hi
+= ((int *) &value
)[i
];
3723 hi
&= (1 << HASHBITS
) - 1;
3724 hi
%= MAX_RTX_HASH_TABLE
;
3728 /* Compare a constant rtl object X with a constant-descriptor DESC.
3729 Return 1 if DESC describes a constant with the same value as X. */
3732 compare_constant_rtx (mode
, x
, desc
)
3733 enum machine_mode mode
;
3735 struct constant_descriptor
*desc
;
3737 int *p
= (int *) desc
->u
.contents
;
3740 struct rtx_const value
;
3742 decode_rtx_const (mode
, x
, &value
);
3743 strp
= (int *) &value
;
3744 len
= sizeof value
/ sizeof (int);
3746 /* Compare constant contents. */
3748 if (*p
++ != *strp
++)
3754 /* Construct a constant descriptor for the rtl-expression X.
3755 It is up to the caller to enter the descriptor in the hash table. */
3757 static struct constant_descriptor
*
3758 record_constant_rtx (mode
, x
)
3759 enum machine_mode mode
;
3762 struct constant_descriptor
*ptr
;
3764 ptr
= ((struct constant_descriptor
*)
3765 xcalloc (1, (offsetof (struct constant_descriptor
, u
)
3766 + sizeof (struct rtx_const
))));
3767 decode_rtx_const (mode
, x
, (struct rtx_const
*) ptr
->u
.contents
);
3772 /* Given a constant rtx X, return a MEM for the location in memory at which
3773 this constant has been placed. Return 0 if it not has been placed yet. */
3776 mem_for_const_double (x
)
3779 enum machine_mode mode
= GET_MODE (x
);
3780 struct constant_descriptor
*desc
;
3782 for (desc
= const_rtx_hash_table
[const_hash_rtx (mode
, x
)]; desc
;
3784 if (compare_constant_rtx (mode
, x
, desc
))
3790 /* Given a constant rtx X, make (or find) a memory constant for its value
3791 and return a MEM rtx to refer to it in memory. */
3794 force_const_mem (mode
, x
)
3795 enum machine_mode mode
;
3799 struct constant_descriptor
*desc
;
3802 struct pool_constant
*pool
;
3805 /* Compute hash code of X. Search the descriptors for that hash code
3806 to see if any of them describes X. If yes, we have an rtx to use. */
3807 hash
= const_hash_rtx (mode
, x
);
3808 for (desc
= const_rtx_hash_table
[hash
]; desc
; desc
= desc
->next
)
3809 if (compare_constant_rtx (mode
, x
, desc
))
3812 /* No constant equal to X is known to have been output.
3813 Make a constant descriptor to enter X in the hash table
3814 and make a MEM for it. */
3815 desc
= record_constant_rtx (mode
, x
);
3816 desc
->next
= const_rtx_hash_table
[hash
];
3817 const_rtx_hash_table
[hash
] = desc
;
3819 /* Align the location counter as required by EXP's data type. */
3820 align
= GET_MODE_ALIGNMENT (mode
== VOIDmode
? word_mode
: mode
);
3821 #ifdef CONSTANT_ALIGNMENT
3822 align
= CONSTANT_ALIGNMENT (make_tree (type_for_mode (mode
, 0), x
), align
);
3825 pool_offset
+= (align
/ BITS_PER_UNIT
) - 1;
3826 pool_offset
&= ~ ((align
/ BITS_PER_UNIT
) - 1);
3828 if (GET_CODE (x
) == LABEL_REF
)
3829 LABEL_PRESERVE_P (XEXP (x
, 0)) = 1;
3831 /* Allocate a pool constant descriptor, fill it in, and chain it in. */
3832 pool
= (struct pool_constant
*) ggc_alloc (sizeof (struct pool_constant
));
3836 pool
->labelno
= const_labelno
;
3837 pool
->align
= align
;
3838 pool
->offset
= pool_offset
;
3845 last_pool
->next
= pool
;
3848 pool_offset
+= GET_MODE_SIZE (mode
);
3850 /* Create a string containing the label name, in LABEL. */
3851 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
3855 /* Construct the SYMBOL_REF and the MEM. */
3857 pool
->desc
->rtl
= def
3858 = gen_rtx_MEM (mode
, gen_rtx_SYMBOL_REF (Pmode
, ggc_strdup (label
)));
3859 set_mem_alias_set (def
, const_alias_set
);
3860 set_mem_attributes (def
, type_for_mode (mode
, 0), 1);
3861 RTX_UNCHANGING_P (def
) = 1;
3863 /* Add label to symbol hash table. */
3864 hash
= SYMHASH (XSTR (XEXP (def
, 0), 0));
3865 pool
->next_sym
= const_rtx_sym_hash_table
[hash
];
3866 const_rtx_sym_hash_table
[hash
] = pool
;
3868 /* Mark the symbol_ref as belonging to this constants pool. */
3869 CONSTANT_POOL_ADDRESS_P (XEXP (def
, 0)) = 1;
3870 current_function_uses_const_pool
= 1;
3875 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
3876 the corresponding pool_constant structure. */
3878 static struct pool_constant
*
3879 find_pool_constant (f
, addr
)
3883 struct pool_constant
*pool
;
3884 const char *label
= XSTR (addr
, 0);
3886 for (pool
= f
->varasm
->x_const_rtx_sym_hash_table
[SYMHASH (label
)]; pool
;
3887 pool
= pool
->next_sym
)
3888 if (XSTR (XEXP (pool
->desc
->rtl
, 0), 0) == label
)
3894 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
3897 get_pool_constant (addr
)
3900 return (find_pool_constant (cfun
, addr
))->constant
;
3903 /* Likewise, but for the constant pool of a specific function. */
3906 get_pool_constant_for_function (f
, addr
)
3910 return (find_pool_constant (f
, addr
))->constant
;
3913 /* Similar, return the mode. */
3916 get_pool_mode (addr
)
3919 return (find_pool_constant (cfun
, addr
))->mode
;
3923 get_pool_mode_for_function (f
, addr
)
3927 return (find_pool_constant (f
, addr
))->mode
;
3930 /* Similar, return the offset in the constant pool. */
3933 get_pool_offset (addr
)
3936 return (find_pool_constant (cfun
, addr
))->offset
;
3939 /* Return the size of the constant pool. */
3947 /* Write all the constants in the constant pool. */
3950 output_constant_pool (fnname
, fndecl
)
3951 const char *fnname ATTRIBUTE_UNUSED
;
3952 tree fndecl ATTRIBUTE_UNUSED
;
3954 struct pool_constant
*pool
;
3956 union real_extract u
;
3958 /* It is possible for gcc to call force_const_mem and then to later
3959 discard the instructions which refer to the constant. In such a
3960 case we do not need to output the constant. */
3961 mark_constant_pool ();
3963 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3964 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3967 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3976 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3977 whose CODE_LABEL has been deleted. This can occur if a jump table
3978 is eliminated by optimization. If so, write a constant of zero
3979 instead. Note that this can also happen by turning the
3980 CODE_LABEL into a NOTE. */
3981 /* ??? This seems completely and utterly wrong. Certainly it's
3982 not true for NOTE_INSN_DELETED_LABEL, but I disbelieve proper
3983 functioning even with INSN_DELETED_P and friends. */
3986 switch (GET_CODE (x
))
3989 if (GET_CODE (XEXP (x
, 0)) != PLUS
3990 || GET_CODE (XEXP (XEXP (x
, 0), 0)) != LABEL_REF
)
3992 tmp
= XEXP (XEXP (x
, 0), 0);
3997 if (INSN_DELETED_P (tmp
)
3998 || (GET_CODE (tmp
) == NOTE
3999 && NOTE_LINE_NUMBER (tmp
) == NOTE_INSN_DELETED
))
4010 /* First switch to correct section. */
4011 #ifdef SELECT_RTX_SECTION
4012 SELECT_RTX_SECTION (pool
->mode
, x
, pool
->align
);
4014 readonly_data_section ();
4017 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
4018 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file
, x
, pool
->mode
,
4019 pool
->align
, pool
->labelno
, done
);
4022 assemble_align (pool
->align
);
4024 /* Output the label. */
4025 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LC", pool
->labelno
);
4027 /* Output the value of the constant itself. */
4028 switch (GET_MODE_CLASS (pool
->mode
))
4031 if (GET_CODE (x
) != CONST_DOUBLE
)
4034 memcpy ((char *) &u
, (char *) &CONST_DOUBLE_LOW (x
), sizeof u
);
4035 assemble_real (u
.d
, pool
->mode
, pool
->align
);
4039 case MODE_PARTIAL_INT
:
4040 assemble_integer (x
, GET_MODE_SIZE (pool
->mode
), pool
->align
, 1);
4043 case MODE_VECTOR_FLOAT
:
4048 if (GET_CODE (x
) != CONST_VECTOR
)
4051 units
= CONST_VECTOR_NUNITS (x
);
4053 for (i
= 0; i
< units
; i
++)
4055 elt
= CONST_VECTOR_ELT (x
, i
);
4056 memcpy ((char *) &u
,
4057 (char *) &CONST_DOUBLE_LOW (elt
),
4059 assemble_real (u
.d
, GET_MODE_INNER (pool
->mode
), pool
->align
);
4064 case MODE_VECTOR_INT
:
4069 if (GET_CODE (x
) != CONST_VECTOR
)
4072 units
= CONST_VECTOR_NUNITS (x
);
4074 for (i
= 0; i
< units
; i
++)
4076 elt
= CONST_VECTOR_ELT (x
, i
);
4077 assemble_integer (elt
, GET_MODE_UNIT_SIZE (pool
->mode
),
4087 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
4092 #ifdef ASM_OUTPUT_POOL_EPILOGUE
4093 ASM_OUTPUT_POOL_EPILOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
4096 /* Done with this pool. */
4097 first_pool
= last_pool
= 0;
4100 /* Look through the instructions for this function, and mark all the
4101 entries in the constant pool which are actually being used.
4102 Emit used deferred strings. */
4105 mark_constant_pool ()
4108 struct pool_constant
*pool
;
4110 if (first_pool
== 0 && htab_elements (const_str_htab
) == 0)
4113 for (pool
= first_pool
; pool
; pool
= pool
->next
)
4116 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
4118 mark_constants (PATTERN (insn
));
4120 for (insn
= current_function_epilogue_delay_list
;
4122 insn
= XEXP (insn
, 1))
4124 mark_constants (PATTERN (insn
));
4127 /* Look through appropriate parts of X, marking all entries in the
4128 constant pool which are actually being used. Entries that are only
4129 referenced by other constants are also marked as used. Emit
4130 deferred strings that are used. */
4137 const char *format_ptr
;
4142 if (GET_CODE (x
) == SYMBOL_REF
)
4144 mark_constant (&x
, NULL
);
4148 /* Insns may appear inside a SEQUENCE. Only check the patterns of
4149 insns, not any notes that may be attached. We don't want to mark
4150 a constant just because it happens to appear in a REG_EQUIV note. */
4153 mark_constants (PATTERN (x
));
4157 format_ptr
= GET_RTX_FORMAT (GET_CODE (x
));
4159 for (i
= 0; i
< GET_RTX_LENGTH (GET_CODE (x
)); i
++)
4161 switch (*format_ptr
++)
4164 mark_constants (XEXP (x
, i
));
4168 if (XVEC (x
, i
) != 0)
4172 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
4173 mark_constants (XVECEXP (x
, i
, j
));
4192 /* Given a SYMBOL_REF CURRENT_RTX, mark it and all constants it refers
4193 to as used. Emit referenced deferred strings. This function can
4194 be used with for_each_rtx to mark all SYMBOL_REFs in an rtx. */
4197 mark_constant (current_rtx
, data
)
4199 void *data ATTRIBUTE_UNUSED
;
4201 rtx x
= *current_rtx
;
4206 else if (GET_CODE (x
) == SYMBOL_REF
)
4208 if (CONSTANT_POOL_ADDRESS_P (x
))
4210 struct pool_constant
*pool
= find_pool_constant (cfun
, x
);
4211 if (pool
->mark
== 0) {
4213 for_each_rtx (&(pool
->constant
), &mark_constant
, NULL
);
4218 else if (STRING_POOL_ADDRESS_P (x
))
4220 struct deferred_string
**defstr
;
4222 defstr
= (struct deferred_string
**)
4223 htab_find_slot_with_hash (const_str_htab
, XSTR (x
, 0),
4224 STRHASH (XSTR (x
, 0)), NO_INSERT
);
4227 struct deferred_string
*p
= *defstr
;
4229 STRING_POOL_ADDRESS_P (x
) = 0;
4230 output_constant_def_contents (p
->exp
, 0, p
->labelno
);
4231 htab_clear_slot (const_str_htab
, (void **) defstr
);
4238 /* Find all the constants whose addresses are referenced inside of EXP,
4239 and make sure assembler code with a label has been output for each one.
4240 Indicate whether an ADDR_EXPR has been encountered. */
4243 output_addressed_constants (exp
)
4249 /* Give the front-end a chance to convert VALUE to something that
4250 looks more like a constant to the back-end. */
4251 exp
= (*lang_hooks
.expand_constant
) (exp
);
4253 switch (TREE_CODE (exp
))
4256 /* Go inside any operations that get_inner_reference can handle and see
4257 if what's inside is a constant: no need to do anything here for
4258 addresses of variables or functions. */
4259 for (tem
= TREE_OPERAND (exp
, 0); handled_component_p (tem
);
4260 tem
= TREE_OPERAND (tem
, 0))
4263 if (TREE_CODE_CLASS (TREE_CODE (tem
)) == 'c'
4264 || TREE_CODE (tem
) == CONSTRUCTOR
)
4265 output_constant_def (tem
, 0);
4267 if (TREE_PUBLIC (tem
))
4275 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
4276 reloc
|= output_addressed_constants (TREE_OPERAND (exp
, 1));
4281 case NON_LVALUE_EXPR
:
4282 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
4286 for (tem
= CONSTRUCTOR_ELTS (exp
); tem
; tem
= TREE_CHAIN (tem
))
4287 if (TREE_VALUE (tem
) != 0)
4288 reloc
|= output_addressed_constants (TREE_VALUE (tem
));
4298 /* Return nonzero if VALUE is a valid constant-valued expression
4299 for use in initializing a static variable; one that can be an
4300 element of a "constant" initializer.
4302 Return null_pointer_node if the value is absolute;
4303 if it is relocatable, return the variable that determines the relocation.
4304 We assume that VALUE has been folded as much as possible;
4305 therefore, we do not need to check for such things as
4306 arithmetic-combinations of integers. */
4309 initializer_constant_valid_p (value
, endtype
)
4313 /* Give the front-end a chance to convert VALUE to something that
4314 looks more like a constant to the back-end. */
4315 value
= (*lang_hooks
.expand_constant
) (value
);
4317 switch (TREE_CODE (value
))
4320 if ((TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
4321 || TREE_CODE (TREE_TYPE (value
)) == RECORD_TYPE
)
4322 && TREE_CONSTANT (value
)
4323 && CONSTRUCTOR_ELTS (value
))
4325 initializer_constant_valid_p (TREE_VALUE (CONSTRUCTOR_ELTS (value
)),
4328 return TREE_STATIC (value
) ? null_pointer_node
: 0;
4335 return null_pointer_node
;
4339 return staticp (TREE_OPERAND (value
, 0)) ? TREE_OPERAND (value
, 0) : 0;
4341 case VIEW_CONVERT_EXPR
:
4342 case NON_LVALUE_EXPR
:
4343 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
4347 /* Allow conversions between pointer types. */
4348 if (POINTER_TYPE_P (TREE_TYPE (value
))
4349 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
4350 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
4352 /* Allow conversions between real types. */
4353 if (FLOAT_TYPE_P (TREE_TYPE (value
))
4354 && FLOAT_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
4355 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
4357 /* Allow length-preserving conversions between integer types. */
4358 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
4359 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
4360 && (TYPE_PRECISION (TREE_TYPE (value
))
4361 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
4362 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
4364 /* Allow conversions between other integer types only if
4366 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
4367 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
4369 tree inner
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4371 if (inner
== null_pointer_node
)
4372 return null_pointer_node
;
4376 /* Allow (int) &foo provided int is as wide as a pointer. */
4377 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
4378 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
4379 && (TYPE_PRECISION (TREE_TYPE (value
))
4380 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
4381 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4384 /* Likewise conversions from int to pointers, but also allow
4385 conversions from 0. */
4386 if (POINTER_TYPE_P (TREE_TYPE (value
))
4387 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
4389 if (integer_zerop (TREE_OPERAND (value
, 0)))
4390 return null_pointer_node
;
4391 else if (TYPE_PRECISION (TREE_TYPE (value
))
4392 <= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0))))
4393 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4397 /* Allow conversions to union types if the value inside is okay. */
4398 if (TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
)
4399 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4404 if (! INTEGRAL_TYPE_P (endtype
)
4405 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
4407 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4409 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
4411 /* If either term is absolute, use the other terms relocation. */
4412 if (valid0
== null_pointer_node
)
4414 if (valid1
== null_pointer_node
)
4420 if (! INTEGRAL_TYPE_P (endtype
)
4421 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
4423 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4425 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
4427 /* Win if second argument is absolute. */
4428 if (valid1
== null_pointer_node
)
4430 /* Win if both arguments have the same relocation.
4431 Then the value is absolute. */
4432 if (valid0
== valid1
&& valid0
!= 0)
4433 return null_pointer_node
;
4435 /* Since GCC guarantees that string constants are unique in the
4436 generated code, a subtraction between two copies of the same
4437 constant string is absolute. */
4438 if (valid0
&& TREE_CODE (valid0
) == STRING_CST
&&
4439 valid1
&& TREE_CODE (valid1
) == STRING_CST
&&
4440 TREE_STRING_POINTER (valid0
) == TREE_STRING_POINTER (valid1
))
4441 return null_pointer_node
;
4444 /* Support differences between labels. */
4445 if (INTEGRAL_TYPE_P (endtype
))
4448 op0
= TREE_OPERAND (value
, 0);
4449 op1
= TREE_OPERAND (value
, 1);
4451 /* Like STRIP_NOPS except allow the operand mode to widen.
4452 This works around a feature of fold that simplfies
4453 (int)(p1 - p2) to ((int)p1 - (int)p2) under the theory
4454 that the narrower operation is cheaper. */
4456 while (TREE_CODE (op0
) == NOP_EXPR
4457 || TREE_CODE (op0
) == CONVERT_EXPR
4458 || TREE_CODE (op0
) == NON_LVALUE_EXPR
)
4460 tree inner
= TREE_OPERAND (op0
, 0);
4461 if (inner
== error_mark_node
4462 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner
)))
4463 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op0
)))
4464 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner
)))))
4469 while (TREE_CODE (op1
) == NOP_EXPR
4470 || TREE_CODE (op1
) == CONVERT_EXPR
4471 || TREE_CODE (op1
) == NON_LVALUE_EXPR
)
4473 tree inner
= TREE_OPERAND (op1
, 0);
4474 if (inner
== error_mark_node
4475 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner
)))
4476 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op1
)))
4477 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner
)))))
4482 if (TREE_CODE (op0
) == ADDR_EXPR
4483 && TREE_CODE (TREE_OPERAND (op0
, 0)) == LABEL_DECL
4484 && TREE_CODE (op1
) == ADDR_EXPR
4485 && TREE_CODE (TREE_OPERAND (op1
, 0)) == LABEL_DECL
)
4486 return null_pointer_node
;
4497 /* Output assembler code for constant EXP to FILE, with no label.
4498 This includes the pseudo-op such as ".int" or ".byte", and a newline.
4499 Assumes output_addressed_constants has been done on EXP already.
4501 Generate exactly SIZE bytes of assembler data, padding at the end
4502 with zeros if necessary. SIZE must always be specified.
4504 SIZE is important for structure constructors,
4505 since trailing members may have been omitted from the constructor.
4506 It is also important for initialization of arrays from string constants
4507 since the full length of the string constant might not be wanted.
4508 It is also needed for initialization of unions, where the initializer's
4509 type is just one member, and that may not be as long as the union.
4511 There a case in which we would fail to output exactly SIZE bytes:
4512 for a structure constructor that wants to produce more than SIZE bytes.
4513 But such constructors will never be generated for any possible input.
4515 ALIGN is the alignment of the data in bits. */
4518 output_constant (exp
, size
, align
)
4523 enum tree_code code
;
4524 HOST_WIDE_INT thissize
;
4526 /* Some front-ends use constants other than the standard language-indepdent
4527 varieties, but which may still be output directly. Give the front-end a
4528 chance to convert EXP to a language-independent representation. */
4529 exp
= (*lang_hooks
.expand_constant
) (exp
);
4531 if (size
== 0 || flag_syntax_only
)
4534 /* Eliminate any conversions since we'll be outputting the underlying
4536 while (TREE_CODE (exp
) == NOP_EXPR
|| TREE_CODE (exp
) == CONVERT_EXPR
4537 || TREE_CODE (exp
) == NON_LVALUE_EXPR
4538 || TREE_CODE (exp
) == VIEW_CONVERT_EXPR
)
4539 exp
= TREE_OPERAND (exp
, 0);
4541 code
= TREE_CODE (TREE_TYPE (exp
));
4542 thissize
= int_size_in_bytes (TREE_TYPE (exp
));
4544 /* Allow a constructor with no elements for any data type.
4545 This means to fill the space with zeros. */
4546 if (TREE_CODE (exp
) == CONSTRUCTOR
&& CONSTRUCTOR_ELTS (exp
) == 0)
4548 assemble_zeros (size
);
4552 if (TREE_CODE (exp
) == FDESC_EXPR
)
4554 #ifdef ASM_OUTPUT_FDESC
4555 HOST_WIDE_INT part
= tree_low_cst (TREE_OPERAND (exp
, 1), 0);
4556 tree decl
= TREE_OPERAND (exp
, 0);
4557 ASM_OUTPUT_FDESC (asm_out_file
, decl
, part
);
4564 /* Now output the underlying data. If we've handling the padding, return.
4565 Otherwise, break and ensure THISSIZE is the size written. */
4573 case REFERENCE_TYPE
:
4574 if (! assemble_integer (expand_expr (exp
, NULL_RTX
, VOIDmode
,
4575 EXPAND_INITIALIZER
),
4577 error ("initializer for integer value is too complicated");
4581 if (TREE_CODE (exp
) != REAL_CST
)
4582 error ("initializer for floating value is not a floating constant");
4584 assemble_real (TREE_REAL_CST (exp
),
4585 mode_for_size (size
* BITS_PER_UNIT
, MODE_FLOAT
, 0),
4590 output_constant (TREE_REALPART (exp
), thissize
/ 2, align
);
4591 output_constant (TREE_IMAGPART (exp
), thissize
/ 2,
4592 min_align (align
, BITS_PER_UNIT
* (thissize
/ 2)));
4597 if (TREE_CODE (exp
) == CONSTRUCTOR
)
4599 output_constructor (exp
, size
, align
);
4602 else if (TREE_CODE (exp
) == STRING_CST
)
4604 thissize
= MIN (TREE_STRING_LENGTH (exp
), size
);
4605 assemble_string (TREE_STRING_POINTER (exp
), thissize
);
4613 if (TREE_CODE (exp
) == CONSTRUCTOR
)
4614 output_constructor (exp
, size
, align
);
4620 if (TREE_CODE (exp
) == INTEGER_CST
)
4621 assemble_integer (expand_expr (exp
, NULL_RTX
,
4622 VOIDmode
, EXPAND_INITIALIZER
),
4623 thissize
, align
, 1);
4624 else if (TREE_CODE (exp
) == CONSTRUCTOR
)
4626 unsigned char *buffer
= (unsigned char *) alloca (thissize
);
4627 if (get_set_constructor_bytes (exp
, buffer
, thissize
))
4629 assemble_string ((char *) buffer
, thissize
);
4632 error ("unknown set constructor type");
4644 assemble_zeros (size
);
4648 /* Subroutine of output_constructor, used for computing the size of
4649 arrays of unspecified length. VAL must be a CONSTRUCTOR of an array
4650 type with an unspecified upper bound. */
4652 static unsigned HOST_WIDE_INT
4653 array_size_for_constructor (val
)
4658 /* This code used to attempt to handle string constants that are not
4659 arrays of single-bytes, but nothing else does, so there's no point in
4661 if (TREE_CODE (val
) == STRING_CST
)
4662 return TREE_STRING_LENGTH (val
);
4664 max_index
= NULL_TREE
;
4665 for (i
= CONSTRUCTOR_ELTS (val
); i
; i
= TREE_CHAIN (i
))
4667 tree index
= TREE_PURPOSE (i
);
4669 if (TREE_CODE (index
) == RANGE_EXPR
)
4670 index
= TREE_OPERAND (index
, 1);
4671 if (max_index
== NULL_TREE
|| tree_int_cst_lt (max_index
, index
))
4675 if (max_index
== NULL_TREE
)
4678 /* Compute the total number of array elements. */
4679 i
= size_binop (MINUS_EXPR
, convert (sizetype
, max_index
),
4681 TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (val
)))));
4682 i
= size_binop (PLUS_EXPR
, i
, convert (sizetype
, integer_one_node
));
4684 /* Multiply by the array element unit size to find number of bytes. */
4685 i
= size_binop (MULT_EXPR
, i
, TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (val
))));
4687 return tree_low_cst (i
, 1);
4690 /* Subroutine of output_constant, used for CONSTRUCTORs (aggregate constants).
4691 Generate at least SIZE bytes, padding if necessary. */
4694 output_constructor (exp
, size
, align
)
4699 tree type
= TREE_TYPE (exp
);
4700 tree link
, field
= 0;
4702 /* Number of bytes output or skipped so far.
4703 In other words, current position within the constructor. */
4704 HOST_WIDE_INT total_bytes
= 0;
4705 /* Non-zero means BYTE contains part of a byte, to be output. */
4706 int byte_buffer_in_use
= 0;
4709 if (HOST_BITS_PER_WIDE_INT
< BITS_PER_UNIT
)
4712 if (TREE_CODE (type
) == RECORD_TYPE
)
4713 field
= TYPE_FIELDS (type
);
4715 if (TREE_CODE (type
) == ARRAY_TYPE
4716 && TYPE_DOMAIN (type
) != 0)
4717 min_index
= TYPE_MIN_VALUE (TYPE_DOMAIN (type
));
4719 /* As LINK goes through the elements of the constant,
4720 FIELD goes through the structure fields, if the constant is a structure.
4721 if the constant is a union, then we override this,
4722 by getting the field from the TREE_LIST element.
4723 But the constant could also be an array. Then FIELD is zero.
4725 There is always a maximum of one element in the chain LINK for unions
4726 (even if the initializer in a source program incorrectly contains
4728 for (link
= CONSTRUCTOR_ELTS (exp
);
4730 link
= TREE_CHAIN (link
),
4731 field
= field
? TREE_CHAIN (field
) : 0)
4733 tree val
= TREE_VALUE (link
);
4736 /* The element in a union constructor specifies the proper field
4738 if ((TREE_CODE (type
) == RECORD_TYPE
|| TREE_CODE (type
) == UNION_TYPE
4739 || TREE_CODE (type
) == QUAL_UNION_TYPE
)
4740 && TREE_PURPOSE (link
) != 0)
4741 field
= TREE_PURPOSE (link
);
4743 else if (TREE_CODE (type
) == ARRAY_TYPE
)
4744 index
= TREE_PURPOSE (link
);
4746 /* Eliminate the marker that makes a cast not be an lvalue. */
4750 if (index
&& TREE_CODE (index
) == RANGE_EXPR
)
4752 unsigned HOST_WIDE_INT fieldsize
4753 = int_size_in_bytes (TREE_TYPE (type
));
4754 HOST_WIDE_INT lo_index
= tree_low_cst (TREE_OPERAND (index
, 0), 0);
4755 HOST_WIDE_INT hi_index
= tree_low_cst (TREE_OPERAND (index
, 1), 0);
4756 HOST_WIDE_INT index
;
4757 unsigned int align2
= min_align (align
, fieldsize
* BITS_PER_UNIT
);
4759 for (index
= lo_index
; index
<= hi_index
; index
++)
4761 /* Output the element's initial value. */
4763 assemble_zeros (fieldsize
);
4765 output_constant (val
, fieldsize
, align2
);
4767 /* Count its size. */
4768 total_bytes
+= fieldsize
;
4771 else if (field
== 0 || !DECL_BIT_FIELD (field
))
4773 /* An element that is not a bit-field. */
4775 unsigned HOST_WIDE_INT fieldsize
;
4776 /* Since this structure is static,
4777 we know the positions are constant. */
4778 HOST_WIDE_INT pos
= field
? int_byte_position (field
) : 0;
4779 unsigned int align2
;
4782 pos
= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (val
)), 1)
4783 * (tree_low_cst (index
, 0) - tree_low_cst (min_index
, 0)));
4785 /* Output any buffered-up bit-fields preceding this element. */
4786 if (byte_buffer_in_use
)
4788 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4790 byte_buffer_in_use
= 0;
4793 /* Advance to offset of this element.
4794 Note no alignment needed in an array, since that is guaranteed
4795 if each element has the proper size. */
4796 if ((field
!= 0 || index
!= 0) && pos
!= total_bytes
)
4798 assemble_zeros (pos
- total_bytes
);
4802 /* Find the alignment of this element. */
4803 align2
= min_align (align
, BITS_PER_UNIT
* pos
);
4805 /* Determine size this element should occupy. */
4810 /* If this is an array with an unspecified upper bound,
4811 the initializer determines the size. */
4812 /* ??? This ought to only checked if DECL_SIZE_UNIT is NULL,
4813 but we cannot do this until the deprecated support for
4814 initializing zero-length array members is removed. */
4815 if (TREE_CODE (TREE_TYPE (field
)) == ARRAY_TYPE
4816 && TYPE_DOMAIN (TREE_TYPE (field
))
4817 && ! TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (field
))))
4819 fieldsize
= array_size_for_constructor (val
);
4820 /* Given a non-empty initialization, this field had
4822 if (fieldsize
!= 0 && TREE_CHAIN (field
) != NULL_TREE
)
4825 else if (DECL_SIZE_UNIT (field
))
4827 /* ??? This can't be right. If the decl size overflows
4828 a host integer we will silently emit no data. */
4829 if (host_integerp (DECL_SIZE_UNIT (field
), 1))
4830 fieldsize
= tree_low_cst (DECL_SIZE_UNIT (field
), 1);
4834 fieldsize
= int_size_in_bytes (TREE_TYPE (type
));
4836 /* Output the element's initial value. */
4838 assemble_zeros (fieldsize
);
4840 output_constant (val
, fieldsize
, align2
);
4842 /* Count its size. */
4843 total_bytes
+= fieldsize
;
4845 else if (val
!= 0 && TREE_CODE (val
) != INTEGER_CST
)
4846 error ("invalid initial value for member `%s'",
4847 IDENTIFIER_POINTER (DECL_NAME (field
)));
4850 /* Element that is a bit-field. */
4852 HOST_WIDE_INT next_offset
= int_bit_position (field
);
4853 HOST_WIDE_INT end_offset
4854 = (next_offset
+ tree_low_cst (DECL_SIZE (field
), 1));
4857 val
= integer_zero_node
;
4859 /* If this field does not start in this (or, next) byte,
4861 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4863 /* Output remnant of any bit field in previous bytes. */
4864 if (byte_buffer_in_use
)
4866 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4868 byte_buffer_in_use
= 0;
4871 /* If still not at proper byte, advance to there. */
4872 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4874 assemble_zeros (next_offset
/ BITS_PER_UNIT
- total_bytes
);
4875 total_bytes
= next_offset
/ BITS_PER_UNIT
;
4879 if (! byte_buffer_in_use
)
4882 /* We must split the element into pieces that fall within
4883 separate bytes, and combine each byte with previous or
4884 following bit-fields. */
4886 /* next_offset is the offset n fbits from the beginning of
4887 the structure to the next bit of this element to be processed.
4888 end_offset is the offset of the first bit past the end of
4890 while (next_offset
< end_offset
)
4894 HOST_WIDE_INT value
;
4895 HOST_WIDE_INT next_byte
= next_offset
/ BITS_PER_UNIT
;
4896 HOST_WIDE_INT next_bit
= next_offset
% BITS_PER_UNIT
;
4898 /* Advance from byte to byte
4899 within this element when necessary. */
4900 while (next_byte
!= total_bytes
)
4902 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4907 /* Number of bits we can process at once
4908 (all part of the same byte). */
4909 this_time
= MIN (end_offset
- next_offset
,
4910 BITS_PER_UNIT
- next_bit
);
4911 if (BYTES_BIG_ENDIAN
)
4913 /* On big-endian machine, take the most significant bits
4914 first (of the bits that are significant)
4915 and put them into bytes from the most significant end. */
4916 shift
= end_offset
- next_offset
- this_time
;
4918 /* Don't try to take a bunch of bits that cross
4919 the word boundary in the INTEGER_CST. We can
4920 only select bits from the LOW or HIGH part
4922 if (shift
< HOST_BITS_PER_WIDE_INT
4923 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4925 this_time
= shift
+ this_time
- HOST_BITS_PER_WIDE_INT
;
4926 shift
= HOST_BITS_PER_WIDE_INT
;
4929 /* Now get the bits from the appropriate constant word. */
4930 if (shift
< HOST_BITS_PER_WIDE_INT
)
4931 value
= TREE_INT_CST_LOW (val
);
4932 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4934 value
= TREE_INT_CST_HIGH (val
);
4935 shift
-= HOST_BITS_PER_WIDE_INT
;
4940 /* Get the result. This works only when:
4941 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4942 byte
|= (((value
>> shift
)
4943 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4944 << (BITS_PER_UNIT
- this_time
- next_bit
));
4948 /* On little-endian machines,
4949 take first the least significant bits of the value
4950 and pack them starting at the least significant
4951 bits of the bytes. */
4952 shift
= next_offset
- int_bit_position (field
);
4954 /* Don't try to take a bunch of bits that cross
4955 the word boundary in the INTEGER_CST. We can
4956 only select bits from the LOW or HIGH part
4958 if (shift
< HOST_BITS_PER_WIDE_INT
4959 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4960 this_time
= (HOST_BITS_PER_WIDE_INT
- shift
);
4962 /* Now get the bits from the appropriate constant word. */
4963 if (shift
< HOST_BITS_PER_WIDE_INT
)
4964 value
= TREE_INT_CST_LOW (val
);
4965 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4967 value
= TREE_INT_CST_HIGH (val
);
4968 shift
-= HOST_BITS_PER_WIDE_INT
;
4973 /* Get the result. This works only when:
4974 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4975 byte
|= (((value
>> shift
)
4976 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4980 next_offset
+= this_time
;
4981 byte_buffer_in_use
= 1;
4986 if (byte_buffer_in_use
)
4988 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4992 if (total_bytes
< size
)
4993 assemble_zeros (size
- total_bytes
);
4997 /* This structure contains any weak symbol declarations waiting
5001 struct weak_syms
* next
;
5006 static struct weak_syms
* weak_decls
;
5008 /* Add function NAME to the weak symbols list. VALUE is a weak alias
5009 associated with NAME. */
5012 add_weak (name
, value
)
5016 struct weak_syms
*weak
;
5018 weak
= (struct weak_syms
*) xmalloc (sizeof (struct weak_syms
));
5023 weak
->next
= weak_decls
;
5025 weak
->value
= value
;
5031 /* Declare DECL to be a weak symbol. */
5037 if (! TREE_PUBLIC (decl
))
5038 error_with_decl (decl
, "weak declaration of `%s' must be public");
5039 else if (TREE_ASM_WRITTEN (decl
))
5040 error_with_decl (decl
, "weak declaration of `%s' must precede definition");
5041 else if (SUPPORTS_WEAK
)
5042 add_weak (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)), NULL
);
5044 warning_with_decl (decl
, "weak declaration of `%s' not supported");
5046 DECL_WEAK (decl
) = 1;
5049 /* Emit any pending weak declarations. */
5056 struct weak_syms
*t
;
5057 for (t
= weak_decls
; t
; t
= t
->next
)
5059 #ifdef ASM_OUTPUT_WEAK_ALIAS
5060 ASM_OUTPUT_WEAK_ALIAS (asm_out_file
, t
->name
, t
->value
);
5062 #ifdef ASM_WEAKEN_LABEL
5065 ASM_WEAKEN_LABEL (asm_out_file
, t
->name
);
5072 /* Remove NAME from the pending list of weak symbols. This prevents
5073 the compiler from emitting multiple .weak directives which confuses
5075 #ifdef ASM_WEAKEN_LABEL
5077 remove_from_pending_weak_list (name
)
5080 struct weak_syms
*t
;
5081 struct weak_syms
**p
;
5083 for (p
= &weak_decls
; *p
; )
5086 if (strcmp (name
, t
->name
) == 0)
5095 #endif /* ASM_WEAKEN_LABEL */
5097 /* Emit an assembler directive to make the symbol for DECL an alias to
5098 the symbol for TARGET. */
5101 assemble_alias (decl
, target
)
5102 tree decl
, target ATTRIBUTE_UNUSED
;
5106 /* We must force creation of DECL_RTL for debug info generation, even though
5107 we don't use it here. */
5108 make_decl_rtl (decl
, NULL
);
5110 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
5112 #ifdef ASM_OUTPUT_DEF
5113 /* Make name accessible from other files, if appropriate. */
5115 if (TREE_PUBLIC (decl
))
5117 #ifdef ASM_WEAKEN_LABEL
5118 if (DECL_WEAK (decl
))
5120 ASM_WEAKEN_LABEL (asm_out_file
, name
);
5121 /* Remove this function from the pending weak list so that
5122 we do not emit multiple .weak directives for it. */
5123 remove_from_pending_weak_list
5124 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
5128 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
5131 #ifdef ASM_OUTPUT_DEF_FROM_DECLS
5132 ASM_OUTPUT_DEF_FROM_DECLS (asm_out_file
, decl
, target
);
5134 ASM_OUTPUT_DEF (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
5136 TREE_ASM_WRITTEN (decl
) = 1;
5138 #ifdef ASM_OUTPUT_WEAK_ALIAS
5139 if (! DECL_WEAK (decl
))
5140 warning ("only weak aliases are supported in this configuration");
5142 ASM_OUTPUT_WEAK_ALIAS (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
5143 TREE_ASM_WRITTEN (decl
) = 1;
5145 warning ("alias definitions not supported in this configuration; ignored");
5150 /* Returns 1 if the target configuration supports defining public symbols
5151 so that one of them will be chosen at link time instead of generating a
5152 multiply-defined symbol error, whether through the use of weak symbols or
5153 a target-specific mechanism for having duplicates discarded. */
5156 supports_one_only ()
5158 if (SUPPORTS_ONE_ONLY
)
5160 return SUPPORTS_WEAK
;
5163 /* Set up DECL as a public symbol that can be defined in multiple
5164 translation units without generating a linker error. */
5167 make_decl_one_only (decl
)
5170 if (TREE_CODE (decl
) != VAR_DECL
&& TREE_CODE (decl
) != FUNCTION_DECL
)
5173 TREE_PUBLIC (decl
) = 1;
5175 if (TREE_CODE (decl
) == VAR_DECL
5176 && (DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
))
5177 DECL_COMMON (decl
) = 1;
5178 else if (SUPPORTS_ONE_ONLY
)
5180 #ifdef MAKE_DECL_ONE_ONLY
5181 MAKE_DECL_ONE_ONLY (decl
);
5183 DECL_ONE_ONLY (decl
) = 1;
5185 else if (SUPPORTS_WEAK
)
5186 DECL_WEAK (decl
) = 1;
5194 const_str_htab
= htab_create (128, const_str_htab_hash
, const_str_htab_eq
,
5195 const_str_htab_del
);
5196 in_named_htab
= htab_create (31, in_named_entry_hash
,
5197 in_named_entry_eq
, NULL
);
5199 ggc_add_root (const_hash_table
, MAX_HASH_TABLE
, sizeof const_hash_table
[0],
5200 mark_const_hash_entry
);
5201 ggc_add_root (&const_str_htab
, 1, sizeof const_str_htab
,
5202 mark_const_str_htab
);
5204 const_alias_set
= new_alias_set ();
5207 /* Select a set of attributes for section NAME based on the properties
5208 of DECL and whether or not RELOC indicates that DECL's initializer
5209 might contain runtime relocations.
5211 We make the section read-only and executable for a function decl,
5212 read-only for a const data decl, and writable for a non-const data decl. */
5215 default_section_type_flags (decl
, name
, reloc
)
5222 if (decl
&& TREE_CODE (decl
) == FUNCTION_DECL
)
5223 flags
= SECTION_CODE
;
5224 else if (decl
&& DECL_READONLY_SECTION (decl
, reloc
))
5227 flags
= SECTION_WRITE
;
5229 if (decl
&& DECL_ONE_ONLY (decl
))
5230 flags
|= SECTION_LINKONCE
;
5232 if (strcmp (name
, ".bss") == 0
5233 || strncmp (name
, ".bss.", 5) == 0
5234 || strncmp (name
, ".gnu.linkonce.b.", 16) == 0
5235 || strcmp (name
, ".sbss") == 0
5236 || strncmp (name
, ".sbss.", 6) == 0
5237 || strncmp (name
, ".gnu.linkonce.sb.", 17) == 0)
5238 flags
|= SECTION_BSS
;
5243 /* Output assembly to switch to section NAME with attribute FLAGS.
5244 Four variants for common object file formats. */
5247 default_no_named_section (name
, flags
)
5248 const char *name ATTRIBUTE_UNUSED
;
5249 unsigned int flags ATTRIBUTE_UNUSED
;
5251 /* Some object formats don't support named sections at all. The
5252 front-end should already have flagged this as an error. */
5257 default_elf_asm_named_section (name
, flags
)
5261 char flagchars
[10], *f
= flagchars
;
5264 if (! named_section_first_declaration (name
))
5266 fprintf (asm_out_file
, "\t.section\t%s\n", name
);
5270 if (!(flags
& SECTION_DEBUG
))
5272 if (flags
& SECTION_WRITE
)
5274 if (flags
& SECTION_CODE
)
5276 if (flags
& SECTION_SMALL
)
5278 if (flags
& SECTION_MERGE
)
5280 if (flags
& SECTION_STRINGS
)
5284 if (flags
& SECTION_BSS
)
5289 if (flags
& SECTION_ENTSIZE
)
5290 fprintf (asm_out_file
, "\t.section\t%s,\"%s\",@%s,%d\n",
5291 name
, flagchars
, type
, flags
& SECTION_ENTSIZE
);
5293 fprintf (asm_out_file
, "\t.section\t%s,\"%s\",@%s\n",
5294 name
, flagchars
, type
);
5298 default_coff_asm_named_section (name
, flags
)
5302 char flagchars
[8], *f
= flagchars
;
5304 if (flags
& SECTION_WRITE
)
5306 if (flags
& SECTION_CODE
)
5310 fprintf (asm_out_file
, "\t.section\t%s,\"%s\"\n", name
, flagchars
);
5314 default_pe_asm_named_section (name
, flags
)
5318 default_coff_asm_named_section (name
, flags
);
5320 if (flags
& SECTION_LINKONCE
)
5322 /* Functions may have been compiled at various levels of
5323 optimization so we can't use `same_size' here.
5324 Instead, have the linker pick one. */
5325 fprintf (asm_out_file
, "\t.linkonce %s\n",
5326 (flags
& SECTION_CODE
? "discard" : "same_size"));
5330 /* Used for vtable gc in GNU binutils. Record that the pointer at OFFSET
5331 from SYMBOL is used in all classes derived from SYMBOL. */
5334 assemble_vtable_entry (symbol
, offset
)
5336 HOST_WIDE_INT offset
;
5338 fputs ("\t.vtable_entry ", asm_out_file
);
5339 output_addr_const (asm_out_file
, symbol
);
5340 fputs (", ", asm_out_file
);
5341 fprintf (asm_out_file
, HOST_WIDE_INT_PRINT_DEC
, offset
);
5342 fputc ('\n', asm_out_file
);
5345 /* Used for vtable gc in GNU binutils. Record the class hierarchy by noting
5346 that the vtable symbol CHILD is derived from the vtable symbol PARENT. */
5349 assemble_vtable_inherit (child
, parent
)
5352 fputs ("\t.vtable_inherit ", asm_out_file
);
5353 output_addr_const (asm_out_file
, child
);
5354 fputs (", ", asm_out_file
);
5355 output_addr_const (asm_out_file
, parent
);
5356 fputc ('\n', asm_out_file
);