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. */
38 #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 const char *first_global_object_name;
81 const 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 const unsigned char *compare_constant_1 PARAMS ((tree, const unsigned 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 ((const char *));
180 #ifdef ASM_OUTPUT_BSS
181 static void asm_output_bss PARAMS ((FILE *, tree, const char *, int, int));
183 #ifdef BSS_SECTION_ASM_OP
184 #ifdef ASM_OUTPUT_ALIGNED_BSS
185 static void asm_output_aligned_bss PARAMS ((FILE *, tree, const char *,
188 #endif /* BSS_SECTION_ASM_OP */
189 static void mark_pool_constant PARAMS ((struct pool_constant *));
190 static void mark_pool_sym_hash_table PARAMS ((struct pool_sym **));
191 static void mark_const_hash_entry PARAMS ((void *));
192 static void asm_emit_uninitialised PARAMS ((tree, const char*, int, int));
194 static enum in_section { no_section, in_text, in_data, in_named
195 #ifdef BSS_SECTION_ASM_OP
198 #ifdef EH_FRAME_SECTION_ASM_OP
201 #ifdef EXTRA_SECTIONS
204 } in_section = no_section;
206 /* Return a non-zero value if DECL has a section attribute. */
207 #ifndef IN_NAMED_SECTION
208 #define IN_NAMED_SECTION(DECL) \
209 ((TREE_CODE (DECL) == FUNCTION_DECL || TREE_CODE (DECL) == VAR_DECL) \
210 && DECL_SECTION_NAME (DECL) != NULL_TREE)
213 /* Text of section name when in_section == in_named. */
214 static char *in_named_name;
216 /* Define functions like text_section for any extra sections. */
217 #ifdef EXTRA_SECTION_FUNCTIONS
218 EXTRA_SECTION_FUNCTIONS
221 /* Tell assembler to switch to text section. */
226 if (in_section != in_text)
228 fprintf (asm_out_file, "%s\n", TEXT_SECTION_ASM_OP);
229 in_section = in_text;
233 /* Tell assembler to switch to data section. */
238 if (in_section != in_data)
240 if (flag_shared_data)
242 #ifdef SHARED_SECTION_ASM_OP
243 fprintf (asm_out_file, "%s\n", SHARED_SECTION_ASM_OP);
245 fprintf (asm_out_file, "%s\n", DATA_SECTION_ASM_OP);
249 fprintf (asm_out_file, "%s\n", DATA_SECTION_ASM_OP);
251 in_section = in_data;
254 /* Tell assembler to ALWAYS switch to data section, in case
255 it's not sure where it it. */
258 force_data_section ()
260 in_section = no_section;
264 /* Tell assembler to switch to read-only data section. This is normally
268 readonly_data_section ()
270 #ifdef READONLY_DATA_SECTION
271 READONLY_DATA_SECTION (); /* Note this can call data_section. */
277 /* Determine if we're in the text section. */
282 return in_section == in_text;
285 /* Determine if we're in the data section. */
290 return in_section == in_data;
293 /* Tell assembler to change to section NAME for DECL.
294 If DECL is NULL, just switch to section NAME.
295 If NAME is NULL, get the name from DECL.
296 If RELOC is 1, the initializer for DECL contains relocs. */
299 named_section (decl, name, reloc)
302 int reloc ATTRIBUTE_UNUSED;
304 if (decl != NULL_TREE && !DECL_P (decl))
307 name = TREE_STRING_POINTER (DECL_SECTION_NAME (decl));
309 if (in_section != in_named || strcmp (name, in_named_name))
311 #ifdef ASM_OUTPUT_SECTION_NAME
312 ASM_OUTPUT_SECTION_NAME (asm_out_file, decl, name, reloc);
314 /* Section attributes are not supported if this macro isn't provided -
315 some host formats don't support them at all. The front-end should
316 already have flagged this as an error. */
320 in_named_name = ggc_alloc_string (name, -1);
321 in_section = in_named;
325 #ifdef ASM_OUTPUT_SECTION_NAME
326 #ifndef UNIQUE_SECTION
327 #define UNIQUE_SECTION(DECL,RELOC) \
333 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (DECL)); \
334 /* Strip off any encoding in name. */ \
335 STRIP_NAME_ENCODING (name, name); \
337 len = strlen (name) + 1; \
338 string = alloca (len + 1); \
339 sprintf (string, ".%s", name); \
341 DECL_SECTION_NAME (DECL) = build_string (len, string); \
344 #ifndef UNIQUE_SECTION_P
345 #define UNIQUE_SECTION_P(DECL) 0
349 #ifdef BSS_SECTION_ASM_OP
351 /* Tell the assembler to switch to the bss section. */
356 if (in_section != in_bss)
358 #ifdef SHARED_BSS_SECTION_ASM_OP
359 if (flag_shared_data)
360 fprintf (asm_out_file, "%s\n", SHARED_BSS_SECTION_ASM_OP);
363 fprintf (asm_out_file, "%s\n", BSS_SECTION_ASM_OP);
369 #ifdef ASM_OUTPUT_BSS
371 /* Utility function for ASM_OUTPUT_BSS for targets to use if
372 they don't support alignments in .bss.
373 ??? It is believed that this function will work in most cases so such
374 support is localized here. */
377 asm_output_bss (file, decl, name, size, rounded)
379 tree decl ATTRIBUTE_UNUSED;
381 int size ATTRIBUTE_UNUSED, rounded;
383 ASM_GLOBALIZE_LABEL (file, name);
385 #ifdef ASM_DECLARE_OBJECT_NAME
386 last_assemble_variable_decl = decl;
387 ASM_DECLARE_OBJECT_NAME (file, name, decl);
389 /* Standard thing is just output label for the object. */
390 ASM_OUTPUT_LABEL (file, name);
391 #endif /* ASM_DECLARE_OBJECT_NAME */
392 ASM_OUTPUT_SKIP (file, rounded);
397 #ifdef ASM_OUTPUT_ALIGNED_BSS
399 /* Utility function for targets to use in implementing
400 ASM_OUTPUT_ALIGNED_BSS.
401 ??? It is believed that this function will work in most cases so such
402 support is localized here. */
405 asm_output_aligned_bss (file, decl, name, size, align)
411 ASM_GLOBALIZE_LABEL (file, name);
413 ASM_OUTPUT_ALIGN (file, floor_log2 (align / BITS_PER_UNIT));
414 #ifdef ASM_DECLARE_OBJECT_NAME
415 last_assemble_variable_decl = decl;
416 ASM_DECLARE_OBJECT_NAME (file, name, decl);
418 /* Standard thing is just output label for the object. */
419 ASM_OUTPUT_LABEL (file, name);
420 #endif /* ASM_DECLARE_OBJECT_NAME */
421 ASM_OUTPUT_SKIP (file, size ? size : 1);
426 #endif /* BSS_SECTION_ASM_OP */
428 #ifdef EH_FRAME_SECTION_ASM_OP
432 if (in_section != in_eh_frame)
434 fprintf (asm_out_file, "%s\n", EH_FRAME_SECTION_ASM_OP);
435 in_section = in_eh_frame;
440 /* Switch to the section for function DECL.
442 If DECL is NULL_TREE, switch to the text section.
443 ??? It's not clear that we will ever be passed NULL_TREE, but it's
444 safer to handle it. */
447 function_section (decl)
450 if (decl != NULL_TREE
451 && DECL_SECTION_NAME (decl) != NULL_TREE)
452 named_section (decl, (char *) 0, 0);
457 /* Switch to section for variable DECL.
459 RELOC is the `reloc' argument to SELECT_SECTION. */
462 variable_section (decl, reloc)
466 if (IN_NAMED_SECTION (decl))
467 named_section (decl, NULL, reloc);
470 /* C++ can have const variables that get initialized from constructors,
471 and thus can not be in a readonly section. We prevent this by
472 verifying that the initial value is constant for objects put in a
475 error_mark_node is used by the C front end to indicate that the
476 initializer has not been seen yet. In this case, we assume that
477 the initializer must be constant.
479 C++ uses error_mark_node for variables that have complicated
480 initializers, but these variables go in BSS so we won't be called
483 #ifdef SELECT_SECTION
484 SELECT_SECTION (decl, reloc);
486 if (DECL_READONLY_SECTION (decl, reloc))
487 readonly_data_section ();
494 /* Tell assembler to switch to the section for the exception handling
500 #if defined (EXCEPTION_SECTION)
501 EXCEPTION_SECTION ();
503 #ifdef ASM_OUTPUT_SECTION_NAME
504 named_section (NULL_TREE, ".gcc_except_table", 0);
509 readonly_data_section ();
514 /* Create the rtl to represent a function, for a function definition.
515 DECL is a FUNCTION_DECL node which describes which function.
516 The rtl is stored into DECL. */
519 make_function_rtl (decl)
523 const char *new_name;
525 if (DECL_RTL (decl) != 0)
527 /* ??? Another way to do this would be to do what halfpic.c does
528 and maintain a hashed table of such critters. */
529 /* ??? Another way to do this would be to pass a flag bit to
530 ENCODE_SECTION_INFO saying whether this is a new decl or not. */
531 /* Let the target reassign the RTL if it wants.
532 This is necessary, for example, when one machine specific
533 decl attribute overrides another. */
534 #ifdef REDO_SECTION_INFO_P
535 if (REDO_SECTION_INFO_P (decl))
536 ENCODE_SECTION_INFO (decl);
541 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
544 /* Rename a nested function to avoid conflicts, unless it's a member of
545 a local class, in which case the class name is already unique. */
546 if (decl_function_context (decl) != 0
547 && ! TYPE_P (DECL_CONTEXT (decl))
548 && DECL_INITIAL (decl) != 0
549 && DECL_RTL (decl) == 0)
552 ASM_FORMAT_PRIVATE_NAME (label, name, var_labelno);
556 /* When -fprefix-function-name is used, every function name is
557 prefixed. Even static functions are prefixed because they
558 could be declared latter. Note that a nested function name
560 else if (flag_prefix_function_name)
562 size_t name_len = IDENTIFIER_LENGTH (DECL_ASSEMBLER_NAME (decl));
565 pname = alloca (name_len + CHKR_PREFIX_SIZE + 1);
566 memcpy (pname, CHKR_PREFIX, CHKR_PREFIX_SIZE);
567 memcpy (pname + CHKR_PREFIX_SIZE, name, name_len + 1);
571 if (name != new_name)
573 DECL_ASSEMBLER_NAME (decl) = get_identifier (new_name);
574 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
578 = gen_rtx_MEM (DECL_MODE (decl),
579 gen_rtx_SYMBOL_REF (Pmode, name));
581 /* Optionally set flags or add text to the name to record
582 information such as that it is a function name. If the name
583 is changed, the macro ASM_OUTPUT_LABELREF will have to know
584 how to strip this information. */
585 #ifdef ENCODE_SECTION_INFO
586 ENCODE_SECTION_INFO (decl);
591 /* Given NAME, a putative register name, discard any customary prefixes. */
594 strip_reg_name (name)
597 #ifdef REGISTER_PREFIX
598 if (!strncmp (name, REGISTER_PREFIX, strlen (REGISTER_PREFIX)))
599 name += strlen (REGISTER_PREFIX);
601 if (name[0] == '%' || name[0] == '#')
606 /* Decode an `asm' spec for a declaration as a register name.
607 Return the register number, or -1 if nothing specified,
608 or -2 if the ASMSPEC is not `cc' or `memory' and is not recognized,
609 or -3 if ASMSPEC is `cc' and is not recognized,
610 or -4 if ASMSPEC is `memory' and is not recognized.
611 Accept an exact spelling or a decimal number.
612 Prefixes such as % are optional. */
615 decode_reg_name (asmspec)
622 /* Get rid of confusing prefixes. */
623 asmspec = strip_reg_name (asmspec);
625 /* Allow a decimal number as a "register name". */
626 for (i = strlen (asmspec) - 1; i >= 0; i--)
627 if (! (asmspec[i] >= '0' && asmspec[i] <= '9'))
629 if (asmspec[0] != 0 && i < 0)
632 if (i < FIRST_PSEUDO_REGISTER && i >= 0)
638 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
640 && ! strcmp (asmspec, strip_reg_name (reg_names[i])))
643 #ifdef ADDITIONAL_REGISTER_NAMES
645 static struct { const char *name; int number; } table[]
646 = ADDITIONAL_REGISTER_NAMES;
648 for (i = 0; i < (int) ARRAY_SIZE (table); i++)
649 if (! strcmp (asmspec, table[i].name))
650 return table[i].number;
652 #endif /* ADDITIONAL_REGISTER_NAMES */
654 if (!strcmp (asmspec, "memory"))
657 if (!strcmp (asmspec, "cc"))
666 /* Create the DECL_RTL for a declaration for a static or external variable
667 or static or external function.
668 ASMSPEC, if not 0, is the string which the user specified
669 as the assembler symbol name.
670 TOP_LEVEL is nonzero if this is a file-scope variable.
672 This is never called for PARM_DECL nodes. */
675 make_decl_rtl (decl, asmspec, top_level)
680 const char *name = 0;
681 const char *new_name = 0;
684 /* For a duplicate declaration, we can be called twice on the
685 same DECL node. Don't discard the RTL already made. */
686 if (DECL_RTL (decl) != 0)
688 /* If the old RTL had the wrong mode, fix the mode. */
689 if (GET_MODE (DECL_RTL (decl)) != DECL_MODE (decl))
691 rtx rtl = DECL_RTL (decl);
692 PUT_MODE (rtl, DECL_MODE (decl));
695 /* ??? Another way to do this would be to do what halfpic.c does
696 and maintain a hashed table of such critters. */
697 /* ??? Another way to do this would be to pass a flag bit to
698 ENCODE_SECTION_INFO saying whether this is a new decl or not. */
699 /* Let the target reassign the RTL if it wants.
700 This is necessary, for example, when one machine specific
701 decl attribute overrides another. */
702 #ifdef REDO_SECTION_INFO_P
703 if (REDO_SECTION_INFO_P (decl))
704 ENCODE_SECTION_INFO (decl);
709 new_name = name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
711 reg_number = decode_reg_name (asmspec);
712 if (reg_number == -2)
713 /* ASMSPEC is given, and not the name of a register. */
716 if (TREE_CODE (decl) != FUNCTION_DECL && DECL_REGISTER (decl))
718 /* First detect errors in declaring global registers. */
719 if (reg_number == -1)
720 error_with_decl (decl, "register name not specified for `%s'");
721 else if (reg_number < 0)
722 error_with_decl (decl, "invalid register name for `%s'");
723 else if (TYPE_MODE (TREE_TYPE (decl)) == BLKmode)
724 error_with_decl (decl,
725 "data type of `%s' isn't suitable for a register");
726 else if (! HARD_REGNO_MODE_OK (reg_number, TYPE_MODE (TREE_TYPE (decl))))
727 error_with_decl (decl,
728 "register specified for `%s' isn't suitable for data type");
729 /* Now handle properly declared static register variables. */
734 if (DECL_INITIAL (decl) != 0 && top_level)
736 DECL_INITIAL (decl) = 0;
737 error ("global register variable has initial value");
739 if (TREE_THIS_VOLATILE (decl))
740 warning ("volatile register variables don't work as you might wish");
742 /* If the user specified one of the eliminables registers here,
743 e.g., FRAME_POINTER_REGNUM, we don't want to get this variable
744 confused with that register and be eliminated. Although this
745 usage is somewhat suspect, we nevertheless use the following
746 kludge to avoid setting DECL_RTL to frame_pointer_rtx. */
749 = gen_rtx_REG (DECL_MODE (decl), FIRST_PSEUDO_REGISTER);
750 REGNO (DECL_RTL (decl)) = reg_number;
751 REG_USERVAR_P (DECL_RTL (decl)) = 1;
755 /* Make this register global, so not usable for anything
757 #ifdef ASM_DECLARE_REGISTER_GLOBAL
758 ASM_DECLARE_REGISTER_GLOBAL (asm_out_file, decl, reg_number, name);
760 nregs = HARD_REGNO_NREGS (reg_number, DECL_MODE (decl));
762 globalize_reg (reg_number + --nregs);
765 /* As a register variable, it has no section. */
770 /* Now handle ordinary static variables and functions (in memory).
771 Also handle vars declared register invalidly. */
773 if (reg_number >= 0 || reg_number == -3)
774 error_with_decl (decl,
775 "register name given for non-register variable `%s'");
777 /* Specifying a section attribute on a variable forces it into a
778 non-.bss section, and thus it cannot be common. */
779 if (TREE_CODE (decl) == VAR_DECL
780 && DECL_SECTION_NAME (decl) != NULL_TREE
781 && DECL_INITIAL (decl) == NULL_TREE
782 && DECL_COMMON (decl))
783 DECL_COMMON (decl) = 0;
785 /* Can't use just the variable's own name for a variable
786 whose scope is less than the whole file, unless it's a member
787 of a local class (which will already be unambiguous).
788 Concatenate a distinguishing number. */
789 if (!top_level && !TREE_PUBLIC (decl)
790 && ! (DECL_CONTEXT (decl) && TYPE_P (DECL_CONTEXT (decl)))
794 ASM_FORMAT_PRIVATE_NAME (label, name, var_labelno);
799 /* When -fprefix-function-name is used, the functions
800 names are prefixed. Only nested function names are not
802 else if (flag_prefix_function_name && TREE_CODE (decl) == FUNCTION_DECL)
804 size_t name_len = IDENTIFIER_LENGTH (DECL_ASSEMBLER_NAME (decl));
807 pname = alloca (name_len + CHKR_PREFIX_SIZE + 1);
808 memcpy (pname, CHKR_PREFIX, CHKR_PREFIX_SIZE);
809 memcpy (pname + CHKR_PREFIX_SIZE, name, name_len + 1);
813 if (name != new_name)
815 DECL_ASSEMBLER_NAME (decl) = get_identifier (new_name);
816 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
819 /* If this variable is to be treated as volatile, show its
820 tree node has side effects. */
821 if ((flag_volatile_global && TREE_CODE (decl) == VAR_DECL
822 && TREE_PUBLIC (decl))
823 || ((flag_volatile_static && TREE_CODE (decl) == VAR_DECL
824 && (TREE_PUBLIC (decl) || TREE_STATIC (decl)))))
825 TREE_SIDE_EFFECTS (decl) = 1;
827 DECL_RTL (decl) = gen_rtx_MEM (DECL_MODE (decl),
828 gen_rtx_SYMBOL_REF (Pmode, name));
829 if (TREE_CODE (decl) != FUNCTION_DECL)
830 set_mem_attributes (DECL_RTL (decl), decl, 1);
832 /* Optionally set flags or add text to the name to record information
833 such as that it is a function name.
834 If the name is changed, the macro ASM_OUTPUT_LABELREF
835 will have to know how to strip this information. */
836 #ifdef ENCODE_SECTION_INFO
837 ENCODE_SECTION_INFO (decl);
841 /* Make the rtl for variable VAR be volatile.
842 Use this only for static variables. */
845 make_var_volatile (var)
848 if (GET_CODE (DECL_RTL (var)) != MEM)
851 MEM_VOLATILE_P (DECL_RTL (var)) = 1;
854 /* Output alignment directive to align for constant expression EXP. */
857 assemble_constant_align (exp)
862 /* Align the location counter as required by EXP's data type. */
863 align = TYPE_ALIGN (TREE_TYPE (exp));
864 #ifdef CONSTANT_ALIGNMENT
865 align = CONSTANT_ALIGNMENT (exp, align);
868 if (align > BITS_PER_UNIT)
869 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
872 /* Output a string of literal assembler code
873 for an `asm' keyword used between functions. */
876 assemble_asm (string)
881 if (TREE_CODE (string) == ADDR_EXPR)
882 string = TREE_OPERAND (string, 0);
884 fprintf (asm_out_file, "\t%s\n", TREE_STRING_POINTER (string));
887 #if 0 /* This should no longer be needed, because
888 flag_gnu_linker should be 0 on these systems,
889 which should prevent any output
890 if ASM_OUTPUT_CONSTRUCTOR and ASM_OUTPUT_DESTRUCTOR are absent. */
891 #if !(defined(DBX_DEBUGGING_INFO) && !defined(FASCIST_ASSEMBLER))
892 #ifndef ASM_OUTPUT_CONSTRUCTOR
893 #define ASM_OUTPUT_CONSTRUCTOR(file, name)
895 #ifndef ASM_OUTPUT_DESTRUCTOR
896 #define ASM_OUTPUT_DESTRUCTOR(file, name)
901 /* Record an element in the table of global destructors.
902 How this is done depends on what sort of assembler and linker
905 NAME should be the name of a global function to be called
906 at exit time. This name is output using assemble_name. */
909 assemble_destructor (name)
912 #ifdef ASM_OUTPUT_DESTRUCTOR
913 ASM_OUTPUT_DESTRUCTOR (asm_out_file, name);
917 /* Now tell GNU LD that this is part of the static destructor set. */
918 /* This code works for any machine provided you use GNU as/ld. */
919 fprintf (asm_out_file, "%s \"___DTOR_LIST__\",22,0,0,", ASM_STABS_OP);
920 assemble_name (asm_out_file, name);
921 fputc ('\n', asm_out_file);
926 /* Likewise for global constructors. */
929 assemble_constructor (name)
932 #ifdef ASM_OUTPUT_CONSTRUCTOR
933 ASM_OUTPUT_CONSTRUCTOR (asm_out_file, name);
937 /* Now tell GNU LD that this is part of the static constructor set. */
938 /* This code works for any machine provided you use GNU as/ld. */
939 fprintf (asm_out_file, "%s \"___CTOR_LIST__\",22,0,0,", ASM_STABS_OP);
940 assemble_name (asm_out_file, name);
941 fputc ('\n', asm_out_file);
946 /* Likewise for entries we want to record for garbage collection.
947 Garbage collection is still under development. */
950 assemble_gc_entry (name)
953 #ifdef ASM_OUTPUT_GC_ENTRY
954 ASM_OUTPUT_GC_ENTRY (asm_out_file, name);
958 /* Now tell GNU LD that this is part of the static constructor set. */
959 fprintf (asm_out_file, "%s \"___PTR_LIST__\",22,0,0,", ASM_STABS_OP);
960 assemble_name (asm_out_file, name);
961 fputc ('\n', asm_out_file);
966 /* CONSTANT_POOL_BEFORE_FUNCTION may be defined as an expression with
967 a non-zero value if the constant pool should be output before the
968 start of the function, or a zero value if the pool should output
969 after the end of the function. The default is to put it before the
972 #ifndef CONSTANT_POOL_BEFORE_FUNCTION
973 #define CONSTANT_POOL_BEFORE_FUNCTION 1
976 /* Output assembler code for the constant pool of a function and associated
977 with defining the name of the function. DECL describes the function.
978 NAME is the function's name. For the constant pool, we use the current
979 constant pool data. */
982 assemble_start_function (decl, fnname)
988 /* The following code does not need preprocessing in the assembler. */
992 if (CONSTANT_POOL_BEFORE_FUNCTION)
993 output_constant_pool (fnname, decl);
995 #ifdef ASM_OUTPUT_SECTION_NAME
996 /* If the function is to be put in its own section and it's not in a section
997 already, indicate so. */
998 if ((flag_function_sections
999 && DECL_SECTION_NAME (decl) == NULL_TREE)
1000 || UNIQUE_SECTION_P (decl))
1001 UNIQUE_SECTION (decl, 0);
1004 function_section (decl);
1006 /* Tell assembler to move to target machine's alignment for functions. */
1007 align = floor_log2 (FUNCTION_BOUNDARY / BITS_PER_UNIT);
1009 ASM_OUTPUT_ALIGN (asm_out_file, align);
1011 /* Handle a user-specified function alignment.
1012 Note that we still need to align to FUNCTION_BOUNDARY, as above,
1013 because ASM_OUTPUT_MAX_SKIP_ALIGN might not do any alignment at all. */
1014 if (align_functions_log > align)
1016 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
1017 ASM_OUTPUT_MAX_SKIP_ALIGN (asm_out_file,
1018 align_functions_log, align_functions-1);
1020 ASM_OUTPUT_ALIGN (asm_out_file, align_functions_log);
1024 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
1025 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file, fnname);
1028 #ifdef SDB_DEBUGGING_INFO
1029 /* Output SDB definition of the function. */
1030 if (write_symbols == SDB_DEBUG)
1031 sdbout_mark_begin_function ();
1034 #ifdef DBX_DEBUGGING_INFO
1035 /* Output DBX definition of the function. */
1036 if (write_symbols == DBX_DEBUG)
1037 dbxout_begin_function (decl);
1040 /* Make function name accessible from other files, if appropriate. */
1042 if (TREE_PUBLIC (decl))
1044 if (! first_global_object_name)
1049 STRIP_NAME_ENCODING (p, fnname);
1050 name = permalloc (strlen (p) + 1);
1053 if (! DECL_WEAK (decl) && ! DECL_ONE_ONLY (decl))
1054 first_global_object_name = name;
1056 weak_global_object_name = name;
1059 #ifdef ASM_WEAKEN_LABEL
1060 if (DECL_WEAK (decl))
1062 ASM_WEAKEN_LABEL (asm_out_file, fnname);
1063 /* Remove this function from the pending weak list so that
1064 we do not emit multiple .weak directives for it. */
1065 remove_from_pending_weak_list
1066 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl)));
1070 ASM_GLOBALIZE_LABEL (asm_out_file, fnname);
1073 /* Do any machine/system dependent processing of the function name */
1074 #ifdef ASM_DECLARE_FUNCTION_NAME
1075 ASM_DECLARE_FUNCTION_NAME (asm_out_file, fnname, current_function_decl);
1077 /* Standard thing is just output label for the function. */
1078 ASM_OUTPUT_LABEL (asm_out_file, fnname);
1079 #endif /* ASM_DECLARE_FUNCTION_NAME */
1082 /* Output assembler code associated with defining the size of the
1083 function. DECL describes the function. NAME is the function's name. */
1086 assemble_end_function (decl, fnname)
1090 #ifdef ASM_DECLARE_FUNCTION_SIZE
1091 ASM_DECLARE_FUNCTION_SIZE (asm_out_file, fnname, decl);
1093 if (! CONSTANT_POOL_BEFORE_FUNCTION)
1095 output_constant_pool (fnname, decl);
1096 function_section (decl); /* need to switch back */
1099 /* Output any constants which should appear after the function. */
1100 output_after_function_constants ();
1103 /* Assemble code to leave SIZE bytes of zeros. */
1106 assemble_zeros (size)
1109 /* Do no output if -fsyntax-only. */
1110 if (flag_syntax_only)
1113 #ifdef ASM_NO_SKIP_IN_TEXT
1114 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
1115 so we must output 0s explicitly in the text section. */
1116 if (ASM_NO_SKIP_IN_TEXT && in_text_section ())
1120 for (i = 0; i < size - 20; i += 20)
1123 fprintf (asm_out_file,
1124 "%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);
1126 fprintf (asm_out_file,
1127 "\tbyte 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n");
1133 fprintf (asm_out_file, "%s 0", ASM_BYTE_OP);
1135 fprintf (asm_out_file, "\tbyte 0");
1138 for (; i < size; i++)
1139 fprintf (asm_out_file, ",0");
1140 fprintf (asm_out_file, "\n");
1146 ASM_OUTPUT_SKIP (asm_out_file, size);
1149 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
1152 assemble_align (align)
1155 if (align > BITS_PER_UNIT)
1156 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
1159 /* Assemble a string constant with the specified C string as contents. */
1162 assemble_string (p, size)
1169 /* If the string is very long, split it up. */
1173 int thissize = size - pos;
1174 if (thissize > maximum)
1177 ASM_OUTPUT_ASCII (asm_out_file, p, thissize);
1185 #if defined ASM_OUTPUT_ALIGNED_DECL_LOCAL
1186 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1187 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1189 #if defined ASM_OUTPUT_ALIGNED_LOCAL
1190 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1191 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, DECL_ALIGN (decl))
1193 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1194 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded)
1198 #if defined ASM_OUTPUT_ALIGNED_BSS
1199 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1200 ASM_OUTPUT_ALIGNED_BSS (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1202 #if defined ASM_OUTPUT_BSS
1203 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1204 ASM_OUTPUT_BSS (asm_out_file, decl, name, size, rounded)
1210 #if defined ASM_OUTPUT_ALIGNED_DECL_COMMON
1211 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1212 ASM_OUTPUT_ALIGNED_DECL_COMMON (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1214 #if defined ASM_OUTPUT_ALIGNED_COMMON
1215 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1216 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file, name, size, DECL_ALIGN (decl))
1218 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1219 ASM_OUTPUT_COMMON (asm_out_file, name, size, rounded)
1224 asm_emit_uninitialised (decl, name, size, rounded)
1227 int size ATTRIBUTE_UNUSED;
1228 int rounded ATTRIBUTE_UNUSED;
1236 destination = asm_dest_local;
1238 if (TREE_PUBLIC (decl))
1240 #if defined ASM_EMIT_BSS
1241 if (! DECL_COMMON (decl))
1242 destination = asm_dest_bss;
1245 destination = asm_dest_common;
1248 if (flag_shared_data)
1250 switch (destination)
1252 #ifdef ASM_OUTPUT_SHARED_BSS
1254 ASM_OUTPUT_SHARED_BSS (asm_out_file, decl, name, size, rounded);
1257 #ifdef ASM_OUTPUT_SHARED_COMMON
1258 case asm_dest_common:
1259 ASM_OUTPUT_SHARED_COMMON (asm_out_file, name, size, rounded);
1262 #ifdef ASM_OUTPUT_SHARED_LOCAL
1263 case asm_dest_local:
1264 ASM_OUTPUT_SHARED_LOCAL (asm_out_file, name, size, rounded);
1272 #ifdef ASM_OUTPUT_SECTION_NAME
1273 /* We already know that DECL_SECTION_NAME() == NULL. */
1274 if (flag_data_sections != 0 || UNIQUE_SECTION_P (decl))
1275 UNIQUE_SECTION (decl, 0);
1278 switch (destination)
1282 ASM_EMIT_BSS (decl, name, size, rounded);
1285 case asm_dest_common:
1286 ASM_EMIT_COMMON (decl, name, size, rounded);
1288 case asm_dest_local:
1289 ASM_EMIT_LOCAL (decl, name, size, rounded);
1298 /* Assemble everything that is needed for a variable or function declaration.
1299 Not used for automatic variables, and not used for function definitions.
1300 Should not be called for variables of incomplete structure type.
1302 TOP_LEVEL is nonzero if this variable has file scope.
1303 AT_END is nonzero if this is the special handling, at end of compilation,
1304 to define things that have had only tentative definitions.
1305 DONT_OUTPUT_DATA if nonzero means don't actually output the
1306 initial value (that will be done by the caller). */
1309 assemble_variable (decl, top_level, at_end, dont_output_data)
1311 int top_level ATTRIBUTE_UNUSED;
1312 int at_end ATTRIBUTE_UNUSED;
1313 int dont_output_data;
1315 register const char *name;
1318 enum in_section saved_in_section;
1320 last_assemble_variable_decl = 0;
1322 if (GET_CODE (DECL_RTL (decl)) == REG)
1324 /* Do output symbol info for global register variables, but do nothing
1327 if (TREE_ASM_WRITTEN (decl))
1329 TREE_ASM_WRITTEN (decl) = 1;
1331 /* Do no output if -fsyntax-only. */
1332 if (flag_syntax_only)
1335 #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
1336 /* File-scope global variables are output here. */
1337 if ((write_symbols == DBX_DEBUG || write_symbols == XCOFF_DEBUG)
1339 dbxout_symbol (decl, 0);
1341 #ifdef SDB_DEBUGGING_INFO
1342 if (write_symbols == SDB_DEBUG && top_level
1343 /* Leave initialized global vars for end of compilation;
1344 see comment in compile_file. */
1345 && (TREE_PUBLIC (decl) == 0 || DECL_INITIAL (decl) == 0))
1346 sdbout_symbol (decl, 0);
1349 /* Don't output any DWARF debugging information for variables here.
1350 In the case of local variables, the information for them is output
1351 when we do our recursive traversal of the tree representation for
1352 the entire containing function. In the case of file-scope variables,
1353 we output information for all of them at the very end of compilation
1354 while we are doing our final traversal of the chain of file-scope
1360 /* Normally no need to say anything here for external references,
1361 since assemble_external is called by the language-specific code
1362 when a declaration is first seen. */
1364 if (DECL_EXTERNAL (decl))
1367 /* Output no assembler code for a function declaration.
1368 Only definitions of functions output anything. */
1370 if (TREE_CODE (decl) == FUNCTION_DECL)
1373 /* If type was incomplete when the variable was declared,
1374 see if it is complete now. */
1376 if (DECL_SIZE (decl) == 0)
1377 layout_decl (decl, 0);
1379 /* Still incomplete => don't allocate it; treat the tentative defn
1380 (which is what it must have been) as an `extern' reference. */
1382 if (!dont_output_data && DECL_SIZE (decl) == 0)
1384 error_with_file_and_line (DECL_SOURCE_FILE (decl),
1385 DECL_SOURCE_LINE (decl),
1386 "storage size of `%s' isn't known",
1387 IDENTIFIER_POINTER (DECL_NAME (decl)));
1388 TREE_ASM_WRITTEN (decl) = 1;
1392 /* The first declaration of a variable that comes through this function
1393 decides whether it is global (in C, has external linkage)
1394 or local (in C, has internal linkage). So do nothing more
1395 if this function has already run. */
1397 if (TREE_ASM_WRITTEN (decl))
1400 TREE_ASM_WRITTEN (decl) = 1;
1402 /* Do no output if -fsyntax-only. */
1403 if (flag_syntax_only)
1408 if (! dont_output_data
1409 && ! host_integerp (DECL_SIZE_UNIT (decl), 1))
1411 error_with_decl (decl, "size of variable `%s' is too large");
1415 name = XSTR (XEXP (DECL_RTL (decl), 0), 0);
1416 if (TREE_PUBLIC (decl) && DECL_NAME (decl)
1417 && ! first_global_object_name
1418 && ! (DECL_COMMON (decl) && (DECL_INITIAL (decl) == 0
1419 || DECL_INITIAL (decl) == error_mark_node))
1420 && ! DECL_WEAK (decl)
1421 && ! DECL_ONE_ONLY (decl))
1426 STRIP_NAME_ENCODING (p, name);
1427 xname = permalloc (strlen (p) + 1);
1429 first_global_object_name = xname;
1432 /* Compute the alignment of this data. */
1434 align = DECL_ALIGN (decl);
1436 /* In the case for initialing an array whose length isn't specified,
1437 where we have not yet been able to do the layout,
1438 figure out the proper alignment now. */
1439 if (dont_output_data && DECL_SIZE (decl) == 0
1440 && TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE)
1441 align = MAX (align, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl))));
1443 /* Some object file formats have a maximum alignment which they support.
1444 In particular, a.out format supports a maximum alignment of 4. */
1445 #ifndef MAX_OFILE_ALIGNMENT
1446 #define MAX_OFILE_ALIGNMENT BIGGEST_ALIGNMENT
1448 if (align > MAX_OFILE_ALIGNMENT)
1450 warning_with_decl (decl,
1451 "alignment of `%s' is greater than maximum object file alignment. Using %d.",
1452 MAX_OFILE_ALIGNMENT/BITS_PER_UNIT);
1453 align = MAX_OFILE_ALIGNMENT;
1456 /* On some machines, it is good to increase alignment sometimes. */
1457 #ifdef DATA_ALIGNMENT
1458 align = DATA_ALIGNMENT (TREE_TYPE (decl), align);
1460 #ifdef CONSTANT_ALIGNMENT
1461 if (DECL_INITIAL (decl) != 0 && DECL_INITIAL (decl) != error_mark_node)
1462 align = CONSTANT_ALIGNMENT (DECL_INITIAL (decl), align);
1465 /* Reset the alignment in case we have made it tighter, so we can benefit
1466 from it in get_pointer_alignment. */
1467 DECL_ALIGN (decl) = align;
1469 /* Handle uninitialized definitions. */
1471 if ((DECL_INITIAL (decl) == 0 || DECL_INITIAL (decl) == error_mark_node)
1472 /* If the target can't output uninitialized but not common global data
1473 in .bss, then we have to use .data. */
1474 #if ! defined ASM_EMIT_BSS
1475 && DECL_COMMON (decl)
1477 && DECL_SECTION_NAME (decl) == NULL_TREE
1478 && ! dont_output_data)
1480 unsigned HOST_WIDE_INT size = tree_low_cst (DECL_SIZE_UNIT (decl), 1);
1481 unsigned HOST_WIDE_INT rounded = size;
1483 /* Don't allocate zero bytes of common,
1484 since that means "undefined external" in the linker. */
1488 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1489 so that each uninitialized object starts on such a boundary. */
1490 rounded += (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1;
1491 rounded = (rounded / (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
1492 * (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
1494 /* Don't continue this line--convex cc version 4.1 would lose. */
1495 #if !defined(ASM_OUTPUT_ALIGNED_COMMON) && !defined(ASM_OUTPUT_ALIGNED_DECL_COMMON) && !defined(ASM_OUTPUT_ALIGNED_BSS)
1496 if ((unsigned HOST_WIDE_INT) DECL_ALIGN (decl) / BITS_PER_UNIT > rounded)
1498 (decl, "requested alignment for %s is greater than implemented alignment of %d.",rounded);
1501 #ifdef DBX_DEBUGGING_INFO
1502 /* File-scope global variables are output here. */
1503 if (write_symbols == DBX_DEBUG && top_level)
1504 dbxout_symbol (decl, 0);
1506 #ifdef SDB_DEBUGGING_INFO
1507 if (write_symbols == SDB_DEBUG && top_level
1508 /* Leave initialized global vars for end of compilation;
1509 see comment in compile_file. */
1510 && (TREE_PUBLIC (decl) == 0 || DECL_INITIAL (decl) == 0))
1511 sdbout_symbol (decl, 0);
1514 /* Don't output any DWARF debugging information for variables here.
1515 In the case of local variables, the information for them is output
1516 when we do our recursive traversal of the tree representation for
1517 the entire containing function. In the case of file-scope variables,
1518 we output information for all of them at the very end of compilation
1519 while we are doing our final traversal of the chain of file-scope
1522 #if 0 /* ??? We should either delete this or add a comment describing what
1523 it was intended to do and why we shouldn't delete it. */
1524 if (flag_shared_data)
1527 asm_emit_uninitialised (decl, name, size, rounded);
1532 /* Handle initialized definitions.
1533 Also handle uninitialized global definitions if -fno-common and the
1534 target doesn't support ASM_OUTPUT_BSS. */
1536 /* First make the assembler name(s) global if appropriate. */
1537 if (TREE_PUBLIC (decl) && DECL_NAME (decl))
1539 #ifdef ASM_WEAKEN_LABEL
1540 if (DECL_WEAK (decl))
1542 ASM_WEAKEN_LABEL (asm_out_file, name);
1543 /* Remove this variable from the pending weak list so that
1544 we do not emit multiple .weak directives for it. */
1545 remove_from_pending_weak_list
1546 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl)));
1550 ASM_GLOBALIZE_LABEL (asm_out_file, name);
1553 for (d = equivalents; d; d = TREE_CHAIN (d))
1555 tree e = TREE_VALUE (d);
1556 if (TREE_PUBLIC (e) && DECL_NAME (e))
1557 ASM_GLOBALIZE_LABEL (asm_out_file,
1558 XSTR (XEXP (DECL_RTL (e), 0), 0));
1562 /* Output any data that we will need to use the address of. */
1563 if (DECL_INITIAL (decl) == error_mark_node)
1564 reloc = contains_pointers_p (TREE_TYPE (decl));
1565 else if (DECL_INITIAL (decl))
1566 reloc = output_addressed_constants (DECL_INITIAL (decl));
1568 #ifdef ASM_OUTPUT_SECTION_NAME
1569 if ((flag_data_sections != 0 && DECL_SECTION_NAME (decl) == NULL_TREE)
1570 || UNIQUE_SECTION_P (decl))
1571 UNIQUE_SECTION (decl, reloc);
1574 /* Switch to the appropriate section. */
1575 variable_section (decl, reloc);
1577 /* dbxout.c needs to know this. */
1578 if (in_text_section ())
1579 DECL_IN_TEXT_SECTION (decl) = 1;
1581 /* Record current section so we can restore it if dbxout.c clobbers it. */
1582 saved_in_section = in_section;
1584 /* Output the dbx info now that we have chosen the section. */
1586 #ifdef DBX_DEBUGGING_INFO
1587 /* File-scope global variables are output here. */
1588 if (write_symbols == DBX_DEBUG && top_level)
1589 dbxout_symbol (decl, 0);
1591 #ifdef SDB_DEBUGGING_INFO
1592 if (write_symbols == SDB_DEBUG && top_level
1593 /* Leave initialized global vars for end of compilation;
1594 see comment in compile_file. */
1595 && (TREE_PUBLIC (decl) == 0 || DECL_INITIAL (decl) == 0))
1596 sdbout_symbol (decl, 0);
1599 /* Don't output any DWARF debugging information for variables here.
1600 In the case of local variables, the information for them is output
1601 when we do our recursive traversal of the tree representation for
1602 the entire containing function. In the case of file-scope variables,
1603 we output information for all of them at the very end of compilation
1604 while we are doing our final traversal of the chain of file-scope
1607 /* If the debugging output changed sections, reselect the section
1608 that's supposed to be selected. */
1609 if (in_section != saved_in_section)
1610 variable_section (decl, reloc);
1612 /* Output the alignment of this data. */
1613 if (align > BITS_PER_UNIT)
1614 ASM_OUTPUT_ALIGN (asm_out_file,
1615 floor_log2 (DECL_ALIGN (decl) / BITS_PER_UNIT));
1617 /* Do any machine/system dependent processing of the object. */
1618 #ifdef ASM_DECLARE_OBJECT_NAME
1619 last_assemble_variable_decl = decl;
1620 ASM_DECLARE_OBJECT_NAME (asm_out_file, name, decl);
1622 /* Standard thing is just output label for the object. */
1623 ASM_OUTPUT_LABEL (asm_out_file, name);
1624 #endif /* ASM_DECLARE_OBJECT_NAME */
1626 if (!dont_output_data)
1628 if (DECL_INITIAL (decl))
1629 /* Output the actual data. */
1630 output_constant (DECL_INITIAL (decl),
1631 tree_low_cst (DECL_SIZE_UNIT (decl), 1));
1633 /* Leave space for it. */
1634 assemble_zeros (tree_low_cst (DECL_SIZE_UNIT (decl), 1));
1638 #ifdef XCOFF_DEBUGGING_INFO
1639 /* Unfortunately, the IBM assembler cannot handle stabx before the actual
1640 declaration. When something like ".stabx "aa:S-2",aa,133,0" is emitted
1641 and `aa' hasn't been output yet, the assembler generates a stab entry with
1642 a value of zero, in addition to creating an unnecessary external entry
1643 for `aa'. Hence, we must postpone dbxout_symbol to here at the end. */
1645 /* File-scope global variables are output here. */
1646 if (write_symbols == XCOFF_DEBUG && top_level)
1648 saved_in_section = in_section;
1650 dbxout_symbol (decl, 0);
1652 if (in_section != saved_in_section)
1653 variable_section (decl, reloc);
1656 /* There must be a statement after a label. */
1661 /* Return 1 if type TYPE contains any pointers. */
1664 contains_pointers_p (type)
1667 switch (TREE_CODE (type))
1670 case REFERENCE_TYPE:
1671 /* I'm not sure whether OFFSET_TYPE needs this treatment,
1672 so I'll play safe and return 1. */
1678 case QUAL_UNION_TYPE:
1681 /* For a type that has fields, see if the fields have pointers. */
1682 for (fields = TYPE_FIELDS (type); fields; fields = TREE_CHAIN (fields))
1683 if (TREE_CODE (fields) == FIELD_DECL
1684 && contains_pointers_p (TREE_TYPE (fields)))
1690 /* An array type contains pointers if its element type does. */
1691 return contains_pointers_p (TREE_TYPE (type));
1698 /* Output something to declare an external symbol to the assembler.
1699 (Most assemblers don't need this, so we normally output nothing.)
1700 Do nothing if DECL is not external. */
1703 assemble_external (decl)
1704 tree decl ATTRIBUTE_UNUSED;
1706 #ifdef ASM_OUTPUT_EXTERNAL
1707 if (DECL_P (decl) && DECL_EXTERNAL (decl) && TREE_PUBLIC (decl))
1709 rtx rtl = DECL_RTL (decl);
1711 if (GET_CODE (rtl) == MEM && GET_CODE (XEXP (rtl, 0)) == SYMBOL_REF
1712 && ! SYMBOL_REF_USED (XEXP (rtl, 0)))
1714 /* Some systems do require some output. */
1715 SYMBOL_REF_USED (XEXP (rtl, 0)) = 1;
1716 ASM_OUTPUT_EXTERNAL (asm_out_file, decl, XSTR (XEXP (rtl, 0), 0));
1722 /* Similar, for calling a library function FUN. */
1725 assemble_external_libcall (fun)
1726 rtx fun ATTRIBUTE_UNUSED;
1728 #ifdef ASM_OUTPUT_EXTERNAL_LIBCALL
1729 /* Declare library function name external when first used, if nec. */
1730 if (! SYMBOL_REF_USED (fun))
1732 SYMBOL_REF_USED (fun) = 1;
1733 ASM_OUTPUT_EXTERNAL_LIBCALL (asm_out_file, fun);
1738 /* Declare the label NAME global. */
1741 assemble_global (name)
1744 ASM_GLOBALIZE_LABEL (asm_out_file, name);
1747 /* Assemble a label named NAME. */
1750 assemble_label (name)
1753 ASM_OUTPUT_LABEL (asm_out_file, name);
1756 /* Output to FILE a reference to the assembler name of a C-level name NAME.
1757 If NAME starts with a *, the rest of NAME is output verbatim.
1758 Otherwise NAME is transformed in an implementation-defined way
1759 (usually by the addition of an underscore).
1760 Many macros in the tm file are defined to call this function. */
1763 assemble_name (file, name)
1767 const char *real_name;
1770 STRIP_NAME_ENCODING (real_name, name);
1771 if (flag_prefix_function_name
1772 && ! bcmp (real_name, CHKR_PREFIX, CHKR_PREFIX_SIZE))
1773 real_name = real_name + CHKR_PREFIX_SIZE;
1775 id = maybe_get_identifier (real_name);
1777 TREE_SYMBOL_REFERENCED (id) = 1;
1780 fputs (&name[1], file);
1782 ASM_OUTPUT_LABELREF (file, name);
1785 /* Allocate SIZE bytes writable static space with a gensym name
1786 and return an RTX to refer to its address. */
1789 assemble_static_space (size)
1797 if (flag_shared_data)
1801 ASM_GENERATE_INTERNAL_LABEL (name, "LF", const_labelno);
1803 namestring = ggc_alloc_string (name, -1);
1805 x = gen_rtx_SYMBOL_REF (Pmode, namestring);
1807 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
1808 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, NULL_TREE, name, size,
1811 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1812 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, BIGGEST_ALIGNMENT);
1815 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1816 so that each uninitialized object starts on such a boundary. */
1817 /* Variable `rounded' might or might not be used in ASM_OUTPUT_LOCAL. */
1818 int rounded ATTRIBUTE_UNUSED
1819 = ((size + (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1)
1820 / (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
1821 * (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
1822 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded);
1829 /* Assemble the static constant template for function entry trampolines.
1830 This is done at most once per compilation.
1831 Returns an RTX for the address of the template. */
1833 #ifdef TRAMPOLINE_TEMPLATE
1835 assemble_trampoline_template ()
1841 /* By default, put trampoline templates in read-only data section. */
1843 #ifdef TRAMPOLINE_SECTION
1844 TRAMPOLINE_SECTION ();
1846 readonly_data_section ();
1849 /* Write the assembler code to define one. */
1850 align = floor_log2 (TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT);
1852 ASM_OUTPUT_ALIGN (asm_out_file, align);
1854 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LTRAMP", 0);
1855 TRAMPOLINE_TEMPLATE (asm_out_file);
1857 /* Record the rtl to refer to it. */
1858 ASM_GENERATE_INTERNAL_LABEL (label, "LTRAMP", 0);
1859 name = ggc_alloc_string (label, -1);
1860 return gen_rtx_SYMBOL_REF (Pmode, name);
1864 /* Assemble the integer constant X into an object of SIZE bytes.
1865 X must be either a CONST_INT or CONST_DOUBLE.
1867 Return 1 if we were able to output the constant, otherwise 0. If FORCE is
1868 non-zero, abort if we can't output the constant. */
1871 assemble_integer (x, size, force)
1876 /* First try to use the standard 1, 2, 4, 8, and 16 byte
1877 ASM_OUTPUT... macros. */
1881 #ifdef ASM_OUTPUT_CHAR
1883 ASM_OUTPUT_CHAR (asm_out_file, x);
1887 #ifdef ASM_OUTPUT_SHORT
1889 ASM_OUTPUT_SHORT (asm_out_file, x);
1893 #ifdef ASM_OUTPUT_INT
1895 ASM_OUTPUT_INT (asm_out_file, x);
1899 #ifdef ASM_OUTPUT_DOUBLE_INT
1901 ASM_OUTPUT_DOUBLE_INT (asm_out_file, x);
1905 #ifdef ASM_OUTPUT_QUADRUPLE_INT
1907 ASM_OUTPUT_QUADRUPLE_INT (asm_out_file, x);
1912 /* If we couldn't do it that way, there are two other possibilities: First,
1913 if the machine can output an explicit byte and this is a 1 byte constant,
1914 we can use ASM_OUTPUT_BYTE. */
1916 #ifdef ASM_OUTPUT_BYTE
1917 if (size == 1 && GET_CODE (x) == CONST_INT)
1919 ASM_OUTPUT_BYTE (asm_out_file, INTVAL (x));
1924 /* Finally, if SIZE is larger than a single word, try to output the constant
1925 one word at a time. */
1927 if (size > UNITS_PER_WORD)
1930 enum machine_mode mode
1931 = mode_for_size (size * BITS_PER_UNIT, MODE_INT, 0);
1934 for (i = 0; i < size / UNITS_PER_WORD; i++)
1936 word = operand_subword (x, i, 0, mode);
1941 if (! assemble_integer (word, UNITS_PER_WORD, 0))
1945 if (i == size / UNITS_PER_WORD)
1947 /* If we output at least one word and then could not finish,
1948 there is no valid way to continue. */
1959 /* Assemble the floating-point constant D into an object of size MODE. */
1962 assemble_real (d, mode)
1964 enum machine_mode mode;
1966 jmp_buf output_constant_handler;
1968 if (setjmp (output_constant_handler))
1970 error ("floating point trap outputting a constant");
1971 #ifdef REAL_IS_NOT_DOUBLE
1972 bzero ((char *) &d, sizeof d);
1979 set_float_handler (output_constant_handler);
1983 #ifdef ASM_OUTPUT_BYTE_FLOAT
1985 ASM_OUTPUT_BYTE_FLOAT (asm_out_file, d);
1988 #ifdef ASM_OUTPUT_SHORT_FLOAT
1990 ASM_OUTPUT_SHORT_FLOAT (asm_out_file, d);
1993 #ifdef ASM_OUTPUT_THREE_QUARTER_FLOAT
1995 ASM_OUTPUT_THREE_QUARTER_FLOAT (asm_out_file, d);
1998 #ifdef ASM_OUTPUT_FLOAT
2000 ASM_OUTPUT_FLOAT (asm_out_file, d);
2004 #ifdef ASM_OUTPUT_DOUBLE
2006 ASM_OUTPUT_DOUBLE (asm_out_file, d);
2010 #ifdef ASM_OUTPUT_LONG_DOUBLE
2013 ASM_OUTPUT_LONG_DOUBLE (asm_out_file, d);
2021 set_float_handler (NULL_PTR);
2024 /* Here we combine duplicate floating constants to make
2025 CONST_DOUBLE rtx's, and force those out to memory when necessary. */
2027 /* Return a CONST_DOUBLE or CONST_INT for a value specified as a pair of ints.
2028 For an integer, I0 is the low-order word and I1 is the high-order word.
2029 For a real number, I0 is the word with the low address
2030 and I1 is the word with the high address. */
2033 immed_double_const (i0, i1, mode)
2034 HOST_WIDE_INT i0, i1;
2035 enum machine_mode mode;
2039 if (GET_MODE_CLASS (mode) == MODE_INT
2040 || GET_MODE_CLASS (mode) == MODE_PARTIAL_INT)
2042 /* We clear out all bits that don't belong in MODE, unless they and our
2043 sign bit are all one. So we get either a reasonable negative value
2044 or a reasonable unsigned value for this mode. */
2045 int width = GET_MODE_BITSIZE (mode);
2046 if (width < HOST_BITS_PER_WIDE_INT
2047 && ((i0 & ((HOST_WIDE_INT) (-1) << (width - 1)))
2048 != ((HOST_WIDE_INT) (-1) << (width - 1))))
2049 i0 &= ((HOST_WIDE_INT) 1 << width) - 1, i1 = 0;
2050 else if (width == HOST_BITS_PER_WIDE_INT
2051 && ! (i1 == ~0 && i0 < 0))
2053 else if (width > 2 * HOST_BITS_PER_WIDE_INT)
2054 /* We cannot represent this value as a constant. */
2057 /* If this would be an entire word for the target, but is not for
2058 the host, then sign-extend on the host so that the number will look
2059 the same way on the host that it would on the target.
2061 For example, when building a 64 bit alpha hosted 32 bit sparc
2062 targeted compiler, then we want the 32 bit unsigned value -1 to be
2063 represented as a 64 bit value -1, and not as 0x00000000ffffffff.
2064 The later confuses the sparc backend. */
2066 if (BITS_PER_WORD < HOST_BITS_PER_WIDE_INT && BITS_PER_WORD == width
2067 && (i0 & ((HOST_WIDE_INT) 1 << (width - 1))))
2068 i0 |= ((HOST_WIDE_INT) (-1) << width);
2070 /* If MODE fits within HOST_BITS_PER_WIDE_INT, always use a CONST_INT.
2072 ??? Strictly speaking, this is wrong if we create a CONST_INT
2073 for a large unsigned constant with the size of MODE being
2074 HOST_BITS_PER_WIDE_INT and later try to interpret that constant in a
2075 wider mode. In that case we will mis-interpret it as a negative
2078 Unfortunately, the only alternative is to make a CONST_DOUBLE
2079 for any constant in any mode if it is an unsigned constant larger
2080 than the maximum signed integer in an int on the host. However,
2081 doing this will break everyone that always expects to see a CONST_INT
2082 for SImode and smaller.
2084 We have always been making CONST_INTs in this case, so nothing new
2087 if (width <= HOST_BITS_PER_WIDE_INT)
2088 i1 = (i0 < 0) ? ~(HOST_WIDE_INT) 0 : 0;
2090 /* If this integer fits in one word, return a CONST_INT. */
2091 if ((i1 == 0 && i0 >= 0)
2092 || (i1 == ~0 && i0 < 0))
2093 return GEN_INT (i0);
2095 /* We use VOIDmode for integers. */
2099 /* Search the chain for an existing CONST_DOUBLE with the right value.
2100 If one is found, return it. */
2102 for (r = const_double_chain; r; r = CONST_DOUBLE_CHAIN (r))
2103 if (CONST_DOUBLE_LOW (r) == i0 && CONST_DOUBLE_HIGH (r) == i1
2104 && GET_MODE (r) == mode)
2107 /* No; make a new one and add it to the chain.
2109 We may be called by an optimizer which may be discarding any memory
2110 allocated during its processing (such as combine and loop). However,
2111 we will be leaving this constant on the chain, so we cannot tolerate
2112 freed memory. So switch to saveable_obstack for this allocation
2113 and then switch back if we were in current_obstack. */
2115 push_obstacks_nochange ();
2116 rtl_in_saveable_obstack ();
2117 r = gen_rtx_CONST_DOUBLE (mode, const0_rtx, i0, i1);
2120 /* Don't touch const_double_chain if not inside any function. */
2121 if (current_function_decl != 0)
2123 CONST_DOUBLE_CHAIN (r) = const_double_chain;
2124 const_double_chain = r;
2130 /* Return a CONST_DOUBLE for a specified `double' value
2131 and machine mode. */
2134 immed_real_const_1 (d, mode)
2136 enum machine_mode mode;
2138 union real_extract u;
2141 /* Get the desired `double' value as a sequence of ints
2142 since that is how they are stored in a CONST_DOUBLE. */
2146 /* Detect special cases. But be careful we don't use a CONST_DOUBLE
2147 that's from a parent function since it may be in its constant pool. */
2148 if (REAL_VALUES_IDENTICAL (dconst0, d)
2149 && (cfun == 0 || decl_function_context (current_function_decl) == 0))
2150 return CONST0_RTX (mode);
2152 /* Check for NaN first, because some ports (specifically the i386) do not
2153 emit correct ieee-fp code by default, and thus will generate a core
2154 dump here if we pass a NaN to REAL_VALUES_EQUAL and if REAL_VALUES_EQUAL
2155 does a floating point comparison. */
2156 else if ((! REAL_VALUE_ISNAN (d) && REAL_VALUES_EQUAL (dconst1, d))
2158 || decl_function_context (current_function_decl) == 0))
2159 return CONST1_RTX (mode);
2161 if (sizeof u == sizeof (HOST_WIDE_INT))
2162 return immed_double_const (u.i[0], 0, mode);
2163 if (sizeof u == 2 * sizeof (HOST_WIDE_INT))
2164 return immed_double_const (u.i[0], u.i[1], mode);
2166 /* The rest of this function handles the case where
2167 a float value requires more than 2 ints of space.
2168 It will be deleted as dead code on machines that don't need it. */
2170 /* Search the chain for an existing CONST_DOUBLE with the right value.
2171 If one is found, return it. */
2173 for (r = const_double_chain; r; r = CONST_DOUBLE_CHAIN (r))
2174 if (! bcmp ((char *) &CONST_DOUBLE_LOW (r), (char *) &u, sizeof u)
2175 && GET_MODE (r) == mode)
2178 /* No; make a new one and add it to the chain.
2180 We may be called by an optimizer which may be discarding any memory
2181 allocated during its processing (such as combine and loop). However,
2182 we will be leaving this constant on the chain, so we cannot tolerate
2183 freed memory. So switch to saveable_obstack for this allocation
2184 and then switch back if we were in current_obstack. */
2185 push_obstacks_nochange ();
2186 rtl_in_saveable_obstack ();
2187 r = rtx_alloc (CONST_DOUBLE);
2190 bcopy ((char *) &u, (char *) &CONST_DOUBLE_LOW (r), sizeof u);
2192 /* If we aren't inside a function, don't put r on the
2193 const_double_chain. */
2194 if (current_function_decl != 0)
2196 CONST_DOUBLE_CHAIN (r) = const_double_chain;
2197 const_double_chain = r;
2200 CONST_DOUBLE_CHAIN (r) = NULL_RTX;
2202 /* Store const0_rtx in CONST_DOUBLE_MEM since this CONST_DOUBLE is on the
2203 chain, but has not been allocated memory. Actual use of CONST_DOUBLE_MEM
2204 is only through force_const_mem. */
2206 CONST_DOUBLE_MEM (r) = const0_rtx;
2211 /* Return a CONST_DOUBLE rtx for a value specified by EXP,
2212 which must be a REAL_CST tree node. */
2215 immed_real_const (exp)
2218 return immed_real_const_1 (TREE_REAL_CST (exp), TYPE_MODE (TREE_TYPE (exp)));
2221 /* At the end of a function, forget the memory-constants
2222 previously made for CONST_DOUBLEs. Mark them as not on real_constant_chain.
2223 Also clear out real_constant_chain and clear out all the chain-pointers. */
2226 clear_const_double_mem ()
2228 register rtx r, next;
2230 for (r = const_double_chain; r; r = next)
2232 next = CONST_DOUBLE_CHAIN (r);
2233 CONST_DOUBLE_CHAIN (r) = 0;
2234 CONST_DOUBLE_MEM (r) = cc0_rtx;
2236 const_double_chain = 0;
2239 /* Given an expression EXP with a constant value,
2240 reduce it to the sum of an assembler symbol and an integer.
2241 Store them both in the structure *VALUE.
2242 Abort if EXP does not reduce. */
2247 HOST_WIDE_INT offset;
2251 decode_addr_const (exp, value)
2253 struct addr_const *value;
2255 register tree target = TREE_OPERAND (exp, 0);
2256 register int offset = 0;
2261 if (TREE_CODE (target) == COMPONENT_REF
2262 && host_integerp (byte_position (TREE_OPERAND (target, 1)), 0))
2265 offset += int_byte_position (TREE_OPERAND (target, 1));
2266 target = TREE_OPERAND (target, 0);
2268 else if (TREE_CODE (target) == ARRAY_REF)
2270 offset += (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (target)), 1)
2271 * tree_low_cst (TREE_OPERAND (target, 1), 0));
2272 target = TREE_OPERAND (target, 0);
2278 switch (TREE_CODE (target))
2282 x = DECL_RTL (target);
2286 x = gen_rtx_MEM (FUNCTION_MODE,
2287 gen_rtx_LABEL_REF (VOIDmode,
2288 label_rtx (TREE_OPERAND (exp, 0))));
2296 x = TREE_CST_RTL (target);
2303 if (GET_CODE (x) != MEM)
2308 value->offset = offset;
2311 /* Uniquize all constants that appear in memory.
2312 Each constant in memory thus far output is recorded
2313 in `const_hash_table' with a `struct constant_descriptor'
2314 that contains a polish representation of the value of
2317 We cannot store the trees in the hash table
2318 because the trees may be temporary. */
2320 struct constant_descriptor
2322 struct constant_descriptor *next;
2325 unsigned char contents[1];
2329 #define MAX_HASH_TABLE 1009
2330 static struct constant_descriptor *const_hash_table[MAX_HASH_TABLE];
2332 /* Mark a const_hash_table descriptor for GC. */
2335 mark_const_hash_entry (ptr)
2338 struct constant_descriptor *desc = * (struct constant_descriptor **) ptr;
2342 ggc_mark_string ((const char *)desc->label);
2343 ggc_mark_rtx (desc->rtl);
2348 /* Compute a hash code for a constant expression. */
2354 register const char *p;
2355 register int len, hi, i;
2356 register enum tree_code code = TREE_CODE (exp);
2358 /* Either set P and LEN to the address and len of something to hash and
2359 exit the switch or return a value. */
2364 p = (char *) &TREE_INT_CST (exp);
2365 len = sizeof TREE_INT_CST (exp);
2369 p = (char *) &TREE_REAL_CST (exp);
2370 len = sizeof TREE_REAL_CST (exp);
2374 p = TREE_STRING_POINTER (exp);
2375 len = TREE_STRING_LENGTH (exp);
2379 return (const_hash (TREE_REALPART (exp)) * 5
2380 + const_hash (TREE_IMAGPART (exp)));
2383 if (TREE_CODE (TREE_TYPE (exp)) == SET_TYPE)
2387 len = int_size_in_bytes (TREE_TYPE (exp));
2388 tmp = (char *) alloca (len);
2389 get_set_constructor_bytes (exp, (unsigned char *) tmp, len);
2397 /* For record type, include the type in the hashing.
2398 We do not do so for array types
2399 because (1) the sizes of the elements are sufficient
2400 and (2) distinct array types can have the same constructor.
2401 Instead, we include the array size because the constructor could
2403 if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE)
2404 hi = ((unsigned long) TREE_TYPE (exp) & ((1 << HASHBITS) - 1))
2407 hi = ((5 + int_size_in_bytes (TREE_TYPE (exp)))
2408 & ((1 << HASHBITS) - 1)) % MAX_HASH_TABLE;
2410 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
2411 if (TREE_VALUE (link))
2413 = (hi * 603 + const_hash (TREE_VALUE (link))) % MAX_HASH_TABLE;
2420 struct addr_const value;
2422 decode_addr_const (exp, &value);
2423 if (GET_CODE (value.base) == SYMBOL_REF)
2425 /* Don't hash the address of the SYMBOL_REF;
2426 only use the offset and the symbol name. */
2428 p = XSTR (value.base, 0);
2429 for (i = 0; p[i] != 0; i++)
2430 hi = ((hi * 613) + (unsigned) (p[i]));
2432 else if (GET_CODE (value.base) == LABEL_REF)
2433 hi = value.offset + CODE_LABEL_NUMBER (XEXP (value.base, 0)) * 13;
2437 hi &= (1 << HASHBITS) - 1;
2438 hi %= MAX_HASH_TABLE;
2444 return (const_hash (TREE_OPERAND (exp, 0)) * 9
2445 + const_hash (TREE_OPERAND (exp, 1)));
2449 case NON_LVALUE_EXPR:
2450 return const_hash (TREE_OPERAND (exp, 0)) * 7 + 2;
2453 /* A language specific constant. Just hash the code. */
2454 return code % MAX_HASH_TABLE;
2457 /* Compute hashing function */
2459 for (i = 0; i < len; i++)
2460 hi = ((hi * 613) + (unsigned) (p[i]));
2462 hi &= (1 << HASHBITS) - 1;
2463 hi %= MAX_HASH_TABLE;
2467 /* Compare a constant expression EXP with a constant-descriptor DESC.
2468 Return 1 if DESC describes a constant with the same value as EXP. */
2471 compare_constant (exp, desc)
2473 struct constant_descriptor *desc;
2475 return 0 != compare_constant_1 (exp, desc->contents);
2478 /* Compare constant expression EXP with a substring P of a constant descriptor.
2479 If they match, return a pointer to the end of the substring matched.
2480 If they do not match, return 0.
2482 Since descriptors are written in polish prefix notation,
2483 this function can be used recursively to test one operand of EXP
2484 against a subdescriptor, and if it succeeds it returns the
2485 address of the subdescriptor for the next operand. */
2487 static const unsigned char *
2488 compare_constant_1 (exp, p)
2490 const unsigned char *p;
2492 register const unsigned char *strp;
2494 register enum tree_code code = TREE_CODE (exp);
2496 if (code != (enum tree_code) *p++)
2499 /* Either set STRP, P and LEN to pointers and length to compare and exit the
2500 switch, or return the result of the comparison. */
2505 /* Integer constants are the same only if the same width of type. */
2506 if (*p++ != TYPE_PRECISION (TREE_TYPE (exp)))
2509 strp = (unsigned char *) &TREE_INT_CST (exp);
2510 len = sizeof TREE_INT_CST (exp);
2514 /* Real constants are the same only if the same width of type. */
2515 if (*p++ != TYPE_PRECISION (TREE_TYPE (exp)))
2518 strp = (unsigned char *) &TREE_REAL_CST (exp);
2519 len = sizeof TREE_REAL_CST (exp);
2523 if (flag_writable_strings)
2526 if ((enum machine_mode) *p++ != TYPE_MODE (TREE_TYPE (exp)))
2529 strp = (unsigned char *)TREE_STRING_POINTER (exp);
2530 len = TREE_STRING_LENGTH (exp);
2531 if (bcmp ((char *) &TREE_STRING_LENGTH (exp), p,
2532 sizeof TREE_STRING_LENGTH (exp)))
2535 p += sizeof TREE_STRING_LENGTH (exp);
2539 p = compare_constant_1 (TREE_REALPART (exp), p);
2543 return compare_constant_1 (TREE_IMAGPART (exp), p);
2546 if (TREE_CODE (TREE_TYPE (exp)) == SET_TYPE)
2548 int xlen = len = int_size_in_bytes (TREE_TYPE (exp));
2549 unsigned char *tmp = (unsigned char *) alloca (len);
2551 get_set_constructor_bytes (exp, tmp, len);
2552 strp = (unsigned char *) tmp;
2553 if (bcmp ((char *) &xlen, p, sizeof xlen))
2562 int length = list_length (CONSTRUCTOR_ELTS (exp));
2564 enum machine_mode mode = TYPE_MODE (TREE_TYPE (exp));
2565 int have_purpose = 0;
2567 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
2568 if (TREE_PURPOSE (link))
2571 if (bcmp ((char *) &length, p, sizeof length))
2576 /* For record constructors, insist that the types match.
2577 For arrays, just verify both constructors are for arrays.
2578 Then insist that either both or none have any TREE_PURPOSE
2580 if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE)
2581 type = TREE_TYPE (exp);
2585 if (bcmp ((char *) &type, p, sizeof type))
2588 if (TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE)
2590 if (bcmp ((char *) &mode, p, sizeof mode))
2598 if (bcmp ((char *) &have_purpose, p, sizeof have_purpose))
2601 p += sizeof have_purpose;
2603 /* For arrays, insist that the size in bytes match. */
2604 if (TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE)
2606 HOST_WIDE_INT size = int_size_in_bytes (TREE_TYPE (exp));
2608 if (bcmp ((char *) &size, p, sizeof size))
2614 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
2616 if (TREE_VALUE (link))
2618 if ((p = compare_constant_1 (TREE_VALUE (link), p)) == 0)
2625 if (bcmp ((char *) &zero, p, sizeof zero))
2631 if (TREE_PURPOSE (link)
2632 && TREE_CODE (TREE_PURPOSE (link)) == FIELD_DECL)
2634 if (bcmp ((char *) &TREE_PURPOSE (link), p,
2635 sizeof TREE_PURPOSE (link)))
2638 p += sizeof TREE_PURPOSE (link);
2640 else if (TREE_PURPOSE (link))
2642 if ((p = compare_constant_1 (TREE_PURPOSE (link), p)) == 0)
2645 else if (have_purpose)
2649 if (bcmp ((char *) &zero, p, sizeof zero))
2661 struct addr_const value;
2663 decode_addr_const (exp, &value);
2664 strp = (unsigned char *) &value.offset;
2665 len = sizeof value.offset;
2666 /* Compare the offset. */
2668 if (*p++ != *strp++)
2671 /* Compare symbol name. */
2672 strp = (unsigned char *) XSTR (value.base, 0);
2673 len = strlen ((char *) strp) + 1;
2680 p = compare_constant_1 (TREE_OPERAND (exp, 0), p);
2684 return compare_constant_1 (TREE_OPERAND (exp, 1), p);
2688 case NON_LVALUE_EXPR:
2689 return compare_constant_1 (TREE_OPERAND (exp, 0), p);
2692 if (lang_expand_constant)
2694 exp = (*lang_expand_constant) (exp);
2695 return compare_constant_1 (exp, p);
2700 /* Compare constant contents. */
2702 if (*p++ != *strp++)
2708 /* Construct a constant descriptor for the expression EXP.
2709 It is up to the caller to enter the descriptor in the hash table. */
2711 static struct constant_descriptor *
2712 record_constant (exp)
2715 struct constant_descriptor *next = 0;
2719 /* Make a struct constant_descriptor. The first three pointers will
2720 be filled in later. Here we just leave space for them. */
2722 obstack_grow (&permanent_obstack, (char *) &next, sizeof next);
2723 obstack_grow (&permanent_obstack, (char *) &label, sizeof label);
2724 obstack_grow (&permanent_obstack, (char *) &rtl, sizeof rtl);
2725 record_constant_1 (exp);
2726 return (struct constant_descriptor *) obstack_finish (&permanent_obstack);
2729 /* Add a description of constant expression EXP
2730 to the object growing in `permanent_obstack'.
2731 No need to return its address; the caller will get that
2732 from the obstack when the object is complete. */
2735 record_constant_1 (exp)
2738 register unsigned char *strp;
2740 register enum tree_code code = TREE_CODE (exp);
2742 obstack_1grow (&permanent_obstack, (unsigned int) code);
2747 obstack_1grow (&permanent_obstack, TYPE_PRECISION (TREE_TYPE (exp)));
2748 strp = (unsigned char *) &TREE_INT_CST (exp);
2749 len = sizeof TREE_INT_CST (exp);
2753 obstack_1grow (&permanent_obstack, TYPE_PRECISION (TREE_TYPE (exp)));
2754 strp = (unsigned char *) &TREE_REAL_CST (exp);
2755 len = sizeof TREE_REAL_CST (exp);
2759 if (flag_writable_strings)
2762 obstack_1grow (&permanent_obstack, TYPE_MODE (TREE_TYPE (exp)));
2763 strp = (unsigned char *) TREE_STRING_POINTER (exp);
2764 len = TREE_STRING_LENGTH (exp);
2765 obstack_grow (&permanent_obstack, (char *) &TREE_STRING_LENGTH (exp),
2766 sizeof TREE_STRING_LENGTH (exp));
2770 record_constant_1 (TREE_REALPART (exp));
2771 record_constant_1 (TREE_IMAGPART (exp));
2775 if (TREE_CODE (TREE_TYPE (exp)) == SET_TYPE)
2777 int nbytes = int_size_in_bytes (TREE_TYPE (exp));
2778 obstack_grow (&permanent_obstack, &nbytes, sizeof (nbytes));
2779 obstack_blank (&permanent_obstack, nbytes);
2780 get_set_constructor_bytes
2781 (exp, (unsigned char *) permanent_obstack.next_free-nbytes,
2788 int length = list_length (CONSTRUCTOR_ELTS (exp));
2789 enum machine_mode mode = TYPE_MODE (TREE_TYPE (exp));
2791 int have_purpose = 0;
2793 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
2794 if (TREE_PURPOSE (link))
2797 obstack_grow (&permanent_obstack, (char *) &length, sizeof length);
2799 /* For record constructors, insist that the types match.
2800 For arrays, just verify both constructors are for arrays
2801 of the same mode. Then insist that either both or none
2802 have any TREE_PURPOSE values. */
2803 if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE)
2804 type = TREE_TYPE (exp);
2808 obstack_grow (&permanent_obstack, (char *) &type, sizeof type);
2809 if (TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE)
2810 obstack_grow (&permanent_obstack, &mode, sizeof mode);
2812 obstack_grow (&permanent_obstack, (char *) &have_purpose,
2813 sizeof have_purpose);
2815 /* For arrays, insist that the size in bytes match. */
2816 if (TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE)
2818 HOST_WIDE_INT size = int_size_in_bytes (TREE_TYPE (exp));
2819 obstack_grow (&permanent_obstack, (char *) &size, sizeof size);
2822 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
2824 if (TREE_VALUE (link))
2825 record_constant_1 (TREE_VALUE (link));
2830 obstack_grow (&permanent_obstack,
2831 (char *) &zero, sizeof zero);
2834 if (TREE_PURPOSE (link)
2835 && TREE_CODE (TREE_PURPOSE (link)) == FIELD_DECL)
2836 obstack_grow (&permanent_obstack,
2837 (char *) &TREE_PURPOSE (link),
2838 sizeof TREE_PURPOSE (link));
2839 else if (TREE_PURPOSE (link))
2840 record_constant_1 (TREE_PURPOSE (link));
2841 else if (have_purpose)
2845 obstack_grow (&permanent_obstack,
2846 (char *) &zero, sizeof zero);
2854 struct addr_const value;
2856 decode_addr_const (exp, &value);
2857 /* Record the offset. */
2858 obstack_grow (&permanent_obstack,
2859 (char *) &value.offset, sizeof value.offset);
2861 switch (GET_CODE (value.base))
2864 /* Record the symbol name. */
2865 obstack_grow (&permanent_obstack, XSTR (value.base, 0),
2866 strlen (XSTR (value.base, 0)) + 1);
2869 /* Record the address of the CODE_LABEL. It may not have
2870 been emitted yet, so it's UID may be zero. But pointer
2871 identity is good enough. */
2872 obstack_grow (&permanent_obstack, &XEXP (value.base, 0),
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));
2895 if (lang_expand_constant)
2897 exp = (*lang_expand_constant) (exp);
2898 record_constant_1 (exp);
2903 /* Record constant contents. */
2904 obstack_grow (&permanent_obstack, strp, len);
2907 /* Record a list of constant expressions that were passed to
2908 output_constant_def but that could not be output right away. */
2910 struct deferred_constant
2912 struct deferred_constant *next;
2918 static struct deferred_constant *deferred_constants;
2920 /* Another list of constants which should be output after the
2922 static struct deferred_constant *after_function_constants;
2924 /* Nonzero means defer output of addressed subconstants
2925 (i.e., those for which output_constant_def is called.) */
2926 static int defer_addressed_constants_flag;
2928 /* Start deferring output of subconstants. */
2931 defer_addressed_constants ()
2933 defer_addressed_constants_flag++;
2936 /* Stop deferring output of subconstants,
2937 and output now all those that have been deferred. */
2940 output_deferred_addressed_constants ()
2942 struct deferred_constant *p, *next;
2944 defer_addressed_constants_flag--;
2946 if (defer_addressed_constants_flag > 0)
2949 for (p = deferred_constants; p; p = next)
2951 output_constant_def_contents (p->exp, p->reloc, p->labelno);
2956 deferred_constants = 0;
2959 /* Output any constants which should appear after a function. */
2962 output_after_function_constants ()
2964 struct deferred_constant *p, *next;
2966 for (p = after_function_constants; p; p = next)
2968 output_constant_def_contents (p->exp, p->reloc, p->labelno);
2973 after_function_constants = 0;
2976 /* Make a copy of the whole tree structure for a constant.
2977 This handles the same types of nodes that compare_constant
2978 and record_constant handle. */
2984 switch (TREE_CODE (exp))
2987 /* For ADDR_EXPR, we do not want to copy the decl whose address
2988 is requested. We do want to copy constants though. */
2989 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, 0))) == 'c')
2990 return build1 (TREE_CODE (exp), TREE_TYPE (exp),
2991 copy_constant (TREE_OPERAND (exp, 0)));
2993 return copy_node (exp);
2998 return copy_node (exp);
3001 return build_complex (TREE_TYPE (exp),
3002 copy_constant (TREE_REALPART (exp)),
3003 copy_constant (TREE_IMAGPART (exp)));
3007 return build (TREE_CODE (exp), TREE_TYPE (exp),
3008 copy_constant (TREE_OPERAND (exp, 0)),
3009 copy_constant (TREE_OPERAND (exp, 1)));
3013 case NON_LVALUE_EXPR:
3014 return build1 (TREE_CODE (exp), TREE_TYPE (exp),
3015 copy_constant (TREE_OPERAND (exp, 0)));
3019 tree copy = copy_node (exp);
3020 tree list = copy_list (CONSTRUCTOR_ELTS (exp));
3023 CONSTRUCTOR_ELTS (copy) = list;
3024 for (tail = list; tail; tail = TREE_CHAIN (tail))
3025 TREE_VALUE (tail) = copy_constant (TREE_VALUE (tail));
3026 if (TREE_CODE (TREE_TYPE (exp)) == SET_TYPE)
3027 for (tail = list; tail; tail = TREE_CHAIN (tail))
3028 TREE_PURPOSE (tail) = copy_constant (TREE_PURPOSE (tail));
3038 /* Return an rtx representing a reference to constant data in memory
3039 for the constant expression EXP.
3041 If assembler code for such a constant has already been output,
3042 return an rtx to refer to it.
3043 Otherwise, output such a constant in memory (or defer it for later)
3044 and generate an rtx for it.
3046 The TREE_CST_RTL of EXP is set up to point to that rtx.
3047 The const_hash_table records which constants already have label strings. */
3050 output_constant_def (exp)
3054 register struct constant_descriptor *desc;
3059 if (TREE_CST_RTL (exp))
3060 return TREE_CST_RTL (exp);
3062 /* Make sure any other constants whose addresses appear in EXP
3063 are assigned label numbers. */
3065 reloc = output_addressed_constants (exp);
3067 /* Compute hash code of EXP. Search the descriptors for that hash code
3068 to see if any of them describes EXP. If yes, the descriptor records
3069 the label number already assigned. */
3071 hash = const_hash (exp) % MAX_HASH_TABLE;
3073 for (desc = const_hash_table[hash]; desc; desc = desc->next)
3074 if (compare_constant (exp, desc))
3079 /* No constant equal to EXP is known to have been output.
3080 Make a constant descriptor to enter EXP in the hash table.
3081 Assign the label number and record it in the descriptor for
3082 future calls to this function to find. */
3084 /* Create a string containing the label name, in LABEL. */
3085 ASM_GENERATE_INTERNAL_LABEL (label, "LC", const_labelno);
3087 desc = record_constant (exp);
3088 desc->next = const_hash_table[hash];
3089 desc->label = ggc_alloc_string (label, -1);
3090 const_hash_table[hash] = desc;
3092 /* We have a symbol name; construct the SYMBOL_REF and the MEM
3093 in the permanent obstack. We could also construct this in the
3094 obstack of EXP and put it into TREE_CST_RTL, but we have no way
3095 of knowing what obstack it is (e.g., it might be in a function
3096 obstack of a function we are nested inside). */
3098 push_obstacks_nochange ();
3099 end_temporary_allocation ();
3102 = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp)),
3103 gen_rtx_SYMBOL_REF (Pmode, desc->label));
3105 set_mem_attributes (desc->rtl, exp, 1);
3111 TREE_CST_RTL (exp) = desc->rtl;
3113 /* Optionally set flags or add text to the name to record information
3114 such as that it is a function name. If the name is changed, the macro
3115 ASM_OUTPUT_LABELREF will have to know how to strip this information. */
3116 #ifdef ENCODE_SECTION_INFO
3117 ENCODE_SECTION_INFO (exp);
3120 /* If this is the first time we've seen this particular constant,
3121 output it (or defer its output for later). */
3124 int after_function = 0;
3126 #ifdef CONSTANT_AFTER_FUNCTION_P
3127 if (current_function_decl != 0
3128 && CONSTANT_AFTER_FUNCTION_P (exp))
3132 if (defer_addressed_constants_flag || after_function)
3134 struct deferred_constant *p;
3135 p = (struct deferred_constant *) xmalloc (sizeof (struct deferred_constant));
3137 push_obstacks_nochange ();
3138 suspend_momentary ();
3139 p->exp = copy_constant (exp);
3142 p->labelno = const_labelno++;
3145 p->next = after_function_constants;
3146 after_function_constants = p;
3150 p->next = deferred_constants;
3151 deferred_constants = p;
3156 /* Do no output if -fsyntax-only. */
3157 if (! flag_syntax_only)
3158 output_constant_def_contents (exp, reloc, const_labelno);
3163 return TREE_CST_RTL (exp);
3166 /* Now output assembler code to define the label for EXP,
3167 and follow it with the data of EXP. */
3170 output_constant_def_contents (exp, reloc, labelno)
3177 if (IN_NAMED_SECTION (exp))
3178 named_section (exp, NULL, reloc);
3181 /* First switch to text section, except for writable strings. */
3182 #ifdef SELECT_SECTION
3183 SELECT_SECTION (exp, reloc);
3185 if (((TREE_CODE (exp) == STRING_CST) && flag_writable_strings)
3186 || (flag_pic && reloc))
3189 readonly_data_section ();
3193 /* Align the location counter as required by EXP's data type. */
3194 align = TYPE_ALIGN (TREE_TYPE (exp));
3195 #ifdef CONSTANT_ALIGNMENT
3196 align = CONSTANT_ALIGNMENT (exp, align);
3199 if (align > BITS_PER_UNIT)
3200 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
3202 /* Output the label itself. */
3203 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LC", labelno);
3205 /* Output the value of EXP. */
3206 output_constant (exp,
3207 (TREE_CODE (exp) == STRING_CST
3208 ? TREE_STRING_LENGTH (exp)
3209 : int_size_in_bytes (TREE_TYPE (exp))));
3213 /* Structure to represent sufficient information about a constant so that
3214 it can be output when the constant pool is output, so that function
3215 integration can be done, and to simplify handling on machines that reference
3216 constant pool as base+displacement. */
3218 struct pool_constant
3220 struct constant_descriptor *desc;
3221 struct pool_constant *next;
3222 enum machine_mode mode;
3230 /* Structure used to maintain hash table mapping symbols used to their
3231 corresponding constants. */
3236 struct pool_constant *pool;
3237 struct pool_sym *next;
3240 /* Hash code for a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true.
3241 The argument is XSTR (... , 0) */
3243 #define SYMHASH(LABEL) \
3244 ((((unsigned long) (LABEL)) & ((1 << HASHBITS) - 1)) % MAX_RTX_HASH_TABLE)
3246 /* Initialize constant pool hashing for a new function. */
3249 init_varasm_status (f)
3252 struct varasm_status *p;
3253 p = (struct varasm_status *) xmalloc (sizeof (struct varasm_status));
3255 p->x_const_rtx_hash_table
3256 = ((struct constant_descriptor **)
3257 xmalloc (MAX_RTX_HASH_TABLE * sizeof (struct constant_descriptor *)));
3258 p->x_const_rtx_sym_hash_table
3259 = ((struct pool_sym **)
3260 xmalloc (MAX_RTX_HASH_TABLE * sizeof (struct pool_sym *)));
3261 bzero ((char *) p->x_const_rtx_hash_table,
3262 MAX_RTX_HASH_TABLE * sizeof (struct constant_descriptor *));
3263 bzero ((char *) p->x_const_rtx_sym_hash_table,
3264 MAX_RTX_HASH_TABLE * sizeof (struct pool_sym *));
3266 p->x_first_pool = p->x_last_pool = 0;
3267 p->x_pool_offset = 0;
3268 p->x_const_double_chain = 0;
3271 /* Mark PC for GC. */
3274 mark_pool_constant (pc)
3275 struct pool_constant *pc;
3279 ggc_mark_rtx (pc->constant);
3284 /* Mark PPS for GC. */
3287 mark_pool_sym_hash_table (pps)
3288 struct pool_sym **pps;
3290 struct pool_sym *ps;
3293 for (i = 0; i < MAX_RTX_HASH_TABLE; ++i)
3294 for (ps = pps[i]; ps ; ps = ps->next)
3295 ggc_mark_string (ps->label);
3298 /* Mark P for GC. */
3301 mark_varasm_status (p)
3302 struct varasm_status *p;
3307 mark_pool_constant (p->x_first_pool);
3308 mark_pool_sym_hash_table (p->x_const_rtx_sym_hash_table);
3309 ggc_mark_rtx (p->x_const_double_chain);
3312 /* Clear out all parts of the state in F that can safely be discarded
3313 after the function has been compiled, to let garbage collection
3314 reclaim the memory. */
3317 free_varasm_status (f)
3320 struct varasm_status *p;
3323 free (p->x_const_rtx_hash_table);
3324 free (p->x_const_rtx_sym_hash_table);
3329 enum kind { RTX_DOUBLE, RTX_INT };
3333 #ifdef ONLY_INT_FIELDS
3334 unsigned int kind : 16;
3335 unsigned int mode : 16;
3337 enum kind kind : 16;
3338 enum machine_mode mode : 16;
3341 union real_extract du;
3342 struct addr_const addr;
3343 struct {HOST_WIDE_INT high, low;} di;
3347 /* Express an rtx for a constant integer (perhaps symbolic)
3348 as the sum of a symbol or label plus an explicit integer.
3349 They are stored into VALUE. */
3352 decode_rtx_const (mode, x, value)
3353 enum machine_mode mode;
3355 struct rtx_const *value;
3357 /* Clear the whole structure, including any gaps. */
3360 int *p = (int *) value;
3361 int *end = (int *) (value + 1);
3366 value->kind = RTX_INT; /* Most usual kind. */
3369 switch (GET_CODE (x))
3372 value->kind = RTX_DOUBLE;
3373 if (GET_MODE (x) != VOIDmode)
3375 value->mode = GET_MODE (x);
3376 bcopy ((char *) &CONST_DOUBLE_LOW (x),
3377 (char *) &value->un.du, sizeof value->un.du);
3381 value->un.di.low = CONST_DOUBLE_LOW (x);
3382 value->un.di.high = CONST_DOUBLE_HIGH (x);
3387 value->un.addr.offset = INTVAL (x);
3393 value->un.addr.base = x;
3398 if (GET_CODE (x) == PLUS)
3400 value->un.addr.base = XEXP (x, 0);
3401 if (GET_CODE (XEXP (x, 1)) != CONST_INT)
3403 value->un.addr.offset = INTVAL (XEXP (x, 1));
3405 else if (GET_CODE (x) == MINUS)
3407 value->un.addr.base = XEXP (x, 0);
3408 if (GET_CODE (XEXP (x, 1)) != CONST_INT)
3410 value->un.addr.offset = - INTVAL (XEXP (x, 1));
3420 if (value->kind == RTX_INT && value->un.addr.base != 0)
3421 switch (GET_CODE (value->un.addr.base))
3424 /* Use the string's address, not the SYMBOL_REF's address,
3425 for the sake of addresses of library routines. */
3426 value->un.addr.base = (rtx) XSTR (value->un.addr.base, 0);
3430 /* For a LABEL_REF, compare labels. */
3431 value->un.addr.base = XEXP (value->un.addr.base, 0);
3438 /* Given a MINUS expression, simplify it if both sides
3439 include the same symbol. */
3442 simplify_subtraction (x)
3445 struct rtx_const val0, val1;
3447 decode_rtx_const (GET_MODE (x), XEXP (x, 0), &val0);
3448 decode_rtx_const (GET_MODE (x), XEXP (x, 1), &val1);
3450 if (val0.un.addr.base == val1.un.addr.base)
3451 return GEN_INT (val0.un.addr.offset - val1.un.addr.offset);
3455 /* Compute a hash code for a constant RTL expression. */
3458 const_hash_rtx (mode, x)
3459 enum machine_mode mode;
3465 struct rtx_const value;
3466 decode_rtx_const (mode, x, &value);
3468 /* Compute hashing function */
3470 for (i = 0; i < sizeof value / sizeof (int); i++)
3471 hi += ((int *) &value)[i];
3473 hi &= (1 << HASHBITS) - 1;
3474 hi %= MAX_RTX_HASH_TABLE;
3478 /* Compare a constant rtl object X with a constant-descriptor DESC.
3479 Return 1 if DESC describes a constant with the same value as X. */
3482 compare_constant_rtx (mode, x, desc)
3483 enum machine_mode mode;
3485 struct constant_descriptor *desc;
3487 register int *p = (int *) desc->contents;
3490 struct rtx_const value;
3492 decode_rtx_const (mode, x, &value);
3493 strp = (int *) &value;
3494 len = sizeof value / sizeof (int);
3496 /* Compare constant contents. */
3498 if (*p++ != *strp++)
3504 /* Construct a constant descriptor for the rtl-expression X.
3505 It is up to the caller to enter the descriptor in the hash table. */
3507 static struct constant_descriptor *
3508 record_constant_rtx (mode, x)
3509 enum machine_mode mode;
3512 struct constant_descriptor *ptr;
3515 struct rtx_const value;
3517 decode_rtx_const (mode, x, &value);
3519 /* Put these things in the saveable obstack so we can ensure it won't
3520 be freed if we are called from combine or some other phase that discards
3521 memory allocated from function_obstack (current_obstack). */
3522 obstack_grow (saveable_obstack, &ptr, sizeof ptr);
3523 obstack_grow (saveable_obstack, &label, sizeof label);
3524 obstack_grow (saveable_obstack, &rtl, sizeof rtl);
3526 /* Record constant contents. */
3527 obstack_grow (saveable_obstack, &value, sizeof value);
3529 return (struct constant_descriptor *) obstack_finish (saveable_obstack);
3532 /* Given a constant rtx X, make (or find) a memory constant for its value
3533 and return a MEM rtx to refer to it in memory. */
3536 force_const_mem (mode, x)
3537 enum machine_mode mode;
3541 register struct constant_descriptor *desc;
3546 /* If we want this CONST_DOUBLE in the same mode as it is in memory
3547 (this will always be true for floating CONST_DOUBLEs that have been
3548 placed in memory, but not for VOIDmode (integer) CONST_DOUBLEs),
3549 use the previous copy. Otherwise, make a new one. Note that in
3550 the unlikely event that this same CONST_DOUBLE is used in two different
3551 modes in an alternating fashion, we will allocate a lot of different
3552 memory locations, but this should be extremely rare. */
3554 if (GET_CODE (x) == CONST_DOUBLE
3555 && GET_CODE (CONST_DOUBLE_MEM (x)) == MEM
3556 && GET_MODE (CONST_DOUBLE_MEM (x)) == mode)
3557 return CONST_DOUBLE_MEM (x);
3559 /* Compute hash code of X. Search the descriptors for that hash code
3560 to see if any of them describes X. If yes, the descriptor records
3561 the label number already assigned. */
3563 hash = const_hash_rtx (mode, x);
3565 for (desc = const_rtx_hash_table[hash]; desc; desc = desc->next)
3566 if (compare_constant_rtx (mode, x, desc))
3568 found = desc->label;
3574 register struct pool_constant *pool;
3575 register struct pool_sym *sym;
3578 /* No constant equal to X is known to have been output.
3579 Make a constant descriptor to enter X in the hash table.
3580 Assign the label number and record it in the descriptor for
3581 future calls to this function to find. */
3583 desc = record_constant_rtx (mode, x);
3584 desc->next = const_rtx_hash_table[hash];
3585 const_rtx_hash_table[hash] = desc;
3587 /* Align the location counter as required by EXP's data type. */
3588 align = (mode == VOIDmode) ? UNITS_PER_WORD : GET_MODE_SIZE (mode);
3589 if (align > BIGGEST_ALIGNMENT / BITS_PER_UNIT)
3590 align = BIGGEST_ALIGNMENT / BITS_PER_UNIT;
3591 #ifdef CONSTANT_ALIGNMENT
3592 align = CONSTANT_ALIGNMENT (make_tree (type_for_mode (mode, 0), x),
3593 align * BITS_PER_UNIT) / BITS_PER_UNIT;
3596 pool_offset += align - 1;
3597 pool_offset &= ~ (align - 1);
3599 /* If RTL is not being placed into the saveable obstack, make a
3600 copy of X that is in the saveable obstack in case we are
3601 being called from combine or some other phase that discards
3602 memory it allocates. We used to only do this if it is a
3603 CONST; however, reload can allocate a CONST_INT when
3604 eliminating registers. */
3605 if (rtl_obstack != saveable_obstack
3606 && (GET_CODE (x) == CONST || GET_CODE (x) == CONST_INT))
3608 push_obstacks_nochange ();
3609 rtl_in_saveable_obstack ();
3611 if (GET_CODE (x) == CONST)
3612 x = gen_rtx_CONST (GET_MODE (x),
3613 gen_rtx_PLUS (GET_MODE (x),
3614 XEXP (XEXP (x, 0), 0),
3615 XEXP (XEXP (x, 0), 1)));
3617 x = GEN_INT (INTVAL (x));
3622 /* Allocate a pool constant descriptor, fill it in, and chain it in. */
3624 pool = (struct pool_constant *) savealloc (sizeof (struct pool_constant));
3628 pool->labelno = const_labelno;
3629 pool->align = align;
3630 pool->offset = pool_offset;
3637 last_pool->next = pool;
3640 pool_offset += GET_MODE_SIZE (mode);
3642 /* Create a string containing the label name, in LABEL. */
3643 ASM_GENERATE_INTERNAL_LABEL (label, "LC", const_labelno);
3647 desc->label = found = ggc_alloc_string (label, -1);
3649 /* Add label to symbol hash table. */
3650 hash = SYMHASH (found);
3651 sym = (struct pool_sym *) savealloc (sizeof (struct pool_sym));
3654 sym->next = const_rtx_sym_hash_table[hash];
3655 const_rtx_sym_hash_table[hash] = sym;
3658 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
3660 def = gen_rtx_MEM (mode, gen_rtx_SYMBOL_REF (Pmode, found));
3661 set_mem_attributes (def, type_for_mode (mode, 0), 1);
3662 RTX_UNCHANGING_P (def) = 1;
3664 /* Mark the symbol_ref as belonging to this constants pool. */
3665 CONSTANT_POOL_ADDRESS_P (XEXP (def, 0)) = 1;
3666 current_function_uses_const_pool = 1;
3668 if (GET_CODE (x) == CONST_DOUBLE)
3670 if (CONST_DOUBLE_MEM (x) == cc0_rtx)
3672 CONST_DOUBLE_CHAIN (x) = const_double_chain;
3673 const_double_chain = x;
3675 CONST_DOUBLE_MEM (x) = def;
3681 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
3682 the corresponding pool_constant structure. */
3684 static struct pool_constant *
3685 find_pool_constant (f, addr)
3689 struct pool_sym *sym;
3690 const char *label = XSTR (addr, 0);
3692 for (sym = f->varasm->x_const_rtx_sym_hash_table[SYMHASH (label)]; sym;
3694 if (sym->label == label)
3700 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
3703 get_pool_constant (addr)
3706 return (find_pool_constant (cfun, addr))->constant;
3709 /* Likewise, but for the constant pool of a specific function. */
3712 get_pool_constant_for_function (f, addr)
3716 return (find_pool_constant (f, addr))->constant;
3719 /* Similar, return the mode. */
3722 get_pool_mode (addr)
3725 return (find_pool_constant (cfun, addr))->mode;
3729 get_pool_mode_for_function (f, addr)
3733 return (find_pool_constant (f, addr))->mode;
3736 /* Similar, return the offset in the constant pool. */
3739 get_pool_offset (addr)
3742 return (find_pool_constant (cfun, addr))->offset;
3745 /* Return the size of the constant pool. */
3753 /* Write all the constants in the constant pool. */
3756 output_constant_pool (fnname, fndecl)
3757 const char *fnname ATTRIBUTE_UNUSED;
3758 tree fndecl ATTRIBUTE_UNUSED;
3760 struct pool_constant *pool;
3762 union real_extract u;
3764 /* It is possible for gcc to call force_const_mem and then to later
3765 discard the instructions which refer to the constant. In such a
3766 case we do not need to output the constant. */
3767 mark_constant_pool ();
3769 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3770 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file, fnname, fndecl, pool_offset);
3773 for (pool = first_pool; pool; pool = pool->next)
3782 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3783 whose CODE_LABEL has been deleted. This can occur if a jump table
3784 is eliminated by optimization. If so, write a constant of zero
3785 instead. Note that this can also happen by turning the
3786 CODE_LABEL into a NOTE. */
3787 /* ??? This seems completely and utterly wrong. Certainly it's
3788 not true for NOTE_INSN_DELETED_LABEL, but I disbelieve proper
3789 functioning even with INSN_DELETED_P and friends. */
3792 switch (GET_CODE (x))
3795 if (GET_CODE (XEXP (x, 0)) != PLUS
3796 || GET_CODE (XEXP (XEXP (x, 0), 0)) != LABEL_REF)
3798 tmp = XEXP (XEXP (x, 0), 0);
3803 if (INSN_DELETED_P (tmp)
3804 || (GET_CODE (tmp) == NOTE
3805 && NOTE_LINE_NUMBER (tmp) == NOTE_INSN_DELETED))
3816 /* First switch to correct section. */
3817 #ifdef SELECT_RTX_SECTION
3818 SELECT_RTX_SECTION (pool->mode, x);
3820 readonly_data_section ();
3823 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3824 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file, x, pool->mode,
3825 pool->align, pool->labelno, done);
3828 if (pool->align > 1)
3829 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (pool->align));
3831 /* Output the label. */
3832 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LC", pool->labelno);
3834 /* Output the value of the constant itself. */
3835 switch (GET_MODE_CLASS (pool->mode))
3838 if (GET_CODE (x) != CONST_DOUBLE)
3841 bcopy ((char *) &CONST_DOUBLE_LOW (x), (char *) &u, sizeof u);
3842 assemble_real (u.d, pool->mode);
3846 case MODE_PARTIAL_INT:
3847 assemble_integer (x, GET_MODE_SIZE (pool->mode), 1);
3854 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3860 #ifdef ASM_OUTPUT_POOL_EPILOGUE
3861 ASM_OUTPUT_POOL_EPILOGUE (asm_out_file, fnname, fndecl, pool_offset);
3864 /* Done with this pool. */
3865 first_pool = last_pool = 0;
3868 /* Look through the instructions for this function, and mark all the
3869 entries in the constant pool which are actually being used. */
3872 mark_constant_pool ()
3875 struct pool_constant *pool;
3877 if (first_pool == 0)
3880 for (pool = first_pool; pool; pool = pool->next)
3883 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
3885 mark_constants (PATTERN (insn));
3887 for (insn = current_function_epilogue_delay_list;
3889 insn = XEXP (insn, 1))
3891 mark_constants (PATTERN (insn));
3893 /* It's possible that the only reference to a symbol is in a symbol
3894 that's in the constant pool. This happens in Fortran under some
3895 situations. (When the constant contains the address of another
3896 constant, and only the first is used directly in an insn.)
3897 This is potentially suboptimal if there's ever a possibility of
3898 backwards (in pool order) 2'd level references. However, it's
3899 not clear that 2'd level references can happen. */
3900 for (pool = first_pool; pool; pool = pool->next)
3902 struct pool_sym *sym;
3905 /* skip unmarked entries; no insn refers to them. */
3909 /* Skip everything except SYMBOL_REFs. */
3910 if (GET_CODE (pool->constant) != SYMBOL_REF)
3912 label = XSTR (pool->constant, 0);
3914 /* Be sure the symbol's value is marked. */
3915 for (sym = const_rtx_sym_hash_table[SYMHASH (label)]; sym;
3917 if (sym->label == label)
3918 sym->pool->mark = 1;
3919 /* If we didn't find it, there's something truly wrong here, but it
3920 will be announced by the assembler. */
3929 register const char *format_ptr;
3934 if (GET_CODE (x) == SYMBOL_REF)
3936 if (CONSTANT_POOL_ADDRESS_P (x))
3937 find_pool_constant (cfun, x)->mark = 1;
3940 /* Never search inside a CONST_DOUBLE, because CONST_DOUBLE_MEM may be
3941 a MEM, but does not constitute a use of that MEM. */
3942 else if (GET_CODE (x) == CONST_DOUBLE)
3945 /* Insns may appear inside a SEQUENCE. Only check the patterns of
3946 insns, not any notes that may be attached. We don't want to mark
3947 a constant just because it happens to appear in a REG_EQUIV note. */
3950 mark_constants (PATTERN (x));
3954 format_ptr = GET_RTX_FORMAT (GET_CODE (x));
3956 for (i = 0; i < GET_RTX_LENGTH (GET_CODE (x)); i++)
3958 switch (*format_ptr++)
3961 mark_constants (XEXP (x, i));
3965 if (XVEC (x, i) != 0)
3969 for (j = 0; j < XVECLEN (x, i); j++)
3970 mark_constants (XVECEXP (x, i, j));
3989 /* Find all the constants whose addresses are referenced inside of EXP,
3990 and make sure assembler code with a label has been output for each one.
3991 Indicate whether an ADDR_EXPR has been encountered. */
3994 output_addressed_constants (exp)
3999 switch (TREE_CODE (exp))
4003 register tree constant = TREE_OPERAND (exp, 0);
4005 while (TREE_CODE (constant) == COMPONENT_REF)
4007 constant = TREE_OPERAND (constant, 0);
4010 if (TREE_CODE_CLASS (TREE_CODE (constant)) == 'c'
4011 || TREE_CODE (constant) == CONSTRUCTOR)
4012 /* No need to do anything here
4013 for addresses of variables or functions. */
4014 output_constant_def (constant);
4021 reloc = output_addressed_constants (TREE_OPERAND (exp, 0));
4022 reloc |= output_addressed_constants (TREE_OPERAND (exp, 1));
4027 case NON_LVALUE_EXPR:
4028 reloc = output_addressed_constants (TREE_OPERAND (exp, 0));
4034 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
4035 if (TREE_VALUE (link) != 0)
4036 reloc |= output_addressed_constants (TREE_VALUE (link));
4046 /* Return nonzero if VALUE is a valid constant-valued expression
4047 for use in initializing a static variable; one that can be an
4048 element of a "constant" initializer.
4050 Return null_pointer_node if the value is absolute;
4051 if it is relocatable, return the variable that determines the relocation.
4052 We assume that VALUE has been folded as much as possible;
4053 therefore, we do not need to check for such things as
4054 arithmetic-combinations of integers. */
4057 initializer_constant_valid_p (value, endtype)
4061 /* Give the front-end a chance to convert VALUE to something that
4062 looks more like a constant to the back-end. */
4063 if (lang_expand_constant)
4064 value = (*lang_expand_constant) (value);
4066 switch (TREE_CODE (value))
4069 if ((TREE_CODE (TREE_TYPE (value)) == UNION_TYPE
4070 || TREE_CODE (TREE_TYPE (value)) == RECORD_TYPE)
4071 && TREE_CONSTANT (value)
4072 && CONSTRUCTOR_ELTS (value))
4074 initializer_constant_valid_p (TREE_VALUE (CONSTRUCTOR_ELTS (value)),
4077 return TREE_STATIC (value) ? null_pointer_node : 0;
4083 return null_pointer_node;
4086 return staticp (TREE_OPERAND (value, 0)) ? TREE_OPERAND (value, 0) : 0;
4088 case NON_LVALUE_EXPR:
4089 return initializer_constant_valid_p (TREE_OPERAND (value, 0), endtype);
4093 /* Allow conversions between pointer types. */
4094 if (POINTER_TYPE_P (TREE_TYPE (value))
4095 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0))))
4096 return initializer_constant_valid_p (TREE_OPERAND (value, 0), endtype);
4098 /* Allow conversions between real types. */
4099 if (FLOAT_TYPE_P (TREE_TYPE (value))
4100 && FLOAT_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0))))
4101 return initializer_constant_valid_p (TREE_OPERAND (value, 0), endtype);
4103 /* Allow length-preserving conversions between integer types. */
4104 if (INTEGRAL_TYPE_P (TREE_TYPE (value))
4105 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0)))
4106 && (TYPE_PRECISION (TREE_TYPE (value))
4107 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value, 0)))))
4108 return initializer_constant_valid_p (TREE_OPERAND (value, 0), endtype);
4110 /* Allow conversions between other integer types only if
4112 if (INTEGRAL_TYPE_P (TREE_TYPE (value))
4113 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0))))
4115 tree inner = initializer_constant_valid_p (TREE_OPERAND (value, 0),
4117 if (inner == null_pointer_node)
4118 return null_pointer_node;
4122 /* Allow (int) &foo provided int is as wide as a pointer. */
4123 if (INTEGRAL_TYPE_P (TREE_TYPE (value))
4124 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0)))
4125 && (TYPE_PRECISION (TREE_TYPE (value))
4126 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value, 0)))))
4127 return initializer_constant_valid_p (TREE_OPERAND (value, 0),
4130 /* Likewise conversions from int to pointers, but also allow
4131 conversions from 0. */
4132 if (POINTER_TYPE_P (TREE_TYPE (value))
4133 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0))))
4135 if (integer_zerop (TREE_OPERAND (value, 0)))
4136 return null_pointer_node;
4137 else if (TYPE_PRECISION (TREE_TYPE (value))
4138 <= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value, 0))))
4139 return initializer_constant_valid_p (TREE_OPERAND (value, 0),
4143 /* Allow conversions to union types if the value inside is okay. */
4144 if (TREE_CODE (TREE_TYPE (value)) == UNION_TYPE)
4145 return initializer_constant_valid_p (TREE_OPERAND (value, 0),
4150 if (! INTEGRAL_TYPE_P (endtype)
4151 || TYPE_PRECISION (endtype) >= POINTER_SIZE)
4153 tree valid0 = initializer_constant_valid_p (TREE_OPERAND (value, 0),
4155 tree valid1 = initializer_constant_valid_p (TREE_OPERAND (value, 1),
4157 /* If either term is absolute, use the other terms relocation. */
4158 if (valid0 == null_pointer_node)
4160 if (valid1 == null_pointer_node)
4166 if (! INTEGRAL_TYPE_P (endtype)
4167 || TYPE_PRECISION (endtype) >= POINTER_SIZE)
4169 tree valid0 = initializer_constant_valid_p (TREE_OPERAND (value, 0),
4171 tree valid1 = initializer_constant_valid_p (TREE_OPERAND (value, 1),
4173 /* Win if second argument is absolute. */
4174 if (valid1 == null_pointer_node)
4176 /* Win if both arguments have the same relocation.
4177 Then the value is absolute. */
4178 if (valid0 == valid1 && valid0 != 0)
4179 return null_pointer_node;
4182 /* Support differences between labels. */
4183 if (INTEGRAL_TYPE_P (endtype))
4186 op0 = TREE_OPERAND (value, 0);
4187 op1 = TREE_OPERAND (value, 1);
4191 if (TREE_CODE (op0) == ADDR_EXPR
4192 && TREE_CODE (TREE_OPERAND (op0, 0)) == LABEL_DECL
4193 && TREE_CODE (op1) == ADDR_EXPR
4194 && TREE_CODE (TREE_OPERAND (op1, 0)) == LABEL_DECL)
4195 return null_pointer_node;
4206 /* Output assembler code for constant EXP to FILE, with no label.
4207 This includes the pseudo-op such as ".int" or ".byte", and a newline.
4208 Assumes output_addressed_constants has been done on EXP already.
4210 Generate exactly SIZE bytes of assembler data, padding at the end
4211 with zeros if necessary. SIZE must always be specified.
4213 SIZE is important for structure constructors,
4214 since trailing members may have been omitted from the constructor.
4215 It is also important for initialization of arrays from string constants
4216 since the full length of the string constant might not be wanted.
4217 It is also needed for initialization of unions, where the initializer's
4218 type is just one member, and that may not be as long as the union.
4220 There a case in which we would fail to output exactly SIZE bytes:
4221 for a structure constructor that wants to produce more than SIZE bytes.
4222 But such constructors will never be generated for any possible input. */
4225 output_constant (exp, size)
4229 register enum tree_code code = TREE_CODE (TREE_TYPE (exp));
4231 /* Some front-ends use constants other than the standard
4232 language-indepdent varieties, but which may still be output
4233 directly. Give the front-end a chance to convert EXP to a
4234 language-independent representation. */
4235 if (lang_expand_constant)
4236 exp = (*lang_expand_constant) (exp);
4238 if (size == 0 || flag_syntax_only)
4241 /* Eliminate the NON_LVALUE_EXPR_EXPR that makes a cast not be an lvalue.
4242 That way we get the constant (we hope) inside it. Also, strip off any
4243 NOP_EXPR that converts between two record, union, array, or set types
4244 or a CONVERT_EXPR that converts to a union TYPE. */
4245 while ((TREE_CODE (exp) == NOP_EXPR
4246 && (TREE_TYPE (exp) == TREE_TYPE (TREE_OPERAND (exp, 0))
4247 || AGGREGATE_TYPE_P (TREE_TYPE (exp))))
4248 || (TREE_CODE (exp) == CONVERT_EXPR
4249 && code == UNION_TYPE)
4250 || TREE_CODE (exp) == NON_LVALUE_EXPR)
4252 exp = TREE_OPERAND (exp, 0);
4253 code = TREE_CODE (TREE_TYPE (exp));
4256 /* Allow a constructor with no elements for any data type.
4257 This means to fill the space with zeros. */
4258 if (TREE_CODE (exp) == CONSTRUCTOR && CONSTRUCTOR_ELTS (exp) == 0)
4260 assemble_zeros (size);
4271 case REFERENCE_TYPE:
4272 /* ??? What about (int)((float)(int)&foo + 4) */
4273 while (TREE_CODE (exp) == NOP_EXPR || TREE_CODE (exp) == CONVERT_EXPR
4274 || TREE_CODE (exp) == NON_LVALUE_EXPR)
4275 exp = TREE_OPERAND (exp, 0);
4277 if (! assemble_integer (expand_expr (exp, NULL_RTX, VOIDmode,
4278 EXPAND_INITIALIZER),
4280 error ("initializer for integer value is too complicated");
4285 if (TREE_CODE (exp) != REAL_CST)
4286 error ("initializer for floating value is not a floating constant");
4288 assemble_real (TREE_REAL_CST (exp),
4289 mode_for_size (size * BITS_PER_UNIT, MODE_FLOAT, 0));
4294 output_constant (TREE_REALPART (exp), size / 2);
4295 output_constant (TREE_IMAGPART (exp), size / 2);
4296 size -= (size / 2) * 2;
4300 if (TREE_CODE (exp) == CONSTRUCTOR)
4302 output_constructor (exp, size);
4305 else if (TREE_CODE (exp) == STRING_CST)
4309 if (size > TREE_STRING_LENGTH (exp))
4311 excess = size - TREE_STRING_LENGTH (exp);
4312 size = TREE_STRING_LENGTH (exp);
4315 assemble_string (TREE_STRING_POINTER (exp), size);
4324 if (TREE_CODE (exp) == CONSTRUCTOR)
4325 output_constructor (exp, size);
4331 if (TREE_CODE (exp) == INTEGER_CST)
4332 assemble_integer (expand_expr (exp, NULL_RTX,
4333 VOIDmode, EXPAND_INITIALIZER),
4335 else if (TREE_CODE (exp) == CONSTRUCTOR)
4337 unsigned char *buffer = (unsigned char *) alloca (size);
4338 if (get_set_constructor_bytes (exp, buffer, size))
4340 assemble_string ((char *) buffer, size);
4343 error ("unknown set constructor type");
4351 assemble_zeros (size);
4355 /* Subroutine of output_constant, used for CONSTRUCTORs
4356 (aggregate constants).
4357 Generate at least SIZE bytes, padding if necessary. */
4360 output_constructor (exp, size)
4364 tree type = TREE_TYPE (exp);
4365 register tree link, field = 0;
4367 /* Number of bytes output or skipped so far.
4368 In other words, current position within the constructor. */
4369 HOST_WIDE_INT total_bytes = 0;
4370 /* Non-zero means BYTE contains part of a byte, to be output. */
4371 int byte_buffer_in_use = 0;
4372 register int byte = 0;
4374 if (HOST_BITS_PER_WIDE_INT < BITS_PER_UNIT)
4377 if (TREE_CODE (type) == RECORD_TYPE)
4378 field = TYPE_FIELDS (type);
4380 if (TREE_CODE (type) == ARRAY_TYPE
4381 && TYPE_DOMAIN (type) != 0)
4382 min_index = TYPE_MIN_VALUE (TYPE_DOMAIN (type));
4384 /* As LINK goes through the elements of the constant,
4385 FIELD goes through the structure fields, if the constant is a structure.
4386 if the constant is a union, then we override this,
4387 by getting the field from the TREE_LIST element.
4388 But the constant could also be an array. Then FIELD is zero.
4390 There is always a maximum of one element in the chain LINK for unions
4391 (even if the initializer in a source program incorrectly contains
4393 for (link = CONSTRUCTOR_ELTS (exp);
4395 link = TREE_CHAIN (link),
4396 field = field ? TREE_CHAIN (field) : 0)
4398 tree val = TREE_VALUE (link);
4401 /* The element in a union constructor specifies the proper field
4403 if ((TREE_CODE (type) == RECORD_TYPE || TREE_CODE (type) == UNION_TYPE
4404 || TREE_CODE (type) == QUAL_UNION_TYPE)
4405 && TREE_PURPOSE (link) != 0)
4406 field = TREE_PURPOSE (link);
4408 else if (TREE_CODE (type) == ARRAY_TYPE)
4409 index = TREE_PURPOSE (link);
4411 /* Eliminate the marker that makes a cast not be an lvalue. */
4415 if (index && TREE_CODE (index) == RANGE_EXPR)
4417 register int fieldsize
4418 = int_size_in_bytes (TREE_TYPE (type));
4419 HOST_WIDE_INT lo_index = tree_low_cst (TREE_OPERAND (index, 0), 0);
4420 HOST_WIDE_INT hi_index = tree_low_cst (TREE_OPERAND (index, 1), 0);
4421 HOST_WIDE_INT index;
4423 for (index = lo_index; index <= hi_index; index++)
4425 /* Output the element's initial value. */
4427 assemble_zeros (fieldsize);
4429 output_constant (val, fieldsize);
4431 /* Count its size. */
4432 total_bytes += fieldsize;
4435 else if (field == 0 || !DECL_BIT_FIELD (field))
4437 /* An element that is not a bit-field. */
4439 register int fieldsize;
4440 /* Since this structure is static,
4441 we know the positions are constant. */
4442 HOST_WIDE_INT pos = field ? int_byte_position (field) : 0;
4445 pos = (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (val)), 1)
4446 * (tree_low_cst (index, 0) - tree_low_cst (min_index, 0)));
4448 /* Output any buffered-up bit-fields preceding this element. */
4449 if (byte_buffer_in_use)
4451 ASM_OUTPUT_BYTE (asm_out_file, byte);
4453 byte_buffer_in_use = 0;
4456 /* Advance to offset of this element.
4457 Note no alignment needed in an array, since that is guaranteed
4458 if each element has the proper size. */
4459 if ((field != 0 || index != 0) && pos != total_bytes)
4461 assemble_zeros (pos - total_bytes);
4465 else if (field != 0 && DECL_PACKED (field))
4466 /* Some assemblers automaticallly align a datum according to its
4467 size if no align directive is specified. The datum, however,
4468 may be declared with 'packed' attribute, so we have to disable
4470 ASM_OUTPUT_ALIGN (asm_out_file, 0);
4472 /* Determine size this element should occupy. */
4474 fieldsize = tree_low_cst (DECL_SIZE_UNIT (field), 1);
4476 fieldsize = int_size_in_bytes (TREE_TYPE (type));
4478 /* Output the element's initial value. */
4480 assemble_zeros (fieldsize);
4482 output_constant (val, fieldsize);
4484 /* Count its size. */
4485 total_bytes += fieldsize;
4487 else if (val != 0 && TREE_CODE (val) != INTEGER_CST)
4488 error ("invalid initial value for member `%s'",
4489 IDENTIFIER_POINTER (DECL_NAME (field)));
4492 /* Element that is a bit-field. */
4494 HOST_WIDE_INT next_offset = int_bit_position (field);
4495 HOST_WIDE_INT end_offset
4496 = (next_offset + tree_low_cst (DECL_SIZE (field), 1));
4499 val = integer_zero_node;
4501 /* If this field does not start in this (or, next) byte,
4503 if (next_offset / BITS_PER_UNIT != total_bytes)
4505 /* Output remnant of any bit field in previous bytes. */
4506 if (byte_buffer_in_use)
4508 ASM_OUTPUT_BYTE (asm_out_file, byte);
4510 byte_buffer_in_use = 0;
4513 /* If still not at proper byte, advance to there. */
4514 if (next_offset / BITS_PER_UNIT != total_bytes)
4516 assemble_zeros (next_offset / BITS_PER_UNIT - total_bytes);
4517 total_bytes = next_offset / BITS_PER_UNIT;
4521 if (! byte_buffer_in_use)
4524 /* We must split the element into pieces that fall within
4525 separate bytes, and combine each byte with previous or
4526 following bit-fields. */
4528 /* next_offset is the offset n fbits from the beginning of
4529 the structure to the next bit of this element to be processed.
4530 end_offset is the offset of the first bit past the end of
4532 while (next_offset < end_offset)
4536 HOST_WIDE_INT value;
4537 HOST_WIDE_INT next_byte = next_offset / BITS_PER_UNIT;
4538 HOST_WIDE_INT next_bit = next_offset % BITS_PER_UNIT;
4540 /* Advance from byte to byte
4541 within this element when necessary. */
4542 while (next_byte != total_bytes)
4544 ASM_OUTPUT_BYTE (asm_out_file, byte);
4549 /* Number of bits we can process at once
4550 (all part of the same byte). */
4551 this_time = MIN (end_offset - next_offset,
4552 BITS_PER_UNIT - next_bit);
4553 if (BYTES_BIG_ENDIAN)
4555 /* On big-endian machine, take the most significant bits
4556 first (of the bits that are significant)
4557 and put them into bytes from the most significant end. */
4558 shift = end_offset - next_offset - this_time;
4560 /* Don't try to take a bunch of bits that cross
4561 the word boundary in the INTEGER_CST. We can
4562 only select bits from the LOW or HIGH part
4564 if (shift < HOST_BITS_PER_WIDE_INT
4565 && shift + this_time > HOST_BITS_PER_WIDE_INT)
4567 this_time = shift + this_time - HOST_BITS_PER_WIDE_INT;
4568 shift = HOST_BITS_PER_WIDE_INT;
4571 /* Now get the bits from the appropriate constant word. */
4572 if (shift < HOST_BITS_PER_WIDE_INT)
4573 value = TREE_INT_CST_LOW (val);
4574 else if (shift < 2 * HOST_BITS_PER_WIDE_INT)
4576 value = TREE_INT_CST_HIGH (val);
4577 shift -= HOST_BITS_PER_WIDE_INT;
4582 /* Get the result. This works only when:
4583 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4584 byte |= (((value >> shift)
4585 & (((HOST_WIDE_INT) 2 << (this_time - 1)) - 1))
4586 << (BITS_PER_UNIT - this_time - next_bit));
4590 /* On little-endian machines,
4591 take first the least significant bits of the value
4592 and pack them starting at the least significant
4593 bits of the bytes. */
4594 shift = next_offset - int_bit_position (field);
4596 /* Don't try to take a bunch of bits that cross
4597 the word boundary in the INTEGER_CST. We can
4598 only select bits from the LOW or HIGH part
4600 if (shift < HOST_BITS_PER_WIDE_INT
4601 && shift + this_time > HOST_BITS_PER_WIDE_INT)
4602 this_time = (HOST_BITS_PER_WIDE_INT - shift);
4604 /* Now get the bits from the appropriate constant word. */
4605 if (shift < HOST_BITS_PER_WIDE_INT)
4606 value = TREE_INT_CST_LOW (val);
4607 else if (shift < 2 * HOST_BITS_PER_WIDE_INT)
4609 value = TREE_INT_CST_HIGH (val);
4610 shift -= HOST_BITS_PER_WIDE_INT;
4615 /* Get the result. This works only when:
4616 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4617 byte |= (((value >> shift)
4618 & (((HOST_WIDE_INT) 2 << (this_time - 1)) - 1))
4622 next_offset += this_time;
4623 byte_buffer_in_use = 1;
4628 if (byte_buffer_in_use)
4630 ASM_OUTPUT_BYTE (asm_out_file, byte);
4634 if (total_bytes < size)
4635 assemble_zeros (size - total_bytes);
4638 #ifdef HANDLE_PRAGMA_WEAK
4639 /* Add function NAME to the weak symbols list. VALUE is a weak alias
4640 associatd with NAME. */
4643 add_weak (name, value)
4647 struct weak_syms *weak;
4649 weak = (struct weak_syms *) permalloc (sizeof (struct weak_syms));
4654 weak->next = weak_decls;
4656 weak->value = value;
4661 #endif /* HANDLE_PRAGMA_WEAK */
4663 /* Declare DECL to be a weak symbol. */
4669 if (! TREE_PUBLIC (decl))
4670 error_with_decl (decl, "weak declaration of `%s' must be public");
4671 else if (TREE_ASM_WRITTEN (decl))
4672 error_with_decl (decl, "weak declaration of `%s' must precede definition");
4673 else if (SUPPORTS_WEAK)
4674 DECL_WEAK (decl) = 1;
4675 #ifdef HANDLE_PRAGMA_WEAK
4676 add_weak (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl)), NULL);
4680 /* Emit any pending weak declarations. */
4682 #ifdef HANDLE_PRAGMA_WEAK
4683 struct weak_syms * weak_decls;
4689 #ifdef HANDLE_PRAGMA_WEAK
4690 if (HANDLE_PRAGMA_WEAK)
4692 struct weak_syms *t;
4693 for (t = weak_decls; t; t = t->next)
4697 ASM_WEAKEN_LABEL (asm_out_file, t->name);
4699 ASM_OUTPUT_DEF (asm_out_file, t->name, t->value);
4706 /* Remove NAME from the pending list of weak symbols. This prevents
4707 the compiler from emitting multiple .weak directives which confuses
4709 #ifdef ASM_WEAKEN_LABEL
4711 remove_from_pending_weak_list (name)
4712 const char *name ATTRIBUTE_UNUSED;
4714 #ifdef HANDLE_PRAGMA_WEAK
4715 if (HANDLE_PRAGMA_WEAK)
4717 struct weak_syms *t;
4718 for (t = weak_decls; t; t = t->next)
4720 if (t->name && strcmp (name, t->name) == 0)
4729 assemble_alias (decl, target)
4730 tree decl, target ATTRIBUTE_UNUSED;
4734 make_decl_rtl (decl, (char *) 0, 1);
4735 name = XSTR (XEXP (DECL_RTL (decl), 0), 0);
4737 #ifdef ASM_OUTPUT_DEF
4738 /* Make name accessible from other files, if appropriate. */
4740 if (TREE_PUBLIC (decl))
4742 #ifdef ASM_WEAKEN_LABEL
4743 if (DECL_WEAK (decl))
4745 ASM_WEAKEN_LABEL (asm_out_file, name);
4746 /* Remove this function from the pending weak list so that
4747 we do not emit multiple .weak directives for it. */
4748 remove_from_pending_weak_list
4749 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl)));
4753 ASM_GLOBALIZE_LABEL (asm_out_file, name);
4756 #ifdef ASM_OUTPUT_DEF_FROM_DECLS
4757 ASM_OUTPUT_DEF_FROM_DECLS (asm_out_file, decl, target);
4759 ASM_OUTPUT_DEF (asm_out_file, name, IDENTIFIER_POINTER (target));
4761 TREE_ASM_WRITTEN (decl) = 1;
4763 #ifdef ASM_OUTPUT_WEAK_ALIAS
4764 if (! DECL_WEAK (decl))
4765 warning ("only weak aliases are supported in this configuration");
4767 ASM_OUTPUT_WEAK_ALIAS (asm_out_file, name, IDENTIFIER_POINTER (target));
4768 TREE_ASM_WRITTEN (decl) = 1;
4770 warning ("alias definitions not supported in this configuration; ignored");
4775 /* This determines whether or not we support link-once semantics. */
4776 #ifndef SUPPORTS_ONE_ONLY
4777 #ifdef MAKE_DECL_ONE_ONLY
4778 #define SUPPORTS_ONE_ONLY 1
4780 #define SUPPORTS_ONE_ONLY 0
4784 /* Returns 1 if the target configuration supports defining public symbols
4785 so that one of them will be chosen at link time instead of generating a
4786 multiply-defined symbol error, whether through the use of weak symbols or
4787 a target-specific mechanism for having duplicates discarded. */
4790 supports_one_only ()
4792 if (SUPPORTS_ONE_ONLY)
4794 return SUPPORTS_WEAK;
4797 /* Set up DECL as a public symbol that can be defined in multiple
4798 translation units without generating a linker error. */
4801 make_decl_one_only (decl)
4804 if (TREE_CODE (decl) != VAR_DECL && TREE_CODE (decl) != FUNCTION_DECL)
4807 TREE_PUBLIC (decl) = 1;
4809 if (TREE_CODE (decl) == VAR_DECL
4810 && (DECL_INITIAL (decl) == 0 || DECL_INITIAL (decl) == error_mark_node))
4811 DECL_COMMON (decl) = 1;
4812 else if (SUPPORTS_ONE_ONLY)
4814 #ifdef MAKE_DECL_ONE_ONLY
4815 MAKE_DECL_ONE_ONLY (decl);
4817 DECL_ONE_ONLY (decl) = 1;
4819 else if (SUPPORTS_WEAK)
4820 DECL_WEAK (decl) = 1;
4828 ggc_add_root (const_hash_table, MAX_HASH_TABLE, sizeof const_hash_table[0],
4829 mark_const_hash_entry);
4830 ggc_add_string_root (&in_named_name, 1);
4833 /* Extra support for EH values. */
4835 assemble_eh_label (name)
4838 #ifdef ASM_OUTPUT_EH_LABEL
4839 ASM_OUTPUT_EH_LABEL (asm_out_file, name);
4841 assemble_label (name);
4845 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
4848 assemble_eh_align (align)
4851 #ifdef ASM_OUTPUT_EH_ALIGN
4852 if (align > BITS_PER_UNIT)
4853 ASM_OUTPUT_EH_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
4855 assemble_align (align);
4860 /* On some platforms, we may want to specify a special mechansim to
4861 output EH data when generating with a function.. */
4863 assemble_eh_integer (x, size, force)
4871 #ifdef ASM_OUTPUT_EH_CHAR
4873 ASM_OUTPUT_EH_CHAR (asm_out_file, x);
4877 #ifdef ASM_OUTPUT_EH_SHORT
4879 ASM_OUTPUT_EH_SHORT (asm_out_file, x);
4883 #ifdef ASM_OUTPUT_EH_INT
4885 ASM_OUTPUT_EH_INT (asm_out_file, x);
4889 #ifdef ASM_OUTPUT_EH_DOUBLE_INT
4891 ASM_OUTPUT_EH_DOUBLE_INT (asm_out_file, x);
4898 return (assemble_integer (x, size, force));