1 /* Output variables, constants and external declarations, for GNU compiler.
2 Copyright (C) 1987, 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997,
3 1998, 1999, 2000 Free Software Foundation, Inc.
5 This file is part of GNU CC.
7 GNU CC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GNU CC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU CC; see the file COPYING. If not, write to
19 the Free Software Foundation, 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
23 /* This file handles generation of all the assembler code
24 *except* the instructions of a function.
25 This includes declarations of variables and their initial values.
27 We also output the assembler code for constants stored in memory
28 and are responsible for combining constants with the same value. */
39 #include "hard-reg-set.h"
51 #ifdef XCOFF_DEBUGGING_INFO
55 #ifndef TRAMPOLINE_ALIGNMENT
56 #define TRAMPOLINE_ALIGNMENT FUNCTION_BOUNDARY
60 #define ASM_STABS_OP ".stabs"
63 /* Define the prefix to use when check_memory_usage_flag is enable. */
64 #ifdef NO_DOLLAR_IN_LABEL
65 #ifdef NO_DOT_IN_LABEL
66 #define CHKR_PREFIX "chkr_prefix_"
67 #else /* !NO_DOT_IN_LABEL */
68 #define CHKR_PREFIX "chkr."
70 #else /* !NO_DOLLAR_IN_LABEL */
71 #define CHKR_PREFIX "chkr$"
73 #define CHKR_PREFIX_SIZE (sizeof (CHKR_PREFIX) - 1)
75 /* File in which assembler code is being written. */
77 extern FILE *asm_out_file
;
79 /* The (assembler) name of the first globally-visible object output. */
80 char *first_global_object_name
;
81 char *weak_global_object_name
;
83 extern struct obstack
*current_obstack
;
84 extern struct obstack
*saveable_obstack
;
85 extern struct obstack
*rtl_obstack
;
86 extern struct obstack permanent_obstack
;
87 #define obstack_chunk_alloc xmalloc
90 struct constant_descriptor
;
94 #define MAX_RTX_HASH_TABLE 61
98 /* Hash facility for making memory-constants
99 from constant rtl-expressions. It is used on RISC machines
100 where immediate integer arguments and constant addresses are restricted
101 so that such constants must be stored in memory.
103 This pool of constants is reinitialized for each function
104 so each function gets its own constants-pool that comes right before
106 struct constant_descriptor
**x_const_rtx_hash_table
;
107 struct pool_sym
**x_const_rtx_sym_hash_table
;
109 /* Pointers to first and last constant in pool. */
110 struct pool_constant
*x_first_pool
, *x_last_pool
;
112 /* Current offset in constant pool (does not include any machine-specific
116 /* Chain of all CONST_DOUBLE rtx's constructed for the current function.
117 They are chained through the CONST_DOUBLE_CHAIN.
118 A CONST_DOUBLE rtx has CONST_DOUBLE_MEM != cc0_rtx iff it is on this chain.
119 In that case, CONST_DOUBLE_MEM is either a MEM,
120 or const0_rtx if no MEM has been made for this CONST_DOUBLE yet. */
121 rtx x_const_double_chain
;
124 #define const_rtx_hash_table (cfun->varasm->x_const_rtx_hash_table)
125 #define const_rtx_sym_hash_table (cfun->varasm->x_const_rtx_sym_hash_table)
126 #define first_pool (cfun->varasm->x_first_pool)
127 #define last_pool (cfun->varasm->x_last_pool)
128 #define pool_offset (cfun->varasm->x_pool_offset)
129 #define const_double_chain (cfun->varasm->x_const_double_chain)
131 /* Number for making the label on the next
132 constant that is stored in memory. */
136 /* Number for making the label on the next
137 static variable internal to a function. */
141 /* Carry information from ASM_DECLARE_OBJECT_NAME
142 to ASM_FINISH_DECLARE_OBJECT. */
144 int size_directive_output
;
146 /* The last decl for which assemble_variable was called,
147 if it did ASM_DECLARE_OBJECT_NAME.
148 If the last call to assemble_variable didn't do that,
151 tree last_assemble_variable_decl
;
153 static const char *strip_reg_name
PARAMS ((const char *));
154 static int contains_pointers_p
PARAMS ((tree
));
155 static void decode_addr_const
PARAMS ((tree
, struct addr_const
*));
156 static int const_hash
PARAMS ((tree
));
157 static int compare_constant
PARAMS ((tree
,
158 struct constant_descriptor
*));
159 static char *compare_constant_1
PARAMS ((tree
, char *));
160 static struct constant_descriptor
*record_constant
PARAMS ((tree
));
161 static void record_constant_1
PARAMS ((tree
));
162 static tree copy_constant
PARAMS ((tree
));
163 static void output_constant_def_contents
PARAMS ((tree
, int, int));
164 static void decode_rtx_const
PARAMS ((enum machine_mode
, rtx
,
165 struct rtx_const
*));
166 static int const_hash_rtx
PARAMS ((enum machine_mode
, rtx
));
167 static int compare_constant_rtx
PARAMS ((enum machine_mode
, rtx
,
168 struct constant_descriptor
*));
169 static struct constant_descriptor
*record_constant_rtx
PARAMS ((enum machine_mode
,
171 static struct pool_constant
*find_pool_constant
PARAMS ((struct function
*, rtx
));
172 static void mark_constant_pool
PARAMS ((void));
173 static void mark_constants
PARAMS ((rtx
));
174 static int output_addressed_constants
PARAMS ((tree
));
175 static void output_after_function_constants
PARAMS ((void));
176 static void output_constructor
PARAMS ((tree
, int));
177 #ifdef ASM_WEAKEN_LABEL
178 static void remove_from_pending_weak_list
PARAMS ((char *));
180 #ifdef ASM_OUTPUT_BSS
181 static void asm_output_bss
PARAMS ((FILE *, tree
, const char *, int, int));
183 #ifdef BSS_SECTION_ASM_OP
184 #ifdef ASM_OUTPUT_ALIGNED_BSS
185 static void asm_output_aligned_bss
PARAMS ((FILE *, tree
, const char *,
188 #endif /* BSS_SECTION_ASM_OP */
189 static void mark_pool_constant
PARAMS ((struct pool_constant
*));
190 static void mark_pool_sym_hash_table
PARAMS ((struct pool_sym
**));
191 static void mark_const_hash_entry
PARAMS ((void *));
192 static void asm_emit_uninitialised
PARAMS ((tree
, const char*, int, int));
194 static enum in_section
{ no_section
, in_text
, in_data
, in_named
195 #ifdef BSS_SECTION_ASM_OP
198 #ifdef EH_FRAME_SECTION_ASM_OP
201 #ifdef EXTRA_SECTIONS
204 } in_section
= no_section
;
206 /* Return a non-zero value if DECL has a section attribute. */
207 #ifndef IN_NAMED_SECTION
208 #define IN_NAMED_SECTION(DECL) \
209 ((TREE_CODE (DECL) == FUNCTION_DECL || TREE_CODE (DECL) == VAR_DECL) \
210 && DECL_SECTION_NAME (DECL) != NULL_TREE)
213 /* Text of section name when in_section == in_named. */
214 static char *in_named_name
;
216 /* Define functions like text_section for any extra sections. */
217 #ifdef EXTRA_SECTION_FUNCTIONS
218 EXTRA_SECTION_FUNCTIONS
221 /* Tell assembler to switch to text section. */
226 if (in_section
!= in_text
)
228 fprintf (asm_out_file
, "%s\n", TEXT_SECTION_ASM_OP
);
229 in_section
= in_text
;
233 /* Tell assembler to switch to data section. */
238 if (in_section
!= in_data
)
240 if (flag_shared_data
)
242 #ifdef SHARED_SECTION_ASM_OP
243 fprintf (asm_out_file
, "%s\n", SHARED_SECTION_ASM_OP
);
245 fprintf (asm_out_file
, "%s\n", DATA_SECTION_ASM_OP
);
249 fprintf (asm_out_file
, "%s\n", DATA_SECTION_ASM_OP
);
251 in_section
= in_data
;
254 /* Tell assembler to ALWAYS switch to data section, in case
255 it's not sure where it it. */
258 force_data_section ()
260 in_section
= no_section
;
264 /* Tell assembler to switch to read-only data section. This is normally
268 readonly_data_section ()
270 #ifdef READONLY_DATA_SECTION
271 READONLY_DATA_SECTION (); /* Note this can call data_section. */
277 /* Determine if we're in the text section. */
282 return in_section
== in_text
;
285 /* Determine if we're in the data section. */
290 return in_section
== in_data
;
293 /* Tell assembler to change to section NAME for DECL.
294 If DECL is NULL, just switch to section NAME.
295 If NAME is NULL, get the name from DECL.
296 If RELOC is 1, the initializer for DECL contains relocs. */
299 named_section (decl
, name
, reloc
)
302 int reloc ATTRIBUTE_UNUSED
;
304 if (decl
!= NULL_TREE
305 && TREE_CODE_CLASS (TREE_CODE (decl
)) != 'd')
308 name
= TREE_STRING_POINTER (DECL_SECTION_NAME (decl
));
310 if (in_section
!= in_named
|| strcmp (name
, in_named_name
))
312 #ifdef ASM_OUTPUT_SECTION_NAME
313 ASM_OUTPUT_SECTION_NAME (asm_out_file
, decl
, name
, reloc
);
315 /* Section attributes are not supported if this macro isn't provided -
316 some host formats don't support them at all. The front-end should
317 already have flagged this as an error. */
321 in_named_name
= ggc_alloc_string (name
, -1);
322 in_section
= in_named
;
326 #ifdef ASM_OUTPUT_SECTION_NAME
327 #ifndef UNIQUE_SECTION
328 #define UNIQUE_SECTION(DECL,RELOC) \
334 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (DECL)); \
335 /* Strip off any encoding in name. */ \
336 STRIP_NAME_ENCODING (name, name); \
338 len = strlen (name) + 1; \
339 string = alloca (len + 1); \
340 sprintf (string, ".%s", name); \
342 DECL_SECTION_NAME (DECL) = build_string (len, string); \
345 #ifndef UNIQUE_SECTION_P
346 #define UNIQUE_SECTION_P(DECL) 0
350 #ifdef BSS_SECTION_ASM_OP
352 /* Tell the assembler to switch to the bss section. */
357 if (in_section
!= in_bss
)
359 #ifdef SHARED_BSS_SECTION_ASM_OP
360 if (flag_shared_data
)
361 fprintf (asm_out_file
, "%s\n", SHARED_BSS_SECTION_ASM_OP
);
364 fprintf (asm_out_file
, "%s\n", BSS_SECTION_ASM_OP
);
370 #ifdef ASM_OUTPUT_BSS
372 /* Utility function for ASM_OUTPUT_BSS for targets to use if
373 they don't support alignments in .bss.
374 ??? It is believed that this function will work in most cases so such
375 support is localized here. */
378 asm_output_bss (file
, decl
, name
, size
, rounded
)
380 tree decl ATTRIBUTE_UNUSED
;
382 int size ATTRIBUTE_UNUSED
, rounded
;
384 ASM_GLOBALIZE_LABEL (file
, name
);
386 #ifdef ASM_DECLARE_OBJECT_NAME
387 last_assemble_variable_decl
= decl
;
388 ASM_DECLARE_OBJECT_NAME (file
, name
, decl
);
390 /* Standard thing is just output label for the object. */
391 ASM_OUTPUT_LABEL (file
, name
);
392 #endif /* ASM_DECLARE_OBJECT_NAME */
393 ASM_OUTPUT_SKIP (file
, rounded
);
398 #ifdef ASM_OUTPUT_ALIGNED_BSS
400 /* Utility function for targets to use in implementing
401 ASM_OUTPUT_ALIGNED_BSS.
402 ??? It is believed that this function will work in most cases so such
403 support is localized here. */
406 asm_output_aligned_bss (file
, decl
, name
, size
, align
)
412 ASM_GLOBALIZE_LABEL (file
, name
);
414 ASM_OUTPUT_ALIGN (file
, floor_log2 (align
/ BITS_PER_UNIT
));
415 #ifdef ASM_DECLARE_OBJECT_NAME
416 last_assemble_variable_decl
= decl
;
417 ASM_DECLARE_OBJECT_NAME (file
, name
, decl
);
419 /* Standard thing is just output label for the object. */
420 ASM_OUTPUT_LABEL (file
, name
);
421 #endif /* ASM_DECLARE_OBJECT_NAME */
422 ASM_OUTPUT_SKIP (file
, size
? size
: 1);
427 #endif /* BSS_SECTION_ASM_OP */
429 #ifdef EH_FRAME_SECTION_ASM_OP
433 if (in_section
!= in_eh_frame
)
435 fprintf (asm_out_file
, "%s\n", EH_FRAME_SECTION_ASM_OP
);
436 in_section
= in_eh_frame
;
441 /* Switch to the section for function DECL.
443 If DECL is NULL_TREE, switch to the text section.
444 ??? It's not clear that we will ever be passed NULL_TREE, but it's
445 safer to handle it. */
448 function_section (decl
)
451 if (decl
!= NULL_TREE
452 && DECL_SECTION_NAME (decl
) != NULL_TREE
)
453 named_section (decl
, (char *) 0, 0);
458 /* Switch to section for variable DECL.
460 RELOC is the `reloc' argument to SELECT_SECTION. */
463 variable_section (decl
, reloc
)
467 if (IN_NAMED_SECTION (decl
))
468 named_section (decl
, NULL
, reloc
);
471 /* C++ can have const variables that get initialized from constructors,
472 and thus can not be in a readonly section. We prevent this by
473 verifying that the initial value is constant for objects put in a
476 error_mark_node is used by the C front end to indicate that the
477 initializer has not been seen yet. In this case, we assume that
478 the initializer must be constant.
480 C++ uses error_mark_node for variables that have complicated
481 initializers, but these variables go in BSS so we won't be called
484 #ifdef SELECT_SECTION
485 SELECT_SECTION (decl
, reloc
);
487 if (DECL_READONLY_SECTION (decl
, reloc
))
488 readonly_data_section ();
495 /* Tell assembler to switch to the section for the exception handling
501 #if defined (EXCEPTION_SECTION)
502 EXCEPTION_SECTION ();
504 #ifdef ASM_OUTPUT_SECTION_NAME
505 named_section (NULL_TREE
, ".gcc_except_table", 0);
510 readonly_data_section ();
515 /* Create the rtl to represent a function, for a function definition.
516 DECL is a FUNCTION_DECL node which describes which function.
517 The rtl is stored into DECL. */
520 make_function_rtl (decl
)
523 char *name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
524 char *new_name
= name
;
526 /* Rename a nested function to avoid conflicts, unless it's a member of
527 a local class, in which case the class name is already unique. */
528 if (decl_function_context (decl
) != 0
529 && ! TYPE_P (DECL_CONTEXT (decl
))
530 && DECL_INITIAL (decl
) != 0
531 && DECL_RTL (decl
) == 0)
535 name
= IDENTIFIER_POINTER (DECL_NAME (decl
));
536 ASM_FORMAT_PRIVATE_NAME (label
, name
, var_labelno
);
537 name
= ggc_alloc_string (label
, -1);
542 /* When -fprefix-function-name is used, every function name is
543 prefixed. Even static functions are prefixed because they
544 could be declared latter. Note that a nested function name
546 if (flag_prefix_function_name
)
548 size_t name_len
= strlen (name
);
550 new_name
= ggc_alloc_string (NULL
, name_len
+ CHKR_PREFIX_SIZE
);
551 memcpy (new_name
, CHKR_PREFIX
, CHKR_PREFIX_SIZE
);
552 memcpy (new_name
+ CHKR_PREFIX_SIZE
, name
, name_len
+ 1);
557 if (DECL_RTL (decl
) == 0)
559 DECL_ASSEMBLER_NAME (decl
) = get_identifier (name
);
561 = gen_rtx_MEM (DECL_MODE (decl
),
562 gen_rtx_SYMBOL_REF (Pmode
, name
));
564 /* Optionally set flags or add text to the name to record information
565 such as that it is a function name. If the name is changed, the macro
566 ASM_OUTPUT_LABELREF will have to know how to strip this information. */
567 #ifdef ENCODE_SECTION_INFO
568 ENCODE_SECTION_INFO (decl
);
573 /* ??? Another way to do this would be to do what halfpic.c does
574 and maintain a hashed table of such critters. */
575 /* ??? Another way to do this would be to pass a flag bit to
576 ENCODE_SECTION_INFO saying whether this is a new decl or not. */
577 /* Let the target reassign the RTL if it wants.
578 This is necessary, for example, when one machine specific
579 decl attribute overrides another. */
580 #ifdef REDO_SECTION_INFO_P
581 if (REDO_SECTION_INFO_P (decl
))
582 ENCODE_SECTION_INFO (decl
);
587 /* Given NAME, a putative register name, discard any customary prefixes. */
590 strip_reg_name (name
)
593 #ifdef REGISTER_PREFIX
594 if (!strncmp (name
, REGISTER_PREFIX
, strlen (REGISTER_PREFIX
)))
595 name
+= strlen (REGISTER_PREFIX
);
597 if (name
[0] == '%' || name
[0] == '#')
602 /* Decode an `asm' spec for a declaration as a register name.
603 Return the register number, or -1 if nothing specified,
604 or -2 if the ASMSPEC is not `cc' or `memory' and is not recognized,
605 or -3 if ASMSPEC is `cc' and is not recognized,
606 or -4 if ASMSPEC is `memory' and is not recognized.
607 Accept an exact spelling or a decimal number.
608 Prefixes such as % are optional. */
611 decode_reg_name (asmspec
)
618 /* Get rid of confusing prefixes. */
619 asmspec
= strip_reg_name (asmspec
);
621 /* Allow a decimal number as a "register name". */
622 for (i
= strlen (asmspec
) - 1; i
>= 0; i
--)
623 if (! (asmspec
[i
] >= '0' && asmspec
[i
] <= '9'))
625 if (asmspec
[0] != 0 && i
< 0)
628 if (i
< FIRST_PSEUDO_REGISTER
&& i
>= 0)
634 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
636 && ! strcmp (asmspec
, strip_reg_name (reg_names
[i
])))
639 #ifdef ADDITIONAL_REGISTER_NAMES
641 static struct { const char *name
; int number
; } table
[]
642 = ADDITIONAL_REGISTER_NAMES
;
644 for (i
= 0; i
< (int)(sizeof (table
) / sizeof (table
[0])); i
++)
645 if (! strcmp (asmspec
, table
[i
].name
))
646 return table
[i
].number
;
648 #endif /* ADDITIONAL_REGISTER_NAMES */
650 if (!strcmp (asmspec
, "memory"))
653 if (!strcmp (asmspec
, "cc"))
662 /* Create the DECL_RTL for a declaration for a static or external variable
663 or static or external function.
664 ASMSPEC, if not 0, is the string which the user specified
665 as the assembler symbol name.
666 TOP_LEVEL is nonzero if this is a file-scope variable.
668 This is never called for PARM_DECL nodes. */
671 make_decl_rtl (decl
, asmspec
, top_level
)
676 register char *name
= 0;
679 reg_number
= decode_reg_name (asmspec
);
681 if (DECL_ASSEMBLER_NAME (decl
) != NULL_TREE
)
682 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
684 if (reg_number
== -2)
686 /* ASMSPEC is given, and not the name of a register. */
687 size_t len
= strlen (asmspec
);
689 name
= ggc_alloc_string (NULL
, len
+ 1);
691 memcpy (&name
[1], asmspec
, len
+ 1);
694 /* For a duplicate declaration, we can be called twice on the
695 same DECL node. Don't discard the RTL already made. */
696 if (DECL_RTL (decl
) == 0)
698 /* First detect errors in declaring global registers. */
699 if (TREE_CODE (decl
) != FUNCTION_DECL
700 && DECL_REGISTER (decl
) && reg_number
== -1)
701 error_with_decl (decl
,
702 "register name not specified for `%s'");
703 else if (TREE_CODE (decl
) != FUNCTION_DECL
704 && DECL_REGISTER (decl
) && reg_number
< 0)
705 error_with_decl (decl
,
706 "invalid register name for `%s'");
707 else if ((reg_number
>= 0 || reg_number
== -3)
708 && (TREE_CODE (decl
) == FUNCTION_DECL
709 && ! DECL_REGISTER (decl
)))
710 error_with_decl (decl
,
711 "register name given for non-register variable `%s'");
712 else if (TREE_CODE (decl
) != FUNCTION_DECL
713 && DECL_REGISTER (decl
)
714 && TYPE_MODE (TREE_TYPE (decl
)) == BLKmode
)
715 error_with_decl (decl
,
716 "data type of `%s' isn't suitable for a register");
717 else if (TREE_CODE (decl
) != FUNCTION_DECL
&& DECL_REGISTER (decl
)
718 && ! HARD_REGNO_MODE_OK (reg_number
,
719 TYPE_MODE (TREE_TYPE (decl
))))
720 error_with_decl (decl
,
721 "register number for `%s' isn't suitable for data type");
722 /* Now handle properly declared static register variables. */
723 else if (TREE_CODE (decl
) != FUNCTION_DECL
&& DECL_REGISTER (decl
))
727 if (DECL_INITIAL (decl
) != 0 && top_level
)
729 DECL_INITIAL (decl
) = 0;
730 error ("global register variable has initial value");
732 if (TREE_THIS_VOLATILE (decl
))
733 warning ("volatile register variables don't work as you might wish");
735 /* If the user specified one of the eliminables registers here,
736 e.g., FRAME_POINTER_REGNUM, we don't want to get this variable
737 confused with that register and be eliminated. Although this
738 usage is somewhat suspect, we nevertheless use the following
739 kludge to avoid setting DECL_RTL to frame_pointer_rtx. */
742 = gen_rtx_REG (DECL_MODE (decl
), FIRST_PSEUDO_REGISTER
);
743 REGNO (DECL_RTL (decl
)) = reg_number
;
744 REG_USERVAR_P (DECL_RTL (decl
)) = 1;
748 /* Make this register global, so not usable for anything
750 #ifdef ASM_DECLARE_REGISTER_GLOBAL
751 ASM_DECLARE_REGISTER_GLOBAL (asm_out_file
, decl
, reg_number
, name
);
753 nregs
= HARD_REGNO_NREGS (reg_number
, DECL_MODE (decl
));
755 globalize_reg (reg_number
+ --nregs
);
758 /* Specifying a section attribute on a variable forces it into a
759 non-.bss section, and thus it cannot be common. */
760 else if (TREE_CODE (decl
) == VAR_DECL
761 && DECL_SECTION_NAME (decl
) != NULL_TREE
762 && DECL_INITIAL (decl
) == NULL_TREE
763 && DECL_COMMON (decl
))
764 DECL_COMMON (decl
) = 0;
766 /* Now handle ordinary static variables and functions (in memory).
767 Also handle vars declared register invalidly. */
768 if (DECL_RTL (decl
) == 0)
770 /* Can't use just the variable's own name for a variable
771 whose scope is less than the whole file, unless it's a member
772 of a local class (which will already be unambiguous).
773 Concatenate a distinguishing number. */
774 if (!top_level
&& !TREE_PUBLIC (decl
)
775 && ! (DECL_CONTEXT (decl
) && TYPE_P (DECL_CONTEXT (decl
)))
780 ASM_FORMAT_PRIVATE_NAME (label
, name
, var_labelno
);
781 name
= ggc_alloc_string (label
, -1);
788 /* When -fprefix-function-name is used, the functions
789 names are prefixed. Only nested function names are not
791 if (flag_prefix_function_name
&& TREE_CODE (decl
) == FUNCTION_DECL
)
793 size_t name_len
= strlen (name
);
796 new_name
= ggc_alloc_string (NULL
, name_len
+ CHKR_PREFIX_SIZE
);
797 memcpy (new_name
, CHKR_PREFIX
, CHKR_PREFIX_SIZE
);
798 memcpy (new_name
+ CHKR_PREFIX_SIZE
, name
, name_len
+ 1);
802 DECL_ASSEMBLER_NAME (decl
)
803 = get_identifier (name
[0] == '*' ? name
+ 1 : name
);
804 DECL_RTL (decl
) = gen_rtx_MEM (DECL_MODE (decl
),
805 gen_rtx_SYMBOL_REF (Pmode
, name
));
806 MEM_ALIAS_SET (DECL_RTL (decl
)) = get_alias_set (decl
);
808 /* If this variable is to be treated as volatile, show its
809 tree node has side effects. If it has side effects, either
810 because of this test or from TREE_THIS_VOLATILE also
811 being set, show the MEM is volatile. */
812 if (flag_volatile_global
&& TREE_CODE (decl
) == VAR_DECL
813 && TREE_PUBLIC (decl
))
814 TREE_SIDE_EFFECTS (decl
) = 1;
815 else if (flag_volatile_static
&& TREE_CODE (decl
) == VAR_DECL
816 && (TREE_PUBLIC (decl
) || TREE_STATIC (decl
)))
817 TREE_SIDE_EFFECTS (decl
) = 1;
819 if (TREE_SIDE_EFFECTS (decl
))
820 MEM_VOLATILE_P (DECL_RTL (decl
)) = 1;
822 if (TREE_READONLY (decl
))
823 RTX_UNCHANGING_P (DECL_RTL (decl
)) = 1;
824 MEM_SET_IN_STRUCT_P (DECL_RTL (decl
),
825 AGGREGATE_TYPE_P (TREE_TYPE (decl
)));
827 /* Optionally set flags or add text to the name to record information
828 such as that it is a function name.
829 If the name is changed, the macro ASM_OUTPUT_LABELREF
830 will have to know how to strip this information. */
831 #ifdef ENCODE_SECTION_INFO
832 ENCODE_SECTION_INFO (decl
);
838 /* If the old RTL had the wrong mode, fix the mode. */
839 if (GET_MODE (DECL_RTL (decl
)) != DECL_MODE (decl
))
841 rtx rtl
= DECL_RTL (decl
);
842 PUT_MODE (rtl
, DECL_MODE (decl
));
845 /* ??? Another way to do this would be to do what halfpic.c does
846 and maintain a hashed table of such critters. */
847 /* ??? Another way to do this would be to pass a flag bit to
848 ENCODE_SECTION_INFO saying whether this is a new decl or not. */
849 /* Let the target reassign the RTL if it wants.
850 This is necessary, for example, when one machine specific
851 decl attribute overrides another. */
852 #ifdef REDO_SECTION_INFO_P
853 if (REDO_SECTION_INFO_P (decl
))
854 ENCODE_SECTION_INFO (decl
);
859 /* Make the rtl for variable VAR be volatile.
860 Use this only for static variables. */
863 make_var_volatile (var
)
866 if (GET_CODE (DECL_RTL (var
)) != MEM
)
869 MEM_VOLATILE_P (DECL_RTL (var
)) = 1;
872 /* Output alignment directive to align for constant expression EXP. */
875 assemble_constant_align (exp
)
880 /* Align the location counter as required by EXP's data type. */
881 align
= TYPE_ALIGN (TREE_TYPE (exp
));
882 #ifdef CONSTANT_ALIGNMENT
883 align
= CONSTANT_ALIGNMENT (exp
, align
);
886 if (align
> BITS_PER_UNIT
)
887 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
890 /* Output a string of literal assembler code
891 for an `asm' keyword used between functions. */
894 assemble_asm (string
)
899 if (TREE_CODE (string
) == ADDR_EXPR
)
900 string
= TREE_OPERAND (string
, 0);
902 fprintf (asm_out_file
, "\t%s\n", TREE_STRING_POINTER (string
));
905 #if 0 /* This should no longer be needed, because
906 flag_gnu_linker should be 0 on these systems,
907 which should prevent any output
908 if ASM_OUTPUT_CONSTRUCTOR and ASM_OUTPUT_DESTRUCTOR are absent. */
909 #if !(defined(DBX_DEBUGGING_INFO) && !defined(FASCIST_ASSEMBLER))
910 #ifndef ASM_OUTPUT_CONSTRUCTOR
911 #define ASM_OUTPUT_CONSTRUCTOR(file, name)
913 #ifndef ASM_OUTPUT_DESTRUCTOR
914 #define ASM_OUTPUT_DESTRUCTOR(file, name)
919 /* Record an element in the table of global destructors.
920 How this is done depends on what sort of assembler and linker
923 NAME should be the name of a global function to be called
924 at exit time. This name is output using assemble_name. */
927 assemble_destructor (name
)
930 #ifdef ASM_OUTPUT_DESTRUCTOR
931 ASM_OUTPUT_DESTRUCTOR (asm_out_file
, name
);
935 /* Now tell GNU LD that this is part of the static destructor set. */
936 /* This code works for any machine provided you use GNU as/ld. */
937 fprintf (asm_out_file
, "%s \"___DTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
938 assemble_name (asm_out_file
, name
);
939 fputc ('\n', asm_out_file
);
944 /* Likewise for global constructors. */
947 assemble_constructor (name
)
950 #ifdef ASM_OUTPUT_CONSTRUCTOR
951 ASM_OUTPUT_CONSTRUCTOR (asm_out_file
, name
);
955 /* Now tell GNU LD that this is part of the static constructor set. */
956 /* This code works for any machine provided you use GNU as/ld. */
957 fprintf (asm_out_file
, "%s \"___CTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
958 assemble_name (asm_out_file
, name
);
959 fputc ('\n', asm_out_file
);
964 /* Likewise for entries we want to record for garbage collection.
965 Garbage collection is still under development. */
968 assemble_gc_entry (name
)
971 #ifdef ASM_OUTPUT_GC_ENTRY
972 ASM_OUTPUT_GC_ENTRY (asm_out_file
, name
);
976 /* Now tell GNU LD that this is part of the static constructor set. */
977 fprintf (asm_out_file
, "%s \"___PTR_LIST__\",22,0,0,", ASM_STABS_OP
);
978 assemble_name (asm_out_file
, name
);
979 fputc ('\n', asm_out_file
);
984 /* CONSTANT_POOL_BEFORE_FUNCTION may be defined as an expression with
985 a non-zero value if the constant pool should be output before the
986 start of the function, or a zero value if the pool should output
987 after the end of the function. The default is to put it before the
990 #ifndef CONSTANT_POOL_BEFORE_FUNCTION
991 #define CONSTANT_POOL_BEFORE_FUNCTION 1
994 /* Output assembler code for the constant pool of a function and associated
995 with defining the name of the function. DECL describes the function.
996 NAME is the function's name. For the constant pool, we use the current
997 constant pool data. */
1000 assemble_start_function (decl
, fnname
)
1006 /* The following code does not need preprocessing in the assembler. */
1010 if (CONSTANT_POOL_BEFORE_FUNCTION
)
1011 output_constant_pool (fnname
, decl
);
1013 #ifdef ASM_OUTPUT_SECTION_NAME
1014 /* If the function is to be put in its own section and it's not in a section
1015 already, indicate so. */
1016 if ((flag_function_sections
1017 && DECL_SECTION_NAME (decl
) == NULL_TREE
)
1018 || UNIQUE_SECTION_P (decl
))
1019 UNIQUE_SECTION (decl
, 0);
1022 function_section (decl
);
1024 /* Tell assembler to move to target machine's alignment for functions. */
1025 align
= floor_log2 (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
1027 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1029 /* Handle a user-specified function alignment.
1030 Note that we still need to align to FUNCTION_BOUNDARY, as above,
1031 because ASM_OUTPUT_MAX_SKIP_ALIGN might not do any alignment at all. */
1032 if (align_functions_log
> align
)
1034 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
1035 ASM_OUTPUT_MAX_SKIP_ALIGN (asm_out_file
,
1036 align_functions_log
, align_functions
-1);
1038 ASM_OUTPUT_ALIGN (asm_out_file
, align_functions_log
);
1042 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
1043 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file
, fnname
);
1046 #ifdef SDB_DEBUGGING_INFO
1047 /* Output SDB definition of the function. */
1048 if (write_symbols
== SDB_DEBUG
)
1049 sdbout_mark_begin_function ();
1052 #ifdef DBX_DEBUGGING_INFO
1053 /* Output DBX definition of the function. */
1054 if (write_symbols
== DBX_DEBUG
)
1055 dbxout_begin_function (decl
);
1058 /* Make function name accessible from other files, if appropriate. */
1060 if (TREE_PUBLIC (decl
))
1062 if (! first_global_object_name
)
1067 if (! DECL_WEAK (decl
) && ! DECL_ONE_ONLY (decl
))
1068 name
= &first_global_object_name
;
1070 name
= &weak_global_object_name
;
1072 STRIP_NAME_ENCODING (p
, fnname
);
1073 *name
= permalloc (strlen (p
) + 1);
1077 #ifdef ASM_WEAKEN_LABEL
1078 if (DECL_WEAK (decl
))
1080 ASM_WEAKEN_LABEL (asm_out_file
, fnname
);
1081 /* Remove this function from the pending weak list so that
1082 we do not emit multiple .weak directives for it. */
1083 remove_from_pending_weak_list
1084 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
1088 ASM_GLOBALIZE_LABEL (asm_out_file
, fnname
);
1091 /* Do any machine/system dependent processing of the function name */
1092 #ifdef ASM_DECLARE_FUNCTION_NAME
1093 ASM_DECLARE_FUNCTION_NAME (asm_out_file
, fnname
, current_function_decl
);
1095 /* Standard thing is just output label for the function. */
1096 ASM_OUTPUT_LABEL (asm_out_file
, fnname
);
1097 #endif /* ASM_DECLARE_FUNCTION_NAME */
1100 /* Output assembler code associated with defining the size of the
1101 function. DECL describes the function. NAME is the function's name. */
1104 assemble_end_function (decl
, fnname
)
1108 #ifdef ASM_DECLARE_FUNCTION_SIZE
1109 ASM_DECLARE_FUNCTION_SIZE (asm_out_file
, fnname
, decl
);
1111 if (! CONSTANT_POOL_BEFORE_FUNCTION
)
1113 output_constant_pool (fnname
, decl
);
1114 function_section (decl
); /* need to switch back */
1117 /* Output any constants which should appear after the function. */
1118 output_after_function_constants ();
1121 /* Assemble code to leave SIZE bytes of zeros. */
1124 assemble_zeros (size
)
1127 /* Do no output if -fsyntax-only. */
1128 if (flag_syntax_only
)
1131 #ifdef ASM_NO_SKIP_IN_TEXT
1132 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
1133 so we must output 0s explicitly in the text section. */
1134 if (ASM_NO_SKIP_IN_TEXT
&& in_text_section ())
1138 for (i
= 0; i
< size
- 20; i
+= 20)
1141 fprintf (asm_out_file
,
1142 "%s 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n", ASM_BYTE_OP
);
1144 fprintf (asm_out_file
,
1145 "\tbyte 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n");
1151 fprintf (asm_out_file
, "%s 0", ASM_BYTE_OP
);
1153 fprintf (asm_out_file
, "\tbyte 0");
1156 for (; i
< size
; i
++)
1157 fprintf (asm_out_file
, ",0");
1158 fprintf (asm_out_file
, "\n");
1164 ASM_OUTPUT_SKIP (asm_out_file
, size
);
1167 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
1170 assemble_align (align
)
1173 if (align
> BITS_PER_UNIT
)
1174 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
1177 /* Assemble a string constant with the specified C string as contents. */
1180 assemble_string (p
, size
)
1187 /* If the string is very long, split it up. */
1191 int thissize
= size
- pos
;
1192 if (thissize
> maximum
)
1195 ASM_OUTPUT_ASCII (asm_out_file
, p
, thissize
);
1203 #if defined ASM_OUTPUT_ALIGNED_DECL_LOCAL
1204 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1205 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1207 #if defined ASM_OUTPUT_ALIGNED_LOCAL
1208 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1209 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, DECL_ALIGN (decl))
1211 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1212 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded)
1216 #if defined ASM_OUTPUT_ALIGNED_BSS
1217 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1218 ASM_OUTPUT_ALIGNED_BSS (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1220 #if defined ASM_OUTPUT_BSS
1221 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1222 ASM_OUTPUT_BSS (asm_out_file, decl, name, size, rounded)
1228 #if defined ASM_OUTPUT_ALIGNED_DECL_COMMON
1229 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1230 ASM_OUTPUT_ALIGNED_DECL_COMMON (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1232 #if defined ASM_OUTPUT_ALIGNED_COMMON
1233 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1234 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file, name, size, DECL_ALIGN (decl))
1236 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1237 ASM_OUTPUT_COMMON (asm_out_file, name, size, rounded)
1242 asm_emit_uninitialised (decl
, name
, size
, rounded
)
1245 int size ATTRIBUTE_UNUSED
;
1246 int rounded ATTRIBUTE_UNUSED
;
1254 destination
= asm_dest_local
;
1256 if (TREE_PUBLIC (decl
))
1258 #if defined ASM_EMIT_BSS
1259 if (! DECL_COMMON (decl
))
1260 destination
= asm_dest_bss
;
1263 destination
= asm_dest_common
;
1266 if (flag_shared_data
)
1268 switch (destination
)
1270 #ifdef ASM_OUTPUT_SHARED_BSS
1272 ASM_OUTPUT_SHARED_BSS (asm_out_file
, decl
, name
, size
, rounded
);
1275 #ifdef ASM_OUTPUT_SHARED_COMMON
1276 case asm_dest_common
:
1277 ASM_OUTPUT_SHARED_COMMON (asm_out_file
, name
, size
, rounded
);
1280 #ifdef ASM_OUTPUT_SHARED_LOCAL
1281 case asm_dest_local
:
1282 ASM_OUTPUT_SHARED_LOCAL (asm_out_file
, name
, size
, rounded
);
1290 #ifdef ASM_OUTPUT_SECTION_NAME
1291 /* We already know that DECL_SECTION_NAME() == NULL. */
1292 if (flag_data_sections
!= 0 || UNIQUE_SECTION_P (decl
))
1293 UNIQUE_SECTION (decl
, NULL
);
1296 switch (destination
)
1300 ASM_EMIT_BSS (decl
, name
, size
, rounded
);
1303 case asm_dest_common
:
1304 ASM_EMIT_COMMON (decl
, name
, size
, rounded
);
1306 case asm_dest_local
:
1307 ASM_EMIT_LOCAL (decl
, name
, size
, rounded
);
1316 /* Assemble everything that is needed for a variable or function declaration.
1317 Not used for automatic variables, and not used for function definitions.
1318 Should not be called for variables of incomplete structure type.
1320 TOP_LEVEL is nonzero if this variable has file scope.
1321 AT_END is nonzero if this is the special handling, at end of compilation,
1322 to define things that have had only tentative definitions.
1323 DONT_OUTPUT_DATA if nonzero means don't actually output the
1324 initial value (that will be done by the caller). */
1327 assemble_variable (decl
, top_level
, at_end
, dont_output_data
)
1329 int top_level ATTRIBUTE_UNUSED
;
1330 int at_end ATTRIBUTE_UNUSED
;
1331 int dont_output_data
;
1333 register const char *name
;
1335 tree size_tree
= NULL_TREE
;
1337 enum in_section saved_in_section
;
1339 last_assemble_variable_decl
= 0;
1341 if (GET_CODE (DECL_RTL (decl
)) == REG
)
1343 /* Do output symbol info for global register variables, but do nothing
1346 if (TREE_ASM_WRITTEN (decl
))
1348 TREE_ASM_WRITTEN (decl
) = 1;
1350 /* Do no output if -fsyntax-only. */
1351 if (flag_syntax_only
)
1354 #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
1355 /* File-scope global variables are output here. */
1356 if ((write_symbols
== DBX_DEBUG
|| write_symbols
== XCOFF_DEBUG
)
1358 dbxout_symbol (decl
, 0);
1360 #ifdef SDB_DEBUGGING_INFO
1361 if (write_symbols
== SDB_DEBUG
&& top_level
1362 /* Leave initialized global vars for end of compilation;
1363 see comment in compile_file. */
1364 && (TREE_PUBLIC (decl
) == 0 || DECL_INITIAL (decl
) == 0))
1365 sdbout_symbol (decl
, 0);
1368 /* Don't output any DWARF debugging information for variables here.
1369 In the case of local variables, the information for them is output
1370 when we do our recursive traversal of the tree representation for
1371 the entire containing function. In the case of file-scope variables,
1372 we output information for all of them at the very end of compilation
1373 while we are doing our final traversal of the chain of file-scope
1379 /* Normally no need to say anything here for external references,
1380 since assemble_external is called by the language-specific code
1381 when a declaration is first seen. */
1383 if (DECL_EXTERNAL (decl
))
1386 /* Output no assembler code for a function declaration.
1387 Only definitions of functions output anything. */
1389 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1392 /* If type was incomplete when the variable was declared,
1393 see if it is complete now. */
1395 if (DECL_SIZE (decl
) == 0)
1396 layout_decl (decl
, 0);
1398 /* Still incomplete => don't allocate it; treat the tentative defn
1399 (which is what it must have been) as an `extern' reference. */
1401 if (!dont_output_data
&& DECL_SIZE (decl
) == 0)
1403 error_with_file_and_line (DECL_SOURCE_FILE (decl
),
1404 DECL_SOURCE_LINE (decl
),
1405 "storage size of `%s' isn't known",
1406 IDENTIFIER_POINTER (DECL_NAME (decl
)));
1407 TREE_ASM_WRITTEN (decl
) = 1;
1411 /* The first declaration of a variable that comes through this function
1412 decides whether it is global (in C, has external linkage)
1413 or local (in C, has internal linkage). So do nothing more
1414 if this function has already run. */
1416 if (TREE_ASM_WRITTEN (decl
))
1419 TREE_ASM_WRITTEN (decl
) = 1;
1421 /* Do no output if -fsyntax-only. */
1422 if (flag_syntax_only
)
1427 if (! dont_output_data
)
1431 if (TREE_CODE (DECL_SIZE_UNIT (decl
)) != INTEGER_CST
)
1434 size_tree
= DECL_SIZE_UNIT (decl
);
1435 size
= TREE_INT_CST_LOW (size_tree
);
1437 if (compare_tree_int (size_tree
, size
) != 0)
1439 error_with_decl (decl
, "size of variable `%s' is too large");
1444 name
= XSTR (XEXP (DECL_RTL (decl
), 0), 0);
1445 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
)
1446 && ! first_global_object_name
1447 && ! (DECL_COMMON (decl
) && (DECL_INITIAL (decl
) == 0
1448 || DECL_INITIAL (decl
) == error_mark_node
))
1449 && ! DECL_WEAK (decl
)
1450 && ! DECL_ONE_ONLY (decl
))
1454 STRIP_NAME_ENCODING (p
, name
);
1455 first_global_object_name
= permalloc (strlen (p
) + 1);
1456 strcpy (first_global_object_name
, p
);
1459 /* Compute the alignment of this data. */
1461 align
= DECL_ALIGN (decl
);
1463 /* In the case for initialing an array whose length isn't specified,
1464 where we have not yet been able to do the layout,
1465 figure out the proper alignment now. */
1466 if (dont_output_data
&& DECL_SIZE (decl
) == 0
1467 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
)
1468 align
= MAX (align
, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl
))));
1470 /* Some object file formats have a maximum alignment which they support.
1471 In particular, a.out format supports a maximum alignment of 4. */
1472 #ifndef MAX_OFILE_ALIGNMENT
1473 #define MAX_OFILE_ALIGNMENT BIGGEST_ALIGNMENT
1475 if (align
> MAX_OFILE_ALIGNMENT
)
1477 warning_with_decl (decl
,
1478 "alignment of `%s' is greater than maximum object file alignment. Using %d.",
1479 MAX_OFILE_ALIGNMENT
/BITS_PER_UNIT
);
1480 align
= MAX_OFILE_ALIGNMENT
;
1483 /* On some machines, it is good to increase alignment sometimes. */
1484 #ifdef DATA_ALIGNMENT
1485 align
= DATA_ALIGNMENT (TREE_TYPE (decl
), align
);
1487 #ifdef CONSTANT_ALIGNMENT
1488 if (DECL_INITIAL (decl
) != 0 && DECL_INITIAL (decl
) != error_mark_node
)
1489 align
= CONSTANT_ALIGNMENT (DECL_INITIAL (decl
), align
);
1492 /* Reset the alignment in case we have made it tighter, so we can benefit
1493 from it in get_pointer_alignment. */
1494 DECL_ALIGN (decl
) = align
;
1496 /* Handle uninitialized definitions. */
1498 if ((DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
)
1499 /* If the target can't output uninitialized but not common global data
1500 in .bss, then we have to use .data. */
1501 #if ! defined ASM_EMIT_BSS
1502 && DECL_COMMON (decl
)
1504 && DECL_SECTION_NAME (decl
) == NULL_TREE
1505 && ! dont_output_data
)
1507 int size
= TREE_INT_CST_LOW (size_tree
);
1510 /* Don't allocate zero bytes of common,
1511 since that means "undefined external" in the linker. */
1512 if (size
== 0) rounded
= 1;
1513 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1514 so that each uninitialized object starts on such a boundary. */
1515 rounded
+= (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1;
1516 rounded
= (rounded
/ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1517 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1519 #if !defined(ASM_OUTPUT_ALIGNED_COMMON) && !defined(ASM_OUTPUT_ALIGNED_BSS)
1520 if ((DECL_ALIGN (decl
) / BITS_PER_UNIT
) > (unsigned int) rounded
)
1522 (decl
, "requested alignment for %s is greater than implemented alignment of %d.",rounded
);
1525 #ifdef DBX_DEBUGGING_INFO
1526 /* File-scope global variables are output here. */
1527 if (write_symbols
== DBX_DEBUG
&& top_level
)
1528 dbxout_symbol (decl
, 0);
1530 #ifdef SDB_DEBUGGING_INFO
1531 if (write_symbols
== SDB_DEBUG
&& top_level
1532 /* Leave initialized global vars for end of compilation;
1533 see comment in compile_file. */
1534 && (TREE_PUBLIC (decl
) == 0 || DECL_INITIAL (decl
) == 0))
1535 sdbout_symbol (decl
, 0);
1538 /* Don't output any DWARF debugging information for variables here.
1539 In the case of local variables, the information for them is output
1540 when we do our recursive traversal of the tree representation for
1541 the entire containing function. In the case of file-scope variables,
1542 we output information for all of them at the very end of compilation
1543 while we are doing our final traversal of the chain of file-scope
1546 #if 0 /* ??? We should either delete this or add a comment describing what
1547 it was intended to do and why we shouldn't delete it. */
1548 if (flag_shared_data
)
1551 asm_emit_uninitialised (decl
, name
, size
, rounded
);
1556 /* Handle initialized definitions.
1557 Also handle uninitialized global definitions if -fno-common and the
1558 target doesn't support ASM_OUTPUT_BSS. */
1560 /* First make the assembler name(s) global if appropriate. */
1561 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
))
1563 #ifdef ASM_WEAKEN_LABEL
1564 if (DECL_WEAK (decl
))
1566 ASM_WEAKEN_LABEL (asm_out_file
, name
);
1567 /* Remove this variable from the pending weak list so that
1568 we do not emit multiple .weak directives for it. */
1569 remove_from_pending_weak_list
1570 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
1574 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
1577 for (d
= equivalents
; d
; d
= TREE_CHAIN (d
))
1579 tree e
= TREE_VALUE (d
);
1580 if (TREE_PUBLIC (e
) && DECL_NAME (e
))
1581 ASM_GLOBALIZE_LABEL (asm_out_file
,
1582 XSTR (XEXP (DECL_RTL (e
), 0), 0));
1586 /* Output any data that we will need to use the address of. */
1587 if (DECL_INITIAL (decl
) == error_mark_node
)
1588 reloc
= contains_pointers_p (TREE_TYPE (decl
));
1589 else if (DECL_INITIAL (decl
))
1590 reloc
= output_addressed_constants (DECL_INITIAL (decl
));
1592 #ifdef ASM_OUTPUT_SECTION_NAME
1593 if ((flag_data_sections
!= 0 && DECL_SECTION_NAME (decl
) == NULL_TREE
)
1594 || UNIQUE_SECTION_P (decl
))
1595 UNIQUE_SECTION (decl
, reloc
);
1598 /* Switch to the appropriate section. */
1599 variable_section (decl
, reloc
);
1601 /* dbxout.c needs to know this. */
1602 if (in_text_section ())
1603 DECL_IN_TEXT_SECTION (decl
) = 1;
1605 /* Record current section so we can restore it if dbxout.c clobbers it. */
1606 saved_in_section
= in_section
;
1608 /* Output the dbx info now that we have chosen the section. */
1610 #ifdef DBX_DEBUGGING_INFO
1611 /* File-scope global variables are output here. */
1612 if (write_symbols
== DBX_DEBUG
&& top_level
)
1613 dbxout_symbol (decl
, 0);
1615 #ifdef SDB_DEBUGGING_INFO
1616 if (write_symbols
== SDB_DEBUG
&& top_level
1617 /* Leave initialized global vars for end of compilation;
1618 see comment in compile_file. */
1619 && (TREE_PUBLIC (decl
) == 0 || DECL_INITIAL (decl
) == 0))
1620 sdbout_symbol (decl
, 0);
1623 /* Don't output any DWARF debugging information for variables here.
1624 In the case of local variables, the information for them is output
1625 when we do our recursive traversal of the tree representation for
1626 the entire containing function. In the case of file-scope variables,
1627 we output information for all of them at the very end of compilation
1628 while we are doing our final traversal of the chain of file-scope
1631 /* If the debugging output changed sections, reselect the section
1632 that's supposed to be selected. */
1633 if (in_section
!= saved_in_section
)
1634 variable_section (decl
, reloc
);
1636 /* Output the alignment of this data. */
1637 if (align
> BITS_PER_UNIT
)
1638 ASM_OUTPUT_ALIGN (asm_out_file
,
1639 floor_log2 (DECL_ALIGN (decl
) / BITS_PER_UNIT
));
1641 /* Do any machine/system dependent processing of the object. */
1642 #ifdef ASM_DECLARE_OBJECT_NAME
1643 last_assemble_variable_decl
= decl
;
1644 ASM_DECLARE_OBJECT_NAME (asm_out_file
, name
, decl
);
1646 /* Standard thing is just output label for the object. */
1647 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1648 #endif /* ASM_DECLARE_OBJECT_NAME */
1650 if (!dont_output_data
)
1652 if (DECL_INITIAL (decl
))
1653 /* Output the actual data. */
1654 output_constant (DECL_INITIAL (decl
), TREE_INT_CST_LOW (size_tree
));
1656 /* Leave space for it. */
1657 assemble_zeros (TREE_INT_CST_LOW (size_tree
));
1661 #ifdef XCOFF_DEBUGGING_INFO
1662 /* Unfortunately, the IBM assembler cannot handle stabx before the actual
1663 declaration. When something like ".stabx "aa:S-2",aa,133,0" is emitted
1664 and `aa' hasn't been output yet, the assembler generates a stab entry with
1665 a value of zero, in addition to creating an unnecessary external entry
1666 for `aa'. Hence, we must postpone dbxout_symbol to here at the end. */
1668 /* File-scope global variables are output here. */
1669 if (write_symbols
== XCOFF_DEBUG
&& top_level
)
1671 saved_in_section
= in_section
;
1673 dbxout_symbol (decl
, 0);
1675 if (in_section
!= saved_in_section
)
1676 variable_section (decl
, reloc
);
1679 /* There must be a statement after a label. */
1684 /* Return 1 if type TYPE contains any pointers. */
1687 contains_pointers_p (type
)
1690 switch (TREE_CODE (type
))
1693 case REFERENCE_TYPE
:
1694 /* I'm not sure whether OFFSET_TYPE needs this treatment,
1695 so I'll play safe and return 1. */
1701 case QUAL_UNION_TYPE
:
1704 /* For a type that has fields, see if the fields have pointers. */
1705 for (fields
= TYPE_FIELDS (type
); fields
; fields
= TREE_CHAIN (fields
))
1706 if (TREE_CODE (fields
) == FIELD_DECL
1707 && contains_pointers_p (TREE_TYPE (fields
)))
1713 /* An array type contains pointers if its element type does. */
1714 return contains_pointers_p (TREE_TYPE (type
));
1721 /* Output something to declare an external symbol to the assembler.
1722 (Most assemblers don't need this, so we normally output nothing.)
1723 Do nothing if DECL is not external. */
1726 assemble_external (decl
)
1727 tree decl ATTRIBUTE_UNUSED
;
1729 #ifdef ASM_OUTPUT_EXTERNAL
1730 if (TREE_CODE_CLASS (TREE_CODE (decl
)) == 'd'
1731 && DECL_EXTERNAL (decl
) && TREE_PUBLIC (decl
))
1733 rtx rtl
= DECL_RTL (decl
);
1735 if (GET_CODE (rtl
) == MEM
&& GET_CODE (XEXP (rtl
, 0)) == SYMBOL_REF
1736 && ! SYMBOL_REF_USED (XEXP (rtl
, 0)))
1738 /* Some systems do require some output. */
1739 SYMBOL_REF_USED (XEXP (rtl
, 0)) = 1;
1740 ASM_OUTPUT_EXTERNAL (asm_out_file
, decl
, XSTR (XEXP (rtl
, 0), 0));
1746 /* Similar, for calling a library function FUN. */
1749 assemble_external_libcall (fun
)
1750 rtx fun ATTRIBUTE_UNUSED
;
1752 #ifdef ASM_OUTPUT_EXTERNAL_LIBCALL
1753 /* Declare library function name external when first used, if nec. */
1754 if (! SYMBOL_REF_USED (fun
))
1756 SYMBOL_REF_USED (fun
) = 1;
1757 ASM_OUTPUT_EXTERNAL_LIBCALL (asm_out_file
, fun
);
1762 /* Declare the label NAME global. */
1765 assemble_global (name
)
1768 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
1771 /* Assemble a label named NAME. */
1774 assemble_label (name
)
1777 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1780 /* Output to FILE a reference to the assembler name of a C-level name NAME.
1781 If NAME starts with a *, the rest of NAME is output verbatim.
1782 Otherwise NAME is transformed in an implementation-defined way
1783 (usually by the addition of an underscore).
1784 Many macros in the tm file are defined to call this function. */
1787 assemble_name (file
, name
)
1791 const char *real_name
;
1794 STRIP_NAME_ENCODING (real_name
, name
);
1795 if (flag_prefix_function_name
1796 && ! bcmp (real_name
, CHKR_PREFIX
, CHKR_PREFIX_SIZE
))
1797 real_name
= real_name
+ CHKR_PREFIX_SIZE
;
1799 id
= maybe_get_identifier (real_name
);
1801 TREE_SYMBOL_REFERENCED (id
) = 1;
1804 fputs (&name
[1], file
);
1806 ASM_OUTPUT_LABELREF (file
, name
);
1809 /* Allocate SIZE bytes writable static space with a gensym name
1810 and return an RTX to refer to its address. */
1813 assemble_static_space (size
)
1821 if (flag_shared_data
)
1825 ASM_GENERATE_INTERNAL_LABEL (name
, "LF", const_labelno
);
1827 namestring
= ggc_alloc_string (name
, -1);
1829 x
= gen_rtx_SYMBOL_REF (Pmode
, namestring
);
1831 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
1832 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file
, NULL_TREE
, name
, size
,
1835 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1836 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file
, name
, size
, BIGGEST_ALIGNMENT
);
1839 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1840 so that each uninitialized object starts on such a boundary. */
1841 /* Variable `rounded' might or might not be used in ASM_OUTPUT_LOCAL. */
1842 int rounded ATTRIBUTE_UNUSED
1843 = ((size
+ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1)
1844 / (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1845 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1846 ASM_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
1853 /* Assemble the static constant template for function entry trampolines.
1854 This is done at most once per compilation.
1855 Returns an RTX for the address of the template. */
1857 #ifdef TRAMPOLINE_TEMPLATE
1859 assemble_trampoline_template ()
1865 /* By default, put trampoline templates in read-only data section. */
1867 #ifdef TRAMPOLINE_SECTION
1868 TRAMPOLINE_SECTION ();
1870 readonly_data_section ();
1873 /* Write the assembler code to define one. */
1874 align
= floor_log2 (TRAMPOLINE_ALIGNMENT
/ BITS_PER_UNIT
);
1876 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1878 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LTRAMP", 0);
1879 TRAMPOLINE_TEMPLATE (asm_out_file
);
1881 /* Record the rtl to refer to it. */
1882 ASM_GENERATE_INTERNAL_LABEL (label
, "LTRAMP", 0);
1883 name
= ggc_alloc_string (label
, -1);
1884 return gen_rtx_SYMBOL_REF (Pmode
, name
);
1888 /* Assemble the integer constant X into an object of SIZE bytes.
1889 X must be either a CONST_INT or CONST_DOUBLE.
1891 Return 1 if we were able to output the constant, otherwise 0. If FORCE is
1892 non-zero, abort if we can't output the constant. */
1895 assemble_integer (x
, size
, force
)
1900 /* First try to use the standard 1, 2, 4, 8, and 16 byte
1901 ASM_OUTPUT... macros. */
1905 #ifdef ASM_OUTPUT_CHAR
1907 ASM_OUTPUT_CHAR (asm_out_file
, x
);
1911 #ifdef ASM_OUTPUT_SHORT
1913 ASM_OUTPUT_SHORT (asm_out_file
, x
);
1917 #ifdef ASM_OUTPUT_INT
1919 ASM_OUTPUT_INT (asm_out_file
, x
);
1923 #ifdef ASM_OUTPUT_DOUBLE_INT
1925 ASM_OUTPUT_DOUBLE_INT (asm_out_file
, x
);
1929 #ifdef ASM_OUTPUT_QUADRUPLE_INT
1931 ASM_OUTPUT_QUADRUPLE_INT (asm_out_file
, x
);
1936 /* If we couldn't do it that way, there are two other possibilities: First,
1937 if the machine can output an explicit byte and this is a 1 byte constant,
1938 we can use ASM_OUTPUT_BYTE. */
1940 #ifdef ASM_OUTPUT_BYTE
1941 if (size
== 1 && GET_CODE (x
) == CONST_INT
)
1943 ASM_OUTPUT_BYTE (asm_out_file
, INTVAL (x
));
1948 /* Finally, if SIZE is larger than a single word, try to output the constant
1949 one word at a time. */
1951 if (size
> UNITS_PER_WORD
)
1954 enum machine_mode mode
1955 = mode_for_size (size
* BITS_PER_UNIT
, MODE_INT
, 0);
1958 for (i
= 0; i
< size
/ UNITS_PER_WORD
; i
++)
1960 word
= operand_subword (x
, i
, 0, mode
);
1965 if (! assemble_integer (word
, UNITS_PER_WORD
, 0))
1969 if (i
== size
/ UNITS_PER_WORD
)
1971 /* If we output at least one word and then could not finish,
1972 there is no valid way to continue. */
1983 /* Assemble the floating-point constant D into an object of size MODE. */
1986 assemble_real (d
, mode
)
1988 enum machine_mode mode
;
1990 jmp_buf output_constant_handler
;
1992 if (setjmp (output_constant_handler
))
1994 error ("floating point trap outputting a constant");
1995 #ifdef REAL_IS_NOT_DOUBLE
1996 bzero ((char *) &d
, sizeof d
);
2003 set_float_handler (output_constant_handler
);
2007 #ifdef ASM_OUTPUT_BYTE_FLOAT
2009 ASM_OUTPUT_BYTE_FLOAT (asm_out_file
, d
);
2012 #ifdef ASM_OUTPUT_SHORT_FLOAT
2014 ASM_OUTPUT_SHORT_FLOAT (asm_out_file
, d
);
2017 #ifdef ASM_OUTPUT_THREE_QUARTER_FLOAT
2019 ASM_OUTPUT_THREE_QUARTER_FLOAT (asm_out_file
, d
);
2022 #ifdef ASM_OUTPUT_FLOAT
2024 ASM_OUTPUT_FLOAT (asm_out_file
, d
);
2028 #ifdef ASM_OUTPUT_DOUBLE
2030 ASM_OUTPUT_DOUBLE (asm_out_file
, d
);
2034 #ifdef ASM_OUTPUT_LONG_DOUBLE
2037 ASM_OUTPUT_LONG_DOUBLE (asm_out_file
, d
);
2045 set_float_handler (NULL_PTR
);
2048 /* Here we combine duplicate floating constants to make
2049 CONST_DOUBLE rtx's, and force those out to memory when necessary. */
2051 /* Return a CONST_DOUBLE or CONST_INT for a value specified as a pair of ints.
2052 For an integer, I0 is the low-order word and I1 is the high-order word.
2053 For a real number, I0 is the word with the low address
2054 and I1 is the word with the high address. */
2057 immed_double_const (i0
, i1
, mode
)
2058 HOST_WIDE_INT i0
, i1
;
2059 enum machine_mode mode
;
2063 if (GET_MODE_CLASS (mode
) == MODE_INT
2064 || GET_MODE_CLASS (mode
) == MODE_PARTIAL_INT
)
2066 /* We clear out all bits that don't belong in MODE, unless they and our
2067 sign bit are all one. So we get either a reasonable negative value
2068 or a reasonable unsigned value for this mode. */
2069 int width
= GET_MODE_BITSIZE (mode
);
2070 if (width
< HOST_BITS_PER_WIDE_INT
2071 && ((i0
& ((HOST_WIDE_INT
) (-1) << (width
- 1)))
2072 != ((HOST_WIDE_INT
) (-1) << (width
- 1))))
2073 i0
&= ((HOST_WIDE_INT
) 1 << width
) - 1, i1
= 0;
2074 else if (width
== HOST_BITS_PER_WIDE_INT
2075 && ! (i1
== ~0 && i0
< 0))
2077 else if (width
> 2 * HOST_BITS_PER_WIDE_INT
)
2078 /* We cannot represent this value as a constant. */
2081 /* If this would be an entire word for the target, but is not for
2082 the host, then sign-extend on the host so that the number will look
2083 the same way on the host that it would on the target.
2085 For example, when building a 64 bit alpha hosted 32 bit sparc
2086 targeted compiler, then we want the 32 bit unsigned value -1 to be
2087 represented as a 64 bit value -1, and not as 0x00000000ffffffff.
2088 The later confuses the sparc backend. */
2090 if (BITS_PER_WORD
< HOST_BITS_PER_WIDE_INT
&& BITS_PER_WORD
== width
2091 && (i0
& ((HOST_WIDE_INT
) 1 << (width
- 1))))
2092 i0
|= ((HOST_WIDE_INT
) (-1) << width
);
2094 /* If MODE fits within HOST_BITS_PER_WIDE_INT, always use a CONST_INT.
2096 ??? Strictly speaking, this is wrong if we create a CONST_INT
2097 for a large unsigned constant with the size of MODE being
2098 HOST_BITS_PER_WIDE_INT and later try to interpret that constant in a
2099 wider mode. In that case we will mis-interpret it as a negative
2102 Unfortunately, the only alternative is to make a CONST_DOUBLE
2103 for any constant in any mode if it is an unsigned constant larger
2104 than the maximum signed integer in an int on the host. However,
2105 doing this will break everyone that always expects to see a CONST_INT
2106 for SImode and smaller.
2108 We have always been making CONST_INTs in this case, so nothing new
2111 if (width
<= HOST_BITS_PER_WIDE_INT
)
2112 i1
= (i0
< 0) ? ~(HOST_WIDE_INT
) 0 : 0;
2114 /* If this integer fits in one word, return a CONST_INT. */
2115 if ((i1
== 0 && i0
>= 0)
2116 || (i1
== ~0 && i0
< 0))
2117 return GEN_INT (i0
);
2119 /* We use VOIDmode for integers. */
2123 /* Search the chain for an existing CONST_DOUBLE with the right value.
2124 If one is found, return it. */
2126 for (r
= const_double_chain
; r
; r
= CONST_DOUBLE_CHAIN (r
))
2127 if (CONST_DOUBLE_LOW (r
) == i0
&& CONST_DOUBLE_HIGH (r
) == i1
2128 && GET_MODE (r
) == mode
)
2131 /* No; make a new one and add it to the chain.
2133 We may be called by an optimizer which may be discarding any memory
2134 allocated during its processing (such as combine and loop). However,
2135 we will be leaving this constant on the chain, so we cannot tolerate
2136 freed memory. So switch to saveable_obstack for this allocation
2137 and then switch back if we were in current_obstack. */
2139 push_obstacks_nochange ();
2140 rtl_in_saveable_obstack ();
2141 r
= gen_rtx_CONST_DOUBLE (mode
, NULL_RTX
, i0
, i1
);
2144 /* Don't touch const_double_chain if not inside any function. */
2145 if (current_function_decl
!= 0)
2147 CONST_DOUBLE_CHAIN (r
) = const_double_chain
;
2148 const_double_chain
= r
;
2151 /* Store const0_rtx in mem-slot since this CONST_DOUBLE is on the chain.
2152 Actual use of mem-slot is only through force_const_mem. */
2154 CONST_DOUBLE_MEM (r
) = const0_rtx
;
2159 /* Return a CONST_DOUBLE for a specified `double' value
2160 and machine mode. */
2163 immed_real_const_1 (d
, mode
)
2165 enum machine_mode mode
;
2167 union real_extract u
;
2170 /* Get the desired `double' value as a sequence of ints
2171 since that is how they are stored in a CONST_DOUBLE. */
2175 /* Detect special cases. */
2177 if (REAL_VALUES_IDENTICAL (dconst0
, d
))
2178 return CONST0_RTX (mode
);
2179 /* Check for NaN first, because some ports (specifically the i386) do not
2180 emit correct ieee-fp code by default, and thus will generate a core
2181 dump here if we pass a NaN to REAL_VALUES_EQUAL and if REAL_VALUES_EQUAL
2182 does a floating point comparison. */
2183 else if (! REAL_VALUE_ISNAN (d
) && REAL_VALUES_EQUAL (dconst1
, d
))
2184 return CONST1_RTX (mode
);
2186 if (sizeof u
== sizeof (HOST_WIDE_INT
))
2187 return immed_double_const (u
.i
[0], 0, mode
);
2188 if (sizeof u
== 2 * sizeof (HOST_WIDE_INT
))
2189 return immed_double_const (u
.i
[0], u
.i
[1], mode
);
2191 /* The rest of this function handles the case where
2192 a float value requires more than 2 ints of space.
2193 It will be deleted as dead code on machines that don't need it. */
2195 /* Search the chain for an existing CONST_DOUBLE with the right value.
2196 If one is found, return it. */
2198 for (r
= const_double_chain
; r
; r
= CONST_DOUBLE_CHAIN (r
))
2199 if (! bcmp ((char *) &CONST_DOUBLE_LOW (r
), (char *) &u
, sizeof u
)
2200 && GET_MODE (r
) == mode
)
2203 /* No; make a new one and add it to the chain.
2205 We may be called by an optimizer which may be discarding any memory
2206 allocated during its processing (such as combine and loop). However,
2207 we will be leaving this constant on the chain, so we cannot tolerate
2208 freed memory. So switch to saveable_obstack for this allocation
2209 and then switch back if we were in current_obstack. */
2210 push_obstacks_nochange ();
2211 rtl_in_saveable_obstack ();
2212 r
= rtx_alloc (CONST_DOUBLE
);
2215 bcopy ((char *) &u
, (char *) &CONST_DOUBLE_LOW (r
), sizeof u
);
2217 /* Don't touch const_double_chain if not inside any function. */
2218 if (current_function_decl
!= 0)
2220 CONST_DOUBLE_CHAIN (r
) = const_double_chain
;
2221 const_double_chain
= r
;
2224 /* Store const0_rtx in CONST_DOUBLE_MEM since this CONST_DOUBLE is on the
2225 chain, but has not been allocated memory. Actual use of CONST_DOUBLE_MEM
2226 is only through force_const_mem. */
2228 CONST_DOUBLE_MEM (r
) = const0_rtx
;
2233 /* Return a CONST_DOUBLE rtx for a value specified by EXP,
2234 which must be a REAL_CST tree node. */
2237 immed_real_const (exp
)
2240 return immed_real_const_1 (TREE_REAL_CST (exp
), TYPE_MODE (TREE_TYPE (exp
)));
2243 /* At the end of a function, forget the memory-constants
2244 previously made for CONST_DOUBLEs. Mark them as not on real_constant_chain.
2245 Also clear out real_constant_chain and clear out all the chain-pointers. */
2248 clear_const_double_mem ()
2250 register rtx r
, next
;
2252 for (r
= const_double_chain
; r
; r
= next
)
2254 next
= CONST_DOUBLE_CHAIN (r
);
2255 CONST_DOUBLE_CHAIN (r
) = 0;
2256 CONST_DOUBLE_MEM (r
) = cc0_rtx
;
2258 const_double_chain
= 0;
2261 /* Given an expression EXP with a constant value,
2262 reduce it to the sum of an assembler symbol and an integer.
2263 Store them both in the structure *VALUE.
2264 Abort if EXP does not reduce. */
2269 HOST_WIDE_INT offset
;
2273 decode_addr_const (exp
, value
)
2275 struct addr_const
*value
;
2277 register tree target
= TREE_OPERAND (exp
, 0);
2278 register int offset
= 0;
2283 if (TREE_CODE (target
) == COMPONENT_REF
2284 && (TREE_CODE (DECL_FIELD_BITPOS (TREE_OPERAND (target
, 1)))
2287 offset
+= TREE_INT_CST_LOW (DECL_FIELD_BITPOS (TREE_OPERAND (target
, 1))) / BITS_PER_UNIT
;
2288 target
= TREE_OPERAND (target
, 0);
2290 else if (TREE_CODE (target
) == ARRAY_REF
)
2292 if (TREE_CODE (TREE_OPERAND (target
, 1)) != INTEGER_CST
2293 || TREE_CODE (TYPE_SIZE (TREE_TYPE (target
))) != INTEGER_CST
)
2295 offset
+= ((TREE_INT_CST_LOW (TYPE_SIZE (TREE_TYPE (target
)))
2296 * TREE_INT_CST_LOW (TREE_OPERAND (target
, 1)))
2298 target
= TREE_OPERAND (target
, 0);
2304 switch (TREE_CODE (target
))
2308 x
= DECL_RTL (target
);
2312 x
= gen_rtx_MEM (FUNCTION_MODE
,
2313 gen_rtx_LABEL_REF (VOIDmode
,
2314 label_rtx (TREE_OPERAND (exp
, 0))));
2322 x
= TREE_CST_RTL (target
);
2329 if (GET_CODE (x
) != MEM
)
2334 value
->offset
= offset
;
2337 /* Uniquize all constants that appear in memory.
2338 Each constant in memory thus far output is recorded
2339 in `const_hash_table' with a `struct constant_descriptor'
2340 that contains a polish representation of the value of
2343 We cannot store the trees in the hash table
2344 because the trees may be temporary. */
2346 struct constant_descriptor
2348 struct constant_descriptor
*next
;
2355 #define MAX_HASH_TABLE 1009
2356 static struct constant_descriptor
*const_hash_table
[MAX_HASH_TABLE
];
2358 /* Mark a const_hash_table descriptor for GC. */
2361 mark_const_hash_entry (ptr
)
2364 struct constant_descriptor
*desc
= * (struct constant_descriptor
**) ptr
;
2368 ggc_mark_string (desc
->label
);
2369 ggc_mark_rtx (desc
->rtl
);
2374 /* Compute a hash code for a constant expression. */
2380 register const char *p
;
2381 register int len
, hi
, i
;
2382 register enum tree_code code
= TREE_CODE (exp
);
2384 /* Either set P and LEN to the address and len of something to hash and
2385 exit the switch or return a value. */
2390 p
= (char *) &TREE_INT_CST_LOW (exp
);
2391 len
= 2 * sizeof TREE_INT_CST_LOW (exp
);
2395 p
= (char *) &TREE_REAL_CST (exp
);
2396 len
= sizeof TREE_REAL_CST (exp
);
2400 p
= TREE_STRING_POINTER (exp
);
2401 len
= TREE_STRING_LENGTH (exp
);
2405 return (const_hash (TREE_REALPART (exp
)) * 5
2406 + const_hash (TREE_IMAGPART (exp
)));
2409 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2413 len
= int_size_in_bytes (TREE_TYPE (exp
));
2414 tmp
= (char *) alloca (len
);
2415 get_set_constructor_bytes (exp
, (unsigned char *) tmp
, len
);
2423 /* For record type, include the type in the hashing.
2424 We do not do so for array types
2425 because (1) the sizes of the elements are sufficient
2426 and (2) distinct array types can have the same constructor.
2427 Instead, we include the array size because the constructor could
2429 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2430 hi
= ((unsigned long) TREE_TYPE (exp
) & ((1 << HASHBITS
) - 1))
2433 hi
= ((5 + int_size_in_bytes (TREE_TYPE (exp
)))
2434 & ((1 << HASHBITS
) - 1)) % MAX_HASH_TABLE
;
2436 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2437 if (TREE_VALUE (link
))
2439 = (hi
* 603 + const_hash (TREE_VALUE (link
))) % MAX_HASH_TABLE
;
2446 struct addr_const value
;
2448 decode_addr_const (exp
, &value
);
2449 if (GET_CODE (value
.base
) == SYMBOL_REF
)
2451 /* Don't hash the address of the SYMBOL_REF;
2452 only use the offset and the symbol name. */
2454 p
= XSTR (value
.base
, 0);
2455 for (i
= 0; p
[i
] != 0; i
++)
2456 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2458 else if (GET_CODE (value
.base
) == LABEL_REF
)
2459 hi
= value
.offset
+ CODE_LABEL_NUMBER (XEXP (value
.base
, 0)) * 13;
2463 hi
&= (1 << HASHBITS
) - 1;
2464 hi
%= MAX_HASH_TABLE
;
2470 return (const_hash (TREE_OPERAND (exp
, 0)) * 9
2471 + const_hash (TREE_OPERAND (exp
, 1)));
2475 case NON_LVALUE_EXPR
:
2476 return const_hash (TREE_OPERAND (exp
, 0)) * 7 + 2;
2482 /* Compute hashing function */
2484 for (i
= 0; i
< len
; i
++)
2485 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2487 hi
&= (1 << HASHBITS
) - 1;
2488 hi
%= MAX_HASH_TABLE
;
2492 /* Compare a constant expression EXP with a constant-descriptor DESC.
2493 Return 1 if DESC describes a constant with the same value as EXP. */
2496 compare_constant (exp
, desc
)
2498 struct constant_descriptor
*desc
;
2500 return 0 != compare_constant_1 (exp
, desc
->contents
);
2503 /* Compare constant expression EXP with a substring P of a constant descriptor.
2504 If they match, return a pointer to the end of the substring matched.
2505 If they do not match, return 0.
2507 Since descriptors are written in polish prefix notation,
2508 this function can be used recursively to test one operand of EXP
2509 against a subdescriptor, and if it succeeds it returns the
2510 address of the subdescriptor for the next operand. */
2513 compare_constant_1 (exp
, p
)
2517 register const char *strp
;
2519 register enum tree_code code
= TREE_CODE (exp
);
2521 if (code
!= (enum tree_code
) *p
++)
2524 /* Either set STRP, P and LEN to pointers and length to compare and exit the
2525 switch, or return the result of the comparison. */
2530 /* Integer constants are the same only if the same width of type. */
2531 if (*p
++ != TYPE_PRECISION (TREE_TYPE (exp
)))
2534 strp
= (char *) &TREE_INT_CST_LOW (exp
);
2535 len
= 2 * sizeof TREE_INT_CST_LOW (exp
);
2539 /* Real constants are the same only if the same width of type. */
2540 if (*p
++ != TYPE_PRECISION (TREE_TYPE (exp
)))
2543 strp
= (char *) &TREE_REAL_CST (exp
);
2544 len
= sizeof TREE_REAL_CST (exp
);
2548 if (flag_writable_strings
)
2551 if ((enum machine_mode
) *p
++ != TYPE_MODE (TREE_TYPE (exp
)))
2554 strp
= TREE_STRING_POINTER (exp
);
2555 len
= TREE_STRING_LENGTH (exp
);
2556 if (bcmp ((char *) &TREE_STRING_LENGTH (exp
), p
,
2557 sizeof TREE_STRING_LENGTH (exp
)))
2560 p
+= sizeof TREE_STRING_LENGTH (exp
);
2564 p
= compare_constant_1 (TREE_REALPART (exp
), p
);
2568 return compare_constant_1 (TREE_IMAGPART (exp
), p
);
2571 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2573 int xlen
= len
= int_size_in_bytes (TREE_TYPE (exp
));
2574 unsigned char *tmp
= (unsigned char *) alloca (len
);
2576 get_set_constructor_bytes (exp
, (unsigned char *) tmp
, len
);
2578 if (bcmp ((char *) &xlen
, p
, sizeof xlen
))
2587 int length
= list_length (CONSTRUCTOR_ELTS (exp
));
2589 enum machine_mode mode
= TYPE_MODE (TREE_TYPE (exp
));
2590 int have_purpose
= 0;
2592 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2593 if (TREE_PURPOSE (link
))
2596 if (bcmp ((char *) &length
, p
, sizeof length
))
2601 /* For record constructors, insist that the types match.
2602 For arrays, just verify both constructors are for arrays.
2603 Then insist that either both or none have any TREE_PURPOSE
2605 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2606 type
= TREE_TYPE (exp
);
2610 if (bcmp ((char *) &type
, p
, sizeof type
))
2613 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2615 if (bcmp ((char *) &mode
, p
, sizeof mode
))
2623 if (bcmp ((char *) &have_purpose
, p
, sizeof have_purpose
))
2626 p
+= sizeof have_purpose
;
2628 /* For arrays, insist that the size in bytes match. */
2629 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2631 HOST_WIDE_INT size
= int_size_in_bytes (TREE_TYPE (exp
));
2633 if (bcmp ((char *) &size
, p
, sizeof size
))
2639 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2641 if (TREE_VALUE (link
))
2643 if ((p
= compare_constant_1 (TREE_VALUE (link
), p
)) == 0)
2650 if (bcmp ((char *) &zero
, p
, sizeof zero
))
2656 if (TREE_PURPOSE (link
)
2657 && TREE_CODE (TREE_PURPOSE (link
)) == FIELD_DECL
)
2659 if (bcmp ((char *) &TREE_PURPOSE (link
), p
,
2660 sizeof TREE_PURPOSE (link
)))
2663 p
+= sizeof TREE_PURPOSE (link
);
2665 else if (TREE_PURPOSE (link
))
2667 if ((p
= compare_constant_1 (TREE_PURPOSE (link
), p
)) == 0)
2670 else if (have_purpose
)
2674 if (bcmp ((char *) &zero
, p
, sizeof zero
))
2686 struct addr_const value
;
2688 decode_addr_const (exp
, &value
);
2689 strp
= (char *) &value
.offset
;
2690 len
= sizeof value
.offset
;
2691 /* Compare the offset. */
2693 if (*p
++ != *strp
++)
2696 /* Compare symbol name. */
2697 strp
= XSTR (value
.base
, 0);
2698 len
= strlen (strp
) + 1;
2705 p
= compare_constant_1 (TREE_OPERAND (exp
, 0), p
);
2709 return compare_constant_1 (TREE_OPERAND (exp
, 1), p
);
2713 case NON_LVALUE_EXPR
:
2714 return compare_constant_1 (TREE_OPERAND (exp
, 0), p
);
2720 /* Compare constant contents. */
2722 if (*p
++ != *strp
++)
2728 /* Construct a constant descriptor for the expression EXP.
2729 It is up to the caller to enter the descriptor in the hash table. */
2731 static struct constant_descriptor
*
2732 record_constant (exp
)
2735 struct constant_descriptor
*next
= 0;
2739 /* Make a struct constant_descriptor. The first three pointers will
2740 be filled in later. Here we just leave space for them. */
2742 obstack_grow (&permanent_obstack
, (char *) &next
, sizeof next
);
2743 obstack_grow (&permanent_obstack
, (char *) &label
, sizeof label
);
2744 obstack_grow (&permanent_obstack
, (char *) &rtl
, sizeof rtl
);
2745 record_constant_1 (exp
);
2746 return (struct constant_descriptor
*) obstack_finish (&permanent_obstack
);
2749 /* Add a description of constant expression EXP
2750 to the object growing in `permanent_obstack'.
2751 No need to return its address; the caller will get that
2752 from the obstack when the object is complete. */
2755 record_constant_1 (exp
)
2758 register char *strp
;
2760 register enum tree_code code
= TREE_CODE (exp
);
2762 obstack_1grow (&permanent_obstack
, (unsigned int) code
);
2767 obstack_1grow (&permanent_obstack
, TYPE_PRECISION (TREE_TYPE (exp
)));
2768 strp
= (char *) &TREE_INT_CST_LOW (exp
);
2769 len
= 2 * sizeof TREE_INT_CST_LOW (exp
);
2773 obstack_1grow (&permanent_obstack
, TYPE_PRECISION (TREE_TYPE (exp
)));
2774 strp
= (char *) &TREE_REAL_CST (exp
);
2775 len
= sizeof TREE_REAL_CST (exp
);
2779 if (flag_writable_strings
)
2782 obstack_1grow (&permanent_obstack
, TYPE_MODE (TREE_TYPE (exp
)));
2783 strp
= TREE_STRING_POINTER (exp
);
2784 len
= TREE_STRING_LENGTH (exp
);
2785 obstack_grow (&permanent_obstack
, (char *) &TREE_STRING_LENGTH (exp
),
2786 sizeof TREE_STRING_LENGTH (exp
));
2790 record_constant_1 (TREE_REALPART (exp
));
2791 record_constant_1 (TREE_IMAGPART (exp
));
2795 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2797 int nbytes
= int_size_in_bytes (TREE_TYPE (exp
));
2798 obstack_grow (&permanent_obstack
, &nbytes
, sizeof (nbytes
));
2799 obstack_blank (&permanent_obstack
, nbytes
);
2800 get_set_constructor_bytes
2801 (exp
, (unsigned char *) permanent_obstack
.next_free
-nbytes
,
2808 int length
= list_length (CONSTRUCTOR_ELTS (exp
));
2809 enum machine_mode mode
= TYPE_MODE (TREE_TYPE (exp
));
2811 int have_purpose
= 0;
2813 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2814 if (TREE_PURPOSE (link
))
2817 obstack_grow (&permanent_obstack
, (char *) &length
, sizeof length
);
2819 /* For record constructors, insist that the types match.
2820 For arrays, just verify both constructors are for arrays
2821 of the same mode. Then insist that either both or none
2822 have any TREE_PURPOSE values. */
2823 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2824 type
= TREE_TYPE (exp
);
2828 obstack_grow (&permanent_obstack
, (char *) &type
, sizeof type
);
2829 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2830 obstack_grow (&permanent_obstack
, &mode
, sizeof mode
);
2832 obstack_grow (&permanent_obstack
, (char *) &have_purpose
,
2833 sizeof have_purpose
);
2835 /* For arrays, insist that the size in bytes match. */
2836 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2838 HOST_WIDE_INT size
= int_size_in_bytes (TREE_TYPE (exp
));
2839 obstack_grow (&permanent_obstack
, (char *) &size
, sizeof size
);
2842 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2844 if (TREE_VALUE (link
))
2845 record_constant_1 (TREE_VALUE (link
));
2850 obstack_grow (&permanent_obstack
,
2851 (char *) &zero
, sizeof zero
);
2854 if (TREE_PURPOSE (link
)
2855 && TREE_CODE (TREE_PURPOSE (link
)) == FIELD_DECL
)
2856 obstack_grow (&permanent_obstack
,
2857 (char *) &TREE_PURPOSE (link
),
2858 sizeof TREE_PURPOSE (link
));
2859 else if (TREE_PURPOSE (link
))
2860 record_constant_1 (TREE_PURPOSE (link
));
2861 else if (have_purpose
)
2865 obstack_grow (&permanent_obstack
,
2866 (char *) &zero
, sizeof zero
);
2874 struct addr_const value
;
2876 decode_addr_const (exp
, &value
);
2877 /* Record the offset. */
2878 obstack_grow (&permanent_obstack
,
2879 (char *) &value
.offset
, sizeof value
.offset
);
2880 /* Record the symbol name. */
2881 obstack_grow (&permanent_obstack
, XSTR (value
.base
, 0),
2882 strlen (XSTR (value
.base
, 0)) + 1);
2889 record_constant_1 (TREE_OPERAND (exp
, 0));
2890 record_constant_1 (TREE_OPERAND (exp
, 1));
2895 case NON_LVALUE_EXPR
:
2896 record_constant_1 (TREE_OPERAND (exp
, 0));
2903 /* Record constant contents. */
2904 obstack_grow (&permanent_obstack
, strp
, len
);
2907 /* Record a list of constant expressions that were passed to
2908 output_constant_def but that could not be output right away. */
2910 struct deferred_constant
2912 struct deferred_constant
*next
;
2918 static struct deferred_constant
*deferred_constants
;
2920 /* Another list of constants which should be output after the
2922 static struct deferred_constant
*after_function_constants
;
2924 /* Nonzero means defer output of addressed subconstants
2925 (i.e., those for which output_constant_def is called.) */
2926 static int defer_addressed_constants_flag
;
2928 /* Start deferring output of subconstants. */
2931 defer_addressed_constants ()
2933 defer_addressed_constants_flag
++;
2936 /* Stop deferring output of subconstants,
2937 and output now all those that have been deferred. */
2940 output_deferred_addressed_constants ()
2942 struct deferred_constant
*p
, *next
;
2944 defer_addressed_constants_flag
--;
2946 if (defer_addressed_constants_flag
> 0)
2949 for (p
= deferred_constants
; p
; p
= next
)
2951 output_constant_def_contents (p
->exp
, p
->reloc
, p
->labelno
);
2956 deferred_constants
= 0;
2959 /* Output any constants which should appear after a function. */
2962 output_after_function_constants ()
2964 struct deferred_constant
*p
, *next
;
2966 for (p
= after_function_constants
; p
; p
= next
)
2968 output_constant_def_contents (p
->exp
, p
->reloc
, p
->labelno
);
2973 after_function_constants
= 0;
2976 /* Make a copy of the whole tree structure for a constant.
2977 This handles the same types of nodes that compare_constant
2978 and record_constant handle. */
2984 switch (TREE_CODE (exp
))
2987 /* For ADDR_EXPR, we do not want to copy the decl whose address
2988 is requested. We do want to copy constants though. */
2989 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, 0))) == 'c')
2990 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2991 copy_constant (TREE_OPERAND (exp
, 0)));
2993 return copy_node (exp
);
2998 return copy_node (exp
);
3001 return build_complex (TREE_TYPE (exp
),
3002 copy_constant (TREE_REALPART (exp
)),
3003 copy_constant (TREE_IMAGPART (exp
)));
3007 return build (TREE_CODE (exp
), TREE_TYPE (exp
),
3008 copy_constant (TREE_OPERAND (exp
, 0)),
3009 copy_constant (TREE_OPERAND (exp
, 1)));
3013 case NON_LVALUE_EXPR
:
3014 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
3015 copy_constant (TREE_OPERAND (exp
, 0)));
3019 tree copy
= copy_node (exp
);
3020 tree list
= copy_list (CONSTRUCTOR_ELTS (exp
));
3023 CONSTRUCTOR_ELTS (copy
) = list
;
3024 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
3025 TREE_VALUE (tail
) = copy_constant (TREE_VALUE (tail
));
3026 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
3027 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
3028 TREE_PURPOSE (tail
) = copy_constant (TREE_PURPOSE (tail
));
3038 /* Return an rtx representing a reference to constant data in memory
3039 for the constant expression EXP.
3041 If assembler code for such a constant has already been output,
3042 return an rtx to refer to it.
3043 Otherwise, output such a constant in memory (or defer it for later)
3044 and generate an rtx for it.
3046 The TREE_CST_RTL of EXP is set up to point to that rtx.
3047 The const_hash_table records which constants already have label strings. */
3050 output_constant_def (exp
)
3054 register struct constant_descriptor
*desc
;
3059 if (TREE_CST_RTL (exp
))
3060 return TREE_CST_RTL (exp
);
3062 /* Make sure any other constants whose addresses appear in EXP
3063 are assigned label numbers. */
3065 reloc
= output_addressed_constants (exp
);
3067 /* Compute hash code of EXP. Search the descriptors for that hash code
3068 to see if any of them describes EXP. If yes, the descriptor records
3069 the label number already assigned. */
3071 hash
= const_hash (exp
) % MAX_HASH_TABLE
;
3073 for (desc
= const_hash_table
[hash
]; desc
; desc
= desc
->next
)
3074 if (compare_constant (exp
, desc
))
3079 /* No constant equal to EXP is known to have been output.
3080 Make a constant descriptor to enter EXP in the hash table.
3081 Assign the label number and record it in the descriptor for
3082 future calls to this function to find. */
3084 /* Create a string containing the label name, in LABEL. */
3085 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
3087 desc
= record_constant (exp
);
3088 desc
->next
= const_hash_table
[hash
];
3089 desc
->label
= ggc_alloc_string (label
, -1);
3090 const_hash_table
[hash
] = desc
;
3092 /* We have a symbol name; construct the SYMBOL_REF and the MEM
3093 in the permanent obstack. We could also construct this in the
3094 obstack of EXP and put it into TREE_CST_RTL, but we have no way
3095 of knowing what obstack it is (e.g., it might be in a function
3096 obstack of a function we are nested inside). */
3098 push_obstacks_nochange ();
3099 end_temporary_allocation ();
3102 = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp
)),
3103 gen_rtx_SYMBOL_REF (Pmode
, desc
->label
));
3105 RTX_UNCHANGING_P (desc
->rtl
) = 1;
3106 if (AGGREGATE_TYPE_P (TREE_TYPE (exp
)))
3107 MEM_SET_IN_STRUCT_P (desc
->rtl
, 1);
3114 TREE_CST_RTL (exp
) = desc
->rtl
;
3116 /* Optionally set flags or add text to the name to record information
3117 such as that it is a function name. If the name is changed, the macro
3118 ASM_OUTPUT_LABELREF will have to know how to strip this information. */
3119 #ifdef ENCODE_SECTION_INFO
3120 ENCODE_SECTION_INFO (exp
);
3123 /* If this is the first time we've seen this particular constant,
3124 output it (or defer its output for later). */
3127 int after_function
= 0;
3129 #ifdef CONSTANT_AFTER_FUNCTION_P
3130 if (current_function_decl
!= 0
3131 && CONSTANT_AFTER_FUNCTION_P (exp
))
3135 if (defer_addressed_constants_flag
|| after_function
)
3137 struct deferred_constant
*p
;
3138 p
= (struct deferred_constant
*) xmalloc (sizeof (struct deferred_constant
));
3140 push_obstacks_nochange ();
3141 suspend_momentary ();
3142 p
->exp
= copy_constant (exp
);
3145 p
->labelno
= const_labelno
++;
3148 p
->next
= after_function_constants
;
3149 after_function_constants
= p
;
3153 p
->next
= deferred_constants
;
3154 deferred_constants
= p
;
3159 /* Do no output if -fsyntax-only. */
3160 if (! flag_syntax_only
)
3161 output_constant_def_contents (exp
, reloc
, const_labelno
);
3166 return TREE_CST_RTL (exp
);
3169 /* Now output assembler code to define the label for EXP,
3170 and follow it with the data of EXP. */
3173 output_constant_def_contents (exp
, reloc
, labelno
)
3180 if (IN_NAMED_SECTION (exp
))
3181 named_section (exp
, NULL
, reloc
);
3184 /* First switch to text section, except for writable strings. */
3185 #ifdef SELECT_SECTION
3186 SELECT_SECTION (exp
, reloc
);
3188 if (((TREE_CODE (exp
) == STRING_CST
) && flag_writable_strings
)
3189 || (flag_pic
&& reloc
))
3192 readonly_data_section ();
3196 /* Align the location counter as required by EXP's data type. */
3197 align
= TYPE_ALIGN (TREE_TYPE (exp
));
3198 #ifdef CONSTANT_ALIGNMENT
3199 align
= CONSTANT_ALIGNMENT (exp
, align
);
3202 if (align
> BITS_PER_UNIT
)
3203 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
3205 /* Output the label itself. */
3206 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LC", labelno
);
3208 /* Output the value of EXP. */
3209 output_constant (exp
,
3210 (TREE_CODE (exp
) == STRING_CST
3211 ? TREE_STRING_LENGTH (exp
)
3212 : int_size_in_bytes (TREE_TYPE (exp
))));
3216 /* Structure to represent sufficient information about a constant so that
3217 it can be output when the constant pool is output, so that function
3218 integration can be done, and to simplify handling on machines that reference
3219 constant pool as base+displacement. */
3221 struct pool_constant
3223 struct constant_descriptor
*desc
;
3224 struct pool_constant
*next
;
3225 enum machine_mode mode
;
3233 /* Structure used to maintain hash table mapping symbols used to their
3234 corresponding constants. */
3239 struct pool_constant
*pool
;
3240 struct pool_sym
*next
;
3243 /* Hash code for a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true.
3244 The argument is XSTR (... , 0) */
3246 #define SYMHASH(LABEL) \
3247 ((((unsigned long) (LABEL)) & ((1 << HASHBITS) - 1)) % MAX_RTX_HASH_TABLE)
3249 /* Initialize constant pool hashing for a new function. */
3252 init_varasm_status (f
)
3255 struct varasm_status
*p
;
3256 p
= (struct varasm_status
*) xmalloc (sizeof (struct varasm_status
));
3258 p
->x_const_rtx_hash_table
3259 = ((struct constant_descriptor
**)
3260 xmalloc (MAX_RTX_HASH_TABLE
* sizeof (struct constant_descriptor
*)));
3261 p
->x_const_rtx_sym_hash_table
3262 = ((struct pool_sym
**)
3263 xmalloc (MAX_RTX_HASH_TABLE
* sizeof (struct pool_sym
*)));
3264 bzero ((char *) p
->x_const_rtx_hash_table
,
3265 MAX_RTX_HASH_TABLE
* sizeof (struct constant_descriptor
*));
3266 bzero ((char *) p
->x_const_rtx_sym_hash_table
,
3267 MAX_RTX_HASH_TABLE
* sizeof (struct pool_sym
*));
3269 p
->x_first_pool
= p
->x_last_pool
= 0;
3270 p
->x_pool_offset
= 0;
3271 p
->x_const_double_chain
= 0;
3274 /* Mark PC for GC. */
3277 mark_pool_constant (pc
)
3278 struct pool_constant
*pc
;
3282 ggc_mark_rtx (pc
->constant
);
3287 /* Mark PPS for GC. */
3290 mark_pool_sym_hash_table (pps
)
3291 struct pool_sym
**pps
;
3293 struct pool_sym
*ps
;
3296 for (i
= 0; i
< MAX_RTX_HASH_TABLE
; ++i
)
3297 for (ps
= pps
[i
]; ps
; ps
= ps
->next
)
3298 ggc_mark_string (ps
->label
);
3301 /* Mark P for GC. */
3304 mark_varasm_status (p
)
3305 struct varasm_status
*p
;
3310 mark_pool_constant (p
->x_first_pool
);
3311 mark_pool_sym_hash_table (p
->x_const_rtx_sym_hash_table
);
3312 ggc_mark_rtx (p
->x_const_double_chain
);
3315 /* Clear out all parts of the state in F that can safely be discarded
3316 after the function has been compiled, to let garbage collection
3317 reclaim the memory. */
3320 free_varasm_status (f
)
3323 struct varasm_status
*p
;
3326 free (p
->x_const_rtx_hash_table
);
3327 free (p
->x_const_rtx_sym_hash_table
);
3332 enum kind
{ RTX_DOUBLE
, RTX_INT
};
3336 #ifdef ONLY_INT_FIELDS
3337 unsigned int kind
: 16;
3338 unsigned int mode
: 16;
3340 enum kind kind
: 16;
3341 enum machine_mode mode
: 16;
3344 union real_extract du
;
3345 struct addr_const addr
;
3346 struct {HOST_WIDE_INT high
, low
;} di
;
3350 /* Express an rtx for a constant integer (perhaps symbolic)
3351 as the sum of a symbol or label plus an explicit integer.
3352 They are stored into VALUE. */
3355 decode_rtx_const (mode
, x
, value
)
3356 enum machine_mode mode
;
3358 struct rtx_const
*value
;
3360 /* Clear the whole structure, including any gaps. */
3363 int *p
= (int *) value
;
3364 int *end
= (int *) (value
+ 1);
3369 value
->kind
= RTX_INT
; /* Most usual kind. */
3372 switch (GET_CODE (x
))
3375 value
->kind
= RTX_DOUBLE
;
3376 if (GET_MODE (x
) != VOIDmode
)
3378 value
->mode
= GET_MODE (x
);
3379 bcopy ((char *) &CONST_DOUBLE_LOW (x
),
3380 (char *) &value
->un
.du
, sizeof value
->un
.du
);
3384 value
->un
.di
.low
= CONST_DOUBLE_LOW (x
);
3385 value
->un
.di
.high
= CONST_DOUBLE_HIGH (x
);
3390 value
->un
.addr
.offset
= INTVAL (x
);
3396 value
->un
.addr
.base
= x
;
3401 if (GET_CODE (x
) == PLUS
)
3403 value
->un
.addr
.base
= XEXP (x
, 0);
3404 if (GET_CODE (XEXP (x
, 1)) != CONST_INT
)
3406 value
->un
.addr
.offset
= INTVAL (XEXP (x
, 1));
3408 else if (GET_CODE (x
) == MINUS
)
3410 value
->un
.addr
.base
= XEXP (x
, 0);
3411 if (GET_CODE (XEXP (x
, 1)) != CONST_INT
)
3413 value
->un
.addr
.offset
= - INTVAL (XEXP (x
, 1));
3423 if (value
->kind
== RTX_INT
&& value
->un
.addr
.base
!= 0)
3424 switch (GET_CODE (value
->un
.addr
.base
))
3427 /* Use the string's address, not the SYMBOL_REF's address,
3428 for the sake of addresses of library routines. */
3429 value
->un
.addr
.base
= (rtx
) XSTR (value
->un
.addr
.base
, 0);
3433 /* For a LABEL_REF, compare labels. */
3434 value
->un
.addr
.base
= XEXP (value
->un
.addr
.base
, 0);
3441 /* Given a MINUS expression, simplify it if both sides
3442 include the same symbol. */
3445 simplify_subtraction (x
)
3448 struct rtx_const val0
, val1
;
3450 decode_rtx_const (GET_MODE (x
), XEXP (x
, 0), &val0
);
3451 decode_rtx_const (GET_MODE (x
), XEXP (x
, 1), &val1
);
3453 if (val0
.un
.addr
.base
== val1
.un
.addr
.base
)
3454 return GEN_INT (val0
.un
.addr
.offset
- val1
.un
.addr
.offset
);
3458 /* Compute a hash code for a constant RTL expression. */
3461 const_hash_rtx (mode
, x
)
3462 enum machine_mode mode
;
3468 struct rtx_const value
;
3469 decode_rtx_const (mode
, x
, &value
);
3471 /* Compute hashing function */
3473 for (i
= 0; i
< sizeof value
/ sizeof (int); i
++)
3474 hi
+= ((int *) &value
)[i
];
3476 hi
&= (1 << HASHBITS
) - 1;
3477 hi
%= MAX_RTX_HASH_TABLE
;
3481 /* Compare a constant rtl object X with a constant-descriptor DESC.
3482 Return 1 if DESC describes a constant with the same value as X. */
3485 compare_constant_rtx (mode
, x
, desc
)
3486 enum machine_mode mode
;
3488 struct constant_descriptor
*desc
;
3490 register int *p
= (int *) desc
->contents
;
3493 struct rtx_const value
;
3495 decode_rtx_const (mode
, x
, &value
);
3496 strp
= (int *) &value
;
3497 len
= sizeof value
/ sizeof (int);
3499 /* Compare constant contents. */
3501 if (*p
++ != *strp
++)
3507 /* Construct a constant descriptor for the rtl-expression X.
3508 It is up to the caller to enter the descriptor in the hash table. */
3510 static struct constant_descriptor
*
3511 record_constant_rtx (mode
, x
)
3512 enum machine_mode mode
;
3515 struct constant_descriptor
*ptr
;
3518 struct rtx_const value
;
3520 decode_rtx_const (mode
, x
, &value
);
3522 /* Put these things in the saveable obstack so we can ensure it won't
3523 be freed if we are called from combine or some other phase that discards
3524 memory allocated from function_obstack (current_obstack). */
3525 obstack_grow (saveable_obstack
, &ptr
, sizeof ptr
);
3526 obstack_grow (saveable_obstack
, &label
, sizeof label
);
3527 obstack_grow (saveable_obstack
, &rtl
, sizeof rtl
);
3529 /* Record constant contents. */
3530 obstack_grow (saveable_obstack
, &value
, sizeof value
);
3532 return (struct constant_descriptor
*) obstack_finish (saveable_obstack
);
3535 /* Given a constant rtx X, make (or find) a memory constant for its value
3536 and return a MEM rtx to refer to it in memory. */
3539 force_const_mem (mode
, x
)
3540 enum machine_mode mode
;
3544 register struct constant_descriptor
*desc
;
3549 /* If we want this CONST_DOUBLE in the same mode as it is in memory
3550 (this will always be true for floating CONST_DOUBLEs that have been
3551 placed in memory, but not for VOIDmode (integer) CONST_DOUBLEs),
3552 use the previous copy. Otherwise, make a new one. Note that in
3553 the unlikely event that this same CONST_DOUBLE is used in two different
3554 modes in an alternating fashion, we will allocate a lot of different
3555 memory locations, but this should be extremely rare. */
3557 if (GET_CODE (x
) == CONST_DOUBLE
3558 && GET_CODE (CONST_DOUBLE_MEM (x
)) == MEM
3559 && GET_MODE (CONST_DOUBLE_MEM (x
)) == mode
)
3560 return CONST_DOUBLE_MEM (x
);
3562 /* Compute hash code of X. Search the descriptors for that hash code
3563 to see if any of them describes X. If yes, the descriptor records
3564 the label number already assigned. */
3566 hash
= const_hash_rtx (mode
, x
);
3568 for (desc
= const_rtx_hash_table
[hash
]; desc
; desc
= desc
->next
)
3569 if (compare_constant_rtx (mode
, x
, desc
))
3571 found
= desc
->label
;
3577 register struct pool_constant
*pool
;
3578 register struct pool_sym
*sym
;
3581 /* No constant equal to X is known to have been output.
3582 Make a constant descriptor to enter X in the hash table.
3583 Assign the label number and record it in the descriptor for
3584 future calls to this function to find. */
3586 desc
= record_constant_rtx (mode
, x
);
3587 desc
->next
= const_rtx_hash_table
[hash
];
3588 const_rtx_hash_table
[hash
] = desc
;
3590 /* Align the location counter as required by EXP's data type. */
3591 align
= (mode
== VOIDmode
) ? UNITS_PER_WORD
: GET_MODE_SIZE (mode
);
3592 if (align
> BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
3593 align
= BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
;
3594 #ifdef CONSTANT_ALIGNMENT
3595 align
= CONSTANT_ALIGNMENT (make_tree (type_for_mode (mode
, 0), x
),
3596 align
* BITS_PER_UNIT
) / BITS_PER_UNIT
;
3599 pool_offset
+= align
- 1;
3600 pool_offset
&= ~ (align
- 1);
3602 /* If RTL is not being placed into the saveable obstack, make a
3603 copy of X that is in the saveable obstack in case we are
3604 being called from combine or some other phase that discards
3605 memory it allocates. We used to only do this if it is a
3606 CONST; however, reload can allocate a CONST_INT when
3607 eliminating registers. */
3608 if (rtl_obstack
!= saveable_obstack
3609 && (GET_CODE (x
) == CONST
|| GET_CODE (x
) == CONST_INT
))
3611 push_obstacks_nochange ();
3612 rtl_in_saveable_obstack ();
3614 if (GET_CODE (x
) == CONST
)
3615 x
= gen_rtx_CONST (GET_MODE (x
),
3616 gen_rtx_PLUS (GET_MODE (x
),
3617 XEXP (XEXP (x
, 0), 0),
3618 XEXP (XEXP (x
, 0), 1)));
3620 x
= GEN_INT (INTVAL (x
));
3625 /* Allocate a pool constant descriptor, fill it in, and chain it in. */
3627 pool
= (struct pool_constant
*) savealloc (sizeof (struct pool_constant
));
3631 pool
->labelno
= const_labelno
;
3632 pool
->align
= align
;
3633 pool
->offset
= pool_offset
;
3640 last_pool
->next
= pool
;
3643 pool_offset
+= GET_MODE_SIZE (mode
);
3645 /* Create a string containing the label name, in LABEL. */
3646 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
3650 desc
->label
= found
= ggc_alloc_string (label
, -1);
3652 /* Add label to symbol hash table. */
3653 hash
= SYMHASH (found
);
3654 sym
= (struct pool_sym
*) savealloc (sizeof (struct pool_sym
));
3657 sym
->next
= const_rtx_sym_hash_table
[hash
];
3658 const_rtx_sym_hash_table
[hash
] = sym
;
3661 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
3663 def
= gen_rtx_MEM (mode
, gen_rtx_SYMBOL_REF (Pmode
, found
));
3665 RTX_UNCHANGING_P (def
) = 1;
3666 /* Mark the symbol_ref as belonging to this constants pool. */
3667 CONSTANT_POOL_ADDRESS_P (XEXP (def
, 0)) = 1;
3668 current_function_uses_const_pool
= 1;
3670 if (GET_CODE (x
) == CONST_DOUBLE
)
3672 if (CONST_DOUBLE_MEM (x
) == cc0_rtx
)
3674 CONST_DOUBLE_CHAIN (x
) = const_double_chain
;
3675 const_double_chain
= x
;
3677 CONST_DOUBLE_MEM (x
) = def
;
3683 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
3684 the corresponding pool_constant structure. */
3686 static struct pool_constant
*
3687 find_pool_constant (f
, addr
)
3691 struct pool_sym
*sym
;
3692 const char *label
= XSTR (addr
, 0);
3694 for (sym
= f
->varasm
->x_const_rtx_sym_hash_table
[SYMHASH (label
)]; sym
; sym
= sym
->next
)
3695 if (sym
->label
== label
)
3701 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
3704 get_pool_constant (addr
)
3707 return (find_pool_constant (cfun
, addr
))->constant
;
3710 /* Likewise, but for the constant pool of a specific function. */
3713 get_pool_constant_for_function (f
, addr
)
3717 return (find_pool_constant (f
, addr
))->constant
;
3720 /* Similar, return the mode. */
3723 get_pool_mode (addr
)
3726 return (find_pool_constant (cfun
, addr
))->mode
;
3730 get_pool_mode_for_function (f
, addr
)
3734 return (find_pool_constant (f
, addr
))->mode
;
3737 /* Similar, return the offset in the constant pool. */
3740 get_pool_offset (addr
)
3743 return (find_pool_constant (cfun
, addr
))->offset
;
3746 /* Return the size of the constant pool. */
3754 /* Write all the constants in the constant pool. */
3757 output_constant_pool (fnname
, fndecl
)
3758 const char *fnname ATTRIBUTE_UNUSED
;
3759 tree fndecl ATTRIBUTE_UNUSED
;
3761 struct pool_constant
*pool
;
3763 union real_extract u
;
3765 /* It is possible for gcc to call force_const_mem and then to later
3766 discard the instructions which refer to the constant. In such a
3767 case we do not need to output the constant. */
3768 mark_constant_pool ();
3770 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3771 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3774 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3781 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3782 whose CODE_LABEL has been deleted. This can occur if a jump table
3783 is eliminated by optimization. If so, write a constant of zero
3784 instead. Note that this can also happen by turning the
3785 CODE_LABEL into a NOTE. */
3786 if (((GET_CODE (x
) == LABEL_REF
3787 && (INSN_DELETED_P (XEXP (x
, 0))
3788 || GET_CODE (XEXP (x
, 0)) == NOTE
)))
3789 || (GET_CODE (x
) == CONST
&& GET_CODE (XEXP (x
, 0)) == PLUS
3790 && GET_CODE (XEXP (XEXP (x
, 0), 0)) == LABEL_REF
3791 && (INSN_DELETED_P (XEXP (XEXP (XEXP (x
, 0), 0), 0))
3792 || GET_CODE (XEXP (XEXP (XEXP (x
, 0), 0), 0)) == NOTE
)))
3795 /* First switch to correct section. */
3796 #ifdef SELECT_RTX_SECTION
3797 SELECT_RTX_SECTION (pool
->mode
, x
);
3799 readonly_data_section ();
3802 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3803 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file
, x
, pool
->mode
,
3804 pool
->align
, pool
->labelno
, done
);
3807 if (pool
->align
> 1)
3808 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (pool
->align
));
3810 /* Output the label. */
3811 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LC", pool
->labelno
);
3813 /* Output the value of the constant itself. */
3814 switch (GET_MODE_CLASS (pool
->mode
))
3817 if (GET_CODE (x
) != CONST_DOUBLE
)
3820 bcopy ((char *) &CONST_DOUBLE_LOW (x
), (char *) &u
, sizeof u
);
3821 assemble_real (u
.d
, pool
->mode
);
3825 case MODE_PARTIAL_INT
:
3826 assemble_integer (x
, GET_MODE_SIZE (pool
->mode
), 1);
3833 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3839 #ifdef ASM_OUTPUT_POOL_EPILOGUE
3840 ASM_OUTPUT_POOL_EPILOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3843 /* Done with this pool. */
3844 first_pool
= last_pool
= 0;
3847 /* Look through the instructions for this function, and mark all the
3848 entries in the constant pool which are actually being used. */
3851 mark_constant_pool ()
3854 struct pool_constant
*pool
;
3856 if (first_pool
== 0)
3859 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3862 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
3863 if (GET_RTX_CLASS (GET_CODE (insn
)) == 'i')
3864 mark_constants (PATTERN (insn
));
3866 for (insn
= current_function_epilogue_delay_list
;
3868 insn
= XEXP (insn
, 1))
3869 if (GET_RTX_CLASS (GET_CODE (insn
)) == 'i')
3870 mark_constants (PATTERN (insn
));
3872 /* It's possible that the only reference to a symbol is in a symbol
3873 that's in the constant pool. This happens in Fortran under some
3874 situations. (When the constant contains the address of another
3875 constant, and only the first is used directly in an insn.)
3876 This is potentially suboptimal if there's ever a possibility of
3877 backwards (in pool order) 2'd level references. However, it's
3878 not clear that 2'd level references can happen. */
3879 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3881 struct pool_sym
*sym
;
3884 /* skip unmarked entries; no insn refers to them. */
3888 /* Skip everything except SYMBOL_REFs. */
3889 if (GET_CODE (pool
->constant
) != SYMBOL_REF
)
3891 label
= XSTR (pool
->constant
, 0);
3893 /* Be sure the symbol's value is marked. */
3894 for (sym
= const_rtx_sym_hash_table
[SYMHASH (label
)]; sym
;
3896 if (sym
->label
== label
)
3897 sym
->pool
->mark
= 1;
3898 /* If we didn't find it, there's something truly wrong here, but it
3899 will be announced by the assembler. */
3908 register const char *format_ptr
;
3913 if (GET_CODE (x
) == SYMBOL_REF
)
3915 if (CONSTANT_POOL_ADDRESS_P (x
))
3916 find_pool_constant (cfun
, x
)->mark
= 1;
3919 /* Never search inside a CONST_DOUBLE, because CONST_DOUBLE_MEM may be
3920 a MEM, but does not constitute a use of that MEM. */
3921 else if (GET_CODE (x
) == CONST_DOUBLE
)
3924 /* Insns may appear inside a SEQUENCE. Only check the patterns of
3925 insns, not any notes that may be attached. We don't want to mark
3926 a constant just because it happens to appear in a REG_EQUIV note. */
3927 if (GET_RTX_CLASS (GET_CODE (x
)) == 'i')
3929 mark_constants (PATTERN (x
));
3933 format_ptr
= GET_RTX_FORMAT (GET_CODE (x
));
3935 for (i
= 0; i
< GET_RTX_LENGTH (GET_CODE (x
)); i
++)
3937 switch (*format_ptr
++)
3940 mark_constants (XEXP (x
, i
));
3944 if (XVEC (x
, i
) != 0)
3948 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
3949 mark_constants (XVECEXP (x
, i
, j
));
3968 /* Find all the constants whose addresses are referenced inside of EXP,
3969 and make sure assembler code with a label has been output for each one.
3970 Indicate whether an ADDR_EXPR has been encountered. */
3973 output_addressed_constants (exp
)
3978 switch (TREE_CODE (exp
))
3982 register tree constant
= TREE_OPERAND (exp
, 0);
3984 while (TREE_CODE (constant
) == COMPONENT_REF
)
3986 constant
= TREE_OPERAND (constant
, 0);
3989 if (TREE_CODE_CLASS (TREE_CODE (constant
)) == 'c'
3990 || TREE_CODE (constant
) == CONSTRUCTOR
)
3991 /* No need to do anything here
3992 for addresses of variables or functions. */
3993 output_constant_def (constant
);
4000 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
4001 reloc
|= output_addressed_constants (TREE_OPERAND (exp
, 1));
4006 case NON_LVALUE_EXPR
:
4007 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
4013 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
4014 if (TREE_VALUE (link
) != 0)
4015 reloc
|= output_addressed_constants (TREE_VALUE (link
));
4025 /* Return nonzero if VALUE is a valid constant-valued expression
4026 for use in initializing a static variable; one that can be an
4027 element of a "constant" initializer.
4029 Return null_pointer_node if the value is absolute;
4030 if it is relocatable, return the variable that determines the relocation.
4031 We assume that VALUE has been folded as much as possible;
4032 therefore, we do not need to check for such things as
4033 arithmetic-combinations of integers. */
4036 initializer_constant_valid_p (value
, endtype
)
4040 /* Give the front-end a chance to convert VALUE to something that
4041 looks more like a constant to the back-end. */
4042 if (lang_expand_constant
)
4043 value
= (*lang_expand_constant
) (value
);
4045 switch (TREE_CODE (value
))
4048 if ((TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
4049 || TREE_CODE (TREE_TYPE (value
)) == RECORD_TYPE
)
4050 && TREE_CONSTANT (value
)
4051 && CONSTRUCTOR_ELTS (value
))
4053 initializer_constant_valid_p (TREE_VALUE (CONSTRUCTOR_ELTS (value
)),
4056 return TREE_STATIC (value
) ? null_pointer_node
: 0;
4062 return null_pointer_node
;
4065 return TREE_OPERAND (value
, 0);
4067 case NON_LVALUE_EXPR
:
4068 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
4072 /* Allow conversions between pointer types. */
4073 if (POINTER_TYPE_P (TREE_TYPE (value
))
4074 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
4075 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
4077 /* Allow conversions between real types. */
4078 if (FLOAT_TYPE_P (TREE_TYPE (value
))
4079 && FLOAT_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
4080 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
4082 /* Allow length-preserving conversions between integer types. */
4083 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
4084 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
4085 && (TYPE_PRECISION (TREE_TYPE (value
))
4086 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
4087 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
4089 /* Allow conversions between other integer types only if
4091 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
4092 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
4094 tree inner
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4096 if (inner
== null_pointer_node
)
4097 return null_pointer_node
;
4101 /* Allow (int) &foo provided int is as wide as a pointer. */
4102 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
4103 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
4104 && (TYPE_PRECISION (TREE_TYPE (value
))
4105 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
4106 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4109 /* Likewise conversions from int to pointers, but also allow
4110 conversions from 0. */
4111 if (POINTER_TYPE_P (TREE_TYPE (value
))
4112 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
4114 if (integer_zerop (TREE_OPERAND (value
, 0)))
4115 return null_pointer_node
;
4116 else if (TYPE_PRECISION (TREE_TYPE (value
))
4117 <= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0))))
4118 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4122 /* Allow conversions to union types if the value inside is okay. */
4123 if (TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
)
4124 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4129 if (! INTEGRAL_TYPE_P (endtype
)
4130 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
4132 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4134 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
4136 /* If either term is absolute, use the other terms relocation. */
4137 if (valid0
== null_pointer_node
)
4139 if (valid1
== null_pointer_node
)
4145 if (! INTEGRAL_TYPE_P (endtype
)
4146 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
4148 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4150 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
4152 /* Win if second argument is absolute. */
4153 if (valid1
== null_pointer_node
)
4155 /* Win if both arguments have the same relocation.
4156 Then the value is absolute. */
4157 if (valid0
== valid1
&& valid0
!= 0)
4158 return null_pointer_node
;
4161 /* Support differences between labels. */
4162 if (INTEGRAL_TYPE_P (endtype
))
4165 op0
= TREE_OPERAND (value
, 0);
4166 op1
= TREE_OPERAND (value
, 1);
4170 if (TREE_CODE (op0
) == ADDR_EXPR
4171 && TREE_CODE (TREE_OPERAND (op0
, 0)) == LABEL_DECL
4172 && TREE_CODE (op1
) == ADDR_EXPR
4173 && TREE_CODE (TREE_OPERAND (op1
, 0)) == LABEL_DECL
)
4174 return null_pointer_node
;
4185 /* Output assembler code for constant EXP to FILE, with no label.
4186 This includes the pseudo-op such as ".int" or ".byte", and a newline.
4187 Assumes output_addressed_constants has been done on EXP already.
4189 Generate exactly SIZE bytes of assembler data, padding at the end
4190 with zeros if necessary. SIZE must always be specified.
4192 SIZE is important for structure constructors,
4193 since trailing members may have been omitted from the constructor.
4194 It is also important for initialization of arrays from string constants
4195 since the full length of the string constant might not be wanted.
4196 It is also needed for initialization of unions, where the initializer's
4197 type is just one member, and that may not be as long as the union.
4199 There a case in which we would fail to output exactly SIZE bytes:
4200 for a structure constructor that wants to produce more than SIZE bytes.
4201 But such constructors will never be generated for any possible input. */
4204 output_constant (exp
, size
)
4208 register enum tree_code code
= TREE_CODE (TREE_TYPE (exp
));
4210 /* Some front-ends use constants other than the standard
4211 language-indepdent varieties, but which may still be output
4212 directly. Give the front-end a chance to convert EXP to a
4213 language-independent representation. */
4214 if (lang_expand_constant
)
4215 exp
= (*lang_expand_constant
) (exp
);
4217 if (size
== 0 || flag_syntax_only
)
4220 /* Eliminate the NON_LVALUE_EXPR_EXPR that makes a cast not be an lvalue.
4221 That way we get the constant (we hope) inside it. Also, strip off any
4222 NOP_EXPR that converts between two record, union, array, or set types
4223 or a CONVERT_EXPR that converts to a union TYPE. */
4224 while ((TREE_CODE (exp
) == NOP_EXPR
4225 && (TREE_TYPE (exp
) == TREE_TYPE (TREE_OPERAND (exp
, 0))
4226 || AGGREGATE_TYPE_P (TREE_TYPE (exp
))))
4227 || (TREE_CODE (exp
) == CONVERT_EXPR
4228 && code
== UNION_TYPE
)
4229 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
4231 exp
= TREE_OPERAND (exp
, 0);
4232 code
= TREE_CODE (TREE_TYPE (exp
));
4235 /* Allow a constructor with no elements for any data type.
4236 This means to fill the space with zeros. */
4237 if (TREE_CODE (exp
) == CONSTRUCTOR
&& CONSTRUCTOR_ELTS (exp
) == 0)
4239 assemble_zeros (size
);
4250 case REFERENCE_TYPE
:
4251 /* ??? What about (int)((float)(int)&foo + 4) */
4252 while (TREE_CODE (exp
) == NOP_EXPR
|| TREE_CODE (exp
) == CONVERT_EXPR
4253 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
4254 exp
= TREE_OPERAND (exp
, 0);
4256 if (! assemble_integer (expand_expr (exp
, NULL_RTX
, VOIDmode
,
4257 EXPAND_INITIALIZER
),
4259 error ("initializer for integer value is too complicated");
4264 if (TREE_CODE (exp
) != REAL_CST
)
4265 error ("initializer for floating value is not a floating constant");
4267 assemble_real (TREE_REAL_CST (exp
),
4268 mode_for_size (size
* BITS_PER_UNIT
, MODE_FLOAT
, 0));
4273 output_constant (TREE_REALPART (exp
), size
/ 2);
4274 output_constant (TREE_IMAGPART (exp
), size
/ 2);
4275 size
-= (size
/ 2) * 2;
4279 if (TREE_CODE (exp
) == CONSTRUCTOR
)
4281 output_constructor (exp
, size
);
4284 else if (TREE_CODE (exp
) == STRING_CST
)
4288 if (size
> TREE_STRING_LENGTH (exp
))
4290 excess
= size
- TREE_STRING_LENGTH (exp
);
4291 size
= TREE_STRING_LENGTH (exp
);
4294 assemble_string (TREE_STRING_POINTER (exp
), size
);
4303 if (TREE_CODE (exp
) == CONSTRUCTOR
)
4304 output_constructor (exp
, size
);
4310 if (TREE_CODE (exp
) == INTEGER_CST
)
4311 assemble_integer (expand_expr (exp
, NULL_RTX
,
4312 VOIDmode
, EXPAND_INITIALIZER
),
4314 else if (TREE_CODE (exp
) == CONSTRUCTOR
)
4316 unsigned char *buffer
= (unsigned char *) alloca (size
);
4317 if (get_set_constructor_bytes (exp
, buffer
, size
))
4319 assemble_string ((char *) buffer
, size
);
4322 error ("unknown set constructor type");
4330 assemble_zeros (size
);
4334 /* Subroutine of output_constant, used for CONSTRUCTORs
4335 (aggregate constants).
4336 Generate at least SIZE bytes, padding if necessary. */
4339 output_constructor (exp
, size
)
4343 register tree link
, field
= 0;
4344 HOST_WIDE_INT min_index
= 0;
4345 /* Number of bytes output or skipped so far.
4346 In other words, current position within the constructor. */
4347 int total_bytes
= 0;
4348 /* Non-zero means BYTE contains part of a byte, to be output. */
4349 int byte_buffer_in_use
= 0;
4350 register int byte
= 0;
4352 if (HOST_BITS_PER_WIDE_INT
< BITS_PER_UNIT
)
4355 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
4356 field
= TYPE_FIELDS (TREE_TYPE (exp
));
4358 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
4359 && TYPE_DOMAIN (TREE_TYPE (exp
)) != 0)
4361 = TREE_INT_CST_LOW (TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (exp
))));
4363 /* As LINK goes through the elements of the constant,
4364 FIELD goes through the structure fields, if the constant is a structure.
4365 if the constant is a union, then we override this,
4366 by getting the field from the TREE_LIST element.
4367 But the constant could also be an array. Then FIELD is zero.
4369 There is always a maximum of one element in the chain LINK for unions
4370 (even if the initializer in a source program incorrectly contains
4372 for (link
= CONSTRUCTOR_ELTS (exp
);
4374 link
= TREE_CHAIN (link
),
4375 field
= field
? TREE_CHAIN (field
) : 0)
4377 tree val
= TREE_VALUE (link
);
4380 /* the element in a union constructor specifies the proper field. */
4382 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
4383 || TREE_CODE (TREE_TYPE (exp
)) == UNION_TYPE
)
4385 /* if available, use the type given by link */
4386 if (TREE_PURPOSE (link
) != 0)
4387 field
= TREE_PURPOSE (link
);
4390 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
4391 index
= TREE_PURPOSE (link
);
4393 /* Eliminate the marker that makes a cast not be an lvalue. */
4397 if (index
&& TREE_CODE (index
) == RANGE_EXPR
)
4399 register int fieldsize
4400 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (exp
)));
4401 HOST_WIDE_INT lo_index
= TREE_INT_CST_LOW (TREE_OPERAND (index
, 0));
4402 HOST_WIDE_INT hi_index
= TREE_INT_CST_LOW (TREE_OPERAND (index
, 1));
4403 HOST_WIDE_INT index
;
4404 for (index
= lo_index
; index
<= hi_index
; index
++)
4406 /* Output the element's initial value. */
4408 assemble_zeros (fieldsize
);
4410 output_constant (val
, fieldsize
);
4412 /* Count its size. */
4413 total_bytes
+= fieldsize
;
4416 else if (field
== 0 || !DECL_BIT_FIELD (field
))
4418 /* An element that is not a bit-field. */
4420 register int fieldsize
;
4421 /* Since this structure is static,
4422 we know the positions are constant. */
4423 int bitpos
= (field
? (TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field
))
4427 bitpos
= (TREE_INT_CST_LOW (TYPE_SIZE (TREE_TYPE (val
)))
4429 * (TREE_INT_CST_LOW (index
) - min_index
));
4431 /* Output any buffered-up bit-fields preceding this element. */
4432 if (byte_buffer_in_use
)
4434 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4436 byte_buffer_in_use
= 0;
4439 /* Advance to offset of this element.
4440 Note no alignment needed in an array, since that is guaranteed
4441 if each element has the proper size. */
4442 if ((field
!= 0 || index
!= 0) && bitpos
!= total_bytes
)
4444 assemble_zeros (bitpos
- total_bytes
);
4445 total_bytes
= bitpos
;
4448 /* Determine size this element should occupy. */
4451 if (TREE_CODE (DECL_SIZE_UNIT (field
)) != INTEGER_CST
)
4454 fieldsize
= TREE_INT_CST_LOW (DECL_SIZE_UNIT (field
));
4457 fieldsize
= int_size_in_bytes (TREE_TYPE (TREE_TYPE (exp
)));
4459 /* Output the element's initial value. */
4461 assemble_zeros (fieldsize
);
4463 output_constant (val
, fieldsize
);
4465 /* Count its size. */
4466 total_bytes
+= fieldsize
;
4468 else if (val
!= 0 && TREE_CODE (val
) != INTEGER_CST
)
4469 error ("invalid initial value for member `%s'",
4470 IDENTIFIER_POINTER (DECL_NAME (field
)));
4473 /* Element that is a bit-field. */
4475 int next_offset
= TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field
));
4477 = (next_offset
+ TREE_INT_CST_LOW (DECL_SIZE (field
)));
4480 val
= integer_zero_node
;
4482 /* If this field does not start in this (or, next) byte,
4484 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4486 /* Output remnant of any bit field in previous bytes. */
4487 if (byte_buffer_in_use
)
4489 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4491 byte_buffer_in_use
= 0;
4494 /* If still not at proper byte, advance to there. */
4495 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4497 assemble_zeros (next_offset
/ BITS_PER_UNIT
- total_bytes
);
4498 total_bytes
= next_offset
/ BITS_PER_UNIT
;
4502 if (! byte_buffer_in_use
)
4505 /* We must split the element into pieces that fall within
4506 separate bytes, and combine each byte with previous or
4507 following bit-fields. */
4509 /* next_offset is the offset n fbits from the beginning of
4510 the structure to the next bit of this element to be processed.
4511 end_offset is the offset of the first bit past the end of
4513 while (next_offset
< end_offset
)
4517 HOST_WIDE_INT value
;
4518 int next_byte
= next_offset
/ BITS_PER_UNIT
;
4519 int next_bit
= next_offset
% BITS_PER_UNIT
;
4521 /* Advance from byte to byte
4522 within this element when necessary. */
4523 while (next_byte
!= total_bytes
)
4525 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4530 /* Number of bits we can process at once
4531 (all part of the same byte). */
4532 this_time
= MIN (end_offset
- next_offset
,
4533 BITS_PER_UNIT
- next_bit
);
4534 if (BYTES_BIG_ENDIAN
)
4536 /* On big-endian machine, take the most significant bits
4537 first (of the bits that are significant)
4538 and put them into bytes from the most significant end. */
4539 shift
= end_offset
- next_offset
- this_time
;
4540 /* Don't try to take a bunch of bits that cross
4541 the word boundary in the INTEGER_CST. We can
4542 only select bits from the LOW or HIGH part
4544 if (shift
< HOST_BITS_PER_WIDE_INT
4545 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4547 this_time
= shift
+ this_time
- HOST_BITS_PER_WIDE_INT
;
4548 shift
= HOST_BITS_PER_WIDE_INT
;
4551 /* Now get the bits from the appropriate constant word. */
4552 if (shift
< HOST_BITS_PER_WIDE_INT
)
4554 value
= TREE_INT_CST_LOW (val
);
4556 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4558 value
= TREE_INT_CST_HIGH (val
);
4559 shift
-= HOST_BITS_PER_WIDE_INT
;
4563 /* Get the result. This works only when:
4564 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4565 byte
|= (((value
>> shift
)
4566 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4567 << (BITS_PER_UNIT
- this_time
- next_bit
));
4571 /* On little-endian machines,
4572 take first the least significant bits of the value
4573 and pack them starting at the least significant
4574 bits of the bytes. */
4575 shift
= (next_offset
4576 - TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field
)));
4577 /* Don't try to take a bunch of bits that cross
4578 the word boundary in the INTEGER_CST. We can
4579 only select bits from the LOW or HIGH part
4581 if (shift
< HOST_BITS_PER_WIDE_INT
4582 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4584 this_time
= (HOST_BITS_PER_WIDE_INT
- shift
);
4587 /* Now get the bits from the appropriate constant word. */
4588 if (shift
< HOST_BITS_PER_WIDE_INT
)
4589 value
= TREE_INT_CST_LOW (val
);
4590 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4592 value
= TREE_INT_CST_HIGH (val
);
4593 shift
-= HOST_BITS_PER_WIDE_INT
;
4597 /* Get the result. This works only when:
4598 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4599 byte
|= (((value
>> shift
)
4600 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4603 next_offset
+= this_time
;
4604 byte_buffer_in_use
= 1;
4608 if (byte_buffer_in_use
)
4610 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4613 if (total_bytes
< size
)
4614 assemble_zeros (size
- total_bytes
);
4617 #ifdef HANDLE_PRAGMA_WEAK
4618 /* Add function NAME to the weak symbols list. VALUE is a weak alias
4619 associatd with NAME. */
4622 add_weak (name
, value
)
4626 struct weak_syms
*weak
;
4628 weak
= (struct weak_syms
*) permalloc (sizeof (struct weak_syms
));
4633 weak
->next
= weak_decls
;
4635 weak
->value
= value
;
4640 #endif /* HANDLE_PRAGMA_WEAK */
4642 /* Declare DECL to be a weak symbol. */
4648 if (! TREE_PUBLIC (decl
))
4649 error_with_decl (decl
, "weak declaration of `%s' must be public");
4650 else if (TREE_ASM_WRITTEN (decl
))
4651 error_with_decl (decl
, "weak declaration of `%s' must precede definition");
4652 else if (SUPPORTS_WEAK
)
4653 DECL_WEAK (decl
) = 1;
4654 #ifdef HANDLE_PRAGMA_WEAK
4655 add_weak (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)), NULL
);
4659 /* Emit any pending weak declarations. */
4661 #ifdef HANDLE_PRAGMA_WEAK
4662 struct weak_syms
* weak_decls
;
4668 #ifdef HANDLE_PRAGMA_WEAK
4669 if (HANDLE_PRAGMA_WEAK
)
4671 struct weak_syms
*t
;
4672 for (t
= weak_decls
; t
; t
= t
->next
)
4676 ASM_WEAKEN_LABEL (asm_out_file
, t
->name
);
4678 ASM_OUTPUT_DEF (asm_out_file
, t
->name
, t
->value
);
4685 /* Remove NAME from the pending list of weak symbols. This prevents
4686 the compiler from emitting multiple .weak directives which confuses
4688 #ifdef ASM_WEAKEN_LABEL
4690 remove_from_pending_weak_list (name
)
4691 char *name ATTRIBUTE_UNUSED
;
4693 #ifdef HANDLE_PRAGMA_WEAK
4694 if (HANDLE_PRAGMA_WEAK
)
4696 struct weak_syms
*t
;
4697 for (t
= weak_decls
; t
; t
= t
->next
)
4699 if (t
->name
&& strcmp (name
, t
->name
) == 0)
4708 assemble_alias (decl
, target
)
4709 tree decl
, target ATTRIBUTE_UNUSED
;
4713 make_decl_rtl (decl
, (char *) 0, 1);
4714 name
= XSTR (XEXP (DECL_RTL (decl
), 0), 0);
4716 #ifdef ASM_OUTPUT_DEF
4717 /* Make name accessible from other files, if appropriate. */
4719 if (TREE_PUBLIC (decl
))
4721 #ifdef ASM_WEAKEN_LABEL
4722 if (DECL_WEAK (decl
))
4724 ASM_WEAKEN_LABEL (asm_out_file
, name
);
4725 /* Remove this function from the pending weak list so that
4726 we do not emit multiple .weak directives for it. */
4727 remove_from_pending_weak_list
4728 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
4732 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
4735 #ifdef ASM_OUTPUT_DEF_FROM_DECLS
4736 ASM_OUTPUT_DEF_FROM_DECLS (asm_out_file
, decl
, target
);
4738 ASM_OUTPUT_DEF (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4740 TREE_ASM_WRITTEN (decl
) = 1;
4742 #ifdef ASM_OUTPUT_WEAK_ALIAS
4743 if (! DECL_WEAK (decl
))
4744 warning ("only weak aliases are supported in this configuration");
4746 ASM_OUTPUT_WEAK_ALIAS (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4747 TREE_ASM_WRITTEN (decl
) = 1;
4749 warning ("alias definitions not supported in this configuration; ignored");
4754 /* This determines whether or not we support link-once semantics. */
4755 #ifndef SUPPORTS_ONE_ONLY
4756 #ifdef MAKE_DECL_ONE_ONLY
4757 #define SUPPORTS_ONE_ONLY 1
4759 #define SUPPORTS_ONE_ONLY 0
4763 /* Returns 1 if the target configuration supports defining public symbols
4764 so that one of them will be chosen at link time instead of generating a
4765 multiply-defined symbol error, whether through the use of weak symbols or
4766 a target-specific mechanism for having duplicates discarded. */
4769 supports_one_only ()
4771 if (SUPPORTS_ONE_ONLY
)
4773 return SUPPORTS_WEAK
;
4776 /* Set up DECL as a public symbol that can be defined in multiple
4777 translation units without generating a linker error. */
4780 make_decl_one_only (decl
)
4783 if (TREE_CODE (decl
) != VAR_DECL
&& TREE_CODE (decl
) != FUNCTION_DECL
)
4786 TREE_PUBLIC (decl
) = 1;
4788 if (TREE_CODE (decl
) == VAR_DECL
4789 && (DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
))
4790 DECL_COMMON (decl
) = 1;
4791 else if (SUPPORTS_ONE_ONLY
)
4793 #ifdef MAKE_DECL_ONE_ONLY
4794 MAKE_DECL_ONE_ONLY (decl
);
4796 DECL_ONE_ONLY (decl
) = 1;
4798 else if (SUPPORTS_WEAK
)
4799 DECL_WEAK (decl
) = 1;
4807 ggc_add_root (const_hash_table
, MAX_HASH_TABLE
, sizeof const_hash_table
[0],
4808 mark_const_hash_entry
);
4809 ggc_add_string_root (&in_named_name
, 1);