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
305 && TREE_CODE_CLASS (TREE_CODE (decl
)) != 'd')
308 name
= TREE_STRING_POINTER (DECL_SECTION_NAME (decl
));
310 if (in_section
!= in_named
|| strcmp (name
, in_named_name
))
312 #ifdef ASM_OUTPUT_SECTION_NAME
313 ASM_OUTPUT_SECTION_NAME (asm_out_file
, decl
, name
, reloc
);
315 /* Section attributes are not supported if this macro isn't provided -
316 some host formats don't support them at all. The front-end should
317 already have flagged this as an error. */
321 in_named_name
= ggc_alloc_string (name
, -1);
322 in_section
= in_named
;
326 #ifdef ASM_OUTPUT_SECTION_NAME
327 #ifndef UNIQUE_SECTION
328 #define UNIQUE_SECTION(DECL,RELOC) \
334 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (DECL)); \
335 /* Strip off any encoding in name. */ \
336 STRIP_NAME_ENCODING (name, name); \
338 len = strlen (name) + 1; \
339 string = alloca (len + 1); \
340 sprintf (string, ".%s", name); \
342 DECL_SECTION_NAME (DECL) = build_string (len, string); \
345 #ifndef UNIQUE_SECTION_P
346 #define UNIQUE_SECTION_P(DECL) 0
350 #ifdef BSS_SECTION_ASM_OP
352 /* Tell the assembler to switch to the bss section. */
357 if (in_section
!= in_bss
)
359 #ifdef SHARED_BSS_SECTION_ASM_OP
360 if (flag_shared_data
)
361 fprintf (asm_out_file
, "%s\n", SHARED_BSS_SECTION_ASM_OP
);
364 fprintf (asm_out_file
, "%s\n", BSS_SECTION_ASM_OP
);
370 #ifdef ASM_OUTPUT_BSS
372 /* Utility function for ASM_OUTPUT_BSS for targets to use if
373 they don't support alignments in .bss.
374 ??? It is believed that this function will work in most cases so such
375 support is localized here. */
378 asm_output_bss (file
, decl
, name
, size
, rounded
)
380 tree decl ATTRIBUTE_UNUSED
;
382 int size ATTRIBUTE_UNUSED
, rounded
;
384 ASM_GLOBALIZE_LABEL (file
, name
);
386 #ifdef ASM_DECLARE_OBJECT_NAME
387 last_assemble_variable_decl
= decl
;
388 ASM_DECLARE_OBJECT_NAME (file
, name
, decl
);
390 /* Standard thing is just output label for the object. */
391 ASM_OUTPUT_LABEL (file
, name
);
392 #endif /* ASM_DECLARE_OBJECT_NAME */
393 ASM_OUTPUT_SKIP (file
, rounded
);
398 #ifdef ASM_OUTPUT_ALIGNED_BSS
400 /* Utility function for targets to use in implementing
401 ASM_OUTPUT_ALIGNED_BSS.
402 ??? It is believed that this function will work in most cases so such
403 support is localized here. */
406 asm_output_aligned_bss (file
, decl
, name
, size
, align
)
412 ASM_GLOBALIZE_LABEL (file
, name
);
414 ASM_OUTPUT_ALIGN (file
, floor_log2 (align
/ BITS_PER_UNIT
));
415 #ifdef ASM_DECLARE_OBJECT_NAME
416 last_assemble_variable_decl
= decl
;
417 ASM_DECLARE_OBJECT_NAME (file
, name
, decl
);
419 /* Standard thing is just output label for the object. */
420 ASM_OUTPUT_LABEL (file
, name
);
421 #endif /* ASM_DECLARE_OBJECT_NAME */
422 ASM_OUTPUT_SKIP (file
, size
? size
: 1);
427 #endif /* BSS_SECTION_ASM_OP */
429 #ifdef EH_FRAME_SECTION_ASM_OP
433 if (in_section
!= in_eh_frame
)
435 fprintf (asm_out_file
, "%s\n", EH_FRAME_SECTION_ASM_OP
);
436 in_section
= in_eh_frame
;
441 /* Switch to the section for function DECL.
443 If DECL is NULL_TREE, switch to the text section.
444 ??? It's not clear that we will ever be passed NULL_TREE, but it's
445 safer to handle it. */
448 function_section (decl
)
451 if (decl
!= NULL_TREE
452 && DECL_SECTION_NAME (decl
) != NULL_TREE
)
453 named_section (decl
, (char *) 0, 0);
458 /* Switch to section for variable DECL.
460 RELOC is the `reloc' argument to SELECT_SECTION. */
463 variable_section (decl
, reloc
)
467 if (IN_NAMED_SECTION (decl
))
468 named_section (decl
, NULL
, reloc
);
471 /* C++ can have const variables that get initialized from constructors,
472 and thus can not be in a readonly section. We prevent this by
473 verifying that the initial value is constant for objects put in a
476 error_mark_node is used by the C front end to indicate that the
477 initializer has not been seen yet. In this case, we assume that
478 the initializer must be constant.
480 C++ uses error_mark_node for variables that have complicated
481 initializers, but these variables go in BSS so we won't be called
484 #ifdef SELECT_SECTION
485 SELECT_SECTION (decl
, reloc
);
487 if (DECL_READONLY_SECTION (decl
, reloc
))
488 readonly_data_section ();
495 /* Tell assembler to switch to the section for the exception handling
501 #if defined (EXCEPTION_SECTION)
502 EXCEPTION_SECTION ();
504 #ifdef ASM_OUTPUT_SECTION_NAME
505 named_section (NULL_TREE
, ".gcc_except_table", 0);
510 readonly_data_section ();
515 /* Create the rtl to represent a function, for a function definition.
516 DECL is a FUNCTION_DECL node which describes which function.
517 The rtl is stored into DECL. */
520 make_function_rtl (decl
)
523 char *name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
524 char *new_name
= name
;
526 /* Rename a nested function to avoid conflicts, unless it's a member of
527 a local class, in which case the class name is already unique. */
528 if (decl_function_context (decl
) != 0
529 && ! TYPE_P (DECL_CONTEXT (decl
))
530 && DECL_INITIAL (decl
) != 0
531 && DECL_RTL (decl
) == 0)
535 name
= IDENTIFIER_POINTER (DECL_NAME (decl
));
536 ASM_FORMAT_PRIVATE_NAME (label
, name
, var_labelno
);
537 name
= ggc_alloc_string (label
, -1);
542 /* When -fprefix-function-name is used, every function name is
543 prefixed. Even static functions are prefixed because they
544 could be declared latter. Note that a nested function name
546 if (flag_prefix_function_name
)
548 size_t name_len
= strlen (name
);
550 new_name
= ggc_alloc_string (NULL
, name_len
+ CHKR_PREFIX_SIZE
);
551 memcpy (new_name
, CHKR_PREFIX
, CHKR_PREFIX_SIZE
);
552 memcpy (new_name
+ CHKR_PREFIX_SIZE
, name
, name_len
+ 1);
557 if (DECL_RTL (decl
) == 0)
559 DECL_ASSEMBLER_NAME (decl
) = get_identifier (name
);
561 = gen_rtx_MEM (DECL_MODE (decl
),
562 gen_rtx_SYMBOL_REF (Pmode
, name
));
564 /* Optionally set flags or add text to the name to record information
565 such as that it is a function name. If the name is changed, the macro
566 ASM_OUTPUT_LABELREF will have to know how to strip this information. */
567 #ifdef ENCODE_SECTION_INFO
568 ENCODE_SECTION_INFO (decl
);
573 /* ??? Another way to do this would be to do what halfpic.c does
574 and maintain a hashed table of such critters. */
575 /* ??? Another way to do this would be to pass a flag bit to
576 ENCODE_SECTION_INFO saying whether this is a new decl or not. */
577 /* Let the target reassign the RTL if it wants.
578 This is necessary, for example, when one machine specific
579 decl attribute overrides another. */
580 #ifdef REDO_SECTION_INFO_P
581 if (REDO_SECTION_INFO_P (decl
))
582 ENCODE_SECTION_INFO (decl
);
587 /* Given NAME, a putative register name, discard any customary prefixes. */
590 strip_reg_name (name
)
593 #ifdef REGISTER_PREFIX
594 if (!strncmp (name
, REGISTER_PREFIX
, strlen (REGISTER_PREFIX
)))
595 name
+= strlen (REGISTER_PREFIX
);
597 if (name
[0] == '%' || name
[0] == '#')
602 /* Decode an `asm' spec for a declaration as a register name.
603 Return the register number, or -1 if nothing specified,
604 or -2 if the ASMSPEC is not `cc' or `memory' and is not recognized,
605 or -3 if ASMSPEC is `cc' and is not recognized,
606 or -4 if ASMSPEC is `memory' and is not recognized.
607 Accept an exact spelling or a decimal number.
608 Prefixes such as % are optional. */
611 decode_reg_name (asmspec
)
618 /* Get rid of confusing prefixes. */
619 asmspec
= strip_reg_name (asmspec
);
621 /* Allow a decimal number as a "register name". */
622 for (i
= strlen (asmspec
) - 1; i
>= 0; i
--)
623 if (! (asmspec
[i
] >= '0' && asmspec
[i
] <= '9'))
625 if (asmspec
[0] != 0 && i
< 0)
628 if (i
< FIRST_PSEUDO_REGISTER
&& i
>= 0)
634 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
636 && ! strcmp (asmspec
, strip_reg_name (reg_names
[i
])))
639 #ifdef ADDITIONAL_REGISTER_NAMES
641 static struct { const char *name
; int number
; } table
[]
642 = ADDITIONAL_REGISTER_NAMES
;
644 for (i
= 0; i
< (int)(sizeof (table
) / sizeof (table
[0])); i
++)
645 if (! strcmp (asmspec
, table
[i
].name
))
646 return table
[i
].number
;
648 #endif /* ADDITIONAL_REGISTER_NAMES */
650 if (!strcmp (asmspec
, "memory"))
653 if (!strcmp (asmspec
, "cc"))
662 /* Create the DECL_RTL for a declaration for a static or external variable
663 or static or external function.
664 ASMSPEC, if not 0, is the string which the user specified
665 as the assembler symbol name.
666 TOP_LEVEL is nonzero if this is a file-scope variable.
668 This is never called for PARM_DECL nodes. */
671 make_decl_rtl (decl
, asmspec
, top_level
)
676 register char *name
= 0;
679 reg_number
= decode_reg_name (asmspec
);
681 if (DECL_ASSEMBLER_NAME (decl
) != NULL_TREE
)
682 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
684 if (reg_number
== -2)
686 /* ASMSPEC is given, and not the name of a register. */
687 size_t len
= strlen (asmspec
);
689 name
= ggc_alloc_string (NULL
, len
+ 1);
691 memcpy (&name
[1], asmspec
, len
+ 1);
694 /* For a duplicate declaration, we can be called twice on the
695 same DECL node. Don't discard the RTL already made. */
696 if (DECL_RTL (decl
) == 0)
698 /* First detect errors in declaring global registers. */
699 if (TREE_CODE (decl
) != FUNCTION_DECL
700 && DECL_REGISTER (decl
) && reg_number
== -1)
701 error_with_decl (decl
,
702 "register name not specified for `%s'");
703 else if (TREE_CODE (decl
) != FUNCTION_DECL
704 && DECL_REGISTER (decl
) && reg_number
< 0)
705 error_with_decl (decl
,
706 "invalid register name for `%s'");
707 else if ((reg_number
>= 0 || reg_number
== -3)
708 && (TREE_CODE (decl
) == FUNCTION_DECL
709 && ! DECL_REGISTER (decl
)))
710 error_with_decl (decl
,
711 "register name given for non-register variable `%s'");
712 else if (TREE_CODE (decl
) != FUNCTION_DECL
713 && DECL_REGISTER (decl
)
714 && TYPE_MODE (TREE_TYPE (decl
)) == BLKmode
)
715 error_with_decl (decl
,
716 "data type of `%s' isn't suitable for a register");
717 else if (TREE_CODE (decl
) != FUNCTION_DECL
&& DECL_REGISTER (decl
)
718 && ! HARD_REGNO_MODE_OK (reg_number
,
719 TYPE_MODE (TREE_TYPE (decl
))))
720 error_with_decl (decl
,
721 "register number for `%s' isn't suitable for data type");
722 /* Now handle properly declared static register variables. */
723 else if (TREE_CODE (decl
) != FUNCTION_DECL
&& DECL_REGISTER (decl
))
727 if (DECL_INITIAL (decl
) != 0 && top_level
)
729 DECL_INITIAL (decl
) = 0;
730 error ("global register variable has initial value");
732 if (TREE_THIS_VOLATILE (decl
))
733 warning ("volatile register variables don't work as you might wish");
735 /* If the user specified one of the eliminables registers here,
736 e.g., FRAME_POINTER_REGNUM, we don't want to get this variable
737 confused with that register and be eliminated. Although this
738 usage is somewhat suspect, we nevertheless use the following
739 kludge to avoid setting DECL_RTL to frame_pointer_rtx. */
742 = gen_rtx_REG (DECL_MODE (decl
), FIRST_PSEUDO_REGISTER
);
743 REGNO (DECL_RTL (decl
)) = reg_number
;
744 REG_USERVAR_P (DECL_RTL (decl
)) = 1;
748 /* Make this register global, so not usable for anything
750 #ifdef ASM_DECLARE_REGISTER_GLOBAL
751 ASM_DECLARE_REGISTER_GLOBAL (asm_out_file
, decl
, reg_number
, name
);
753 nregs
= HARD_REGNO_NREGS (reg_number
, DECL_MODE (decl
));
755 globalize_reg (reg_number
+ --nregs
);
758 /* Specifying a section attribute on a variable forces it into a
759 non-.bss section, and thus it cannot be common. */
760 else if (TREE_CODE (decl
) == VAR_DECL
761 && DECL_SECTION_NAME (decl
) != NULL_TREE
762 && DECL_INITIAL (decl
) == NULL_TREE
763 && DECL_COMMON (decl
))
764 DECL_COMMON (decl
) = 0;
766 /* Now handle ordinary static variables and functions (in memory).
767 Also handle vars declared register invalidly. */
768 if (DECL_RTL (decl
) == 0)
770 /* Can't use just the variable's own name for a variable
771 whose scope is less than the whole file, unless it's a member
772 of a local class (which will already be unambiguous).
773 Concatenate a distinguishing number. */
774 if (!top_level
&& !TREE_PUBLIC (decl
)
775 && ! (DECL_CONTEXT (decl
) && TYPE_P (DECL_CONTEXT (decl
)))
780 ASM_FORMAT_PRIVATE_NAME (label
, name
, var_labelno
);
781 name
= ggc_alloc_string (label
, -1);
788 /* When -fprefix-function-name is used, the functions
789 names are prefixed. Only nested function names are not
791 if (flag_prefix_function_name
&& TREE_CODE (decl
) == FUNCTION_DECL
)
793 size_t name_len
= strlen (name
);
796 new_name
= ggc_alloc_string (NULL
, name_len
+ CHKR_PREFIX_SIZE
);
797 memcpy (new_name
, CHKR_PREFIX
, CHKR_PREFIX_SIZE
);
798 memcpy (new_name
+ CHKR_PREFIX_SIZE
, name
, name_len
+ 1);
802 DECL_ASSEMBLER_NAME (decl
)
803 = get_identifier (name
[0] == '*' ? name
+ 1 : name
);
804 DECL_RTL (decl
) = gen_rtx_MEM (DECL_MODE (decl
),
805 gen_rtx_SYMBOL_REF (Pmode
, name
));
806 MEM_ALIAS_SET (DECL_RTL (decl
)) = get_alias_set (decl
);
808 /* If this variable is to be treated as volatile, show its
809 tree node has side effects. If it has side effects, either
810 because of this test or from TREE_THIS_VOLATILE also
811 being set, show the MEM is volatile. */
812 if (flag_volatile_global
&& TREE_CODE (decl
) == VAR_DECL
813 && TREE_PUBLIC (decl
))
814 TREE_SIDE_EFFECTS (decl
) = 1;
815 else if (flag_volatile_static
&& TREE_CODE (decl
) == VAR_DECL
816 && (TREE_PUBLIC (decl
) || TREE_STATIC (decl
)))
817 TREE_SIDE_EFFECTS (decl
) = 1;
819 if (TREE_SIDE_EFFECTS (decl
))
820 MEM_VOLATILE_P (DECL_RTL (decl
)) = 1;
822 if (TREE_READONLY (decl
))
823 RTX_UNCHANGING_P (DECL_RTL (decl
)) = 1;
824 MEM_SET_IN_STRUCT_P (DECL_RTL (decl
),
825 AGGREGATE_TYPE_P (TREE_TYPE (decl
)));
827 /* Optionally set flags or add text to the name to record information
828 such as that it is a function name.
829 If the name is changed, the macro ASM_OUTPUT_LABELREF
830 will have to know how to strip this information. */
831 #ifdef ENCODE_SECTION_INFO
832 ENCODE_SECTION_INFO (decl
);
838 /* If the old RTL had the wrong mode, fix the mode. */
839 if (GET_MODE (DECL_RTL (decl
)) != DECL_MODE (decl
))
841 rtx rtl
= DECL_RTL (decl
);
842 PUT_MODE (rtl
, DECL_MODE (decl
));
845 /* ??? Another way to do this would be to do what halfpic.c does
846 and maintain a hashed table of such critters. */
847 /* ??? Another way to do this would be to pass a flag bit to
848 ENCODE_SECTION_INFO saying whether this is a new decl or not. */
849 /* Let the target reassign the RTL if it wants.
850 This is necessary, for example, when one machine specific
851 decl attribute overrides another. */
852 #ifdef REDO_SECTION_INFO_P
853 if (REDO_SECTION_INFO_P (decl
))
854 ENCODE_SECTION_INFO (decl
);
859 /* Make the rtl for variable VAR be volatile.
860 Use this only for static variables. */
863 make_var_volatile (var
)
866 if (GET_CODE (DECL_RTL (var
)) != MEM
)
869 MEM_VOLATILE_P (DECL_RTL (var
)) = 1;
872 /* Output alignment directive to align for constant expression EXP. */
875 assemble_constant_align (exp
)
880 /* Align the location counter as required by EXP's data type. */
881 align
= TYPE_ALIGN (TREE_TYPE (exp
));
882 #ifdef CONSTANT_ALIGNMENT
883 align
= CONSTANT_ALIGNMENT (exp
, align
);
886 if (align
> BITS_PER_UNIT
)
887 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
890 /* Output a string of literal assembler code
891 for an `asm' keyword used between functions. */
894 assemble_asm (string
)
899 if (TREE_CODE (string
) == ADDR_EXPR
)
900 string
= TREE_OPERAND (string
, 0);
902 fprintf (asm_out_file
, "\t%s\n", TREE_STRING_POINTER (string
));
905 #if 0 /* This should no longer be needed, because
906 flag_gnu_linker should be 0 on these systems,
907 which should prevent any output
908 if ASM_OUTPUT_CONSTRUCTOR and ASM_OUTPUT_DESTRUCTOR are absent. */
909 #if !(defined(DBX_DEBUGGING_INFO) && !defined(FASCIST_ASSEMBLER))
910 #ifndef ASM_OUTPUT_CONSTRUCTOR
911 #define ASM_OUTPUT_CONSTRUCTOR(file, name)
913 #ifndef ASM_OUTPUT_DESTRUCTOR
914 #define ASM_OUTPUT_DESTRUCTOR(file, name)
919 /* Record an element in the table of global destructors.
920 How this is done depends on what sort of assembler and linker
923 NAME should be the name of a global function to be called
924 at exit time. This name is output using assemble_name. */
927 assemble_destructor (name
)
930 #ifdef ASM_OUTPUT_DESTRUCTOR
931 ASM_OUTPUT_DESTRUCTOR (asm_out_file
, name
);
935 /* Now tell GNU LD that this is part of the static destructor set. */
936 /* This code works for any machine provided you use GNU as/ld. */
937 fprintf (asm_out_file
, "%s \"___DTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
938 assemble_name (asm_out_file
, name
);
939 fputc ('\n', asm_out_file
);
944 /* Likewise for global constructors. */
947 assemble_constructor (name
)
950 #ifdef ASM_OUTPUT_CONSTRUCTOR
951 ASM_OUTPUT_CONSTRUCTOR (asm_out_file
, name
);
955 /* Now tell GNU LD that this is part of the static constructor set. */
956 /* This code works for any machine provided you use GNU as/ld. */
957 fprintf (asm_out_file
, "%s \"___CTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
958 assemble_name (asm_out_file
, name
);
959 fputc ('\n', asm_out_file
);
964 /* Likewise for entries we want to record for garbage collection.
965 Garbage collection is still under development. */
968 assemble_gc_entry (name
)
971 #ifdef ASM_OUTPUT_GC_ENTRY
972 ASM_OUTPUT_GC_ENTRY (asm_out_file
, name
);
976 /* Now tell GNU LD that this is part of the static constructor set. */
977 fprintf (asm_out_file
, "%s \"___PTR_LIST__\",22,0,0,", ASM_STABS_OP
);
978 assemble_name (asm_out_file
, name
);
979 fputc ('\n', asm_out_file
);
984 /* CONSTANT_POOL_BEFORE_FUNCTION may be defined as an expression with
985 a non-zero value if the constant pool should be output before the
986 start of the function, or a zero value if the pool should output
987 after the end of the function. The default is to put it before the
990 #ifndef CONSTANT_POOL_BEFORE_FUNCTION
991 #define CONSTANT_POOL_BEFORE_FUNCTION 1
994 /* Output assembler code for the constant pool of a function and associated
995 with defining the name of the function. DECL describes the function.
996 NAME is the function's name. For the constant pool, we use the current
997 constant pool data. */
1000 assemble_start_function (decl
, fnname
)
1006 /* The following code does not need preprocessing in the assembler. */
1010 if (CONSTANT_POOL_BEFORE_FUNCTION
)
1011 output_constant_pool (fnname
, decl
);
1013 #ifdef ASM_OUTPUT_SECTION_NAME
1014 /* If the function is to be put in its own section and it's not in a section
1015 already, indicate so. */
1016 if ((flag_function_sections
1017 && DECL_SECTION_NAME (decl
) == NULL_TREE
)
1018 || UNIQUE_SECTION_P (decl
))
1019 UNIQUE_SECTION (decl
, 0);
1022 function_section (decl
);
1024 /* Tell assembler to move to target machine's alignment for functions. */
1025 align
= floor_log2 (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
1027 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1029 /* Handle a user-specified function alignment.
1030 Note that we still need to align to FUNCTION_BOUNDARY, as above,
1031 because ASM_OUTPUT_MAX_SKIP_ALIGN might not do any alignment at all. */
1032 if (align_functions_log
> align
)
1034 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
1035 ASM_OUTPUT_MAX_SKIP_ALIGN (asm_out_file
,
1036 align_functions_log
, align_functions
-1);
1038 ASM_OUTPUT_ALIGN (asm_out_file
, align_functions_log
);
1042 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
1043 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file
, fnname
);
1046 #ifdef SDB_DEBUGGING_INFO
1047 /* Output SDB definition of the function. */
1048 if (write_symbols
== SDB_DEBUG
)
1049 sdbout_mark_begin_function ();
1052 #ifdef DBX_DEBUGGING_INFO
1053 /* Output DBX definition of the function. */
1054 if (write_symbols
== DBX_DEBUG
)
1055 dbxout_begin_function (decl
);
1058 /* Make function name accessible from other files, if appropriate. */
1060 if (TREE_PUBLIC (decl
))
1062 if (! first_global_object_name
)
1067 if (! DECL_WEAK (decl
) && ! DECL_ONE_ONLY (decl
))
1068 name
= &first_global_object_name
;
1070 name
= &weak_global_object_name
;
1072 STRIP_NAME_ENCODING (p
, fnname
);
1073 *name
= permalloc (strlen (p
) + 1);
1077 #ifdef ASM_WEAKEN_LABEL
1078 if (DECL_WEAK (decl
))
1080 ASM_WEAKEN_LABEL (asm_out_file
, fnname
);
1081 /* Remove this function from the pending weak list so that
1082 we do not emit multiple .weak directives for it. */
1083 remove_from_pending_weak_list
1084 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
1088 ASM_GLOBALIZE_LABEL (asm_out_file
, fnname
);
1091 /* Do any machine/system dependent processing of the function name */
1092 #ifdef ASM_DECLARE_FUNCTION_NAME
1093 ASM_DECLARE_FUNCTION_NAME (asm_out_file
, fnname
, current_function_decl
);
1095 /* Standard thing is just output label for the function. */
1096 ASM_OUTPUT_LABEL (asm_out_file
, fnname
);
1097 #endif /* ASM_DECLARE_FUNCTION_NAME */
1100 /* Output assembler code associated with defining the size of the
1101 function. DECL describes the function. NAME is the function's name. */
1104 assemble_end_function (decl
, fnname
)
1108 #ifdef ASM_DECLARE_FUNCTION_SIZE
1109 ASM_DECLARE_FUNCTION_SIZE (asm_out_file
, fnname
, decl
);
1111 if (! CONSTANT_POOL_BEFORE_FUNCTION
)
1113 output_constant_pool (fnname
, decl
);
1114 function_section (decl
); /* need to switch back */
1117 /* Output any constants which should appear after the function. */
1118 output_after_function_constants ();
1121 /* Assemble code to leave SIZE bytes of zeros. */
1124 assemble_zeros (size
)
1127 /* Do no output if -fsyntax-only. */
1128 if (flag_syntax_only
)
1131 #ifdef ASM_NO_SKIP_IN_TEXT
1132 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
1133 so we must output 0s explicitly in the text section. */
1134 if (ASM_NO_SKIP_IN_TEXT
&& in_text_section ())
1138 for (i
= 0; i
< size
- 20; i
+= 20)
1141 fprintf (asm_out_file
,
1142 "%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
);
1144 fprintf (asm_out_file
,
1145 "\tbyte 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n");
1151 fprintf (asm_out_file
, "%s 0", ASM_BYTE_OP
);
1153 fprintf (asm_out_file
, "\tbyte 0");
1156 for (; i
< size
; i
++)
1157 fprintf (asm_out_file
, ",0");
1158 fprintf (asm_out_file
, "\n");
1164 ASM_OUTPUT_SKIP (asm_out_file
, size
);
1167 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
1170 assemble_align (align
)
1173 if (align
> BITS_PER_UNIT
)
1174 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
1177 /* Assemble a string constant with the specified C string as contents. */
1180 assemble_string (p
, size
)
1187 /* If the string is very long, split it up. */
1191 int thissize
= size
- pos
;
1192 if (thissize
> maximum
)
1195 ASM_OUTPUT_ASCII (asm_out_file
, p
, thissize
);
1203 #if defined ASM_OUTPUT_ALIGNED_DECL_LOCAL
1204 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1205 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1207 #if defined ASM_OUTPUT_ALIGNED_LOCAL
1208 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1209 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, DECL_ALIGN (decl))
1211 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1212 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded)
1216 #if defined ASM_OUTPUT_ALIGNED_BSS
1217 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1218 ASM_OUTPUT_ALIGNED_BSS (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1220 #if defined ASM_OUTPUT_BSS
1221 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1222 ASM_OUTPUT_BSS (asm_out_file, decl, name, size, rounded)
1228 #if defined ASM_OUTPUT_ALIGNED_DECL_COMMON
1229 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1230 ASM_OUTPUT_ALIGNED_DECL_COMMON (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1232 #if defined ASM_OUTPUT_ALIGNED_COMMON
1233 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1234 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file, name, size, DECL_ALIGN (decl))
1236 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1237 ASM_OUTPUT_COMMON (asm_out_file, name, size, rounded)
1242 asm_emit_uninitialised (decl
, name
, size
, rounded
)
1245 int size ATTRIBUTE_UNUSED
;
1246 int rounded ATTRIBUTE_UNUSED
;
1254 destination
= asm_dest_local
;
1256 if (TREE_PUBLIC (decl
))
1258 #if defined ASM_EMIT_BSS
1259 if (! DECL_COMMON (decl
))
1260 destination
= asm_dest_bss
;
1263 destination
= asm_dest_common
;
1266 if (flag_shared_data
)
1268 switch (destination
)
1270 #ifdef ASM_OUTPUT_SHARED_BSS
1272 ASM_OUTPUT_SHARED_BSS (asm_out_file
, decl
, name
, size
, rounded
);
1275 #ifdef ASM_OUTPUT_SHARED_COMMON
1276 case asm_dest_common
:
1277 ASM_OUTPUT_SHARED_COMMON (asm_out_file
, name
, size
, rounded
);
1280 #ifdef ASM_OUTPUT_SHARED_LOCAL
1281 case asm_dest_local
:
1282 ASM_OUTPUT_SHARED_LOCAL (asm_out_file
, name
, size
, rounded
);
1290 #ifdef ASM_OUTPUT_SECTION_NAME
1291 /* We already know that DECL_SECTION_NAME() == NULL. */
1292 if (flag_data_sections
!= 0 || UNIQUE_SECTION_P (decl
))
1293 UNIQUE_SECTION (decl
, NULL
);
1296 switch (destination
)
1300 ASM_EMIT_BSS (decl
, name
, size
, rounded
);
1303 case asm_dest_common
:
1304 ASM_EMIT_COMMON (decl
, name
, size
, rounded
);
1306 case asm_dest_local
:
1307 ASM_EMIT_LOCAL (decl
, name
, size
, rounded
);
1316 /* Assemble everything that is needed for a variable or function declaration.
1317 Not used for automatic variables, and not used for function definitions.
1318 Should not be called for variables of incomplete structure type.
1320 TOP_LEVEL is nonzero if this variable has file scope.
1321 AT_END is nonzero if this is the special handling, at end of compilation,
1322 to define things that have had only tentative definitions.
1323 DONT_OUTPUT_DATA if nonzero means don't actually output the
1324 initial value (that will be done by the caller). */
1327 assemble_variable (decl
, top_level
, at_end
, dont_output_data
)
1329 int top_level ATTRIBUTE_UNUSED
;
1330 int at_end ATTRIBUTE_UNUSED
;
1331 int dont_output_data
;
1333 register const char *name
;
1335 tree size_tree
= NULL_TREE
;
1337 enum in_section saved_in_section
;
1339 last_assemble_variable_decl
= 0;
1341 if (GET_CODE (DECL_RTL (decl
)) == REG
)
1343 /* Do output symbol info for global register variables, but do nothing
1346 if (TREE_ASM_WRITTEN (decl
))
1348 TREE_ASM_WRITTEN (decl
) = 1;
1350 /* Do no output if -fsyntax-only. */
1351 if (flag_syntax_only
)
1354 #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
1355 /* File-scope global variables are output here. */
1356 if ((write_symbols
== DBX_DEBUG
|| write_symbols
== XCOFF_DEBUG
)
1358 dbxout_symbol (decl
, 0);
1360 #ifdef SDB_DEBUGGING_INFO
1361 if (write_symbols
== SDB_DEBUG
&& top_level
1362 /* Leave initialized global vars for end of compilation;
1363 see comment in compile_file. */
1364 && (TREE_PUBLIC (decl
) == 0 || DECL_INITIAL (decl
) == 0))
1365 sdbout_symbol (decl
, 0);
1368 /* Don't output any DWARF debugging information for variables here.
1369 In the case of local variables, the information for them is output
1370 when we do our recursive traversal of the tree representation for
1371 the entire containing function. In the case of file-scope variables,
1372 we output information for all of them at the very end of compilation
1373 while we are doing our final traversal of the chain of file-scope
1379 /* Normally no need to say anything here for external references,
1380 since assemble_external is called by the language-specific code
1381 when a declaration is first seen. */
1383 if (DECL_EXTERNAL (decl
))
1386 /* Output no assembler code for a function declaration.
1387 Only definitions of functions output anything. */
1389 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1392 /* If type was incomplete when the variable was declared,
1393 see if it is complete now. */
1395 if (DECL_SIZE (decl
) == 0)
1396 layout_decl (decl
, 0);
1398 /* Still incomplete => don't allocate it; treat the tentative defn
1399 (which is what it must have been) as an `extern' reference. */
1401 if (!dont_output_data
&& DECL_SIZE (decl
) == 0)
1403 error_with_file_and_line (DECL_SOURCE_FILE (decl
),
1404 DECL_SOURCE_LINE (decl
),
1405 "storage size of `%s' isn't known",
1406 IDENTIFIER_POINTER (DECL_NAME (decl
)));
1407 TREE_ASM_WRITTEN (decl
) = 1;
1411 /* The first declaration of a variable that comes through this function
1412 decides whether it is global (in C, has external linkage)
1413 or local (in C, has internal linkage). So do nothing more
1414 if this function has already run. */
1416 if (TREE_ASM_WRITTEN (decl
))
1419 TREE_ASM_WRITTEN (decl
) = 1;
1421 /* Do no output if -fsyntax-only. */
1422 if (flag_syntax_only
)
1427 if (! dont_output_data
)
1431 if (TREE_CODE (DECL_SIZE_UNIT (decl
)) != INTEGER_CST
)
1434 size_tree
= DECL_SIZE_UNIT (decl
);
1435 size
= TREE_INT_CST_LOW (size_tree
);
1437 if (compare_tree_int (size_tree
, size
) != 0)
1439 error_with_decl (decl
, "size of variable `%s' is too large");
1444 name
= XSTR (XEXP (DECL_RTL (decl
), 0), 0);
1445 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
)
1446 && ! first_global_object_name
1447 && ! (DECL_COMMON (decl
) && (DECL_INITIAL (decl
) == 0
1448 || DECL_INITIAL (decl
) == error_mark_node
))
1449 && ! DECL_WEAK (decl
)
1450 && ! DECL_ONE_ONLY (decl
))
1454 STRIP_NAME_ENCODING (p
, name
);
1455 first_global_object_name
= permalloc (strlen (p
) + 1);
1456 strcpy (first_global_object_name
, p
);
1459 /* Compute the alignment of this data. */
1461 align
= DECL_ALIGN (decl
);
1463 /* In the case for initialing an array whose length isn't specified,
1464 where we have not yet been able to do the layout,
1465 figure out the proper alignment now. */
1466 if (dont_output_data
&& DECL_SIZE (decl
) == 0
1467 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
)
1468 align
= MAX (align
, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl
))));
1470 /* Some object file formats have a maximum alignment which they support.
1471 In particular, a.out format supports a maximum alignment of 4. */
1472 #ifndef MAX_OFILE_ALIGNMENT
1473 #define MAX_OFILE_ALIGNMENT BIGGEST_ALIGNMENT
1475 if (align
> MAX_OFILE_ALIGNMENT
)
1477 warning_with_decl (decl
,
1478 "alignment of `%s' is greater than maximum object file alignment. Using %d.",
1479 MAX_OFILE_ALIGNMENT
/BITS_PER_UNIT
);
1480 align
= MAX_OFILE_ALIGNMENT
;
1483 /* On some machines, it is good to increase alignment sometimes. */
1484 #ifdef DATA_ALIGNMENT
1485 align
= DATA_ALIGNMENT (TREE_TYPE (decl
), align
);
1487 #ifdef CONSTANT_ALIGNMENT
1488 if (DECL_INITIAL (decl
) != 0 && DECL_INITIAL (decl
) != error_mark_node
)
1489 align
= CONSTANT_ALIGNMENT (DECL_INITIAL (decl
), align
);
1492 /* Reset the alignment in case we have made it tighter, so we can benefit
1493 from it in get_pointer_alignment. */
1494 DECL_ALIGN (decl
) = align
;
1496 /* Handle uninitialized definitions. */
1498 if ((DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
)
1499 /* If the target can't output uninitialized but not common global data
1500 in .bss, then we have to use .data. */
1501 #if ! defined ASM_EMIT_BSS
1502 && DECL_COMMON (decl
)
1504 && DECL_SECTION_NAME (decl
) == NULL_TREE
1505 && ! dont_output_data
)
1507 int size
= TREE_INT_CST_LOW (size_tree
);
1510 /* Don't allocate zero bytes of common,
1511 since that means "undefined external" in the linker. */
1512 if (size
== 0) rounded
= 1;
1513 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1514 so that each uninitialized object starts on such a boundary. */
1515 rounded
+= (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1;
1516 rounded
= (rounded
/ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1517 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1519 #if !defined(ASM_OUTPUT_ALIGNED_COMMON) && !defined(ASM_OUTPUT_ALIGNED_BSS)
1520 if ((DECL_ALIGN (decl
) / BITS_PER_UNIT
) > (unsigned int) rounded
)
1522 (decl
, "requested alignment for %s is greater than implemented alignment of %d.",rounded
);
1525 #ifdef DBX_DEBUGGING_INFO
1526 /* File-scope global variables are output here. */
1527 if (write_symbols
== DBX_DEBUG
&& top_level
)
1528 dbxout_symbol (decl
, 0);
1530 #ifdef SDB_DEBUGGING_INFO
1531 if (write_symbols
== SDB_DEBUG
&& top_level
1532 /* Leave initialized global vars for end of compilation;
1533 see comment in compile_file. */
1534 && (TREE_PUBLIC (decl
) == 0 || DECL_INITIAL (decl
) == 0))
1535 sdbout_symbol (decl
, 0);
1538 /* Don't output any DWARF debugging information for variables here.
1539 In the case of local variables, the information for them is output
1540 when we do our recursive traversal of the tree representation for
1541 the entire containing function. In the case of file-scope variables,
1542 we output information for all of them at the very end of compilation
1543 while we are doing our final traversal of the chain of file-scope
1546 #if 0 /* ??? We should either delete this or add a comment describing what
1547 it was intended to do and why we shouldn't delete it. */
1548 if (flag_shared_data
)
1551 asm_emit_uninitialised (decl
, name
, size
, rounded
);
1556 /* Handle initialized definitions.
1557 Also handle uninitialized global definitions if -fno-common and the
1558 target doesn't support ASM_OUTPUT_BSS. */
1560 /* First make the assembler name(s) global if appropriate. */
1561 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
))
1563 #ifdef ASM_WEAKEN_LABEL
1564 if (DECL_WEAK (decl
))
1566 ASM_WEAKEN_LABEL (asm_out_file
, name
);
1567 /* Remove this variable from the pending weak list so that
1568 we do not emit multiple .weak directives for it. */
1569 remove_from_pending_weak_list
1570 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
1574 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
1577 for (d
= equivalents
; d
; d
= TREE_CHAIN (d
))
1579 tree e
= TREE_VALUE (d
);
1580 if (TREE_PUBLIC (e
) && DECL_NAME (e
))
1581 ASM_GLOBALIZE_LABEL (asm_out_file
,
1582 XSTR (XEXP (DECL_RTL (e
), 0), 0));
1586 /* Output any data that we will need to use the address of. */
1587 if (DECL_INITIAL (decl
) == error_mark_node
)
1588 reloc
= contains_pointers_p (TREE_TYPE (decl
));
1589 else if (DECL_INITIAL (decl
))
1590 reloc
= output_addressed_constants (DECL_INITIAL (decl
));
1592 #ifdef ASM_OUTPUT_SECTION_NAME
1593 if ((flag_data_sections
!= 0 && DECL_SECTION_NAME (decl
) == NULL_TREE
)
1594 || UNIQUE_SECTION_P (decl
))
1595 UNIQUE_SECTION (decl
, reloc
);
1598 /* Switch to the appropriate section. */
1599 variable_section (decl
, reloc
);
1601 /* dbxout.c needs to know this. */
1602 if (in_text_section ())
1603 DECL_IN_TEXT_SECTION (decl
) = 1;
1605 /* Record current section so we can restore it if dbxout.c clobbers it. */
1606 saved_in_section
= in_section
;
1608 /* Output the dbx info now that we have chosen the section. */
1610 #ifdef DBX_DEBUGGING_INFO
1611 /* File-scope global variables are output here. */
1612 if (write_symbols
== DBX_DEBUG
&& top_level
)
1613 dbxout_symbol (decl
, 0);
1615 #ifdef SDB_DEBUGGING_INFO
1616 if (write_symbols
== SDB_DEBUG
&& top_level
1617 /* Leave initialized global vars for end of compilation;
1618 see comment in compile_file. */
1619 && (TREE_PUBLIC (decl
) == 0 || DECL_INITIAL (decl
) == 0))
1620 sdbout_symbol (decl
, 0);
1623 /* Don't output any DWARF debugging information for variables here.
1624 In the case of local variables, the information for them is output
1625 when we do our recursive traversal of the tree representation for
1626 the entire containing function. In the case of file-scope variables,
1627 we output information for all of them at the very end of compilation
1628 while we are doing our final traversal of the chain of file-scope
1631 /* If the debugging output changed sections, reselect the section
1632 that's supposed to be selected. */
1633 if (in_section
!= saved_in_section
)
1634 variable_section (decl
, reloc
);
1636 /* Output the alignment of this data. */
1637 if (align
> BITS_PER_UNIT
)
1638 ASM_OUTPUT_ALIGN (asm_out_file
,
1639 floor_log2 (DECL_ALIGN (decl
) / BITS_PER_UNIT
));
1641 /* Do any machine/system dependent processing of the object. */
1642 #ifdef ASM_DECLARE_OBJECT_NAME
1643 last_assemble_variable_decl
= decl
;
1644 ASM_DECLARE_OBJECT_NAME (asm_out_file
, name
, decl
);
1646 /* Standard thing is just output label for the object. */
1647 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1648 #endif /* ASM_DECLARE_OBJECT_NAME */
1650 if (!dont_output_data
)
1652 if (DECL_INITIAL (decl
))
1653 /* Output the actual data. */
1654 output_constant (DECL_INITIAL (decl
), TREE_INT_CST_LOW (size_tree
));
1656 /* Leave space for it. */
1657 assemble_zeros (TREE_INT_CST_LOW (size_tree
));
1661 #ifdef XCOFF_DEBUGGING_INFO
1662 /* Unfortunately, the IBM assembler cannot handle stabx before the actual
1663 declaration. When something like ".stabx "aa:S-2",aa,133,0" is emitted
1664 and `aa' hasn't been output yet, the assembler generates a stab entry with
1665 a value of zero, in addition to creating an unnecessary external entry
1666 for `aa'. Hence, we must postpone dbxout_symbol to here at the end. */
1668 /* File-scope global variables are output here. */
1669 if (write_symbols
== XCOFF_DEBUG
&& top_level
)
1671 saved_in_section
= in_section
;
1673 dbxout_symbol (decl
, 0);
1675 if (in_section
!= saved_in_section
)
1676 variable_section (decl
, reloc
);
1679 /* There must be a statement after a label. */
1684 /* Return 1 if type TYPE contains any pointers. */
1687 contains_pointers_p (type
)
1690 switch (TREE_CODE (type
))
1693 case REFERENCE_TYPE
:
1694 /* I'm not sure whether OFFSET_TYPE needs this treatment,
1695 so I'll play safe and return 1. */
1701 case QUAL_UNION_TYPE
:
1704 /* For a type that has fields, see if the fields have pointers. */
1705 for (fields
= TYPE_FIELDS (type
); fields
; fields
= TREE_CHAIN (fields
))
1706 if (TREE_CODE (fields
) == FIELD_DECL
1707 && contains_pointers_p (TREE_TYPE (fields
)))
1713 /* An array type contains pointers if its element type does. */
1714 return contains_pointers_p (TREE_TYPE (type
));
1721 /* Output something to declare an external symbol to the assembler.
1722 (Most assemblers don't need this, so we normally output nothing.)
1723 Do nothing if DECL is not external. */
1726 assemble_external (decl
)
1727 tree decl ATTRIBUTE_UNUSED
;
1729 #ifdef ASM_OUTPUT_EXTERNAL
1730 if (TREE_CODE_CLASS (TREE_CODE (decl
)) == 'd'
1731 && DECL_EXTERNAL (decl
) && TREE_PUBLIC (decl
))
1733 rtx rtl
= DECL_RTL (decl
);
1735 if (GET_CODE (rtl
) == MEM
&& GET_CODE (XEXP (rtl
, 0)) == SYMBOL_REF
1736 && ! SYMBOL_REF_USED (XEXP (rtl
, 0)))
1738 /* Some systems do require some output. */
1739 SYMBOL_REF_USED (XEXP (rtl
, 0)) = 1;
1740 ASM_OUTPUT_EXTERNAL (asm_out_file
, decl
, XSTR (XEXP (rtl
, 0), 0));
1746 /* Similar, for calling a library function FUN. */
1749 assemble_external_libcall (fun
)
1750 rtx fun ATTRIBUTE_UNUSED
;
1752 #ifdef ASM_OUTPUT_EXTERNAL_LIBCALL
1753 /* Declare library function name external when first used, if nec. */
1754 if (! SYMBOL_REF_USED (fun
))
1756 SYMBOL_REF_USED (fun
) = 1;
1757 ASM_OUTPUT_EXTERNAL_LIBCALL (asm_out_file
, fun
);
1762 /* Declare the label NAME global. */
1765 assemble_global (name
)
1768 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
1771 /* Assemble a label named NAME. */
1774 assemble_label (name
)
1777 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1780 /* Output to FILE a reference to the assembler name of a C-level name NAME.
1781 If NAME starts with a *, the rest of NAME is output verbatim.
1782 Otherwise NAME is transformed in an implementation-defined way
1783 (usually by the addition of an underscore).
1784 Many macros in the tm file are defined to call this function. */
1787 assemble_name (file
, name
)
1791 const char *real_name
;
1794 STRIP_NAME_ENCODING (real_name
, name
);
1795 if (flag_prefix_function_name
1796 && ! bcmp (real_name
, CHKR_PREFIX
, CHKR_PREFIX_SIZE
))
1797 real_name
= real_name
+ CHKR_PREFIX_SIZE
;
1799 id
= maybe_get_identifier (real_name
);
1801 TREE_SYMBOL_REFERENCED (id
) = 1;
1804 fputs (&name
[1], file
);
1806 ASM_OUTPUT_LABELREF (file
, name
);
1809 /* Allocate SIZE bytes writable static space with a gensym name
1810 and return an RTX to refer to its address. */
1813 assemble_static_space (size
)
1821 if (flag_shared_data
)
1825 ASM_GENERATE_INTERNAL_LABEL (name
, "LF", const_labelno
);
1827 namestring
= ggc_alloc_string (name
, -1);
1829 x
= gen_rtx_SYMBOL_REF (Pmode
, namestring
);
1831 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
1832 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file
, NULL_TREE
, name
, size
,
1835 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1836 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file
, name
, size
, BIGGEST_ALIGNMENT
);
1839 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1840 so that each uninitialized object starts on such a boundary. */
1841 /* Variable `rounded' might or might not be used in ASM_OUTPUT_LOCAL. */
1842 int rounded ATTRIBUTE_UNUSED
1843 = ((size
+ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1)
1844 / (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1845 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1846 ASM_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
1853 /* Assemble the static constant template for function entry trampolines.
1854 This is done at most once per compilation.
1855 Returns an RTX for the address of the template. */
1857 #ifdef TRAMPOLINE_TEMPLATE
1859 assemble_trampoline_template ()
1865 /* By default, put trampoline templates in read-only data section. */
1867 #ifdef TRAMPOLINE_SECTION
1868 TRAMPOLINE_SECTION ();
1870 readonly_data_section ();
1873 /* Write the assembler code to define one. */
1874 align
= floor_log2 (TRAMPOLINE_ALIGNMENT
/ BITS_PER_UNIT
);
1876 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1878 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LTRAMP", 0);
1879 TRAMPOLINE_TEMPLATE (asm_out_file
);
1881 /* Record the rtl to refer to it. */
1882 ASM_GENERATE_INTERNAL_LABEL (label
, "LTRAMP", 0);
1883 name
= ggc_alloc_string (label
, -1);
1884 return gen_rtx_SYMBOL_REF (Pmode
, name
);
1888 /* Assemble the integer constant X into an object of SIZE bytes.
1889 X must be either a CONST_INT or CONST_DOUBLE.
1891 Return 1 if we were able to output the constant, otherwise 0. If FORCE is
1892 non-zero, abort if we can't output the constant. */
1895 assemble_integer (x
, size
, force
)
1900 /* First try to use the standard 1, 2, 4, 8, and 16 byte
1901 ASM_OUTPUT... macros. */
1905 #ifdef ASM_OUTPUT_CHAR
1907 ASM_OUTPUT_CHAR (asm_out_file
, x
);
1911 #ifdef ASM_OUTPUT_SHORT
1913 ASM_OUTPUT_SHORT (asm_out_file
, x
);
1917 #ifdef ASM_OUTPUT_INT
1919 ASM_OUTPUT_INT (asm_out_file
, x
);
1923 #ifdef ASM_OUTPUT_DOUBLE_INT
1925 ASM_OUTPUT_DOUBLE_INT (asm_out_file
, x
);
1929 #ifdef ASM_OUTPUT_QUADRUPLE_INT
1931 ASM_OUTPUT_QUADRUPLE_INT (asm_out_file
, x
);
1936 /* If we couldn't do it that way, there are two other possibilities: First,
1937 if the machine can output an explicit byte and this is a 1 byte constant,
1938 we can use ASM_OUTPUT_BYTE. */
1940 #ifdef ASM_OUTPUT_BYTE
1941 if (size
== 1 && GET_CODE (x
) == CONST_INT
)
1943 ASM_OUTPUT_BYTE (asm_out_file
, INTVAL (x
));
1948 /* Finally, if SIZE is larger than a single word, try to output the constant
1949 one word at a time. */
1951 if (size
> UNITS_PER_WORD
)
1954 enum machine_mode mode
1955 = mode_for_size (size
* BITS_PER_UNIT
, MODE_INT
, 0);
1958 for (i
= 0; i
< size
/ UNITS_PER_WORD
; i
++)
1960 word
= operand_subword (x
, i
, 0, mode
);
1965 if (! assemble_integer (word
, UNITS_PER_WORD
, 0))
1969 if (i
== size
/ UNITS_PER_WORD
)
1971 /* If we output at least one word and then could not finish,
1972 there is no valid way to continue. */
1983 /* Assemble the floating-point constant D into an object of size MODE. */
1986 assemble_real (d
, mode
)
1988 enum machine_mode mode
;
1990 jmp_buf output_constant_handler
;
1992 if (setjmp (output_constant_handler
))
1994 error ("floating point trap outputting a constant");
1995 #ifdef REAL_IS_NOT_DOUBLE
1996 bzero ((char *) &d
, sizeof d
);
2003 set_float_handler (output_constant_handler
);
2007 #ifdef ASM_OUTPUT_BYTE_FLOAT
2009 ASM_OUTPUT_BYTE_FLOAT (asm_out_file
, d
);
2012 #ifdef ASM_OUTPUT_SHORT_FLOAT
2014 ASM_OUTPUT_SHORT_FLOAT (asm_out_file
, d
);
2017 #ifdef ASM_OUTPUT_THREE_QUARTER_FLOAT
2019 ASM_OUTPUT_THREE_QUARTER_FLOAT (asm_out_file
, d
);
2022 #ifdef ASM_OUTPUT_FLOAT
2024 ASM_OUTPUT_FLOAT (asm_out_file
, d
);
2028 #ifdef ASM_OUTPUT_DOUBLE
2030 ASM_OUTPUT_DOUBLE (asm_out_file
, d
);
2034 #ifdef ASM_OUTPUT_LONG_DOUBLE
2037 ASM_OUTPUT_LONG_DOUBLE (asm_out_file
, d
);
2045 set_float_handler (NULL_PTR
);
2048 /* Here we combine duplicate floating constants to make
2049 CONST_DOUBLE rtx's, and force those out to memory when necessary. */
2051 /* Return a CONST_DOUBLE or CONST_INT for a value specified as a pair of ints.
2052 For an integer, I0 is the low-order word and I1 is the high-order word.
2053 For a real number, I0 is the word with the low address
2054 and I1 is the word with the high address. */
2057 immed_double_const (i0
, i1
, mode
)
2058 HOST_WIDE_INT i0
, i1
;
2059 enum machine_mode mode
;
2063 if (GET_MODE_CLASS (mode
) == MODE_INT
2064 || GET_MODE_CLASS (mode
) == MODE_PARTIAL_INT
)
2066 /* We clear out all bits that don't belong in MODE, unless they and our
2067 sign bit are all one. So we get either a reasonable negative value
2068 or a reasonable unsigned value for this mode. */
2069 int width
= GET_MODE_BITSIZE (mode
);
2070 if (width
< HOST_BITS_PER_WIDE_INT
2071 && ((i0
& ((HOST_WIDE_INT
) (-1) << (width
- 1)))
2072 != ((HOST_WIDE_INT
) (-1) << (width
- 1))))
2073 i0
&= ((HOST_WIDE_INT
) 1 << width
) - 1, i1
= 0;
2074 else if (width
== HOST_BITS_PER_WIDE_INT
2075 && ! (i1
== ~0 && i0
< 0))
2077 else if (width
> 2 * HOST_BITS_PER_WIDE_INT
)
2078 /* We cannot represent this value as a constant. */
2081 /* If this would be an entire word for the target, but is not for
2082 the host, then sign-extend on the host so that the number will look
2083 the same way on the host that it would on the target.
2085 For example, when building a 64 bit alpha hosted 32 bit sparc
2086 targeted compiler, then we want the 32 bit unsigned value -1 to be
2087 represented as a 64 bit value -1, and not as 0x00000000ffffffff.
2088 The later confuses the sparc backend. */
2090 if (BITS_PER_WORD
< HOST_BITS_PER_WIDE_INT
&& BITS_PER_WORD
== width
2091 && (i0
& ((HOST_WIDE_INT
) 1 << (width
- 1))))
2092 i0
|= ((HOST_WIDE_INT
) (-1) << width
);
2094 /* If MODE fits within HOST_BITS_PER_WIDE_INT, always use a CONST_INT.
2096 ??? Strictly speaking, this is wrong if we create a CONST_INT
2097 for a large unsigned constant with the size of MODE being
2098 HOST_BITS_PER_WIDE_INT and later try to interpret that constant in a
2099 wider mode. In that case we will mis-interpret it as a negative
2102 Unfortunately, the only alternative is to make a CONST_DOUBLE
2103 for any constant in any mode if it is an unsigned constant larger
2104 than the maximum signed integer in an int on the host. However,
2105 doing this will break everyone that always expects to see a CONST_INT
2106 for SImode and smaller.
2108 We have always been making CONST_INTs in this case, so nothing new
2111 if (width
<= HOST_BITS_PER_WIDE_INT
)
2112 i1
= (i0
< 0) ? ~(HOST_WIDE_INT
) 0 : 0;
2114 /* If this integer fits in one word, return a CONST_INT. */
2115 if ((i1
== 0 && i0
>= 0)
2116 || (i1
== ~0 && i0
< 0))
2117 return GEN_INT (i0
);
2119 /* We use VOIDmode for integers. */
2123 /* Search the chain for an existing CONST_DOUBLE with the right value.
2124 If one is found, return it. */
2126 for (r
= const_double_chain
; r
; r
= CONST_DOUBLE_CHAIN (r
))
2127 if (CONST_DOUBLE_LOW (r
) == i0
&& CONST_DOUBLE_HIGH (r
) == i1
2128 && GET_MODE (r
) == mode
)
2131 /* No; make a new one and add it to the chain.
2133 We may be called by an optimizer which may be discarding any memory
2134 allocated during its processing (such as combine and loop). However,
2135 we will be leaving this constant on the chain, so we cannot tolerate
2136 freed memory. So switch to saveable_obstack for this allocation
2137 and then switch back if we were in current_obstack. */
2139 push_obstacks_nochange ();
2140 rtl_in_saveable_obstack ();
2141 r
= gen_rtx_CONST_DOUBLE (mode
, NULL_RTX
, i0
, i1
);
2144 /* Don't touch const_double_chain if not inside any function. */
2145 if (current_function_decl
!= 0)
2147 CONST_DOUBLE_CHAIN (r
) = const_double_chain
;
2148 const_double_chain
= r
;
2151 /* Store const0_rtx in mem-slot since this CONST_DOUBLE is on the chain.
2152 Actual use of mem-slot is only through force_const_mem. */
2154 CONST_DOUBLE_MEM (r
) = const0_rtx
;
2159 /* Return a CONST_DOUBLE for a specified `double' value
2160 and machine mode. */
2163 immed_real_const_1 (d
, mode
)
2165 enum machine_mode mode
;
2167 union real_extract u
;
2170 /* Get the desired `double' value as a sequence of ints
2171 since that is how they are stored in a CONST_DOUBLE. */
2175 /* Detect special cases. */
2177 if (REAL_VALUES_IDENTICAL (dconst0
, d
))
2178 return CONST0_RTX (mode
);
2179 /* Check for NaN first, because some ports (specifically the i386) do not
2180 emit correct ieee-fp code by default, and thus will generate a core
2181 dump here if we pass a NaN to REAL_VALUES_EQUAL and if REAL_VALUES_EQUAL
2182 does a floating point comparison. */
2183 else if (! REAL_VALUE_ISNAN (d
) && REAL_VALUES_EQUAL (dconst1
, d
))
2184 return CONST1_RTX (mode
);
2186 if (sizeof u
== sizeof (HOST_WIDE_INT
))
2187 return immed_double_const (u
.i
[0], 0, mode
);
2188 if (sizeof u
== 2 * sizeof (HOST_WIDE_INT
))
2189 return immed_double_const (u
.i
[0], u
.i
[1], mode
);
2191 /* The rest of this function handles the case where
2192 a float value requires more than 2 ints of space.
2193 It will be deleted as dead code on machines that don't need it. */
2195 /* Search the chain for an existing CONST_DOUBLE with the right value.
2196 If one is found, return it. */
2198 for (r
= const_double_chain
; r
; r
= CONST_DOUBLE_CHAIN (r
))
2199 if (! bcmp ((char *) &CONST_DOUBLE_LOW (r
), (char *) &u
, sizeof u
)
2200 && GET_MODE (r
) == mode
)
2203 /* No; make a new one and add it to the chain.
2205 We may be called by an optimizer which may be discarding any memory
2206 allocated during its processing (such as combine and loop). However,
2207 we will be leaving this constant on the chain, so we cannot tolerate
2208 freed memory. So switch to saveable_obstack for this allocation
2209 and then switch back if we were in current_obstack. */
2210 push_obstacks_nochange ();
2211 rtl_in_saveable_obstack ();
2212 r
= rtx_alloc (CONST_DOUBLE
);
2215 bcopy ((char *) &u
, (char *) &CONST_DOUBLE_LOW (r
), sizeof u
);
2217 /* Don't touch const_double_chain if not inside any function. */
2218 if (current_function_decl
!= 0)
2220 CONST_DOUBLE_CHAIN (r
) = const_double_chain
;
2221 const_double_chain
= r
;
2224 /* Store const0_rtx in CONST_DOUBLE_MEM since this CONST_DOUBLE is on the
2225 chain, but has not been allocated memory. Actual use of CONST_DOUBLE_MEM
2226 is only through force_const_mem. */
2228 CONST_DOUBLE_MEM (r
) = const0_rtx
;
2233 /* Return a CONST_DOUBLE rtx for a value specified by EXP,
2234 which must be a REAL_CST tree node. */
2237 immed_real_const (exp
)
2240 return immed_real_const_1 (TREE_REAL_CST (exp
), TYPE_MODE (TREE_TYPE (exp
)));
2243 /* At the end of a function, forget the memory-constants
2244 previously made for CONST_DOUBLEs. Mark them as not on real_constant_chain.
2245 Also clear out real_constant_chain and clear out all the chain-pointers. */
2248 clear_const_double_mem ()
2250 register rtx r
, next
;
2252 for (r
= const_double_chain
; r
; r
= next
)
2254 next
= CONST_DOUBLE_CHAIN (r
);
2255 CONST_DOUBLE_CHAIN (r
) = 0;
2256 CONST_DOUBLE_MEM (r
) = cc0_rtx
;
2258 const_double_chain
= 0;
2261 /* Given an expression EXP with a constant value,
2262 reduce it to the sum of an assembler symbol and an integer.
2263 Store them both in the structure *VALUE.
2264 Abort if EXP does not reduce. */
2269 HOST_WIDE_INT offset
;
2273 decode_addr_const (exp
, value
)
2275 struct addr_const
*value
;
2277 register tree target
= TREE_OPERAND (exp
, 0);
2278 register int offset
= 0;
2283 if (TREE_CODE (target
) == COMPONENT_REF
2284 && host_integerp (bit_position (TREE_OPERAND (target
, 1)), 0))
2288 += int_bit_position (TREE_OPERAND (target
, 1)) / BITS_PER_UNIT
;
2290 target
= TREE_OPERAND (target
, 0);
2292 else if (TREE_CODE (target
) == ARRAY_REF
)
2294 if (TREE_CODE (TREE_OPERAND (target
, 1)) != INTEGER_CST
2295 || TREE_CODE (TYPE_SIZE (TREE_TYPE (target
))) != INTEGER_CST
)
2297 offset
+= ((TREE_INT_CST_LOW (TYPE_SIZE (TREE_TYPE (target
)))
2298 * TREE_INT_CST_LOW (TREE_OPERAND (target
, 1)))
2300 target
= TREE_OPERAND (target
, 0);
2306 switch (TREE_CODE (target
))
2310 x
= DECL_RTL (target
);
2314 x
= gen_rtx_MEM (FUNCTION_MODE
,
2315 gen_rtx_LABEL_REF (VOIDmode
,
2316 label_rtx (TREE_OPERAND (exp
, 0))));
2324 x
= TREE_CST_RTL (target
);
2331 if (GET_CODE (x
) != MEM
)
2336 value
->offset
= offset
;
2339 /* Uniquize all constants that appear in memory.
2340 Each constant in memory thus far output is recorded
2341 in `const_hash_table' with a `struct constant_descriptor'
2342 that contains a polish representation of the value of
2345 We cannot store the trees in the hash table
2346 because the trees may be temporary. */
2348 struct constant_descriptor
2350 struct constant_descriptor
*next
;
2357 #define MAX_HASH_TABLE 1009
2358 static struct constant_descriptor
*const_hash_table
[MAX_HASH_TABLE
];
2360 /* Mark a const_hash_table descriptor for GC. */
2363 mark_const_hash_entry (ptr
)
2366 struct constant_descriptor
*desc
= * (struct constant_descriptor
**) ptr
;
2370 ggc_mark_string (desc
->label
);
2371 ggc_mark_rtx (desc
->rtl
);
2376 /* Compute a hash code for a constant expression. */
2382 register const char *p
;
2383 register int len
, hi
, i
;
2384 register enum tree_code code
= TREE_CODE (exp
);
2386 /* Either set P and LEN to the address and len of something to hash and
2387 exit the switch or return a value. */
2392 p
= (char *) &TREE_INT_CST_LOW (exp
);
2393 len
= 2 * sizeof TREE_INT_CST_LOW (exp
);
2397 p
= (char *) &TREE_REAL_CST (exp
);
2398 len
= sizeof TREE_REAL_CST (exp
);
2402 p
= TREE_STRING_POINTER (exp
);
2403 len
= TREE_STRING_LENGTH (exp
);
2407 return (const_hash (TREE_REALPART (exp
)) * 5
2408 + const_hash (TREE_IMAGPART (exp
)));
2411 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2415 len
= int_size_in_bytes (TREE_TYPE (exp
));
2416 tmp
= (char *) alloca (len
);
2417 get_set_constructor_bytes (exp
, (unsigned char *) tmp
, len
);
2425 /* For record type, include the type in the hashing.
2426 We do not do so for array types
2427 because (1) the sizes of the elements are sufficient
2428 and (2) distinct array types can have the same constructor.
2429 Instead, we include the array size because the constructor could
2431 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2432 hi
= ((unsigned long) TREE_TYPE (exp
) & ((1 << HASHBITS
) - 1))
2435 hi
= ((5 + int_size_in_bytes (TREE_TYPE (exp
)))
2436 & ((1 << HASHBITS
) - 1)) % MAX_HASH_TABLE
;
2438 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2439 if (TREE_VALUE (link
))
2441 = (hi
* 603 + const_hash (TREE_VALUE (link
))) % MAX_HASH_TABLE
;
2448 struct addr_const value
;
2450 decode_addr_const (exp
, &value
);
2451 if (GET_CODE (value
.base
) == SYMBOL_REF
)
2453 /* Don't hash the address of the SYMBOL_REF;
2454 only use the offset and the symbol name. */
2456 p
= XSTR (value
.base
, 0);
2457 for (i
= 0; p
[i
] != 0; i
++)
2458 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2460 else if (GET_CODE (value
.base
) == LABEL_REF
)
2461 hi
= value
.offset
+ CODE_LABEL_NUMBER (XEXP (value
.base
, 0)) * 13;
2465 hi
&= (1 << HASHBITS
) - 1;
2466 hi
%= MAX_HASH_TABLE
;
2472 return (const_hash (TREE_OPERAND (exp
, 0)) * 9
2473 + const_hash (TREE_OPERAND (exp
, 1)));
2477 case NON_LVALUE_EXPR
:
2478 return const_hash (TREE_OPERAND (exp
, 0)) * 7 + 2;
2484 /* Compute hashing function */
2486 for (i
= 0; i
< len
; i
++)
2487 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2489 hi
&= (1 << HASHBITS
) - 1;
2490 hi
%= MAX_HASH_TABLE
;
2494 /* Compare a constant expression EXP with a constant-descriptor DESC.
2495 Return 1 if DESC describes a constant with the same value as EXP. */
2498 compare_constant (exp
, desc
)
2500 struct constant_descriptor
*desc
;
2502 return 0 != compare_constant_1 (exp
, desc
->contents
);
2505 /* Compare constant expression EXP with a substring P of a constant descriptor.
2506 If they match, return a pointer to the end of the substring matched.
2507 If they do not match, return 0.
2509 Since descriptors are written in polish prefix notation,
2510 this function can be used recursively to test one operand of EXP
2511 against a subdescriptor, and if it succeeds it returns the
2512 address of the subdescriptor for the next operand. */
2515 compare_constant_1 (exp
, p
)
2519 register const char *strp
;
2521 register enum tree_code code
= TREE_CODE (exp
);
2523 if (code
!= (enum tree_code
) *p
++)
2526 /* Either set STRP, P and LEN to pointers and length to compare and exit the
2527 switch, or return the result of the comparison. */
2532 /* Integer constants are the same only if the same width of type. */
2533 if (*p
++ != TYPE_PRECISION (TREE_TYPE (exp
)))
2536 strp
= (char *) &TREE_INT_CST_LOW (exp
);
2537 len
= 2 * sizeof TREE_INT_CST_LOW (exp
);
2541 /* Real constants are the same only if the same width of type. */
2542 if (*p
++ != TYPE_PRECISION (TREE_TYPE (exp
)))
2545 strp
= (char *) &TREE_REAL_CST (exp
);
2546 len
= sizeof TREE_REAL_CST (exp
);
2550 if (flag_writable_strings
)
2553 if ((enum machine_mode
) *p
++ != TYPE_MODE (TREE_TYPE (exp
)))
2556 strp
= TREE_STRING_POINTER (exp
);
2557 len
= TREE_STRING_LENGTH (exp
);
2558 if (bcmp ((char *) &TREE_STRING_LENGTH (exp
), p
,
2559 sizeof TREE_STRING_LENGTH (exp
)))
2562 p
+= sizeof TREE_STRING_LENGTH (exp
);
2566 p
= compare_constant_1 (TREE_REALPART (exp
), p
);
2570 return compare_constant_1 (TREE_IMAGPART (exp
), p
);
2573 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2575 int xlen
= len
= int_size_in_bytes (TREE_TYPE (exp
));
2576 unsigned char *tmp
= (unsigned char *) alloca (len
);
2578 get_set_constructor_bytes (exp
, (unsigned char *) tmp
, len
);
2580 if (bcmp ((char *) &xlen
, p
, sizeof xlen
))
2589 int length
= list_length (CONSTRUCTOR_ELTS (exp
));
2591 enum machine_mode mode
= TYPE_MODE (TREE_TYPE (exp
));
2592 int have_purpose
= 0;
2594 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2595 if (TREE_PURPOSE (link
))
2598 if (bcmp ((char *) &length
, p
, sizeof length
))
2603 /* For record constructors, insist that the types match.
2604 For arrays, just verify both constructors are for arrays.
2605 Then insist that either both or none have any TREE_PURPOSE
2607 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2608 type
= TREE_TYPE (exp
);
2612 if (bcmp ((char *) &type
, p
, sizeof type
))
2615 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2617 if (bcmp ((char *) &mode
, p
, sizeof mode
))
2625 if (bcmp ((char *) &have_purpose
, p
, sizeof have_purpose
))
2628 p
+= sizeof have_purpose
;
2630 /* For arrays, insist that the size in bytes match. */
2631 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2633 HOST_WIDE_INT size
= int_size_in_bytes (TREE_TYPE (exp
));
2635 if (bcmp ((char *) &size
, p
, sizeof size
))
2641 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2643 if (TREE_VALUE (link
))
2645 if ((p
= compare_constant_1 (TREE_VALUE (link
), p
)) == 0)
2652 if (bcmp ((char *) &zero
, p
, sizeof zero
))
2658 if (TREE_PURPOSE (link
)
2659 && TREE_CODE (TREE_PURPOSE (link
)) == FIELD_DECL
)
2661 if (bcmp ((char *) &TREE_PURPOSE (link
), p
,
2662 sizeof TREE_PURPOSE (link
)))
2665 p
+= sizeof TREE_PURPOSE (link
);
2667 else if (TREE_PURPOSE (link
))
2669 if ((p
= compare_constant_1 (TREE_PURPOSE (link
), p
)) == 0)
2672 else if (have_purpose
)
2676 if (bcmp ((char *) &zero
, p
, sizeof zero
))
2688 struct addr_const value
;
2690 decode_addr_const (exp
, &value
);
2691 strp
= (char *) &value
.offset
;
2692 len
= sizeof value
.offset
;
2693 /* Compare the offset. */
2695 if (*p
++ != *strp
++)
2698 /* Compare symbol name. */
2699 strp
= XSTR (value
.base
, 0);
2700 len
= strlen (strp
) + 1;
2707 p
= compare_constant_1 (TREE_OPERAND (exp
, 0), p
);
2711 return compare_constant_1 (TREE_OPERAND (exp
, 1), p
);
2715 case NON_LVALUE_EXPR
:
2716 return compare_constant_1 (TREE_OPERAND (exp
, 0), p
);
2722 /* Compare constant contents. */
2724 if (*p
++ != *strp
++)
2730 /* Construct a constant descriptor for the expression EXP.
2731 It is up to the caller to enter the descriptor in the hash table. */
2733 static struct constant_descriptor
*
2734 record_constant (exp
)
2737 struct constant_descriptor
*next
= 0;
2741 /* Make a struct constant_descriptor. The first three pointers will
2742 be filled in later. Here we just leave space for them. */
2744 obstack_grow (&permanent_obstack
, (char *) &next
, sizeof next
);
2745 obstack_grow (&permanent_obstack
, (char *) &label
, sizeof label
);
2746 obstack_grow (&permanent_obstack
, (char *) &rtl
, sizeof rtl
);
2747 record_constant_1 (exp
);
2748 return (struct constant_descriptor
*) obstack_finish (&permanent_obstack
);
2751 /* Add a description of constant expression EXP
2752 to the object growing in `permanent_obstack'.
2753 No need to return its address; the caller will get that
2754 from the obstack when the object is complete. */
2757 record_constant_1 (exp
)
2760 register char *strp
;
2762 register enum tree_code code
= TREE_CODE (exp
);
2764 obstack_1grow (&permanent_obstack
, (unsigned int) code
);
2769 obstack_1grow (&permanent_obstack
, TYPE_PRECISION (TREE_TYPE (exp
)));
2770 strp
= (char *) &TREE_INT_CST_LOW (exp
);
2771 len
= 2 * sizeof TREE_INT_CST_LOW (exp
);
2775 obstack_1grow (&permanent_obstack
, TYPE_PRECISION (TREE_TYPE (exp
)));
2776 strp
= (char *) &TREE_REAL_CST (exp
);
2777 len
= sizeof TREE_REAL_CST (exp
);
2781 if (flag_writable_strings
)
2784 obstack_1grow (&permanent_obstack
, TYPE_MODE (TREE_TYPE (exp
)));
2785 strp
= TREE_STRING_POINTER (exp
);
2786 len
= TREE_STRING_LENGTH (exp
);
2787 obstack_grow (&permanent_obstack
, (char *) &TREE_STRING_LENGTH (exp
),
2788 sizeof TREE_STRING_LENGTH (exp
));
2792 record_constant_1 (TREE_REALPART (exp
));
2793 record_constant_1 (TREE_IMAGPART (exp
));
2797 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2799 int nbytes
= int_size_in_bytes (TREE_TYPE (exp
));
2800 obstack_grow (&permanent_obstack
, &nbytes
, sizeof (nbytes
));
2801 obstack_blank (&permanent_obstack
, nbytes
);
2802 get_set_constructor_bytes
2803 (exp
, (unsigned char *) permanent_obstack
.next_free
-nbytes
,
2810 int length
= list_length (CONSTRUCTOR_ELTS (exp
));
2811 enum machine_mode mode
= TYPE_MODE (TREE_TYPE (exp
));
2813 int have_purpose
= 0;
2815 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2816 if (TREE_PURPOSE (link
))
2819 obstack_grow (&permanent_obstack
, (char *) &length
, sizeof length
);
2821 /* For record constructors, insist that the types match.
2822 For arrays, just verify both constructors are for arrays
2823 of the same mode. Then insist that either both or none
2824 have any TREE_PURPOSE values. */
2825 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2826 type
= TREE_TYPE (exp
);
2830 obstack_grow (&permanent_obstack
, (char *) &type
, sizeof type
);
2831 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2832 obstack_grow (&permanent_obstack
, &mode
, sizeof mode
);
2834 obstack_grow (&permanent_obstack
, (char *) &have_purpose
,
2835 sizeof have_purpose
);
2837 /* For arrays, insist that the size in bytes match. */
2838 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2840 HOST_WIDE_INT size
= int_size_in_bytes (TREE_TYPE (exp
));
2841 obstack_grow (&permanent_obstack
, (char *) &size
, sizeof size
);
2844 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2846 if (TREE_VALUE (link
))
2847 record_constant_1 (TREE_VALUE (link
));
2852 obstack_grow (&permanent_obstack
,
2853 (char *) &zero
, sizeof zero
);
2856 if (TREE_PURPOSE (link
)
2857 && TREE_CODE (TREE_PURPOSE (link
)) == FIELD_DECL
)
2858 obstack_grow (&permanent_obstack
,
2859 (char *) &TREE_PURPOSE (link
),
2860 sizeof TREE_PURPOSE (link
));
2861 else if (TREE_PURPOSE (link
))
2862 record_constant_1 (TREE_PURPOSE (link
));
2863 else if (have_purpose
)
2867 obstack_grow (&permanent_obstack
,
2868 (char *) &zero
, sizeof zero
);
2876 struct addr_const value
;
2878 decode_addr_const (exp
, &value
);
2879 /* Record the offset. */
2880 obstack_grow (&permanent_obstack
,
2881 (char *) &value
.offset
, sizeof value
.offset
);
2882 /* Record the symbol name. */
2883 obstack_grow (&permanent_obstack
, XSTR (value
.base
, 0),
2884 strlen (XSTR (value
.base
, 0)) + 1);
2891 record_constant_1 (TREE_OPERAND (exp
, 0));
2892 record_constant_1 (TREE_OPERAND (exp
, 1));
2897 case NON_LVALUE_EXPR
:
2898 record_constant_1 (TREE_OPERAND (exp
, 0));
2905 /* Record constant contents. */
2906 obstack_grow (&permanent_obstack
, strp
, len
);
2909 /* Record a list of constant expressions that were passed to
2910 output_constant_def but that could not be output right away. */
2912 struct deferred_constant
2914 struct deferred_constant
*next
;
2920 static struct deferred_constant
*deferred_constants
;
2922 /* Another list of constants which should be output after the
2924 static struct deferred_constant
*after_function_constants
;
2926 /* Nonzero means defer output of addressed subconstants
2927 (i.e., those for which output_constant_def is called.) */
2928 static int defer_addressed_constants_flag
;
2930 /* Start deferring output of subconstants. */
2933 defer_addressed_constants ()
2935 defer_addressed_constants_flag
++;
2938 /* Stop deferring output of subconstants,
2939 and output now all those that have been deferred. */
2942 output_deferred_addressed_constants ()
2944 struct deferred_constant
*p
, *next
;
2946 defer_addressed_constants_flag
--;
2948 if (defer_addressed_constants_flag
> 0)
2951 for (p
= deferred_constants
; p
; p
= next
)
2953 output_constant_def_contents (p
->exp
, p
->reloc
, p
->labelno
);
2958 deferred_constants
= 0;
2961 /* Output any constants which should appear after a function. */
2964 output_after_function_constants ()
2966 struct deferred_constant
*p
, *next
;
2968 for (p
= after_function_constants
; p
; p
= next
)
2970 output_constant_def_contents (p
->exp
, p
->reloc
, p
->labelno
);
2975 after_function_constants
= 0;
2978 /* Make a copy of the whole tree structure for a constant.
2979 This handles the same types of nodes that compare_constant
2980 and record_constant handle. */
2986 switch (TREE_CODE (exp
))
2989 /* For ADDR_EXPR, we do not want to copy the decl whose address
2990 is requested. We do want to copy constants though. */
2991 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, 0))) == 'c')
2992 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2993 copy_constant (TREE_OPERAND (exp
, 0)));
2995 return copy_node (exp
);
3000 return copy_node (exp
);
3003 return build_complex (TREE_TYPE (exp
),
3004 copy_constant (TREE_REALPART (exp
)),
3005 copy_constant (TREE_IMAGPART (exp
)));
3009 return build (TREE_CODE (exp
), TREE_TYPE (exp
),
3010 copy_constant (TREE_OPERAND (exp
, 0)),
3011 copy_constant (TREE_OPERAND (exp
, 1)));
3015 case NON_LVALUE_EXPR
:
3016 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
3017 copy_constant (TREE_OPERAND (exp
, 0)));
3021 tree copy
= copy_node (exp
);
3022 tree list
= copy_list (CONSTRUCTOR_ELTS (exp
));
3025 CONSTRUCTOR_ELTS (copy
) = list
;
3026 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
3027 TREE_VALUE (tail
) = copy_constant (TREE_VALUE (tail
));
3028 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
3029 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
3030 TREE_PURPOSE (tail
) = copy_constant (TREE_PURPOSE (tail
));
3040 /* Return an rtx representing a reference to constant data in memory
3041 for the constant expression EXP.
3043 If assembler code for such a constant has already been output,
3044 return an rtx to refer to it.
3045 Otherwise, output such a constant in memory (or defer it for later)
3046 and generate an rtx for it.
3048 The TREE_CST_RTL of EXP is set up to point to that rtx.
3049 The const_hash_table records which constants already have label strings. */
3052 output_constant_def (exp
)
3056 register struct constant_descriptor
*desc
;
3061 if (TREE_CST_RTL (exp
))
3062 return TREE_CST_RTL (exp
);
3064 /* Make sure any other constants whose addresses appear in EXP
3065 are assigned label numbers. */
3067 reloc
= output_addressed_constants (exp
);
3069 /* Compute hash code of EXP. Search the descriptors for that hash code
3070 to see if any of them describes EXP. If yes, the descriptor records
3071 the label number already assigned. */
3073 hash
= const_hash (exp
) % MAX_HASH_TABLE
;
3075 for (desc
= const_hash_table
[hash
]; desc
; desc
= desc
->next
)
3076 if (compare_constant (exp
, desc
))
3081 /* No constant equal to EXP is known to have been output.
3082 Make a constant descriptor to enter EXP in the hash table.
3083 Assign the label number and record it in the descriptor for
3084 future calls to this function to find. */
3086 /* Create a string containing the label name, in LABEL. */
3087 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
3089 desc
= record_constant (exp
);
3090 desc
->next
= const_hash_table
[hash
];
3091 desc
->label
= ggc_alloc_string (label
, -1);
3092 const_hash_table
[hash
] = desc
;
3094 /* We have a symbol name; construct the SYMBOL_REF and the MEM
3095 in the permanent obstack. We could also construct this in the
3096 obstack of EXP and put it into TREE_CST_RTL, but we have no way
3097 of knowing what obstack it is (e.g., it might be in a function
3098 obstack of a function we are nested inside). */
3100 push_obstacks_nochange ();
3101 end_temporary_allocation ();
3104 = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp
)),
3105 gen_rtx_SYMBOL_REF (Pmode
, desc
->label
));
3107 RTX_UNCHANGING_P (desc
->rtl
) = 1;
3108 if (AGGREGATE_TYPE_P (TREE_TYPE (exp
)))
3109 MEM_SET_IN_STRUCT_P (desc
->rtl
, 1);
3116 TREE_CST_RTL (exp
) = desc
->rtl
;
3118 /* Optionally set flags or add text to the name to record information
3119 such as that it is a function name. If the name is changed, the macro
3120 ASM_OUTPUT_LABELREF will have to know how to strip this information. */
3121 #ifdef ENCODE_SECTION_INFO
3122 ENCODE_SECTION_INFO (exp
);
3125 /* If this is the first time we've seen this particular constant,
3126 output it (or defer its output for later). */
3129 int after_function
= 0;
3131 #ifdef CONSTANT_AFTER_FUNCTION_P
3132 if (current_function_decl
!= 0
3133 && CONSTANT_AFTER_FUNCTION_P (exp
))
3137 if (defer_addressed_constants_flag
|| after_function
)
3139 struct deferred_constant
*p
;
3140 p
= (struct deferred_constant
*) xmalloc (sizeof (struct deferred_constant
));
3142 push_obstacks_nochange ();
3143 suspend_momentary ();
3144 p
->exp
= copy_constant (exp
);
3147 p
->labelno
= const_labelno
++;
3150 p
->next
= after_function_constants
;
3151 after_function_constants
= p
;
3155 p
->next
= deferred_constants
;
3156 deferred_constants
= p
;
3161 /* Do no output if -fsyntax-only. */
3162 if (! flag_syntax_only
)
3163 output_constant_def_contents (exp
, reloc
, const_labelno
);
3168 return TREE_CST_RTL (exp
);
3171 /* Now output assembler code to define the label for EXP,
3172 and follow it with the data of EXP. */
3175 output_constant_def_contents (exp
, reloc
, labelno
)
3182 if (IN_NAMED_SECTION (exp
))
3183 named_section (exp
, NULL
, reloc
);
3186 /* First switch to text section, except for writable strings. */
3187 #ifdef SELECT_SECTION
3188 SELECT_SECTION (exp
, reloc
);
3190 if (((TREE_CODE (exp
) == STRING_CST
) && flag_writable_strings
)
3191 || (flag_pic
&& reloc
))
3194 readonly_data_section ();
3198 /* Align the location counter as required by EXP's data type. */
3199 align
= TYPE_ALIGN (TREE_TYPE (exp
));
3200 #ifdef CONSTANT_ALIGNMENT
3201 align
= CONSTANT_ALIGNMENT (exp
, align
);
3204 if (align
> BITS_PER_UNIT
)
3205 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
3207 /* Output the label itself. */
3208 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LC", labelno
);
3210 /* Output the value of EXP. */
3211 output_constant (exp
,
3212 (TREE_CODE (exp
) == STRING_CST
3213 ? TREE_STRING_LENGTH (exp
)
3214 : int_size_in_bytes (TREE_TYPE (exp
))));
3218 /* Structure to represent sufficient information about a constant so that
3219 it can be output when the constant pool is output, so that function
3220 integration can be done, and to simplify handling on machines that reference
3221 constant pool as base+displacement. */
3223 struct pool_constant
3225 struct constant_descriptor
*desc
;
3226 struct pool_constant
*next
;
3227 enum machine_mode mode
;
3235 /* Structure used to maintain hash table mapping symbols used to their
3236 corresponding constants. */
3241 struct pool_constant
*pool
;
3242 struct pool_sym
*next
;
3245 /* Hash code for a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true.
3246 The argument is XSTR (... , 0) */
3248 #define SYMHASH(LABEL) \
3249 ((((unsigned long) (LABEL)) & ((1 << HASHBITS) - 1)) % MAX_RTX_HASH_TABLE)
3251 /* Initialize constant pool hashing for a new function. */
3254 init_varasm_status (f
)
3257 struct varasm_status
*p
;
3258 p
= (struct varasm_status
*) xmalloc (sizeof (struct varasm_status
));
3260 p
->x_const_rtx_hash_table
3261 = ((struct constant_descriptor
**)
3262 xmalloc (MAX_RTX_HASH_TABLE
* sizeof (struct constant_descriptor
*)));
3263 p
->x_const_rtx_sym_hash_table
3264 = ((struct pool_sym
**)
3265 xmalloc (MAX_RTX_HASH_TABLE
* sizeof (struct pool_sym
*)));
3266 bzero ((char *) p
->x_const_rtx_hash_table
,
3267 MAX_RTX_HASH_TABLE
* sizeof (struct constant_descriptor
*));
3268 bzero ((char *) p
->x_const_rtx_sym_hash_table
,
3269 MAX_RTX_HASH_TABLE
* sizeof (struct pool_sym
*));
3271 p
->x_first_pool
= p
->x_last_pool
= 0;
3272 p
->x_pool_offset
= 0;
3273 p
->x_const_double_chain
= 0;
3276 /* Mark PC for GC. */
3279 mark_pool_constant (pc
)
3280 struct pool_constant
*pc
;
3284 ggc_mark_rtx (pc
->constant
);
3289 /* Mark PPS for GC. */
3292 mark_pool_sym_hash_table (pps
)
3293 struct pool_sym
**pps
;
3295 struct pool_sym
*ps
;
3298 for (i
= 0; i
< MAX_RTX_HASH_TABLE
; ++i
)
3299 for (ps
= pps
[i
]; ps
; ps
= ps
->next
)
3300 ggc_mark_string (ps
->label
);
3303 /* Mark P for GC. */
3306 mark_varasm_status (p
)
3307 struct varasm_status
*p
;
3312 mark_pool_constant (p
->x_first_pool
);
3313 mark_pool_sym_hash_table (p
->x_const_rtx_sym_hash_table
);
3314 ggc_mark_rtx (p
->x_const_double_chain
);
3317 /* Clear out all parts of the state in F that can safely be discarded
3318 after the function has been compiled, to let garbage collection
3319 reclaim the memory. */
3322 free_varasm_status (f
)
3325 struct varasm_status
*p
;
3328 free (p
->x_const_rtx_hash_table
);
3329 free (p
->x_const_rtx_sym_hash_table
);
3334 enum kind
{ RTX_DOUBLE
, RTX_INT
};
3338 #ifdef ONLY_INT_FIELDS
3339 unsigned int kind
: 16;
3340 unsigned int mode
: 16;
3342 enum kind kind
: 16;
3343 enum machine_mode mode
: 16;
3346 union real_extract du
;
3347 struct addr_const addr
;
3348 struct {HOST_WIDE_INT high
, low
;} di
;
3352 /* Express an rtx for a constant integer (perhaps symbolic)
3353 as the sum of a symbol or label plus an explicit integer.
3354 They are stored into VALUE. */
3357 decode_rtx_const (mode
, x
, value
)
3358 enum machine_mode mode
;
3360 struct rtx_const
*value
;
3362 /* Clear the whole structure, including any gaps. */
3365 int *p
= (int *) value
;
3366 int *end
= (int *) (value
+ 1);
3371 value
->kind
= RTX_INT
; /* Most usual kind. */
3374 switch (GET_CODE (x
))
3377 value
->kind
= RTX_DOUBLE
;
3378 if (GET_MODE (x
) != VOIDmode
)
3380 value
->mode
= GET_MODE (x
);
3381 bcopy ((char *) &CONST_DOUBLE_LOW (x
),
3382 (char *) &value
->un
.du
, sizeof value
->un
.du
);
3386 value
->un
.di
.low
= CONST_DOUBLE_LOW (x
);
3387 value
->un
.di
.high
= CONST_DOUBLE_HIGH (x
);
3392 value
->un
.addr
.offset
= INTVAL (x
);
3398 value
->un
.addr
.base
= x
;
3403 if (GET_CODE (x
) == PLUS
)
3405 value
->un
.addr
.base
= XEXP (x
, 0);
3406 if (GET_CODE (XEXP (x
, 1)) != CONST_INT
)
3408 value
->un
.addr
.offset
= INTVAL (XEXP (x
, 1));
3410 else if (GET_CODE (x
) == MINUS
)
3412 value
->un
.addr
.base
= XEXP (x
, 0);
3413 if (GET_CODE (XEXP (x
, 1)) != CONST_INT
)
3415 value
->un
.addr
.offset
= - INTVAL (XEXP (x
, 1));
3425 if (value
->kind
== RTX_INT
&& value
->un
.addr
.base
!= 0)
3426 switch (GET_CODE (value
->un
.addr
.base
))
3429 /* Use the string's address, not the SYMBOL_REF's address,
3430 for the sake of addresses of library routines. */
3431 value
->un
.addr
.base
= (rtx
) XSTR (value
->un
.addr
.base
, 0);
3435 /* For a LABEL_REF, compare labels. */
3436 value
->un
.addr
.base
= XEXP (value
->un
.addr
.base
, 0);
3443 /* Given a MINUS expression, simplify it if both sides
3444 include the same symbol. */
3447 simplify_subtraction (x
)
3450 struct rtx_const val0
, val1
;
3452 decode_rtx_const (GET_MODE (x
), XEXP (x
, 0), &val0
);
3453 decode_rtx_const (GET_MODE (x
), XEXP (x
, 1), &val1
);
3455 if (val0
.un
.addr
.base
== val1
.un
.addr
.base
)
3456 return GEN_INT (val0
.un
.addr
.offset
- val1
.un
.addr
.offset
);
3460 /* Compute a hash code for a constant RTL expression. */
3463 const_hash_rtx (mode
, x
)
3464 enum machine_mode mode
;
3470 struct rtx_const value
;
3471 decode_rtx_const (mode
, x
, &value
);
3473 /* Compute hashing function */
3475 for (i
= 0; i
< sizeof value
/ sizeof (int); i
++)
3476 hi
+= ((int *) &value
)[i
];
3478 hi
&= (1 << HASHBITS
) - 1;
3479 hi
%= MAX_RTX_HASH_TABLE
;
3483 /* Compare a constant rtl object X with a constant-descriptor DESC.
3484 Return 1 if DESC describes a constant with the same value as X. */
3487 compare_constant_rtx (mode
, x
, desc
)
3488 enum machine_mode mode
;
3490 struct constant_descriptor
*desc
;
3492 register int *p
= (int *) desc
->contents
;
3495 struct rtx_const value
;
3497 decode_rtx_const (mode
, x
, &value
);
3498 strp
= (int *) &value
;
3499 len
= sizeof value
/ sizeof (int);
3501 /* Compare constant contents. */
3503 if (*p
++ != *strp
++)
3509 /* Construct a constant descriptor for the rtl-expression X.
3510 It is up to the caller to enter the descriptor in the hash table. */
3512 static struct constant_descriptor
*
3513 record_constant_rtx (mode
, x
)
3514 enum machine_mode mode
;
3517 struct constant_descriptor
*ptr
;
3520 struct rtx_const value
;
3522 decode_rtx_const (mode
, x
, &value
);
3524 /* Put these things in the saveable obstack so we can ensure it won't
3525 be freed if we are called from combine or some other phase that discards
3526 memory allocated from function_obstack (current_obstack). */
3527 obstack_grow (saveable_obstack
, &ptr
, sizeof ptr
);
3528 obstack_grow (saveable_obstack
, &label
, sizeof label
);
3529 obstack_grow (saveable_obstack
, &rtl
, sizeof rtl
);
3531 /* Record constant contents. */
3532 obstack_grow (saveable_obstack
, &value
, sizeof value
);
3534 return (struct constant_descriptor
*) obstack_finish (saveable_obstack
);
3537 /* Given a constant rtx X, make (or find) a memory constant for its value
3538 and return a MEM rtx to refer to it in memory. */
3541 force_const_mem (mode
, x
)
3542 enum machine_mode mode
;
3546 register struct constant_descriptor
*desc
;
3551 /* If we want this CONST_DOUBLE in the same mode as it is in memory
3552 (this will always be true for floating CONST_DOUBLEs that have been
3553 placed in memory, but not for VOIDmode (integer) CONST_DOUBLEs),
3554 use the previous copy. Otherwise, make a new one. Note that in
3555 the unlikely event that this same CONST_DOUBLE is used in two different
3556 modes in an alternating fashion, we will allocate a lot of different
3557 memory locations, but this should be extremely rare. */
3559 if (GET_CODE (x
) == CONST_DOUBLE
3560 && GET_CODE (CONST_DOUBLE_MEM (x
)) == MEM
3561 && GET_MODE (CONST_DOUBLE_MEM (x
)) == mode
)
3562 return CONST_DOUBLE_MEM (x
);
3564 /* Compute hash code of X. Search the descriptors for that hash code
3565 to see if any of them describes X. If yes, the descriptor records
3566 the label number already assigned. */
3568 hash
= const_hash_rtx (mode
, x
);
3570 for (desc
= const_rtx_hash_table
[hash
]; desc
; desc
= desc
->next
)
3571 if (compare_constant_rtx (mode
, x
, desc
))
3573 found
= desc
->label
;
3579 register struct pool_constant
*pool
;
3580 register struct pool_sym
*sym
;
3583 /* No constant equal to X is known to have been output.
3584 Make a constant descriptor to enter X in the hash table.
3585 Assign the label number and record it in the descriptor for
3586 future calls to this function to find. */
3588 desc
= record_constant_rtx (mode
, x
);
3589 desc
->next
= const_rtx_hash_table
[hash
];
3590 const_rtx_hash_table
[hash
] = desc
;
3592 /* Align the location counter as required by EXP's data type. */
3593 align
= (mode
== VOIDmode
) ? UNITS_PER_WORD
: GET_MODE_SIZE (mode
);
3594 if (align
> BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
3595 align
= BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
;
3596 #ifdef CONSTANT_ALIGNMENT
3597 align
= CONSTANT_ALIGNMENT (make_tree (type_for_mode (mode
, 0), x
),
3598 align
* BITS_PER_UNIT
) / BITS_PER_UNIT
;
3601 pool_offset
+= align
- 1;
3602 pool_offset
&= ~ (align
- 1);
3604 /* If RTL is not being placed into the saveable obstack, make a
3605 copy of X that is in the saveable obstack in case we are
3606 being called from combine or some other phase that discards
3607 memory it allocates. We used to only do this if it is a
3608 CONST; however, reload can allocate a CONST_INT when
3609 eliminating registers. */
3610 if (rtl_obstack
!= saveable_obstack
3611 && (GET_CODE (x
) == CONST
|| GET_CODE (x
) == CONST_INT
))
3613 push_obstacks_nochange ();
3614 rtl_in_saveable_obstack ();
3616 if (GET_CODE (x
) == CONST
)
3617 x
= gen_rtx_CONST (GET_MODE (x
),
3618 gen_rtx_PLUS (GET_MODE (x
),
3619 XEXP (XEXP (x
, 0), 0),
3620 XEXP (XEXP (x
, 0), 1)));
3622 x
= GEN_INT (INTVAL (x
));
3627 /* Allocate a pool constant descriptor, fill it in, and chain it in. */
3629 pool
= (struct pool_constant
*) savealloc (sizeof (struct pool_constant
));
3633 pool
->labelno
= const_labelno
;
3634 pool
->align
= align
;
3635 pool
->offset
= pool_offset
;
3642 last_pool
->next
= pool
;
3645 pool_offset
+= GET_MODE_SIZE (mode
);
3647 /* Create a string containing the label name, in LABEL. */
3648 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
3652 desc
->label
= found
= ggc_alloc_string (label
, -1);
3654 /* Add label to symbol hash table. */
3655 hash
= SYMHASH (found
);
3656 sym
= (struct pool_sym
*) savealloc (sizeof (struct pool_sym
));
3659 sym
->next
= const_rtx_sym_hash_table
[hash
];
3660 const_rtx_sym_hash_table
[hash
] = sym
;
3663 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
3665 def
= gen_rtx_MEM (mode
, gen_rtx_SYMBOL_REF (Pmode
, found
));
3667 RTX_UNCHANGING_P (def
) = 1;
3668 /* Mark the symbol_ref as belonging to this constants pool. */
3669 CONSTANT_POOL_ADDRESS_P (XEXP (def
, 0)) = 1;
3670 current_function_uses_const_pool
= 1;
3672 if (GET_CODE (x
) == CONST_DOUBLE
)
3674 if (CONST_DOUBLE_MEM (x
) == cc0_rtx
)
3676 CONST_DOUBLE_CHAIN (x
) = const_double_chain
;
3677 const_double_chain
= x
;
3679 CONST_DOUBLE_MEM (x
) = def
;
3685 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
3686 the corresponding pool_constant structure. */
3688 static struct pool_constant
*
3689 find_pool_constant (f
, addr
)
3693 struct pool_sym
*sym
;
3694 const char *label
= XSTR (addr
, 0);
3696 for (sym
= f
->varasm
->x_const_rtx_sym_hash_table
[SYMHASH (label
)]; sym
; sym
= sym
->next
)
3697 if (sym
->label
== label
)
3703 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
3706 get_pool_constant (addr
)
3709 return (find_pool_constant (cfun
, addr
))->constant
;
3712 /* Likewise, but for the constant pool of a specific function. */
3715 get_pool_constant_for_function (f
, addr
)
3719 return (find_pool_constant (f
, addr
))->constant
;
3722 /* Similar, return the mode. */
3725 get_pool_mode (addr
)
3728 return (find_pool_constant (cfun
, addr
))->mode
;
3732 get_pool_mode_for_function (f
, addr
)
3736 return (find_pool_constant (f
, addr
))->mode
;
3739 /* Similar, return the offset in the constant pool. */
3742 get_pool_offset (addr
)
3745 return (find_pool_constant (cfun
, addr
))->offset
;
3748 /* Return the size of the constant pool. */
3756 /* Write all the constants in the constant pool. */
3759 output_constant_pool (fnname
, fndecl
)
3760 const char *fnname ATTRIBUTE_UNUSED
;
3761 tree fndecl ATTRIBUTE_UNUSED
;
3763 struct pool_constant
*pool
;
3765 union real_extract u
;
3767 /* It is possible for gcc to call force_const_mem and then to later
3768 discard the instructions which refer to the constant. In such a
3769 case we do not need to output the constant. */
3770 mark_constant_pool ();
3772 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3773 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3776 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3783 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3784 whose CODE_LABEL has been deleted. This can occur if a jump table
3785 is eliminated by optimization. If so, write a constant of zero
3786 instead. Note that this can also happen by turning the
3787 CODE_LABEL into a NOTE. */
3788 if (((GET_CODE (x
) == LABEL_REF
3789 && (INSN_DELETED_P (XEXP (x
, 0))
3790 || GET_CODE (XEXP (x
, 0)) == NOTE
)))
3791 || (GET_CODE (x
) == CONST
&& GET_CODE (XEXP (x
, 0)) == PLUS
3792 && GET_CODE (XEXP (XEXP (x
, 0), 0)) == LABEL_REF
3793 && (INSN_DELETED_P (XEXP (XEXP (XEXP (x
, 0), 0), 0))
3794 || GET_CODE (XEXP (XEXP (XEXP (x
, 0), 0), 0)) == NOTE
)))
3797 /* First switch to correct section. */
3798 #ifdef SELECT_RTX_SECTION
3799 SELECT_RTX_SECTION (pool
->mode
, x
);
3801 readonly_data_section ();
3804 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3805 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file
, x
, pool
->mode
,
3806 pool
->align
, pool
->labelno
, done
);
3809 if (pool
->align
> 1)
3810 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (pool
->align
));
3812 /* Output the label. */
3813 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LC", pool
->labelno
);
3815 /* Output the value of the constant itself. */
3816 switch (GET_MODE_CLASS (pool
->mode
))
3819 if (GET_CODE (x
) != CONST_DOUBLE
)
3822 bcopy ((char *) &CONST_DOUBLE_LOW (x
), (char *) &u
, sizeof u
);
3823 assemble_real (u
.d
, pool
->mode
);
3827 case MODE_PARTIAL_INT
:
3828 assemble_integer (x
, GET_MODE_SIZE (pool
->mode
), 1);
3835 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3841 #ifdef ASM_OUTPUT_POOL_EPILOGUE
3842 ASM_OUTPUT_POOL_EPILOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3845 /* Done with this pool. */
3846 first_pool
= last_pool
= 0;
3849 /* Look through the instructions for this function, and mark all the
3850 entries in the constant pool which are actually being used. */
3853 mark_constant_pool ()
3856 struct pool_constant
*pool
;
3858 if (first_pool
== 0)
3861 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3864 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
3865 if (GET_RTX_CLASS (GET_CODE (insn
)) == 'i')
3866 mark_constants (PATTERN (insn
));
3868 for (insn
= current_function_epilogue_delay_list
;
3870 insn
= XEXP (insn
, 1))
3871 if (GET_RTX_CLASS (GET_CODE (insn
)) == 'i')
3872 mark_constants (PATTERN (insn
));
3874 /* It's possible that the only reference to a symbol is in a symbol
3875 that's in the constant pool. This happens in Fortran under some
3876 situations. (When the constant contains the address of another
3877 constant, and only the first is used directly in an insn.)
3878 This is potentially suboptimal if there's ever a possibility of
3879 backwards (in pool order) 2'd level references. However, it's
3880 not clear that 2'd level references can happen. */
3881 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3883 struct pool_sym
*sym
;
3886 /* skip unmarked entries; no insn refers to them. */
3890 /* Skip everything except SYMBOL_REFs. */
3891 if (GET_CODE (pool
->constant
) != SYMBOL_REF
)
3893 label
= XSTR (pool
->constant
, 0);
3895 /* Be sure the symbol's value is marked. */
3896 for (sym
= const_rtx_sym_hash_table
[SYMHASH (label
)]; sym
;
3898 if (sym
->label
== label
)
3899 sym
->pool
->mark
= 1;
3900 /* If we didn't find it, there's something truly wrong here, but it
3901 will be announced by the assembler. */
3910 register const char *format_ptr
;
3915 if (GET_CODE (x
) == SYMBOL_REF
)
3917 if (CONSTANT_POOL_ADDRESS_P (x
))
3918 find_pool_constant (cfun
, x
)->mark
= 1;
3921 /* Never search inside a CONST_DOUBLE, because CONST_DOUBLE_MEM may be
3922 a MEM, but does not constitute a use of that MEM. */
3923 else if (GET_CODE (x
) == CONST_DOUBLE
)
3926 /* Insns may appear inside a SEQUENCE. Only check the patterns of
3927 insns, not any notes that may be attached. We don't want to mark
3928 a constant just because it happens to appear in a REG_EQUIV note. */
3929 if (GET_RTX_CLASS (GET_CODE (x
)) == 'i')
3931 mark_constants (PATTERN (x
));
3935 format_ptr
= GET_RTX_FORMAT (GET_CODE (x
));
3937 for (i
= 0; i
< GET_RTX_LENGTH (GET_CODE (x
)); i
++)
3939 switch (*format_ptr
++)
3942 mark_constants (XEXP (x
, i
));
3946 if (XVEC (x
, i
) != 0)
3950 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
3951 mark_constants (XVECEXP (x
, i
, j
));
3970 /* Find all the constants whose addresses are referenced inside of EXP,
3971 and make sure assembler code with a label has been output for each one.
3972 Indicate whether an ADDR_EXPR has been encountered. */
3975 output_addressed_constants (exp
)
3980 switch (TREE_CODE (exp
))
3984 register tree constant
= TREE_OPERAND (exp
, 0);
3986 while (TREE_CODE (constant
) == COMPONENT_REF
)
3988 constant
= TREE_OPERAND (constant
, 0);
3991 if (TREE_CODE_CLASS (TREE_CODE (constant
)) == 'c'
3992 || TREE_CODE (constant
) == CONSTRUCTOR
)
3993 /* No need to do anything here
3994 for addresses of variables or functions. */
3995 output_constant_def (constant
);
4002 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
4003 reloc
|= output_addressed_constants (TREE_OPERAND (exp
, 1));
4008 case NON_LVALUE_EXPR
:
4009 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
4015 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
4016 if (TREE_VALUE (link
) != 0)
4017 reloc
|= output_addressed_constants (TREE_VALUE (link
));
4027 /* Return nonzero if VALUE is a valid constant-valued expression
4028 for use in initializing a static variable; one that can be an
4029 element of a "constant" initializer.
4031 Return null_pointer_node if the value is absolute;
4032 if it is relocatable, return the variable that determines the relocation.
4033 We assume that VALUE has been folded as much as possible;
4034 therefore, we do not need to check for such things as
4035 arithmetic-combinations of integers. */
4038 initializer_constant_valid_p (value
, endtype
)
4042 /* Give the front-end a chance to convert VALUE to something that
4043 looks more like a constant to the back-end. */
4044 if (lang_expand_constant
)
4045 value
= (*lang_expand_constant
) (value
);
4047 switch (TREE_CODE (value
))
4050 if ((TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
4051 || TREE_CODE (TREE_TYPE (value
)) == RECORD_TYPE
)
4052 && TREE_CONSTANT (value
)
4053 && CONSTRUCTOR_ELTS (value
))
4055 initializer_constant_valid_p (TREE_VALUE (CONSTRUCTOR_ELTS (value
)),
4058 return TREE_STATIC (value
) ? null_pointer_node
: 0;
4064 return null_pointer_node
;
4067 return TREE_OPERAND (value
, 0);
4069 case NON_LVALUE_EXPR
:
4070 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
4074 /* Allow conversions between pointer types. */
4075 if (POINTER_TYPE_P (TREE_TYPE (value
))
4076 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
4077 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
4079 /* Allow conversions between real types. */
4080 if (FLOAT_TYPE_P (TREE_TYPE (value
))
4081 && FLOAT_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
4082 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
4084 /* Allow length-preserving conversions between integer types. */
4085 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
4086 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
4087 && (TYPE_PRECISION (TREE_TYPE (value
))
4088 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
4089 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
4091 /* Allow conversions between other integer types only if
4093 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
4094 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
4096 tree inner
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4098 if (inner
== null_pointer_node
)
4099 return null_pointer_node
;
4103 /* Allow (int) &foo provided int is as wide as a pointer. */
4104 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
4105 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
4106 && (TYPE_PRECISION (TREE_TYPE (value
))
4107 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
4108 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4111 /* Likewise conversions from int to pointers, but also allow
4112 conversions from 0. */
4113 if (POINTER_TYPE_P (TREE_TYPE (value
))
4114 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
4116 if (integer_zerop (TREE_OPERAND (value
, 0)))
4117 return null_pointer_node
;
4118 else if (TYPE_PRECISION (TREE_TYPE (value
))
4119 <= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0))))
4120 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4124 /* Allow conversions to union types if the value inside is okay. */
4125 if (TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
)
4126 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4131 if (! INTEGRAL_TYPE_P (endtype
)
4132 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
4134 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4136 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
4138 /* If either term is absolute, use the other terms relocation. */
4139 if (valid0
== null_pointer_node
)
4141 if (valid1
== null_pointer_node
)
4147 if (! INTEGRAL_TYPE_P (endtype
)
4148 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
4150 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4152 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
4154 /* Win if second argument is absolute. */
4155 if (valid1
== null_pointer_node
)
4157 /* Win if both arguments have the same relocation.
4158 Then the value is absolute. */
4159 if (valid0
== valid1
&& valid0
!= 0)
4160 return null_pointer_node
;
4163 /* Support differences between labels. */
4164 if (INTEGRAL_TYPE_P (endtype
))
4167 op0
= TREE_OPERAND (value
, 0);
4168 op1
= TREE_OPERAND (value
, 1);
4172 if (TREE_CODE (op0
) == ADDR_EXPR
4173 && TREE_CODE (TREE_OPERAND (op0
, 0)) == LABEL_DECL
4174 && TREE_CODE (op1
) == ADDR_EXPR
4175 && TREE_CODE (TREE_OPERAND (op1
, 0)) == LABEL_DECL
)
4176 return null_pointer_node
;
4187 /* Output assembler code for constant EXP to FILE, with no label.
4188 This includes the pseudo-op such as ".int" or ".byte", and a newline.
4189 Assumes output_addressed_constants has been done on EXP already.
4191 Generate exactly SIZE bytes of assembler data, padding at the end
4192 with zeros if necessary. SIZE must always be specified.
4194 SIZE is important for structure constructors,
4195 since trailing members may have been omitted from the constructor.
4196 It is also important for initialization of arrays from string constants
4197 since the full length of the string constant might not be wanted.
4198 It is also needed for initialization of unions, where the initializer's
4199 type is just one member, and that may not be as long as the union.
4201 There a case in which we would fail to output exactly SIZE bytes:
4202 for a structure constructor that wants to produce more than SIZE bytes.
4203 But such constructors will never be generated for any possible input. */
4206 output_constant (exp
, size
)
4210 register enum tree_code code
= TREE_CODE (TREE_TYPE (exp
));
4212 /* Some front-ends use constants other than the standard
4213 language-indepdent varieties, but which may still be output
4214 directly. Give the front-end a chance to convert EXP to a
4215 language-independent representation. */
4216 if (lang_expand_constant
)
4217 exp
= (*lang_expand_constant
) (exp
);
4219 if (size
== 0 || flag_syntax_only
)
4222 /* Eliminate the NON_LVALUE_EXPR_EXPR that makes a cast not be an lvalue.
4223 That way we get the constant (we hope) inside it. Also, strip off any
4224 NOP_EXPR that converts between two record, union, array, or set types
4225 or a CONVERT_EXPR that converts to a union TYPE. */
4226 while ((TREE_CODE (exp
) == NOP_EXPR
4227 && (TREE_TYPE (exp
) == TREE_TYPE (TREE_OPERAND (exp
, 0))
4228 || AGGREGATE_TYPE_P (TREE_TYPE (exp
))))
4229 || (TREE_CODE (exp
) == CONVERT_EXPR
4230 && code
== UNION_TYPE
)
4231 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
4233 exp
= TREE_OPERAND (exp
, 0);
4234 code
= TREE_CODE (TREE_TYPE (exp
));
4237 /* Allow a constructor with no elements for any data type.
4238 This means to fill the space with zeros. */
4239 if (TREE_CODE (exp
) == CONSTRUCTOR
&& CONSTRUCTOR_ELTS (exp
) == 0)
4241 assemble_zeros (size
);
4252 case REFERENCE_TYPE
:
4253 /* ??? What about (int)((float)(int)&foo + 4) */
4254 while (TREE_CODE (exp
) == NOP_EXPR
|| TREE_CODE (exp
) == CONVERT_EXPR
4255 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
4256 exp
= TREE_OPERAND (exp
, 0);
4258 if (! assemble_integer (expand_expr (exp
, NULL_RTX
, VOIDmode
,
4259 EXPAND_INITIALIZER
),
4261 error ("initializer for integer value is too complicated");
4266 if (TREE_CODE (exp
) != REAL_CST
)
4267 error ("initializer for floating value is not a floating constant");
4269 assemble_real (TREE_REAL_CST (exp
),
4270 mode_for_size (size
* BITS_PER_UNIT
, MODE_FLOAT
, 0));
4275 output_constant (TREE_REALPART (exp
), size
/ 2);
4276 output_constant (TREE_IMAGPART (exp
), size
/ 2);
4277 size
-= (size
/ 2) * 2;
4281 if (TREE_CODE (exp
) == CONSTRUCTOR
)
4283 output_constructor (exp
, size
);
4286 else if (TREE_CODE (exp
) == STRING_CST
)
4290 if (size
> TREE_STRING_LENGTH (exp
))
4292 excess
= size
- TREE_STRING_LENGTH (exp
);
4293 size
= TREE_STRING_LENGTH (exp
);
4296 assemble_string (TREE_STRING_POINTER (exp
), size
);
4305 if (TREE_CODE (exp
) == CONSTRUCTOR
)
4306 output_constructor (exp
, size
);
4312 if (TREE_CODE (exp
) == INTEGER_CST
)
4313 assemble_integer (expand_expr (exp
, NULL_RTX
,
4314 VOIDmode
, EXPAND_INITIALIZER
),
4316 else if (TREE_CODE (exp
) == CONSTRUCTOR
)
4318 unsigned char *buffer
= (unsigned char *) alloca (size
);
4319 if (get_set_constructor_bytes (exp
, buffer
, size
))
4321 assemble_string ((char *) buffer
, size
);
4324 error ("unknown set constructor type");
4332 assemble_zeros (size
);
4336 /* Subroutine of output_constant, used for CONSTRUCTORs
4337 (aggregate constants).
4338 Generate at least SIZE bytes, padding if necessary. */
4341 output_constructor (exp
, size
)
4345 register tree link
, field
= 0;
4346 HOST_WIDE_INT min_index
= 0;
4347 /* Number of bytes output or skipped so far.
4348 In other words, current position within the constructor. */
4349 int total_bytes
= 0;
4350 /* Non-zero means BYTE contains part of a byte, to be output. */
4351 int byte_buffer_in_use
= 0;
4352 register int byte
= 0;
4354 if (HOST_BITS_PER_WIDE_INT
< BITS_PER_UNIT
)
4357 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
4358 field
= TYPE_FIELDS (TREE_TYPE (exp
));
4360 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
4361 && TYPE_DOMAIN (TREE_TYPE (exp
)) != 0)
4363 = TREE_INT_CST_LOW (TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (exp
))));
4365 /* As LINK goes through the elements of the constant,
4366 FIELD goes through the structure fields, if the constant is a structure.
4367 if the constant is a union, then we override this,
4368 by getting the field from the TREE_LIST element.
4369 But the constant could also be an array. Then FIELD is zero.
4371 There is always a maximum of one element in the chain LINK for unions
4372 (even if the initializer in a source program incorrectly contains
4374 for (link
= CONSTRUCTOR_ELTS (exp
);
4376 link
= TREE_CHAIN (link
),
4377 field
= field
? TREE_CHAIN (field
) : 0)
4379 tree val
= TREE_VALUE (link
);
4382 /* the element in a union constructor specifies the proper field. */
4384 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
4385 || TREE_CODE (TREE_TYPE (exp
)) == UNION_TYPE
)
4387 /* if available, use the type given by link */
4388 if (TREE_PURPOSE (link
) != 0)
4389 field
= TREE_PURPOSE (link
);
4392 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
4393 index
= TREE_PURPOSE (link
);
4395 /* Eliminate the marker that makes a cast not be an lvalue. */
4399 if (index
&& TREE_CODE (index
) == RANGE_EXPR
)
4401 register int fieldsize
4402 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (exp
)));
4403 HOST_WIDE_INT lo_index
= TREE_INT_CST_LOW (TREE_OPERAND (index
, 0));
4404 HOST_WIDE_INT hi_index
= TREE_INT_CST_LOW (TREE_OPERAND (index
, 1));
4405 HOST_WIDE_INT index
;
4406 for (index
= lo_index
; index
<= hi_index
; index
++)
4408 /* Output the element's initial value. */
4410 assemble_zeros (fieldsize
);
4412 output_constant (val
, fieldsize
);
4414 /* Count its size. */
4415 total_bytes
+= fieldsize
;
4418 else if (field
== 0 || !DECL_BIT_FIELD (field
))
4420 /* An element that is not a bit-field. */
4422 register int fieldsize
;
4423 /* Since this structure is static,
4424 we know the positions are constant. */
4425 int bitpos
= (field
? (TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field
))
4429 bitpos
= (TREE_INT_CST_LOW (TYPE_SIZE (TREE_TYPE (val
)))
4431 * (TREE_INT_CST_LOW (index
) - min_index
));
4433 /* Output any buffered-up bit-fields preceding this element. */
4434 if (byte_buffer_in_use
)
4436 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4438 byte_buffer_in_use
= 0;
4441 /* Advance to offset of this element.
4442 Note no alignment needed in an array, since that is guaranteed
4443 if each element has the proper size. */
4444 if ((field
!= 0 || index
!= 0) && bitpos
!= total_bytes
)
4446 assemble_zeros (bitpos
- total_bytes
);
4447 total_bytes
= bitpos
;
4450 /* Determine size this element should occupy. */
4453 if (TREE_CODE (DECL_SIZE_UNIT (field
)) != INTEGER_CST
)
4456 fieldsize
= TREE_INT_CST_LOW (DECL_SIZE_UNIT (field
));
4459 fieldsize
= int_size_in_bytes (TREE_TYPE (TREE_TYPE (exp
)));
4461 /* Output the element's initial value. */
4463 assemble_zeros (fieldsize
);
4465 output_constant (val
, fieldsize
);
4467 /* Count its size. */
4468 total_bytes
+= fieldsize
;
4470 else if (val
!= 0 && TREE_CODE (val
) != INTEGER_CST
)
4471 error ("invalid initial value for member `%s'",
4472 IDENTIFIER_POINTER (DECL_NAME (field
)));
4475 /* Element that is a bit-field. */
4477 int next_offset
= TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field
));
4479 = (next_offset
+ TREE_INT_CST_LOW (DECL_SIZE (field
)));
4482 val
= integer_zero_node
;
4484 /* If this field does not start in this (or, next) byte,
4486 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4488 /* Output remnant of any bit field in previous bytes. */
4489 if (byte_buffer_in_use
)
4491 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4493 byte_buffer_in_use
= 0;
4496 /* If still not at proper byte, advance to there. */
4497 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4499 assemble_zeros (next_offset
/ BITS_PER_UNIT
- total_bytes
);
4500 total_bytes
= next_offset
/ BITS_PER_UNIT
;
4504 if (! byte_buffer_in_use
)
4507 /* We must split the element into pieces that fall within
4508 separate bytes, and combine each byte with previous or
4509 following bit-fields. */
4511 /* next_offset is the offset n fbits from the beginning of
4512 the structure to the next bit of this element to be processed.
4513 end_offset is the offset of the first bit past the end of
4515 while (next_offset
< end_offset
)
4519 HOST_WIDE_INT value
;
4520 int next_byte
= next_offset
/ BITS_PER_UNIT
;
4521 int next_bit
= next_offset
% BITS_PER_UNIT
;
4523 /* Advance from byte to byte
4524 within this element when necessary. */
4525 while (next_byte
!= total_bytes
)
4527 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4532 /* Number of bits we can process at once
4533 (all part of the same byte). */
4534 this_time
= MIN (end_offset
- next_offset
,
4535 BITS_PER_UNIT
- next_bit
);
4536 if (BYTES_BIG_ENDIAN
)
4538 /* On big-endian machine, take the most significant bits
4539 first (of the bits that are significant)
4540 and put them into bytes from the most significant end. */
4541 shift
= end_offset
- next_offset
- this_time
;
4542 /* Don't try to take a bunch of bits that cross
4543 the word boundary in the INTEGER_CST. We can
4544 only select bits from the LOW or HIGH part
4546 if (shift
< HOST_BITS_PER_WIDE_INT
4547 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4549 this_time
= shift
+ this_time
- HOST_BITS_PER_WIDE_INT
;
4550 shift
= HOST_BITS_PER_WIDE_INT
;
4553 /* Now get the bits from the appropriate constant word. */
4554 if (shift
< HOST_BITS_PER_WIDE_INT
)
4556 value
= TREE_INT_CST_LOW (val
);
4558 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4560 value
= TREE_INT_CST_HIGH (val
);
4561 shift
-= HOST_BITS_PER_WIDE_INT
;
4565 /* Get the result. This works only when:
4566 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4567 byte
|= (((value
>> shift
)
4568 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4569 << (BITS_PER_UNIT
- this_time
- next_bit
));
4573 /* On little-endian machines,
4574 take first the least significant bits of the value
4575 and pack them starting at the least significant
4576 bits of the bytes. */
4577 shift
= (next_offset
4578 - TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field
)));
4579 /* Don't try to take a bunch of bits that cross
4580 the word boundary in the INTEGER_CST. We can
4581 only select bits from the LOW or HIGH part
4583 if (shift
< HOST_BITS_PER_WIDE_INT
4584 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4586 this_time
= (HOST_BITS_PER_WIDE_INT
- shift
);
4589 /* Now get the bits from the appropriate constant word. */
4590 if (shift
< HOST_BITS_PER_WIDE_INT
)
4591 value
= TREE_INT_CST_LOW (val
);
4592 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4594 value
= TREE_INT_CST_HIGH (val
);
4595 shift
-= HOST_BITS_PER_WIDE_INT
;
4599 /* Get the result. This works only when:
4600 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4601 byte
|= (((value
>> shift
)
4602 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4605 next_offset
+= this_time
;
4606 byte_buffer_in_use
= 1;
4610 if (byte_buffer_in_use
)
4612 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4615 if (total_bytes
< size
)
4616 assemble_zeros (size
- total_bytes
);
4619 #ifdef HANDLE_PRAGMA_WEAK
4620 /* Add function NAME to the weak symbols list. VALUE is a weak alias
4621 associatd with NAME. */
4624 add_weak (name
, value
)
4628 struct weak_syms
*weak
;
4630 weak
= (struct weak_syms
*) permalloc (sizeof (struct weak_syms
));
4635 weak
->next
= weak_decls
;
4637 weak
->value
= value
;
4642 #endif /* HANDLE_PRAGMA_WEAK */
4644 /* Declare DECL to be a weak symbol. */
4650 if (! TREE_PUBLIC (decl
))
4651 error_with_decl (decl
, "weak declaration of `%s' must be public");
4652 else if (TREE_ASM_WRITTEN (decl
))
4653 error_with_decl (decl
, "weak declaration of `%s' must precede definition");
4654 else if (SUPPORTS_WEAK
)
4655 DECL_WEAK (decl
) = 1;
4656 #ifdef HANDLE_PRAGMA_WEAK
4657 add_weak (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)), NULL
);
4661 /* Emit any pending weak declarations. */
4663 #ifdef HANDLE_PRAGMA_WEAK
4664 struct weak_syms
* weak_decls
;
4670 #ifdef HANDLE_PRAGMA_WEAK
4671 if (HANDLE_PRAGMA_WEAK
)
4673 struct weak_syms
*t
;
4674 for (t
= weak_decls
; t
; t
= t
->next
)
4678 ASM_WEAKEN_LABEL (asm_out_file
, t
->name
);
4680 ASM_OUTPUT_DEF (asm_out_file
, t
->name
, t
->value
);
4687 /* Remove NAME from the pending list of weak symbols. This prevents
4688 the compiler from emitting multiple .weak directives which confuses
4690 #ifdef ASM_WEAKEN_LABEL
4692 remove_from_pending_weak_list (name
)
4693 char *name ATTRIBUTE_UNUSED
;
4695 #ifdef HANDLE_PRAGMA_WEAK
4696 if (HANDLE_PRAGMA_WEAK
)
4698 struct weak_syms
*t
;
4699 for (t
= weak_decls
; t
; t
= t
->next
)
4701 if (t
->name
&& strcmp (name
, t
->name
) == 0)
4710 assemble_alias (decl
, target
)
4711 tree decl
, target ATTRIBUTE_UNUSED
;
4715 make_decl_rtl (decl
, (char *) 0, 1);
4716 name
= XSTR (XEXP (DECL_RTL (decl
), 0), 0);
4718 #ifdef ASM_OUTPUT_DEF
4719 /* Make name accessible from other files, if appropriate. */
4721 if (TREE_PUBLIC (decl
))
4723 #ifdef ASM_WEAKEN_LABEL
4724 if (DECL_WEAK (decl
))
4726 ASM_WEAKEN_LABEL (asm_out_file
, name
);
4727 /* Remove this function from the pending weak list so that
4728 we do not emit multiple .weak directives for it. */
4729 remove_from_pending_weak_list
4730 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
4734 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
4737 #ifdef ASM_OUTPUT_DEF_FROM_DECLS
4738 ASM_OUTPUT_DEF_FROM_DECLS (asm_out_file
, decl
, target
);
4740 ASM_OUTPUT_DEF (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4742 TREE_ASM_WRITTEN (decl
) = 1;
4744 #ifdef ASM_OUTPUT_WEAK_ALIAS
4745 if (! DECL_WEAK (decl
))
4746 warning ("only weak aliases are supported in this configuration");
4748 ASM_OUTPUT_WEAK_ALIAS (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4749 TREE_ASM_WRITTEN (decl
) = 1;
4751 warning ("alias definitions not supported in this configuration; ignored");
4756 /* This determines whether or not we support link-once semantics. */
4757 #ifndef SUPPORTS_ONE_ONLY
4758 #ifdef MAKE_DECL_ONE_ONLY
4759 #define SUPPORTS_ONE_ONLY 1
4761 #define SUPPORTS_ONE_ONLY 0
4765 /* Returns 1 if the target configuration supports defining public symbols
4766 so that one of them will be chosen at link time instead of generating a
4767 multiply-defined symbol error, whether through the use of weak symbols or
4768 a target-specific mechanism for having duplicates discarded. */
4771 supports_one_only ()
4773 if (SUPPORTS_ONE_ONLY
)
4775 return SUPPORTS_WEAK
;
4778 /* Set up DECL as a public symbol that can be defined in multiple
4779 translation units without generating a linker error. */
4782 make_decl_one_only (decl
)
4785 if (TREE_CODE (decl
) != VAR_DECL
&& TREE_CODE (decl
) != FUNCTION_DECL
)
4788 TREE_PUBLIC (decl
) = 1;
4790 if (TREE_CODE (decl
) == VAR_DECL
4791 && (DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
))
4792 DECL_COMMON (decl
) = 1;
4793 else if (SUPPORTS_ONE_ONLY
)
4795 #ifdef MAKE_DECL_ONE_ONLY
4796 MAKE_DECL_ONE_ONLY (decl
);
4798 DECL_ONE_ONLY (decl
) = 1;
4800 else if (SUPPORTS_WEAK
)
4801 DECL_WEAK (decl
) = 1;
4809 ggc_add_root (const_hash_table
, MAX_HASH_TABLE
, sizeof const_hash_table
[0],
4810 mark_const_hash_entry
);
4811 ggc_add_string_root (&in_named_name
, 1);