1 /* Output variables, constants and external declarations, for GNU compiler.
2 Copyright (C) 1987, 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997,
3 1998, 1999, 2000 Free Software Foundation, Inc.
5 This file is part of GNU CC.
7 GNU CC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GNU CC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU CC; see the file COPYING. If not, write to
19 the Free Software Foundation, 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
23 /* This file handles generation of all the assembler code
24 *except* the instructions of a function.
25 This includes declarations of variables and their initial values.
27 We also output the assembler code for constants stored in memory
28 and are responsible for combining constants with the same value. */
39 #include "hard-reg-set.h"
51 #ifdef XCOFF_DEBUGGING_INFO
55 #ifndef TRAMPOLINE_ALIGNMENT
56 #define TRAMPOLINE_ALIGNMENT FUNCTION_BOUNDARY
60 #define ASM_STABS_OP ".stabs"
63 /* Define the prefix to use when check_memory_usage_flag is enable. */
64 #ifdef NO_DOLLAR_IN_LABEL
65 #ifdef NO_DOT_IN_LABEL
66 #define CHKR_PREFIX "chkr_prefix_"
67 #else /* !NO_DOT_IN_LABEL */
68 #define CHKR_PREFIX "chkr."
70 #else /* !NO_DOLLAR_IN_LABEL */
71 #define CHKR_PREFIX "chkr$"
73 #define CHKR_PREFIX_SIZE (sizeof (CHKR_PREFIX) - 1)
75 /* File in which assembler code is being written. */
77 extern FILE *asm_out_file;
79 /* The (assembler) name of the first globally-visible object output. */
80 char *first_global_object_name;
81 char *weak_global_object_name;
83 extern struct obstack *current_obstack;
84 extern struct obstack *saveable_obstack;
85 extern struct obstack *rtl_obstack;
86 extern struct obstack permanent_obstack;
87 #define obstack_chunk_alloc xmalloc
90 struct constant_descriptor;
94 #define MAX_RTX_HASH_TABLE 61
98 /* Hash facility for making memory-constants
99 from constant rtl-expressions. It is used on RISC machines
100 where immediate integer arguments and constant addresses are restricted
101 so that such constants must be stored in memory.
103 This pool of constants is reinitialized for each function
104 so each function gets its own constants-pool that comes right before
106 struct constant_descriptor **x_const_rtx_hash_table;
107 struct pool_sym **x_const_rtx_sym_hash_table;
109 /* Pointers to first and last constant in pool. */
110 struct pool_constant *x_first_pool, *x_last_pool;
112 /* Current offset in constant pool (does not include any machine-specific
116 /* Chain of all CONST_DOUBLE rtx's constructed for the current function.
117 They are chained through the CONST_DOUBLE_CHAIN.
118 A CONST_DOUBLE rtx has CONST_DOUBLE_MEM != cc0_rtx iff it is on this chain.
119 In that case, CONST_DOUBLE_MEM is either a MEM,
120 or const0_rtx if no MEM has been made for this CONST_DOUBLE yet. */
121 rtx x_const_double_chain;
124 #define const_rtx_hash_table (cfun->varasm->x_const_rtx_hash_table)
125 #define const_rtx_sym_hash_table (cfun->varasm->x_const_rtx_sym_hash_table)
126 #define first_pool (cfun->varasm->x_first_pool)
127 #define last_pool (cfun->varasm->x_last_pool)
128 #define pool_offset (cfun->varasm->x_pool_offset)
129 #define const_double_chain (cfun->varasm->x_const_double_chain)
131 /* Number for making the label on the next
132 constant that is stored in memory. */
136 /* Number for making the label on the next
137 static variable internal to a function. */
141 /* Carry information from ASM_DECLARE_OBJECT_NAME
142 to ASM_FINISH_DECLARE_OBJECT. */
144 int size_directive_output;
146 /* The last decl for which assemble_variable was called,
147 if it did ASM_DECLARE_OBJECT_NAME.
148 If the last call to assemble_variable didn't do that,
151 tree last_assemble_variable_decl;
153 static const char *strip_reg_name PARAMS ((const char *));
154 static int contains_pointers_p PARAMS ((tree));
155 static void decode_addr_const PARAMS ((tree, struct addr_const *));
156 static int const_hash PARAMS ((tree));
157 static int compare_constant PARAMS ((tree,
158 struct constant_descriptor *));
159 static char *compare_constant_1 PARAMS ((tree, char *));
160 static struct constant_descriptor *record_constant PARAMS ((tree));
161 static void record_constant_1 PARAMS ((tree));
162 static tree copy_constant PARAMS ((tree));
163 static void output_constant_def_contents PARAMS ((tree, int, int));
164 static void decode_rtx_const PARAMS ((enum machine_mode, rtx,
165 struct rtx_const *));
166 static int const_hash_rtx PARAMS ((enum machine_mode, rtx));
167 static int compare_constant_rtx PARAMS ((enum machine_mode, rtx,
168 struct constant_descriptor *));
169 static struct constant_descriptor *record_constant_rtx PARAMS ((enum machine_mode,
171 static struct pool_constant *find_pool_constant PARAMS ((struct function *, rtx));
172 static void mark_constant_pool PARAMS ((void));
173 static void mark_constants PARAMS ((rtx));
174 static int output_addressed_constants PARAMS ((tree));
175 static void output_after_function_constants PARAMS ((void));
176 static void output_constructor PARAMS ((tree, int));
177 #ifdef ASM_WEAKEN_LABEL
178 static void remove_from_pending_weak_list PARAMS ((char *));
180 #ifdef ASM_OUTPUT_BSS
181 static void asm_output_bss PARAMS ((FILE *, tree, char *, int, int));
183 #ifdef BSS_SECTION_ASM_OP
184 #ifdef ASM_OUTPUT_ALIGNED_BSS
185 static void asm_output_aligned_bss PARAMS ((FILE *, tree, char *, int, int));
187 #endif /* BSS_SECTION_ASM_OP */
188 static void mark_pool_constant PARAMS ((struct pool_constant *));
189 static void mark_pool_sym_hash_table PARAMS ((struct pool_sym **));
190 static void mark_const_hash_entry PARAMS ((void *));
191 static void asm_emit_uninitialised PARAMS ((tree, char *, int, int));
193 static enum in_section { no_section, in_text, in_data, in_named
194 #ifdef BSS_SECTION_ASM_OP
197 #ifdef EH_FRAME_SECTION_ASM_OP
200 #ifdef EXTRA_SECTIONS
203 } in_section = no_section;
205 /* Return a non-zero value if DECL has a section attribute. */
206 #ifndef IN_NAMED_SECTION
207 #define IN_NAMED_SECTION(DECL) \
208 ((TREE_CODE (DECL) == FUNCTION_DECL || TREE_CODE (DECL) == VAR_DECL) \
209 && DECL_SECTION_NAME (DECL) != NULL_TREE)
212 /* Text of section name when in_section == in_named. */
213 static char *in_named_name;
215 /* Define functions like text_section for any extra sections. */
216 #ifdef EXTRA_SECTION_FUNCTIONS
217 EXTRA_SECTION_FUNCTIONS
220 /* Tell assembler to switch to text section. */
225 if (in_section != in_text)
227 fprintf (asm_out_file, "%s\n", TEXT_SECTION_ASM_OP);
228 in_section = in_text;
232 /* Tell assembler to switch to data section. */
237 if (in_section != in_data)
239 if (flag_shared_data)
241 #ifdef SHARED_SECTION_ASM_OP
242 fprintf (asm_out_file, "%s\n", SHARED_SECTION_ASM_OP);
244 fprintf (asm_out_file, "%s\n", DATA_SECTION_ASM_OP);
248 fprintf (asm_out_file, "%s\n", DATA_SECTION_ASM_OP);
250 in_section = in_data;
253 /* Tell assembler to ALWAYS switch to data section, in case
254 it's not sure where it it. */
257 force_data_section ()
259 in_section = no_section;
263 /* Tell assembler to switch to read-only data section. This is normally
267 readonly_data_section ()
269 #ifdef READONLY_DATA_SECTION
270 READONLY_DATA_SECTION (); /* Note this can call data_section. */
276 /* Determine if we're in the text section. */
281 return in_section == in_text;
284 /* Determine if we're in the data section. */
289 return in_section == in_data;
292 /* Tell assembler to change to section NAME for DECL.
293 If DECL is NULL, just switch to section NAME.
294 If NAME is NULL, get the name from DECL.
295 If RELOC is 1, the initializer for DECL contains relocs. */
298 named_section (decl, name, reloc)
301 int reloc ATTRIBUTE_UNUSED;
303 if (decl != NULL_TREE
304 && TREE_CODE_CLASS (TREE_CODE (decl)) != 'd')
307 name = TREE_STRING_POINTER (DECL_SECTION_NAME (decl));
309 if (in_section != in_named || strcmp (name, in_named_name))
311 #ifdef ASM_OUTPUT_SECTION_NAME
312 ASM_OUTPUT_SECTION_NAME (asm_out_file, decl, name, reloc);
314 /* Section attributes are not supported if this macro isn't provided -
315 some host formats don't support them at all. The front-end should
316 already have flagged this as an error. */
320 in_named_name = ggc_alloc_string (name, -1);
321 in_section = in_named;
325 #ifdef ASM_OUTPUT_SECTION_NAME
326 #ifndef UNIQUE_SECTION
327 #define UNIQUE_SECTION(DECL,RELOC) \
333 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (DECL)); \
334 /* Strip off any encoding in name. */ \
335 STRIP_NAME_ENCODING (name, name); \
337 len = strlen (name) + 1; \
338 string = alloca (len + 1); \
339 sprintf (string, ".%s", name); \
341 DECL_SECTION_NAME (DECL) = build_string (len, string); \
344 #ifndef UNIQUE_SECTION_P
345 #define UNIQUE_SECTION_P(DECL) 0
349 #ifdef BSS_SECTION_ASM_OP
351 /* Tell the assembler to switch to the bss section. */
356 if (in_section != in_bss)
358 #ifdef SHARED_BSS_SECTION_ASM_OP
359 if (flag_shared_data)
360 fprintf (asm_out_file, "%s\n", SHARED_BSS_SECTION_ASM_OP);
363 fprintf (asm_out_file, "%s\n", BSS_SECTION_ASM_OP);
369 #ifdef ASM_OUTPUT_BSS
371 /* Utility function for ASM_OUTPUT_BSS for targets to use if
372 they don't support alignments in .bss.
373 ??? It is believed that this function will work in most cases so such
374 support is localized here. */
377 asm_output_bss (file, decl, name, size, rounded)
379 tree decl ATTRIBUTE_UNUSED;
381 int size ATTRIBUTE_UNUSED, rounded;
383 ASM_GLOBALIZE_LABEL (file, name);
385 #ifdef ASM_DECLARE_OBJECT_NAME
386 last_assemble_variable_decl = decl;
387 ASM_DECLARE_OBJECT_NAME (file, name, decl);
389 /* Standard thing is just output label for the object. */
390 ASM_OUTPUT_LABEL (file, name);
391 #endif /* ASM_DECLARE_OBJECT_NAME */
392 ASM_OUTPUT_SKIP (file, rounded);
397 #ifdef ASM_OUTPUT_ALIGNED_BSS
399 /* Utility function for targets to use in implementing
400 ASM_OUTPUT_ALIGNED_BSS.
401 ??? It is believed that this function will work in most cases so such
402 support is localized here. */
405 asm_output_aligned_bss (file, decl, name, size, align)
411 ASM_GLOBALIZE_LABEL (file, name);
413 ASM_OUTPUT_ALIGN (file, floor_log2 (align / BITS_PER_UNIT));
414 #ifdef ASM_DECLARE_OBJECT_NAME
415 last_assemble_variable_decl = decl;
416 ASM_DECLARE_OBJECT_NAME (file, name, decl);
418 /* Standard thing is just output label for the object. */
419 ASM_OUTPUT_LABEL (file, name);
420 #endif /* ASM_DECLARE_OBJECT_NAME */
421 ASM_OUTPUT_SKIP (file, size ? size : 1);
426 #endif /* BSS_SECTION_ASM_OP */
428 #ifdef EH_FRAME_SECTION_ASM_OP
432 if (in_section != in_eh_frame)
434 fprintf (asm_out_file, "%s\n", EH_FRAME_SECTION_ASM_OP);
435 in_section = in_eh_frame;
440 /* Switch to the section for function DECL.
442 If DECL is NULL_TREE, switch to the text section.
443 ??? It's not clear that we will ever be passed NULL_TREE, but it's
444 safer to handle it. */
447 function_section (decl)
450 if (decl != NULL_TREE
451 && DECL_SECTION_NAME (decl) != NULL_TREE)
452 named_section (decl, (char *) 0, 0);
457 /* Switch to section for variable DECL.
459 RELOC is the `reloc' argument to SELECT_SECTION. */
462 variable_section (decl, reloc)
466 if (IN_NAMED_SECTION (decl))
467 named_section (decl, NULL, reloc);
470 /* C++ can have const variables that get initialized from constructors,
471 and thus can not be in a readonly section. We prevent this by
472 verifying that the initial value is constant for objects put in a
475 error_mark_node is used by the C front end to indicate that the
476 initializer has not been seen yet. In this case, we assume that
477 the initializer must be constant.
479 C++ uses error_mark_node for variables that have complicated
480 initializers, but these variables go in BSS so we won't be called
483 #ifdef SELECT_SECTION
484 SELECT_SECTION (decl, reloc);
486 if (DECL_READONLY_SECTION (decl, reloc))
487 readonly_data_section ();
494 /* Tell assembler to switch to the section for the exception handling
500 #if defined (EXCEPTION_SECTION)
501 EXCEPTION_SECTION ();
503 #ifdef ASM_OUTPUT_SECTION_NAME
504 named_section (NULL_TREE, ".gcc_except_table", 0);
509 readonly_data_section ();
514 /* Create the rtl to represent a function, for a function definition.
515 DECL is a FUNCTION_DECL node which describes which function.
516 The rtl is stored into DECL. */
519 make_function_rtl (decl)
522 char *name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
523 char *new_name = name;
525 /* Rename a nested function to avoid conflicts, unless it's a member of
526 a local class, in which case the class name is already unique. */
527 if (decl_function_context (decl) != 0
528 && ! TYPE_P (DECL_CONTEXT (decl))
529 && DECL_INITIAL (decl) != 0
530 && DECL_RTL (decl) == 0)
534 name = IDENTIFIER_POINTER (DECL_NAME (decl));
535 ASM_FORMAT_PRIVATE_NAME (label, name, var_labelno);
536 name = ggc_alloc_string (label, -1);
541 /* When -fprefix-function-name is used, every function name is
542 prefixed. Even static functions are prefixed because they
543 could be declared latter. Note that a nested function name
545 if (flag_prefix_function_name)
547 size_t name_len = strlen (name);
549 new_name = ggc_alloc_string (NULL, name_len + CHKR_PREFIX_SIZE);
550 memcpy (new_name, CHKR_PREFIX, CHKR_PREFIX_SIZE);
551 memcpy (new_name + CHKR_PREFIX_SIZE, name, name_len + 1);
556 if (DECL_RTL (decl) == 0)
558 DECL_ASSEMBLER_NAME (decl) = get_identifier (name);
560 = gen_rtx_MEM (DECL_MODE (decl),
561 gen_rtx_SYMBOL_REF (Pmode, name));
563 /* Optionally set flags or add text to the name to record information
564 such as that it is a function name. If the name is changed, the macro
565 ASM_OUTPUT_LABELREF will have to know how to strip this information. */
566 #ifdef ENCODE_SECTION_INFO
567 ENCODE_SECTION_INFO (decl);
572 /* ??? Another way to do this would be to do what halfpic.c does
573 and maintain a hashed table of such critters. */
574 /* ??? Another way to do this would be to pass a flag bit to
575 ENCODE_SECTION_INFO saying whether this is a new decl or not. */
576 /* Let the target reassign the RTL if it wants.
577 This is necessary, for example, when one machine specific
578 decl attribute overrides another. */
579 #ifdef REDO_SECTION_INFO_P
580 if (REDO_SECTION_INFO_P (decl))
581 ENCODE_SECTION_INFO (decl);
586 /* Given NAME, a putative register name, discard any customary prefixes. */
589 strip_reg_name (name)
592 #ifdef REGISTER_PREFIX
593 if (!strncmp (name, REGISTER_PREFIX, strlen (REGISTER_PREFIX)))
594 name += strlen (REGISTER_PREFIX);
596 if (name[0] == '%' || name[0] == '#')
601 /* Decode an `asm' spec for a declaration as a register name.
602 Return the register number, or -1 if nothing specified,
603 or -2 if the ASMSPEC is not `cc' or `memory' and is not recognized,
604 or -3 if ASMSPEC is `cc' and is not recognized,
605 or -4 if ASMSPEC is `memory' and is not recognized.
606 Accept an exact spelling or a decimal number.
607 Prefixes such as % are optional. */
610 decode_reg_name (asmspec)
617 /* Get rid of confusing prefixes. */
618 asmspec = strip_reg_name (asmspec);
620 /* Allow a decimal number as a "register name". */
621 for (i = strlen (asmspec) - 1; i >= 0; i--)
622 if (! (asmspec[i] >= '0' && asmspec[i] <= '9'))
624 if (asmspec[0] != 0 && i < 0)
627 if (i < FIRST_PSEUDO_REGISTER && i >= 0)
633 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
635 && ! strcmp (asmspec, strip_reg_name (reg_names[i])))
638 #ifdef ADDITIONAL_REGISTER_NAMES
640 static struct { const char *name; int number; } table[]
641 = ADDITIONAL_REGISTER_NAMES;
643 for (i = 0; i < (int)(sizeof (table) / sizeof (table[0])); i++)
644 if (! strcmp (asmspec, table[i].name))
645 return table[i].number;
647 #endif /* ADDITIONAL_REGISTER_NAMES */
649 if (!strcmp (asmspec, "memory"))
652 if (!strcmp (asmspec, "cc"))
661 /* Create the DECL_RTL for a declaration for a static or external variable
662 or static or external function.
663 ASMSPEC, if not 0, is the string which the user specified
664 as the assembler symbol name.
665 TOP_LEVEL is nonzero if this is a file-scope variable.
667 This is never called for PARM_DECL nodes. */
670 make_decl_rtl (decl, asmspec, top_level)
675 register char *name = 0;
678 reg_number = decode_reg_name (asmspec);
680 if (DECL_ASSEMBLER_NAME (decl) != NULL_TREE)
681 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
683 if (reg_number == -2)
685 /* ASMSPEC is given, and not the name of a register. */
686 size_t len = strlen (asmspec);
688 name = ggc_alloc_string (NULL, len + 1);
690 memcpy (&name[1], asmspec, len + 1);
693 /* For a duplicate declaration, we can be called twice on the
694 same DECL node. Don't discard the RTL already made. */
695 if (DECL_RTL (decl) == 0)
697 /* First detect errors in declaring global registers. */
698 if (TREE_CODE (decl) != FUNCTION_DECL
699 && DECL_REGISTER (decl) && reg_number == -1)
700 error_with_decl (decl,
701 "register name not specified for `%s'");
702 else if (TREE_CODE (decl) != FUNCTION_DECL
703 && DECL_REGISTER (decl) && reg_number < 0)
704 error_with_decl (decl,
705 "invalid register name for `%s'");
706 else if ((reg_number >= 0 || reg_number == -3)
707 && (TREE_CODE (decl) == FUNCTION_DECL
708 && ! DECL_REGISTER (decl)))
709 error_with_decl (decl,
710 "register name given for non-register variable `%s'");
711 else if (TREE_CODE (decl) != FUNCTION_DECL
712 && DECL_REGISTER (decl)
713 && TYPE_MODE (TREE_TYPE (decl)) == BLKmode)
714 error_with_decl (decl,
715 "data type of `%s' isn't suitable for a register");
716 else if (TREE_CODE (decl) != FUNCTION_DECL && DECL_REGISTER (decl)
717 && ! HARD_REGNO_MODE_OK (reg_number,
718 TYPE_MODE (TREE_TYPE (decl))))
719 error_with_decl (decl,
720 "register number for `%s' isn't suitable for data type");
721 /* Now handle properly declared static register variables. */
722 else if (TREE_CODE (decl) != FUNCTION_DECL && DECL_REGISTER (decl))
726 if (DECL_INITIAL (decl) != 0 && top_level)
728 DECL_INITIAL (decl) = 0;
729 error ("global register variable has initial value");
731 if (TREE_THIS_VOLATILE (decl))
732 warning ("volatile register variables don't work as you might wish");
734 /* If the user specified one of the eliminables registers here,
735 e.g., FRAME_POINTER_REGNUM, we don't want to get this variable
736 confused with that register and be eliminated. Although this
737 usage is somewhat suspect, we nevertheless use the following
738 kludge to avoid setting DECL_RTL to frame_pointer_rtx. */
741 = gen_rtx_REG (DECL_MODE (decl), FIRST_PSEUDO_REGISTER);
742 REGNO (DECL_RTL (decl)) = reg_number;
743 REG_USERVAR_P (DECL_RTL (decl)) = 1;
747 /* Make this register global, so not usable for anything
749 #ifdef ASM_DECLARE_REGISTER_GLOBAL
750 ASM_DECLARE_REGISTER_GLOBAL (asm_out_file, decl, reg_number, name);
752 nregs = HARD_REGNO_NREGS (reg_number, DECL_MODE (decl));
754 globalize_reg (reg_number + --nregs);
757 /* Specifying a section attribute on a variable forces it into a
758 non-.bss section, and thus it cannot be common. */
759 else if (TREE_CODE (decl) == VAR_DECL
760 && DECL_SECTION_NAME (decl) != NULL_TREE
761 && DECL_INITIAL (decl) == NULL_TREE
762 && DECL_COMMON (decl))
763 DECL_COMMON (decl) = 0;
765 /* Now handle ordinary static variables and functions (in memory).
766 Also handle vars declared register invalidly. */
767 if (DECL_RTL (decl) == 0)
769 /* Can't use just the variable's own name for a variable
770 whose scope is less than the whole file, unless it's a member
771 of a local class (which will already be unambiguous).
772 Concatenate a distinguishing number. */
773 if (!top_level && !TREE_PUBLIC (decl)
774 && ! TYPE_P (DECL_CONTEXT (decl))
779 ASM_FORMAT_PRIVATE_NAME (label, name, var_labelno);
780 name = ggc_alloc_string (label, -1);
787 /* When -fprefix-function-name is used, the functions
788 names are prefixed. Only nested function names are not
790 if (flag_prefix_function_name && TREE_CODE (decl) == FUNCTION_DECL)
792 size_t name_len = strlen (name);
795 new_name = ggc_alloc_string (NULL, name_len + CHKR_PREFIX_SIZE);
796 memcpy (new_name, CHKR_PREFIX, CHKR_PREFIX_SIZE);
797 memcpy (new_name + CHKR_PREFIX_SIZE, name, name_len + 1);
801 DECL_ASSEMBLER_NAME (decl) = get_identifier (name);
802 DECL_RTL (decl) = gen_rtx_MEM (DECL_MODE (decl),
803 gen_rtx_SYMBOL_REF (Pmode, name));
804 MEM_ALIAS_SET (DECL_RTL (decl)) = get_alias_set (decl);
806 /* If this variable is to be treated as volatile, show its
807 tree node has side effects. If it has side effects, either
808 because of this test or from TREE_THIS_VOLATILE also
809 being set, show the MEM is volatile. */
810 if (flag_volatile_global && TREE_CODE (decl) == VAR_DECL
811 && TREE_PUBLIC (decl))
812 TREE_SIDE_EFFECTS (decl) = 1;
813 else if (flag_volatile_static && TREE_CODE (decl) == VAR_DECL
814 && (TREE_PUBLIC (decl) || TREE_STATIC (decl)))
815 TREE_SIDE_EFFECTS (decl) = 1;
817 if (TREE_SIDE_EFFECTS (decl))
818 MEM_VOLATILE_P (DECL_RTL (decl)) = 1;
820 if (TREE_READONLY (decl))
821 RTX_UNCHANGING_P (DECL_RTL (decl)) = 1;
822 MEM_SET_IN_STRUCT_P (DECL_RTL (decl),
823 AGGREGATE_TYPE_P (TREE_TYPE (decl)));
825 /* Optionally set flags or add text to the name to record information
826 such as that it is a function name.
827 If the name is changed, the macro ASM_OUTPUT_LABELREF
828 will have to know how to strip this information. */
829 #ifdef ENCODE_SECTION_INFO
830 ENCODE_SECTION_INFO (decl);
836 /* If the old RTL had the wrong mode, fix the mode. */
837 if (GET_MODE (DECL_RTL (decl)) != DECL_MODE (decl))
839 rtx rtl = DECL_RTL (decl);
840 PUT_MODE (rtl, DECL_MODE (decl));
843 /* ??? Another way to do this would be to do what halfpic.c does
844 and maintain a hashed table of such critters. */
845 /* ??? Another way to do this would be to pass a flag bit to
846 ENCODE_SECTION_INFO saying whether this is a new decl or not. */
847 /* Let the target reassign the RTL if it wants.
848 This is necessary, for example, when one machine specific
849 decl attribute overrides another. */
850 #ifdef REDO_SECTION_INFO_P
851 if (REDO_SECTION_INFO_P (decl))
852 ENCODE_SECTION_INFO (decl);
857 /* Make the rtl for variable VAR be volatile.
858 Use this only for static variables. */
861 make_var_volatile (var)
864 if (GET_CODE (DECL_RTL (var)) != MEM)
867 MEM_VOLATILE_P (DECL_RTL (var)) = 1;
870 /* Output alignment directive to align for constant expression EXP. */
873 assemble_constant_align (exp)
878 /* Align the location counter as required by EXP's data type. */
879 align = TYPE_ALIGN (TREE_TYPE (exp));
880 #ifdef CONSTANT_ALIGNMENT
881 align = CONSTANT_ALIGNMENT (exp, align);
884 if (align > BITS_PER_UNIT)
885 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
888 /* Output a string of literal assembler code
889 for an `asm' keyword used between functions. */
892 assemble_asm (string)
897 if (TREE_CODE (string) == ADDR_EXPR)
898 string = TREE_OPERAND (string, 0);
900 fprintf (asm_out_file, "\t%s\n", TREE_STRING_POINTER (string));
903 #if 0 /* This should no longer be needed, because
904 flag_gnu_linker should be 0 on these systems,
905 which should prevent any output
906 if ASM_OUTPUT_CONSTRUCTOR and ASM_OUTPUT_DESTRUCTOR are absent. */
907 #if !(defined(DBX_DEBUGGING_INFO) && !defined(FASCIST_ASSEMBLER))
908 #ifndef ASM_OUTPUT_CONSTRUCTOR
909 #define ASM_OUTPUT_CONSTRUCTOR(file, name)
911 #ifndef ASM_OUTPUT_DESTRUCTOR
912 #define ASM_OUTPUT_DESTRUCTOR(file, name)
917 /* Record an element in the table of global destructors.
918 How this is done depends on what sort of assembler and linker
921 NAME should be the name of a global function to be called
922 at exit time. This name is output using assemble_name. */
925 assemble_destructor (name)
928 #ifdef ASM_OUTPUT_DESTRUCTOR
929 ASM_OUTPUT_DESTRUCTOR (asm_out_file, name);
933 /* Now tell GNU LD that this is part of the static destructor set. */
934 /* This code works for any machine provided you use GNU as/ld. */
935 fprintf (asm_out_file, "%s \"___DTOR_LIST__\",22,0,0,", ASM_STABS_OP);
936 assemble_name (asm_out_file, name);
937 fputc ('\n', asm_out_file);
942 /* Likewise for global constructors. */
945 assemble_constructor (name)
948 #ifdef ASM_OUTPUT_CONSTRUCTOR
949 ASM_OUTPUT_CONSTRUCTOR (asm_out_file, name);
953 /* Now tell GNU LD that this is part of the static constructor set. */
954 /* This code works for any machine provided you use GNU as/ld. */
955 fprintf (asm_out_file, "%s \"___CTOR_LIST__\",22,0,0,", ASM_STABS_OP);
956 assemble_name (asm_out_file, name);
957 fputc ('\n', asm_out_file);
962 /* Likewise for entries we want to record for garbage collection.
963 Garbage collection is still under development. */
966 assemble_gc_entry (name)
969 #ifdef ASM_OUTPUT_GC_ENTRY
970 ASM_OUTPUT_GC_ENTRY (asm_out_file, name);
974 /* Now tell GNU LD that this is part of the static constructor set. */
975 fprintf (asm_out_file, "%s \"___PTR_LIST__\",22,0,0,", ASM_STABS_OP);
976 assemble_name (asm_out_file, name);
977 fputc ('\n', asm_out_file);
982 /* CONSTANT_POOL_BEFORE_FUNCTION may be defined as an expression with
983 a non-zero value if the constant pool should be output before the
984 start of the function, or a zero value if the pool should output
985 after the end of the function. The default is to put it before the
988 #ifndef CONSTANT_POOL_BEFORE_FUNCTION
989 #define CONSTANT_POOL_BEFORE_FUNCTION 1
992 /* Output assembler code for the constant pool of a function and associated
993 with defining the name of the function. DECL describes the function.
994 NAME is the function's name. For the constant pool, we use the current
995 constant pool data. */
998 assemble_start_function (decl, fnname)
1004 /* The following code does not need preprocessing in the assembler. */
1008 if (CONSTANT_POOL_BEFORE_FUNCTION)
1009 output_constant_pool (fnname, decl);
1011 #ifdef ASM_OUTPUT_SECTION_NAME
1012 /* If the function is to be put in its own section and it's not in a section
1013 already, indicate so. */
1014 if ((flag_function_sections
1015 && DECL_SECTION_NAME (decl) == NULL_TREE)
1016 || UNIQUE_SECTION_P (decl))
1017 UNIQUE_SECTION (decl, 0);
1020 function_section (decl);
1022 /* Tell assembler to move to target machine's alignment for functions. */
1023 align = floor_log2 (FUNCTION_BOUNDARY / BITS_PER_UNIT);
1025 ASM_OUTPUT_ALIGN (asm_out_file, align);
1027 /* Handle a user-specified function alignment.
1028 Note that we still need to align to FUNCTION_BOUNDARY, as above,
1029 because ASM_OUTPUT_MAX_SKIP_ALIGN might not do any alignment at all. */
1030 if (align_functions_log > align)
1032 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
1033 ASM_OUTPUT_MAX_SKIP_ALIGN (asm_out_file,
1034 align_functions_log, align_functions-1);
1036 ASM_OUTPUT_ALIGN (asm_out_file, align_functions_log);
1040 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
1041 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file, fnname);
1044 #ifdef SDB_DEBUGGING_INFO
1045 /* Output SDB definition of the function. */
1046 if (write_symbols == SDB_DEBUG)
1047 sdbout_mark_begin_function ();
1050 #ifdef DBX_DEBUGGING_INFO
1051 /* Output DBX definition of the function. */
1052 if (write_symbols == DBX_DEBUG)
1053 dbxout_begin_function (decl);
1056 /* Make function name accessible from other files, if appropriate. */
1058 if (TREE_PUBLIC (decl))
1060 if (! first_global_object_name)
1065 if (! DECL_WEAK (decl) && ! DECL_ONE_ONLY (decl))
1066 name = &first_global_object_name;
1068 name = &weak_global_object_name;
1070 STRIP_NAME_ENCODING (p, fnname);
1071 *name = permalloc (strlen (p) + 1);
1075 #ifdef ASM_WEAKEN_LABEL
1076 if (DECL_WEAK (decl))
1078 ASM_WEAKEN_LABEL (asm_out_file, fnname);
1079 /* Remove this function from the pending weak list so that
1080 we do not emit multiple .weak directives for it. */
1081 remove_from_pending_weak_list
1082 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl)));
1086 ASM_GLOBALIZE_LABEL (asm_out_file, fnname);
1089 /* Do any machine/system dependent processing of the function name */
1090 #ifdef ASM_DECLARE_FUNCTION_NAME
1091 ASM_DECLARE_FUNCTION_NAME (asm_out_file, fnname, current_function_decl);
1093 /* Standard thing is just output label for the function. */
1094 ASM_OUTPUT_LABEL (asm_out_file, fnname);
1095 #endif /* ASM_DECLARE_FUNCTION_NAME */
1098 /* Output assembler code associated with defining the size of the
1099 function. DECL describes the function. NAME is the function's name. */
1102 assemble_end_function (decl, fnname)
1106 #ifdef ASM_DECLARE_FUNCTION_SIZE
1107 ASM_DECLARE_FUNCTION_SIZE (asm_out_file, fnname, decl);
1109 if (! CONSTANT_POOL_BEFORE_FUNCTION)
1111 output_constant_pool (fnname, decl);
1112 function_section (decl); /* need to switch back */
1115 /* Output any constants which should appear after the function. */
1116 output_after_function_constants ();
1119 /* Assemble code to leave SIZE bytes of zeros. */
1122 assemble_zeros (size)
1125 /* Do no output if -fsyntax-only. */
1126 if (flag_syntax_only)
1129 #ifdef ASM_NO_SKIP_IN_TEXT
1130 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
1131 so we must output 0s explicitly in the text section. */
1132 if (ASM_NO_SKIP_IN_TEXT && in_text_section ())
1136 for (i = 0; i < size - 20; i += 20)
1139 fprintf (asm_out_file,
1140 "%s 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n", ASM_BYTE_OP);
1142 fprintf (asm_out_file,
1143 "\tbyte 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n");
1149 fprintf (asm_out_file, "%s 0", ASM_BYTE_OP);
1151 fprintf (asm_out_file, "\tbyte 0");
1154 for (; i < size; i++)
1155 fprintf (asm_out_file, ",0");
1156 fprintf (asm_out_file, "\n");
1162 ASM_OUTPUT_SKIP (asm_out_file, size);
1165 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
1168 assemble_align (align)
1171 if (align > BITS_PER_UNIT)
1172 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
1175 /* Assemble a string constant with the specified C string as contents. */
1178 assemble_string (p, size)
1185 /* If the string is very long, split it up. */
1189 int thissize = size - pos;
1190 if (thissize > maximum)
1193 ASM_OUTPUT_ASCII (asm_out_file, p, thissize);
1201 #if defined ASM_OUTPUT_ALIGNED_DECL_LOCAL
1202 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1203 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1205 #if defined ASM_OUTPUT_ALIGNED_LOCAL
1206 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1207 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, DECL_ALIGN (decl))
1209 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1210 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded)
1214 #if defined ASM_OUTPUT_ALIGNED_BSS
1215 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1216 ASM_OUTPUT_ALIGNED_BSS (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1218 #if defined ASM_OUTPUT_BSS
1219 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1220 ASM_OUTPUT_BSS (asm_out_file, decl, name, size, rounded)
1226 #if defined ASM_OUTPUT_ALIGNED_DECL_COMMON
1227 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1228 ASM_OUTPUT_ALIGNED_DECL_COMMON (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1230 #if defined ASM_OUTPUT_ALIGNED_COMMON
1231 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1232 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file, name, size, DECL_ALIGN (decl))
1234 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1235 ASM_OUTPUT_COMMON (asm_out_file, name, size, rounded)
1240 asm_emit_uninitialised (decl, name, size, rounded)
1243 int size ATTRIBUTE_UNUSED;
1244 int rounded ATTRIBUTE_UNUSED;
1252 destination = asm_dest_local;
1254 if (TREE_PUBLIC (decl))
1256 #if defined ASM_EMIT_BSS
1257 if (! DECL_COMMON (decl))
1258 destination = asm_dest_bss;
1261 destination = asm_dest_common;
1264 if (flag_shared_data)
1266 switch (destination)
1268 #ifdef ASM_OUTPUT_SHARED_BSS
1270 ASM_OUTPUT_SHARED_BSS (asm_out_file, decl, name, size, rounded);
1273 #ifdef ASM_OUTPUT_SHARED_COMMON
1274 case asm_dest_common:
1275 ASM_OUTPUT_SHARED_COMMON (asm_out_file, name, size, rounded);
1278 #ifdef ASM_OUTPUT_SHARED_LOCAL
1279 case asm_dest_local:
1280 ASM_OUTPUT_SHARED_LOCAL (asm_out_file, name, size, rounded);
1288 #ifdef ASM_OUTPUT_SECTION_NAME
1289 /* We already know that DECL_SECTION_NAME() == NULL. */
1290 if (flag_data_sections != 0 || UNIQUE_SECTION_P (decl))
1291 UNIQUE_SECTION (decl, NULL);
1294 switch (destination)
1298 ASM_EMIT_BSS (decl, name, size, rounded);
1301 case asm_dest_common:
1302 ASM_EMIT_COMMON (decl, name, size, rounded);
1304 case asm_dest_local:
1305 ASM_EMIT_LOCAL (decl, name, size, rounded);
1314 /* Assemble everything that is needed for a variable or function declaration.
1315 Not used for automatic variables, and not used for function definitions.
1316 Should not be called for variables of incomplete structure type.
1318 TOP_LEVEL is nonzero if this variable has file scope.
1319 AT_END is nonzero if this is the special handling, at end of compilation,
1320 to define things that have had only tentative definitions.
1321 DONT_OUTPUT_DATA if nonzero means don't actually output the
1322 initial value (that will be done by the caller). */
1325 assemble_variable (decl, top_level, at_end, dont_output_data)
1327 int top_level ATTRIBUTE_UNUSED;
1328 int at_end ATTRIBUTE_UNUSED;
1329 int dont_output_data;
1331 register char *name;
1333 tree size_tree = NULL_TREE;
1335 enum in_section saved_in_section;
1337 last_assemble_variable_decl = 0;
1339 if (GET_CODE (DECL_RTL (decl)) == REG)
1341 /* Do output symbol info for global register variables, but do nothing
1344 if (TREE_ASM_WRITTEN (decl))
1346 TREE_ASM_WRITTEN (decl) = 1;
1348 /* Do no output if -fsyntax-only. */
1349 if (flag_syntax_only)
1352 #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
1353 /* File-scope global variables are output here. */
1354 if ((write_symbols == DBX_DEBUG || write_symbols == XCOFF_DEBUG)
1356 dbxout_symbol (decl, 0);
1358 #ifdef SDB_DEBUGGING_INFO
1359 if (write_symbols == SDB_DEBUG && top_level
1360 /* Leave initialized global vars for end of compilation;
1361 see comment in compile_file. */
1362 && (TREE_PUBLIC (decl) == 0 || DECL_INITIAL (decl) == 0))
1363 sdbout_symbol (decl, 0);
1366 /* Don't output any DWARF debugging information for variables here.
1367 In the case of local variables, the information for them is output
1368 when we do our recursive traversal of the tree representation for
1369 the entire containing function. In the case of file-scope variables,
1370 we output information for all of them at the very end of compilation
1371 while we are doing our final traversal of the chain of file-scope
1377 /* Normally no need to say anything here for external references,
1378 since assemble_external is called by the language-specific code
1379 when a declaration is first seen. */
1381 if (DECL_EXTERNAL (decl))
1384 /* Output no assembler code for a function declaration.
1385 Only definitions of functions output anything. */
1387 if (TREE_CODE (decl) == FUNCTION_DECL)
1390 /* If type was incomplete when the variable was declared,
1391 see if it is complete now. */
1393 if (DECL_SIZE (decl) == 0)
1394 layout_decl (decl, 0);
1396 /* Still incomplete => don't allocate it; treat the tentative defn
1397 (which is what it must have been) as an `extern' reference. */
1399 if (!dont_output_data && DECL_SIZE (decl) == 0)
1401 error_with_file_and_line (DECL_SOURCE_FILE (decl),
1402 DECL_SOURCE_LINE (decl),
1403 "storage size of `%s' isn't known",
1404 IDENTIFIER_POINTER (DECL_NAME (decl)));
1405 TREE_ASM_WRITTEN (decl) = 1;
1409 /* The first declaration of a variable that comes through this function
1410 decides whether it is global (in C, has external linkage)
1411 or local (in C, has internal linkage). So do nothing more
1412 if this function has already run. */
1414 if (TREE_ASM_WRITTEN (decl))
1417 TREE_ASM_WRITTEN (decl) = 1;
1419 /* Do no output if -fsyntax-only. */
1420 if (flag_syntax_only)
1425 if (! dont_output_data)
1429 if (TREE_CODE (DECL_SIZE_UNIT (decl)) != INTEGER_CST)
1432 size_tree = DECL_SIZE_UNIT (decl);
1433 size = TREE_INT_CST_LOW (size_tree);
1435 if (TREE_INT_CST_HIGH (size_tree) != 0
1436 || size != TREE_INT_CST_LOW (size_tree))
1438 error_with_decl (decl, "size of variable `%s' is too large");
1443 name = XSTR (XEXP (DECL_RTL (decl), 0), 0);
1444 if (TREE_PUBLIC (decl) && DECL_NAME (decl)
1445 && ! first_global_object_name
1446 && ! (DECL_COMMON (decl) && (DECL_INITIAL (decl) == 0
1447 || DECL_INITIAL (decl) == error_mark_node))
1448 && ! DECL_WEAK (decl)
1449 && ! DECL_ONE_ONLY (decl))
1453 STRIP_NAME_ENCODING (p, name);
1454 first_global_object_name = permalloc (strlen (p) + 1);
1455 strcpy (first_global_object_name, p);
1458 /* Compute the alignment of this data. */
1460 align = DECL_ALIGN (decl);
1462 /* In the case for initialing an array whose length isn't specified,
1463 where we have not yet been able to do the layout,
1464 figure out the proper alignment now. */
1465 if (dont_output_data && DECL_SIZE (decl) == 0
1466 && TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE)
1467 align = MAX (align, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl))));
1469 /* Some object file formats have a maximum alignment which they support.
1470 In particular, a.out format supports a maximum alignment of 4. */
1471 #ifndef MAX_OFILE_ALIGNMENT
1472 #define MAX_OFILE_ALIGNMENT BIGGEST_ALIGNMENT
1474 if (align > MAX_OFILE_ALIGNMENT)
1476 warning_with_decl (decl,
1477 "alignment of `%s' is greater than maximum object file alignment. Using %d.",
1478 MAX_OFILE_ALIGNMENT/BITS_PER_UNIT);
1479 align = MAX_OFILE_ALIGNMENT;
1482 /* On some machines, it is good to increase alignment sometimes. */
1483 #ifdef DATA_ALIGNMENT
1484 align = DATA_ALIGNMENT (TREE_TYPE (decl), align);
1486 #ifdef CONSTANT_ALIGNMENT
1487 if (DECL_INITIAL (decl) != 0 && DECL_INITIAL (decl) != error_mark_node)
1488 align = CONSTANT_ALIGNMENT (DECL_INITIAL (decl), align);
1491 /* Reset the alignment in case we have made it tighter, so we can benefit
1492 from it in get_pointer_alignment. */
1493 DECL_ALIGN (decl) = align;
1495 /* Handle uninitialized definitions. */
1497 if ((DECL_INITIAL (decl) == 0 || DECL_INITIAL (decl) == error_mark_node)
1498 /* If the target can't output uninitialized but not common global data
1499 in .bss, then we have to use .data. */
1500 #if ! defined ASM_EMIT_BSS
1501 && DECL_COMMON (decl)
1503 && DECL_SECTION_NAME (decl) == NULL_TREE
1504 && ! dont_output_data)
1506 int size = TREE_INT_CST_LOW (size_tree);
1509 /* Don't allocate zero bytes of common,
1510 since that means "undefined external" in the linker. */
1511 if (size == 0) rounded = 1;
1512 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1513 so that each uninitialized object starts on such a boundary. */
1514 rounded += (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1;
1515 rounded = (rounded / (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
1516 * (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
1518 #if !defined(ASM_OUTPUT_ALIGNED_COMMON) && !defined(ASM_OUTPUT_ALIGNED_BSS)
1519 if ((DECL_ALIGN (decl) / BITS_PER_UNIT) > (unsigned int) rounded)
1521 (decl, "requested alignment for %s is greater than implemented alignment of %d.",rounded);
1524 #ifdef DBX_DEBUGGING_INFO
1525 /* File-scope global variables are output here. */
1526 if (write_symbols == DBX_DEBUG && top_level)
1527 dbxout_symbol (decl, 0);
1529 #ifdef SDB_DEBUGGING_INFO
1530 if (write_symbols == SDB_DEBUG && top_level
1531 /* Leave initialized global vars for end of compilation;
1532 see comment in compile_file. */
1533 && (TREE_PUBLIC (decl) == 0 || DECL_INITIAL (decl) == 0))
1534 sdbout_symbol (decl, 0);
1537 /* Don't output any DWARF debugging information for variables here.
1538 In the case of local variables, the information for them is output
1539 when we do our recursive traversal of the tree representation for
1540 the entire containing function. In the case of file-scope variables,
1541 we output information for all of them at the very end of compilation
1542 while we are doing our final traversal of the chain of file-scope
1545 #if 0 /* ??? We should either delete this or add a comment describing what
1546 it was intended to do and why we shouldn't delete it. */
1547 if (flag_shared_data)
1550 asm_emit_uninitialised (decl, name, size, rounded);
1555 /* Handle initialized definitions.
1556 Also handle uninitialized global definitions if -fno-common and the
1557 target doesn't support ASM_OUTPUT_BSS. */
1559 /* First make the assembler name(s) global if appropriate. */
1560 if (TREE_PUBLIC (decl) && DECL_NAME (decl))
1562 #ifdef ASM_WEAKEN_LABEL
1563 if (DECL_WEAK (decl))
1565 ASM_WEAKEN_LABEL (asm_out_file, name);
1566 /* Remove this variable from the pending weak list so that
1567 we do not emit multiple .weak directives for it. */
1568 remove_from_pending_weak_list
1569 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl)));
1573 ASM_GLOBALIZE_LABEL (asm_out_file, name);
1576 for (d = equivalents; d; d = TREE_CHAIN (d))
1578 tree e = TREE_VALUE (d);
1579 if (TREE_PUBLIC (e) && DECL_NAME (e))
1580 ASM_GLOBALIZE_LABEL (asm_out_file,
1581 XSTR (XEXP (DECL_RTL (e), 0), 0));
1585 /* Output any data that we will need to use the address of. */
1586 if (DECL_INITIAL (decl) == error_mark_node)
1587 reloc = contains_pointers_p (TREE_TYPE (decl));
1588 else if (DECL_INITIAL (decl))
1589 reloc = output_addressed_constants (DECL_INITIAL (decl));
1591 #ifdef ASM_OUTPUT_SECTION_NAME
1592 if ((flag_data_sections != 0 && DECL_SECTION_NAME (decl) == NULL_TREE)
1593 || UNIQUE_SECTION_P (decl))
1594 UNIQUE_SECTION (decl, reloc);
1597 /* Switch to the appropriate section. */
1598 variable_section (decl, reloc);
1600 /* dbxout.c needs to know this. */
1601 if (in_text_section ())
1602 DECL_IN_TEXT_SECTION (decl) = 1;
1604 /* Record current section so we can restore it if dbxout.c clobbers it. */
1605 saved_in_section = in_section;
1607 /* Output the dbx info now that we have chosen the section. */
1609 #ifdef DBX_DEBUGGING_INFO
1610 /* File-scope global variables are output here. */
1611 if (write_symbols == DBX_DEBUG && top_level)
1612 dbxout_symbol (decl, 0);
1614 #ifdef SDB_DEBUGGING_INFO
1615 if (write_symbols == SDB_DEBUG && top_level
1616 /* Leave initialized global vars for end of compilation;
1617 see comment in compile_file. */
1618 && (TREE_PUBLIC (decl) == 0 || DECL_INITIAL (decl) == 0))
1619 sdbout_symbol (decl, 0);
1622 /* Don't output any DWARF debugging information for variables here.
1623 In the case of local variables, the information for them is output
1624 when we do our recursive traversal of the tree representation for
1625 the entire containing function. In the case of file-scope variables,
1626 we output information for all of them at the very end of compilation
1627 while we are doing our final traversal of the chain of file-scope
1630 /* If the debugging output changed sections, reselect the section
1631 that's supposed to be selected. */
1632 if (in_section != saved_in_section)
1633 variable_section (decl, reloc);
1635 /* Output the alignment of this data. */
1636 if (align > BITS_PER_UNIT)
1637 ASM_OUTPUT_ALIGN (asm_out_file,
1638 floor_log2 (DECL_ALIGN (decl) / BITS_PER_UNIT));
1640 /* Do any machine/system dependent processing of the object. */
1641 #ifdef ASM_DECLARE_OBJECT_NAME
1642 last_assemble_variable_decl = decl;
1643 ASM_DECLARE_OBJECT_NAME (asm_out_file, name, decl);
1645 /* Standard thing is just output label for the object. */
1646 ASM_OUTPUT_LABEL (asm_out_file, name);
1647 #endif /* ASM_DECLARE_OBJECT_NAME */
1649 if (!dont_output_data)
1651 if (DECL_INITIAL (decl))
1652 /* Output the actual data. */
1653 output_constant (DECL_INITIAL (decl), TREE_INT_CST_LOW (size_tree));
1655 /* Leave space for it. */
1656 assemble_zeros (TREE_INT_CST_LOW (size_tree));
1660 #ifdef XCOFF_DEBUGGING_INFO
1661 /* Unfortunately, the IBM assembler cannot handle stabx before the actual
1662 declaration. When something like ".stabx "aa:S-2",aa,133,0" is emitted
1663 and `aa' hasn't been output yet, the assembler generates a stab entry with
1664 a value of zero, in addition to creating an unnecessary external entry
1665 for `aa'. Hence, we must postpone dbxout_symbol to here at the end. */
1667 /* File-scope global variables are output here. */
1668 if (write_symbols == XCOFF_DEBUG && top_level)
1670 saved_in_section = in_section;
1672 dbxout_symbol (decl, 0);
1674 if (in_section != saved_in_section)
1675 variable_section (decl, reloc);
1678 /* There must be a statement after a label. */
1683 /* Return 1 if type TYPE contains any pointers. */
1686 contains_pointers_p (type)
1689 switch (TREE_CODE (type))
1692 case REFERENCE_TYPE:
1693 /* I'm not sure whether OFFSET_TYPE needs this treatment,
1694 so I'll play safe and return 1. */
1700 case QUAL_UNION_TYPE:
1703 /* For a type that has fields, see if the fields have pointers. */
1704 for (fields = TYPE_FIELDS (type); fields; fields = TREE_CHAIN (fields))
1705 if (TREE_CODE (fields) == FIELD_DECL
1706 && contains_pointers_p (TREE_TYPE (fields)))
1712 /* An array type contains pointers if its element type does. */
1713 return contains_pointers_p (TREE_TYPE (type));
1720 /* Output something to declare an external symbol to the assembler.
1721 (Most assemblers don't need this, so we normally output nothing.)
1722 Do nothing if DECL is not external. */
1725 assemble_external (decl)
1726 tree decl ATTRIBUTE_UNUSED;
1728 #ifdef ASM_OUTPUT_EXTERNAL
1729 if (TREE_CODE_CLASS (TREE_CODE (decl)) == 'd'
1730 && DECL_EXTERNAL (decl) && TREE_PUBLIC (decl))
1732 rtx rtl = DECL_RTL (decl);
1734 if (GET_CODE (rtl) == MEM && GET_CODE (XEXP (rtl, 0)) == SYMBOL_REF
1735 && ! SYMBOL_REF_USED (XEXP (rtl, 0)))
1737 /* Some systems do require some output. */
1738 SYMBOL_REF_USED (XEXP (rtl, 0)) = 1;
1739 ASM_OUTPUT_EXTERNAL (asm_out_file, decl, XSTR (XEXP (rtl, 0), 0));
1745 /* Similar, for calling a library function FUN. */
1748 assemble_external_libcall (fun)
1749 rtx fun ATTRIBUTE_UNUSED;
1751 #ifdef ASM_OUTPUT_EXTERNAL_LIBCALL
1752 /* Declare library function name external when first used, if nec. */
1753 if (! SYMBOL_REF_USED (fun))
1755 SYMBOL_REF_USED (fun) = 1;
1756 ASM_OUTPUT_EXTERNAL_LIBCALL (asm_out_file, fun);
1761 /* Declare the label NAME global. */
1764 assemble_global (name)
1767 ASM_GLOBALIZE_LABEL (asm_out_file, name);
1770 /* Assemble a label named NAME. */
1773 assemble_label (name)
1776 ASM_OUTPUT_LABEL (asm_out_file, name);
1779 /* Output to FILE a reference to the assembler name of a C-level name NAME.
1780 If NAME starts with a *, the rest of NAME is output verbatim.
1781 Otherwise NAME is transformed in an implementation-defined way
1782 (usually by the addition of an underscore).
1783 Many macros in the tm file are defined to call this function. */
1786 assemble_name (file, name)
1790 const char *real_name;
1793 STRIP_NAME_ENCODING (real_name, name);
1794 if (flag_prefix_function_name
1795 && ! bcmp (real_name, CHKR_PREFIX, CHKR_PREFIX_SIZE))
1796 real_name = real_name + CHKR_PREFIX_SIZE;
1798 id = maybe_get_identifier (real_name);
1800 TREE_SYMBOL_REFERENCED (id) = 1;
1803 fputs (&name[1], file);
1805 ASM_OUTPUT_LABELREF (file, name);
1808 /* Allocate SIZE bytes writable static space with a gensym name
1809 and return an RTX to refer to its address. */
1812 assemble_static_space (size)
1820 if (flag_shared_data)
1824 ASM_GENERATE_INTERNAL_LABEL (name, "LF", const_labelno);
1826 namestring = ggc_alloc_string (name, -1);
1828 x = gen_rtx_SYMBOL_REF (Pmode, namestring);
1830 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
1831 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, NULL_TREE, name, size,
1834 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1835 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, BIGGEST_ALIGNMENT);
1838 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1839 so that each uninitialized object starts on such a boundary. */
1840 /* Variable `rounded' might or might not be used in ASM_OUTPUT_LOCAL. */
1841 int rounded ATTRIBUTE_UNUSED
1842 = ((size + (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1)
1843 / (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
1844 * (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
1845 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded);
1852 /* Assemble the static constant template for function entry trampolines.
1853 This is done at most once per compilation.
1854 Returns an RTX for the address of the template. */
1856 #ifdef TRAMPOLINE_TEMPLATE
1858 assemble_trampoline_template ()
1864 /* By default, put trampoline templates in read-only data section. */
1866 #ifdef TRAMPOLINE_SECTION
1867 TRAMPOLINE_SECTION ();
1869 readonly_data_section ();
1872 /* Write the assembler code to define one. */
1873 align = floor_log2 (TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT);
1875 ASM_OUTPUT_ALIGN (asm_out_file, align);
1877 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LTRAMP", 0);
1878 TRAMPOLINE_TEMPLATE (asm_out_file);
1880 /* Record the rtl to refer to it. */
1881 ASM_GENERATE_INTERNAL_LABEL (label, "LTRAMP", 0);
1882 name = ggc_alloc_string (label, -1);
1883 return gen_rtx_SYMBOL_REF (Pmode, name);
1887 /* Assemble the integer constant X into an object of SIZE bytes.
1888 X must be either a CONST_INT or CONST_DOUBLE.
1890 Return 1 if we were able to output the constant, otherwise 0. If FORCE is
1891 non-zero, abort if we can't output the constant. */
1894 assemble_integer (x, size, force)
1899 /* First try to use the standard 1, 2, 4, 8, and 16 byte
1900 ASM_OUTPUT... macros. */
1904 #ifdef ASM_OUTPUT_CHAR
1906 ASM_OUTPUT_CHAR (asm_out_file, x);
1910 #ifdef ASM_OUTPUT_SHORT
1912 ASM_OUTPUT_SHORT (asm_out_file, x);
1916 #ifdef ASM_OUTPUT_INT
1918 ASM_OUTPUT_INT (asm_out_file, x);
1922 #ifdef ASM_OUTPUT_DOUBLE_INT
1924 ASM_OUTPUT_DOUBLE_INT (asm_out_file, x);
1928 #ifdef ASM_OUTPUT_QUADRUPLE_INT
1930 ASM_OUTPUT_QUADRUPLE_INT (asm_out_file, x);
1935 /* If we couldn't do it that way, there are two other possibilities: First,
1936 if the machine can output an explicit byte and this is a 1 byte constant,
1937 we can use ASM_OUTPUT_BYTE. */
1939 #ifdef ASM_OUTPUT_BYTE
1940 if (size == 1 && GET_CODE (x) == CONST_INT)
1942 ASM_OUTPUT_BYTE (asm_out_file, INTVAL (x));
1947 /* Finally, if SIZE is larger than a single word, try to output the constant
1948 one word at a time. */
1950 if (size > UNITS_PER_WORD)
1953 enum machine_mode mode
1954 = mode_for_size (size * BITS_PER_UNIT, MODE_INT, 0);
1957 for (i = 0; i < size / UNITS_PER_WORD; i++)
1959 word = operand_subword (x, i, 0, mode);
1964 if (! assemble_integer (word, UNITS_PER_WORD, 0))
1968 if (i == size / UNITS_PER_WORD)
1970 /* If we output at least one word and then could not finish,
1971 there is no valid way to continue. */
1982 /* Assemble the floating-point constant D into an object of size MODE. */
1985 assemble_real (d, mode)
1987 enum machine_mode mode;
1989 jmp_buf output_constant_handler;
1991 if (setjmp (output_constant_handler))
1993 error ("floating point trap outputting a constant");
1994 #ifdef REAL_IS_NOT_DOUBLE
1995 bzero ((char *) &d, sizeof d);
2002 set_float_handler (output_constant_handler);
2006 #ifdef ASM_OUTPUT_BYTE_FLOAT
2008 ASM_OUTPUT_BYTE_FLOAT (asm_out_file, d);
2011 #ifdef ASM_OUTPUT_SHORT_FLOAT
2013 ASM_OUTPUT_SHORT_FLOAT (asm_out_file, d);
2016 #ifdef ASM_OUTPUT_THREE_QUARTER_FLOAT
2018 ASM_OUTPUT_THREE_QUARTER_FLOAT (asm_out_file, d);
2021 #ifdef ASM_OUTPUT_FLOAT
2023 ASM_OUTPUT_FLOAT (asm_out_file, d);
2027 #ifdef ASM_OUTPUT_DOUBLE
2029 ASM_OUTPUT_DOUBLE (asm_out_file, d);
2033 #ifdef ASM_OUTPUT_LONG_DOUBLE
2036 ASM_OUTPUT_LONG_DOUBLE (asm_out_file, d);
2044 set_float_handler (NULL_PTR);
2047 /* Here we combine duplicate floating constants to make
2048 CONST_DOUBLE rtx's, and force those out to memory when necessary. */
2050 /* Return a CONST_DOUBLE or CONST_INT for a value specified as a pair of ints.
2051 For an integer, I0 is the low-order word and I1 is the high-order word.
2052 For a real number, I0 is the word with the low address
2053 and I1 is the word with the high address. */
2056 immed_double_const (i0, i1, mode)
2057 HOST_WIDE_INT i0, i1;
2058 enum machine_mode mode;
2062 if (GET_MODE_CLASS (mode) == MODE_INT
2063 || GET_MODE_CLASS (mode) == MODE_PARTIAL_INT)
2065 /* We clear out all bits that don't belong in MODE, unless they and our
2066 sign bit are all one. So we get either a reasonable negative value
2067 or a reasonable unsigned value for this mode. */
2068 int width = GET_MODE_BITSIZE (mode);
2069 if (width < HOST_BITS_PER_WIDE_INT
2070 && ((i0 & ((HOST_WIDE_INT) (-1) << (width - 1)))
2071 != ((HOST_WIDE_INT) (-1) << (width - 1))))
2072 i0 &= ((HOST_WIDE_INT) 1 << width) - 1, i1 = 0;
2073 else if (width == HOST_BITS_PER_WIDE_INT
2074 && ! (i1 == ~0 && i0 < 0))
2076 else if (width > 2 * HOST_BITS_PER_WIDE_INT)
2077 /* We cannot represent this value as a constant. */
2080 /* If this would be an entire word for the target, but is not for
2081 the host, then sign-extend on the host so that the number will look
2082 the same way on the host that it would on the target.
2084 For example, when building a 64 bit alpha hosted 32 bit sparc
2085 targeted compiler, then we want the 32 bit unsigned value -1 to be
2086 represented as a 64 bit value -1, and not as 0x00000000ffffffff.
2087 The later confuses the sparc backend. */
2089 if (BITS_PER_WORD < HOST_BITS_PER_WIDE_INT && BITS_PER_WORD == width
2090 && (i0 & ((HOST_WIDE_INT) 1 << (width - 1))))
2091 i0 |= ((HOST_WIDE_INT) (-1) << width);
2093 /* If MODE fits within HOST_BITS_PER_WIDE_INT, always use a CONST_INT.
2095 ??? Strictly speaking, this is wrong if we create a CONST_INT
2096 for a large unsigned constant with the size of MODE being
2097 HOST_BITS_PER_WIDE_INT and later try to interpret that constant in a
2098 wider mode. In that case we will mis-interpret it as a negative
2101 Unfortunately, the only alternative is to make a CONST_DOUBLE
2102 for any constant in any mode if it is an unsigned constant larger
2103 than the maximum signed integer in an int on the host. However,
2104 doing this will break everyone that always expects to see a CONST_INT
2105 for SImode and smaller.
2107 We have always been making CONST_INTs in this case, so nothing new
2110 if (width <= HOST_BITS_PER_WIDE_INT)
2111 i1 = (i0 < 0) ? ~(HOST_WIDE_INT) 0 : 0;
2113 /* If this integer fits in one word, return a CONST_INT. */
2114 if ((i1 == 0 && i0 >= 0)
2115 || (i1 == ~0 && i0 < 0))
2116 return GEN_INT (i0);
2118 /* We use VOIDmode for integers. */
2122 /* Search the chain for an existing CONST_DOUBLE with the right value.
2123 If one is found, return it. */
2125 for (r = const_double_chain; r; r = CONST_DOUBLE_CHAIN (r))
2126 if (CONST_DOUBLE_LOW (r) == i0 && CONST_DOUBLE_HIGH (r) == i1
2127 && GET_MODE (r) == mode)
2130 /* No; make a new one and add it to the chain.
2132 We may be called by an optimizer which may be discarding any memory
2133 allocated during its processing (such as combine and loop). However,
2134 we will be leaving this constant on the chain, so we cannot tolerate
2135 freed memory. So switch to saveable_obstack for this allocation
2136 and then switch back if we were in current_obstack. */
2138 push_obstacks_nochange ();
2139 rtl_in_saveable_obstack ();
2140 r = gen_rtx_CONST_DOUBLE (mode, NULL_RTX, i0, i1);
2143 /* Don't touch const_double_chain if not inside any function. */
2144 if (current_function_decl != 0)
2146 CONST_DOUBLE_CHAIN (r) = const_double_chain;
2147 const_double_chain = r;
2150 /* Store const0_rtx in mem-slot since this CONST_DOUBLE is on the chain.
2151 Actual use of mem-slot is only through force_const_mem. */
2153 CONST_DOUBLE_MEM (r) = const0_rtx;
2158 /* Return a CONST_DOUBLE for a specified `double' value
2159 and machine mode. */
2162 immed_real_const_1 (d, mode)
2164 enum machine_mode mode;
2166 union real_extract u;
2169 /* Get the desired `double' value as a sequence of ints
2170 since that is how they are stored in a CONST_DOUBLE. */
2174 /* Detect special cases. */
2176 if (REAL_VALUES_IDENTICAL (dconst0, d))
2177 return CONST0_RTX (mode);
2178 /* Check for NaN first, because some ports (specifically the i386) do not
2179 emit correct ieee-fp code by default, and thus will generate a core
2180 dump here if we pass a NaN to REAL_VALUES_EQUAL and if REAL_VALUES_EQUAL
2181 does a floating point comparison. */
2182 else if (! REAL_VALUE_ISNAN (d) && REAL_VALUES_EQUAL (dconst1, d))
2183 return CONST1_RTX (mode);
2185 if (sizeof u == sizeof (HOST_WIDE_INT))
2186 return immed_double_const (u.i[0], 0, mode);
2187 if (sizeof u == 2 * sizeof (HOST_WIDE_INT))
2188 return immed_double_const (u.i[0], u.i[1], mode);
2190 /* The rest of this function handles the case where
2191 a float value requires more than 2 ints of space.
2192 It will be deleted as dead code on machines that don't need it. */
2194 /* Search the chain for an existing CONST_DOUBLE with the right value.
2195 If one is found, return it. */
2197 for (r = const_double_chain; r; r = CONST_DOUBLE_CHAIN (r))
2198 if (! bcmp ((char *) &CONST_DOUBLE_LOW (r), (char *) &u, sizeof u)
2199 && GET_MODE (r) == mode)
2202 /* No; make a new one and add it to the chain.
2204 We may be called by an optimizer which may be discarding any memory
2205 allocated during its processing (such as combine and loop). However,
2206 we will be leaving this constant on the chain, so we cannot tolerate
2207 freed memory. So switch to saveable_obstack for this allocation
2208 and then switch back if we were in current_obstack. */
2209 push_obstacks_nochange ();
2210 rtl_in_saveable_obstack ();
2211 r = rtx_alloc (CONST_DOUBLE);
2214 bcopy ((char *) &u, (char *) &CONST_DOUBLE_LOW (r), sizeof u);
2216 /* Don't touch const_double_chain if not inside any function. */
2217 if (current_function_decl != 0)
2219 CONST_DOUBLE_CHAIN (r) = const_double_chain;
2220 const_double_chain = r;
2223 /* Store const0_rtx in CONST_DOUBLE_MEM since this CONST_DOUBLE is on the
2224 chain, but has not been allocated memory. Actual use of CONST_DOUBLE_MEM
2225 is only through force_const_mem. */
2227 CONST_DOUBLE_MEM (r) = const0_rtx;
2232 /* Return a CONST_DOUBLE rtx for a value specified by EXP,
2233 which must be a REAL_CST tree node. */
2236 immed_real_const (exp)
2239 return immed_real_const_1 (TREE_REAL_CST (exp), TYPE_MODE (TREE_TYPE (exp)));
2242 /* At the end of a function, forget the memory-constants
2243 previously made for CONST_DOUBLEs. Mark them as not on real_constant_chain.
2244 Also clear out real_constant_chain and clear out all the chain-pointers. */
2247 clear_const_double_mem ()
2249 register rtx r, next;
2251 for (r = const_double_chain; r; r = next)
2253 next = CONST_DOUBLE_CHAIN (r);
2254 CONST_DOUBLE_CHAIN (r) = 0;
2255 CONST_DOUBLE_MEM (r) = cc0_rtx;
2257 const_double_chain = 0;
2260 /* Given an expression EXP with a constant value,
2261 reduce it to the sum of an assembler symbol and an integer.
2262 Store them both in the structure *VALUE.
2263 Abort if EXP does not reduce. */
2268 HOST_WIDE_INT offset;
2272 decode_addr_const (exp, value)
2274 struct addr_const *value;
2276 register tree target = TREE_OPERAND (exp, 0);
2277 register int offset = 0;
2282 if (TREE_CODE (target) == COMPONENT_REF
2283 && (TREE_CODE (DECL_FIELD_BITPOS (TREE_OPERAND (target, 1)))
2286 offset += TREE_INT_CST_LOW (DECL_FIELD_BITPOS (TREE_OPERAND (target, 1))) / BITS_PER_UNIT;
2287 target = TREE_OPERAND (target, 0);
2289 else if (TREE_CODE (target) == ARRAY_REF)
2291 if (TREE_CODE (TREE_OPERAND (target, 1)) != INTEGER_CST
2292 || TREE_CODE (TYPE_SIZE (TREE_TYPE (target))) != INTEGER_CST)
2294 offset += ((TREE_INT_CST_LOW (TYPE_SIZE (TREE_TYPE (target)))
2295 * TREE_INT_CST_LOW (TREE_OPERAND (target, 1)))
2297 target = TREE_OPERAND (target, 0);
2303 switch (TREE_CODE (target))
2307 x = DECL_RTL (target);
2311 x = gen_rtx_MEM (FUNCTION_MODE,
2312 gen_rtx_LABEL_REF (VOIDmode,
2313 label_rtx (TREE_OPERAND (exp, 0))));
2321 x = TREE_CST_RTL (target);
2328 if (GET_CODE (x) != MEM)
2333 value->offset = offset;
2336 /* Uniquize all constants that appear in memory.
2337 Each constant in memory thus far output is recorded
2338 in `const_hash_table' with a `struct constant_descriptor'
2339 that contains a polish representation of the value of
2342 We cannot store the trees in the hash table
2343 because the trees may be temporary. */
2345 struct constant_descriptor
2347 struct constant_descriptor *next;
2354 #define MAX_HASH_TABLE 1009
2355 static struct constant_descriptor *const_hash_table[MAX_HASH_TABLE];
2357 /* Mark a const_hash_table descriptor for GC. */
2360 mark_const_hash_entry (ptr)
2363 struct constant_descriptor *desc = * (struct constant_descriptor **) ptr;
2367 ggc_mark_string (desc->label);
2368 ggc_mark_rtx (desc->rtl);
2373 /* Compute a hash code for a constant expression. */
2380 register int len, hi, i;
2381 register enum tree_code code = TREE_CODE (exp);
2383 /* Either set P and LEN to the address and len of something to hash and
2384 exit the switch or return a value. */
2389 p = (char *) &TREE_INT_CST_LOW (exp);
2390 len = 2 * sizeof TREE_INT_CST_LOW (exp);
2394 p = (char *) &TREE_REAL_CST (exp);
2395 len = sizeof TREE_REAL_CST (exp);
2399 p = TREE_STRING_POINTER (exp);
2400 len = TREE_STRING_LENGTH (exp);
2404 return (const_hash (TREE_REALPART (exp)) * 5
2405 + const_hash (TREE_IMAGPART (exp)));
2408 if (TREE_CODE (TREE_TYPE (exp)) == SET_TYPE)
2410 len = int_size_in_bytes (TREE_TYPE (exp));
2411 p = (char *) alloca (len);
2412 get_set_constructor_bytes (exp, (unsigned char *) p, len);
2419 /* For record type, include the type in the hashing.
2420 We do not do so for array types
2421 because (1) the sizes of the elements are sufficient
2422 and (2) distinct array types can have the same constructor.
2423 Instead, we include the array size because the constructor could
2425 if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE)
2426 hi = ((unsigned long) TREE_TYPE (exp) & ((1 << HASHBITS) - 1))
2429 hi = ((5 + int_size_in_bytes (TREE_TYPE (exp)))
2430 & ((1 << HASHBITS) - 1)) % MAX_HASH_TABLE;
2432 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
2433 if (TREE_VALUE (link))
2435 = (hi * 603 + const_hash (TREE_VALUE (link))) % MAX_HASH_TABLE;
2442 struct addr_const value;
2444 decode_addr_const (exp, &value);
2445 if (GET_CODE (value.base) == SYMBOL_REF)
2447 /* Don't hash the address of the SYMBOL_REF;
2448 only use the offset and the symbol name. */
2450 p = XSTR (value.base, 0);
2451 for (i = 0; p[i] != 0; i++)
2452 hi = ((hi * 613) + (unsigned) (p[i]));
2454 else if (GET_CODE (value.base) == LABEL_REF)
2455 hi = value.offset + CODE_LABEL_NUMBER (XEXP (value.base, 0)) * 13;
2459 hi &= (1 << HASHBITS) - 1;
2460 hi %= MAX_HASH_TABLE;
2466 return (const_hash (TREE_OPERAND (exp, 0)) * 9
2467 + const_hash (TREE_OPERAND (exp, 1)));
2471 case NON_LVALUE_EXPR:
2472 return const_hash (TREE_OPERAND (exp, 0)) * 7 + 2;
2478 /* Compute hashing function */
2480 for (i = 0; i < len; i++)
2481 hi = ((hi * 613) + (unsigned) (p[i]));
2483 hi &= (1 << HASHBITS) - 1;
2484 hi %= MAX_HASH_TABLE;
2488 /* Compare a constant expression EXP with a constant-descriptor DESC.
2489 Return 1 if DESC describes a constant with the same value as EXP. */
2492 compare_constant (exp, desc)
2494 struct constant_descriptor *desc;
2496 return 0 != compare_constant_1 (exp, desc->contents);
2499 /* Compare constant expression EXP with a substring P of a constant descriptor.
2500 If they match, return a pointer to the end of the substring matched.
2501 If they do not match, return 0.
2503 Since descriptors are written in polish prefix notation,
2504 this function can be used recursively to test one operand of EXP
2505 against a subdescriptor, and if it succeeds it returns the
2506 address of the subdescriptor for the next operand. */
2509 compare_constant_1 (exp, p)
2513 register char *strp;
2515 register enum tree_code code = TREE_CODE (exp);
2517 if (code != (enum tree_code) *p++)
2520 /* Either set STRP, P and LEN to pointers and length to compare and exit the
2521 switch, or return the result of the comparison. */
2526 /* Integer constants are the same only if the same width of type. */
2527 if (*p++ != TYPE_PRECISION (TREE_TYPE (exp)))
2530 strp = (char *) &TREE_INT_CST_LOW (exp);
2531 len = 2 * sizeof TREE_INT_CST_LOW (exp);
2535 /* Real constants are the same only if the same width of type. */
2536 if (*p++ != TYPE_PRECISION (TREE_TYPE (exp)))
2539 strp = (char *) &TREE_REAL_CST (exp);
2540 len = sizeof TREE_REAL_CST (exp);
2544 if (flag_writable_strings)
2547 if ((enum machine_mode) *p++ != TYPE_MODE (TREE_TYPE (exp)))
2550 strp = TREE_STRING_POINTER (exp);
2551 len = TREE_STRING_LENGTH (exp);
2552 if (bcmp ((char *) &TREE_STRING_LENGTH (exp), p,
2553 sizeof TREE_STRING_LENGTH (exp)))
2556 p += sizeof TREE_STRING_LENGTH (exp);
2560 p = compare_constant_1 (TREE_REALPART (exp), p);
2564 return compare_constant_1 (TREE_IMAGPART (exp), p);
2567 if (TREE_CODE (TREE_TYPE (exp)) == SET_TYPE)
2569 int xlen = len = int_size_in_bytes (TREE_TYPE (exp));
2571 strp = (char *) alloca (len);
2572 get_set_constructor_bytes (exp, (unsigned char *) strp, len);
2573 if (bcmp ((char *) &xlen, p, sizeof xlen))
2582 int length = list_length (CONSTRUCTOR_ELTS (exp));
2584 enum machine_mode mode = TYPE_MODE (TREE_TYPE (exp));
2585 int have_purpose = 0;
2587 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
2588 if (TREE_PURPOSE (link))
2591 if (bcmp ((char *) &length, p, sizeof length))
2596 /* For record constructors, insist that the types match.
2597 For arrays, just verify both constructors are for arrays.
2598 Then insist that either both or none have any TREE_PURPOSE
2600 if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE)
2601 type = TREE_TYPE (exp);
2605 if (bcmp ((char *) &type, p, sizeof type))
2608 if (TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE)
2610 if (bcmp ((char *) &mode, p, sizeof mode))
2618 if (bcmp ((char *) &have_purpose, p, sizeof have_purpose))
2621 p += sizeof have_purpose;
2623 /* For arrays, insist that the size in bytes match. */
2624 if (TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE)
2626 HOST_WIDE_INT size = int_size_in_bytes (TREE_TYPE (exp));
2628 if (bcmp ((char *) &size, p, sizeof size))
2634 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
2636 if (TREE_VALUE (link))
2638 if ((p = compare_constant_1 (TREE_VALUE (link), p)) == 0)
2645 if (bcmp ((char *) &zero, p, sizeof zero))
2651 if (TREE_PURPOSE (link)
2652 && TREE_CODE (TREE_PURPOSE (link)) == FIELD_DECL)
2654 if (bcmp ((char *) &TREE_PURPOSE (link), p,
2655 sizeof TREE_PURPOSE (link)))
2658 p += sizeof TREE_PURPOSE (link);
2660 else if (TREE_PURPOSE (link))
2662 if ((p = compare_constant_1 (TREE_PURPOSE (link), p)) == 0)
2665 else if (have_purpose)
2669 if (bcmp ((char *) &zero, p, sizeof zero))
2681 struct addr_const value;
2683 decode_addr_const (exp, &value);
2684 strp = (char *) &value.offset;
2685 len = sizeof value.offset;
2686 /* Compare the offset. */
2688 if (*p++ != *strp++)
2691 /* Compare symbol name. */
2692 strp = XSTR (value.base, 0);
2693 len = strlen (strp) + 1;
2700 p = compare_constant_1 (TREE_OPERAND (exp, 0), p);
2704 return compare_constant_1 (TREE_OPERAND (exp, 1), p);
2708 case NON_LVALUE_EXPR:
2709 return compare_constant_1 (TREE_OPERAND (exp, 0), p);
2715 /* Compare constant contents. */
2717 if (*p++ != *strp++)
2723 /* Construct a constant descriptor for the expression EXP.
2724 It is up to the caller to enter the descriptor in the hash table. */
2726 static struct constant_descriptor *
2727 record_constant (exp)
2730 struct constant_descriptor *next = 0;
2734 /* Make a struct constant_descriptor. The first three pointers will
2735 be filled in later. Here we just leave space for them. */
2737 obstack_grow (&permanent_obstack, (char *) &next, sizeof next);
2738 obstack_grow (&permanent_obstack, (char *) &label, sizeof label);
2739 obstack_grow (&permanent_obstack, (char *) &rtl, sizeof rtl);
2740 record_constant_1 (exp);
2741 return (struct constant_descriptor *) obstack_finish (&permanent_obstack);
2744 /* Add a description of constant expression EXP
2745 to the object growing in `permanent_obstack'.
2746 No need to return its address; the caller will get that
2747 from the obstack when the object is complete. */
2750 record_constant_1 (exp)
2753 register char *strp;
2755 register enum tree_code code = TREE_CODE (exp);
2757 obstack_1grow (&permanent_obstack, (unsigned int) code);
2762 obstack_1grow (&permanent_obstack, TYPE_PRECISION (TREE_TYPE (exp)));
2763 strp = (char *) &TREE_INT_CST_LOW (exp);
2764 len = 2 * sizeof TREE_INT_CST_LOW (exp);
2768 obstack_1grow (&permanent_obstack, TYPE_PRECISION (TREE_TYPE (exp)));
2769 strp = (char *) &TREE_REAL_CST (exp);
2770 len = sizeof TREE_REAL_CST (exp);
2774 if (flag_writable_strings)
2777 obstack_1grow (&permanent_obstack, TYPE_MODE (TREE_TYPE (exp)));
2778 strp = TREE_STRING_POINTER (exp);
2779 len = TREE_STRING_LENGTH (exp);
2780 obstack_grow (&permanent_obstack, (char *) &TREE_STRING_LENGTH (exp),
2781 sizeof TREE_STRING_LENGTH (exp));
2785 record_constant_1 (TREE_REALPART (exp));
2786 record_constant_1 (TREE_IMAGPART (exp));
2790 if (TREE_CODE (TREE_TYPE (exp)) == SET_TYPE)
2792 int nbytes = int_size_in_bytes (TREE_TYPE (exp));
2793 obstack_grow (&permanent_obstack, &nbytes, sizeof (nbytes));
2794 obstack_blank (&permanent_obstack, nbytes);
2795 get_set_constructor_bytes
2796 (exp, (unsigned char *) permanent_obstack.next_free-nbytes,
2803 int length = list_length (CONSTRUCTOR_ELTS (exp));
2804 enum machine_mode mode = TYPE_MODE (TREE_TYPE (exp));
2806 int have_purpose = 0;
2808 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
2809 if (TREE_PURPOSE (link))
2812 obstack_grow (&permanent_obstack, (char *) &length, sizeof length);
2814 /* For record constructors, insist that the types match.
2815 For arrays, just verify both constructors are for arrays
2816 of the same mode. Then insist that either both or none
2817 have any TREE_PURPOSE values. */
2818 if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE)
2819 type = TREE_TYPE (exp);
2823 obstack_grow (&permanent_obstack, (char *) &type, sizeof type);
2824 if (TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE)
2825 obstack_grow (&permanent_obstack, &mode, sizeof mode);
2827 obstack_grow (&permanent_obstack, (char *) &have_purpose,
2828 sizeof have_purpose);
2830 /* For arrays, insist that the size in bytes match. */
2831 if (TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE)
2833 HOST_WIDE_INT size = int_size_in_bytes (TREE_TYPE (exp));
2834 obstack_grow (&permanent_obstack, (char *) &size, sizeof size);
2837 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
2839 if (TREE_VALUE (link))
2840 record_constant_1 (TREE_VALUE (link));
2845 obstack_grow (&permanent_obstack,
2846 (char *) &zero, sizeof zero);
2849 if (TREE_PURPOSE (link)
2850 && TREE_CODE (TREE_PURPOSE (link)) == FIELD_DECL)
2851 obstack_grow (&permanent_obstack,
2852 (char *) &TREE_PURPOSE (link),
2853 sizeof TREE_PURPOSE (link));
2854 else if (TREE_PURPOSE (link))
2855 record_constant_1 (TREE_PURPOSE (link));
2856 else if (have_purpose)
2860 obstack_grow (&permanent_obstack,
2861 (char *) &zero, sizeof zero);
2869 struct addr_const value;
2871 decode_addr_const (exp, &value);
2872 /* Record the offset. */
2873 obstack_grow (&permanent_obstack,
2874 (char *) &value.offset, sizeof value.offset);
2875 /* Record the symbol name. */
2876 obstack_grow (&permanent_obstack, XSTR (value.base, 0),
2877 strlen (XSTR (value.base, 0)) + 1);
2884 record_constant_1 (TREE_OPERAND (exp, 0));
2885 record_constant_1 (TREE_OPERAND (exp, 1));
2890 case NON_LVALUE_EXPR:
2891 record_constant_1 (TREE_OPERAND (exp, 0));
2898 /* Record constant contents. */
2899 obstack_grow (&permanent_obstack, strp, len);
2902 /* Record a list of constant expressions that were passed to
2903 output_constant_def but that could not be output right away. */
2905 struct deferred_constant
2907 struct deferred_constant *next;
2913 static struct deferred_constant *deferred_constants;
2915 /* Another list of constants which should be output after the
2917 static struct deferred_constant *after_function_constants;
2919 /* Nonzero means defer output of addressed subconstants
2920 (i.e., those for which output_constant_def is called.) */
2921 static int defer_addressed_constants_flag;
2923 /* Start deferring output of subconstants. */
2926 defer_addressed_constants ()
2928 defer_addressed_constants_flag++;
2931 /* Stop deferring output of subconstants,
2932 and output now all those that have been deferred. */
2935 output_deferred_addressed_constants ()
2937 struct deferred_constant *p, *next;
2939 defer_addressed_constants_flag--;
2941 if (defer_addressed_constants_flag > 0)
2944 for (p = deferred_constants; p; p = next)
2946 output_constant_def_contents (p->exp, p->reloc, p->labelno);
2951 deferred_constants = 0;
2954 /* Output any constants which should appear after a function. */
2957 output_after_function_constants ()
2959 struct deferred_constant *p, *next;
2961 for (p = after_function_constants; p; p = next)
2963 output_constant_def_contents (p->exp, p->reloc, p->labelno);
2968 after_function_constants = 0;
2971 /* Make a copy of the whole tree structure for a constant.
2972 This handles the same types of nodes that compare_constant
2973 and record_constant handle. */
2979 switch (TREE_CODE (exp))
2982 /* For ADDR_EXPR, we do not want to copy the decl whose address
2983 is requested. We do want to copy constants though. */
2984 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, 0))) == 'c')
2985 return build1 (TREE_CODE (exp), TREE_TYPE (exp),
2986 copy_constant (TREE_OPERAND (exp, 0)));
2988 return copy_node (exp);
2993 return copy_node (exp);
2996 return build_complex (TREE_TYPE (exp),
2997 copy_constant (TREE_REALPART (exp)),
2998 copy_constant (TREE_IMAGPART (exp)));
3002 return build (TREE_CODE (exp), TREE_TYPE (exp),
3003 copy_constant (TREE_OPERAND (exp, 0)),
3004 copy_constant (TREE_OPERAND (exp, 1)));
3008 case NON_LVALUE_EXPR:
3009 return build1 (TREE_CODE (exp), TREE_TYPE (exp),
3010 copy_constant (TREE_OPERAND (exp, 0)));
3014 tree copy = copy_node (exp);
3015 tree list = copy_list (CONSTRUCTOR_ELTS (exp));
3018 CONSTRUCTOR_ELTS (copy) = list;
3019 for (tail = list; tail; tail = TREE_CHAIN (tail))
3020 TREE_VALUE (tail) = copy_constant (TREE_VALUE (tail));
3021 if (TREE_CODE (TREE_TYPE (exp)) == SET_TYPE)
3022 for (tail = list; tail; tail = TREE_CHAIN (tail))
3023 TREE_PURPOSE (tail) = copy_constant (TREE_PURPOSE (tail));
3033 /* Return an rtx representing a reference to constant data in memory
3034 for the constant expression EXP.
3036 If assembler code for such a constant has already been output,
3037 return an rtx to refer to it.
3038 Otherwise, output such a constant in memory (or defer it for later)
3039 and generate an rtx for it.
3041 The TREE_CST_RTL of EXP is set up to point to that rtx.
3042 The const_hash_table records which constants already have label strings. */
3045 output_constant_def (exp)
3049 register struct constant_descriptor *desc;
3054 if (TREE_CST_RTL (exp))
3055 return TREE_CST_RTL (exp);
3057 /* Make sure any other constants whose addresses appear in EXP
3058 are assigned label numbers. */
3060 reloc = output_addressed_constants (exp);
3062 /* Compute hash code of EXP. Search the descriptors for that hash code
3063 to see if any of them describes EXP. If yes, the descriptor records
3064 the label number already assigned. */
3066 hash = const_hash (exp) % MAX_HASH_TABLE;
3068 for (desc = const_hash_table[hash]; desc; desc = desc->next)
3069 if (compare_constant (exp, desc))
3074 /* No constant equal to EXP is known to have been output.
3075 Make a constant descriptor to enter EXP in the hash table.
3076 Assign the label number and record it in the descriptor for
3077 future calls to this function to find. */
3079 /* Create a string containing the label name, in LABEL. */
3080 ASM_GENERATE_INTERNAL_LABEL (label, "LC", const_labelno);
3082 desc = record_constant (exp);
3083 desc->next = const_hash_table[hash];
3084 desc->label = ggc_alloc_string (label, -1);
3085 const_hash_table[hash] = desc;
3087 /* We have a symbol name; construct the SYMBOL_REF and the MEM
3088 in the permanent obstack. We could also construct this in the
3089 obstack of EXP and put it into TREE_CST_RTL, but we have no way
3090 of knowing what obstack it is (e.g., it might be in a function
3091 obstack of a function we are nested inside). */
3093 push_obstacks_nochange ();
3094 end_temporary_allocation ();
3097 = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp)),
3098 gen_rtx_SYMBOL_REF (Pmode, desc->label));
3100 RTX_UNCHANGING_P (desc->rtl) = 1;
3101 if (AGGREGATE_TYPE_P (TREE_TYPE (exp)))
3102 MEM_SET_IN_STRUCT_P (desc->rtl, 1);
3109 TREE_CST_RTL (exp) = desc->rtl;
3111 /* Optionally set flags or add text to the name to record information
3112 such as that it is a function name. If the name is changed, the macro
3113 ASM_OUTPUT_LABELREF will have to know how to strip this information. */
3114 #ifdef ENCODE_SECTION_INFO
3115 ENCODE_SECTION_INFO (exp);
3118 /* If this is the first time we've seen this particular constant,
3119 output it (or defer its output for later). */
3122 int after_function = 0;
3124 #ifdef CONSTANT_AFTER_FUNCTION_P
3125 if (current_function_decl != 0
3126 && CONSTANT_AFTER_FUNCTION_P (exp))
3130 if (defer_addressed_constants_flag || after_function)
3132 struct deferred_constant *p;
3133 p = (struct deferred_constant *) xmalloc (sizeof (struct deferred_constant));
3135 push_obstacks_nochange ();
3136 suspend_momentary ();
3137 p->exp = copy_constant (exp);
3140 p->labelno = const_labelno++;
3143 p->next = after_function_constants;
3144 after_function_constants = p;
3148 p->next = deferred_constants;
3149 deferred_constants = p;
3154 /* Do no output if -fsyntax-only. */
3155 if (! flag_syntax_only)
3156 output_constant_def_contents (exp, reloc, const_labelno);
3161 return TREE_CST_RTL (exp);
3164 /* Now output assembler code to define the label for EXP,
3165 and follow it with the data of EXP. */
3168 output_constant_def_contents (exp, reloc, labelno)
3175 if (IN_NAMED_SECTION (exp))
3176 named_section (exp, NULL, reloc);
3179 /* First switch to text section, except for writable strings. */
3180 #ifdef SELECT_SECTION
3181 SELECT_SECTION (exp, reloc);
3183 if (((TREE_CODE (exp) == STRING_CST) && flag_writable_strings)
3184 || (flag_pic && reloc))
3187 readonly_data_section ();
3191 /* Align the location counter as required by EXP's data type. */
3192 align = TYPE_ALIGN (TREE_TYPE (exp));
3193 #ifdef CONSTANT_ALIGNMENT
3194 align = CONSTANT_ALIGNMENT (exp, align);
3197 if (align > BITS_PER_UNIT)
3198 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
3200 /* Output the label itself. */
3201 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LC", labelno);
3203 /* Output the value of EXP. */
3204 output_constant (exp,
3205 (TREE_CODE (exp) == STRING_CST
3206 ? TREE_STRING_LENGTH (exp)
3207 : int_size_in_bytes (TREE_TYPE (exp))));
3211 /* Structure to represent sufficient information about a constant so that
3212 it can be output when the constant pool is output, so that function
3213 integration can be done, and to simplify handling on machines that reference
3214 constant pool as base+displacement. */
3216 struct pool_constant
3218 struct constant_descriptor *desc;
3219 struct pool_constant *next;
3220 enum machine_mode mode;
3228 /* Structure used to maintain hash table mapping symbols used to their
3229 corresponding constants. */
3234 struct pool_constant *pool;
3235 struct pool_sym *next;
3238 /* Hash code for a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true.
3239 The argument is XSTR (... , 0) */
3241 #define SYMHASH(LABEL) \
3242 ((((unsigned long) (LABEL)) & ((1 << HASHBITS) - 1)) % MAX_RTX_HASH_TABLE)
3244 /* Initialize constant pool hashing for a new function. */
3247 init_varasm_status (f)
3250 struct varasm_status *p;
3251 p = (struct varasm_status *) xmalloc (sizeof (struct varasm_status));
3253 p->x_const_rtx_hash_table
3254 = ((struct constant_descriptor **)
3255 xmalloc (MAX_RTX_HASH_TABLE * sizeof (struct constant_descriptor *)));
3256 p->x_const_rtx_sym_hash_table
3257 = ((struct pool_sym **)
3258 xmalloc (MAX_RTX_HASH_TABLE * sizeof (struct pool_sym *)));
3259 bzero ((char *) p->x_const_rtx_hash_table,
3260 MAX_RTX_HASH_TABLE * sizeof (struct constant_descriptor *));
3261 bzero ((char *) p->x_const_rtx_sym_hash_table,
3262 MAX_RTX_HASH_TABLE * sizeof (struct pool_sym *));
3264 p->x_first_pool = p->x_last_pool = 0;
3265 p->x_pool_offset = 0;
3266 p->x_const_double_chain = 0;
3269 /* Mark PC for GC. */
3272 mark_pool_constant (pc)
3273 struct pool_constant *pc;
3277 ggc_mark_rtx (pc->constant);
3282 /* Mark PPS for GC. */
3285 mark_pool_sym_hash_table (pps)
3286 struct pool_sym **pps;
3288 struct pool_sym *ps;
3291 for (i = 0; i < MAX_RTX_HASH_TABLE; ++i)
3292 for (ps = pps[i]; ps ; ps = ps->next)
3293 ggc_mark_string (ps->label);
3296 /* Mark P for GC. */
3299 mark_varasm_status (p)
3300 struct varasm_status *p;
3305 mark_pool_constant (p->x_first_pool);
3306 mark_pool_sym_hash_table (p->x_const_rtx_sym_hash_table);
3307 ggc_mark_rtx (p->x_const_double_chain);
3310 /* Clear out all parts of the state in F that can safely be discarded
3311 after the function has been compiled, to let garbage collection
3312 reclaim the memory. */
3315 free_varasm_status (f)
3318 struct varasm_status *p;
3321 free (p->x_const_rtx_hash_table);
3322 free (p->x_const_rtx_sym_hash_table);
3327 enum kind { RTX_DOUBLE, RTX_INT };
3331 #ifdef ONLY_INT_FIELDS
3332 unsigned int kind : 16;
3333 unsigned int mode : 16;
3335 enum kind kind : 16;
3336 enum machine_mode mode : 16;
3339 union real_extract du;
3340 struct addr_const addr;
3341 struct {HOST_WIDE_INT high, low;} di;
3345 /* Express an rtx for a constant integer (perhaps symbolic)
3346 as the sum of a symbol or label plus an explicit integer.
3347 They are stored into VALUE. */
3350 decode_rtx_const (mode, x, value)
3351 enum machine_mode mode;
3353 struct rtx_const *value;
3355 /* Clear the whole structure, including any gaps. */
3358 int *p = (int *) value;
3359 int *end = (int *) (value + 1);
3364 value->kind = RTX_INT; /* Most usual kind. */
3367 switch (GET_CODE (x))
3370 value->kind = RTX_DOUBLE;
3371 if (GET_MODE (x) != VOIDmode)
3373 value->mode = GET_MODE (x);
3374 bcopy ((char *) &CONST_DOUBLE_LOW (x),
3375 (char *) &value->un.du, sizeof value->un.du);
3379 value->un.di.low = CONST_DOUBLE_LOW (x);
3380 value->un.di.high = CONST_DOUBLE_HIGH (x);
3385 value->un.addr.offset = INTVAL (x);
3391 value->un.addr.base = x;
3396 if (GET_CODE (x) == PLUS)
3398 value->un.addr.base = XEXP (x, 0);
3399 if (GET_CODE (XEXP (x, 1)) != CONST_INT)
3401 value->un.addr.offset = INTVAL (XEXP (x, 1));
3403 else if (GET_CODE (x) == MINUS)
3405 value->un.addr.base = XEXP (x, 0);
3406 if (GET_CODE (XEXP (x, 1)) != CONST_INT)
3408 value->un.addr.offset = - INTVAL (XEXP (x, 1));
3418 if (value->kind == RTX_INT && value->un.addr.base != 0)
3419 switch (GET_CODE (value->un.addr.base))
3422 /* Use the string's address, not the SYMBOL_REF's address,
3423 for the sake of addresses of library routines. */
3424 value->un.addr.base = (rtx) XSTR (value->un.addr.base, 0);
3428 /* For a LABEL_REF, compare labels. */
3429 value->un.addr.base = XEXP (value->un.addr.base, 0);
3436 /* Given a MINUS expression, simplify it if both sides
3437 include the same symbol. */
3440 simplify_subtraction (x)
3443 struct rtx_const val0, val1;
3445 decode_rtx_const (GET_MODE (x), XEXP (x, 0), &val0);
3446 decode_rtx_const (GET_MODE (x), XEXP (x, 1), &val1);
3448 if (val0.un.addr.base == val1.un.addr.base)
3449 return GEN_INT (val0.un.addr.offset - val1.un.addr.offset);
3453 /* Compute a hash code for a constant RTL expression. */
3456 const_hash_rtx (mode, x)
3457 enum machine_mode mode;
3463 struct rtx_const value;
3464 decode_rtx_const (mode, x, &value);
3466 /* Compute hashing function */
3468 for (i = 0; i < sizeof value / sizeof (int); i++)
3469 hi += ((int *) &value)[i];
3471 hi &= (1 << HASHBITS) - 1;
3472 hi %= MAX_RTX_HASH_TABLE;
3476 /* Compare a constant rtl object X with a constant-descriptor DESC.
3477 Return 1 if DESC describes a constant with the same value as X. */
3480 compare_constant_rtx (mode, x, desc)
3481 enum machine_mode mode;
3483 struct constant_descriptor *desc;
3485 register int *p = (int *) desc->contents;
3488 struct rtx_const value;
3490 decode_rtx_const (mode, x, &value);
3491 strp = (int *) &value;
3492 len = sizeof value / sizeof (int);
3494 /* Compare constant contents. */
3496 if (*p++ != *strp++)
3502 /* Construct a constant descriptor for the rtl-expression X.
3503 It is up to the caller to enter the descriptor in the hash table. */
3505 static struct constant_descriptor *
3506 record_constant_rtx (mode, x)
3507 enum machine_mode mode;
3510 struct constant_descriptor *ptr;
3513 struct rtx_const value;
3515 decode_rtx_const (mode, x, &value);
3517 /* Put these things in the saveable obstack so we can ensure it won't
3518 be freed if we are called from combine or some other phase that discards
3519 memory allocated from function_obstack (current_obstack). */
3520 obstack_grow (saveable_obstack, &ptr, sizeof ptr);
3521 obstack_grow (saveable_obstack, &label, sizeof label);
3522 obstack_grow (saveable_obstack, &rtl, sizeof rtl);
3524 /* Record constant contents. */
3525 obstack_grow (saveable_obstack, &value, sizeof value);
3527 return (struct constant_descriptor *) obstack_finish (saveable_obstack);
3530 /* Given a constant rtx X, make (or find) a memory constant for its value
3531 and return a MEM rtx to refer to it in memory. */
3534 force_const_mem (mode, x)
3535 enum machine_mode mode;
3539 register struct constant_descriptor *desc;
3544 /* If we want this CONST_DOUBLE in the same mode as it is in memory
3545 (this will always be true for floating CONST_DOUBLEs that have been
3546 placed in memory, but not for VOIDmode (integer) CONST_DOUBLEs),
3547 use the previous copy. Otherwise, make a new one. Note that in
3548 the unlikely event that this same CONST_DOUBLE is used in two different
3549 modes in an alternating fashion, we will allocate a lot of different
3550 memory locations, but this should be extremely rare. */
3552 if (GET_CODE (x) == CONST_DOUBLE
3553 && GET_CODE (CONST_DOUBLE_MEM (x)) == MEM
3554 && GET_MODE (CONST_DOUBLE_MEM (x)) == mode)
3555 return CONST_DOUBLE_MEM (x);
3557 /* Compute hash code of X. Search the descriptors for that hash code
3558 to see if any of them describes X. If yes, the descriptor records
3559 the label number already assigned. */
3561 hash = const_hash_rtx (mode, x);
3563 for (desc = const_rtx_hash_table[hash]; desc; desc = desc->next)
3564 if (compare_constant_rtx (mode, x, desc))
3566 found = desc->label;
3572 register struct pool_constant *pool;
3573 register struct pool_sym *sym;
3576 /* No constant equal to X is known to have been output.
3577 Make a constant descriptor to enter X in the hash table.
3578 Assign the label number and record it in the descriptor for
3579 future calls to this function to find. */
3581 desc = record_constant_rtx (mode, x);
3582 desc->next = const_rtx_hash_table[hash];
3583 const_rtx_hash_table[hash] = desc;
3585 /* Align the location counter as required by EXP's data type. */
3586 align = (mode == VOIDmode) ? UNITS_PER_WORD : GET_MODE_SIZE (mode);
3587 if (align > BIGGEST_ALIGNMENT / BITS_PER_UNIT)
3588 align = BIGGEST_ALIGNMENT / BITS_PER_UNIT;
3589 #ifdef CONSTANT_ALIGNMENT
3590 align = CONSTANT_ALIGNMENT (make_tree (type_for_mode (mode, 0), x),
3591 align * BITS_PER_UNIT) / BITS_PER_UNIT;
3594 pool_offset += align - 1;
3595 pool_offset &= ~ (align - 1);
3597 /* If RTL is not being placed into the saveable obstack, make a
3598 copy of X that is in the saveable obstack in case we are
3599 being called from combine or some other phase that discards
3600 memory it allocates. We used to only do this if it is a
3601 CONST; however, reload can allocate a CONST_INT when
3602 eliminating registers. */
3603 if (rtl_obstack != saveable_obstack
3604 && (GET_CODE (x) == CONST || GET_CODE (x) == CONST_INT))
3606 push_obstacks_nochange ();
3607 rtl_in_saveable_obstack ();
3609 if (GET_CODE (x) == CONST)
3610 x = gen_rtx_CONST (GET_MODE (x),
3611 gen_rtx_PLUS (GET_MODE (x),
3612 XEXP (XEXP (x, 0), 0),
3613 XEXP (XEXP (x, 0), 1)));
3615 x = GEN_INT (INTVAL (x));
3620 /* Allocate a pool constant descriptor, fill it in, and chain it in. */
3622 pool = (struct pool_constant *) savealloc (sizeof (struct pool_constant));
3626 pool->labelno = const_labelno;
3627 pool->align = align;
3628 pool->offset = pool_offset;
3635 last_pool->next = pool;
3638 pool_offset += GET_MODE_SIZE (mode);
3640 /* Create a string containing the label name, in LABEL. */
3641 ASM_GENERATE_INTERNAL_LABEL (label, "LC", const_labelno);
3645 desc->label = found = ggc_alloc_string (label, -1);
3647 /* Add label to symbol hash table. */
3648 hash = SYMHASH (found);
3649 sym = (struct pool_sym *) savealloc (sizeof (struct pool_sym));
3652 sym->next = const_rtx_sym_hash_table[hash];
3653 const_rtx_sym_hash_table[hash] = sym;
3656 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
3658 def = gen_rtx_MEM (mode, gen_rtx_SYMBOL_REF (Pmode, found));
3660 RTX_UNCHANGING_P (def) = 1;
3661 /* Mark the symbol_ref as belonging to this constants pool. */
3662 CONSTANT_POOL_ADDRESS_P (XEXP (def, 0)) = 1;
3663 current_function_uses_const_pool = 1;
3665 if (GET_CODE (x) == CONST_DOUBLE)
3667 if (CONST_DOUBLE_MEM (x) == cc0_rtx)
3669 CONST_DOUBLE_CHAIN (x) = const_double_chain;
3670 const_double_chain = x;
3672 CONST_DOUBLE_MEM (x) = def;
3678 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
3679 the corresponding pool_constant structure. */
3681 static struct pool_constant *
3682 find_pool_constant (f, addr)
3686 struct pool_sym *sym;
3687 char *label = XSTR (addr, 0);
3689 for (sym = f->varasm->x_const_rtx_sym_hash_table[SYMHASH (label)]; sym; sym = sym->next)
3690 if (sym->label == label)
3696 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
3699 get_pool_constant (addr)
3702 return (find_pool_constant (cfun, addr))->constant;
3705 /* Likewise, but for the constant pool of a specific function. */
3708 get_pool_constant_for_function (f, addr)
3712 return (find_pool_constant (f, addr))->constant;
3715 /* Similar, return the mode. */
3718 get_pool_mode (addr)
3721 return (find_pool_constant (cfun, addr))->mode;
3725 get_pool_mode_for_function (f, addr)
3729 return (find_pool_constant (f, addr))->mode;
3732 /* Similar, return the offset in the constant pool. */
3735 get_pool_offset (addr)
3738 return (find_pool_constant (cfun, addr))->offset;
3741 /* Return the size of the constant pool. */
3749 /* Write all the constants in the constant pool. */
3752 output_constant_pool (fnname, fndecl)
3753 const char *fnname ATTRIBUTE_UNUSED;
3754 tree fndecl ATTRIBUTE_UNUSED;
3756 struct pool_constant *pool;
3758 union real_extract u;
3760 /* It is possible for gcc to call force_const_mem and then to later
3761 discard the instructions which refer to the constant. In such a
3762 case we do not need to output the constant. */
3763 mark_constant_pool ();
3765 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3766 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file, fnname, fndecl, pool_offset);
3769 for (pool = first_pool; pool; pool = pool->next)
3776 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3777 whose CODE_LABEL has been deleted. This can occur if a jump table
3778 is eliminated by optimization. If so, write a constant of zero
3779 instead. Note that this can also happen by turning the
3780 CODE_LABEL into a NOTE. */
3781 if (((GET_CODE (x) == LABEL_REF
3782 && (INSN_DELETED_P (XEXP (x, 0))
3783 || GET_CODE (XEXP (x, 0)) == NOTE)))
3784 || (GET_CODE (x) == CONST && GET_CODE (XEXP (x, 0)) == PLUS
3785 && GET_CODE (XEXP (XEXP (x, 0), 0)) == LABEL_REF
3786 && (INSN_DELETED_P (XEXP (XEXP (XEXP (x, 0), 0), 0))
3787 || GET_CODE (XEXP (XEXP (XEXP (x, 0), 0), 0)) == NOTE)))
3790 /* First switch to correct section. */
3791 #ifdef SELECT_RTX_SECTION
3792 SELECT_RTX_SECTION (pool->mode, x);
3794 readonly_data_section ();
3797 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3798 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file, x, pool->mode,
3799 pool->align, pool->labelno, done);
3802 if (pool->align > 1)
3803 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (pool->align));
3805 /* Output the label. */
3806 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LC", pool->labelno);
3808 /* Output the value of the constant itself. */
3809 switch (GET_MODE_CLASS (pool->mode))
3812 if (GET_CODE (x) != CONST_DOUBLE)
3815 bcopy ((char *) &CONST_DOUBLE_LOW (x), (char *) &u, sizeof u);
3816 assemble_real (u.d, pool->mode);
3820 case MODE_PARTIAL_INT:
3821 assemble_integer (x, GET_MODE_SIZE (pool->mode), 1);
3828 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3834 #ifdef ASM_OUTPUT_POOL_EPILOGUE
3835 ASM_OUTPUT_POOL_EPILOGUE (asm_out_file, fnname, fndecl, pool_offset);
3838 /* Done with this pool. */
3839 first_pool = last_pool = 0;
3842 /* Look through the instructions for this function, and mark all the
3843 entries in the constant pool which are actually being used. */
3846 mark_constant_pool ()
3849 struct pool_constant *pool;
3851 if (first_pool == 0)
3854 for (pool = first_pool; pool; pool = pool->next)
3857 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
3858 if (GET_RTX_CLASS (GET_CODE (insn)) == 'i')
3859 mark_constants (PATTERN (insn));
3861 for (insn = current_function_epilogue_delay_list;
3863 insn = XEXP (insn, 1))
3864 if (GET_RTX_CLASS (GET_CODE (insn)) == 'i')
3865 mark_constants (PATTERN (insn));
3867 /* It's possible that the only reference to a symbol is in a symbol
3868 that's in the constant pool. This happens in Fortran under some
3869 situations. (When the constant contains the address of another
3870 constant, and only the first is used directly in an insn.)
3871 This is potentially suboptimal if there's ever a possibility of
3872 backwards (in pool order) 2'd level references. However, it's
3873 not clear that 2'd level references can happen. */
3874 for (pool = first_pool; pool; pool = pool->next)
3876 struct pool_sym *sym;
3879 /* skip unmarked entries; no insn refers to them. */
3883 /* Skip everything except SYMBOL_REFs. */
3884 if (GET_CODE (pool->constant) != SYMBOL_REF)
3886 label = XSTR (pool->constant, 0);
3888 /* Be sure the symbol's value is marked. */
3889 for (sym = const_rtx_sym_hash_table[SYMHASH (label)]; sym;
3891 if (sym->label == label)
3892 sym->pool->mark = 1;
3893 /* If we didn't find it, there's something truly wrong here, but it
3894 will be announced by the assembler. */
3903 register const char *format_ptr;
3908 if (GET_CODE (x) == SYMBOL_REF)
3910 if (CONSTANT_POOL_ADDRESS_P (x))
3911 find_pool_constant (cfun, x)->mark = 1;
3914 /* Never search inside a CONST_DOUBLE, because CONST_DOUBLE_MEM may be
3915 a MEM, but does not constitute a use of that MEM. */
3916 else if (GET_CODE (x) == CONST_DOUBLE)
3919 /* Insns may appear inside a SEQUENCE. Only check the patterns of
3920 insns, not any notes that may be attached. We don't want to mark
3921 a constant just because it happens to appear in a REG_EQUIV note. */
3922 if (GET_RTX_CLASS (GET_CODE (x)) == 'i')
3924 mark_constants (PATTERN (x));
3928 format_ptr = GET_RTX_FORMAT (GET_CODE (x));
3930 for (i = 0; i < GET_RTX_LENGTH (GET_CODE (x)); i++)
3932 switch (*format_ptr++)
3935 mark_constants (XEXP (x, i));
3939 if (XVEC (x, i) != 0)
3943 for (j = 0; j < XVECLEN (x, i); j++)
3944 mark_constants (XVECEXP (x, i, j));
3963 /* Find all the constants whose addresses are referenced inside of EXP,
3964 and make sure assembler code with a label has been output for each one.
3965 Indicate whether an ADDR_EXPR has been encountered. */
3968 output_addressed_constants (exp)
3973 switch (TREE_CODE (exp))
3977 register tree constant = TREE_OPERAND (exp, 0);
3979 while (TREE_CODE (constant) == COMPONENT_REF)
3981 constant = TREE_OPERAND (constant, 0);
3984 if (TREE_CODE_CLASS (TREE_CODE (constant)) == 'c'
3985 || TREE_CODE (constant) == CONSTRUCTOR)
3986 /* No need to do anything here
3987 for addresses of variables or functions. */
3988 output_constant_def (constant);
3995 reloc = output_addressed_constants (TREE_OPERAND (exp, 0));
3996 reloc |= output_addressed_constants (TREE_OPERAND (exp, 1));
4001 case NON_LVALUE_EXPR:
4002 reloc = output_addressed_constants (TREE_OPERAND (exp, 0));
4008 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
4009 if (TREE_VALUE (link) != 0)
4010 reloc |= output_addressed_constants (TREE_VALUE (link));
4020 /* Return nonzero if VALUE is a valid constant-valued expression
4021 for use in initializing a static variable; one that can be an
4022 element of a "constant" initializer.
4024 Return null_pointer_node if the value is absolute;
4025 if it is relocatable, return the variable that determines the relocation.
4026 We assume that VALUE has been folded as much as possible;
4027 therefore, we do not need to check for such things as
4028 arithmetic-combinations of integers. */
4031 initializer_constant_valid_p (value, endtype)
4035 /* Give the front-end a chance to convert VALUE to something that
4036 looks more like a constant to the back-end. */
4037 if (lang_expand_constant)
4038 value = (*lang_expand_constant) (value);
4040 switch (TREE_CODE (value))
4043 if ((TREE_CODE (TREE_TYPE (value)) == UNION_TYPE
4044 || TREE_CODE (TREE_TYPE (value)) == RECORD_TYPE)
4045 && TREE_CONSTANT (value)
4046 && CONSTRUCTOR_ELTS (value))
4048 initializer_constant_valid_p (TREE_VALUE (CONSTRUCTOR_ELTS (value)),
4051 return TREE_STATIC (value) ? null_pointer_node : 0;
4057 return null_pointer_node;
4060 return TREE_OPERAND (value, 0);
4062 case NON_LVALUE_EXPR:
4063 return initializer_constant_valid_p (TREE_OPERAND (value, 0), endtype);
4067 /* Allow conversions between pointer types. */
4068 if (POINTER_TYPE_P (TREE_TYPE (value))
4069 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0))))
4070 return initializer_constant_valid_p (TREE_OPERAND (value, 0), endtype);
4072 /* Allow conversions between real types. */
4073 if (FLOAT_TYPE_P (TREE_TYPE (value))
4074 && FLOAT_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0))))
4075 return initializer_constant_valid_p (TREE_OPERAND (value, 0), endtype);
4077 /* Allow length-preserving conversions between integer types. */
4078 if (INTEGRAL_TYPE_P (TREE_TYPE (value))
4079 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0)))
4080 && (TYPE_PRECISION (TREE_TYPE (value))
4081 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value, 0)))))
4082 return initializer_constant_valid_p (TREE_OPERAND (value, 0), endtype);
4084 /* Allow conversions between other integer types only if
4086 if (INTEGRAL_TYPE_P (TREE_TYPE (value))
4087 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0))))
4089 tree inner = initializer_constant_valid_p (TREE_OPERAND (value, 0),
4091 if (inner == null_pointer_node)
4092 return null_pointer_node;
4096 /* Allow (int) &foo provided int is as wide as a pointer. */
4097 if (INTEGRAL_TYPE_P (TREE_TYPE (value))
4098 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0)))
4099 && (TYPE_PRECISION (TREE_TYPE (value))
4100 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value, 0)))))
4101 return initializer_constant_valid_p (TREE_OPERAND (value, 0),
4104 /* Likewise conversions from int to pointers, but also allow
4105 conversions from 0. */
4106 if (POINTER_TYPE_P (TREE_TYPE (value))
4107 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0))))
4109 if (integer_zerop (TREE_OPERAND (value, 0)))
4110 return null_pointer_node;
4111 else if (TYPE_PRECISION (TREE_TYPE (value))
4112 <= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value, 0))))
4113 return initializer_constant_valid_p (TREE_OPERAND (value, 0),
4117 /* Allow conversions to union types if the value inside is okay. */
4118 if (TREE_CODE (TREE_TYPE (value)) == UNION_TYPE)
4119 return initializer_constant_valid_p (TREE_OPERAND (value, 0),
4124 if (! INTEGRAL_TYPE_P (endtype)
4125 || TYPE_PRECISION (endtype) >= POINTER_SIZE)
4127 tree valid0 = initializer_constant_valid_p (TREE_OPERAND (value, 0),
4129 tree valid1 = initializer_constant_valid_p (TREE_OPERAND (value, 1),
4131 /* If either term is absolute, use the other terms relocation. */
4132 if (valid0 == null_pointer_node)
4134 if (valid1 == null_pointer_node)
4140 if (! INTEGRAL_TYPE_P (endtype)
4141 || TYPE_PRECISION (endtype) >= POINTER_SIZE)
4143 tree valid0 = initializer_constant_valid_p (TREE_OPERAND (value, 0),
4145 tree valid1 = initializer_constant_valid_p (TREE_OPERAND (value, 1),
4147 /* Win if second argument is absolute. */
4148 if (valid1 == null_pointer_node)
4150 /* Win if both arguments have the same relocation.
4151 Then the value is absolute. */
4152 if (valid0 == valid1 && valid0 != 0)
4153 return null_pointer_node;
4156 /* Support differences between labels. */
4157 if (INTEGRAL_TYPE_P (endtype))
4160 op0 = TREE_OPERAND (value, 0);
4161 op1 = TREE_OPERAND (value, 1);
4165 if (TREE_CODE (op0) == ADDR_EXPR
4166 && TREE_CODE (TREE_OPERAND (op0, 0)) == LABEL_DECL
4167 && TREE_CODE (op1) == ADDR_EXPR
4168 && TREE_CODE (TREE_OPERAND (op1, 0)) == LABEL_DECL)
4169 return null_pointer_node;
4180 /* Output assembler code for constant EXP to FILE, with no label.
4181 This includes the pseudo-op such as ".int" or ".byte", and a newline.
4182 Assumes output_addressed_constants has been done on EXP already.
4184 Generate exactly SIZE bytes of assembler data, padding at the end
4185 with zeros if necessary. SIZE must always be specified.
4187 SIZE is important for structure constructors,
4188 since trailing members may have been omitted from the constructor.
4189 It is also important for initialization of arrays from string constants
4190 since the full length of the string constant might not be wanted.
4191 It is also needed for initialization of unions, where the initializer's
4192 type is just one member, and that may not be as long as the union.
4194 There a case in which we would fail to output exactly SIZE bytes:
4195 for a structure constructor that wants to produce more than SIZE bytes.
4196 But such constructors will never be generated for any possible input. */
4199 output_constant (exp, size)
4203 register enum tree_code code = TREE_CODE (TREE_TYPE (exp));
4205 /* Some front-ends use constants other than the standard
4206 language-indepdent varieties, but which may still be output
4207 directly. Give the front-end a chance to convert EXP to a
4208 language-independent representation. */
4209 if (lang_expand_constant)
4210 exp = (*lang_expand_constant) (exp);
4212 if (size == 0 || flag_syntax_only)
4215 /* Eliminate the NON_LVALUE_EXPR_EXPR that makes a cast not be an lvalue.
4216 That way we get the constant (we hope) inside it. Also, strip off any
4217 NOP_EXPR that converts between two record, union, array, or set types
4218 or a CONVERT_EXPR that converts to a union TYPE. */
4219 while ((TREE_CODE (exp) == NOP_EXPR
4220 && (TREE_TYPE (exp) == TREE_TYPE (TREE_OPERAND (exp, 0))
4221 || AGGREGATE_TYPE_P (TREE_TYPE (exp))))
4222 || (TREE_CODE (exp) == CONVERT_EXPR
4223 && code == UNION_TYPE)
4224 || TREE_CODE (exp) == NON_LVALUE_EXPR)
4226 exp = TREE_OPERAND (exp, 0);
4227 code = TREE_CODE (TREE_TYPE (exp));
4230 /* Allow a constructor with no elements for any data type.
4231 This means to fill the space with zeros. */
4232 if (TREE_CODE (exp) == CONSTRUCTOR && CONSTRUCTOR_ELTS (exp) == 0)
4234 assemble_zeros (size);
4245 case REFERENCE_TYPE:
4246 /* ??? What about (int)((float)(int)&foo + 4) */
4247 while (TREE_CODE (exp) == NOP_EXPR || TREE_CODE (exp) == CONVERT_EXPR
4248 || TREE_CODE (exp) == NON_LVALUE_EXPR)
4249 exp = TREE_OPERAND (exp, 0);
4251 if (! assemble_integer (expand_expr (exp, NULL_RTX, VOIDmode,
4252 EXPAND_INITIALIZER),
4254 error ("initializer for integer value is too complicated");
4259 if (TREE_CODE (exp) != REAL_CST)
4260 error ("initializer for floating value is not a floating constant");
4262 assemble_real (TREE_REAL_CST (exp),
4263 mode_for_size (size * BITS_PER_UNIT, MODE_FLOAT, 0));
4268 output_constant (TREE_REALPART (exp), size / 2);
4269 output_constant (TREE_IMAGPART (exp), size / 2);
4270 size -= (size / 2) * 2;
4274 if (TREE_CODE (exp) == CONSTRUCTOR)
4276 output_constructor (exp, size);
4279 else if (TREE_CODE (exp) == STRING_CST)
4283 if (size > TREE_STRING_LENGTH (exp))
4285 excess = size - TREE_STRING_LENGTH (exp);
4286 size = TREE_STRING_LENGTH (exp);
4289 assemble_string (TREE_STRING_POINTER (exp), size);
4298 if (TREE_CODE (exp) == CONSTRUCTOR)
4299 output_constructor (exp, size);
4305 if (TREE_CODE (exp) == INTEGER_CST)
4306 assemble_integer (expand_expr (exp, NULL_RTX,
4307 VOIDmode, EXPAND_INITIALIZER),
4309 else if (TREE_CODE (exp) == CONSTRUCTOR)
4311 unsigned char *buffer = (unsigned char *) alloca (size);
4312 if (get_set_constructor_bytes (exp, buffer, size))
4314 assemble_string ((char *) buffer, size);
4317 error ("unknown set constructor type");
4325 assemble_zeros (size);
4329 /* Subroutine of output_constant, used for CONSTRUCTORs
4330 (aggregate constants).
4331 Generate at least SIZE bytes, padding if necessary. */
4334 output_constructor (exp, size)
4338 register tree link, field = 0;
4339 HOST_WIDE_INT min_index = 0;
4340 /* Number of bytes output or skipped so far.
4341 In other words, current position within the constructor. */
4342 int total_bytes = 0;
4343 /* Non-zero means BYTE contains part of a byte, to be output. */
4344 int byte_buffer_in_use = 0;
4345 register int byte = 0;
4347 if (HOST_BITS_PER_WIDE_INT < BITS_PER_UNIT)
4350 if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE)
4351 field = TYPE_FIELDS (TREE_TYPE (exp));
4353 if (TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE
4354 && TYPE_DOMAIN (TREE_TYPE (exp)) != 0)
4356 = TREE_INT_CST_LOW (TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (exp))));
4358 /* As LINK goes through the elements of the constant,
4359 FIELD goes through the structure fields, if the constant is a structure.
4360 if the constant is a union, then we override this,
4361 by getting the field from the TREE_LIST element.
4362 But the constant could also be an array. Then FIELD is zero.
4364 There is always a maximum of one element in the chain LINK for unions
4365 (even if the initializer in a source program incorrectly contains
4367 for (link = CONSTRUCTOR_ELTS (exp);
4369 link = TREE_CHAIN (link),
4370 field = field ? TREE_CHAIN (field) : 0)
4372 tree val = TREE_VALUE (link);
4375 /* the element in a union constructor specifies the proper field. */
4377 if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE
4378 || TREE_CODE (TREE_TYPE (exp)) == UNION_TYPE)
4380 /* if available, use the type given by link */
4381 if (TREE_PURPOSE (link) != 0)
4382 field = TREE_PURPOSE (link);
4385 if (TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE)
4386 index = TREE_PURPOSE (link);
4388 /* Eliminate the marker that makes a cast not be an lvalue. */
4392 if (index && TREE_CODE (index) == RANGE_EXPR)
4394 register int fieldsize
4395 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (exp)));
4396 HOST_WIDE_INT lo_index = TREE_INT_CST_LOW (TREE_OPERAND (index, 0));
4397 HOST_WIDE_INT hi_index = TREE_INT_CST_LOW (TREE_OPERAND (index, 1));
4398 HOST_WIDE_INT index;
4399 for (index = lo_index; index <= hi_index; index++)
4401 /* Output the element's initial value. */
4403 assemble_zeros (fieldsize);
4405 output_constant (val, fieldsize);
4407 /* Count its size. */
4408 total_bytes += fieldsize;
4411 else if (field == 0 || !DECL_BIT_FIELD (field))
4413 /* An element that is not a bit-field. */
4415 register int fieldsize;
4416 /* Since this structure is static,
4417 we know the positions are constant. */
4418 int bitpos = (field ? (TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field))
4422 bitpos = (TREE_INT_CST_LOW (TYPE_SIZE (TREE_TYPE (val)))
4424 * (TREE_INT_CST_LOW (index) - min_index));
4426 /* Output any buffered-up bit-fields preceding this element. */
4427 if (byte_buffer_in_use)
4429 ASM_OUTPUT_BYTE (asm_out_file, byte);
4431 byte_buffer_in_use = 0;
4434 /* Advance to offset of this element.
4435 Note no alignment needed in an array, since that is guaranteed
4436 if each element has the proper size. */
4437 if ((field != 0 || index != 0) && bitpos != total_bytes)
4439 assemble_zeros (bitpos - total_bytes);
4440 total_bytes = bitpos;
4443 /* Determine size this element should occupy. */
4446 if (TREE_CODE (DECL_SIZE_UNIT (field)) != INTEGER_CST)
4449 fieldsize = TREE_INT_CST_LOW (DECL_SIZE_UNIT (field));
4452 fieldsize = int_size_in_bytes (TREE_TYPE (TREE_TYPE (exp)));
4454 /* Output the element's initial value. */
4456 assemble_zeros (fieldsize);
4458 output_constant (val, fieldsize);
4460 /* Count its size. */
4461 total_bytes += fieldsize;
4463 else if (val != 0 && TREE_CODE (val) != INTEGER_CST)
4464 error ("invalid initial value for member `%s'",
4465 IDENTIFIER_POINTER (DECL_NAME (field)));
4468 /* Element that is a bit-field. */
4470 int next_offset = TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field));
4472 = (next_offset + TREE_INT_CST_LOW (DECL_SIZE (field)));
4475 val = integer_zero_node;
4477 /* If this field does not start in this (or, next) byte,
4479 if (next_offset / BITS_PER_UNIT != total_bytes)
4481 /* Output remnant of any bit field in previous bytes. */
4482 if (byte_buffer_in_use)
4484 ASM_OUTPUT_BYTE (asm_out_file, byte);
4486 byte_buffer_in_use = 0;
4489 /* If still not at proper byte, advance to there. */
4490 if (next_offset / BITS_PER_UNIT != total_bytes)
4492 assemble_zeros (next_offset / BITS_PER_UNIT - total_bytes);
4493 total_bytes = next_offset / BITS_PER_UNIT;
4497 if (! byte_buffer_in_use)
4500 /* We must split the element into pieces that fall within
4501 separate bytes, and combine each byte with previous or
4502 following bit-fields. */
4504 /* next_offset is the offset n fbits from the beginning of
4505 the structure to the next bit of this element to be processed.
4506 end_offset is the offset of the first bit past the end of
4508 while (next_offset < end_offset)
4512 HOST_WIDE_INT value;
4513 int next_byte = next_offset / BITS_PER_UNIT;
4514 int next_bit = next_offset % BITS_PER_UNIT;
4516 /* Advance from byte to byte
4517 within this element when necessary. */
4518 while (next_byte != total_bytes)
4520 ASM_OUTPUT_BYTE (asm_out_file, byte);
4525 /* Number of bits we can process at once
4526 (all part of the same byte). */
4527 this_time = MIN (end_offset - next_offset,
4528 BITS_PER_UNIT - next_bit);
4529 if (BYTES_BIG_ENDIAN)
4531 /* On big-endian machine, take the most significant bits
4532 first (of the bits that are significant)
4533 and put them into bytes from the most significant end. */
4534 shift = end_offset - next_offset - this_time;
4535 /* Don't try to take a bunch of bits that cross
4536 the word boundary in the INTEGER_CST. We can
4537 only select bits from the LOW or HIGH part
4539 if (shift < HOST_BITS_PER_WIDE_INT
4540 && shift + this_time > HOST_BITS_PER_WIDE_INT)
4542 this_time = shift + this_time - HOST_BITS_PER_WIDE_INT;
4543 shift = HOST_BITS_PER_WIDE_INT;
4546 /* Now get the bits from the appropriate constant word. */
4547 if (shift < HOST_BITS_PER_WIDE_INT)
4549 value = TREE_INT_CST_LOW (val);
4551 else if (shift < 2 * HOST_BITS_PER_WIDE_INT)
4553 value = TREE_INT_CST_HIGH (val);
4554 shift -= HOST_BITS_PER_WIDE_INT;
4558 /* Get the result. This works only when:
4559 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4560 byte |= (((value >> shift)
4561 & (((HOST_WIDE_INT) 2 << (this_time - 1)) - 1))
4562 << (BITS_PER_UNIT - this_time - next_bit));
4566 /* On little-endian machines,
4567 take first the least significant bits of the value
4568 and pack them starting at the least significant
4569 bits of the bytes. */
4570 shift = (next_offset
4571 - TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field)));
4572 /* Don't try to take a bunch of bits that cross
4573 the word boundary in the INTEGER_CST. We can
4574 only select bits from the LOW or HIGH part
4576 if (shift < HOST_BITS_PER_WIDE_INT
4577 && shift + this_time > HOST_BITS_PER_WIDE_INT)
4579 this_time = (HOST_BITS_PER_WIDE_INT - shift);
4582 /* Now get the bits from the appropriate constant word. */
4583 if (shift < HOST_BITS_PER_WIDE_INT)
4584 value = TREE_INT_CST_LOW (val);
4585 else if (shift < 2 * HOST_BITS_PER_WIDE_INT)
4587 value = TREE_INT_CST_HIGH (val);
4588 shift -= HOST_BITS_PER_WIDE_INT;
4592 /* Get the result. This works only when:
4593 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4594 byte |= (((value >> shift)
4595 & (((HOST_WIDE_INT) 2 << (this_time - 1)) - 1))
4598 next_offset += this_time;
4599 byte_buffer_in_use = 1;
4603 if (byte_buffer_in_use)
4605 ASM_OUTPUT_BYTE (asm_out_file, byte);
4608 if (total_bytes < size)
4609 assemble_zeros (size - total_bytes);
4612 #ifdef HANDLE_PRAGMA_WEAK
4613 /* Add function NAME to the weak symbols list. VALUE is a weak alias
4614 associatd with NAME. */
4617 add_weak (name, value)
4621 struct weak_syms *weak;
4623 weak = (struct weak_syms *) permalloc (sizeof (struct weak_syms));
4628 weak->next = weak_decls;
4630 weak->value = value;
4635 #endif /* HANDLE_PRAGMA_WEAK */
4637 /* Declare DECL to be a weak symbol. */
4643 if (! TREE_PUBLIC (decl))
4644 error_with_decl (decl, "weak declaration of `%s' must be public");
4645 else if (TREE_ASM_WRITTEN (decl))
4646 error_with_decl (decl, "weak declaration of `%s' must precede definition");
4647 else if (SUPPORTS_WEAK)
4648 DECL_WEAK (decl) = 1;
4649 #ifdef HANDLE_PRAGMA_WEAK
4650 add_weak (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl)), NULL);
4654 /* Emit any pending weak declarations. */
4656 #ifdef HANDLE_PRAGMA_WEAK
4657 struct weak_syms * weak_decls;
4663 #ifdef HANDLE_PRAGMA_WEAK
4664 if (HANDLE_PRAGMA_WEAK)
4666 struct weak_syms *t;
4667 for (t = weak_decls; t; t = t->next)
4671 ASM_WEAKEN_LABEL (asm_out_file, t->name);
4673 ASM_OUTPUT_DEF (asm_out_file, t->name, t->value);
4680 /* Remove NAME from the pending list of weak symbols. This prevents
4681 the compiler from emitting multiple .weak directives which confuses
4683 #ifdef ASM_WEAKEN_LABEL
4685 remove_from_pending_weak_list (name)
4686 char *name ATTRIBUTE_UNUSED;
4688 #ifdef HANDLE_PRAGMA_WEAK
4689 if (HANDLE_PRAGMA_WEAK)
4691 struct weak_syms *t;
4692 for (t = weak_decls; t; t = t->next)
4694 if (t->name && strcmp (name, t->name) == 0)
4703 assemble_alias (decl, target)
4704 tree decl, target ATTRIBUTE_UNUSED;
4708 make_decl_rtl (decl, (char *) 0, 1);
4709 name = XSTR (XEXP (DECL_RTL (decl), 0), 0);
4711 #ifdef ASM_OUTPUT_DEF
4712 /* Make name accessible from other files, if appropriate. */
4714 if (TREE_PUBLIC (decl))
4716 #ifdef ASM_WEAKEN_LABEL
4717 if (DECL_WEAK (decl))
4719 ASM_WEAKEN_LABEL (asm_out_file, name);
4720 /* Remove this function from the pending weak list so that
4721 we do not emit multiple .weak directives for it. */
4722 remove_from_pending_weak_list
4723 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl)));
4727 ASM_GLOBALIZE_LABEL (asm_out_file, name);
4730 #ifdef ASM_OUTPUT_DEF_FROM_DECLS
4731 ASM_OUTPUT_DEF_FROM_DECLS (asm_out_file, decl, target);
4733 ASM_OUTPUT_DEF (asm_out_file, name, IDENTIFIER_POINTER (target));
4735 TREE_ASM_WRITTEN (decl) = 1;
4737 #ifdef ASM_OUTPUT_WEAK_ALIAS
4738 if (! DECL_WEAK (decl))
4739 warning ("only weak aliases are supported in this configuration");
4741 ASM_OUTPUT_WEAK_ALIAS (asm_out_file, name, IDENTIFIER_POINTER (target));
4742 TREE_ASM_WRITTEN (decl) = 1;
4744 warning ("alias definitions not supported in this configuration; ignored");
4749 /* This determines whether or not we support link-once semantics. */
4750 #ifndef SUPPORTS_ONE_ONLY
4751 #ifdef MAKE_DECL_ONE_ONLY
4752 #define SUPPORTS_ONE_ONLY 1
4754 #define SUPPORTS_ONE_ONLY 0
4758 /* Returns 1 if the target configuration supports defining public symbols
4759 so that one of them will be chosen at link time instead of generating a
4760 multiply-defined symbol error, whether through the use of weak symbols or
4761 a target-specific mechanism for having duplicates discarded. */
4764 supports_one_only ()
4766 if (SUPPORTS_ONE_ONLY)
4768 return SUPPORTS_WEAK;
4771 /* Set up DECL as a public symbol that can be defined in multiple
4772 translation units without generating a linker error. */
4775 make_decl_one_only (decl)
4778 if (TREE_CODE (decl) != VAR_DECL && TREE_CODE (decl) != FUNCTION_DECL)
4781 TREE_PUBLIC (decl) = 1;
4783 if (TREE_CODE (decl) == VAR_DECL
4784 && (DECL_INITIAL (decl) == 0 || DECL_INITIAL (decl) == error_mark_node))
4785 DECL_COMMON (decl) = 1;
4786 else if (SUPPORTS_ONE_ONLY)
4788 #ifdef MAKE_DECL_ONE_ONLY
4789 MAKE_DECL_ONE_ONLY (decl);
4791 DECL_ONE_ONLY (decl) = 1;
4793 else if (SUPPORTS_WEAK)
4794 DECL_WEAK (decl) = 1;
4802 ggc_add_root (const_hash_table, MAX_HASH_TABLE, sizeof const_hash_table[0],
4803 mark_const_hash_entry);
4804 ggc_add_string_root (&in_named_name, 1);