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 Free Software Foundation, Inc.
5 This file is part of GNU CC.
7 GNU CC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GNU CC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU CC; see the file COPYING. If not, write to
19 the Free Software Foundation, 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
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. */
39 #include "hard-reg-set.h"
51 #ifdef XCOFF_DEBUGGING_INFO
55 #ifndef TRAMPOLINE_ALIGNMENT
56 #define TRAMPOLINE_ALIGNMENT FUNCTION_BOUNDARY
60 #define ASM_STABS_OP ".stabs"
63 /* Define the prefix to use when check_memory_usage_flag is enable. */
64 #ifdef NO_DOLLAR_IN_LABEL
65 #ifdef NO_DOT_IN_LABEL
66 #define CHKR_PREFIX "chkr_prefix_"
67 #else /* !NO_DOT_IN_LABEL */
68 #define CHKR_PREFIX "chkr."
70 #else /* !NO_DOLLAR_IN_LABEL */
71 #define CHKR_PREFIX "chkr$"
73 #define CHKR_PREFIX_SIZE (sizeof (CHKR_PREFIX) - 1)
75 /* File in which assembler code is being written. */
77 extern FILE *asm_out_file
;
79 /* The (assembler) name of the first globally-visible object output. */
80 char *first_global_object_name
;
81 char *weak_global_object_name
;
83 extern struct obstack
*current_obstack
;
84 extern struct obstack
*saveable_obstack
;
85 extern struct obstack
*rtl_obstack
;
86 extern struct obstack permanent_obstack
;
87 #define obstack_chunk_alloc xmalloc
90 struct constant_descriptor
;
94 #define MAX_RTX_HASH_TABLE 61
98 /* Hash facility for making memory-constants
99 from constant rtl-expressions. It is used on RISC machines
100 where immediate integer arguments and constant addresses are restricted
101 so that such constants must be stored in memory.
103 This pool of constants is reinitialized for each function
104 so each function gets its own constants-pool that comes right before
106 struct constant_descriptor
**x_const_rtx_hash_table
;
107 struct pool_sym
**x_const_rtx_sym_hash_table
;
109 /* Pointers to first and last constant in pool. */
110 struct pool_constant
*x_first_pool
, *x_last_pool
;
112 /* Current offset in constant pool (does not include any machine-specific
116 /* Chain of all CONST_DOUBLE rtx's constructed for the current function.
117 They are chained through the CONST_DOUBLE_CHAIN.
118 A CONST_DOUBLE rtx has CONST_DOUBLE_MEM != cc0_rtx iff it is on this chain.
119 In that case, CONST_DOUBLE_MEM is either a MEM,
120 or const0_rtx if no MEM has been made for this CONST_DOUBLE yet. */
121 rtx x_const_double_chain
;
124 #define const_rtx_hash_table (cfun->varasm->x_const_rtx_hash_table)
125 #define const_rtx_sym_hash_table (cfun->varasm->x_const_rtx_sym_hash_table)
126 #define first_pool (cfun->varasm->x_first_pool)
127 #define last_pool (cfun->varasm->x_last_pool)
128 #define pool_offset (cfun->varasm->x_pool_offset)
129 #define const_double_chain (cfun->varasm->x_const_double_chain)
131 /* Number for making the label on the next
132 constant that is stored in memory. */
136 /* Number for making the label on the next
137 static variable internal to a function. */
141 /* Carry information from ASM_DECLARE_OBJECT_NAME
142 to ASM_FINISH_DECLARE_OBJECT. */
144 int size_directive_output
;
146 /* The last decl for which assemble_variable was called,
147 if it did ASM_DECLARE_OBJECT_NAME.
148 If the last call to assemble_variable didn't do that,
151 tree last_assemble_variable_decl
;
153 static const char *strip_reg_name
PARAMS ((const char *));
154 static int contains_pointers_p
PARAMS ((tree
));
155 static void decode_addr_const
PARAMS ((tree
, struct addr_const
*));
156 static int const_hash
PARAMS ((tree
));
157 static int compare_constant
PARAMS ((tree
,
158 struct constant_descriptor
*));
159 static char *compare_constant_1
PARAMS ((tree
, char *));
160 static struct constant_descriptor
*record_constant
PARAMS ((tree
));
161 static void record_constant_1
PARAMS ((tree
));
162 static tree copy_constant
PARAMS ((tree
));
163 static void output_constant_def_contents
PARAMS ((tree
, int, int));
164 static void decode_rtx_const
PARAMS ((enum machine_mode
, rtx
,
165 struct rtx_const
*));
166 static int const_hash_rtx
PARAMS ((enum machine_mode
, rtx
));
167 static int compare_constant_rtx
PARAMS ((enum machine_mode
, rtx
,
168 struct constant_descriptor
*));
169 static struct constant_descriptor
*record_constant_rtx
PARAMS ((enum machine_mode
,
171 static struct pool_constant
*find_pool_constant
PARAMS ((struct function
*, rtx
));
172 static void mark_constant_pool
PARAMS ((void));
173 static void mark_constants
PARAMS ((rtx
));
174 static int output_addressed_constants
PARAMS ((tree
));
175 static void output_after_function_constants
PARAMS ((void));
176 static void output_constructor
PARAMS ((tree
, int));
177 #ifdef ASM_WEAKEN_LABEL
178 static void remove_from_pending_weak_list
PARAMS ((char *));
180 #ifdef ASM_OUTPUT_BSS
181 static void asm_output_bss
PARAMS ((FILE *, tree
, const char *, int, int));
183 #ifdef BSS_SECTION_ASM_OP
184 #ifdef ASM_OUTPUT_ALIGNED_BSS
185 static void asm_output_aligned_bss
PARAMS ((FILE *, tree
, const char *,
188 #endif /* BSS_SECTION_ASM_OP */
189 static void mark_pool_constant
PARAMS ((struct pool_constant
*));
190 static void mark_pool_sym_hash_table
PARAMS ((struct pool_sym
**));
191 static void mark_const_hash_entry
PARAMS ((void *));
192 static void asm_emit_uninitialised
PARAMS ((tree
, const char*, int, int));
194 static enum in_section
{ no_section
, in_text
, in_data
, in_named
195 #ifdef BSS_SECTION_ASM_OP
198 #ifdef EH_FRAME_SECTION_ASM_OP
201 #ifdef EXTRA_SECTIONS
204 } in_section
= no_section
;
206 /* Return a non-zero value if DECL has a section attribute. */
207 #ifndef IN_NAMED_SECTION
208 #define IN_NAMED_SECTION(DECL) \
209 ((TREE_CODE (DECL) == FUNCTION_DECL || TREE_CODE (DECL) == VAR_DECL) \
210 && DECL_SECTION_NAME (DECL) != NULL_TREE)
213 /* Text of section name when in_section == in_named. */
214 static char *in_named_name
;
216 /* Define functions like text_section for any extra sections. */
217 #ifdef EXTRA_SECTION_FUNCTIONS
218 EXTRA_SECTION_FUNCTIONS
221 /* Tell assembler to switch to text section. */
226 if (in_section
!= in_text
)
228 fprintf (asm_out_file
, "%s\n", TEXT_SECTION_ASM_OP
);
229 in_section
= in_text
;
233 /* Tell assembler to switch to data section. */
238 if (in_section
!= in_data
)
240 if (flag_shared_data
)
242 #ifdef SHARED_SECTION_ASM_OP
243 fprintf (asm_out_file
, "%s\n", SHARED_SECTION_ASM_OP
);
245 fprintf (asm_out_file
, "%s\n", DATA_SECTION_ASM_OP
);
249 fprintf (asm_out_file
, "%s\n", DATA_SECTION_ASM_OP
);
251 in_section
= in_data
;
254 /* Tell assembler to ALWAYS switch to data section, in case
255 it's not sure where it it. */
258 force_data_section ()
260 in_section
= no_section
;
264 /* Tell assembler to switch to read-only data section. This is normally
268 readonly_data_section ()
270 #ifdef READONLY_DATA_SECTION
271 READONLY_DATA_SECTION (); /* Note this can call data_section. */
277 /* Determine if we're in the text section. */
282 return in_section
== in_text
;
285 /* Determine if we're in the data section. */
290 return in_section
== in_data
;
293 /* Tell assembler to change to section NAME for DECL.
294 If DECL is NULL, just switch to section NAME.
295 If NAME is NULL, get the name from DECL.
296 If RELOC is 1, the initializer for DECL contains relocs. */
299 named_section (decl
, name
, reloc
)
302 int reloc ATTRIBUTE_UNUSED
;
304 if (decl
!= NULL_TREE
&& !DECL_P (decl
))
307 name
= TREE_STRING_POINTER (DECL_SECTION_NAME (decl
));
309 if (in_section
!= in_named
|| strcmp (name
, in_named_name
))
311 #ifdef ASM_OUTPUT_SECTION_NAME
312 ASM_OUTPUT_SECTION_NAME (asm_out_file
, decl
, name
, reloc
);
314 /* Section attributes are not supported if this macro isn't provided -
315 some host formats don't support them at all. The front-end should
316 already have flagged this as an error. */
320 in_named_name
= ggc_alloc_string (name
, -1);
321 in_section
= in_named
;
325 #ifdef ASM_OUTPUT_SECTION_NAME
326 #ifndef UNIQUE_SECTION
327 #define UNIQUE_SECTION(DECL,RELOC) \
333 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (DECL)); \
334 /* Strip off any encoding in name. */ \
335 STRIP_NAME_ENCODING (name, name); \
337 len = strlen (name) + 1; \
338 string = alloca (len + 1); \
339 sprintf (string, ".%s", name); \
341 DECL_SECTION_NAME (DECL) = build_string (len, string); \
344 #ifndef UNIQUE_SECTION_P
345 #define UNIQUE_SECTION_P(DECL) 0
349 #ifdef BSS_SECTION_ASM_OP
351 /* Tell the assembler to switch to the bss section. */
356 if (in_section
!= in_bss
)
358 #ifdef SHARED_BSS_SECTION_ASM_OP
359 if (flag_shared_data
)
360 fprintf (asm_out_file
, "%s\n", SHARED_BSS_SECTION_ASM_OP
);
363 fprintf (asm_out_file
, "%s\n", BSS_SECTION_ASM_OP
);
369 #ifdef ASM_OUTPUT_BSS
371 /* Utility function for ASM_OUTPUT_BSS for targets to use if
372 they don't support alignments in .bss.
373 ??? It is believed that this function will work in most cases so such
374 support is localized here. */
377 asm_output_bss (file
, decl
, name
, size
, rounded
)
379 tree decl ATTRIBUTE_UNUSED
;
381 int size ATTRIBUTE_UNUSED
, rounded
;
383 ASM_GLOBALIZE_LABEL (file
, name
);
385 #ifdef ASM_DECLARE_OBJECT_NAME
386 last_assemble_variable_decl
= decl
;
387 ASM_DECLARE_OBJECT_NAME (file
, name
, decl
);
389 /* Standard thing is just output label for the object. */
390 ASM_OUTPUT_LABEL (file
, name
);
391 #endif /* ASM_DECLARE_OBJECT_NAME */
392 ASM_OUTPUT_SKIP (file
, rounded
);
397 #ifdef ASM_OUTPUT_ALIGNED_BSS
399 /* Utility function for targets to use in implementing
400 ASM_OUTPUT_ALIGNED_BSS.
401 ??? It is believed that this function will work in most cases so such
402 support is localized here. */
405 asm_output_aligned_bss (file
, decl
, name
, size
, align
)
411 ASM_GLOBALIZE_LABEL (file
, name
);
413 ASM_OUTPUT_ALIGN (file
, floor_log2 (align
/ BITS_PER_UNIT
));
414 #ifdef ASM_DECLARE_OBJECT_NAME
415 last_assemble_variable_decl
= decl
;
416 ASM_DECLARE_OBJECT_NAME (file
, name
, decl
);
418 /* Standard thing is just output label for the object. */
419 ASM_OUTPUT_LABEL (file
, name
);
420 #endif /* ASM_DECLARE_OBJECT_NAME */
421 ASM_OUTPUT_SKIP (file
, size
? size
: 1);
426 #endif /* BSS_SECTION_ASM_OP */
428 #ifdef EH_FRAME_SECTION_ASM_OP
432 if (in_section
!= in_eh_frame
)
434 fprintf (asm_out_file
, "%s\n", EH_FRAME_SECTION_ASM_OP
);
435 in_section
= in_eh_frame
;
440 /* Switch to the section for function DECL.
442 If DECL is NULL_TREE, switch to the text section.
443 ??? It's not clear that we will ever be passed NULL_TREE, but it's
444 safer to handle it. */
447 function_section (decl
)
450 if (decl
!= NULL_TREE
451 && DECL_SECTION_NAME (decl
) != NULL_TREE
)
452 named_section (decl
, (char *) 0, 0);
457 /* Switch to section for variable DECL.
459 RELOC is the `reloc' argument to SELECT_SECTION. */
462 variable_section (decl
, reloc
)
466 if (IN_NAMED_SECTION (decl
))
467 named_section (decl
, NULL
, reloc
);
470 /* C++ can have const variables that get initialized from constructors,
471 and thus can not be in a readonly section. We prevent this by
472 verifying that the initial value is constant for objects put in a
475 error_mark_node is used by the C front end to indicate that the
476 initializer has not been seen yet. In this case, we assume that
477 the initializer must be constant.
479 C++ uses error_mark_node for variables that have complicated
480 initializers, but these variables go in BSS so we won't be called
483 #ifdef SELECT_SECTION
484 SELECT_SECTION (decl
, reloc
);
486 if (DECL_READONLY_SECTION (decl
, reloc
))
487 readonly_data_section ();
494 /* Tell assembler to switch to the section for the exception handling
500 #if defined (EXCEPTION_SECTION)
501 EXCEPTION_SECTION ();
503 #ifdef ASM_OUTPUT_SECTION_NAME
504 named_section (NULL_TREE
, ".gcc_except_table", 0);
509 readonly_data_section ();
514 /* Create the rtl to represent a function, for a function definition.
515 DECL is a FUNCTION_DECL node which describes which function.
516 The rtl is stored into DECL. */
519 make_function_rtl (decl
)
522 char *name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
523 char *new_name
= name
;
525 /* Rename a nested function to avoid conflicts, unless it's a member of
526 a local class, in which case the class name is already unique. */
527 if (decl_function_context (decl
) != 0
528 && ! TYPE_P (DECL_CONTEXT (decl
))
529 && DECL_INITIAL (decl
) != 0
530 && DECL_RTL (decl
) == 0)
534 name
= IDENTIFIER_POINTER (DECL_NAME (decl
));
535 ASM_FORMAT_PRIVATE_NAME (label
, name
, var_labelno
);
536 name
= ggc_alloc_string (label
, -1);
541 /* When -fprefix-function-name is used, every function name is
542 prefixed. Even static functions are prefixed because they
543 could be declared latter. Note that a nested function name
545 if (flag_prefix_function_name
)
547 size_t name_len
= strlen (name
);
549 new_name
= ggc_alloc_string (NULL
, name_len
+ CHKR_PREFIX_SIZE
);
550 memcpy (new_name
, CHKR_PREFIX
, CHKR_PREFIX_SIZE
);
551 memcpy (new_name
+ CHKR_PREFIX_SIZE
, name
, name_len
+ 1);
556 if (DECL_RTL (decl
) == 0)
558 DECL_ASSEMBLER_NAME (decl
) = get_identifier (name
);
560 = gen_rtx_MEM (DECL_MODE (decl
),
561 gen_rtx_SYMBOL_REF (Pmode
, name
));
563 /* Optionally set flags or add text to the name to record information
564 such as that it is a function name. If the name is changed, the macro
565 ASM_OUTPUT_LABELREF will have to know how to strip this information. */
566 #ifdef ENCODE_SECTION_INFO
567 ENCODE_SECTION_INFO (decl
);
572 /* ??? Another way to do this would be to do what halfpic.c does
573 and maintain a hashed table of such critters. */
574 /* ??? Another way to do this would be to pass a flag bit to
575 ENCODE_SECTION_INFO saying whether this is a new decl or not. */
576 /* Let the target reassign the RTL if it wants.
577 This is necessary, for example, when one machine specific
578 decl attribute overrides another. */
579 #ifdef REDO_SECTION_INFO_P
580 if (REDO_SECTION_INFO_P (decl
))
581 ENCODE_SECTION_INFO (decl
);
586 /* Given NAME, a putative register name, discard any customary prefixes. */
589 strip_reg_name (name
)
592 #ifdef REGISTER_PREFIX
593 if (!strncmp (name
, REGISTER_PREFIX
, strlen (REGISTER_PREFIX
)))
594 name
+= strlen (REGISTER_PREFIX
);
596 if (name
[0] == '%' || name
[0] == '#')
601 /* Decode an `asm' spec for a declaration as a register name.
602 Return the register number, or -1 if nothing specified,
603 or -2 if the ASMSPEC is not `cc' or `memory' and is not recognized,
604 or -3 if ASMSPEC is `cc' and is not recognized,
605 or -4 if ASMSPEC is `memory' and is not recognized.
606 Accept an exact spelling or a decimal number.
607 Prefixes such as % are optional. */
610 decode_reg_name (asmspec
)
617 /* Get rid of confusing prefixes. */
618 asmspec
= strip_reg_name (asmspec
);
620 /* Allow a decimal number as a "register name". */
621 for (i
= strlen (asmspec
) - 1; i
>= 0; i
--)
622 if (! (asmspec
[i
] >= '0' && asmspec
[i
] <= '9'))
624 if (asmspec
[0] != 0 && i
< 0)
627 if (i
< FIRST_PSEUDO_REGISTER
&& i
>= 0)
633 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
635 && ! strcmp (asmspec
, strip_reg_name (reg_names
[i
])))
638 #ifdef ADDITIONAL_REGISTER_NAMES
640 static struct { const char *name
; int number
; } table
[]
641 = ADDITIONAL_REGISTER_NAMES
;
643 for (i
= 0; i
< (int)(sizeof (table
) / sizeof (table
[0])); i
++)
644 if (! strcmp (asmspec
, table
[i
].name
))
645 return table
[i
].number
;
647 #endif /* ADDITIONAL_REGISTER_NAMES */
649 if (!strcmp (asmspec
, "memory"))
652 if (!strcmp (asmspec
, "cc"))
661 /* Create the DECL_RTL for a declaration for a static or external variable
662 or static or external function.
663 ASMSPEC, if not 0, is the string which the user specified
664 as the assembler symbol name.
665 TOP_LEVEL is nonzero if this is a file-scope variable.
667 This is never called for PARM_DECL nodes. */
670 make_decl_rtl (decl
, asmspec
, top_level
)
675 register char *name
= 0;
678 reg_number
= decode_reg_name (asmspec
);
680 if (DECL_ASSEMBLER_NAME (decl
) != NULL_TREE
)
681 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
683 if (reg_number
== -2)
685 /* ASMSPEC is given, and not the name of a register. */
686 size_t len
= strlen (asmspec
);
688 name
= ggc_alloc_string (NULL
, len
+ 1);
690 memcpy (&name
[1], asmspec
, len
+ 1);
693 /* For a duplicate declaration, we can be called twice on the
694 same DECL node. Don't discard the RTL already made. */
695 if (DECL_RTL (decl
) == 0)
697 /* First detect errors in declaring global registers. */
698 if (TREE_CODE (decl
) != FUNCTION_DECL
699 && DECL_REGISTER (decl
) && reg_number
== -1)
700 error_with_decl (decl
,
701 "register name not specified for `%s'");
702 else if (TREE_CODE (decl
) != FUNCTION_DECL
703 && DECL_REGISTER (decl
) && reg_number
< 0)
704 error_with_decl (decl
,
705 "invalid register name for `%s'");
706 else if ((reg_number
>= 0 || reg_number
== -3)
707 && (TREE_CODE (decl
) == FUNCTION_DECL
708 && ! DECL_REGISTER (decl
)))
709 error_with_decl (decl
,
710 "register name given for non-register variable `%s'");
711 else if (TREE_CODE (decl
) != FUNCTION_DECL
712 && DECL_REGISTER (decl
)
713 && TYPE_MODE (TREE_TYPE (decl
)) == BLKmode
)
714 error_with_decl (decl
,
715 "data type of `%s' isn't suitable for a register");
716 else if (TREE_CODE (decl
) != FUNCTION_DECL
&& DECL_REGISTER (decl
)
717 && ! HARD_REGNO_MODE_OK (reg_number
,
718 TYPE_MODE (TREE_TYPE (decl
))))
719 error_with_decl (decl
,
720 "register number for `%s' isn't suitable for data type");
721 /* Now handle properly declared static register variables. */
722 else if (TREE_CODE (decl
) != FUNCTION_DECL
&& DECL_REGISTER (decl
))
726 if (DECL_INITIAL (decl
) != 0 && top_level
)
728 DECL_INITIAL (decl
) = 0;
729 error ("global register variable has initial value");
731 if (TREE_THIS_VOLATILE (decl
))
732 warning ("volatile register variables don't work as you might wish");
734 /* If the user specified one of the eliminables registers here,
735 e.g., FRAME_POINTER_REGNUM, we don't want to get this variable
736 confused with that register and be eliminated. Although this
737 usage is somewhat suspect, we nevertheless use the following
738 kludge to avoid setting DECL_RTL to frame_pointer_rtx. */
741 = gen_rtx_REG (DECL_MODE (decl
), FIRST_PSEUDO_REGISTER
);
742 REGNO (DECL_RTL (decl
)) = reg_number
;
743 REG_USERVAR_P (DECL_RTL (decl
)) = 1;
747 /* Make this register global, so not usable for anything
749 #ifdef ASM_DECLARE_REGISTER_GLOBAL
750 ASM_DECLARE_REGISTER_GLOBAL (asm_out_file
, decl
, reg_number
, name
);
752 nregs
= HARD_REGNO_NREGS (reg_number
, DECL_MODE (decl
));
754 globalize_reg (reg_number
+ --nregs
);
757 /* Specifying a section attribute on a variable forces it into a
758 non-.bss section, and thus it cannot be common. */
759 else if (TREE_CODE (decl
) == VAR_DECL
760 && DECL_SECTION_NAME (decl
) != NULL_TREE
761 && DECL_INITIAL (decl
) == NULL_TREE
762 && DECL_COMMON (decl
))
763 DECL_COMMON (decl
) = 0;
765 /* Now handle ordinary static variables and functions (in memory).
766 Also handle vars declared register invalidly. */
767 if (DECL_RTL (decl
) == 0)
769 /* Can't use just the variable's own name for a variable
770 whose scope is less than the whole file, unless it's a member
771 of a local class (which will already be unambiguous).
772 Concatenate a distinguishing number. */
773 if (!top_level
&& !TREE_PUBLIC (decl
)
774 && ! (DECL_CONTEXT (decl
) && TYPE_P (DECL_CONTEXT (decl
)))
779 ASM_FORMAT_PRIVATE_NAME (label
, name
, var_labelno
);
780 name
= ggc_alloc_string (label
, -1);
787 /* When -fprefix-function-name is used, the functions
788 names are prefixed. Only nested function names are not
790 if (flag_prefix_function_name
&& TREE_CODE (decl
) == FUNCTION_DECL
)
792 size_t name_len
= strlen (name
);
795 new_name
= ggc_alloc_string (NULL
, name_len
+ CHKR_PREFIX_SIZE
);
796 memcpy (new_name
, CHKR_PREFIX
, CHKR_PREFIX_SIZE
);
797 memcpy (new_name
+ CHKR_PREFIX_SIZE
, name
, name_len
+ 1);
801 DECL_ASSEMBLER_NAME (decl
)
802 = get_identifier (name
[0] == '*' ? name
+ 1 : name
);
803 DECL_RTL (decl
) = gen_rtx_MEM (DECL_MODE (decl
),
804 gen_rtx_SYMBOL_REF (Pmode
, name
));
805 MEM_ALIAS_SET (DECL_RTL (decl
)) = get_alias_set (decl
);
807 /* If this variable is to be treated as volatile, show its
808 tree node has side effects. If it has side effects, either
809 because of this test or from TREE_THIS_VOLATILE also
810 being set, show the MEM is volatile. */
811 if (flag_volatile_global
&& TREE_CODE (decl
) == VAR_DECL
812 && TREE_PUBLIC (decl
))
813 TREE_SIDE_EFFECTS (decl
) = 1;
814 else if (flag_volatile_static
&& TREE_CODE (decl
) == VAR_DECL
815 && (TREE_PUBLIC (decl
) || TREE_STATIC (decl
)))
816 TREE_SIDE_EFFECTS (decl
) = 1;
818 if (TREE_SIDE_EFFECTS (decl
))
819 MEM_VOLATILE_P (DECL_RTL (decl
)) = 1;
821 if (TREE_READONLY (decl
))
822 RTX_UNCHANGING_P (DECL_RTL (decl
)) = 1;
823 MEM_SET_IN_STRUCT_P (DECL_RTL (decl
),
824 AGGREGATE_TYPE_P (TREE_TYPE (decl
)));
826 /* Optionally set flags or add text to the name to record information
827 such as that it is a function name.
828 If the name is changed, the macro ASM_OUTPUT_LABELREF
829 will have to know how to strip this information. */
830 #ifdef ENCODE_SECTION_INFO
831 ENCODE_SECTION_INFO (decl
);
837 /* If the old RTL had the wrong mode, fix the mode. */
838 if (GET_MODE (DECL_RTL (decl
)) != DECL_MODE (decl
))
840 rtx rtl
= DECL_RTL (decl
);
841 PUT_MODE (rtl
, DECL_MODE (decl
));
844 /* ??? Another way to do this would be to do what halfpic.c does
845 and maintain a hashed table of such critters. */
846 /* ??? Another way to do this would be to pass a flag bit to
847 ENCODE_SECTION_INFO saying whether this is a new decl or not. */
848 /* Let the target reassign the RTL if it wants.
849 This is necessary, for example, when one machine specific
850 decl attribute overrides another. */
851 #ifdef REDO_SECTION_INFO_P
852 if (REDO_SECTION_INFO_P (decl
))
853 ENCODE_SECTION_INFO (decl
);
858 /* Make the rtl for variable VAR be volatile.
859 Use this only for static variables. */
862 make_var_volatile (var
)
865 if (GET_CODE (DECL_RTL (var
)) != MEM
)
868 MEM_VOLATILE_P (DECL_RTL (var
)) = 1;
871 /* Output alignment directive to align for constant expression EXP. */
874 assemble_constant_align (exp
)
879 /* Align the location counter as required by EXP's data type. */
880 align
= TYPE_ALIGN (TREE_TYPE (exp
));
881 #ifdef CONSTANT_ALIGNMENT
882 align
= CONSTANT_ALIGNMENT (exp
, align
);
885 if (align
> BITS_PER_UNIT
)
886 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
889 /* Output a string of literal assembler code
890 for an `asm' keyword used between functions. */
893 assemble_asm (string
)
898 if (TREE_CODE (string
) == ADDR_EXPR
)
899 string
= TREE_OPERAND (string
, 0);
901 fprintf (asm_out_file
, "\t%s\n", TREE_STRING_POINTER (string
));
904 #if 0 /* This should no longer be needed, because
905 flag_gnu_linker should be 0 on these systems,
906 which should prevent any output
907 if ASM_OUTPUT_CONSTRUCTOR and ASM_OUTPUT_DESTRUCTOR are absent. */
908 #if !(defined(DBX_DEBUGGING_INFO) && !defined(FASCIST_ASSEMBLER))
909 #ifndef ASM_OUTPUT_CONSTRUCTOR
910 #define ASM_OUTPUT_CONSTRUCTOR(file, name)
912 #ifndef ASM_OUTPUT_DESTRUCTOR
913 #define ASM_OUTPUT_DESTRUCTOR(file, name)
918 /* Record an element in the table of global destructors.
919 How this is done depends on what sort of assembler and linker
922 NAME should be the name of a global function to be called
923 at exit time. This name is output using assemble_name. */
926 assemble_destructor (name
)
929 #ifdef ASM_OUTPUT_DESTRUCTOR
930 ASM_OUTPUT_DESTRUCTOR (asm_out_file
, name
);
934 /* Now tell GNU LD that this is part of the static destructor set. */
935 /* This code works for any machine provided you use GNU as/ld. */
936 fprintf (asm_out_file
, "%s \"___DTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
937 assemble_name (asm_out_file
, name
);
938 fputc ('\n', asm_out_file
);
943 /* Likewise for global constructors. */
946 assemble_constructor (name
)
949 #ifdef ASM_OUTPUT_CONSTRUCTOR
950 ASM_OUTPUT_CONSTRUCTOR (asm_out_file
, name
);
954 /* Now tell GNU LD that this is part of the static constructor set. */
955 /* This code works for any machine provided you use GNU as/ld. */
956 fprintf (asm_out_file
, "%s \"___CTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
957 assemble_name (asm_out_file
, name
);
958 fputc ('\n', asm_out_file
);
963 /* Likewise for entries we want to record for garbage collection.
964 Garbage collection is still under development. */
967 assemble_gc_entry (name
)
970 #ifdef ASM_OUTPUT_GC_ENTRY
971 ASM_OUTPUT_GC_ENTRY (asm_out_file
, name
);
975 /* Now tell GNU LD that this is part of the static constructor set. */
976 fprintf (asm_out_file
, "%s \"___PTR_LIST__\",22,0,0,", ASM_STABS_OP
);
977 assemble_name (asm_out_file
, name
);
978 fputc ('\n', asm_out_file
);
983 /* CONSTANT_POOL_BEFORE_FUNCTION may be defined as an expression with
984 a non-zero value if the constant pool should be output before the
985 start of the function, or a zero value if the pool should output
986 after the end of the function. The default is to put it before the
989 #ifndef CONSTANT_POOL_BEFORE_FUNCTION
990 #define CONSTANT_POOL_BEFORE_FUNCTION 1
993 /* Output assembler code for the constant pool of a function and associated
994 with defining the name of the function. DECL describes the function.
995 NAME is the function's name. For the constant pool, we use the current
996 constant pool data. */
999 assemble_start_function (decl
, fnname
)
1005 /* The following code does not need preprocessing in the assembler. */
1009 if (CONSTANT_POOL_BEFORE_FUNCTION
)
1010 output_constant_pool (fnname
, decl
);
1012 #ifdef ASM_OUTPUT_SECTION_NAME
1013 /* If the function is to be put in its own section and it's not in a section
1014 already, indicate so. */
1015 if ((flag_function_sections
1016 && DECL_SECTION_NAME (decl
) == NULL_TREE
)
1017 || UNIQUE_SECTION_P (decl
))
1018 UNIQUE_SECTION (decl
, 0);
1021 function_section (decl
);
1023 /* Tell assembler to move to target machine's alignment for functions. */
1024 align
= floor_log2 (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
1026 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1028 /* Handle a user-specified function alignment.
1029 Note that we still need to align to FUNCTION_BOUNDARY, as above,
1030 because ASM_OUTPUT_MAX_SKIP_ALIGN might not do any alignment at all. */
1031 if (align_functions_log
> align
)
1033 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
1034 ASM_OUTPUT_MAX_SKIP_ALIGN (asm_out_file
,
1035 align_functions_log
, align_functions
-1);
1037 ASM_OUTPUT_ALIGN (asm_out_file
, align_functions_log
);
1041 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
1042 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file
, fnname
);
1045 #ifdef SDB_DEBUGGING_INFO
1046 /* Output SDB definition of the function. */
1047 if (write_symbols
== SDB_DEBUG
)
1048 sdbout_mark_begin_function ();
1051 #ifdef DBX_DEBUGGING_INFO
1052 /* Output DBX definition of the function. */
1053 if (write_symbols
== DBX_DEBUG
)
1054 dbxout_begin_function (decl
);
1057 /* Make function name accessible from other files, if appropriate. */
1059 if (TREE_PUBLIC (decl
))
1061 if (! first_global_object_name
)
1066 if (! DECL_WEAK (decl
) && ! DECL_ONE_ONLY (decl
))
1067 name
= &first_global_object_name
;
1069 name
= &weak_global_object_name
;
1071 STRIP_NAME_ENCODING (p
, fnname
);
1072 *name
= permalloc (strlen (p
) + 1);
1076 #ifdef ASM_WEAKEN_LABEL
1077 if (DECL_WEAK (decl
))
1079 ASM_WEAKEN_LABEL (asm_out_file
, fnname
);
1080 /* Remove this function from the pending weak list so that
1081 we do not emit multiple .weak directives for it. */
1082 remove_from_pending_weak_list
1083 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
1087 ASM_GLOBALIZE_LABEL (asm_out_file
, fnname
);
1090 /* Do any machine/system dependent processing of the function name */
1091 #ifdef ASM_DECLARE_FUNCTION_NAME
1092 ASM_DECLARE_FUNCTION_NAME (asm_out_file
, fnname
, current_function_decl
);
1094 /* Standard thing is just output label for the function. */
1095 ASM_OUTPUT_LABEL (asm_out_file
, fnname
);
1096 #endif /* ASM_DECLARE_FUNCTION_NAME */
1099 /* Output assembler code associated with defining the size of the
1100 function. DECL describes the function. NAME is the function's name. */
1103 assemble_end_function (decl
, fnname
)
1107 #ifdef ASM_DECLARE_FUNCTION_SIZE
1108 ASM_DECLARE_FUNCTION_SIZE (asm_out_file
, fnname
, decl
);
1110 if (! CONSTANT_POOL_BEFORE_FUNCTION
)
1112 output_constant_pool (fnname
, decl
);
1113 function_section (decl
); /* need to switch back */
1116 /* Output any constants which should appear after the function. */
1117 output_after_function_constants ();
1120 /* Assemble code to leave SIZE bytes of zeros. */
1123 assemble_zeros (size
)
1126 /* Do no output if -fsyntax-only. */
1127 if (flag_syntax_only
)
1130 #ifdef ASM_NO_SKIP_IN_TEXT
1131 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
1132 so we must output 0s explicitly in the text section. */
1133 if (ASM_NO_SKIP_IN_TEXT
&& in_text_section ())
1137 for (i
= 0; i
< size
- 20; i
+= 20)
1140 fprintf (asm_out_file
,
1141 "%s 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n", ASM_BYTE_OP
);
1143 fprintf (asm_out_file
,
1144 "\tbyte 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n");
1150 fprintf (asm_out_file
, "%s 0", ASM_BYTE_OP
);
1152 fprintf (asm_out_file
, "\tbyte 0");
1155 for (; i
< size
; i
++)
1156 fprintf (asm_out_file
, ",0");
1157 fprintf (asm_out_file
, "\n");
1163 ASM_OUTPUT_SKIP (asm_out_file
, size
);
1166 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
1169 assemble_align (align
)
1172 if (align
> BITS_PER_UNIT
)
1173 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
1176 /* Assemble a string constant with the specified C string as contents. */
1179 assemble_string (p
, size
)
1186 /* If the string is very long, split it up. */
1190 int thissize
= size
- pos
;
1191 if (thissize
> maximum
)
1194 ASM_OUTPUT_ASCII (asm_out_file
, p
, thissize
);
1202 #if defined ASM_OUTPUT_ALIGNED_DECL_LOCAL
1203 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1204 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1206 #if defined ASM_OUTPUT_ALIGNED_LOCAL
1207 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1208 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, DECL_ALIGN (decl))
1210 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1211 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded)
1215 #if defined ASM_OUTPUT_ALIGNED_BSS
1216 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1217 ASM_OUTPUT_ALIGNED_BSS (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1219 #if defined ASM_OUTPUT_BSS
1220 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1221 ASM_OUTPUT_BSS (asm_out_file, decl, name, size, rounded)
1227 #if defined ASM_OUTPUT_ALIGNED_DECL_COMMON
1228 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1229 ASM_OUTPUT_ALIGNED_DECL_COMMON (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1231 #if defined ASM_OUTPUT_ALIGNED_COMMON
1232 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1233 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file, name, size, DECL_ALIGN (decl))
1235 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1236 ASM_OUTPUT_COMMON (asm_out_file, name, size, rounded)
1241 asm_emit_uninitialised (decl
, name
, size
, rounded
)
1244 int size ATTRIBUTE_UNUSED
;
1245 int rounded ATTRIBUTE_UNUSED
;
1253 destination
= asm_dest_local
;
1255 if (TREE_PUBLIC (decl
))
1257 #if defined ASM_EMIT_BSS
1258 if (! DECL_COMMON (decl
))
1259 destination
= asm_dest_bss
;
1262 destination
= asm_dest_common
;
1265 if (flag_shared_data
)
1267 switch (destination
)
1269 #ifdef ASM_OUTPUT_SHARED_BSS
1271 ASM_OUTPUT_SHARED_BSS (asm_out_file
, decl
, name
, size
, rounded
);
1274 #ifdef ASM_OUTPUT_SHARED_COMMON
1275 case asm_dest_common
:
1276 ASM_OUTPUT_SHARED_COMMON (asm_out_file
, name
, size
, rounded
);
1279 #ifdef ASM_OUTPUT_SHARED_LOCAL
1280 case asm_dest_local
:
1281 ASM_OUTPUT_SHARED_LOCAL (asm_out_file
, name
, size
, rounded
);
1289 #ifdef ASM_OUTPUT_SECTION_NAME
1290 /* We already know that DECL_SECTION_NAME() == NULL. */
1291 if (flag_data_sections
!= 0 || UNIQUE_SECTION_P (decl
))
1292 UNIQUE_SECTION (decl
, NULL
);
1295 switch (destination
)
1299 ASM_EMIT_BSS (decl
, name
, size
, rounded
);
1302 case asm_dest_common
:
1303 ASM_EMIT_COMMON (decl
, name
, size
, rounded
);
1305 case asm_dest_local
:
1306 ASM_EMIT_LOCAL (decl
, name
, size
, rounded
);
1315 /* Assemble everything that is needed for a variable or function declaration.
1316 Not used for automatic variables, and not used for function definitions.
1317 Should not be called for variables of incomplete structure type.
1319 TOP_LEVEL is nonzero if this variable has file scope.
1320 AT_END is nonzero if this is the special handling, at end of compilation,
1321 to define things that have had only tentative definitions.
1322 DONT_OUTPUT_DATA if nonzero means don't actually output the
1323 initial value (that will be done by the caller). */
1326 assemble_variable (decl
, top_level
, at_end
, dont_output_data
)
1328 int top_level ATTRIBUTE_UNUSED
;
1329 int at_end ATTRIBUTE_UNUSED
;
1330 int dont_output_data
;
1332 register const char *name
;
1335 enum in_section saved_in_section
;
1337 last_assemble_variable_decl
= 0;
1339 if (GET_CODE (DECL_RTL (decl
)) == REG
)
1341 /* Do output symbol info for global register variables, but do nothing
1344 if (TREE_ASM_WRITTEN (decl
))
1346 TREE_ASM_WRITTEN (decl
) = 1;
1348 /* Do no output if -fsyntax-only. */
1349 if (flag_syntax_only
)
1352 #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
1353 /* File-scope global variables are output here. */
1354 if ((write_symbols
== DBX_DEBUG
|| write_symbols
== XCOFF_DEBUG
)
1356 dbxout_symbol (decl
, 0);
1358 #ifdef SDB_DEBUGGING_INFO
1359 if (write_symbols
== SDB_DEBUG
&& top_level
1360 /* Leave initialized global vars for end of compilation;
1361 see comment in compile_file. */
1362 && (TREE_PUBLIC (decl
) == 0 || DECL_INITIAL (decl
) == 0))
1363 sdbout_symbol (decl
, 0);
1366 /* Don't output any DWARF debugging information for variables here.
1367 In the case of local variables, the information for them is output
1368 when we do our recursive traversal of the tree representation for
1369 the entire containing function. In the case of file-scope variables,
1370 we output information for all of them at the very end of compilation
1371 while we are doing our final traversal of the chain of file-scope
1377 /* Normally no need to say anything here for external references,
1378 since assemble_external is called by the language-specific code
1379 when a declaration is first seen. */
1381 if (DECL_EXTERNAL (decl
))
1384 /* Output no assembler code for a function declaration.
1385 Only definitions of functions output anything. */
1387 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1390 /* If type was incomplete when the variable was declared,
1391 see if it is complete now. */
1393 if (DECL_SIZE (decl
) == 0)
1394 layout_decl (decl
, 0);
1396 /* Still incomplete => don't allocate it; treat the tentative defn
1397 (which is what it must have been) as an `extern' reference. */
1399 if (!dont_output_data
&& DECL_SIZE (decl
) == 0)
1401 error_with_file_and_line (DECL_SOURCE_FILE (decl
),
1402 DECL_SOURCE_LINE (decl
),
1403 "storage size of `%s' isn't known",
1404 IDENTIFIER_POINTER (DECL_NAME (decl
)));
1405 TREE_ASM_WRITTEN (decl
) = 1;
1409 /* The first declaration of a variable that comes through this function
1410 decides whether it is global (in C, has external linkage)
1411 or local (in C, has internal linkage). So do nothing more
1412 if this function has already run. */
1414 if (TREE_ASM_WRITTEN (decl
))
1417 TREE_ASM_WRITTEN (decl
) = 1;
1419 /* Do no output if -fsyntax-only. */
1420 if (flag_syntax_only
)
1425 if (! dont_output_data
1426 && ! host_integerp (DECL_SIZE_UNIT (decl
), 1))
1428 error_with_decl (decl
, "size of variable `%s' is too large");
1432 name
= XSTR (XEXP (DECL_RTL (decl
), 0), 0);
1433 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
)
1434 && ! first_global_object_name
1435 && ! (DECL_COMMON (decl
) && (DECL_INITIAL (decl
) == 0
1436 || DECL_INITIAL (decl
) == error_mark_node
))
1437 && ! DECL_WEAK (decl
)
1438 && ! DECL_ONE_ONLY (decl
))
1442 STRIP_NAME_ENCODING (p
, name
);
1443 first_global_object_name
= permalloc (strlen (p
) + 1);
1444 strcpy (first_global_object_name
, p
);
1447 /* Compute the alignment of this data. */
1449 align
= DECL_ALIGN (decl
);
1451 /* In the case for initialing an array whose length isn't specified,
1452 where we have not yet been able to do the layout,
1453 figure out the proper alignment now. */
1454 if (dont_output_data
&& DECL_SIZE (decl
) == 0
1455 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
)
1456 align
= MAX (align
, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl
))));
1458 /* Some object file formats have a maximum alignment which they support.
1459 In particular, a.out format supports a maximum alignment of 4. */
1460 #ifndef MAX_OFILE_ALIGNMENT
1461 #define MAX_OFILE_ALIGNMENT BIGGEST_ALIGNMENT
1463 if (align
> MAX_OFILE_ALIGNMENT
)
1465 warning_with_decl (decl
,
1466 "alignment of `%s' is greater than maximum object file alignment. Using %d.",
1467 MAX_OFILE_ALIGNMENT
/BITS_PER_UNIT
);
1468 align
= MAX_OFILE_ALIGNMENT
;
1471 /* On some machines, it is good to increase alignment sometimes. */
1472 #ifdef DATA_ALIGNMENT
1473 align
= DATA_ALIGNMENT (TREE_TYPE (decl
), align
);
1475 #ifdef CONSTANT_ALIGNMENT
1476 if (DECL_INITIAL (decl
) != 0 && DECL_INITIAL (decl
) != error_mark_node
)
1477 align
= CONSTANT_ALIGNMENT (DECL_INITIAL (decl
), align
);
1480 /* Reset the alignment in case we have made it tighter, so we can benefit
1481 from it in get_pointer_alignment. */
1482 DECL_ALIGN (decl
) = align
;
1484 /* Handle uninitialized definitions. */
1486 if ((DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
)
1487 /* If the target can't output uninitialized but not common global data
1488 in .bss, then we have to use .data. */
1489 #if ! defined ASM_EMIT_BSS
1490 && DECL_COMMON (decl
)
1492 && DECL_SECTION_NAME (decl
) == NULL_TREE
1493 && ! dont_output_data
)
1495 unsigned HOST_WIDE_INT size
= tree_low_cst (DECL_SIZE_UNIT (decl
), 1);
1496 unsigned HOST_WIDE_INT rounded
= size
;
1498 /* Don't allocate zero bytes of common,
1499 since that means "undefined external" in the linker. */
1503 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1504 so that each uninitialized object starts on such a boundary. */
1505 rounded
+= (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1;
1506 rounded
= (rounded
/ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1507 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1509 #if !defined(ASM_OUTPUT_ALIGNED_COMMON) && !defined(ASM_OUTPUT_ALIGNED_BSS)
1510 if ((unsigned HOST_WIDE_INT
) DECL_ALIGN (decl
) / BITS_PER_UNIT
> rounded
)
1512 (decl
, "requested alignment for %s is greater than implemented alignment of %d.",rounded
);
1515 #ifdef DBX_DEBUGGING_INFO
1516 /* File-scope global variables are output here. */
1517 if (write_symbols
== DBX_DEBUG
&& top_level
)
1518 dbxout_symbol (decl
, 0);
1520 #ifdef SDB_DEBUGGING_INFO
1521 if (write_symbols
== SDB_DEBUG
&& top_level
1522 /* Leave initialized global vars for end of compilation;
1523 see comment in compile_file. */
1524 && (TREE_PUBLIC (decl
) == 0 || DECL_INITIAL (decl
) == 0))
1525 sdbout_symbol (decl
, 0);
1528 /* Don't output any DWARF debugging information for variables here.
1529 In the case of local variables, the information for them is output
1530 when we do our recursive traversal of the tree representation for
1531 the entire containing function. In the case of file-scope variables,
1532 we output information for all of them at the very end of compilation
1533 while we are doing our final traversal of the chain of file-scope
1536 #if 0 /* ??? We should either delete this or add a comment describing what
1537 it was intended to do and why we shouldn't delete it. */
1538 if (flag_shared_data
)
1541 asm_emit_uninitialised (decl
, name
, size
, rounded
);
1546 /* Handle initialized definitions.
1547 Also handle uninitialized global definitions if -fno-common and the
1548 target doesn't support ASM_OUTPUT_BSS. */
1550 /* First make the assembler name(s) global if appropriate. */
1551 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
))
1553 #ifdef ASM_WEAKEN_LABEL
1554 if (DECL_WEAK (decl
))
1556 ASM_WEAKEN_LABEL (asm_out_file
, name
);
1557 /* Remove this variable from the pending weak list so that
1558 we do not emit multiple .weak directives for it. */
1559 remove_from_pending_weak_list
1560 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
1564 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
1567 for (d
= equivalents
; d
; d
= TREE_CHAIN (d
))
1569 tree e
= TREE_VALUE (d
);
1570 if (TREE_PUBLIC (e
) && DECL_NAME (e
))
1571 ASM_GLOBALIZE_LABEL (asm_out_file
,
1572 XSTR (XEXP (DECL_RTL (e
), 0), 0));
1576 /* Output any data that we will need to use the address of. */
1577 if (DECL_INITIAL (decl
) == error_mark_node
)
1578 reloc
= contains_pointers_p (TREE_TYPE (decl
));
1579 else if (DECL_INITIAL (decl
))
1580 reloc
= output_addressed_constants (DECL_INITIAL (decl
));
1582 #ifdef ASM_OUTPUT_SECTION_NAME
1583 if ((flag_data_sections
!= 0 && DECL_SECTION_NAME (decl
) == NULL_TREE
)
1584 || UNIQUE_SECTION_P (decl
))
1585 UNIQUE_SECTION (decl
, reloc
);
1588 /* Switch to the appropriate section. */
1589 variable_section (decl
, reloc
);
1591 /* dbxout.c needs to know this. */
1592 if (in_text_section ())
1593 DECL_IN_TEXT_SECTION (decl
) = 1;
1595 /* Record current section so we can restore it if dbxout.c clobbers it. */
1596 saved_in_section
= in_section
;
1598 /* Output the dbx info now that we have chosen the section. */
1600 #ifdef DBX_DEBUGGING_INFO
1601 /* File-scope global variables are output here. */
1602 if (write_symbols
== DBX_DEBUG
&& top_level
)
1603 dbxout_symbol (decl
, 0);
1605 #ifdef SDB_DEBUGGING_INFO
1606 if (write_symbols
== SDB_DEBUG
&& top_level
1607 /* Leave initialized global vars for end of compilation;
1608 see comment in compile_file. */
1609 && (TREE_PUBLIC (decl
) == 0 || DECL_INITIAL (decl
) == 0))
1610 sdbout_symbol (decl
, 0);
1613 /* Don't output any DWARF debugging information for variables here.
1614 In the case of local variables, the information for them is output
1615 when we do our recursive traversal of the tree representation for
1616 the entire containing function. In the case of file-scope variables,
1617 we output information for all of them at the very end of compilation
1618 while we are doing our final traversal of the chain of file-scope
1621 /* If the debugging output changed sections, reselect the section
1622 that's supposed to be selected. */
1623 if (in_section
!= saved_in_section
)
1624 variable_section (decl
, reloc
);
1626 /* Output the alignment of this data. */
1627 if (align
> BITS_PER_UNIT
)
1628 ASM_OUTPUT_ALIGN (asm_out_file
,
1629 floor_log2 (DECL_ALIGN (decl
) / BITS_PER_UNIT
));
1631 /* Do any machine/system dependent processing of the object. */
1632 #ifdef ASM_DECLARE_OBJECT_NAME
1633 last_assemble_variable_decl
= decl
;
1634 ASM_DECLARE_OBJECT_NAME (asm_out_file
, name
, decl
);
1636 /* Standard thing is just output label for the object. */
1637 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1638 #endif /* ASM_DECLARE_OBJECT_NAME */
1640 if (!dont_output_data
)
1642 if (DECL_INITIAL (decl
))
1643 /* Output the actual data. */
1644 output_constant (DECL_INITIAL (decl
),
1645 tree_low_cst (DECL_SIZE_UNIT (decl
), 1));
1647 /* Leave space for it. */
1648 assemble_zeros (tree_low_cst (DECL_SIZE_UNIT (decl
), 1));
1652 #ifdef XCOFF_DEBUGGING_INFO
1653 /* Unfortunately, the IBM assembler cannot handle stabx before the actual
1654 declaration. When something like ".stabx "aa:S-2",aa,133,0" is emitted
1655 and `aa' hasn't been output yet, the assembler generates a stab entry with
1656 a value of zero, in addition to creating an unnecessary external entry
1657 for `aa'. Hence, we must postpone dbxout_symbol to here at the end. */
1659 /* File-scope global variables are output here. */
1660 if (write_symbols
== XCOFF_DEBUG
&& top_level
)
1662 saved_in_section
= in_section
;
1664 dbxout_symbol (decl
, 0);
1666 if (in_section
!= saved_in_section
)
1667 variable_section (decl
, reloc
);
1670 /* There must be a statement after a label. */
1675 /* Return 1 if type TYPE contains any pointers. */
1678 contains_pointers_p (type
)
1681 switch (TREE_CODE (type
))
1684 case REFERENCE_TYPE
:
1685 /* I'm not sure whether OFFSET_TYPE needs this treatment,
1686 so I'll play safe and return 1. */
1692 case QUAL_UNION_TYPE
:
1695 /* For a type that has fields, see if the fields have pointers. */
1696 for (fields
= TYPE_FIELDS (type
); fields
; fields
= TREE_CHAIN (fields
))
1697 if (TREE_CODE (fields
) == FIELD_DECL
1698 && contains_pointers_p (TREE_TYPE (fields
)))
1704 /* An array type contains pointers if its element type does. */
1705 return contains_pointers_p (TREE_TYPE (type
));
1712 /* Output something to declare an external symbol to the assembler.
1713 (Most assemblers don't need this, so we normally output nothing.)
1714 Do nothing if DECL is not external. */
1717 assemble_external (decl
)
1718 tree decl ATTRIBUTE_UNUSED
;
1720 #ifdef ASM_OUTPUT_EXTERNAL
1721 if (DECL_P (decl
) && DECL_EXTERNAL (decl
) && TREE_PUBLIC (decl
))
1723 rtx rtl
= DECL_RTL (decl
);
1725 if (GET_CODE (rtl
) == MEM
&& GET_CODE (XEXP (rtl
, 0)) == SYMBOL_REF
1726 && ! SYMBOL_REF_USED (XEXP (rtl
, 0)))
1728 /* Some systems do require some output. */
1729 SYMBOL_REF_USED (XEXP (rtl
, 0)) = 1;
1730 ASM_OUTPUT_EXTERNAL (asm_out_file
, decl
, XSTR (XEXP (rtl
, 0), 0));
1736 /* Similar, for calling a library function FUN. */
1739 assemble_external_libcall (fun
)
1740 rtx fun ATTRIBUTE_UNUSED
;
1742 #ifdef ASM_OUTPUT_EXTERNAL_LIBCALL
1743 /* Declare library function name external when first used, if nec. */
1744 if (! SYMBOL_REF_USED (fun
))
1746 SYMBOL_REF_USED (fun
) = 1;
1747 ASM_OUTPUT_EXTERNAL_LIBCALL (asm_out_file
, fun
);
1752 /* Declare the label NAME global. */
1755 assemble_global (name
)
1758 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
1761 /* Assemble a label named NAME. */
1764 assemble_label (name
)
1767 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1770 /* Output to FILE a reference to the assembler name of a C-level name NAME.
1771 If NAME starts with a *, the rest of NAME is output verbatim.
1772 Otherwise NAME is transformed in an implementation-defined way
1773 (usually by the addition of an underscore).
1774 Many macros in the tm file are defined to call this function. */
1777 assemble_name (file
, name
)
1781 const char *real_name
;
1784 STRIP_NAME_ENCODING (real_name
, name
);
1785 if (flag_prefix_function_name
1786 && ! bcmp (real_name
, CHKR_PREFIX
, CHKR_PREFIX_SIZE
))
1787 real_name
= real_name
+ CHKR_PREFIX_SIZE
;
1789 id
= maybe_get_identifier (real_name
);
1791 TREE_SYMBOL_REFERENCED (id
) = 1;
1794 fputs (&name
[1], file
);
1796 ASM_OUTPUT_LABELREF (file
, name
);
1799 /* Allocate SIZE bytes writable static space with a gensym name
1800 and return an RTX to refer to its address. */
1803 assemble_static_space (size
)
1811 if (flag_shared_data
)
1815 ASM_GENERATE_INTERNAL_LABEL (name
, "LF", const_labelno
);
1817 namestring
= ggc_alloc_string (name
, -1);
1819 x
= gen_rtx_SYMBOL_REF (Pmode
, namestring
);
1821 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
1822 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file
, NULL_TREE
, name
, size
,
1825 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1826 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file
, name
, size
, BIGGEST_ALIGNMENT
);
1829 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1830 so that each uninitialized object starts on such a boundary. */
1831 /* Variable `rounded' might or might not be used in ASM_OUTPUT_LOCAL. */
1832 int rounded ATTRIBUTE_UNUSED
1833 = ((size
+ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1)
1834 / (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1835 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1836 ASM_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
1843 /* Assemble the static constant template for function entry trampolines.
1844 This is done at most once per compilation.
1845 Returns an RTX for the address of the template. */
1847 #ifdef TRAMPOLINE_TEMPLATE
1849 assemble_trampoline_template ()
1855 /* By default, put trampoline templates in read-only data section. */
1857 #ifdef TRAMPOLINE_SECTION
1858 TRAMPOLINE_SECTION ();
1860 readonly_data_section ();
1863 /* Write the assembler code to define one. */
1864 align
= floor_log2 (TRAMPOLINE_ALIGNMENT
/ BITS_PER_UNIT
);
1866 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1868 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LTRAMP", 0);
1869 TRAMPOLINE_TEMPLATE (asm_out_file
);
1871 /* Record the rtl to refer to it. */
1872 ASM_GENERATE_INTERNAL_LABEL (label
, "LTRAMP", 0);
1873 name
= ggc_alloc_string (label
, -1);
1874 return gen_rtx_SYMBOL_REF (Pmode
, name
);
1878 /* Assemble the integer constant X into an object of SIZE bytes.
1879 X must be either a CONST_INT or CONST_DOUBLE.
1881 Return 1 if we were able to output the constant, otherwise 0. If FORCE is
1882 non-zero, abort if we can't output the constant. */
1885 assemble_integer (x
, size
, force
)
1890 /* First try to use the standard 1, 2, 4, 8, and 16 byte
1891 ASM_OUTPUT... macros. */
1895 #ifdef ASM_OUTPUT_CHAR
1897 ASM_OUTPUT_CHAR (asm_out_file
, x
);
1901 #ifdef ASM_OUTPUT_SHORT
1903 ASM_OUTPUT_SHORT (asm_out_file
, x
);
1907 #ifdef ASM_OUTPUT_INT
1909 ASM_OUTPUT_INT (asm_out_file
, x
);
1913 #ifdef ASM_OUTPUT_DOUBLE_INT
1915 ASM_OUTPUT_DOUBLE_INT (asm_out_file
, x
);
1919 #ifdef ASM_OUTPUT_QUADRUPLE_INT
1921 ASM_OUTPUT_QUADRUPLE_INT (asm_out_file
, x
);
1926 /* If we couldn't do it that way, there are two other possibilities: First,
1927 if the machine can output an explicit byte and this is a 1 byte constant,
1928 we can use ASM_OUTPUT_BYTE. */
1930 #ifdef ASM_OUTPUT_BYTE
1931 if (size
== 1 && GET_CODE (x
) == CONST_INT
)
1933 ASM_OUTPUT_BYTE (asm_out_file
, INTVAL (x
));
1938 /* Finally, if SIZE is larger than a single word, try to output the constant
1939 one word at a time. */
1941 if (size
> UNITS_PER_WORD
)
1944 enum machine_mode mode
1945 = mode_for_size (size
* BITS_PER_UNIT
, MODE_INT
, 0);
1948 for (i
= 0; i
< size
/ UNITS_PER_WORD
; i
++)
1950 word
= operand_subword (x
, i
, 0, mode
);
1955 if (! assemble_integer (word
, UNITS_PER_WORD
, 0))
1959 if (i
== size
/ UNITS_PER_WORD
)
1961 /* If we output at least one word and then could not finish,
1962 there is no valid way to continue. */
1973 /* Assemble the floating-point constant D into an object of size MODE. */
1976 assemble_real (d
, mode
)
1978 enum machine_mode mode
;
1980 jmp_buf output_constant_handler
;
1982 if (setjmp (output_constant_handler
))
1984 error ("floating point trap outputting a constant");
1985 #ifdef REAL_IS_NOT_DOUBLE
1986 bzero ((char *) &d
, sizeof d
);
1993 set_float_handler (output_constant_handler
);
1997 #ifdef ASM_OUTPUT_BYTE_FLOAT
1999 ASM_OUTPUT_BYTE_FLOAT (asm_out_file
, d
);
2002 #ifdef ASM_OUTPUT_SHORT_FLOAT
2004 ASM_OUTPUT_SHORT_FLOAT (asm_out_file
, d
);
2007 #ifdef ASM_OUTPUT_THREE_QUARTER_FLOAT
2009 ASM_OUTPUT_THREE_QUARTER_FLOAT (asm_out_file
, d
);
2012 #ifdef ASM_OUTPUT_FLOAT
2014 ASM_OUTPUT_FLOAT (asm_out_file
, d
);
2018 #ifdef ASM_OUTPUT_DOUBLE
2020 ASM_OUTPUT_DOUBLE (asm_out_file
, d
);
2024 #ifdef ASM_OUTPUT_LONG_DOUBLE
2027 ASM_OUTPUT_LONG_DOUBLE (asm_out_file
, d
);
2035 set_float_handler (NULL_PTR
);
2038 /* Here we combine duplicate floating constants to make
2039 CONST_DOUBLE rtx's, and force those out to memory when necessary. */
2041 /* Return a CONST_DOUBLE or CONST_INT for a value specified as a pair of ints.
2042 For an integer, I0 is the low-order word and I1 is the high-order word.
2043 For a real number, I0 is the word with the low address
2044 and I1 is the word with the high address. */
2047 immed_double_const (i0
, i1
, mode
)
2048 HOST_WIDE_INT i0
, i1
;
2049 enum machine_mode mode
;
2053 if (GET_MODE_CLASS (mode
) == MODE_INT
2054 || GET_MODE_CLASS (mode
) == MODE_PARTIAL_INT
)
2056 /* We clear out all bits that don't belong in MODE, unless they and our
2057 sign bit are all one. So we get either a reasonable negative value
2058 or a reasonable unsigned value for this mode. */
2059 int width
= GET_MODE_BITSIZE (mode
);
2060 if (width
< HOST_BITS_PER_WIDE_INT
2061 && ((i0
& ((HOST_WIDE_INT
) (-1) << (width
- 1)))
2062 != ((HOST_WIDE_INT
) (-1) << (width
- 1))))
2063 i0
&= ((HOST_WIDE_INT
) 1 << width
) - 1, i1
= 0;
2064 else if (width
== HOST_BITS_PER_WIDE_INT
2065 && ! (i1
== ~0 && i0
< 0))
2067 else if (width
> 2 * HOST_BITS_PER_WIDE_INT
)
2068 /* We cannot represent this value as a constant. */
2071 /* If this would be an entire word for the target, but is not for
2072 the host, then sign-extend on the host so that the number will look
2073 the same way on the host that it would on the target.
2075 For example, when building a 64 bit alpha hosted 32 bit sparc
2076 targeted compiler, then we want the 32 bit unsigned value -1 to be
2077 represented as a 64 bit value -1, and not as 0x00000000ffffffff.
2078 The later confuses the sparc backend. */
2080 if (BITS_PER_WORD
< HOST_BITS_PER_WIDE_INT
&& BITS_PER_WORD
== width
2081 && (i0
& ((HOST_WIDE_INT
) 1 << (width
- 1))))
2082 i0
|= ((HOST_WIDE_INT
) (-1) << width
);
2084 /* If MODE fits within HOST_BITS_PER_WIDE_INT, always use a CONST_INT.
2086 ??? Strictly speaking, this is wrong if we create a CONST_INT
2087 for a large unsigned constant with the size of MODE being
2088 HOST_BITS_PER_WIDE_INT and later try to interpret that constant in a
2089 wider mode. In that case we will mis-interpret it as a negative
2092 Unfortunately, the only alternative is to make a CONST_DOUBLE
2093 for any constant in any mode if it is an unsigned constant larger
2094 than the maximum signed integer in an int on the host. However,
2095 doing this will break everyone that always expects to see a CONST_INT
2096 for SImode and smaller.
2098 We have always been making CONST_INTs in this case, so nothing new
2101 if (width
<= HOST_BITS_PER_WIDE_INT
)
2102 i1
= (i0
< 0) ? ~(HOST_WIDE_INT
) 0 : 0;
2104 /* If this integer fits in one word, return a CONST_INT. */
2105 if ((i1
== 0 && i0
>= 0)
2106 || (i1
== ~0 && i0
< 0))
2107 return GEN_INT (i0
);
2109 /* We use VOIDmode for integers. */
2113 /* Search the chain for an existing CONST_DOUBLE with the right value.
2114 If one is found, return it. */
2116 for (r
= const_double_chain
; r
; r
= CONST_DOUBLE_CHAIN (r
))
2117 if (CONST_DOUBLE_LOW (r
) == i0
&& CONST_DOUBLE_HIGH (r
) == i1
2118 && GET_MODE (r
) == mode
)
2121 /* No; make a new one and add it to the chain.
2123 We may be called by an optimizer which may be discarding any memory
2124 allocated during its processing (such as combine and loop). However,
2125 we will be leaving this constant on the chain, so we cannot tolerate
2126 freed memory. So switch to saveable_obstack for this allocation
2127 and then switch back if we were in current_obstack. */
2129 push_obstacks_nochange ();
2130 rtl_in_saveable_obstack ();
2131 r
= gen_rtx_CONST_DOUBLE (mode
, NULL_RTX
, i0
, i1
);
2134 /* Don't touch const_double_chain if not inside any function. */
2135 if (current_function_decl
!= 0)
2137 CONST_DOUBLE_CHAIN (r
) = const_double_chain
;
2138 const_double_chain
= r
;
2141 /* Store const0_rtx in mem-slot since this CONST_DOUBLE is on the chain.
2142 Actual use of mem-slot is only through force_const_mem. */
2144 CONST_DOUBLE_MEM (r
) = const0_rtx
;
2149 /* Return a CONST_DOUBLE for a specified `double' value
2150 and machine mode. */
2153 immed_real_const_1 (d
, mode
)
2155 enum machine_mode mode
;
2157 union real_extract u
;
2160 /* Get the desired `double' value as a sequence of ints
2161 since that is how they are stored in a CONST_DOUBLE. */
2165 /* Detect special cases. But be careful we don't use a CONST_DOUBLE
2166 that's from a parent function since it may be in its constant pool. */
2167 if (REAL_VALUES_IDENTICAL (dconst0
, d
)
2168 && (cfun
== 0 || decl_function_context (current_function_decl
) == 0))
2169 return CONST0_RTX (mode
);
2171 /* Check for NaN first, because some ports (specifically the i386) do not
2172 emit correct ieee-fp code by default, and thus will generate a core
2173 dump here if we pass a NaN to REAL_VALUES_EQUAL and if REAL_VALUES_EQUAL
2174 does a floating point comparison. */
2175 else if ((! REAL_VALUE_ISNAN (d
) && REAL_VALUES_EQUAL (dconst1
, d
))
2177 || decl_function_context (current_function_decl
) == 0))
2178 return CONST1_RTX (mode
);
2180 if (sizeof u
== sizeof (HOST_WIDE_INT
))
2181 return immed_double_const (u
.i
[0], 0, mode
);
2182 if (sizeof u
== 2 * sizeof (HOST_WIDE_INT
))
2183 return immed_double_const (u
.i
[0], u
.i
[1], mode
);
2185 /* The rest of this function handles the case where
2186 a float value requires more than 2 ints of space.
2187 It will be deleted as dead code on machines that don't need it. */
2189 /* Search the chain for an existing CONST_DOUBLE with the right value.
2190 If one is found, return it. */
2192 for (r
= const_double_chain
; r
; r
= CONST_DOUBLE_CHAIN (r
))
2193 if (! bcmp ((char *) &CONST_DOUBLE_LOW (r
), (char *) &u
, sizeof u
)
2194 && GET_MODE (r
) == mode
)
2197 /* No; make a new one and add it to the chain.
2199 We may be called by an optimizer which may be discarding any memory
2200 allocated during its processing (such as combine and loop). However,
2201 we will be leaving this constant on the chain, so we cannot tolerate
2202 freed memory. So switch to saveable_obstack for this allocation
2203 and then switch back if we were in current_obstack. */
2204 push_obstacks_nochange ();
2205 rtl_in_saveable_obstack ();
2206 r
= rtx_alloc (CONST_DOUBLE
);
2209 bcopy ((char *) &u
, (char *) &CONST_DOUBLE_LOW (r
), sizeof u
);
2211 /* Don't touch const_double_chain if not inside any function. */
2212 if (current_function_decl
!= 0)
2214 CONST_DOUBLE_CHAIN (r
) = const_double_chain
;
2215 const_double_chain
= r
;
2218 /* Store const0_rtx in CONST_DOUBLE_MEM since this CONST_DOUBLE is on the
2219 chain, but has not been allocated memory. Actual use of CONST_DOUBLE_MEM
2220 is only through force_const_mem. */
2222 CONST_DOUBLE_MEM (r
) = const0_rtx
;
2227 /* Return a CONST_DOUBLE rtx for a value specified by EXP,
2228 which must be a REAL_CST tree node. */
2231 immed_real_const (exp
)
2234 return immed_real_const_1 (TREE_REAL_CST (exp
), TYPE_MODE (TREE_TYPE (exp
)));
2237 /* At the end of a function, forget the memory-constants
2238 previously made for CONST_DOUBLEs. Mark them as not on real_constant_chain.
2239 Also clear out real_constant_chain and clear out all the chain-pointers. */
2242 clear_const_double_mem ()
2244 register rtx r
, next
;
2246 for (r
= const_double_chain
; r
; r
= next
)
2248 next
= CONST_DOUBLE_CHAIN (r
);
2249 CONST_DOUBLE_CHAIN (r
) = 0;
2250 CONST_DOUBLE_MEM (r
) = cc0_rtx
;
2252 const_double_chain
= 0;
2255 /* Given an expression EXP with a constant value,
2256 reduce it to the sum of an assembler symbol and an integer.
2257 Store them both in the structure *VALUE.
2258 Abort if EXP does not reduce. */
2263 HOST_WIDE_INT offset
;
2267 decode_addr_const (exp
, value
)
2269 struct addr_const
*value
;
2271 register tree target
= TREE_OPERAND (exp
, 0);
2272 register int offset
= 0;
2277 if (TREE_CODE (target
) == COMPONENT_REF
2278 && host_integerp (byte_position (TREE_OPERAND (target
, 1)), 0))
2281 offset
+= int_byte_position (TREE_OPERAND (target
, 1));
2282 target
= TREE_OPERAND (target
, 0);
2284 else if (TREE_CODE (target
) == ARRAY_REF
)
2286 offset
+= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (target
)), 1)
2287 * tree_low_cst (TREE_OPERAND (target
, 1), 0));
2288 target
= TREE_OPERAND (target
, 0);
2294 switch (TREE_CODE (target
))
2298 x
= DECL_RTL (target
);
2302 x
= gen_rtx_MEM (FUNCTION_MODE
,
2303 gen_rtx_LABEL_REF (VOIDmode
,
2304 label_rtx (TREE_OPERAND (exp
, 0))));
2312 x
= TREE_CST_RTL (target
);
2319 if (GET_CODE (x
) != MEM
)
2324 value
->offset
= offset
;
2327 /* Uniquize all constants that appear in memory.
2328 Each constant in memory thus far output is recorded
2329 in `const_hash_table' with a `struct constant_descriptor'
2330 that contains a polish representation of the value of
2333 We cannot store the trees in the hash table
2334 because the trees may be temporary. */
2336 struct constant_descriptor
2338 struct constant_descriptor
*next
;
2345 #define MAX_HASH_TABLE 1009
2346 static struct constant_descriptor
*const_hash_table
[MAX_HASH_TABLE
];
2348 /* Mark a const_hash_table descriptor for GC. */
2351 mark_const_hash_entry (ptr
)
2354 struct constant_descriptor
*desc
= * (struct constant_descriptor
**) ptr
;
2358 ggc_mark_string (desc
->label
);
2359 ggc_mark_rtx (desc
->rtl
);
2364 /* Compute a hash code for a constant expression. */
2370 register const char *p
;
2371 register int len
, hi
, i
;
2372 register enum tree_code code
= TREE_CODE (exp
);
2374 /* Either set P and LEN to the address and len of something to hash and
2375 exit the switch or return a value. */
2380 p
= (char *) &TREE_INT_CST_LOW (exp
);
2381 len
= 2 * sizeof TREE_INT_CST_LOW (exp
);
2385 p
= (char *) &TREE_REAL_CST (exp
);
2386 len
= sizeof TREE_REAL_CST (exp
);
2390 p
= TREE_STRING_POINTER (exp
);
2391 len
= TREE_STRING_LENGTH (exp
);
2395 return (const_hash (TREE_REALPART (exp
)) * 5
2396 + const_hash (TREE_IMAGPART (exp
)));
2399 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2403 len
= int_size_in_bytes (TREE_TYPE (exp
));
2404 tmp
= (char *) alloca (len
);
2405 get_set_constructor_bytes (exp
, (unsigned char *) tmp
, len
);
2413 /* For record type, include the type in the hashing.
2414 We do not do so for array types
2415 because (1) the sizes of the elements are sufficient
2416 and (2) distinct array types can have the same constructor.
2417 Instead, we include the array size because the constructor could
2419 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2420 hi
= ((unsigned long) TREE_TYPE (exp
) & ((1 << HASHBITS
) - 1))
2423 hi
= ((5 + int_size_in_bytes (TREE_TYPE (exp
)))
2424 & ((1 << HASHBITS
) - 1)) % MAX_HASH_TABLE
;
2426 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2427 if (TREE_VALUE (link
))
2429 = (hi
* 603 + const_hash (TREE_VALUE (link
))) % MAX_HASH_TABLE
;
2436 struct addr_const value
;
2438 decode_addr_const (exp
, &value
);
2439 if (GET_CODE (value
.base
) == SYMBOL_REF
)
2441 /* Don't hash the address of the SYMBOL_REF;
2442 only use the offset and the symbol name. */
2444 p
= XSTR (value
.base
, 0);
2445 for (i
= 0; p
[i
] != 0; i
++)
2446 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2448 else if (GET_CODE (value
.base
) == LABEL_REF
)
2449 hi
= value
.offset
+ CODE_LABEL_NUMBER (XEXP (value
.base
, 0)) * 13;
2453 hi
&= (1 << HASHBITS
) - 1;
2454 hi
%= MAX_HASH_TABLE
;
2460 return (const_hash (TREE_OPERAND (exp
, 0)) * 9
2461 + const_hash (TREE_OPERAND (exp
, 1)));
2465 case NON_LVALUE_EXPR
:
2466 return const_hash (TREE_OPERAND (exp
, 0)) * 7 + 2;
2472 /* Compute hashing function */
2474 for (i
= 0; i
< len
; i
++)
2475 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2477 hi
&= (1 << HASHBITS
) - 1;
2478 hi
%= MAX_HASH_TABLE
;
2482 /* Compare a constant expression EXP with a constant-descriptor DESC.
2483 Return 1 if DESC describes a constant with the same value as EXP. */
2486 compare_constant (exp
, desc
)
2488 struct constant_descriptor
*desc
;
2490 return 0 != compare_constant_1 (exp
, desc
->contents
);
2493 /* Compare constant expression EXP with a substring P of a constant descriptor.
2494 If they match, return a pointer to the end of the substring matched.
2495 If they do not match, return 0.
2497 Since descriptors are written in polish prefix notation,
2498 this function can be used recursively to test one operand of EXP
2499 against a subdescriptor, and if it succeeds it returns the
2500 address of the subdescriptor for the next operand. */
2503 compare_constant_1 (exp
, p
)
2507 register const char *strp
;
2509 register enum tree_code code
= TREE_CODE (exp
);
2511 if (code
!= (enum tree_code
) *p
++)
2514 /* Either set STRP, P and LEN to pointers and length to compare and exit the
2515 switch, or return the result of the comparison. */
2520 /* Integer constants are the same only if the same width of type. */
2521 if (*p
++ != TYPE_PRECISION (TREE_TYPE (exp
)))
2524 strp
= (char *) &TREE_INT_CST_LOW (exp
);
2525 len
= 2 * sizeof TREE_INT_CST_LOW (exp
);
2529 /* Real constants are the same only if the same width of type. */
2530 if (*p
++ != TYPE_PRECISION (TREE_TYPE (exp
)))
2533 strp
= (char *) &TREE_REAL_CST (exp
);
2534 len
= sizeof TREE_REAL_CST (exp
);
2538 if (flag_writable_strings
)
2541 if ((enum machine_mode
) *p
++ != TYPE_MODE (TREE_TYPE (exp
)))
2544 strp
= TREE_STRING_POINTER (exp
);
2545 len
= TREE_STRING_LENGTH (exp
);
2546 if (bcmp ((char *) &TREE_STRING_LENGTH (exp
), p
,
2547 sizeof TREE_STRING_LENGTH (exp
)))
2550 p
+= sizeof TREE_STRING_LENGTH (exp
);
2554 p
= compare_constant_1 (TREE_REALPART (exp
), p
);
2558 return compare_constant_1 (TREE_IMAGPART (exp
), p
);
2561 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2563 int xlen
= len
= int_size_in_bytes (TREE_TYPE (exp
));
2564 unsigned char *tmp
= (unsigned char *) alloca (len
);
2566 get_set_constructor_bytes (exp
, tmp
, len
);
2567 strp
= (char *) tmp
;
2568 if (bcmp ((char *) &xlen
, p
, sizeof xlen
))
2577 int length
= list_length (CONSTRUCTOR_ELTS (exp
));
2579 enum machine_mode mode
= TYPE_MODE (TREE_TYPE (exp
));
2580 int have_purpose
= 0;
2582 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2583 if (TREE_PURPOSE (link
))
2586 if (bcmp ((char *) &length
, p
, sizeof length
))
2591 /* For record constructors, insist that the types match.
2592 For arrays, just verify both constructors are for arrays.
2593 Then insist that either both or none have any TREE_PURPOSE
2595 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2596 type
= TREE_TYPE (exp
);
2600 if (bcmp ((char *) &type
, p
, sizeof type
))
2603 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2605 if (bcmp ((char *) &mode
, p
, sizeof mode
))
2613 if (bcmp ((char *) &have_purpose
, p
, sizeof have_purpose
))
2616 p
+= sizeof have_purpose
;
2618 /* For arrays, insist that the size in bytes match. */
2619 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2621 HOST_WIDE_INT size
= int_size_in_bytes (TREE_TYPE (exp
));
2623 if (bcmp ((char *) &size
, p
, sizeof size
))
2629 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2631 if (TREE_VALUE (link
))
2633 if ((p
= compare_constant_1 (TREE_VALUE (link
), p
)) == 0)
2640 if (bcmp ((char *) &zero
, p
, sizeof zero
))
2646 if (TREE_PURPOSE (link
)
2647 && TREE_CODE (TREE_PURPOSE (link
)) == FIELD_DECL
)
2649 if (bcmp ((char *) &TREE_PURPOSE (link
), p
,
2650 sizeof TREE_PURPOSE (link
)))
2653 p
+= sizeof TREE_PURPOSE (link
);
2655 else if (TREE_PURPOSE (link
))
2657 if ((p
= compare_constant_1 (TREE_PURPOSE (link
), p
)) == 0)
2660 else if (have_purpose
)
2664 if (bcmp ((char *) &zero
, p
, sizeof zero
))
2676 struct addr_const value
;
2678 decode_addr_const (exp
, &value
);
2679 strp
= (char *) &value
.offset
;
2680 len
= sizeof value
.offset
;
2681 /* Compare the offset. */
2683 if (*p
++ != *strp
++)
2686 /* Compare symbol name. */
2687 strp
= XSTR (value
.base
, 0);
2688 len
= strlen (strp
) + 1;
2695 p
= compare_constant_1 (TREE_OPERAND (exp
, 0), p
);
2699 return compare_constant_1 (TREE_OPERAND (exp
, 1), p
);
2703 case NON_LVALUE_EXPR
:
2704 return compare_constant_1 (TREE_OPERAND (exp
, 0), p
);
2710 /* Compare constant contents. */
2712 if (*p
++ != *strp
++)
2718 /* Construct a constant descriptor for the expression EXP.
2719 It is up to the caller to enter the descriptor in the hash table. */
2721 static struct constant_descriptor
*
2722 record_constant (exp
)
2725 struct constant_descriptor
*next
= 0;
2729 /* Make a struct constant_descriptor. The first three pointers will
2730 be filled in later. Here we just leave space for them. */
2732 obstack_grow (&permanent_obstack
, (char *) &next
, sizeof next
);
2733 obstack_grow (&permanent_obstack
, (char *) &label
, sizeof label
);
2734 obstack_grow (&permanent_obstack
, (char *) &rtl
, sizeof rtl
);
2735 record_constant_1 (exp
);
2736 return (struct constant_descriptor
*) obstack_finish (&permanent_obstack
);
2739 /* Add a description of constant expression EXP
2740 to the object growing in `permanent_obstack'.
2741 No need to return its address; the caller will get that
2742 from the obstack when the object is complete. */
2745 record_constant_1 (exp
)
2748 register char *strp
;
2750 register enum tree_code code
= TREE_CODE (exp
);
2752 obstack_1grow (&permanent_obstack
, (unsigned int) code
);
2757 obstack_1grow (&permanent_obstack
, TYPE_PRECISION (TREE_TYPE (exp
)));
2758 strp
= (char *) &TREE_INT_CST_LOW (exp
);
2759 len
= 2 * sizeof TREE_INT_CST_LOW (exp
);
2763 obstack_1grow (&permanent_obstack
, TYPE_PRECISION (TREE_TYPE (exp
)));
2764 strp
= (char *) &TREE_REAL_CST (exp
);
2765 len
= sizeof TREE_REAL_CST (exp
);
2769 if (flag_writable_strings
)
2772 obstack_1grow (&permanent_obstack
, TYPE_MODE (TREE_TYPE (exp
)));
2773 strp
= TREE_STRING_POINTER (exp
);
2774 len
= TREE_STRING_LENGTH (exp
);
2775 obstack_grow (&permanent_obstack
, (char *) &TREE_STRING_LENGTH (exp
),
2776 sizeof TREE_STRING_LENGTH (exp
));
2780 record_constant_1 (TREE_REALPART (exp
));
2781 record_constant_1 (TREE_IMAGPART (exp
));
2785 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2787 int nbytes
= int_size_in_bytes (TREE_TYPE (exp
));
2788 obstack_grow (&permanent_obstack
, &nbytes
, sizeof (nbytes
));
2789 obstack_blank (&permanent_obstack
, nbytes
);
2790 get_set_constructor_bytes
2791 (exp
, (unsigned char *) permanent_obstack
.next_free
-nbytes
,
2798 int length
= list_length (CONSTRUCTOR_ELTS (exp
));
2799 enum machine_mode mode
= TYPE_MODE (TREE_TYPE (exp
));
2801 int have_purpose
= 0;
2803 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2804 if (TREE_PURPOSE (link
))
2807 obstack_grow (&permanent_obstack
, (char *) &length
, sizeof length
);
2809 /* For record constructors, insist that the types match.
2810 For arrays, just verify both constructors are for arrays
2811 of the same mode. Then insist that either both or none
2812 have any TREE_PURPOSE values. */
2813 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2814 type
= TREE_TYPE (exp
);
2818 obstack_grow (&permanent_obstack
, (char *) &type
, sizeof type
);
2819 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2820 obstack_grow (&permanent_obstack
, &mode
, sizeof mode
);
2822 obstack_grow (&permanent_obstack
, (char *) &have_purpose
,
2823 sizeof have_purpose
);
2825 /* For arrays, insist that the size in bytes match. */
2826 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2828 HOST_WIDE_INT size
= int_size_in_bytes (TREE_TYPE (exp
));
2829 obstack_grow (&permanent_obstack
, (char *) &size
, sizeof size
);
2832 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2834 if (TREE_VALUE (link
))
2835 record_constant_1 (TREE_VALUE (link
));
2840 obstack_grow (&permanent_obstack
,
2841 (char *) &zero
, sizeof zero
);
2844 if (TREE_PURPOSE (link
)
2845 && TREE_CODE (TREE_PURPOSE (link
)) == FIELD_DECL
)
2846 obstack_grow (&permanent_obstack
,
2847 (char *) &TREE_PURPOSE (link
),
2848 sizeof TREE_PURPOSE (link
));
2849 else if (TREE_PURPOSE (link
))
2850 record_constant_1 (TREE_PURPOSE (link
));
2851 else if (have_purpose
)
2855 obstack_grow (&permanent_obstack
,
2856 (char *) &zero
, sizeof zero
);
2864 struct addr_const value
;
2866 decode_addr_const (exp
, &value
);
2867 /* Record the offset. */
2868 obstack_grow (&permanent_obstack
,
2869 (char *) &value
.offset
, sizeof value
.offset
);
2871 switch (GET_CODE (value
.base
))
2874 /* Record the symbol name. */
2875 obstack_grow (&permanent_obstack
, XSTR (value
.base
, 0),
2876 strlen (XSTR (value
.base
, 0)) + 1);
2879 /* Record the address of the CODE_LABEL. It may not have
2880 been emitted yet, so it's UID may be zero. But pointer
2881 identity is good enough. */
2882 obstack_grow (&permanent_obstack
, &XEXP (value
.base
, 0),
2894 record_constant_1 (TREE_OPERAND (exp
, 0));
2895 record_constant_1 (TREE_OPERAND (exp
, 1));
2900 case NON_LVALUE_EXPR
:
2901 record_constant_1 (TREE_OPERAND (exp
, 0));
2908 /* Record constant contents. */
2909 obstack_grow (&permanent_obstack
, strp
, len
);
2912 /* Record a list of constant expressions that were passed to
2913 output_constant_def but that could not be output right away. */
2915 struct deferred_constant
2917 struct deferred_constant
*next
;
2923 static struct deferred_constant
*deferred_constants
;
2925 /* Another list of constants which should be output after the
2927 static struct deferred_constant
*after_function_constants
;
2929 /* Nonzero means defer output of addressed subconstants
2930 (i.e., those for which output_constant_def is called.) */
2931 static int defer_addressed_constants_flag
;
2933 /* Start deferring output of subconstants. */
2936 defer_addressed_constants ()
2938 defer_addressed_constants_flag
++;
2941 /* Stop deferring output of subconstants,
2942 and output now all those that have been deferred. */
2945 output_deferred_addressed_constants ()
2947 struct deferred_constant
*p
, *next
;
2949 defer_addressed_constants_flag
--;
2951 if (defer_addressed_constants_flag
> 0)
2954 for (p
= deferred_constants
; p
; p
= next
)
2956 output_constant_def_contents (p
->exp
, p
->reloc
, p
->labelno
);
2961 deferred_constants
= 0;
2964 /* Output any constants which should appear after a function. */
2967 output_after_function_constants ()
2969 struct deferred_constant
*p
, *next
;
2971 for (p
= after_function_constants
; p
; p
= next
)
2973 output_constant_def_contents (p
->exp
, p
->reloc
, p
->labelno
);
2978 after_function_constants
= 0;
2981 /* Make a copy of the whole tree structure for a constant.
2982 This handles the same types of nodes that compare_constant
2983 and record_constant handle. */
2989 switch (TREE_CODE (exp
))
2992 /* For ADDR_EXPR, we do not want to copy the decl whose address
2993 is requested. We do want to copy constants though. */
2994 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, 0))) == 'c')
2995 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2996 copy_constant (TREE_OPERAND (exp
, 0)));
2998 return copy_node (exp
);
3003 return copy_node (exp
);
3006 return build_complex (TREE_TYPE (exp
),
3007 copy_constant (TREE_REALPART (exp
)),
3008 copy_constant (TREE_IMAGPART (exp
)));
3012 return build (TREE_CODE (exp
), TREE_TYPE (exp
),
3013 copy_constant (TREE_OPERAND (exp
, 0)),
3014 copy_constant (TREE_OPERAND (exp
, 1)));
3018 case NON_LVALUE_EXPR
:
3019 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
3020 copy_constant (TREE_OPERAND (exp
, 0)));
3024 tree copy
= copy_node (exp
);
3025 tree list
= copy_list (CONSTRUCTOR_ELTS (exp
));
3028 CONSTRUCTOR_ELTS (copy
) = list
;
3029 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
3030 TREE_VALUE (tail
) = copy_constant (TREE_VALUE (tail
));
3031 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
3032 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
3033 TREE_PURPOSE (tail
) = copy_constant (TREE_PURPOSE (tail
));
3043 /* Return an rtx representing a reference to constant data in memory
3044 for the constant expression EXP.
3046 If assembler code for such a constant has already been output,
3047 return an rtx to refer to it.
3048 Otherwise, output such a constant in memory (or defer it for later)
3049 and generate an rtx for it.
3051 The TREE_CST_RTL of EXP is set up to point to that rtx.
3052 The const_hash_table records which constants already have label strings. */
3055 output_constant_def (exp
)
3059 register struct constant_descriptor
*desc
;
3064 if (TREE_CST_RTL (exp
))
3065 return TREE_CST_RTL (exp
);
3067 /* Make sure any other constants whose addresses appear in EXP
3068 are assigned label numbers. */
3070 reloc
= output_addressed_constants (exp
);
3072 /* Compute hash code of EXP. Search the descriptors for that hash code
3073 to see if any of them describes EXP. If yes, the descriptor records
3074 the label number already assigned. */
3076 hash
= const_hash (exp
) % MAX_HASH_TABLE
;
3078 for (desc
= const_hash_table
[hash
]; desc
; desc
= desc
->next
)
3079 if (compare_constant (exp
, desc
))
3084 /* No constant equal to EXP is known to have been output.
3085 Make a constant descriptor to enter EXP in the hash table.
3086 Assign the label number and record it in the descriptor for
3087 future calls to this function to find. */
3089 /* Create a string containing the label name, in LABEL. */
3090 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
3092 desc
= record_constant (exp
);
3093 desc
->next
= const_hash_table
[hash
];
3094 desc
->label
= ggc_alloc_string (label
, -1);
3095 const_hash_table
[hash
] = desc
;
3097 /* We have a symbol name; construct the SYMBOL_REF and the MEM
3098 in the permanent obstack. We could also construct this in the
3099 obstack of EXP and put it into TREE_CST_RTL, but we have no way
3100 of knowing what obstack it is (e.g., it might be in a function
3101 obstack of a function we are nested inside). */
3103 push_obstacks_nochange ();
3104 end_temporary_allocation ();
3107 = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp
)),
3108 gen_rtx_SYMBOL_REF (Pmode
, desc
->label
));
3110 RTX_UNCHANGING_P (desc
->rtl
) = 1;
3111 if (AGGREGATE_TYPE_P (TREE_TYPE (exp
)))
3112 MEM_SET_IN_STRUCT_P (desc
->rtl
, 1);
3119 TREE_CST_RTL (exp
) = desc
->rtl
;
3121 /* Optionally set flags or add text to the name to record information
3122 such as that it is a function name. If the name is changed, the macro
3123 ASM_OUTPUT_LABELREF will have to know how to strip this information. */
3124 #ifdef ENCODE_SECTION_INFO
3125 ENCODE_SECTION_INFO (exp
);
3128 /* If this is the first time we've seen this particular constant,
3129 output it (or defer its output for later). */
3132 int after_function
= 0;
3134 #ifdef CONSTANT_AFTER_FUNCTION_P
3135 if (current_function_decl
!= 0
3136 && CONSTANT_AFTER_FUNCTION_P (exp
))
3140 if (defer_addressed_constants_flag
|| after_function
)
3142 struct deferred_constant
*p
;
3143 p
= (struct deferred_constant
*) xmalloc (sizeof (struct deferred_constant
));
3145 push_obstacks_nochange ();
3146 suspend_momentary ();
3147 p
->exp
= copy_constant (exp
);
3150 p
->labelno
= const_labelno
++;
3153 p
->next
= after_function_constants
;
3154 after_function_constants
= p
;
3158 p
->next
= deferred_constants
;
3159 deferred_constants
= p
;
3164 /* Do no output if -fsyntax-only. */
3165 if (! flag_syntax_only
)
3166 output_constant_def_contents (exp
, reloc
, const_labelno
);
3171 return TREE_CST_RTL (exp
);
3174 /* Now output assembler code to define the label for EXP,
3175 and follow it with the data of EXP. */
3178 output_constant_def_contents (exp
, reloc
, labelno
)
3185 if (IN_NAMED_SECTION (exp
))
3186 named_section (exp
, NULL
, reloc
);
3189 /* First switch to text section, except for writable strings. */
3190 #ifdef SELECT_SECTION
3191 SELECT_SECTION (exp
, reloc
);
3193 if (((TREE_CODE (exp
) == STRING_CST
) && flag_writable_strings
)
3194 || (flag_pic
&& reloc
))
3197 readonly_data_section ();
3201 /* Align the location counter as required by EXP's data type. */
3202 align
= TYPE_ALIGN (TREE_TYPE (exp
));
3203 #ifdef CONSTANT_ALIGNMENT
3204 align
= CONSTANT_ALIGNMENT (exp
, align
);
3207 if (align
> BITS_PER_UNIT
)
3208 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
3210 /* Output the label itself. */
3211 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LC", labelno
);
3213 /* Output the value of EXP. */
3214 output_constant (exp
,
3215 (TREE_CODE (exp
) == STRING_CST
3216 ? TREE_STRING_LENGTH (exp
)
3217 : int_size_in_bytes (TREE_TYPE (exp
))));
3221 /* Structure to represent sufficient information about a constant so that
3222 it can be output when the constant pool is output, so that function
3223 integration can be done, and to simplify handling on machines that reference
3224 constant pool as base+displacement. */
3226 struct pool_constant
3228 struct constant_descriptor
*desc
;
3229 struct pool_constant
*next
;
3230 enum machine_mode mode
;
3238 /* Structure used to maintain hash table mapping symbols used to their
3239 corresponding constants. */
3244 struct pool_constant
*pool
;
3245 struct pool_sym
*next
;
3248 /* Hash code for a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true.
3249 The argument is XSTR (... , 0) */
3251 #define SYMHASH(LABEL) \
3252 ((((unsigned long) (LABEL)) & ((1 << HASHBITS) - 1)) % MAX_RTX_HASH_TABLE)
3254 /* Initialize constant pool hashing for a new function. */
3257 init_varasm_status (f
)
3260 struct varasm_status
*p
;
3261 p
= (struct varasm_status
*) xmalloc (sizeof (struct varasm_status
));
3263 p
->x_const_rtx_hash_table
3264 = ((struct constant_descriptor
**)
3265 xmalloc (MAX_RTX_HASH_TABLE
* sizeof (struct constant_descriptor
*)));
3266 p
->x_const_rtx_sym_hash_table
3267 = ((struct pool_sym
**)
3268 xmalloc (MAX_RTX_HASH_TABLE
* sizeof (struct pool_sym
*)));
3269 bzero ((char *) p
->x_const_rtx_hash_table
,
3270 MAX_RTX_HASH_TABLE
* sizeof (struct constant_descriptor
*));
3271 bzero ((char *) p
->x_const_rtx_sym_hash_table
,
3272 MAX_RTX_HASH_TABLE
* sizeof (struct pool_sym
*));
3274 p
->x_first_pool
= p
->x_last_pool
= 0;
3275 p
->x_pool_offset
= 0;
3276 p
->x_const_double_chain
= 0;
3279 /* Mark PC for GC. */
3282 mark_pool_constant (pc
)
3283 struct pool_constant
*pc
;
3287 ggc_mark_rtx (pc
->constant
);
3292 /* Mark PPS for GC. */
3295 mark_pool_sym_hash_table (pps
)
3296 struct pool_sym
**pps
;
3298 struct pool_sym
*ps
;
3301 for (i
= 0; i
< MAX_RTX_HASH_TABLE
; ++i
)
3302 for (ps
= pps
[i
]; ps
; ps
= ps
->next
)
3303 ggc_mark_string (ps
->label
);
3306 /* Mark P for GC. */
3309 mark_varasm_status (p
)
3310 struct varasm_status
*p
;
3315 mark_pool_constant (p
->x_first_pool
);
3316 mark_pool_sym_hash_table (p
->x_const_rtx_sym_hash_table
);
3317 ggc_mark_rtx (p
->x_const_double_chain
);
3320 /* Clear out all parts of the state in F that can safely be discarded
3321 after the function has been compiled, to let garbage collection
3322 reclaim the memory. */
3325 free_varasm_status (f
)
3328 struct varasm_status
*p
;
3331 free (p
->x_const_rtx_hash_table
);
3332 free (p
->x_const_rtx_sym_hash_table
);
3337 enum kind
{ RTX_DOUBLE
, RTX_INT
};
3341 #ifdef ONLY_INT_FIELDS
3342 unsigned int kind
: 16;
3343 unsigned int mode
: 16;
3345 enum kind kind
: 16;
3346 enum machine_mode mode
: 16;
3349 union real_extract du
;
3350 struct addr_const addr
;
3351 struct {HOST_WIDE_INT high
, low
;} di
;
3355 /* Express an rtx for a constant integer (perhaps symbolic)
3356 as the sum of a symbol or label plus an explicit integer.
3357 They are stored into VALUE. */
3360 decode_rtx_const (mode
, x
, value
)
3361 enum machine_mode mode
;
3363 struct rtx_const
*value
;
3365 /* Clear the whole structure, including any gaps. */
3368 int *p
= (int *) value
;
3369 int *end
= (int *) (value
+ 1);
3374 value
->kind
= RTX_INT
; /* Most usual kind. */
3377 switch (GET_CODE (x
))
3380 value
->kind
= RTX_DOUBLE
;
3381 if (GET_MODE (x
) != VOIDmode
)
3383 value
->mode
= GET_MODE (x
);
3384 bcopy ((char *) &CONST_DOUBLE_LOW (x
),
3385 (char *) &value
->un
.du
, sizeof value
->un
.du
);
3389 value
->un
.di
.low
= CONST_DOUBLE_LOW (x
);
3390 value
->un
.di
.high
= CONST_DOUBLE_HIGH (x
);
3395 value
->un
.addr
.offset
= INTVAL (x
);
3401 value
->un
.addr
.base
= x
;
3406 if (GET_CODE (x
) == PLUS
)
3408 value
->un
.addr
.base
= XEXP (x
, 0);
3409 if (GET_CODE (XEXP (x
, 1)) != CONST_INT
)
3411 value
->un
.addr
.offset
= INTVAL (XEXP (x
, 1));
3413 else if (GET_CODE (x
) == MINUS
)
3415 value
->un
.addr
.base
= XEXP (x
, 0);
3416 if (GET_CODE (XEXP (x
, 1)) != CONST_INT
)
3418 value
->un
.addr
.offset
= - INTVAL (XEXP (x
, 1));
3428 if (value
->kind
== RTX_INT
&& value
->un
.addr
.base
!= 0)
3429 switch (GET_CODE (value
->un
.addr
.base
))
3432 /* Use the string's address, not the SYMBOL_REF's address,
3433 for the sake of addresses of library routines. */
3434 value
->un
.addr
.base
= (rtx
) XSTR (value
->un
.addr
.base
, 0);
3438 /* For a LABEL_REF, compare labels. */
3439 value
->un
.addr
.base
= XEXP (value
->un
.addr
.base
, 0);
3446 /* Given a MINUS expression, simplify it if both sides
3447 include the same symbol. */
3450 simplify_subtraction (x
)
3453 struct rtx_const val0
, val1
;
3455 decode_rtx_const (GET_MODE (x
), XEXP (x
, 0), &val0
);
3456 decode_rtx_const (GET_MODE (x
), XEXP (x
, 1), &val1
);
3458 if (val0
.un
.addr
.base
== val1
.un
.addr
.base
)
3459 return GEN_INT (val0
.un
.addr
.offset
- val1
.un
.addr
.offset
);
3463 /* Compute a hash code for a constant RTL expression. */
3466 const_hash_rtx (mode
, x
)
3467 enum machine_mode mode
;
3473 struct rtx_const value
;
3474 decode_rtx_const (mode
, x
, &value
);
3476 /* Compute hashing function */
3478 for (i
= 0; i
< sizeof value
/ sizeof (int); i
++)
3479 hi
+= ((int *) &value
)[i
];
3481 hi
&= (1 << HASHBITS
) - 1;
3482 hi
%= MAX_RTX_HASH_TABLE
;
3486 /* Compare a constant rtl object X with a constant-descriptor DESC.
3487 Return 1 if DESC describes a constant with the same value as X. */
3490 compare_constant_rtx (mode
, x
, desc
)
3491 enum machine_mode mode
;
3493 struct constant_descriptor
*desc
;
3495 register int *p
= (int *) desc
->contents
;
3498 struct rtx_const value
;
3500 decode_rtx_const (mode
, x
, &value
);
3501 strp
= (int *) &value
;
3502 len
= sizeof value
/ sizeof (int);
3504 /* Compare constant contents. */
3506 if (*p
++ != *strp
++)
3512 /* Construct a constant descriptor for the rtl-expression X.
3513 It is up to the caller to enter the descriptor in the hash table. */
3515 static struct constant_descriptor
*
3516 record_constant_rtx (mode
, x
)
3517 enum machine_mode mode
;
3520 struct constant_descriptor
*ptr
;
3523 struct rtx_const value
;
3525 decode_rtx_const (mode
, x
, &value
);
3527 /* Put these things in the saveable obstack so we can ensure it won't
3528 be freed if we are called from combine or some other phase that discards
3529 memory allocated from function_obstack (current_obstack). */
3530 obstack_grow (saveable_obstack
, &ptr
, sizeof ptr
);
3531 obstack_grow (saveable_obstack
, &label
, sizeof label
);
3532 obstack_grow (saveable_obstack
, &rtl
, sizeof rtl
);
3534 /* Record constant contents. */
3535 obstack_grow (saveable_obstack
, &value
, sizeof value
);
3537 return (struct constant_descriptor
*) obstack_finish (saveable_obstack
);
3540 /* Given a constant rtx X, make (or find) a memory constant for its value
3541 and return a MEM rtx to refer to it in memory. */
3544 force_const_mem (mode
, x
)
3545 enum machine_mode mode
;
3549 register struct constant_descriptor
*desc
;
3554 /* If we want this CONST_DOUBLE in the same mode as it is in memory
3555 (this will always be true for floating CONST_DOUBLEs that have been
3556 placed in memory, but not for VOIDmode (integer) CONST_DOUBLEs),
3557 use the previous copy. Otherwise, make a new one. Note that in
3558 the unlikely event that this same CONST_DOUBLE is used in two different
3559 modes in an alternating fashion, we will allocate a lot of different
3560 memory locations, but this should be extremely rare. */
3562 if (GET_CODE (x
) == CONST_DOUBLE
3563 && GET_CODE (CONST_DOUBLE_MEM (x
)) == MEM
3564 && GET_MODE (CONST_DOUBLE_MEM (x
)) == mode
)
3565 return CONST_DOUBLE_MEM (x
);
3567 /* Compute hash code of X. Search the descriptors for that hash code
3568 to see if any of them describes X. If yes, the descriptor records
3569 the label number already assigned. */
3571 hash
= const_hash_rtx (mode
, x
);
3573 for (desc
= const_rtx_hash_table
[hash
]; desc
; desc
= desc
->next
)
3574 if (compare_constant_rtx (mode
, x
, desc
))
3576 found
= desc
->label
;
3582 register struct pool_constant
*pool
;
3583 register struct pool_sym
*sym
;
3586 /* No constant equal to X is known to have been output.
3587 Make a constant descriptor to enter X in the hash table.
3588 Assign the label number and record it in the descriptor for
3589 future calls to this function to find. */
3591 desc
= record_constant_rtx (mode
, x
);
3592 desc
->next
= const_rtx_hash_table
[hash
];
3593 const_rtx_hash_table
[hash
] = desc
;
3595 /* Align the location counter as required by EXP's data type. */
3596 align
= (mode
== VOIDmode
) ? UNITS_PER_WORD
: GET_MODE_SIZE (mode
);
3597 if (align
> BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
3598 align
= BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
;
3599 #ifdef CONSTANT_ALIGNMENT
3600 align
= CONSTANT_ALIGNMENT (make_tree (type_for_mode (mode
, 0), x
),
3601 align
* BITS_PER_UNIT
) / BITS_PER_UNIT
;
3604 pool_offset
+= align
- 1;
3605 pool_offset
&= ~ (align
- 1);
3607 /* If RTL is not being placed into the saveable obstack, make a
3608 copy of X that is in the saveable obstack in case we are
3609 being called from combine or some other phase that discards
3610 memory it allocates. We used to only do this if it is a
3611 CONST; however, reload can allocate a CONST_INT when
3612 eliminating registers. */
3613 if (rtl_obstack
!= saveable_obstack
3614 && (GET_CODE (x
) == CONST
|| GET_CODE (x
) == CONST_INT
))
3616 push_obstacks_nochange ();
3617 rtl_in_saveable_obstack ();
3619 if (GET_CODE (x
) == CONST
)
3620 x
= gen_rtx_CONST (GET_MODE (x
),
3621 gen_rtx_PLUS (GET_MODE (x
),
3622 XEXP (XEXP (x
, 0), 0),
3623 XEXP (XEXP (x
, 0), 1)));
3625 x
= GEN_INT (INTVAL (x
));
3630 /* Allocate a pool constant descriptor, fill it in, and chain it in. */
3632 pool
= (struct pool_constant
*) savealloc (sizeof (struct pool_constant
));
3636 pool
->labelno
= const_labelno
;
3637 pool
->align
= align
;
3638 pool
->offset
= pool_offset
;
3645 last_pool
->next
= pool
;
3648 pool_offset
+= GET_MODE_SIZE (mode
);
3650 /* Create a string containing the label name, in LABEL. */
3651 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
3655 desc
->label
= found
= ggc_alloc_string (label
, -1);
3657 /* Add label to symbol hash table. */
3658 hash
= SYMHASH (found
);
3659 sym
= (struct pool_sym
*) savealloc (sizeof (struct pool_sym
));
3662 sym
->next
= const_rtx_sym_hash_table
[hash
];
3663 const_rtx_sym_hash_table
[hash
] = sym
;
3666 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
3668 def
= gen_rtx_MEM (mode
, gen_rtx_SYMBOL_REF (Pmode
, found
));
3670 RTX_UNCHANGING_P (def
) = 1;
3671 /* Mark the symbol_ref as belonging to this constants pool. */
3672 CONSTANT_POOL_ADDRESS_P (XEXP (def
, 0)) = 1;
3673 current_function_uses_const_pool
= 1;
3675 if (GET_CODE (x
) == CONST_DOUBLE
)
3677 if (CONST_DOUBLE_MEM (x
) == cc0_rtx
)
3679 CONST_DOUBLE_CHAIN (x
) = const_double_chain
;
3680 const_double_chain
= x
;
3682 CONST_DOUBLE_MEM (x
) = def
;
3688 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
3689 the corresponding pool_constant structure. */
3691 static struct pool_constant
*
3692 find_pool_constant (f
, addr
)
3696 struct pool_sym
*sym
;
3697 const char *label
= XSTR (addr
, 0);
3699 for (sym
= f
->varasm
->x_const_rtx_sym_hash_table
[SYMHASH (label
)]; sym
;
3701 if (sym
->label
== label
)
3707 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
3710 get_pool_constant (addr
)
3713 return (find_pool_constant (cfun
, addr
))->constant
;
3716 /* Likewise, but for the constant pool of a specific function. */
3719 get_pool_constant_for_function (f
, addr
)
3723 return (find_pool_constant (f
, addr
))->constant
;
3726 /* Similar, return the mode. */
3729 get_pool_mode (addr
)
3732 return (find_pool_constant (cfun
, addr
))->mode
;
3736 get_pool_mode_for_function (f
, addr
)
3740 return (find_pool_constant (f
, addr
))->mode
;
3743 /* Similar, return the offset in the constant pool. */
3746 get_pool_offset (addr
)
3749 return (find_pool_constant (cfun
, addr
))->offset
;
3752 /* Return the size of the constant pool. */
3760 /* Write all the constants in the constant pool. */
3763 output_constant_pool (fnname
, fndecl
)
3764 const char *fnname ATTRIBUTE_UNUSED
;
3765 tree fndecl ATTRIBUTE_UNUSED
;
3767 struct pool_constant
*pool
;
3769 union real_extract u
;
3771 /* It is possible for gcc to call force_const_mem and then to later
3772 discard the instructions which refer to the constant. In such a
3773 case we do not need to output the constant. */
3774 mark_constant_pool ();
3776 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3777 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3780 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3787 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3788 whose CODE_LABEL has been deleted. This can occur if a jump table
3789 is eliminated by optimization. If so, write a constant of zero
3790 instead. Note that this can also happen by turning the
3791 CODE_LABEL into a NOTE. */
3792 if (((GET_CODE (x
) == LABEL_REF
3793 && (INSN_DELETED_P (XEXP (x
, 0))
3794 || GET_CODE (XEXP (x
, 0)) == NOTE
)))
3795 || (GET_CODE (x
) == CONST
&& GET_CODE (XEXP (x
, 0)) == PLUS
3796 && GET_CODE (XEXP (XEXP (x
, 0), 0)) == LABEL_REF
3797 && (INSN_DELETED_P (XEXP (XEXP (XEXP (x
, 0), 0), 0))
3798 || GET_CODE (XEXP (XEXP (XEXP (x
, 0), 0), 0)) == NOTE
)))
3801 /* First switch to correct section. */
3802 #ifdef SELECT_RTX_SECTION
3803 SELECT_RTX_SECTION (pool
->mode
, x
);
3805 readonly_data_section ();
3808 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3809 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file
, x
, pool
->mode
,
3810 pool
->align
, pool
->labelno
, done
);
3813 if (pool
->align
> 1)
3814 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (pool
->align
));
3816 /* Output the label. */
3817 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LC", pool
->labelno
);
3819 /* Output the value of the constant itself. */
3820 switch (GET_MODE_CLASS (pool
->mode
))
3823 if (GET_CODE (x
) != CONST_DOUBLE
)
3826 bcopy ((char *) &CONST_DOUBLE_LOW (x
), (char *) &u
, sizeof u
);
3827 assemble_real (u
.d
, pool
->mode
);
3831 case MODE_PARTIAL_INT
:
3832 assemble_integer (x
, GET_MODE_SIZE (pool
->mode
), 1);
3839 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3845 #ifdef ASM_OUTPUT_POOL_EPILOGUE
3846 ASM_OUTPUT_POOL_EPILOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3849 /* Done with this pool. */
3850 first_pool
= last_pool
= 0;
3853 /* Look through the instructions for this function, and mark all the
3854 entries in the constant pool which are actually being used. */
3857 mark_constant_pool ()
3860 struct pool_constant
*pool
;
3862 if (first_pool
== 0)
3865 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3868 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
3869 if (GET_RTX_CLASS (GET_CODE (insn
)) == 'i')
3870 mark_constants (PATTERN (insn
));
3872 for (insn
= current_function_epilogue_delay_list
;
3874 insn
= XEXP (insn
, 1))
3875 if (GET_RTX_CLASS (GET_CODE (insn
)) == 'i')
3876 mark_constants (PATTERN (insn
));
3878 /* It's possible that the only reference to a symbol is in a symbol
3879 that's in the constant pool. This happens in Fortran under some
3880 situations. (When the constant contains the address of another
3881 constant, and only the first is used directly in an insn.)
3882 This is potentially suboptimal if there's ever a possibility of
3883 backwards (in pool order) 2'd level references. However, it's
3884 not clear that 2'd level references can happen. */
3885 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3887 struct pool_sym
*sym
;
3890 /* skip unmarked entries; no insn refers to them. */
3894 /* Skip everything except SYMBOL_REFs. */
3895 if (GET_CODE (pool
->constant
) != SYMBOL_REF
)
3897 label
= XSTR (pool
->constant
, 0);
3899 /* Be sure the symbol's value is marked. */
3900 for (sym
= const_rtx_sym_hash_table
[SYMHASH (label
)]; sym
;
3902 if (sym
->label
== label
)
3903 sym
->pool
->mark
= 1;
3904 /* If we didn't find it, there's something truly wrong here, but it
3905 will be announced by the assembler. */
3914 register const char *format_ptr
;
3919 if (GET_CODE (x
) == SYMBOL_REF
)
3921 if (CONSTANT_POOL_ADDRESS_P (x
))
3922 find_pool_constant (cfun
, x
)->mark
= 1;
3925 /* Never search inside a CONST_DOUBLE, because CONST_DOUBLE_MEM may be
3926 a MEM, but does not constitute a use of that MEM. */
3927 else if (GET_CODE (x
) == CONST_DOUBLE
)
3930 /* Insns may appear inside a SEQUENCE. Only check the patterns of
3931 insns, not any notes that may be attached. We don't want to mark
3932 a constant just because it happens to appear in a REG_EQUIV note. */
3933 if (GET_RTX_CLASS (GET_CODE (x
)) == 'i')
3935 mark_constants (PATTERN (x
));
3939 format_ptr
= GET_RTX_FORMAT (GET_CODE (x
));
3941 for (i
= 0; i
< GET_RTX_LENGTH (GET_CODE (x
)); i
++)
3943 switch (*format_ptr
++)
3946 mark_constants (XEXP (x
, i
));
3950 if (XVEC (x
, i
) != 0)
3954 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
3955 mark_constants (XVECEXP (x
, i
, j
));
3974 /* Find all the constants whose addresses are referenced inside of EXP,
3975 and make sure assembler code with a label has been output for each one.
3976 Indicate whether an ADDR_EXPR has been encountered. */
3979 output_addressed_constants (exp
)
3984 switch (TREE_CODE (exp
))
3988 register tree constant
= TREE_OPERAND (exp
, 0);
3990 while (TREE_CODE (constant
) == COMPONENT_REF
)
3992 constant
= TREE_OPERAND (constant
, 0);
3995 if (TREE_CODE_CLASS (TREE_CODE (constant
)) == 'c'
3996 || TREE_CODE (constant
) == CONSTRUCTOR
)
3997 /* No need to do anything here
3998 for addresses of variables or functions. */
3999 output_constant_def (constant
);
4006 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
4007 reloc
|= output_addressed_constants (TREE_OPERAND (exp
, 1));
4012 case NON_LVALUE_EXPR
:
4013 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
4019 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
4020 if (TREE_VALUE (link
) != 0)
4021 reloc
|= output_addressed_constants (TREE_VALUE (link
));
4031 /* Return nonzero if VALUE is a valid constant-valued expression
4032 for use in initializing a static variable; one that can be an
4033 element of a "constant" initializer.
4035 Return null_pointer_node if the value is absolute;
4036 if it is relocatable, return the variable that determines the relocation.
4037 We assume that VALUE has been folded as much as possible;
4038 therefore, we do not need to check for such things as
4039 arithmetic-combinations of integers. */
4042 initializer_constant_valid_p (value
, endtype
)
4046 /* Give the front-end a chance to convert VALUE to something that
4047 looks more like a constant to the back-end. */
4048 if (lang_expand_constant
)
4049 value
= (*lang_expand_constant
) (value
);
4051 switch (TREE_CODE (value
))
4054 if ((TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
4055 || TREE_CODE (TREE_TYPE (value
)) == RECORD_TYPE
)
4056 && TREE_CONSTANT (value
)
4057 && CONSTRUCTOR_ELTS (value
))
4059 initializer_constant_valid_p (TREE_VALUE (CONSTRUCTOR_ELTS (value
)),
4062 return TREE_STATIC (value
) ? null_pointer_node
: 0;
4068 return null_pointer_node
;
4071 return staticp (TREE_OPERAND (value
, 0)) ? TREE_OPERAND (value
, 0) : 0;
4073 case NON_LVALUE_EXPR
:
4074 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
4078 /* Allow conversions between pointer types. */
4079 if (POINTER_TYPE_P (TREE_TYPE (value
))
4080 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
4081 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
4083 /* Allow conversions between real types. */
4084 if (FLOAT_TYPE_P (TREE_TYPE (value
))
4085 && FLOAT_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
4086 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
4088 /* Allow length-preserving conversions between integer types. */
4089 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
4090 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
4091 && (TYPE_PRECISION (TREE_TYPE (value
))
4092 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
4093 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
4095 /* Allow conversions between other integer types only if
4097 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
4098 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
4100 tree inner
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4102 if (inner
== null_pointer_node
)
4103 return null_pointer_node
;
4107 /* Allow (int) &foo provided int is as wide as a pointer. */
4108 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
4109 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
4110 && (TYPE_PRECISION (TREE_TYPE (value
))
4111 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
4112 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4115 /* Likewise conversions from int to pointers, but also allow
4116 conversions from 0. */
4117 if (POINTER_TYPE_P (TREE_TYPE (value
))
4118 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
4120 if (integer_zerop (TREE_OPERAND (value
, 0)))
4121 return null_pointer_node
;
4122 else if (TYPE_PRECISION (TREE_TYPE (value
))
4123 <= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0))))
4124 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4128 /* Allow conversions to union types if the value inside is okay. */
4129 if (TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
)
4130 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4135 if (! INTEGRAL_TYPE_P (endtype
)
4136 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
4138 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4140 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
4142 /* If either term is absolute, use the other terms relocation. */
4143 if (valid0
== null_pointer_node
)
4145 if (valid1
== null_pointer_node
)
4151 if (! INTEGRAL_TYPE_P (endtype
)
4152 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
4154 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4156 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
4158 /* Win if second argument is absolute. */
4159 if (valid1
== null_pointer_node
)
4161 /* Win if both arguments have the same relocation.
4162 Then the value is absolute. */
4163 if (valid0
== valid1
&& valid0
!= 0)
4164 return null_pointer_node
;
4167 /* Support differences between labels. */
4168 if (INTEGRAL_TYPE_P (endtype
))
4171 op0
= TREE_OPERAND (value
, 0);
4172 op1
= TREE_OPERAND (value
, 1);
4176 if (TREE_CODE (op0
) == ADDR_EXPR
4177 && TREE_CODE (TREE_OPERAND (op0
, 0)) == LABEL_DECL
4178 && TREE_CODE (op1
) == ADDR_EXPR
4179 && TREE_CODE (TREE_OPERAND (op1
, 0)) == LABEL_DECL
)
4180 return null_pointer_node
;
4191 /* Output assembler code for constant EXP to FILE, with no label.
4192 This includes the pseudo-op such as ".int" or ".byte", and a newline.
4193 Assumes output_addressed_constants has been done on EXP already.
4195 Generate exactly SIZE bytes of assembler data, padding at the end
4196 with zeros if necessary. SIZE must always be specified.
4198 SIZE is important for structure constructors,
4199 since trailing members may have been omitted from the constructor.
4200 It is also important for initialization of arrays from string constants
4201 since the full length of the string constant might not be wanted.
4202 It is also needed for initialization of unions, where the initializer's
4203 type is just one member, and that may not be as long as the union.
4205 There a case in which we would fail to output exactly SIZE bytes:
4206 for a structure constructor that wants to produce more than SIZE bytes.
4207 But such constructors will never be generated for any possible input. */
4210 output_constant (exp
, size
)
4214 register enum tree_code code
= TREE_CODE (TREE_TYPE (exp
));
4216 /* Some front-ends use constants other than the standard
4217 language-indepdent varieties, but which may still be output
4218 directly. Give the front-end a chance to convert EXP to a
4219 language-independent representation. */
4220 if (lang_expand_constant
)
4221 exp
= (*lang_expand_constant
) (exp
);
4223 if (size
== 0 || flag_syntax_only
)
4226 /* Eliminate the NON_LVALUE_EXPR_EXPR that makes a cast not be an lvalue.
4227 That way we get the constant (we hope) inside it. Also, strip off any
4228 NOP_EXPR that converts between two record, union, array, or set types
4229 or a CONVERT_EXPR that converts to a union TYPE. */
4230 while ((TREE_CODE (exp
) == NOP_EXPR
4231 && (TREE_TYPE (exp
) == TREE_TYPE (TREE_OPERAND (exp
, 0))
4232 || AGGREGATE_TYPE_P (TREE_TYPE (exp
))))
4233 || (TREE_CODE (exp
) == CONVERT_EXPR
4234 && code
== UNION_TYPE
)
4235 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
4237 exp
= TREE_OPERAND (exp
, 0);
4238 code
= TREE_CODE (TREE_TYPE (exp
));
4241 /* Allow a constructor with no elements for any data type.
4242 This means to fill the space with zeros. */
4243 if (TREE_CODE (exp
) == CONSTRUCTOR
&& CONSTRUCTOR_ELTS (exp
) == 0)
4245 assemble_zeros (size
);
4256 case REFERENCE_TYPE
:
4257 /* ??? What about (int)((float)(int)&foo + 4) */
4258 while (TREE_CODE (exp
) == NOP_EXPR
|| TREE_CODE (exp
) == CONVERT_EXPR
4259 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
4260 exp
= TREE_OPERAND (exp
, 0);
4262 if (! assemble_integer (expand_expr (exp
, NULL_RTX
, VOIDmode
,
4263 EXPAND_INITIALIZER
),
4265 error ("initializer for integer value is too complicated");
4270 if (TREE_CODE (exp
) != REAL_CST
)
4271 error ("initializer for floating value is not a floating constant");
4273 assemble_real (TREE_REAL_CST (exp
),
4274 mode_for_size (size
* BITS_PER_UNIT
, MODE_FLOAT
, 0));
4279 output_constant (TREE_REALPART (exp
), size
/ 2);
4280 output_constant (TREE_IMAGPART (exp
), size
/ 2);
4281 size
-= (size
/ 2) * 2;
4285 if (TREE_CODE (exp
) == CONSTRUCTOR
)
4287 output_constructor (exp
, size
);
4290 else if (TREE_CODE (exp
) == STRING_CST
)
4294 if (size
> TREE_STRING_LENGTH (exp
))
4296 excess
= size
- TREE_STRING_LENGTH (exp
);
4297 size
= TREE_STRING_LENGTH (exp
);
4300 assemble_string (TREE_STRING_POINTER (exp
), size
);
4309 if (TREE_CODE (exp
) == CONSTRUCTOR
)
4310 output_constructor (exp
, size
);
4316 if (TREE_CODE (exp
) == INTEGER_CST
)
4317 assemble_integer (expand_expr (exp
, NULL_RTX
,
4318 VOIDmode
, EXPAND_INITIALIZER
),
4320 else if (TREE_CODE (exp
) == CONSTRUCTOR
)
4322 unsigned char *buffer
= (unsigned char *) alloca (size
);
4323 if (get_set_constructor_bytes (exp
, buffer
, size
))
4325 assemble_string ((char *) buffer
, size
);
4328 error ("unknown set constructor type");
4336 assemble_zeros (size
);
4340 /* Subroutine of output_constant, used for CONSTRUCTORs
4341 (aggregate constants).
4342 Generate at least SIZE bytes, padding if necessary. */
4345 output_constructor (exp
, size
)
4349 register tree link
, field
= 0;
4350 HOST_WIDE_INT min_index
= 0;
4351 /* Number of bytes output or skipped so far.
4352 In other words, current position within the constructor. */
4353 int total_bytes
= 0;
4354 /* Non-zero means BYTE contains part of a byte, to be output. */
4355 int byte_buffer_in_use
= 0;
4356 register int byte
= 0;
4358 if (HOST_BITS_PER_WIDE_INT
< BITS_PER_UNIT
)
4361 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
4362 field
= TYPE_FIELDS (TREE_TYPE (exp
));
4364 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
4365 && TYPE_DOMAIN (TREE_TYPE (exp
)) != 0)
4367 = TREE_INT_CST_LOW (TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (exp
))));
4369 /* As LINK goes through the elements of the constant,
4370 FIELD goes through the structure fields, if the constant is a structure.
4371 if the constant is a union, then we override this,
4372 by getting the field from the TREE_LIST element.
4373 But the constant could also be an array. Then FIELD is zero.
4375 There is always a maximum of one element in the chain LINK for unions
4376 (even if the initializer in a source program incorrectly contains
4378 for (link
= CONSTRUCTOR_ELTS (exp
);
4380 link
= TREE_CHAIN (link
),
4381 field
= field
? TREE_CHAIN (field
) : 0)
4383 tree val
= TREE_VALUE (link
);
4386 /* the element in a union constructor specifies the proper field. */
4388 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
4389 || TREE_CODE (TREE_TYPE (exp
)) == UNION_TYPE
)
4391 /* if available, use the type given by link */
4392 if (TREE_PURPOSE (link
) != 0)
4393 field
= TREE_PURPOSE (link
);
4396 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
4397 index
= TREE_PURPOSE (link
);
4399 /* Eliminate the marker that makes a cast not be an lvalue. */
4403 if (index
&& TREE_CODE (index
) == RANGE_EXPR
)
4405 register int fieldsize
4406 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (exp
)));
4407 HOST_WIDE_INT lo_index
= TREE_INT_CST_LOW (TREE_OPERAND (index
, 0));
4408 HOST_WIDE_INT hi_index
= TREE_INT_CST_LOW (TREE_OPERAND (index
, 1));
4409 HOST_WIDE_INT index
;
4410 for (index
= lo_index
; index
<= hi_index
; index
++)
4412 /* Output the element's initial value. */
4414 assemble_zeros (fieldsize
);
4416 output_constant (val
, fieldsize
);
4418 /* Count its size. */
4419 total_bytes
+= fieldsize
;
4422 else if (field
== 0 || !DECL_BIT_FIELD (field
))
4424 /* An element that is not a bit-field. */
4426 register int fieldsize
;
4427 /* Since this structure is static,
4428 we know the positions are constant. */
4429 HOST_WIDE_INT bitpos
= field
? int_byte_position (field
) : 0;
4433 = (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (val
)), 1)
4434 * (tree_low_cst (index
, 0) - min_index
));
4436 /* Output any buffered-up bit-fields preceding this element. */
4437 if (byte_buffer_in_use
)
4439 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4441 byte_buffer_in_use
= 0;
4444 /* Advance to offset of this element.
4445 Note no alignment needed in an array, since that is guaranteed
4446 if each element has the proper size. */
4447 if ((field
!= 0 || index
!= 0) && bitpos
!= total_bytes
)
4449 assemble_zeros (bitpos
- total_bytes
);
4450 total_bytes
= bitpos
;
4453 /* Determine size this element should occupy. */
4456 if (TREE_CODE (DECL_SIZE_UNIT (field
)) != INTEGER_CST
)
4459 fieldsize
= TREE_INT_CST_LOW (DECL_SIZE_UNIT (field
));
4462 fieldsize
= int_size_in_bytes (TREE_TYPE (TREE_TYPE (exp
)));
4464 /* Output the element's initial value. */
4466 assemble_zeros (fieldsize
);
4468 output_constant (val
, fieldsize
);
4470 /* Count its size. */
4471 total_bytes
+= fieldsize
;
4473 else if (val
!= 0 && TREE_CODE (val
) != INTEGER_CST
)
4474 error ("invalid initial value for member `%s'",
4475 IDENTIFIER_POINTER (DECL_NAME (field
)));
4478 /* Element that is a bit-field. */
4480 HOST_WIDE_INT next_offset
= int_bit_position (field
);
4481 HOST_WIDE_INT end_offset
4482 = (next_offset
+ tree_low_cst (DECL_SIZE (field
), 1));
4485 val
= integer_zero_node
;
4487 /* If this field does not start in this (or, next) byte,
4489 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4491 /* Output remnant of any bit field in previous bytes. */
4492 if (byte_buffer_in_use
)
4494 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4496 byte_buffer_in_use
= 0;
4499 /* If still not at proper byte, advance to there. */
4500 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4502 assemble_zeros (next_offset
/ BITS_PER_UNIT
- total_bytes
);
4503 total_bytes
= next_offset
/ BITS_PER_UNIT
;
4507 if (! byte_buffer_in_use
)
4510 /* We must split the element into pieces that fall within
4511 separate bytes, and combine each byte with previous or
4512 following bit-fields. */
4514 /* next_offset is the offset n fbits from the beginning of
4515 the structure to the next bit of this element to be processed.
4516 end_offset is the offset of the first bit past the end of
4518 while (next_offset
< end_offset
)
4522 HOST_WIDE_INT value
;
4523 int next_byte
= next_offset
/ BITS_PER_UNIT
;
4524 int next_bit
= next_offset
% BITS_PER_UNIT
;
4526 /* Advance from byte to byte
4527 within this element when necessary. */
4528 while (next_byte
!= total_bytes
)
4530 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4535 /* Number of bits we can process at once
4536 (all part of the same byte). */
4537 this_time
= MIN (end_offset
- next_offset
,
4538 BITS_PER_UNIT
- next_bit
);
4539 if (BYTES_BIG_ENDIAN
)
4541 /* On big-endian machine, take the most significant bits
4542 first (of the bits that are significant)
4543 and put them into bytes from the most significant end. */
4544 shift
= end_offset
- next_offset
- this_time
;
4545 /* Don't try to take a bunch of bits that cross
4546 the word boundary in the INTEGER_CST. We can
4547 only select bits from the LOW or HIGH part
4549 if (shift
< HOST_BITS_PER_WIDE_INT
4550 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4552 this_time
= shift
+ this_time
- HOST_BITS_PER_WIDE_INT
;
4553 shift
= HOST_BITS_PER_WIDE_INT
;
4556 /* Now get the bits from the appropriate constant word. */
4557 if (shift
< HOST_BITS_PER_WIDE_INT
)
4559 value
= TREE_INT_CST_LOW (val
);
4561 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4563 value
= TREE_INT_CST_HIGH (val
);
4564 shift
-= HOST_BITS_PER_WIDE_INT
;
4568 /* Get the result. This works only when:
4569 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4570 byte
|= (((value
>> shift
)
4571 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4572 << (BITS_PER_UNIT
- this_time
- next_bit
));
4576 /* On little-endian machines,
4577 take first the least significant bits of the value
4578 and pack them starting at the least significant
4579 bits of the bytes. */
4580 shift
= next_offset
- int_bit_position (field
);
4582 /* Don't try to take a bunch of bits that cross
4583 the word boundary in the INTEGER_CST. We can
4584 only select bits from the LOW or HIGH part
4586 if (shift
< HOST_BITS_PER_WIDE_INT
4587 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4588 this_time
= (HOST_BITS_PER_WIDE_INT
- shift
);
4590 /* Now get the bits from the appropriate constant word. */
4591 if (shift
< HOST_BITS_PER_WIDE_INT
)
4592 value
= TREE_INT_CST_LOW (val
);
4593 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4595 value
= TREE_INT_CST_HIGH (val
);
4596 shift
-= HOST_BITS_PER_WIDE_INT
;
4601 /* Get the result. This works only when:
4602 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4603 byte
|= (((value
>> shift
)
4604 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4607 next_offset
+= this_time
;
4608 byte_buffer_in_use
= 1;
4612 if (byte_buffer_in_use
)
4614 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4617 if (total_bytes
< size
)
4618 assemble_zeros (size
- total_bytes
);
4621 #ifdef HANDLE_PRAGMA_WEAK
4622 /* Add function NAME to the weak symbols list. VALUE is a weak alias
4623 associatd with NAME. */
4626 add_weak (name
, value
)
4630 struct weak_syms
*weak
;
4632 weak
= (struct weak_syms
*) permalloc (sizeof (struct weak_syms
));
4637 weak
->next
= weak_decls
;
4639 weak
->value
= value
;
4644 #endif /* HANDLE_PRAGMA_WEAK */
4646 /* Declare DECL to be a weak symbol. */
4652 if (! TREE_PUBLIC (decl
))
4653 error_with_decl (decl
, "weak declaration of `%s' must be public");
4654 else if (TREE_ASM_WRITTEN (decl
))
4655 error_with_decl (decl
, "weak declaration of `%s' must precede definition");
4656 else if (SUPPORTS_WEAK
)
4657 DECL_WEAK (decl
) = 1;
4658 #ifdef HANDLE_PRAGMA_WEAK
4659 add_weak (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)), NULL
);
4663 /* Emit any pending weak declarations. */
4665 #ifdef HANDLE_PRAGMA_WEAK
4666 struct weak_syms
* weak_decls
;
4672 #ifdef HANDLE_PRAGMA_WEAK
4673 if (HANDLE_PRAGMA_WEAK
)
4675 struct weak_syms
*t
;
4676 for (t
= weak_decls
; t
; t
= t
->next
)
4680 ASM_WEAKEN_LABEL (asm_out_file
, t
->name
);
4682 ASM_OUTPUT_DEF (asm_out_file
, t
->name
, t
->value
);
4689 /* Remove NAME from the pending list of weak symbols. This prevents
4690 the compiler from emitting multiple .weak directives which confuses
4692 #ifdef ASM_WEAKEN_LABEL
4694 remove_from_pending_weak_list (name
)
4695 char *name ATTRIBUTE_UNUSED
;
4697 #ifdef HANDLE_PRAGMA_WEAK
4698 if (HANDLE_PRAGMA_WEAK
)
4700 struct weak_syms
*t
;
4701 for (t
= weak_decls
; t
; t
= t
->next
)
4703 if (t
->name
&& strcmp (name
, t
->name
) == 0)
4712 assemble_alias (decl
, target
)
4713 tree decl
, target ATTRIBUTE_UNUSED
;
4717 make_decl_rtl (decl
, (char *) 0, 1);
4718 name
= XSTR (XEXP (DECL_RTL (decl
), 0), 0);
4720 #ifdef ASM_OUTPUT_DEF
4721 /* Make name accessible from other files, if appropriate. */
4723 if (TREE_PUBLIC (decl
))
4725 #ifdef ASM_WEAKEN_LABEL
4726 if (DECL_WEAK (decl
))
4728 ASM_WEAKEN_LABEL (asm_out_file
, name
);
4729 /* Remove this function from the pending weak list so that
4730 we do not emit multiple .weak directives for it. */
4731 remove_from_pending_weak_list
4732 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
4736 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
4739 #ifdef ASM_OUTPUT_DEF_FROM_DECLS
4740 ASM_OUTPUT_DEF_FROM_DECLS (asm_out_file
, decl
, target
);
4742 ASM_OUTPUT_DEF (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4744 TREE_ASM_WRITTEN (decl
) = 1;
4746 #ifdef ASM_OUTPUT_WEAK_ALIAS
4747 if (! DECL_WEAK (decl
))
4748 warning ("only weak aliases are supported in this configuration");
4750 ASM_OUTPUT_WEAK_ALIAS (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4751 TREE_ASM_WRITTEN (decl
) = 1;
4753 warning ("alias definitions not supported in this configuration; ignored");
4758 /* This determines whether or not we support link-once semantics. */
4759 #ifndef SUPPORTS_ONE_ONLY
4760 #ifdef MAKE_DECL_ONE_ONLY
4761 #define SUPPORTS_ONE_ONLY 1
4763 #define SUPPORTS_ONE_ONLY 0
4767 /* Returns 1 if the target configuration supports defining public symbols
4768 so that one of them will be chosen at link time instead of generating a
4769 multiply-defined symbol error, whether through the use of weak symbols or
4770 a target-specific mechanism for having duplicates discarded. */
4773 supports_one_only ()
4775 if (SUPPORTS_ONE_ONLY
)
4777 return SUPPORTS_WEAK
;
4780 /* Set up DECL as a public symbol that can be defined in multiple
4781 translation units without generating a linker error. */
4784 make_decl_one_only (decl
)
4787 if (TREE_CODE (decl
) != VAR_DECL
&& TREE_CODE (decl
) != FUNCTION_DECL
)
4790 TREE_PUBLIC (decl
) = 1;
4792 if (TREE_CODE (decl
) == VAR_DECL
4793 && (DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
))
4794 DECL_COMMON (decl
) = 1;
4795 else if (SUPPORTS_ONE_ONLY
)
4797 #ifdef MAKE_DECL_ONE_ONLY
4798 MAKE_DECL_ONE_ONLY (decl
);
4800 DECL_ONE_ONLY (decl
) = 1;
4802 else if (SUPPORTS_WEAK
)
4803 DECL_WEAK (decl
) = 1;
4811 ggc_add_root (const_hash_table
, MAX_HASH_TABLE
, sizeof const_hash_table
[0],
4812 mark_const_hash_entry
);
4813 ggc_add_string_root (&in_named_name
, 1);