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
, 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
, char *, int, int));
187 #endif /* BSS_SECTION_ASM_OP */
188 static void mark_pool_constant
PARAMS ((struct pool_constant
*));
189 static void mark_pool_sym_hash_table
PARAMS ((struct pool_sym
**));
190 static void mark_const_hash_entry
PARAMS ((void *));
191 static void asm_emit_uninitialised
PARAMS ((tree
, char *, int, int));
193 static enum in_section
{ no_section
, in_text
, in_data
, in_named
194 #ifdef BSS_SECTION_ASM_OP
197 #ifdef EH_FRAME_SECTION_ASM_OP
200 #ifdef EXTRA_SECTIONS
203 } in_section
= no_section
;
205 /* Return a non-zero value if DECL has a section attribute. */
206 #ifndef IN_NAMED_SECTION
207 #define IN_NAMED_SECTION(DECL) \
208 ((TREE_CODE (DECL) == FUNCTION_DECL || TREE_CODE (DECL) == VAR_DECL) \
209 && DECL_SECTION_NAME (DECL) != NULL_TREE)
212 /* Text of section name when in_section == in_named. */
213 static char *in_named_name
;
215 /* Define functions like text_section for any extra sections. */
216 #ifdef EXTRA_SECTION_FUNCTIONS
217 EXTRA_SECTION_FUNCTIONS
220 /* Tell assembler to switch to text section. */
225 if (in_section
!= in_text
)
227 fprintf (asm_out_file
, "%s\n", TEXT_SECTION_ASM_OP
);
228 in_section
= in_text
;
232 /* Tell assembler to switch to data section. */
237 if (in_section
!= in_data
)
239 if (flag_shared_data
)
241 #ifdef SHARED_SECTION_ASM_OP
242 fprintf (asm_out_file
, "%s\n", SHARED_SECTION_ASM_OP
);
244 fprintf (asm_out_file
, "%s\n", DATA_SECTION_ASM_OP
);
248 fprintf (asm_out_file
, "%s\n", DATA_SECTION_ASM_OP
);
250 in_section
= in_data
;
253 /* Tell assembler to ALWAYS switch to data section, in case
254 it's not sure where it it. */
257 force_data_section ()
259 in_section
= no_section
;
263 /* Tell assembler to switch to read-only data section. This is normally
267 readonly_data_section ()
269 #ifdef READONLY_DATA_SECTION
270 READONLY_DATA_SECTION (); /* Note this can call data_section. */
276 /* Determine if we're in the text section. */
281 return in_section
== in_text
;
284 /* Determine if we're in the data section. */
289 return in_section
== in_data
;
292 /* Tell assembler to change to section NAME for DECL.
293 If DECL is NULL, just switch to section NAME.
294 If NAME is NULL, get the name from DECL.
295 If RELOC is 1, the initializer for DECL contains relocs. */
298 named_section (decl
, name
, reloc
)
301 int reloc ATTRIBUTE_UNUSED
;
303 if (decl
!= NULL_TREE
304 && TREE_CODE_CLASS (TREE_CODE (decl
)) != 'd')
307 name
= TREE_STRING_POINTER (DECL_SECTION_NAME (decl
));
309 if (in_section
!= in_named
|| strcmp (name
, in_named_name
))
311 #ifdef ASM_OUTPUT_SECTION_NAME
312 ASM_OUTPUT_SECTION_NAME (asm_out_file
, decl
, name
, reloc
);
314 /* Section attributes are not supported if this macro isn't provided -
315 some host formats don't support them at all. The front-end should
316 already have flagged this as an error. */
320 in_named_name
= ggc_alloc_string (name
, -1);
321 in_section
= in_named
;
325 #ifdef ASM_OUTPUT_SECTION_NAME
326 #ifndef UNIQUE_SECTION
327 #define UNIQUE_SECTION(DECL,RELOC) \
333 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (DECL)); \
334 /* Strip off any encoding in name. */ \
335 STRIP_NAME_ENCODING (name, name); \
337 len = strlen (name) + 1; \
338 string = alloca (len + 1); \
339 sprintf (string, ".%s", name); \
341 DECL_SECTION_NAME (DECL) = build_string (len, string); \
344 #ifndef UNIQUE_SECTION_P
345 #define UNIQUE_SECTION_P(DECL) 0
349 #ifdef BSS_SECTION_ASM_OP
351 /* Tell the assembler to switch to the bss section. */
356 if (in_section
!= in_bss
)
358 #ifdef SHARED_BSS_SECTION_ASM_OP
359 if (flag_shared_data
)
360 fprintf (asm_out_file
, "%s\n", SHARED_BSS_SECTION_ASM_OP
);
363 fprintf (asm_out_file
, "%s\n", BSS_SECTION_ASM_OP
);
369 #ifdef ASM_OUTPUT_BSS
371 /* Utility function for ASM_OUTPUT_BSS for targets to use if
372 they don't support alignments in .bss.
373 ??? It is believed that this function will work in most cases so such
374 support is localized here. */
377 asm_output_bss (file
, decl
, name
, size
, rounded
)
379 tree decl ATTRIBUTE_UNUSED
;
381 int size ATTRIBUTE_UNUSED
, rounded
;
383 ASM_GLOBALIZE_LABEL (file
, name
);
385 #ifdef ASM_DECLARE_OBJECT_NAME
386 last_assemble_variable_decl
= decl
;
387 ASM_DECLARE_OBJECT_NAME (file
, name
, decl
);
389 /* Standard thing is just output label for the object. */
390 ASM_OUTPUT_LABEL (file
, name
);
391 #endif /* ASM_DECLARE_OBJECT_NAME */
392 ASM_OUTPUT_SKIP (file
, rounded
);
397 #ifdef ASM_OUTPUT_ALIGNED_BSS
399 /* Utility function for targets to use in implementing
400 ASM_OUTPUT_ALIGNED_BSS.
401 ??? It is believed that this function will work in most cases so such
402 support is localized here. */
405 asm_output_aligned_bss (file
, decl
, name
, size
, align
)
411 ASM_GLOBALIZE_LABEL (file
, name
);
413 ASM_OUTPUT_ALIGN (file
, floor_log2 (align
/ BITS_PER_UNIT
));
414 #ifdef ASM_DECLARE_OBJECT_NAME
415 last_assemble_variable_decl
= decl
;
416 ASM_DECLARE_OBJECT_NAME (file
, name
, decl
);
418 /* Standard thing is just output label for the object. */
419 ASM_OUTPUT_LABEL (file
, name
);
420 #endif /* ASM_DECLARE_OBJECT_NAME */
421 ASM_OUTPUT_SKIP (file
, size
? size
: 1);
426 #endif /* BSS_SECTION_ASM_OP */
428 #ifdef EH_FRAME_SECTION_ASM_OP
432 if (in_section
!= in_eh_frame
)
434 fprintf (asm_out_file
, "%s\n", EH_FRAME_SECTION_ASM_OP
);
435 in_section
= in_eh_frame
;
440 /* Switch to the section for function DECL.
442 If DECL is NULL_TREE, switch to the text section.
443 ??? It's not clear that we will ever be passed NULL_TREE, but it's
444 safer to handle it. */
447 function_section (decl
)
450 if (decl
!= NULL_TREE
451 && DECL_SECTION_NAME (decl
) != NULL_TREE
)
452 named_section (decl
, (char *) 0, 0);
457 /* Switch to section for variable DECL.
459 RELOC is the `reloc' argument to SELECT_SECTION. */
462 variable_section (decl
, reloc
)
466 if (IN_NAMED_SECTION (decl
))
467 named_section (decl
, NULL
, reloc
);
470 /* C++ can have const variables that get initialized from constructors,
471 and thus can not be in a readonly section. We prevent this by
472 verifying that the initial value is constant for objects put in a
475 error_mark_node is used by the C front end to indicate that the
476 initializer has not been seen yet. In this case, we assume that
477 the initializer must be constant.
479 C++ uses error_mark_node for variables that have complicated
480 initializers, but these variables go in BSS so we won't be called
483 #ifdef SELECT_SECTION
484 SELECT_SECTION (decl
, reloc
);
486 if (DECL_READONLY_SECTION (decl
, reloc
))
487 readonly_data_section ();
494 /* Tell assembler to switch to the section for the exception handling
500 #if defined (EXCEPTION_SECTION)
501 EXCEPTION_SECTION ();
503 #ifdef ASM_OUTPUT_SECTION_NAME
504 named_section (NULL_TREE
, ".gcc_except_table", 0);
509 readonly_data_section ();
514 /* Create the rtl to represent a function, for a function definition.
515 DECL is a FUNCTION_DECL node which describes which function.
516 The rtl is stored into DECL. */
519 make_function_rtl (decl
)
522 char *name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
523 char *new_name
= name
;
525 /* Rename a nested function to avoid conflicts, unless it's a member of
526 a local class, in which case the class name is already unique. */
527 if (decl_function_context (decl
) != 0
528 && ! TYPE_P (DECL_CONTEXT (decl
))
529 && DECL_INITIAL (decl
) != 0
530 && DECL_RTL (decl
) == 0)
534 name
= IDENTIFIER_POINTER (DECL_NAME (decl
));
535 ASM_FORMAT_PRIVATE_NAME (label
, name
, var_labelno
);
536 name
= ggc_alloc_string (label
, -1);
541 /* When -fprefix-function-name is used, every function name is
542 prefixed. Even static functions are prefixed because they
543 could be declared latter. Note that a nested function name
545 if (flag_prefix_function_name
)
547 size_t name_len
= strlen (name
);
549 new_name
= ggc_alloc_string (NULL
, name_len
+ CHKR_PREFIX_SIZE
);
550 memcpy (new_name
, CHKR_PREFIX
, CHKR_PREFIX_SIZE
);
551 memcpy (new_name
+ CHKR_PREFIX_SIZE
, name
, name_len
+ 1);
556 if (DECL_RTL (decl
) == 0)
558 DECL_ASSEMBLER_NAME (decl
) = get_identifier (name
);
560 = gen_rtx_MEM (DECL_MODE (decl
),
561 gen_rtx_SYMBOL_REF (Pmode
, name
));
563 /* Optionally set flags or add text to the name to record information
564 such as that it is a function name. If the name is changed, the macro
565 ASM_OUTPUT_LABELREF will have to know how to strip this information. */
566 #ifdef ENCODE_SECTION_INFO
567 ENCODE_SECTION_INFO (decl
);
572 /* ??? Another way to do this would be to do what halfpic.c does
573 and maintain a hashed table of such critters. */
574 /* ??? Another way to do this would be to pass a flag bit to
575 ENCODE_SECTION_INFO saying whether this is a new decl or not. */
576 /* Let the target reassign the RTL if it wants.
577 This is necessary, for example, when one machine specific
578 decl attribute overrides another. */
579 #ifdef REDO_SECTION_INFO_P
580 if (REDO_SECTION_INFO_P (decl
))
581 ENCODE_SECTION_INFO (decl
);
586 /* Given NAME, a putative register name, discard any customary prefixes. */
589 strip_reg_name (name
)
592 #ifdef REGISTER_PREFIX
593 if (!strncmp (name
, REGISTER_PREFIX
, strlen (REGISTER_PREFIX
)))
594 name
+= strlen (REGISTER_PREFIX
);
596 if (name
[0] == '%' || name
[0] == '#')
601 /* Decode an `asm' spec for a declaration as a register name.
602 Return the register number, or -1 if nothing specified,
603 or -2 if the ASMSPEC is not `cc' or `memory' and is not recognized,
604 or -3 if ASMSPEC is `cc' and is not recognized,
605 or -4 if ASMSPEC is `memory' and is not recognized.
606 Accept an exact spelling or a decimal number.
607 Prefixes such as % are optional. */
610 decode_reg_name (asmspec
)
617 /* Get rid of confusing prefixes. */
618 asmspec
= strip_reg_name (asmspec
);
620 /* Allow a decimal number as a "register name". */
621 for (i
= strlen (asmspec
) - 1; i
>= 0; i
--)
622 if (! (asmspec
[i
] >= '0' && asmspec
[i
] <= '9'))
624 if (asmspec
[0] != 0 && i
< 0)
627 if (i
< FIRST_PSEUDO_REGISTER
&& i
>= 0)
633 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
635 && ! strcmp (asmspec
, strip_reg_name (reg_names
[i
])))
638 #ifdef ADDITIONAL_REGISTER_NAMES
640 static struct { const char *name
; int number
; } table
[]
641 = ADDITIONAL_REGISTER_NAMES
;
643 for (i
= 0; i
< (int)(sizeof (table
) / sizeof (table
[0])); i
++)
644 if (! strcmp (asmspec
, table
[i
].name
))
645 return table
[i
].number
;
647 #endif /* ADDITIONAL_REGISTER_NAMES */
649 if (!strcmp (asmspec
, "memory"))
652 if (!strcmp (asmspec
, "cc"))
661 /* Create the DECL_RTL for a declaration for a static or external variable
662 or static or external function.
663 ASMSPEC, if not 0, is the string which the user specified
664 as the assembler symbol name.
665 TOP_LEVEL is nonzero if this is a file-scope variable.
667 This is never called for PARM_DECL nodes. */
670 make_decl_rtl (decl
, asmspec
, top_level
)
675 register char *name
= 0;
678 reg_number
= decode_reg_name (asmspec
);
680 if (DECL_ASSEMBLER_NAME (decl
) != NULL_TREE
)
681 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
683 if (reg_number
== -2)
685 /* ASMSPEC is given, and not the name of a register. */
686 size_t len
= strlen (asmspec
);
688 name
= ggc_alloc_string (NULL
, len
+ 1);
690 memcpy (&name
[1], asmspec
, len
+ 1);
693 /* For a duplicate declaration, we can be called twice on the
694 same DECL node. Don't discard the RTL already made. */
695 if (DECL_RTL (decl
) == 0)
697 /* First detect errors in declaring global registers. */
698 if (TREE_CODE (decl
) != FUNCTION_DECL
699 && DECL_REGISTER (decl
) && reg_number
== -1)
700 error_with_decl (decl
,
701 "register name not specified for `%s'");
702 else if (TREE_CODE (decl
) != FUNCTION_DECL
703 && DECL_REGISTER (decl
) && reg_number
< 0)
704 error_with_decl (decl
,
705 "invalid register name for `%s'");
706 else if ((reg_number
>= 0 || reg_number
== -3)
707 && (TREE_CODE (decl
) == FUNCTION_DECL
708 && ! DECL_REGISTER (decl
)))
709 error_with_decl (decl
,
710 "register name given for non-register variable `%s'");
711 else if (TREE_CODE (decl
) != FUNCTION_DECL
712 && DECL_REGISTER (decl
)
713 && TYPE_MODE (TREE_TYPE (decl
)) == BLKmode
)
714 error_with_decl (decl
,
715 "data type of `%s' isn't suitable for a register");
716 else if (TREE_CODE (decl
) != FUNCTION_DECL
&& DECL_REGISTER (decl
)
717 && ! HARD_REGNO_MODE_OK (reg_number
,
718 TYPE_MODE (TREE_TYPE (decl
))))
719 error_with_decl (decl
,
720 "register number for `%s' isn't suitable for data type");
721 /* Now handle properly declared static register variables. */
722 else if (TREE_CODE (decl
) != FUNCTION_DECL
&& DECL_REGISTER (decl
))
726 if (DECL_INITIAL (decl
) != 0 && top_level
)
728 DECL_INITIAL (decl
) = 0;
729 error ("global register variable has initial value");
731 if (TREE_THIS_VOLATILE (decl
))
732 warning ("volatile register variables don't work as you might wish");
734 /* If the user specified one of the eliminables registers here,
735 e.g., FRAME_POINTER_REGNUM, we don't want to get this variable
736 confused with that register and be eliminated. Although this
737 usage is somewhat suspect, we nevertheless use the following
738 kludge to avoid setting DECL_RTL to frame_pointer_rtx. */
741 = gen_rtx_REG (DECL_MODE (decl
), FIRST_PSEUDO_REGISTER
);
742 REGNO (DECL_RTL (decl
)) = reg_number
;
743 REG_USERVAR_P (DECL_RTL (decl
)) = 1;
747 /* Make this register global, so not usable for anything
749 #ifdef ASM_DECLARE_REGISTER_GLOBAL
750 ASM_DECLARE_REGISTER_GLOBAL (asm_out_file
, decl
, reg_number
, name
);
752 nregs
= HARD_REGNO_NREGS (reg_number
, DECL_MODE (decl
));
754 globalize_reg (reg_number
+ --nregs
);
757 /* Specifying a section attribute on a variable forces it into a
758 non-.bss section, and thus it cannot be common. */
759 else if (TREE_CODE (decl
) == VAR_DECL
760 && DECL_SECTION_NAME (decl
) != NULL_TREE
761 && DECL_INITIAL (decl
) == NULL_TREE
762 && DECL_COMMON (decl
))
763 DECL_COMMON (decl
) = 0;
765 /* Now handle ordinary static variables and functions (in memory).
766 Also handle vars declared register invalidly. */
767 if (DECL_RTL (decl
) == 0)
769 /* Can't use just the variable's own name for a variable
770 whose scope is less than the whole file, unless it's a member
771 of a local class (which will already be unambiguous).
772 Concatenate a distinguishing number. */
773 if (!top_level
&& !TREE_PUBLIC (decl
)
774 && ! (DECL_CONTEXT (decl
) && TYPE_P (DECL_CONTEXT (decl
)))
779 ASM_FORMAT_PRIVATE_NAME (label
, name
, var_labelno
);
780 name
= ggc_alloc_string (label
, -1);
787 /* When -fprefix-function-name is used, the functions
788 names are prefixed. Only nested function names are not
790 if (flag_prefix_function_name
&& TREE_CODE (decl
) == FUNCTION_DECL
)
792 size_t name_len
= strlen (name
);
795 new_name
= ggc_alloc_string (NULL
, name_len
+ CHKR_PREFIX_SIZE
);
796 memcpy (new_name
, CHKR_PREFIX
, CHKR_PREFIX_SIZE
);
797 memcpy (new_name
+ CHKR_PREFIX_SIZE
, name
, name_len
+ 1);
801 DECL_ASSEMBLER_NAME (decl
) = get_identifier (name
);
802 DECL_RTL (decl
) = gen_rtx_MEM (DECL_MODE (decl
),
803 gen_rtx_SYMBOL_REF (Pmode
, name
));
804 MEM_ALIAS_SET (DECL_RTL (decl
)) = get_alias_set (decl
);
806 /* If this variable is to be treated as volatile, show its
807 tree node has side effects. If it has side effects, either
808 because of this test or from TREE_THIS_VOLATILE also
809 being set, show the MEM is volatile. */
810 if (flag_volatile_global
&& TREE_CODE (decl
) == VAR_DECL
811 && TREE_PUBLIC (decl
))
812 TREE_SIDE_EFFECTS (decl
) = 1;
813 else if (flag_volatile_static
&& TREE_CODE (decl
) == VAR_DECL
814 && (TREE_PUBLIC (decl
) || TREE_STATIC (decl
)))
815 TREE_SIDE_EFFECTS (decl
) = 1;
817 if (TREE_SIDE_EFFECTS (decl
))
818 MEM_VOLATILE_P (DECL_RTL (decl
)) = 1;
820 if (TREE_READONLY (decl
))
821 RTX_UNCHANGING_P (DECL_RTL (decl
)) = 1;
822 MEM_SET_IN_STRUCT_P (DECL_RTL (decl
),
823 AGGREGATE_TYPE_P (TREE_TYPE (decl
)));
825 /* Optionally set flags or add text to the name to record information
826 such as that it is a function name.
827 If the name is changed, the macro ASM_OUTPUT_LABELREF
828 will have to know how to strip this information. */
829 #ifdef ENCODE_SECTION_INFO
830 ENCODE_SECTION_INFO (decl
);
836 /* If the old RTL had the wrong mode, fix the mode. */
837 if (GET_MODE (DECL_RTL (decl
)) != DECL_MODE (decl
))
839 rtx rtl
= DECL_RTL (decl
);
840 PUT_MODE (rtl
, DECL_MODE (decl
));
843 /* ??? Another way to do this would be to do what halfpic.c does
844 and maintain a hashed table of such critters. */
845 /* ??? Another way to do this would be to pass a flag bit to
846 ENCODE_SECTION_INFO saying whether this is a new decl or not. */
847 /* Let the target reassign the RTL if it wants.
848 This is necessary, for example, when one machine specific
849 decl attribute overrides another. */
850 #ifdef REDO_SECTION_INFO_P
851 if (REDO_SECTION_INFO_P (decl
))
852 ENCODE_SECTION_INFO (decl
);
857 /* Make the rtl for variable VAR be volatile.
858 Use this only for static variables. */
861 make_var_volatile (var
)
864 if (GET_CODE (DECL_RTL (var
)) != MEM
)
867 MEM_VOLATILE_P (DECL_RTL (var
)) = 1;
870 /* Output alignment directive to align for constant expression EXP. */
873 assemble_constant_align (exp
)
878 /* Align the location counter as required by EXP's data type. */
879 align
= TYPE_ALIGN (TREE_TYPE (exp
));
880 #ifdef CONSTANT_ALIGNMENT
881 align
= CONSTANT_ALIGNMENT (exp
, align
);
884 if (align
> BITS_PER_UNIT
)
885 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
888 /* Output a string of literal assembler code
889 for an `asm' keyword used between functions. */
892 assemble_asm (string
)
897 if (TREE_CODE (string
) == ADDR_EXPR
)
898 string
= TREE_OPERAND (string
, 0);
900 fprintf (asm_out_file
, "\t%s\n", TREE_STRING_POINTER (string
));
903 #if 0 /* This should no longer be needed, because
904 flag_gnu_linker should be 0 on these systems,
905 which should prevent any output
906 if ASM_OUTPUT_CONSTRUCTOR and ASM_OUTPUT_DESTRUCTOR are absent. */
907 #if !(defined(DBX_DEBUGGING_INFO) && !defined(FASCIST_ASSEMBLER))
908 #ifndef ASM_OUTPUT_CONSTRUCTOR
909 #define ASM_OUTPUT_CONSTRUCTOR(file, name)
911 #ifndef ASM_OUTPUT_DESTRUCTOR
912 #define ASM_OUTPUT_DESTRUCTOR(file, name)
917 /* Record an element in the table of global destructors.
918 How this is done depends on what sort of assembler and linker
921 NAME should be the name of a global function to be called
922 at exit time. This name is output using assemble_name. */
925 assemble_destructor (name
)
928 #ifdef ASM_OUTPUT_DESTRUCTOR
929 ASM_OUTPUT_DESTRUCTOR (asm_out_file
, name
);
933 /* Now tell GNU LD that this is part of the static destructor set. */
934 /* This code works for any machine provided you use GNU as/ld. */
935 fprintf (asm_out_file
, "%s \"___DTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
936 assemble_name (asm_out_file
, name
);
937 fputc ('\n', asm_out_file
);
942 /* Likewise for global constructors. */
945 assemble_constructor (name
)
948 #ifdef ASM_OUTPUT_CONSTRUCTOR
949 ASM_OUTPUT_CONSTRUCTOR (asm_out_file
, name
);
953 /* Now tell GNU LD that this is part of the static constructor set. */
954 /* This code works for any machine provided you use GNU as/ld. */
955 fprintf (asm_out_file
, "%s \"___CTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
956 assemble_name (asm_out_file
, name
);
957 fputc ('\n', asm_out_file
);
962 /* Likewise for entries we want to record for garbage collection.
963 Garbage collection is still under development. */
966 assemble_gc_entry (name
)
969 #ifdef ASM_OUTPUT_GC_ENTRY
970 ASM_OUTPUT_GC_ENTRY (asm_out_file
, name
);
974 /* Now tell GNU LD that this is part of the static constructor set. */
975 fprintf (asm_out_file
, "%s \"___PTR_LIST__\",22,0,0,", ASM_STABS_OP
);
976 assemble_name (asm_out_file
, name
);
977 fputc ('\n', asm_out_file
);
982 /* CONSTANT_POOL_BEFORE_FUNCTION may be defined as an expression with
983 a non-zero value if the constant pool should be output before the
984 start of the function, or a zero value if the pool should output
985 after the end of the function. The default is to put it before the
988 #ifndef CONSTANT_POOL_BEFORE_FUNCTION
989 #define CONSTANT_POOL_BEFORE_FUNCTION 1
992 /* Output assembler code for the constant pool of a function and associated
993 with defining the name of the function. DECL describes the function.
994 NAME is the function's name. For the constant pool, we use the current
995 constant pool data. */
998 assemble_start_function (decl
, fnname
)
1004 /* The following code does not need preprocessing in the assembler. */
1008 if (CONSTANT_POOL_BEFORE_FUNCTION
)
1009 output_constant_pool (fnname
, decl
);
1011 #ifdef ASM_OUTPUT_SECTION_NAME
1012 /* If the function is to be put in its own section and it's not in a section
1013 already, indicate so. */
1014 if ((flag_function_sections
1015 && DECL_SECTION_NAME (decl
) == NULL_TREE
)
1016 || UNIQUE_SECTION_P (decl
))
1017 UNIQUE_SECTION (decl
, 0);
1020 function_section (decl
);
1022 /* Tell assembler to move to target machine's alignment for functions. */
1023 align
= floor_log2 (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
1025 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1027 /* Handle a user-specified function alignment.
1028 Note that we still need to align to FUNCTION_BOUNDARY, as above,
1029 because ASM_OUTPUT_MAX_SKIP_ALIGN might not do any alignment at all. */
1030 if (align_functions_log
> align
)
1032 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
1033 ASM_OUTPUT_MAX_SKIP_ALIGN (asm_out_file
,
1034 align_functions_log
, align_functions
-1);
1036 ASM_OUTPUT_ALIGN (asm_out_file
, align_functions_log
);
1040 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
1041 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file
, fnname
);
1044 #ifdef SDB_DEBUGGING_INFO
1045 /* Output SDB definition of the function. */
1046 if (write_symbols
== SDB_DEBUG
)
1047 sdbout_mark_begin_function ();
1050 #ifdef DBX_DEBUGGING_INFO
1051 /* Output DBX definition of the function. */
1052 if (write_symbols
== DBX_DEBUG
)
1053 dbxout_begin_function (decl
);
1056 /* Make function name accessible from other files, if appropriate. */
1058 if (TREE_PUBLIC (decl
))
1060 if (! first_global_object_name
)
1065 if (! DECL_WEAK (decl
) && ! DECL_ONE_ONLY (decl
))
1066 name
= &first_global_object_name
;
1068 name
= &weak_global_object_name
;
1070 STRIP_NAME_ENCODING (p
, fnname
);
1071 *name
= permalloc (strlen (p
) + 1);
1075 #ifdef ASM_WEAKEN_LABEL
1076 if (DECL_WEAK (decl
))
1078 ASM_WEAKEN_LABEL (asm_out_file
, fnname
);
1079 /* Remove this function from the pending weak list so that
1080 we do not emit multiple .weak directives for it. */
1081 remove_from_pending_weak_list
1082 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
1086 ASM_GLOBALIZE_LABEL (asm_out_file
, fnname
);
1089 /* Do any machine/system dependent processing of the function name */
1090 #ifdef ASM_DECLARE_FUNCTION_NAME
1091 ASM_DECLARE_FUNCTION_NAME (asm_out_file
, fnname
, current_function_decl
);
1093 /* Standard thing is just output label for the function. */
1094 ASM_OUTPUT_LABEL (asm_out_file
, fnname
);
1095 #endif /* ASM_DECLARE_FUNCTION_NAME */
1098 /* Output assembler code associated with defining the size of the
1099 function. DECL describes the function. NAME is the function's name. */
1102 assemble_end_function (decl
, fnname
)
1106 #ifdef ASM_DECLARE_FUNCTION_SIZE
1107 ASM_DECLARE_FUNCTION_SIZE (asm_out_file
, fnname
, decl
);
1109 if (! CONSTANT_POOL_BEFORE_FUNCTION
)
1111 output_constant_pool (fnname
, decl
);
1112 function_section (decl
); /* need to switch back */
1115 /* Output any constants which should appear after the function. */
1116 output_after_function_constants ();
1119 /* Assemble code to leave SIZE bytes of zeros. */
1122 assemble_zeros (size
)
1125 /* Do no output if -fsyntax-only. */
1126 if (flag_syntax_only
)
1129 #ifdef ASM_NO_SKIP_IN_TEXT
1130 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
1131 so we must output 0s explicitly in the text section. */
1132 if (ASM_NO_SKIP_IN_TEXT
&& in_text_section ())
1136 for (i
= 0; i
< size
- 20; i
+= 20)
1139 fprintf (asm_out_file
,
1140 "%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
);
1142 fprintf (asm_out_file
,
1143 "\tbyte 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n");
1149 fprintf (asm_out_file
, "%s 0", ASM_BYTE_OP
);
1151 fprintf (asm_out_file
, "\tbyte 0");
1154 for (; i
< size
; i
++)
1155 fprintf (asm_out_file
, ",0");
1156 fprintf (asm_out_file
, "\n");
1162 ASM_OUTPUT_SKIP (asm_out_file
, size
);
1165 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
1168 assemble_align (align
)
1171 if (align
> BITS_PER_UNIT
)
1172 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
1175 /* Assemble a string constant with the specified C string as contents. */
1178 assemble_string (p
, size
)
1185 /* If the string is very long, split it up. */
1189 int thissize
= size
- pos
;
1190 if (thissize
> maximum
)
1193 ASM_OUTPUT_ASCII (asm_out_file
, p
, thissize
);
1201 #if defined ASM_OUTPUT_ALIGNED_DECL_LOCAL
1202 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1203 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1205 #if defined ASM_OUTPUT_ALIGNED_LOCAL
1206 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1207 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, DECL_ALIGN (decl))
1209 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1210 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded)
1214 #if defined ASM_OUTPUT_ALIGNED_BSS
1215 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1216 ASM_OUTPUT_ALIGNED_BSS (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1218 #if defined ASM_OUTPUT_BSS
1219 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1220 ASM_OUTPUT_BSS (asm_out_file, decl, name, size, rounded)
1226 #if defined ASM_OUTPUT_ALIGNED_DECL_COMMON
1227 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1228 ASM_OUTPUT_ALIGNED_DECL_COMMON (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1230 #if defined ASM_OUTPUT_ALIGNED_COMMON
1231 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1232 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file, name, size, DECL_ALIGN (decl))
1234 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1235 ASM_OUTPUT_COMMON (asm_out_file, name, size, rounded)
1240 asm_emit_uninitialised (decl
, name
, size
, rounded
)
1243 int size ATTRIBUTE_UNUSED
;
1244 int rounded ATTRIBUTE_UNUSED
;
1252 destination
= asm_dest_local
;
1254 if (TREE_PUBLIC (decl
))
1256 #if defined ASM_EMIT_BSS
1257 if (! DECL_COMMON (decl
))
1258 destination
= asm_dest_bss
;
1261 destination
= asm_dest_common
;
1264 if (flag_shared_data
)
1266 switch (destination
)
1268 #ifdef ASM_OUTPUT_SHARED_BSS
1270 ASM_OUTPUT_SHARED_BSS (asm_out_file
, decl
, name
, size
, rounded
);
1273 #ifdef ASM_OUTPUT_SHARED_COMMON
1274 case asm_dest_common
:
1275 ASM_OUTPUT_SHARED_COMMON (asm_out_file
, name
, size
, rounded
);
1278 #ifdef ASM_OUTPUT_SHARED_LOCAL
1279 case asm_dest_local
:
1280 ASM_OUTPUT_SHARED_LOCAL (asm_out_file
, name
, size
, rounded
);
1288 #ifdef ASM_OUTPUT_SECTION_NAME
1289 /* We already know that DECL_SECTION_NAME() == NULL. */
1290 if (flag_data_sections
!= 0 || UNIQUE_SECTION_P (decl
))
1291 UNIQUE_SECTION (decl
, NULL
);
1294 switch (destination
)
1298 ASM_EMIT_BSS (decl
, name
, size
, rounded
);
1301 case asm_dest_common
:
1302 ASM_EMIT_COMMON (decl
, name
, size
, rounded
);
1304 case asm_dest_local
:
1305 ASM_EMIT_LOCAL (decl
, name
, size
, rounded
);
1314 /* Assemble everything that is needed for a variable or function declaration.
1315 Not used for automatic variables, and not used for function definitions.
1316 Should not be called for variables of incomplete structure type.
1318 TOP_LEVEL is nonzero if this variable has file scope.
1319 AT_END is nonzero if this is the special handling, at end of compilation,
1320 to define things that have had only tentative definitions.
1321 DONT_OUTPUT_DATA if nonzero means don't actually output the
1322 initial value (that will be done by the caller). */
1325 assemble_variable (decl
, top_level
, at_end
, dont_output_data
)
1327 int top_level ATTRIBUTE_UNUSED
;
1328 int at_end ATTRIBUTE_UNUSED
;
1329 int dont_output_data
;
1331 register char *name
;
1333 tree size_tree
= NULL_TREE
;
1335 enum in_section saved_in_section
;
1337 last_assemble_variable_decl
= 0;
1339 if (GET_CODE (DECL_RTL (decl
)) == REG
)
1341 /* Do output symbol info for global register variables, but do nothing
1344 if (TREE_ASM_WRITTEN (decl
))
1346 TREE_ASM_WRITTEN (decl
) = 1;
1348 /* Do no output if -fsyntax-only. */
1349 if (flag_syntax_only
)
1352 #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
1353 /* File-scope global variables are output here. */
1354 if ((write_symbols
== DBX_DEBUG
|| write_symbols
== XCOFF_DEBUG
)
1356 dbxout_symbol (decl
, 0);
1358 #ifdef SDB_DEBUGGING_INFO
1359 if (write_symbols
== SDB_DEBUG
&& top_level
1360 /* Leave initialized global vars for end of compilation;
1361 see comment in compile_file. */
1362 && (TREE_PUBLIC (decl
) == 0 || DECL_INITIAL (decl
) == 0))
1363 sdbout_symbol (decl
, 0);
1366 /* Don't output any DWARF debugging information for variables here.
1367 In the case of local variables, the information for them is output
1368 when we do our recursive traversal of the tree representation for
1369 the entire containing function. In the case of file-scope variables,
1370 we output information for all of them at the very end of compilation
1371 while we are doing our final traversal of the chain of file-scope
1377 /* Normally no need to say anything here for external references,
1378 since assemble_external is called by the language-specific code
1379 when a declaration is first seen. */
1381 if (DECL_EXTERNAL (decl
))
1384 /* Output no assembler code for a function declaration.
1385 Only definitions of functions output anything. */
1387 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1390 /* If type was incomplete when the variable was declared,
1391 see if it is complete now. */
1393 if (DECL_SIZE (decl
) == 0)
1394 layout_decl (decl
, 0);
1396 /* Still incomplete => don't allocate it; treat the tentative defn
1397 (which is what it must have been) as an `extern' reference. */
1399 if (!dont_output_data
&& DECL_SIZE (decl
) == 0)
1401 error_with_file_and_line (DECL_SOURCE_FILE (decl
),
1402 DECL_SOURCE_LINE (decl
),
1403 "storage size of `%s' isn't known",
1404 IDENTIFIER_POINTER (DECL_NAME (decl
)));
1405 TREE_ASM_WRITTEN (decl
) = 1;
1409 /* The first declaration of a variable that comes through this function
1410 decides whether it is global (in C, has external linkage)
1411 or local (in C, has internal linkage). So do nothing more
1412 if this function has already run. */
1414 if (TREE_ASM_WRITTEN (decl
))
1417 TREE_ASM_WRITTEN (decl
) = 1;
1419 /* Do no output if -fsyntax-only. */
1420 if (flag_syntax_only
)
1425 if (! dont_output_data
)
1429 if (TREE_CODE (DECL_SIZE_UNIT (decl
)) != INTEGER_CST
)
1432 size_tree
= DECL_SIZE_UNIT (decl
);
1433 size
= TREE_INT_CST_LOW (size_tree
);
1435 if (compare_tree_int (size_tree
, size
) != 0)
1437 error_with_decl (decl
, "size of variable `%s' is too large");
1442 name
= XSTR (XEXP (DECL_RTL (decl
), 0), 0);
1443 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
)
1444 && ! first_global_object_name
1445 && ! (DECL_COMMON (decl
) && (DECL_INITIAL (decl
) == 0
1446 || DECL_INITIAL (decl
) == error_mark_node
))
1447 && ! DECL_WEAK (decl
)
1448 && ! DECL_ONE_ONLY (decl
))
1452 STRIP_NAME_ENCODING (p
, name
);
1453 first_global_object_name
= permalloc (strlen (p
) + 1);
1454 strcpy (first_global_object_name
, p
);
1457 /* Compute the alignment of this data. */
1459 align
= DECL_ALIGN (decl
);
1461 /* In the case for initialing an array whose length isn't specified,
1462 where we have not yet been able to do the layout,
1463 figure out the proper alignment now. */
1464 if (dont_output_data
&& DECL_SIZE (decl
) == 0
1465 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
)
1466 align
= MAX (align
, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl
))));
1468 /* Some object file formats have a maximum alignment which they support.
1469 In particular, a.out format supports a maximum alignment of 4. */
1470 #ifndef MAX_OFILE_ALIGNMENT
1471 #define MAX_OFILE_ALIGNMENT BIGGEST_ALIGNMENT
1473 if (align
> MAX_OFILE_ALIGNMENT
)
1475 warning_with_decl (decl
,
1476 "alignment of `%s' is greater than maximum object file alignment. Using %d.",
1477 MAX_OFILE_ALIGNMENT
/BITS_PER_UNIT
);
1478 align
= MAX_OFILE_ALIGNMENT
;
1481 /* On some machines, it is good to increase alignment sometimes. */
1482 #ifdef DATA_ALIGNMENT
1483 align
= DATA_ALIGNMENT (TREE_TYPE (decl
), align
);
1485 #ifdef CONSTANT_ALIGNMENT
1486 if (DECL_INITIAL (decl
) != 0 && DECL_INITIAL (decl
) != error_mark_node
)
1487 align
= CONSTANT_ALIGNMENT (DECL_INITIAL (decl
), align
);
1490 /* Reset the alignment in case we have made it tighter, so we can benefit
1491 from it in get_pointer_alignment. */
1492 DECL_ALIGN (decl
) = align
;
1494 /* Handle uninitialized definitions. */
1496 if ((DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
)
1497 /* If the target can't output uninitialized but not common global data
1498 in .bss, then we have to use .data. */
1499 #if ! defined ASM_EMIT_BSS
1500 && DECL_COMMON (decl
)
1502 && DECL_SECTION_NAME (decl
) == NULL_TREE
1503 && ! dont_output_data
)
1505 int size
= TREE_INT_CST_LOW (size_tree
);
1508 /* Don't allocate zero bytes of common,
1509 since that means "undefined external" in the linker. */
1510 if (size
== 0) rounded
= 1;
1511 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1512 so that each uninitialized object starts on such a boundary. */
1513 rounded
+= (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1;
1514 rounded
= (rounded
/ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1515 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1517 #if !defined(ASM_OUTPUT_ALIGNED_COMMON) && !defined(ASM_OUTPUT_ALIGNED_BSS)
1518 if ((DECL_ALIGN (decl
) / BITS_PER_UNIT
) > (unsigned int) rounded
)
1520 (decl
, "requested alignment for %s is greater than implemented alignment of %d.",rounded
);
1523 #ifdef DBX_DEBUGGING_INFO
1524 /* File-scope global variables are output here. */
1525 if (write_symbols
== DBX_DEBUG
&& top_level
)
1526 dbxout_symbol (decl
, 0);
1528 #ifdef SDB_DEBUGGING_INFO
1529 if (write_symbols
== SDB_DEBUG
&& top_level
1530 /* Leave initialized global vars for end of compilation;
1531 see comment in compile_file. */
1532 && (TREE_PUBLIC (decl
) == 0 || DECL_INITIAL (decl
) == 0))
1533 sdbout_symbol (decl
, 0);
1536 /* Don't output any DWARF debugging information for variables here.
1537 In the case of local variables, the information for them is output
1538 when we do our recursive traversal of the tree representation for
1539 the entire containing function. In the case of file-scope variables,
1540 we output information for all of them at the very end of compilation
1541 while we are doing our final traversal of the chain of file-scope
1544 #if 0 /* ??? We should either delete this or add a comment describing what
1545 it was intended to do and why we shouldn't delete it. */
1546 if (flag_shared_data
)
1549 asm_emit_uninitialised (decl
, name
, size
, rounded
);
1554 /* Handle initialized definitions.
1555 Also handle uninitialized global definitions if -fno-common and the
1556 target doesn't support ASM_OUTPUT_BSS. */
1558 /* First make the assembler name(s) global if appropriate. */
1559 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
))
1561 #ifdef ASM_WEAKEN_LABEL
1562 if (DECL_WEAK (decl
))
1564 ASM_WEAKEN_LABEL (asm_out_file
, name
);
1565 /* Remove this variable from the pending weak list so that
1566 we do not emit multiple .weak directives for it. */
1567 remove_from_pending_weak_list
1568 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
1572 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
1575 for (d
= equivalents
; d
; d
= TREE_CHAIN (d
))
1577 tree e
= TREE_VALUE (d
);
1578 if (TREE_PUBLIC (e
) && DECL_NAME (e
))
1579 ASM_GLOBALIZE_LABEL (asm_out_file
,
1580 XSTR (XEXP (DECL_RTL (e
), 0), 0));
1584 /* Output any data that we will need to use the address of. */
1585 if (DECL_INITIAL (decl
) == error_mark_node
)
1586 reloc
= contains_pointers_p (TREE_TYPE (decl
));
1587 else if (DECL_INITIAL (decl
))
1588 reloc
= output_addressed_constants (DECL_INITIAL (decl
));
1590 #ifdef ASM_OUTPUT_SECTION_NAME
1591 if ((flag_data_sections
!= 0 && DECL_SECTION_NAME (decl
) == NULL_TREE
)
1592 || UNIQUE_SECTION_P (decl
))
1593 UNIQUE_SECTION (decl
, reloc
);
1596 /* Switch to the appropriate section. */
1597 variable_section (decl
, reloc
);
1599 /* dbxout.c needs to know this. */
1600 if (in_text_section ())
1601 DECL_IN_TEXT_SECTION (decl
) = 1;
1603 /* Record current section so we can restore it if dbxout.c clobbers it. */
1604 saved_in_section
= in_section
;
1606 /* Output the dbx info now that we have chosen the section. */
1608 #ifdef DBX_DEBUGGING_INFO
1609 /* File-scope global variables are output here. */
1610 if (write_symbols
== DBX_DEBUG
&& top_level
)
1611 dbxout_symbol (decl
, 0);
1613 #ifdef SDB_DEBUGGING_INFO
1614 if (write_symbols
== SDB_DEBUG
&& top_level
1615 /* Leave initialized global vars for end of compilation;
1616 see comment in compile_file. */
1617 && (TREE_PUBLIC (decl
) == 0 || DECL_INITIAL (decl
) == 0))
1618 sdbout_symbol (decl
, 0);
1621 /* Don't output any DWARF debugging information for variables here.
1622 In the case of local variables, the information for them is output
1623 when we do our recursive traversal of the tree representation for
1624 the entire containing function. In the case of file-scope variables,
1625 we output information for all of them at the very end of compilation
1626 while we are doing our final traversal of the chain of file-scope
1629 /* If the debugging output changed sections, reselect the section
1630 that's supposed to be selected. */
1631 if (in_section
!= saved_in_section
)
1632 variable_section (decl
, reloc
);
1634 /* Output the alignment of this data. */
1635 if (align
> BITS_PER_UNIT
)
1636 ASM_OUTPUT_ALIGN (asm_out_file
,
1637 floor_log2 (DECL_ALIGN (decl
) / BITS_PER_UNIT
));
1639 /* Do any machine/system dependent processing of the object. */
1640 #ifdef ASM_DECLARE_OBJECT_NAME
1641 last_assemble_variable_decl
= decl
;
1642 ASM_DECLARE_OBJECT_NAME (asm_out_file
, name
, decl
);
1644 /* Standard thing is just output label for the object. */
1645 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1646 #endif /* ASM_DECLARE_OBJECT_NAME */
1648 if (!dont_output_data
)
1650 if (DECL_INITIAL (decl
))
1651 /* Output the actual data. */
1652 output_constant (DECL_INITIAL (decl
), TREE_INT_CST_LOW (size_tree
));
1654 /* Leave space for it. */
1655 assemble_zeros (TREE_INT_CST_LOW (size_tree
));
1659 #ifdef XCOFF_DEBUGGING_INFO
1660 /* Unfortunately, the IBM assembler cannot handle stabx before the actual
1661 declaration. When something like ".stabx "aa:S-2",aa,133,0" is emitted
1662 and `aa' hasn't been output yet, the assembler generates a stab entry with
1663 a value of zero, in addition to creating an unnecessary external entry
1664 for `aa'. Hence, we must postpone dbxout_symbol to here at the end. */
1666 /* File-scope global variables are output here. */
1667 if (write_symbols
== XCOFF_DEBUG
&& top_level
)
1669 saved_in_section
= in_section
;
1671 dbxout_symbol (decl
, 0);
1673 if (in_section
!= saved_in_section
)
1674 variable_section (decl
, reloc
);
1677 /* There must be a statement after a label. */
1682 /* Return 1 if type TYPE contains any pointers. */
1685 contains_pointers_p (type
)
1688 switch (TREE_CODE (type
))
1691 case REFERENCE_TYPE
:
1692 /* I'm not sure whether OFFSET_TYPE needs this treatment,
1693 so I'll play safe and return 1. */
1699 case QUAL_UNION_TYPE
:
1702 /* For a type that has fields, see if the fields have pointers. */
1703 for (fields
= TYPE_FIELDS (type
); fields
; fields
= TREE_CHAIN (fields
))
1704 if (TREE_CODE (fields
) == FIELD_DECL
1705 && contains_pointers_p (TREE_TYPE (fields
)))
1711 /* An array type contains pointers if its element type does. */
1712 return contains_pointers_p (TREE_TYPE (type
));
1719 /* Output something to declare an external symbol to the assembler.
1720 (Most assemblers don't need this, so we normally output nothing.)
1721 Do nothing if DECL is not external. */
1724 assemble_external (decl
)
1725 tree decl ATTRIBUTE_UNUSED
;
1727 #ifdef ASM_OUTPUT_EXTERNAL
1728 if (TREE_CODE_CLASS (TREE_CODE (decl
)) == 'd'
1729 && DECL_EXTERNAL (decl
) && TREE_PUBLIC (decl
))
1731 rtx rtl
= DECL_RTL (decl
);
1733 if (GET_CODE (rtl
) == MEM
&& GET_CODE (XEXP (rtl
, 0)) == SYMBOL_REF
1734 && ! SYMBOL_REF_USED (XEXP (rtl
, 0)))
1736 /* Some systems do require some output. */
1737 SYMBOL_REF_USED (XEXP (rtl
, 0)) = 1;
1738 ASM_OUTPUT_EXTERNAL (asm_out_file
, decl
, XSTR (XEXP (rtl
, 0), 0));
1744 /* Similar, for calling a library function FUN. */
1747 assemble_external_libcall (fun
)
1748 rtx fun ATTRIBUTE_UNUSED
;
1750 #ifdef ASM_OUTPUT_EXTERNAL_LIBCALL
1751 /* Declare library function name external when first used, if nec. */
1752 if (! SYMBOL_REF_USED (fun
))
1754 SYMBOL_REF_USED (fun
) = 1;
1755 ASM_OUTPUT_EXTERNAL_LIBCALL (asm_out_file
, fun
);
1760 /* Declare the label NAME global. */
1763 assemble_global (name
)
1766 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
1769 /* Assemble a label named NAME. */
1772 assemble_label (name
)
1775 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1778 /* Output to FILE a reference to the assembler name of a C-level name NAME.
1779 If NAME starts with a *, the rest of NAME is output verbatim.
1780 Otherwise NAME is transformed in an implementation-defined way
1781 (usually by the addition of an underscore).
1782 Many macros in the tm file are defined to call this function. */
1785 assemble_name (file
, name
)
1789 const char *real_name
;
1792 STRIP_NAME_ENCODING (real_name
, name
);
1793 if (flag_prefix_function_name
1794 && ! bcmp (real_name
, CHKR_PREFIX
, CHKR_PREFIX_SIZE
))
1795 real_name
= real_name
+ CHKR_PREFIX_SIZE
;
1797 id
= maybe_get_identifier (real_name
);
1799 TREE_SYMBOL_REFERENCED (id
) = 1;
1802 fputs (&name
[1], file
);
1804 ASM_OUTPUT_LABELREF (file
, name
);
1807 /* Allocate SIZE bytes writable static space with a gensym name
1808 and return an RTX to refer to its address. */
1811 assemble_static_space (size
)
1819 if (flag_shared_data
)
1823 ASM_GENERATE_INTERNAL_LABEL (name
, "LF", const_labelno
);
1825 namestring
= ggc_alloc_string (name
, -1);
1827 x
= gen_rtx_SYMBOL_REF (Pmode
, namestring
);
1829 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
1830 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file
, NULL_TREE
, name
, size
,
1833 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1834 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file
, name
, size
, BIGGEST_ALIGNMENT
);
1837 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1838 so that each uninitialized object starts on such a boundary. */
1839 /* Variable `rounded' might or might not be used in ASM_OUTPUT_LOCAL. */
1840 int rounded ATTRIBUTE_UNUSED
1841 = ((size
+ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1)
1842 / (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1843 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1844 ASM_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
1851 /* Assemble the static constant template for function entry trampolines.
1852 This is done at most once per compilation.
1853 Returns an RTX for the address of the template. */
1855 #ifdef TRAMPOLINE_TEMPLATE
1857 assemble_trampoline_template ()
1863 /* By default, put trampoline templates in read-only data section. */
1865 #ifdef TRAMPOLINE_SECTION
1866 TRAMPOLINE_SECTION ();
1868 readonly_data_section ();
1871 /* Write the assembler code to define one. */
1872 align
= floor_log2 (TRAMPOLINE_ALIGNMENT
/ BITS_PER_UNIT
);
1874 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1876 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LTRAMP", 0);
1877 TRAMPOLINE_TEMPLATE (asm_out_file
);
1879 /* Record the rtl to refer to it. */
1880 ASM_GENERATE_INTERNAL_LABEL (label
, "LTRAMP", 0);
1881 name
= ggc_alloc_string (label
, -1);
1882 return gen_rtx_SYMBOL_REF (Pmode
, name
);
1886 /* Assemble the integer constant X into an object of SIZE bytes.
1887 X must be either a CONST_INT or CONST_DOUBLE.
1889 Return 1 if we were able to output the constant, otherwise 0. If FORCE is
1890 non-zero, abort if we can't output the constant. */
1893 assemble_integer (x
, size
, force
)
1898 /* First try to use the standard 1, 2, 4, 8, and 16 byte
1899 ASM_OUTPUT... macros. */
1903 #ifdef ASM_OUTPUT_CHAR
1905 ASM_OUTPUT_CHAR (asm_out_file
, x
);
1909 #ifdef ASM_OUTPUT_SHORT
1911 ASM_OUTPUT_SHORT (asm_out_file
, x
);
1915 #ifdef ASM_OUTPUT_INT
1917 ASM_OUTPUT_INT (asm_out_file
, x
);
1921 #ifdef ASM_OUTPUT_DOUBLE_INT
1923 ASM_OUTPUT_DOUBLE_INT (asm_out_file
, x
);
1927 #ifdef ASM_OUTPUT_QUADRUPLE_INT
1929 ASM_OUTPUT_QUADRUPLE_INT (asm_out_file
, x
);
1934 /* If we couldn't do it that way, there are two other possibilities: First,
1935 if the machine can output an explicit byte and this is a 1 byte constant,
1936 we can use ASM_OUTPUT_BYTE. */
1938 #ifdef ASM_OUTPUT_BYTE
1939 if (size
== 1 && GET_CODE (x
) == CONST_INT
)
1941 ASM_OUTPUT_BYTE (asm_out_file
, INTVAL (x
));
1946 /* Finally, if SIZE is larger than a single word, try to output the constant
1947 one word at a time. */
1949 if (size
> UNITS_PER_WORD
)
1952 enum machine_mode mode
1953 = mode_for_size (size
* BITS_PER_UNIT
, MODE_INT
, 0);
1956 for (i
= 0; i
< size
/ UNITS_PER_WORD
; i
++)
1958 word
= operand_subword (x
, i
, 0, mode
);
1963 if (! assemble_integer (word
, UNITS_PER_WORD
, 0))
1967 if (i
== size
/ UNITS_PER_WORD
)
1969 /* If we output at least one word and then could not finish,
1970 there is no valid way to continue. */
1981 /* Assemble the floating-point constant D into an object of size MODE. */
1984 assemble_real (d
, mode
)
1986 enum machine_mode mode
;
1988 jmp_buf output_constant_handler
;
1990 if (setjmp (output_constant_handler
))
1992 error ("floating point trap outputting a constant");
1993 #ifdef REAL_IS_NOT_DOUBLE
1994 bzero ((char *) &d
, sizeof d
);
2001 set_float_handler (output_constant_handler
);
2005 #ifdef ASM_OUTPUT_BYTE_FLOAT
2007 ASM_OUTPUT_BYTE_FLOAT (asm_out_file
, d
);
2010 #ifdef ASM_OUTPUT_SHORT_FLOAT
2012 ASM_OUTPUT_SHORT_FLOAT (asm_out_file
, d
);
2015 #ifdef ASM_OUTPUT_THREE_QUARTER_FLOAT
2017 ASM_OUTPUT_THREE_QUARTER_FLOAT (asm_out_file
, d
);
2020 #ifdef ASM_OUTPUT_FLOAT
2022 ASM_OUTPUT_FLOAT (asm_out_file
, d
);
2026 #ifdef ASM_OUTPUT_DOUBLE
2028 ASM_OUTPUT_DOUBLE (asm_out_file
, d
);
2032 #ifdef ASM_OUTPUT_LONG_DOUBLE
2035 ASM_OUTPUT_LONG_DOUBLE (asm_out_file
, d
);
2043 set_float_handler (NULL_PTR
);
2046 /* Here we combine duplicate floating constants to make
2047 CONST_DOUBLE rtx's, and force those out to memory when necessary. */
2049 /* Return a CONST_DOUBLE or CONST_INT for a value specified as a pair of ints.
2050 For an integer, I0 is the low-order word and I1 is the high-order word.
2051 For a real number, I0 is the word with the low address
2052 and I1 is the word with the high address. */
2055 immed_double_const (i0
, i1
, mode
)
2056 HOST_WIDE_INT i0
, i1
;
2057 enum machine_mode mode
;
2061 if (GET_MODE_CLASS (mode
) == MODE_INT
2062 || GET_MODE_CLASS (mode
) == MODE_PARTIAL_INT
)
2064 /* We clear out all bits that don't belong in MODE, unless they and our
2065 sign bit are all one. So we get either a reasonable negative value
2066 or a reasonable unsigned value for this mode. */
2067 int width
= GET_MODE_BITSIZE (mode
);
2068 if (width
< HOST_BITS_PER_WIDE_INT
2069 && ((i0
& ((HOST_WIDE_INT
) (-1) << (width
- 1)))
2070 != ((HOST_WIDE_INT
) (-1) << (width
- 1))))
2071 i0
&= ((HOST_WIDE_INT
) 1 << width
) - 1, i1
= 0;
2072 else if (width
== HOST_BITS_PER_WIDE_INT
2073 && ! (i1
== ~0 && i0
< 0))
2075 else if (width
> 2 * HOST_BITS_PER_WIDE_INT
)
2076 /* We cannot represent this value as a constant. */
2079 /* If this would be an entire word for the target, but is not for
2080 the host, then sign-extend on the host so that the number will look
2081 the same way on the host that it would on the target.
2083 For example, when building a 64 bit alpha hosted 32 bit sparc
2084 targeted compiler, then we want the 32 bit unsigned value -1 to be
2085 represented as a 64 bit value -1, and not as 0x00000000ffffffff.
2086 The later confuses the sparc backend. */
2088 if (BITS_PER_WORD
< HOST_BITS_PER_WIDE_INT
&& BITS_PER_WORD
== width
2089 && (i0
& ((HOST_WIDE_INT
) 1 << (width
- 1))))
2090 i0
|= ((HOST_WIDE_INT
) (-1) << width
);
2092 /* If MODE fits within HOST_BITS_PER_WIDE_INT, always use a CONST_INT.
2094 ??? Strictly speaking, this is wrong if we create a CONST_INT
2095 for a large unsigned constant with the size of MODE being
2096 HOST_BITS_PER_WIDE_INT and later try to interpret that constant in a
2097 wider mode. In that case we will mis-interpret it as a negative
2100 Unfortunately, the only alternative is to make a CONST_DOUBLE
2101 for any constant in any mode if it is an unsigned constant larger
2102 than the maximum signed integer in an int on the host. However,
2103 doing this will break everyone that always expects to see a CONST_INT
2104 for SImode and smaller.
2106 We have always been making CONST_INTs in this case, so nothing new
2109 if (width
<= HOST_BITS_PER_WIDE_INT
)
2110 i1
= (i0
< 0) ? ~(HOST_WIDE_INT
) 0 : 0;
2112 /* If this integer fits in one word, return a CONST_INT. */
2113 if ((i1
== 0 && i0
>= 0)
2114 || (i1
== ~0 && i0
< 0))
2115 return GEN_INT (i0
);
2117 /* We use VOIDmode for integers. */
2121 /* Search the chain for an existing CONST_DOUBLE with the right value.
2122 If one is found, return it. */
2124 for (r
= const_double_chain
; r
; r
= CONST_DOUBLE_CHAIN (r
))
2125 if (CONST_DOUBLE_LOW (r
) == i0
&& CONST_DOUBLE_HIGH (r
) == i1
2126 && GET_MODE (r
) == mode
)
2129 /* No; make a new one and add it to the chain.
2131 We may be called by an optimizer which may be discarding any memory
2132 allocated during its processing (such as combine and loop). However,
2133 we will be leaving this constant on the chain, so we cannot tolerate
2134 freed memory. So switch to saveable_obstack for this allocation
2135 and then switch back if we were in current_obstack. */
2137 push_obstacks_nochange ();
2138 rtl_in_saveable_obstack ();
2139 r
= gen_rtx_CONST_DOUBLE (mode
, NULL_RTX
, i0
, i1
);
2142 /* Don't touch const_double_chain if not inside any function. */
2143 if (current_function_decl
!= 0)
2145 CONST_DOUBLE_CHAIN (r
) = const_double_chain
;
2146 const_double_chain
= r
;
2149 /* Store const0_rtx in mem-slot since this CONST_DOUBLE is on the chain.
2150 Actual use of mem-slot is only through force_const_mem. */
2152 CONST_DOUBLE_MEM (r
) = const0_rtx
;
2157 /* Return a CONST_DOUBLE for a specified `double' value
2158 and machine mode. */
2161 immed_real_const_1 (d
, mode
)
2163 enum machine_mode mode
;
2165 union real_extract u
;
2168 /* Get the desired `double' value as a sequence of ints
2169 since that is how they are stored in a CONST_DOUBLE. */
2173 /* Detect special cases. */
2175 if (REAL_VALUES_IDENTICAL (dconst0
, d
))
2176 return CONST0_RTX (mode
);
2177 /* Check for NaN first, because some ports (specifically the i386) do not
2178 emit correct ieee-fp code by default, and thus will generate a core
2179 dump here if we pass a NaN to REAL_VALUES_EQUAL and if REAL_VALUES_EQUAL
2180 does a floating point comparison. */
2181 else if (! REAL_VALUE_ISNAN (d
) && REAL_VALUES_EQUAL (dconst1
, d
))
2182 return CONST1_RTX (mode
);
2184 if (sizeof u
== sizeof (HOST_WIDE_INT
))
2185 return immed_double_const (u
.i
[0], 0, mode
);
2186 if (sizeof u
== 2 * sizeof (HOST_WIDE_INT
))
2187 return immed_double_const (u
.i
[0], u
.i
[1], mode
);
2189 /* The rest of this function handles the case where
2190 a float value requires more than 2 ints of space.
2191 It will be deleted as dead code on machines that don't need it. */
2193 /* Search the chain for an existing CONST_DOUBLE with the right value.
2194 If one is found, return it. */
2196 for (r
= const_double_chain
; r
; r
= CONST_DOUBLE_CHAIN (r
))
2197 if (! bcmp ((char *) &CONST_DOUBLE_LOW (r
), (char *) &u
, sizeof u
)
2198 && GET_MODE (r
) == mode
)
2201 /* No; make a new one and add it to the chain.
2203 We may be called by an optimizer which may be discarding any memory
2204 allocated during its processing (such as combine and loop). However,
2205 we will be leaving this constant on the chain, so we cannot tolerate
2206 freed memory. So switch to saveable_obstack for this allocation
2207 and then switch back if we were in current_obstack. */
2208 push_obstacks_nochange ();
2209 rtl_in_saveable_obstack ();
2210 r
= rtx_alloc (CONST_DOUBLE
);
2213 bcopy ((char *) &u
, (char *) &CONST_DOUBLE_LOW (r
), sizeof u
);
2215 /* Don't touch const_double_chain if not inside any function. */
2216 if (current_function_decl
!= 0)
2218 CONST_DOUBLE_CHAIN (r
) = const_double_chain
;
2219 const_double_chain
= r
;
2222 /* Store const0_rtx in CONST_DOUBLE_MEM since this CONST_DOUBLE is on the
2223 chain, but has not been allocated memory. Actual use of CONST_DOUBLE_MEM
2224 is only through force_const_mem. */
2226 CONST_DOUBLE_MEM (r
) = const0_rtx
;
2231 /* Return a CONST_DOUBLE rtx for a value specified by EXP,
2232 which must be a REAL_CST tree node. */
2235 immed_real_const (exp
)
2238 return immed_real_const_1 (TREE_REAL_CST (exp
), TYPE_MODE (TREE_TYPE (exp
)));
2241 /* At the end of a function, forget the memory-constants
2242 previously made for CONST_DOUBLEs. Mark them as not on real_constant_chain.
2243 Also clear out real_constant_chain and clear out all the chain-pointers. */
2246 clear_const_double_mem ()
2248 register rtx r
, next
;
2250 for (r
= const_double_chain
; r
; r
= next
)
2252 next
= CONST_DOUBLE_CHAIN (r
);
2253 CONST_DOUBLE_CHAIN (r
) = 0;
2254 CONST_DOUBLE_MEM (r
) = cc0_rtx
;
2256 const_double_chain
= 0;
2259 /* Given an expression EXP with a constant value,
2260 reduce it to the sum of an assembler symbol and an integer.
2261 Store them both in the structure *VALUE.
2262 Abort if EXP does not reduce. */
2267 HOST_WIDE_INT offset
;
2271 decode_addr_const (exp
, value
)
2273 struct addr_const
*value
;
2275 register tree target
= TREE_OPERAND (exp
, 0);
2276 register int offset
= 0;
2281 if (TREE_CODE (target
) == COMPONENT_REF
2282 && (TREE_CODE (DECL_FIELD_BITPOS (TREE_OPERAND (target
, 1)))
2285 offset
+= TREE_INT_CST_LOW (DECL_FIELD_BITPOS (TREE_OPERAND (target
, 1))) / BITS_PER_UNIT
;
2286 target
= TREE_OPERAND (target
, 0);
2288 else if (TREE_CODE (target
) == ARRAY_REF
)
2290 if (TREE_CODE (TREE_OPERAND (target
, 1)) != INTEGER_CST
2291 || TREE_CODE (TYPE_SIZE (TREE_TYPE (target
))) != INTEGER_CST
)
2293 offset
+= ((TREE_INT_CST_LOW (TYPE_SIZE (TREE_TYPE (target
)))
2294 * TREE_INT_CST_LOW (TREE_OPERAND (target
, 1)))
2296 target
= TREE_OPERAND (target
, 0);
2302 switch (TREE_CODE (target
))
2306 x
= DECL_RTL (target
);
2310 x
= gen_rtx_MEM (FUNCTION_MODE
,
2311 gen_rtx_LABEL_REF (VOIDmode
,
2312 label_rtx (TREE_OPERAND (exp
, 0))));
2320 x
= TREE_CST_RTL (target
);
2327 if (GET_CODE (x
) != MEM
)
2332 value
->offset
= offset
;
2335 /* Uniquize all constants that appear in memory.
2336 Each constant in memory thus far output is recorded
2337 in `const_hash_table' with a `struct constant_descriptor'
2338 that contains a polish representation of the value of
2341 We cannot store the trees in the hash table
2342 because the trees may be temporary. */
2344 struct constant_descriptor
2346 struct constant_descriptor
*next
;
2353 #define MAX_HASH_TABLE 1009
2354 static struct constant_descriptor
*const_hash_table
[MAX_HASH_TABLE
];
2356 /* Mark a const_hash_table descriptor for GC. */
2359 mark_const_hash_entry (ptr
)
2362 struct constant_descriptor
*desc
= * (struct constant_descriptor
**) ptr
;
2366 ggc_mark_string (desc
->label
);
2367 ggc_mark_rtx (desc
->rtl
);
2372 /* Compute a hash code for a constant expression. */
2379 register int len
, hi
, i
;
2380 register enum tree_code code
= TREE_CODE (exp
);
2382 /* Either set P and LEN to the address and len of something to hash and
2383 exit the switch or return a value. */
2388 p
= (char *) &TREE_INT_CST_LOW (exp
);
2389 len
= 2 * sizeof TREE_INT_CST_LOW (exp
);
2393 p
= (char *) &TREE_REAL_CST (exp
);
2394 len
= sizeof TREE_REAL_CST (exp
);
2398 p
= TREE_STRING_POINTER (exp
);
2399 len
= TREE_STRING_LENGTH (exp
);
2403 return (const_hash (TREE_REALPART (exp
)) * 5
2404 + const_hash (TREE_IMAGPART (exp
)));
2407 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2409 len
= int_size_in_bytes (TREE_TYPE (exp
));
2410 p
= (char *) alloca (len
);
2411 get_set_constructor_bytes (exp
, (unsigned char *) p
, len
);
2418 /* For record type, include the type in the hashing.
2419 We do not do so for array types
2420 because (1) the sizes of the elements are sufficient
2421 and (2) distinct array types can have the same constructor.
2422 Instead, we include the array size because the constructor could
2424 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2425 hi
= ((unsigned long) TREE_TYPE (exp
) & ((1 << HASHBITS
) - 1))
2428 hi
= ((5 + int_size_in_bytes (TREE_TYPE (exp
)))
2429 & ((1 << HASHBITS
) - 1)) % MAX_HASH_TABLE
;
2431 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2432 if (TREE_VALUE (link
))
2434 = (hi
* 603 + const_hash (TREE_VALUE (link
))) % MAX_HASH_TABLE
;
2441 struct addr_const value
;
2443 decode_addr_const (exp
, &value
);
2444 if (GET_CODE (value
.base
) == SYMBOL_REF
)
2446 /* Don't hash the address of the SYMBOL_REF;
2447 only use the offset and the symbol name. */
2449 p
= XSTR (value
.base
, 0);
2450 for (i
= 0; p
[i
] != 0; i
++)
2451 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2453 else if (GET_CODE (value
.base
) == LABEL_REF
)
2454 hi
= value
.offset
+ CODE_LABEL_NUMBER (XEXP (value
.base
, 0)) * 13;
2458 hi
&= (1 << HASHBITS
) - 1;
2459 hi
%= MAX_HASH_TABLE
;
2465 return (const_hash (TREE_OPERAND (exp
, 0)) * 9
2466 + const_hash (TREE_OPERAND (exp
, 1)));
2470 case NON_LVALUE_EXPR
:
2471 return const_hash (TREE_OPERAND (exp
, 0)) * 7 + 2;
2477 /* Compute hashing function */
2479 for (i
= 0; i
< len
; i
++)
2480 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2482 hi
&= (1 << HASHBITS
) - 1;
2483 hi
%= MAX_HASH_TABLE
;
2487 /* Compare a constant expression EXP with a constant-descriptor DESC.
2488 Return 1 if DESC describes a constant with the same value as EXP. */
2491 compare_constant (exp
, desc
)
2493 struct constant_descriptor
*desc
;
2495 return 0 != compare_constant_1 (exp
, desc
->contents
);
2498 /* Compare constant expression EXP with a substring P of a constant descriptor.
2499 If they match, return a pointer to the end of the substring matched.
2500 If they do not match, return 0.
2502 Since descriptors are written in polish prefix notation,
2503 this function can be used recursively to test one operand of EXP
2504 against a subdescriptor, and if it succeeds it returns the
2505 address of the subdescriptor for the next operand. */
2508 compare_constant_1 (exp
, p
)
2512 register char *strp
;
2514 register enum tree_code code
= TREE_CODE (exp
);
2516 if (code
!= (enum tree_code
) *p
++)
2519 /* Either set STRP, P and LEN to pointers and length to compare and exit the
2520 switch, or return the result of the comparison. */
2525 /* Integer constants are the same only if the same width of type. */
2526 if (*p
++ != TYPE_PRECISION (TREE_TYPE (exp
)))
2529 strp
= (char *) &TREE_INT_CST_LOW (exp
);
2530 len
= 2 * sizeof TREE_INT_CST_LOW (exp
);
2534 /* Real constants are the same only if the same width of type. */
2535 if (*p
++ != TYPE_PRECISION (TREE_TYPE (exp
)))
2538 strp
= (char *) &TREE_REAL_CST (exp
);
2539 len
= sizeof TREE_REAL_CST (exp
);
2543 if (flag_writable_strings
)
2546 if ((enum machine_mode
) *p
++ != TYPE_MODE (TREE_TYPE (exp
)))
2549 strp
= TREE_STRING_POINTER (exp
);
2550 len
= TREE_STRING_LENGTH (exp
);
2551 if (bcmp ((char *) &TREE_STRING_LENGTH (exp
), p
,
2552 sizeof TREE_STRING_LENGTH (exp
)))
2555 p
+= sizeof TREE_STRING_LENGTH (exp
);
2559 p
= compare_constant_1 (TREE_REALPART (exp
), p
);
2563 return compare_constant_1 (TREE_IMAGPART (exp
), p
);
2566 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2568 int xlen
= len
= int_size_in_bytes (TREE_TYPE (exp
));
2570 strp
= (char *) alloca (len
);
2571 get_set_constructor_bytes (exp
, (unsigned char *) strp
, len
);
2572 if (bcmp ((char *) &xlen
, p
, sizeof xlen
))
2581 int length
= list_length (CONSTRUCTOR_ELTS (exp
));
2583 enum machine_mode mode
= TYPE_MODE (TREE_TYPE (exp
));
2584 int have_purpose
= 0;
2586 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2587 if (TREE_PURPOSE (link
))
2590 if (bcmp ((char *) &length
, p
, sizeof length
))
2595 /* For record constructors, insist that the types match.
2596 For arrays, just verify both constructors are for arrays.
2597 Then insist that either both or none have any TREE_PURPOSE
2599 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2600 type
= TREE_TYPE (exp
);
2604 if (bcmp ((char *) &type
, p
, sizeof type
))
2607 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2609 if (bcmp ((char *) &mode
, p
, sizeof mode
))
2617 if (bcmp ((char *) &have_purpose
, p
, sizeof have_purpose
))
2620 p
+= sizeof have_purpose
;
2622 /* For arrays, insist that the size in bytes match. */
2623 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2625 HOST_WIDE_INT size
= int_size_in_bytes (TREE_TYPE (exp
));
2627 if (bcmp ((char *) &size
, p
, sizeof size
))
2633 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2635 if (TREE_VALUE (link
))
2637 if ((p
= compare_constant_1 (TREE_VALUE (link
), p
)) == 0)
2644 if (bcmp ((char *) &zero
, p
, sizeof zero
))
2650 if (TREE_PURPOSE (link
)
2651 && TREE_CODE (TREE_PURPOSE (link
)) == FIELD_DECL
)
2653 if (bcmp ((char *) &TREE_PURPOSE (link
), p
,
2654 sizeof TREE_PURPOSE (link
)))
2657 p
+= sizeof TREE_PURPOSE (link
);
2659 else if (TREE_PURPOSE (link
))
2661 if ((p
= compare_constant_1 (TREE_PURPOSE (link
), p
)) == 0)
2664 else if (have_purpose
)
2668 if (bcmp ((char *) &zero
, p
, sizeof zero
))
2680 struct addr_const value
;
2682 decode_addr_const (exp
, &value
);
2683 strp
= (char *) &value
.offset
;
2684 len
= sizeof value
.offset
;
2685 /* Compare the offset. */
2687 if (*p
++ != *strp
++)
2690 /* Compare symbol name. */
2691 strp
= XSTR (value
.base
, 0);
2692 len
= strlen (strp
) + 1;
2699 p
= compare_constant_1 (TREE_OPERAND (exp
, 0), p
);
2703 return compare_constant_1 (TREE_OPERAND (exp
, 1), p
);
2707 case NON_LVALUE_EXPR
:
2708 return compare_constant_1 (TREE_OPERAND (exp
, 0), p
);
2714 /* Compare constant contents. */
2716 if (*p
++ != *strp
++)
2722 /* Construct a constant descriptor for the expression EXP.
2723 It is up to the caller to enter the descriptor in the hash table. */
2725 static struct constant_descriptor
*
2726 record_constant (exp
)
2729 struct constant_descriptor
*next
= 0;
2733 /* Make a struct constant_descriptor. The first three pointers will
2734 be filled in later. Here we just leave space for them. */
2736 obstack_grow (&permanent_obstack
, (char *) &next
, sizeof next
);
2737 obstack_grow (&permanent_obstack
, (char *) &label
, sizeof label
);
2738 obstack_grow (&permanent_obstack
, (char *) &rtl
, sizeof rtl
);
2739 record_constant_1 (exp
);
2740 return (struct constant_descriptor
*) obstack_finish (&permanent_obstack
);
2743 /* Add a description of constant expression EXP
2744 to the object growing in `permanent_obstack'.
2745 No need to return its address; the caller will get that
2746 from the obstack when the object is complete. */
2749 record_constant_1 (exp
)
2752 register char *strp
;
2754 register enum tree_code code
= TREE_CODE (exp
);
2756 obstack_1grow (&permanent_obstack
, (unsigned int) code
);
2761 obstack_1grow (&permanent_obstack
, TYPE_PRECISION (TREE_TYPE (exp
)));
2762 strp
= (char *) &TREE_INT_CST_LOW (exp
);
2763 len
= 2 * sizeof TREE_INT_CST_LOW (exp
);
2767 obstack_1grow (&permanent_obstack
, TYPE_PRECISION (TREE_TYPE (exp
)));
2768 strp
= (char *) &TREE_REAL_CST (exp
);
2769 len
= sizeof TREE_REAL_CST (exp
);
2773 if (flag_writable_strings
)
2776 obstack_1grow (&permanent_obstack
, TYPE_MODE (TREE_TYPE (exp
)));
2777 strp
= TREE_STRING_POINTER (exp
);
2778 len
= TREE_STRING_LENGTH (exp
);
2779 obstack_grow (&permanent_obstack
, (char *) &TREE_STRING_LENGTH (exp
),
2780 sizeof TREE_STRING_LENGTH (exp
));
2784 record_constant_1 (TREE_REALPART (exp
));
2785 record_constant_1 (TREE_IMAGPART (exp
));
2789 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2791 int nbytes
= int_size_in_bytes (TREE_TYPE (exp
));
2792 obstack_grow (&permanent_obstack
, &nbytes
, sizeof (nbytes
));
2793 obstack_blank (&permanent_obstack
, nbytes
);
2794 get_set_constructor_bytes
2795 (exp
, (unsigned char *) permanent_obstack
.next_free
-nbytes
,
2802 int length
= list_length (CONSTRUCTOR_ELTS (exp
));
2803 enum machine_mode mode
= TYPE_MODE (TREE_TYPE (exp
));
2805 int have_purpose
= 0;
2807 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2808 if (TREE_PURPOSE (link
))
2811 obstack_grow (&permanent_obstack
, (char *) &length
, sizeof length
);
2813 /* For record constructors, insist that the types match.
2814 For arrays, just verify both constructors are for arrays
2815 of the same mode. Then insist that either both or none
2816 have any TREE_PURPOSE values. */
2817 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2818 type
= TREE_TYPE (exp
);
2822 obstack_grow (&permanent_obstack
, (char *) &type
, sizeof type
);
2823 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2824 obstack_grow (&permanent_obstack
, &mode
, sizeof mode
);
2826 obstack_grow (&permanent_obstack
, (char *) &have_purpose
,
2827 sizeof have_purpose
);
2829 /* For arrays, insist that the size in bytes match. */
2830 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2832 HOST_WIDE_INT size
= int_size_in_bytes (TREE_TYPE (exp
));
2833 obstack_grow (&permanent_obstack
, (char *) &size
, sizeof size
);
2836 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2838 if (TREE_VALUE (link
))
2839 record_constant_1 (TREE_VALUE (link
));
2844 obstack_grow (&permanent_obstack
,
2845 (char *) &zero
, sizeof zero
);
2848 if (TREE_PURPOSE (link
)
2849 && TREE_CODE (TREE_PURPOSE (link
)) == FIELD_DECL
)
2850 obstack_grow (&permanent_obstack
,
2851 (char *) &TREE_PURPOSE (link
),
2852 sizeof TREE_PURPOSE (link
));
2853 else if (TREE_PURPOSE (link
))
2854 record_constant_1 (TREE_PURPOSE (link
));
2855 else if (have_purpose
)
2859 obstack_grow (&permanent_obstack
,
2860 (char *) &zero
, sizeof zero
);
2868 struct addr_const value
;
2870 decode_addr_const (exp
, &value
);
2871 /* Record the offset. */
2872 obstack_grow (&permanent_obstack
,
2873 (char *) &value
.offset
, sizeof value
.offset
);
2874 /* Record the symbol name. */
2875 obstack_grow (&permanent_obstack
, XSTR (value
.base
, 0),
2876 strlen (XSTR (value
.base
, 0)) + 1);
2883 record_constant_1 (TREE_OPERAND (exp
, 0));
2884 record_constant_1 (TREE_OPERAND (exp
, 1));
2889 case NON_LVALUE_EXPR
:
2890 record_constant_1 (TREE_OPERAND (exp
, 0));
2897 /* Record constant contents. */
2898 obstack_grow (&permanent_obstack
, strp
, len
);
2901 /* Record a list of constant expressions that were passed to
2902 output_constant_def but that could not be output right away. */
2904 struct deferred_constant
2906 struct deferred_constant
*next
;
2912 static struct deferred_constant
*deferred_constants
;
2914 /* Another list of constants which should be output after the
2916 static struct deferred_constant
*after_function_constants
;
2918 /* Nonzero means defer output of addressed subconstants
2919 (i.e., those for which output_constant_def is called.) */
2920 static int defer_addressed_constants_flag
;
2922 /* Start deferring output of subconstants. */
2925 defer_addressed_constants ()
2927 defer_addressed_constants_flag
++;
2930 /* Stop deferring output of subconstants,
2931 and output now all those that have been deferred. */
2934 output_deferred_addressed_constants ()
2936 struct deferred_constant
*p
, *next
;
2938 defer_addressed_constants_flag
--;
2940 if (defer_addressed_constants_flag
> 0)
2943 for (p
= deferred_constants
; p
; p
= next
)
2945 output_constant_def_contents (p
->exp
, p
->reloc
, p
->labelno
);
2950 deferred_constants
= 0;
2953 /* Output any constants which should appear after a function. */
2956 output_after_function_constants ()
2958 struct deferred_constant
*p
, *next
;
2960 for (p
= after_function_constants
; p
; p
= next
)
2962 output_constant_def_contents (p
->exp
, p
->reloc
, p
->labelno
);
2967 after_function_constants
= 0;
2970 /* Make a copy of the whole tree structure for a constant.
2971 This handles the same types of nodes that compare_constant
2972 and record_constant handle. */
2978 switch (TREE_CODE (exp
))
2981 /* For ADDR_EXPR, we do not want to copy the decl whose address
2982 is requested. We do want to copy constants though. */
2983 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, 0))) == 'c')
2984 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2985 copy_constant (TREE_OPERAND (exp
, 0)));
2987 return copy_node (exp
);
2992 return copy_node (exp
);
2995 return build_complex (TREE_TYPE (exp
),
2996 copy_constant (TREE_REALPART (exp
)),
2997 copy_constant (TREE_IMAGPART (exp
)));
3001 return build (TREE_CODE (exp
), TREE_TYPE (exp
),
3002 copy_constant (TREE_OPERAND (exp
, 0)),
3003 copy_constant (TREE_OPERAND (exp
, 1)));
3007 case NON_LVALUE_EXPR
:
3008 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
3009 copy_constant (TREE_OPERAND (exp
, 0)));
3013 tree copy
= copy_node (exp
);
3014 tree list
= copy_list (CONSTRUCTOR_ELTS (exp
));
3017 CONSTRUCTOR_ELTS (copy
) = list
;
3018 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
3019 TREE_VALUE (tail
) = copy_constant (TREE_VALUE (tail
));
3020 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
3021 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
3022 TREE_PURPOSE (tail
) = copy_constant (TREE_PURPOSE (tail
));
3032 /* Return an rtx representing a reference to constant data in memory
3033 for the constant expression EXP.
3035 If assembler code for such a constant has already been output,
3036 return an rtx to refer to it.
3037 Otherwise, output such a constant in memory (or defer it for later)
3038 and generate an rtx for it.
3040 The TREE_CST_RTL of EXP is set up to point to that rtx.
3041 The const_hash_table records which constants already have label strings. */
3044 output_constant_def (exp
)
3048 register struct constant_descriptor
*desc
;
3053 if (TREE_CST_RTL (exp
))
3054 return TREE_CST_RTL (exp
);
3056 /* Make sure any other constants whose addresses appear in EXP
3057 are assigned label numbers. */
3059 reloc
= output_addressed_constants (exp
);
3061 /* Compute hash code of EXP. Search the descriptors for that hash code
3062 to see if any of them describes EXP. If yes, the descriptor records
3063 the label number already assigned. */
3065 hash
= const_hash (exp
) % MAX_HASH_TABLE
;
3067 for (desc
= const_hash_table
[hash
]; desc
; desc
= desc
->next
)
3068 if (compare_constant (exp
, desc
))
3073 /* No constant equal to EXP is known to have been output.
3074 Make a constant descriptor to enter EXP in the hash table.
3075 Assign the label number and record it in the descriptor for
3076 future calls to this function to find. */
3078 /* Create a string containing the label name, in LABEL. */
3079 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
3081 desc
= record_constant (exp
);
3082 desc
->next
= const_hash_table
[hash
];
3083 desc
->label
= ggc_alloc_string (label
, -1);
3084 const_hash_table
[hash
] = desc
;
3086 /* We have a symbol name; construct the SYMBOL_REF and the MEM
3087 in the permanent obstack. We could also construct this in the
3088 obstack of EXP and put it into TREE_CST_RTL, but we have no way
3089 of knowing what obstack it is (e.g., it might be in a function
3090 obstack of a function we are nested inside). */
3092 push_obstacks_nochange ();
3093 end_temporary_allocation ();
3096 = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp
)),
3097 gen_rtx_SYMBOL_REF (Pmode
, desc
->label
));
3099 RTX_UNCHANGING_P (desc
->rtl
) = 1;
3100 if (AGGREGATE_TYPE_P (TREE_TYPE (exp
)))
3101 MEM_SET_IN_STRUCT_P (desc
->rtl
, 1);
3108 TREE_CST_RTL (exp
) = desc
->rtl
;
3110 /* Optionally set flags or add text to the name to record information
3111 such as that it is a function name. If the name is changed, the macro
3112 ASM_OUTPUT_LABELREF will have to know how to strip this information. */
3113 #ifdef ENCODE_SECTION_INFO
3114 ENCODE_SECTION_INFO (exp
);
3117 /* If this is the first time we've seen this particular constant,
3118 output it (or defer its output for later). */
3121 int after_function
= 0;
3123 #ifdef CONSTANT_AFTER_FUNCTION_P
3124 if (current_function_decl
!= 0
3125 && CONSTANT_AFTER_FUNCTION_P (exp
))
3129 if (defer_addressed_constants_flag
|| after_function
)
3131 struct deferred_constant
*p
;
3132 p
= (struct deferred_constant
*) xmalloc (sizeof (struct deferred_constant
));
3134 push_obstacks_nochange ();
3135 suspend_momentary ();
3136 p
->exp
= copy_constant (exp
);
3139 p
->labelno
= const_labelno
++;
3142 p
->next
= after_function_constants
;
3143 after_function_constants
= p
;
3147 p
->next
= deferred_constants
;
3148 deferred_constants
= p
;
3153 /* Do no output if -fsyntax-only. */
3154 if (! flag_syntax_only
)
3155 output_constant_def_contents (exp
, reloc
, const_labelno
);
3160 return TREE_CST_RTL (exp
);
3163 /* Now output assembler code to define the label for EXP,
3164 and follow it with the data of EXP. */
3167 output_constant_def_contents (exp
, reloc
, labelno
)
3174 if (IN_NAMED_SECTION (exp
))
3175 named_section (exp
, NULL
, reloc
);
3178 /* First switch to text section, except for writable strings. */
3179 #ifdef SELECT_SECTION
3180 SELECT_SECTION (exp
, reloc
);
3182 if (((TREE_CODE (exp
) == STRING_CST
) && flag_writable_strings
)
3183 || (flag_pic
&& reloc
))
3186 readonly_data_section ();
3190 /* Align the location counter as required by EXP's data type. */
3191 align
= TYPE_ALIGN (TREE_TYPE (exp
));
3192 #ifdef CONSTANT_ALIGNMENT
3193 align
= CONSTANT_ALIGNMENT (exp
, align
);
3196 if (align
> BITS_PER_UNIT
)
3197 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
3199 /* Output the label itself. */
3200 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LC", labelno
);
3202 /* Output the value of EXP. */
3203 output_constant (exp
,
3204 (TREE_CODE (exp
) == STRING_CST
3205 ? TREE_STRING_LENGTH (exp
)
3206 : int_size_in_bytes (TREE_TYPE (exp
))));
3210 /* Structure to represent sufficient information about a constant so that
3211 it can be output when the constant pool is output, so that function
3212 integration can be done, and to simplify handling on machines that reference
3213 constant pool as base+displacement. */
3215 struct pool_constant
3217 struct constant_descriptor
*desc
;
3218 struct pool_constant
*next
;
3219 enum machine_mode mode
;
3227 /* Structure used to maintain hash table mapping symbols used to their
3228 corresponding constants. */
3233 struct pool_constant
*pool
;
3234 struct pool_sym
*next
;
3237 /* Hash code for a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true.
3238 The argument is XSTR (... , 0) */
3240 #define SYMHASH(LABEL) \
3241 ((((unsigned long) (LABEL)) & ((1 << HASHBITS) - 1)) % MAX_RTX_HASH_TABLE)
3243 /* Initialize constant pool hashing for a new function. */
3246 init_varasm_status (f
)
3249 struct varasm_status
*p
;
3250 p
= (struct varasm_status
*) xmalloc (sizeof (struct varasm_status
));
3252 p
->x_const_rtx_hash_table
3253 = ((struct constant_descriptor
**)
3254 xmalloc (MAX_RTX_HASH_TABLE
* sizeof (struct constant_descriptor
*)));
3255 p
->x_const_rtx_sym_hash_table
3256 = ((struct pool_sym
**)
3257 xmalloc (MAX_RTX_HASH_TABLE
* sizeof (struct pool_sym
*)));
3258 bzero ((char *) p
->x_const_rtx_hash_table
,
3259 MAX_RTX_HASH_TABLE
* sizeof (struct constant_descriptor
*));
3260 bzero ((char *) p
->x_const_rtx_sym_hash_table
,
3261 MAX_RTX_HASH_TABLE
* sizeof (struct pool_sym
*));
3263 p
->x_first_pool
= p
->x_last_pool
= 0;
3264 p
->x_pool_offset
= 0;
3265 p
->x_const_double_chain
= 0;
3268 /* Mark PC for GC. */
3271 mark_pool_constant (pc
)
3272 struct pool_constant
*pc
;
3276 ggc_mark_rtx (pc
->constant
);
3281 /* Mark PPS for GC. */
3284 mark_pool_sym_hash_table (pps
)
3285 struct pool_sym
**pps
;
3287 struct pool_sym
*ps
;
3290 for (i
= 0; i
< MAX_RTX_HASH_TABLE
; ++i
)
3291 for (ps
= pps
[i
]; ps
; ps
= ps
->next
)
3292 ggc_mark_string (ps
->label
);
3295 /* Mark P for GC. */
3298 mark_varasm_status (p
)
3299 struct varasm_status
*p
;
3304 mark_pool_constant (p
->x_first_pool
);
3305 mark_pool_sym_hash_table (p
->x_const_rtx_sym_hash_table
);
3306 ggc_mark_rtx (p
->x_const_double_chain
);
3309 /* Clear out all parts of the state in F that can safely be discarded
3310 after the function has been compiled, to let garbage collection
3311 reclaim the memory. */
3314 free_varasm_status (f
)
3317 struct varasm_status
*p
;
3320 free (p
->x_const_rtx_hash_table
);
3321 free (p
->x_const_rtx_sym_hash_table
);
3326 enum kind
{ RTX_DOUBLE
, RTX_INT
};
3330 #ifdef ONLY_INT_FIELDS
3331 unsigned int kind
: 16;
3332 unsigned int mode
: 16;
3334 enum kind kind
: 16;
3335 enum machine_mode mode
: 16;
3338 union real_extract du
;
3339 struct addr_const addr
;
3340 struct {HOST_WIDE_INT high
, low
;} di
;
3344 /* Express an rtx for a constant integer (perhaps symbolic)
3345 as the sum of a symbol or label plus an explicit integer.
3346 They are stored into VALUE. */
3349 decode_rtx_const (mode
, x
, value
)
3350 enum machine_mode mode
;
3352 struct rtx_const
*value
;
3354 /* Clear the whole structure, including any gaps. */
3357 int *p
= (int *) value
;
3358 int *end
= (int *) (value
+ 1);
3363 value
->kind
= RTX_INT
; /* Most usual kind. */
3366 switch (GET_CODE (x
))
3369 value
->kind
= RTX_DOUBLE
;
3370 if (GET_MODE (x
) != VOIDmode
)
3372 value
->mode
= GET_MODE (x
);
3373 bcopy ((char *) &CONST_DOUBLE_LOW (x
),
3374 (char *) &value
->un
.du
, sizeof value
->un
.du
);
3378 value
->un
.di
.low
= CONST_DOUBLE_LOW (x
);
3379 value
->un
.di
.high
= CONST_DOUBLE_HIGH (x
);
3384 value
->un
.addr
.offset
= INTVAL (x
);
3390 value
->un
.addr
.base
= x
;
3395 if (GET_CODE (x
) == PLUS
)
3397 value
->un
.addr
.base
= XEXP (x
, 0);
3398 if (GET_CODE (XEXP (x
, 1)) != CONST_INT
)
3400 value
->un
.addr
.offset
= INTVAL (XEXP (x
, 1));
3402 else if (GET_CODE (x
) == MINUS
)
3404 value
->un
.addr
.base
= XEXP (x
, 0);
3405 if (GET_CODE (XEXP (x
, 1)) != CONST_INT
)
3407 value
->un
.addr
.offset
= - INTVAL (XEXP (x
, 1));
3417 if (value
->kind
== RTX_INT
&& value
->un
.addr
.base
!= 0)
3418 switch (GET_CODE (value
->un
.addr
.base
))
3421 /* Use the string's address, not the SYMBOL_REF's address,
3422 for the sake of addresses of library routines. */
3423 value
->un
.addr
.base
= (rtx
) XSTR (value
->un
.addr
.base
, 0);
3427 /* For a LABEL_REF, compare labels. */
3428 value
->un
.addr
.base
= XEXP (value
->un
.addr
.base
, 0);
3435 /* Given a MINUS expression, simplify it if both sides
3436 include the same symbol. */
3439 simplify_subtraction (x
)
3442 struct rtx_const val0
, val1
;
3444 decode_rtx_const (GET_MODE (x
), XEXP (x
, 0), &val0
);
3445 decode_rtx_const (GET_MODE (x
), XEXP (x
, 1), &val1
);
3447 if (val0
.un
.addr
.base
== val1
.un
.addr
.base
)
3448 return GEN_INT (val0
.un
.addr
.offset
- val1
.un
.addr
.offset
);
3452 /* Compute a hash code for a constant RTL expression. */
3455 const_hash_rtx (mode
, x
)
3456 enum machine_mode mode
;
3462 struct rtx_const value
;
3463 decode_rtx_const (mode
, x
, &value
);
3465 /* Compute hashing function */
3467 for (i
= 0; i
< sizeof value
/ sizeof (int); i
++)
3468 hi
+= ((int *) &value
)[i
];
3470 hi
&= (1 << HASHBITS
) - 1;
3471 hi
%= MAX_RTX_HASH_TABLE
;
3475 /* Compare a constant rtl object X with a constant-descriptor DESC.
3476 Return 1 if DESC describes a constant with the same value as X. */
3479 compare_constant_rtx (mode
, x
, desc
)
3480 enum machine_mode mode
;
3482 struct constant_descriptor
*desc
;
3484 register int *p
= (int *) desc
->contents
;
3487 struct rtx_const value
;
3489 decode_rtx_const (mode
, x
, &value
);
3490 strp
= (int *) &value
;
3491 len
= sizeof value
/ sizeof (int);
3493 /* Compare constant contents. */
3495 if (*p
++ != *strp
++)
3501 /* Construct a constant descriptor for the rtl-expression X.
3502 It is up to the caller to enter the descriptor in the hash table. */
3504 static struct constant_descriptor
*
3505 record_constant_rtx (mode
, x
)
3506 enum machine_mode mode
;
3509 struct constant_descriptor
*ptr
;
3512 struct rtx_const value
;
3514 decode_rtx_const (mode
, x
, &value
);
3516 /* Put these things in the saveable obstack so we can ensure it won't
3517 be freed if we are called from combine or some other phase that discards
3518 memory allocated from function_obstack (current_obstack). */
3519 obstack_grow (saveable_obstack
, &ptr
, sizeof ptr
);
3520 obstack_grow (saveable_obstack
, &label
, sizeof label
);
3521 obstack_grow (saveable_obstack
, &rtl
, sizeof rtl
);
3523 /* Record constant contents. */
3524 obstack_grow (saveable_obstack
, &value
, sizeof value
);
3526 return (struct constant_descriptor
*) obstack_finish (saveable_obstack
);
3529 /* Given a constant rtx X, make (or find) a memory constant for its value
3530 and return a MEM rtx to refer to it in memory. */
3533 force_const_mem (mode
, x
)
3534 enum machine_mode mode
;
3538 register struct constant_descriptor
*desc
;
3543 /* If we want this CONST_DOUBLE in the same mode as it is in memory
3544 (this will always be true for floating CONST_DOUBLEs that have been
3545 placed in memory, but not for VOIDmode (integer) CONST_DOUBLEs),
3546 use the previous copy. Otherwise, make a new one. Note that in
3547 the unlikely event that this same CONST_DOUBLE is used in two different
3548 modes in an alternating fashion, we will allocate a lot of different
3549 memory locations, but this should be extremely rare. */
3551 if (GET_CODE (x
) == CONST_DOUBLE
3552 && GET_CODE (CONST_DOUBLE_MEM (x
)) == MEM
3553 && GET_MODE (CONST_DOUBLE_MEM (x
)) == mode
)
3554 return CONST_DOUBLE_MEM (x
);
3556 /* Compute hash code of X. Search the descriptors for that hash code
3557 to see if any of them describes X. If yes, the descriptor records
3558 the label number already assigned. */
3560 hash
= const_hash_rtx (mode
, x
);
3562 for (desc
= const_rtx_hash_table
[hash
]; desc
; desc
= desc
->next
)
3563 if (compare_constant_rtx (mode
, x
, desc
))
3565 found
= desc
->label
;
3571 register struct pool_constant
*pool
;
3572 register struct pool_sym
*sym
;
3575 /* No constant equal to X is known to have been output.
3576 Make a constant descriptor to enter X in the hash table.
3577 Assign the label number and record it in the descriptor for
3578 future calls to this function to find. */
3580 desc
= record_constant_rtx (mode
, x
);
3581 desc
->next
= const_rtx_hash_table
[hash
];
3582 const_rtx_hash_table
[hash
] = desc
;
3584 /* Align the location counter as required by EXP's data type. */
3585 align
= (mode
== VOIDmode
) ? UNITS_PER_WORD
: GET_MODE_SIZE (mode
);
3586 if (align
> BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
3587 align
= BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
;
3588 #ifdef CONSTANT_ALIGNMENT
3589 align
= CONSTANT_ALIGNMENT (make_tree (type_for_mode (mode
, 0), x
),
3590 align
* BITS_PER_UNIT
) / BITS_PER_UNIT
;
3593 pool_offset
+= align
- 1;
3594 pool_offset
&= ~ (align
- 1);
3596 /* If RTL is not being placed into the saveable obstack, make a
3597 copy of X that is in the saveable obstack in case we are
3598 being called from combine or some other phase that discards
3599 memory it allocates. We used to only do this if it is a
3600 CONST; however, reload can allocate a CONST_INT when
3601 eliminating registers. */
3602 if (rtl_obstack
!= saveable_obstack
3603 && (GET_CODE (x
) == CONST
|| GET_CODE (x
) == CONST_INT
))
3605 push_obstacks_nochange ();
3606 rtl_in_saveable_obstack ();
3608 if (GET_CODE (x
) == CONST
)
3609 x
= gen_rtx_CONST (GET_MODE (x
),
3610 gen_rtx_PLUS (GET_MODE (x
),
3611 XEXP (XEXP (x
, 0), 0),
3612 XEXP (XEXP (x
, 0), 1)));
3614 x
= GEN_INT (INTVAL (x
));
3619 /* Allocate a pool constant descriptor, fill it in, and chain it in. */
3621 pool
= (struct pool_constant
*) savealloc (sizeof (struct pool_constant
));
3625 pool
->labelno
= const_labelno
;
3626 pool
->align
= align
;
3627 pool
->offset
= pool_offset
;
3634 last_pool
->next
= pool
;
3637 pool_offset
+= GET_MODE_SIZE (mode
);
3639 /* Create a string containing the label name, in LABEL. */
3640 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
3644 desc
->label
= found
= ggc_alloc_string (label
, -1);
3646 /* Add label to symbol hash table. */
3647 hash
= SYMHASH (found
);
3648 sym
= (struct pool_sym
*) savealloc (sizeof (struct pool_sym
));
3651 sym
->next
= const_rtx_sym_hash_table
[hash
];
3652 const_rtx_sym_hash_table
[hash
] = sym
;
3655 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
3657 def
= gen_rtx_MEM (mode
, gen_rtx_SYMBOL_REF (Pmode
, found
));
3659 RTX_UNCHANGING_P (def
) = 1;
3660 /* Mark the symbol_ref as belonging to this constants pool. */
3661 CONSTANT_POOL_ADDRESS_P (XEXP (def
, 0)) = 1;
3662 current_function_uses_const_pool
= 1;
3664 if (GET_CODE (x
) == CONST_DOUBLE
)
3666 if (CONST_DOUBLE_MEM (x
) == cc0_rtx
)
3668 CONST_DOUBLE_CHAIN (x
) = const_double_chain
;
3669 const_double_chain
= x
;
3671 CONST_DOUBLE_MEM (x
) = def
;
3677 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
3678 the corresponding pool_constant structure. */
3680 static struct pool_constant
*
3681 find_pool_constant (f
, addr
)
3685 struct pool_sym
*sym
;
3686 char *label
= XSTR (addr
, 0);
3688 for (sym
= f
->varasm
->x_const_rtx_sym_hash_table
[SYMHASH (label
)]; sym
; sym
= sym
->next
)
3689 if (sym
->label
== label
)
3695 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
3698 get_pool_constant (addr
)
3701 return (find_pool_constant (cfun
, addr
))->constant
;
3704 /* Likewise, but for the constant pool of a specific function. */
3707 get_pool_constant_for_function (f
, addr
)
3711 return (find_pool_constant (f
, addr
))->constant
;
3714 /* Similar, return the mode. */
3717 get_pool_mode (addr
)
3720 return (find_pool_constant (cfun
, addr
))->mode
;
3724 get_pool_mode_for_function (f
, addr
)
3728 return (find_pool_constant (f
, addr
))->mode
;
3731 /* Similar, return the offset in the constant pool. */
3734 get_pool_offset (addr
)
3737 return (find_pool_constant (cfun
, addr
))->offset
;
3740 /* Return the size of the constant pool. */
3748 /* Write all the constants in the constant pool. */
3751 output_constant_pool (fnname
, fndecl
)
3752 const char *fnname ATTRIBUTE_UNUSED
;
3753 tree fndecl ATTRIBUTE_UNUSED
;
3755 struct pool_constant
*pool
;
3757 union real_extract u
;
3759 /* It is possible for gcc to call force_const_mem and then to later
3760 discard the instructions which refer to the constant. In such a
3761 case we do not need to output the constant. */
3762 mark_constant_pool ();
3764 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3765 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3768 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3775 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3776 whose CODE_LABEL has been deleted. This can occur if a jump table
3777 is eliminated by optimization. If so, write a constant of zero
3778 instead. Note that this can also happen by turning the
3779 CODE_LABEL into a NOTE. */
3780 if (((GET_CODE (x
) == LABEL_REF
3781 && (INSN_DELETED_P (XEXP (x
, 0))
3782 || GET_CODE (XEXP (x
, 0)) == NOTE
)))
3783 || (GET_CODE (x
) == CONST
&& GET_CODE (XEXP (x
, 0)) == PLUS
3784 && GET_CODE (XEXP (XEXP (x
, 0), 0)) == LABEL_REF
3785 && (INSN_DELETED_P (XEXP (XEXP (XEXP (x
, 0), 0), 0))
3786 || GET_CODE (XEXP (XEXP (XEXP (x
, 0), 0), 0)) == NOTE
)))
3789 /* First switch to correct section. */
3790 #ifdef SELECT_RTX_SECTION
3791 SELECT_RTX_SECTION (pool
->mode
, x
);
3793 readonly_data_section ();
3796 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3797 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file
, x
, pool
->mode
,
3798 pool
->align
, pool
->labelno
, done
);
3801 if (pool
->align
> 1)
3802 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (pool
->align
));
3804 /* Output the label. */
3805 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LC", pool
->labelno
);
3807 /* Output the value of the constant itself. */
3808 switch (GET_MODE_CLASS (pool
->mode
))
3811 if (GET_CODE (x
) != CONST_DOUBLE
)
3814 bcopy ((char *) &CONST_DOUBLE_LOW (x
), (char *) &u
, sizeof u
);
3815 assemble_real (u
.d
, pool
->mode
);
3819 case MODE_PARTIAL_INT
:
3820 assemble_integer (x
, GET_MODE_SIZE (pool
->mode
), 1);
3827 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3833 #ifdef ASM_OUTPUT_POOL_EPILOGUE
3834 ASM_OUTPUT_POOL_EPILOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3837 /* Done with this pool. */
3838 first_pool
= last_pool
= 0;
3841 /* Look through the instructions for this function, and mark all the
3842 entries in the constant pool which are actually being used. */
3845 mark_constant_pool ()
3848 struct pool_constant
*pool
;
3850 if (first_pool
== 0)
3853 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3856 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
3857 if (GET_RTX_CLASS (GET_CODE (insn
)) == 'i')
3858 mark_constants (PATTERN (insn
));
3860 for (insn
= current_function_epilogue_delay_list
;
3862 insn
= XEXP (insn
, 1))
3863 if (GET_RTX_CLASS (GET_CODE (insn
)) == 'i')
3864 mark_constants (PATTERN (insn
));
3866 /* It's possible that the only reference to a symbol is in a symbol
3867 that's in the constant pool. This happens in Fortran under some
3868 situations. (When the constant contains the address of another
3869 constant, and only the first is used directly in an insn.)
3870 This is potentially suboptimal if there's ever a possibility of
3871 backwards (in pool order) 2'd level references. However, it's
3872 not clear that 2'd level references can happen. */
3873 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3875 struct pool_sym
*sym
;
3878 /* skip unmarked entries; no insn refers to them. */
3882 /* Skip everything except SYMBOL_REFs. */
3883 if (GET_CODE (pool
->constant
) != SYMBOL_REF
)
3885 label
= XSTR (pool
->constant
, 0);
3887 /* Be sure the symbol's value is marked. */
3888 for (sym
= const_rtx_sym_hash_table
[SYMHASH (label
)]; sym
;
3890 if (sym
->label
== label
)
3891 sym
->pool
->mark
= 1;
3892 /* If we didn't find it, there's something truly wrong here, but it
3893 will be announced by the assembler. */
3902 register const char *format_ptr
;
3907 if (GET_CODE (x
) == SYMBOL_REF
)
3909 if (CONSTANT_POOL_ADDRESS_P (x
))
3910 find_pool_constant (cfun
, x
)->mark
= 1;
3913 /* Never search inside a CONST_DOUBLE, because CONST_DOUBLE_MEM may be
3914 a MEM, but does not constitute a use of that MEM. */
3915 else if (GET_CODE (x
) == CONST_DOUBLE
)
3918 /* Insns may appear inside a SEQUENCE. Only check the patterns of
3919 insns, not any notes that may be attached. We don't want to mark
3920 a constant just because it happens to appear in a REG_EQUIV note. */
3921 if (GET_RTX_CLASS (GET_CODE (x
)) == 'i')
3923 mark_constants (PATTERN (x
));
3927 format_ptr
= GET_RTX_FORMAT (GET_CODE (x
));
3929 for (i
= 0; i
< GET_RTX_LENGTH (GET_CODE (x
)); i
++)
3931 switch (*format_ptr
++)
3934 mark_constants (XEXP (x
, i
));
3938 if (XVEC (x
, i
) != 0)
3942 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
3943 mark_constants (XVECEXP (x
, i
, j
));
3962 /* Find all the constants whose addresses are referenced inside of EXP,
3963 and make sure assembler code with a label has been output for each one.
3964 Indicate whether an ADDR_EXPR has been encountered. */
3967 output_addressed_constants (exp
)
3972 switch (TREE_CODE (exp
))
3976 register tree constant
= TREE_OPERAND (exp
, 0);
3978 while (TREE_CODE (constant
) == COMPONENT_REF
)
3980 constant
= TREE_OPERAND (constant
, 0);
3983 if (TREE_CODE_CLASS (TREE_CODE (constant
)) == 'c'
3984 || TREE_CODE (constant
) == CONSTRUCTOR
)
3985 /* No need to do anything here
3986 for addresses of variables or functions. */
3987 output_constant_def (constant
);
3994 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
3995 reloc
|= output_addressed_constants (TREE_OPERAND (exp
, 1));
4000 case NON_LVALUE_EXPR
:
4001 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
4007 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
4008 if (TREE_VALUE (link
) != 0)
4009 reloc
|= output_addressed_constants (TREE_VALUE (link
));
4019 /* Return nonzero if VALUE is a valid constant-valued expression
4020 for use in initializing a static variable; one that can be an
4021 element of a "constant" initializer.
4023 Return null_pointer_node if the value is absolute;
4024 if it is relocatable, return the variable that determines the relocation.
4025 We assume that VALUE has been folded as much as possible;
4026 therefore, we do not need to check for such things as
4027 arithmetic-combinations of integers. */
4030 initializer_constant_valid_p (value
, endtype
)
4034 /* Give the front-end a chance to convert VALUE to something that
4035 looks more like a constant to the back-end. */
4036 if (lang_expand_constant
)
4037 value
= (*lang_expand_constant
) (value
);
4039 switch (TREE_CODE (value
))
4042 if ((TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
4043 || TREE_CODE (TREE_TYPE (value
)) == RECORD_TYPE
)
4044 && TREE_CONSTANT (value
)
4045 && CONSTRUCTOR_ELTS (value
))
4047 initializer_constant_valid_p (TREE_VALUE (CONSTRUCTOR_ELTS (value
)),
4050 return TREE_STATIC (value
) ? null_pointer_node
: 0;
4056 return null_pointer_node
;
4059 return TREE_OPERAND (value
, 0);
4061 case NON_LVALUE_EXPR
:
4062 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
4066 /* Allow conversions between pointer types. */
4067 if (POINTER_TYPE_P (TREE_TYPE (value
))
4068 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
4069 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
4071 /* Allow conversions between real types. */
4072 if (FLOAT_TYPE_P (TREE_TYPE (value
))
4073 && FLOAT_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
4074 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
4076 /* Allow length-preserving conversions between integer types. */
4077 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
4078 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
4079 && (TYPE_PRECISION (TREE_TYPE (value
))
4080 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
4081 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
4083 /* Allow conversions between other integer types only if
4085 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
4086 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
4088 tree inner
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4090 if (inner
== null_pointer_node
)
4091 return null_pointer_node
;
4095 /* Allow (int) &foo provided int is as wide as a pointer. */
4096 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
4097 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
4098 && (TYPE_PRECISION (TREE_TYPE (value
))
4099 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
4100 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4103 /* Likewise conversions from int to pointers, but also allow
4104 conversions from 0. */
4105 if (POINTER_TYPE_P (TREE_TYPE (value
))
4106 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
4108 if (integer_zerop (TREE_OPERAND (value
, 0)))
4109 return null_pointer_node
;
4110 else if (TYPE_PRECISION (TREE_TYPE (value
))
4111 <= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0))))
4112 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4116 /* Allow conversions to union types if the value inside is okay. */
4117 if (TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
)
4118 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4123 if (! INTEGRAL_TYPE_P (endtype
)
4124 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
4126 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4128 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
4130 /* If either term is absolute, use the other terms relocation. */
4131 if (valid0
== null_pointer_node
)
4133 if (valid1
== null_pointer_node
)
4139 if (! INTEGRAL_TYPE_P (endtype
)
4140 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
4142 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4144 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
4146 /* Win if second argument is absolute. */
4147 if (valid1
== null_pointer_node
)
4149 /* Win if both arguments have the same relocation.
4150 Then the value is absolute. */
4151 if (valid0
== valid1
&& valid0
!= 0)
4152 return null_pointer_node
;
4155 /* Support differences between labels. */
4156 if (INTEGRAL_TYPE_P (endtype
))
4159 op0
= TREE_OPERAND (value
, 0);
4160 op1
= TREE_OPERAND (value
, 1);
4164 if (TREE_CODE (op0
) == ADDR_EXPR
4165 && TREE_CODE (TREE_OPERAND (op0
, 0)) == LABEL_DECL
4166 && TREE_CODE (op1
) == ADDR_EXPR
4167 && TREE_CODE (TREE_OPERAND (op1
, 0)) == LABEL_DECL
)
4168 return null_pointer_node
;
4179 /* Output assembler code for constant EXP to FILE, with no label.
4180 This includes the pseudo-op such as ".int" or ".byte", and a newline.
4181 Assumes output_addressed_constants has been done on EXP already.
4183 Generate exactly SIZE bytes of assembler data, padding at the end
4184 with zeros if necessary. SIZE must always be specified.
4186 SIZE is important for structure constructors,
4187 since trailing members may have been omitted from the constructor.
4188 It is also important for initialization of arrays from string constants
4189 since the full length of the string constant might not be wanted.
4190 It is also needed for initialization of unions, where the initializer's
4191 type is just one member, and that may not be as long as the union.
4193 There a case in which we would fail to output exactly SIZE bytes:
4194 for a structure constructor that wants to produce more than SIZE bytes.
4195 But such constructors will never be generated for any possible input. */
4198 output_constant (exp
, size
)
4202 register enum tree_code code
= TREE_CODE (TREE_TYPE (exp
));
4204 /* Some front-ends use constants other than the standard
4205 language-indepdent varieties, but which may still be output
4206 directly. Give the front-end a chance to convert EXP to a
4207 language-independent representation. */
4208 if (lang_expand_constant
)
4209 exp
= (*lang_expand_constant
) (exp
);
4211 if (size
== 0 || flag_syntax_only
)
4214 /* Eliminate the NON_LVALUE_EXPR_EXPR that makes a cast not be an lvalue.
4215 That way we get the constant (we hope) inside it. Also, strip off any
4216 NOP_EXPR that converts between two record, union, array, or set types
4217 or a CONVERT_EXPR that converts to a union TYPE. */
4218 while ((TREE_CODE (exp
) == NOP_EXPR
4219 && (TREE_TYPE (exp
) == TREE_TYPE (TREE_OPERAND (exp
, 0))
4220 || AGGREGATE_TYPE_P (TREE_TYPE (exp
))))
4221 || (TREE_CODE (exp
) == CONVERT_EXPR
4222 && code
== UNION_TYPE
)
4223 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
4225 exp
= TREE_OPERAND (exp
, 0);
4226 code
= TREE_CODE (TREE_TYPE (exp
));
4229 /* Allow a constructor with no elements for any data type.
4230 This means to fill the space with zeros. */
4231 if (TREE_CODE (exp
) == CONSTRUCTOR
&& CONSTRUCTOR_ELTS (exp
) == 0)
4233 assemble_zeros (size
);
4244 case REFERENCE_TYPE
:
4245 /* ??? What about (int)((float)(int)&foo + 4) */
4246 while (TREE_CODE (exp
) == NOP_EXPR
|| TREE_CODE (exp
) == CONVERT_EXPR
4247 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
4248 exp
= TREE_OPERAND (exp
, 0);
4250 if (! assemble_integer (expand_expr (exp
, NULL_RTX
, VOIDmode
,
4251 EXPAND_INITIALIZER
),
4253 error ("initializer for integer value is too complicated");
4258 if (TREE_CODE (exp
) != REAL_CST
)
4259 error ("initializer for floating value is not a floating constant");
4261 assemble_real (TREE_REAL_CST (exp
),
4262 mode_for_size (size
* BITS_PER_UNIT
, MODE_FLOAT
, 0));
4267 output_constant (TREE_REALPART (exp
), size
/ 2);
4268 output_constant (TREE_IMAGPART (exp
), size
/ 2);
4269 size
-= (size
/ 2) * 2;
4273 if (TREE_CODE (exp
) == CONSTRUCTOR
)
4275 output_constructor (exp
, size
);
4278 else if (TREE_CODE (exp
) == STRING_CST
)
4282 if (size
> TREE_STRING_LENGTH (exp
))
4284 excess
= size
- TREE_STRING_LENGTH (exp
);
4285 size
= TREE_STRING_LENGTH (exp
);
4288 assemble_string (TREE_STRING_POINTER (exp
), size
);
4297 if (TREE_CODE (exp
) == CONSTRUCTOR
)
4298 output_constructor (exp
, size
);
4304 if (TREE_CODE (exp
) == INTEGER_CST
)
4305 assemble_integer (expand_expr (exp
, NULL_RTX
,
4306 VOIDmode
, EXPAND_INITIALIZER
),
4308 else if (TREE_CODE (exp
) == CONSTRUCTOR
)
4310 unsigned char *buffer
= (unsigned char *) alloca (size
);
4311 if (get_set_constructor_bytes (exp
, buffer
, size
))
4313 assemble_string ((char *) buffer
, size
);
4316 error ("unknown set constructor type");
4324 assemble_zeros (size
);
4328 /* Subroutine of output_constant, used for CONSTRUCTORs
4329 (aggregate constants).
4330 Generate at least SIZE bytes, padding if necessary. */
4333 output_constructor (exp
, size
)
4337 register tree link
, field
= 0;
4338 HOST_WIDE_INT min_index
= 0;
4339 /* Number of bytes output or skipped so far.
4340 In other words, current position within the constructor. */
4341 int total_bytes
= 0;
4342 /* Non-zero means BYTE contains part of a byte, to be output. */
4343 int byte_buffer_in_use
= 0;
4344 register int byte
= 0;
4346 if (HOST_BITS_PER_WIDE_INT
< BITS_PER_UNIT
)
4349 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
4350 field
= TYPE_FIELDS (TREE_TYPE (exp
));
4352 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
4353 && TYPE_DOMAIN (TREE_TYPE (exp
)) != 0)
4355 = TREE_INT_CST_LOW (TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (exp
))));
4357 /* As LINK goes through the elements of the constant,
4358 FIELD goes through the structure fields, if the constant is a structure.
4359 if the constant is a union, then we override this,
4360 by getting the field from the TREE_LIST element.
4361 But the constant could also be an array. Then FIELD is zero.
4363 There is always a maximum of one element in the chain LINK for unions
4364 (even if the initializer in a source program incorrectly contains
4366 for (link
= CONSTRUCTOR_ELTS (exp
);
4368 link
= TREE_CHAIN (link
),
4369 field
= field
? TREE_CHAIN (field
) : 0)
4371 tree val
= TREE_VALUE (link
);
4374 /* the element in a union constructor specifies the proper field. */
4376 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
4377 || TREE_CODE (TREE_TYPE (exp
)) == UNION_TYPE
)
4379 /* if available, use the type given by link */
4380 if (TREE_PURPOSE (link
) != 0)
4381 field
= TREE_PURPOSE (link
);
4384 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
4385 index
= TREE_PURPOSE (link
);
4387 /* Eliminate the marker that makes a cast not be an lvalue. */
4391 if (index
&& TREE_CODE (index
) == RANGE_EXPR
)
4393 register int fieldsize
4394 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (exp
)));
4395 HOST_WIDE_INT lo_index
= TREE_INT_CST_LOW (TREE_OPERAND (index
, 0));
4396 HOST_WIDE_INT hi_index
= TREE_INT_CST_LOW (TREE_OPERAND (index
, 1));
4397 HOST_WIDE_INT index
;
4398 for (index
= lo_index
; index
<= hi_index
; index
++)
4400 /* Output the element's initial value. */
4402 assemble_zeros (fieldsize
);
4404 output_constant (val
, fieldsize
);
4406 /* Count its size. */
4407 total_bytes
+= fieldsize
;
4410 else if (field
== 0 || !DECL_BIT_FIELD (field
))
4412 /* An element that is not a bit-field. */
4414 register int fieldsize
;
4415 /* Since this structure is static,
4416 we know the positions are constant. */
4417 int bitpos
= (field
? (TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field
))
4421 bitpos
= (TREE_INT_CST_LOW (TYPE_SIZE (TREE_TYPE (val
)))
4423 * (TREE_INT_CST_LOW (index
) - min_index
));
4425 /* Output any buffered-up bit-fields preceding this element. */
4426 if (byte_buffer_in_use
)
4428 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4430 byte_buffer_in_use
= 0;
4433 /* Advance to offset of this element.
4434 Note no alignment needed in an array, since that is guaranteed
4435 if each element has the proper size. */
4436 if ((field
!= 0 || index
!= 0) && bitpos
!= total_bytes
)
4438 assemble_zeros (bitpos
- total_bytes
);
4439 total_bytes
= bitpos
;
4442 /* Determine size this element should occupy. */
4445 if (TREE_CODE (DECL_SIZE_UNIT (field
)) != INTEGER_CST
)
4448 fieldsize
= TREE_INT_CST_LOW (DECL_SIZE_UNIT (field
));
4451 fieldsize
= int_size_in_bytes (TREE_TYPE (TREE_TYPE (exp
)));
4453 /* Output the element's initial value. */
4455 assemble_zeros (fieldsize
);
4457 output_constant (val
, fieldsize
);
4459 /* Count its size. */
4460 total_bytes
+= fieldsize
;
4462 else if (val
!= 0 && TREE_CODE (val
) != INTEGER_CST
)
4463 error ("invalid initial value for member `%s'",
4464 IDENTIFIER_POINTER (DECL_NAME (field
)));
4467 /* Element that is a bit-field. */
4469 int next_offset
= TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field
));
4471 = (next_offset
+ TREE_INT_CST_LOW (DECL_SIZE (field
)));
4474 val
= integer_zero_node
;
4476 /* If this field does not start in this (or, next) byte,
4478 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4480 /* Output remnant of any bit field in previous bytes. */
4481 if (byte_buffer_in_use
)
4483 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4485 byte_buffer_in_use
= 0;
4488 /* If still not at proper byte, advance to there. */
4489 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4491 assemble_zeros (next_offset
/ BITS_PER_UNIT
- total_bytes
);
4492 total_bytes
= next_offset
/ BITS_PER_UNIT
;
4496 if (! byte_buffer_in_use
)
4499 /* We must split the element into pieces that fall within
4500 separate bytes, and combine each byte with previous or
4501 following bit-fields. */
4503 /* next_offset is the offset n fbits from the beginning of
4504 the structure to the next bit of this element to be processed.
4505 end_offset is the offset of the first bit past the end of
4507 while (next_offset
< end_offset
)
4511 HOST_WIDE_INT value
;
4512 int next_byte
= next_offset
/ BITS_PER_UNIT
;
4513 int next_bit
= next_offset
% BITS_PER_UNIT
;
4515 /* Advance from byte to byte
4516 within this element when necessary. */
4517 while (next_byte
!= total_bytes
)
4519 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4524 /* Number of bits we can process at once
4525 (all part of the same byte). */
4526 this_time
= MIN (end_offset
- next_offset
,
4527 BITS_PER_UNIT
- next_bit
);
4528 if (BYTES_BIG_ENDIAN
)
4530 /* On big-endian machine, take the most significant bits
4531 first (of the bits that are significant)
4532 and put them into bytes from the most significant end. */
4533 shift
= end_offset
- next_offset
- this_time
;
4534 /* Don't try to take a bunch of bits that cross
4535 the word boundary in the INTEGER_CST. We can
4536 only select bits from the LOW or HIGH part
4538 if (shift
< HOST_BITS_PER_WIDE_INT
4539 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4541 this_time
= shift
+ this_time
- HOST_BITS_PER_WIDE_INT
;
4542 shift
= HOST_BITS_PER_WIDE_INT
;
4545 /* Now get the bits from the appropriate constant word. */
4546 if (shift
< HOST_BITS_PER_WIDE_INT
)
4548 value
= TREE_INT_CST_LOW (val
);
4550 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4552 value
= TREE_INT_CST_HIGH (val
);
4553 shift
-= HOST_BITS_PER_WIDE_INT
;
4557 /* Get the result. This works only when:
4558 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4559 byte
|= (((value
>> shift
)
4560 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4561 << (BITS_PER_UNIT
- this_time
- next_bit
));
4565 /* On little-endian machines,
4566 take first the least significant bits of the value
4567 and pack them starting at the least significant
4568 bits of the bytes. */
4569 shift
= (next_offset
4570 - TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field
)));
4571 /* Don't try to take a bunch of bits that cross
4572 the word boundary in the INTEGER_CST. We can
4573 only select bits from the LOW or HIGH part
4575 if (shift
< HOST_BITS_PER_WIDE_INT
4576 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4578 this_time
= (HOST_BITS_PER_WIDE_INT
- shift
);
4581 /* Now get the bits from the appropriate constant word. */
4582 if (shift
< HOST_BITS_PER_WIDE_INT
)
4583 value
= TREE_INT_CST_LOW (val
);
4584 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4586 value
= TREE_INT_CST_HIGH (val
);
4587 shift
-= HOST_BITS_PER_WIDE_INT
;
4591 /* Get the result. This works only when:
4592 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4593 byte
|= (((value
>> shift
)
4594 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4597 next_offset
+= this_time
;
4598 byte_buffer_in_use
= 1;
4602 if (byte_buffer_in_use
)
4604 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4607 if (total_bytes
< size
)
4608 assemble_zeros (size
- total_bytes
);
4611 #ifdef HANDLE_PRAGMA_WEAK
4612 /* Add function NAME to the weak symbols list. VALUE is a weak alias
4613 associatd with NAME. */
4616 add_weak (name
, value
)
4620 struct weak_syms
*weak
;
4622 weak
= (struct weak_syms
*) permalloc (sizeof (struct weak_syms
));
4627 weak
->next
= weak_decls
;
4629 weak
->value
= value
;
4634 #endif /* HANDLE_PRAGMA_WEAK */
4636 /* Declare DECL to be a weak symbol. */
4642 if (! TREE_PUBLIC (decl
))
4643 error_with_decl (decl
, "weak declaration of `%s' must be public");
4644 else if (TREE_ASM_WRITTEN (decl
))
4645 error_with_decl (decl
, "weak declaration of `%s' must precede definition");
4646 else if (SUPPORTS_WEAK
)
4647 DECL_WEAK (decl
) = 1;
4648 #ifdef HANDLE_PRAGMA_WEAK
4649 add_weak (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)), NULL
);
4653 /* Emit any pending weak declarations. */
4655 #ifdef HANDLE_PRAGMA_WEAK
4656 struct weak_syms
* weak_decls
;
4662 #ifdef HANDLE_PRAGMA_WEAK
4663 if (HANDLE_PRAGMA_WEAK
)
4665 struct weak_syms
*t
;
4666 for (t
= weak_decls
; t
; t
= t
->next
)
4670 ASM_WEAKEN_LABEL (asm_out_file
, t
->name
);
4672 ASM_OUTPUT_DEF (asm_out_file
, t
->name
, t
->value
);
4679 /* Remove NAME from the pending list of weak symbols. This prevents
4680 the compiler from emitting multiple .weak directives which confuses
4682 #ifdef ASM_WEAKEN_LABEL
4684 remove_from_pending_weak_list (name
)
4685 char *name ATTRIBUTE_UNUSED
;
4687 #ifdef HANDLE_PRAGMA_WEAK
4688 if (HANDLE_PRAGMA_WEAK
)
4690 struct weak_syms
*t
;
4691 for (t
= weak_decls
; t
; t
= t
->next
)
4693 if (t
->name
&& strcmp (name
, t
->name
) == 0)
4702 assemble_alias (decl
, target
)
4703 tree decl
, target ATTRIBUTE_UNUSED
;
4707 make_decl_rtl (decl
, (char *) 0, 1);
4708 name
= XSTR (XEXP (DECL_RTL (decl
), 0), 0);
4710 #ifdef ASM_OUTPUT_DEF
4711 /* Make name accessible from other files, if appropriate. */
4713 if (TREE_PUBLIC (decl
))
4715 #ifdef ASM_WEAKEN_LABEL
4716 if (DECL_WEAK (decl
))
4718 ASM_WEAKEN_LABEL (asm_out_file
, name
);
4719 /* Remove this function from the pending weak list so that
4720 we do not emit multiple .weak directives for it. */
4721 remove_from_pending_weak_list
4722 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
4726 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
4729 #ifdef ASM_OUTPUT_DEF_FROM_DECLS
4730 ASM_OUTPUT_DEF_FROM_DECLS (asm_out_file
, decl
, target
);
4732 ASM_OUTPUT_DEF (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4734 TREE_ASM_WRITTEN (decl
) = 1;
4736 #ifdef ASM_OUTPUT_WEAK_ALIAS
4737 if (! DECL_WEAK (decl
))
4738 warning ("only weak aliases are supported in this configuration");
4740 ASM_OUTPUT_WEAK_ALIAS (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4741 TREE_ASM_WRITTEN (decl
) = 1;
4743 warning ("alias definitions not supported in this configuration; ignored");
4748 /* This determines whether or not we support link-once semantics. */
4749 #ifndef SUPPORTS_ONE_ONLY
4750 #ifdef MAKE_DECL_ONE_ONLY
4751 #define SUPPORTS_ONE_ONLY 1
4753 #define SUPPORTS_ONE_ONLY 0
4757 /* Returns 1 if the target configuration supports defining public symbols
4758 so that one of them will be chosen at link time instead of generating a
4759 multiply-defined symbol error, whether through the use of weak symbols or
4760 a target-specific mechanism for having duplicates discarded. */
4763 supports_one_only ()
4765 if (SUPPORTS_ONE_ONLY
)
4767 return SUPPORTS_WEAK
;
4770 /* Set up DECL as a public symbol that can be defined in multiple
4771 translation units without generating a linker error. */
4774 make_decl_one_only (decl
)
4777 if (TREE_CODE (decl
) != VAR_DECL
&& TREE_CODE (decl
) != FUNCTION_DECL
)
4780 TREE_PUBLIC (decl
) = 1;
4782 if (TREE_CODE (decl
) == VAR_DECL
4783 && (DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
))
4784 DECL_COMMON (decl
) = 1;
4785 else if (SUPPORTS_ONE_ONLY
)
4787 #ifdef MAKE_DECL_ONE_ONLY
4788 MAKE_DECL_ONE_ONLY (decl
);
4790 DECL_ONE_ONLY (decl
) = 1;
4792 else if (SUPPORTS_WEAK
)
4793 DECL_WEAK (decl
) = 1;
4801 ggc_add_root (const_hash_table
, MAX_HASH_TABLE
, sizeof const_hash_table
[0],
4802 mark_const_hash_entry
);
4803 ggc_add_string_root (&in_named_name
, 1);