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, 2001 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"
52 #ifdef XCOFF_DEBUGGING_INFO
56 #ifndef TRAMPOLINE_ALIGNMENT
57 #define TRAMPOLINE_ALIGNMENT FUNCTION_BOUNDARY
61 #define ASM_STABS_OP "\t.stabs\t"
64 /* Define the prefix to use when check_memory_usage_flag is enable. */
65 #ifdef NO_DOLLAR_IN_LABEL
66 #ifdef NO_DOT_IN_LABEL
67 #define CHKR_PREFIX "chkr_prefix_"
68 #else /* !NO_DOT_IN_LABEL */
69 #define CHKR_PREFIX "chkr."
71 #else /* !NO_DOLLAR_IN_LABEL */
72 #define CHKR_PREFIX "chkr$"
74 #define CHKR_PREFIX_SIZE (sizeof (CHKR_PREFIX) - 1)
76 /* File in which assembler code is being written. */
78 extern FILE *asm_out_file;
80 /* The (assembler) name of the first globally-visible object output. */
81 const char *first_global_object_name;
82 const char *weak_global_object_name;
84 extern struct obstack permanent_obstack;
85 #define obstack_chunk_alloc xmalloc
88 struct constant_descriptor;
92 #define MAX_RTX_HASH_TABLE 61
96 /* Hash facility for making memory-constants
97 from constant rtl-expressions. It is used on RISC machines
98 where immediate integer arguments and constant addresses are restricted
99 so that such constants must be stored in memory.
101 This pool of constants is reinitialized for each function
102 so each function gets its own constants-pool that comes right before
104 struct constant_descriptor **x_const_rtx_hash_table;
105 struct pool_constant **x_const_rtx_sym_hash_table;
107 /* Pointers to first and last constant in pool. */
108 struct pool_constant *x_first_pool, *x_last_pool;
110 /* Current offset in constant pool (does not include any machine-specific
114 /* Chain of all CONST_DOUBLE rtx's constructed for the current function.
115 They are chained through the CONST_DOUBLE_CHAIN.
116 A CONST_DOUBLE rtx has CONST_DOUBLE_MEM != cc0_rtx iff it is on this chain.
117 In that case, CONST_DOUBLE_MEM is either a MEM,
118 or const0_rtx if no MEM has been made for this CONST_DOUBLE yet. */
119 rtx x_const_double_chain;
122 #define const_rtx_hash_table (cfun->varasm->x_const_rtx_hash_table)
123 #define const_rtx_sym_hash_table (cfun->varasm->x_const_rtx_sym_hash_table)
124 #define first_pool (cfun->varasm->x_first_pool)
125 #define last_pool (cfun->varasm->x_last_pool)
126 #define pool_offset (cfun->varasm->x_pool_offset)
127 #define const_double_chain (cfun->varasm->x_const_double_chain)
129 /* Number for making the label on the next
130 constant that is stored in memory. */
134 /* Number for making the label on the next
135 static variable internal to a function. */
139 /* Carry information from ASM_DECLARE_OBJECT_NAME
140 to ASM_FINISH_DECLARE_OBJECT. */
142 int size_directive_output;
144 /* The last decl for which assemble_variable was called,
145 if it did ASM_DECLARE_OBJECT_NAME.
146 If the last call to assemble_variable didn't do that,
149 tree last_assemble_variable_decl;
151 static const char *strip_reg_name PARAMS ((const char *));
152 static int contains_pointers_p PARAMS ((tree));
153 static void decode_addr_const PARAMS ((tree, struct addr_const *));
154 static int const_hash PARAMS ((tree));
155 static int compare_constant PARAMS ((tree,
156 struct constant_descriptor *));
157 static const unsigned char *compare_constant_1 PARAMS ((tree, const unsigned char *));
158 static struct constant_descriptor *record_constant PARAMS ((tree));
159 static void record_constant_1 PARAMS ((tree));
160 static tree copy_constant PARAMS ((tree));
161 static void output_constant_def_contents PARAMS ((tree, int, int));
162 static void decode_rtx_const PARAMS ((enum machine_mode, rtx,
163 struct rtx_const *));
164 static int const_hash_rtx PARAMS ((enum machine_mode, rtx));
165 static int compare_constant_rtx PARAMS ((enum machine_mode, rtx,
166 struct constant_descriptor *));
167 static struct constant_descriptor *record_constant_rtx PARAMS ((enum machine_mode,
169 static struct pool_constant *find_pool_constant PARAMS ((struct function *, rtx));
170 static void mark_constant_pool PARAMS ((void));
171 static void mark_constants PARAMS ((rtx));
172 static int mark_constant PARAMS ((rtx *current_rtx, void *data));
173 static int output_addressed_constants PARAMS ((tree));
174 static void output_after_function_constants PARAMS ((void));
175 static unsigned HOST_WIDE_INT array_size_for_constructor PARAMS ((tree));
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_const_hash_entry PARAMS ((void *));
191 static int mark_const_str_htab_1 PARAMS ((void **, void *));
192 static void mark_const_str_htab PARAMS ((void *));
193 static hashval_t const_str_htab_hash PARAMS ((const void *x));
194 static int const_str_htab_eq PARAMS ((const void *x, const void *y));
195 static void const_str_htab_del PARAMS ((void *));
196 static void asm_emit_uninitialised PARAMS ((tree, const char*, int, int));
198 static enum in_section { no_section, in_text, in_data, in_named
199 #ifdef BSS_SECTION_ASM_OP
202 #ifdef EH_FRAME_SECTION_ASM_OP
205 #ifdef EXTRA_SECTIONS
208 } in_section = no_section;
210 /* Return a non-zero value if DECL has a section attribute. */
211 #ifndef IN_NAMED_SECTION
212 #define IN_NAMED_SECTION(DECL) \
213 ((TREE_CODE (DECL) == FUNCTION_DECL || TREE_CODE (DECL) == VAR_DECL) \
214 && DECL_SECTION_NAME (DECL) != NULL_TREE)
217 /* Text of section name when in_section == in_named. */
218 static const char *in_named_name;
220 /* Define functions like text_section for any extra sections. */
221 #ifdef EXTRA_SECTION_FUNCTIONS
222 EXTRA_SECTION_FUNCTIONS
225 /* Tell assembler to switch to text section. */
230 if (in_section != in_text)
232 fprintf (asm_out_file, "%s\n", TEXT_SECTION_ASM_OP);
233 in_section = in_text;
237 /* Tell assembler to switch to data section. */
242 if (in_section != in_data)
244 if (flag_shared_data)
246 #ifdef SHARED_SECTION_ASM_OP
247 fprintf (asm_out_file, "%s\n", SHARED_SECTION_ASM_OP);
249 fprintf (asm_out_file, "%s\n", DATA_SECTION_ASM_OP);
253 fprintf (asm_out_file, "%s\n", DATA_SECTION_ASM_OP);
255 in_section = in_data;
258 /* Tell assembler to ALWAYS switch to data section, in case
259 it's not sure where it it. */
262 force_data_section ()
264 in_section = no_section;
268 /* Tell assembler to switch to read-only data section. This is normally
272 readonly_data_section ()
274 #ifdef READONLY_DATA_SECTION
275 READONLY_DATA_SECTION (); /* Note this can call data_section. */
281 /* Determine if we're in the text section. */
286 return in_section == in_text;
289 /* Determine if we're in the data section. */
294 return in_section == in_data;
297 /* Tell assembler to change to section NAME for DECL.
298 If DECL is NULL, just switch to section NAME.
299 If NAME is NULL, get the name from DECL.
300 If RELOC is 1, the initializer for DECL contains relocs. */
303 named_section (decl, name, reloc)
306 int reloc ATTRIBUTE_UNUSED;
308 if (decl != NULL_TREE && !DECL_P (decl))
311 name = TREE_STRING_POINTER (DECL_SECTION_NAME (decl));
313 if (in_section != in_named || strcmp (name, in_named_name))
315 #ifdef ASM_OUTPUT_SECTION_NAME
316 ASM_OUTPUT_SECTION_NAME (asm_out_file, decl, name, reloc);
318 /* Section attributes are not supported if this macro isn't provided -
319 some host formats don't support them at all. The front-end should
320 already have flagged this as an error. */
324 in_named_name = ggc_strdup (name);
325 in_section = in_named;
329 #ifdef ASM_OUTPUT_SECTION_NAME
330 #ifndef UNIQUE_SECTION
331 #define UNIQUE_SECTION(DECL,RELOC) \
337 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (DECL)); \
338 /* Strip off any encoding in name. */ \
339 STRIP_NAME_ENCODING (name, name); \
341 len = strlen (name) + 1; \
342 string = alloca (len + 1); \
343 sprintf (string, ".%s", name); \
345 DECL_SECTION_NAME (DECL) = build_string (len, string); \
348 #ifndef UNIQUE_SECTION_P
349 #define UNIQUE_SECTION_P(DECL) 0
353 #ifdef BSS_SECTION_ASM_OP
355 /* Tell the assembler to switch to the bss section. */
360 if (in_section != in_bss)
362 #ifdef SHARED_BSS_SECTION_ASM_OP
363 if (flag_shared_data)
364 fprintf (asm_out_file, "%s\n", SHARED_BSS_SECTION_ASM_OP);
367 fprintf (asm_out_file, "%s\n", BSS_SECTION_ASM_OP);
373 #ifdef ASM_OUTPUT_BSS
375 /* Utility function for ASM_OUTPUT_BSS for targets to use if
376 they don't support alignments in .bss.
377 ??? It is believed that this function will work in most cases so such
378 support is localized here. */
381 asm_output_bss (file, decl, name, size, rounded)
383 tree decl ATTRIBUTE_UNUSED;
385 int size ATTRIBUTE_UNUSED, rounded;
387 ASM_GLOBALIZE_LABEL (file, name);
389 #ifdef ASM_DECLARE_OBJECT_NAME
390 last_assemble_variable_decl = decl;
391 ASM_DECLARE_OBJECT_NAME (file, name, decl);
393 /* Standard thing is just output label for the object. */
394 ASM_OUTPUT_LABEL (file, name);
395 #endif /* ASM_DECLARE_OBJECT_NAME */
396 ASM_OUTPUT_SKIP (file, rounded);
401 #ifdef ASM_OUTPUT_ALIGNED_BSS
403 /* Utility function for targets to use in implementing
404 ASM_OUTPUT_ALIGNED_BSS.
405 ??? It is believed that this function will work in most cases so such
406 support is localized here. */
409 asm_output_aligned_bss (file, decl, name, size, align)
415 ASM_GLOBALIZE_LABEL (file, name);
417 ASM_OUTPUT_ALIGN (file, floor_log2 (align / BITS_PER_UNIT));
418 #ifdef ASM_DECLARE_OBJECT_NAME
419 last_assemble_variable_decl = decl;
420 ASM_DECLARE_OBJECT_NAME (file, name, decl);
422 /* Standard thing is just output label for the object. */
423 ASM_OUTPUT_LABEL (file, name);
424 #endif /* ASM_DECLARE_OBJECT_NAME */
425 ASM_OUTPUT_SKIP (file, size ? size : 1);
430 #endif /* BSS_SECTION_ASM_OP */
432 #ifdef EH_FRAME_SECTION_ASM_OP
436 if (in_section != in_eh_frame)
438 fprintf (asm_out_file, "%s\n", EH_FRAME_SECTION_ASM_OP);
439 in_section = in_eh_frame;
444 /* Switch to the section for function DECL.
446 If DECL is NULL_TREE, switch to the text section.
447 ??? It's not clear that we will ever be passed NULL_TREE, but it's
448 safer to handle it. */
451 function_section (decl)
454 if (decl != NULL_TREE
455 && DECL_SECTION_NAME (decl) != NULL_TREE)
456 named_section (decl, (char *) 0, 0);
461 /* Switch to section for variable DECL.
463 RELOC is the `reloc' argument to SELECT_SECTION. */
466 variable_section (decl, reloc)
470 if (IN_NAMED_SECTION (decl))
471 named_section (decl, NULL, reloc);
474 /* C++ can have const variables that get initialized from constructors,
475 and thus can not be in a readonly section. We prevent this by
476 verifying that the initial value is constant for objects put in a
479 error_mark_node is used by the C front end to indicate that the
480 initializer has not been seen yet. In this case, we assume that
481 the initializer must be constant.
483 C++ uses error_mark_node for variables that have complicated
484 initializers, but these variables go in BSS so we won't be called
487 #ifdef SELECT_SECTION
488 SELECT_SECTION (decl, reloc);
490 if (DECL_READONLY_SECTION (decl, reloc))
491 readonly_data_section ();
498 /* Tell assembler to switch to the section for the exception handling
504 #if defined (EXCEPTION_SECTION)
505 EXCEPTION_SECTION ();
507 #ifdef ASM_OUTPUT_SECTION_NAME
508 named_section (NULL_TREE, ".gcc_except_table", 0);
513 readonly_data_section ();
518 /* Create the rtl to represent a function, for a function definition.
519 DECL is a FUNCTION_DECL node which describes which function.
520 The rtl is stored into DECL. */
523 make_function_rtl (decl)
527 const char *new_name;
529 if (DECL_RTL (decl) != 0)
531 /* ??? Another way to do this would be to do what halfpic.c does
532 and maintain a hashed table of such critters. */
533 /* ??? Another way to do this would be to pass a flag bit to
534 ENCODE_SECTION_INFO saying whether this is a new decl or not. */
535 /* Let the target reassign the RTL if it wants.
536 This is necessary, for example, when one machine specific
537 decl attribute overrides another. */
538 #ifdef REDO_SECTION_INFO_P
539 if (REDO_SECTION_INFO_P (decl))
540 ENCODE_SECTION_INFO (decl);
545 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
548 /* Rename a nested function to avoid conflicts, unless it's a member of
549 a local class, in which case the class name is already unique. */
550 if (decl_function_context (decl) != 0
551 && ! TYPE_P (DECL_CONTEXT (decl))
552 && DECL_INITIAL (decl) != 0
553 && DECL_RTL (decl) == 0)
556 ASM_FORMAT_PRIVATE_NAME (label, name, var_labelno);
560 /* When -fprefix-function-name is used, every function name is
561 prefixed. Even static functions are prefixed because they
562 could be declared latter. Note that a nested function name
564 else if (flag_prefix_function_name)
566 size_t name_len = IDENTIFIER_LENGTH (DECL_ASSEMBLER_NAME (decl));
569 pname = alloca (name_len + CHKR_PREFIX_SIZE + 1);
570 memcpy (pname, CHKR_PREFIX, CHKR_PREFIX_SIZE);
571 memcpy (pname + CHKR_PREFIX_SIZE, name, name_len + 1);
575 if (name != new_name)
577 DECL_ASSEMBLER_NAME (decl) = get_identifier (new_name);
578 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
582 = gen_rtx_MEM (DECL_MODE (decl),
583 gen_rtx_SYMBOL_REF (Pmode, name));
585 /* Optionally set flags or add text to the name to record
586 information such as that it is a function name. If the name
587 is changed, the macro ASM_OUTPUT_LABELREF will have to know
588 how to strip this information. */
589 #ifdef ENCODE_SECTION_INFO
590 ENCODE_SECTION_INFO (decl);
595 /* Given NAME, a putative register name, discard any customary prefixes. */
598 strip_reg_name (name)
601 #ifdef REGISTER_PREFIX
602 if (!strncmp (name, REGISTER_PREFIX, strlen (REGISTER_PREFIX)))
603 name += strlen (REGISTER_PREFIX);
605 if (name[0] == '%' || name[0] == '#')
610 /* Decode an `asm' spec for a declaration as a register name.
611 Return the register number, or -1 if nothing specified,
612 or -2 if the ASMSPEC is not `cc' or `memory' and is not recognized,
613 or -3 if ASMSPEC is `cc' and is not recognized,
614 or -4 if ASMSPEC is `memory' and is not recognized.
615 Accept an exact spelling or a decimal number.
616 Prefixes such as % are optional. */
619 decode_reg_name (asmspec)
626 /* Get rid of confusing prefixes. */
627 asmspec = strip_reg_name (asmspec);
629 /* Allow a decimal number as a "register name". */
630 for (i = strlen (asmspec) - 1; i >= 0; i--)
631 if (! (asmspec[i] >= '0' && asmspec[i] <= '9'))
633 if (asmspec[0] != 0 && i < 0)
636 if (i < FIRST_PSEUDO_REGISTER && i >= 0)
642 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
644 && ! strcmp (asmspec, strip_reg_name (reg_names[i])))
647 #ifdef ADDITIONAL_REGISTER_NAMES
649 static struct { const char *name; int number; } table[]
650 = ADDITIONAL_REGISTER_NAMES;
652 for (i = 0; i < (int) ARRAY_SIZE (table); i++)
653 if (! strcmp (asmspec, table[i].name))
654 return table[i].number;
656 #endif /* ADDITIONAL_REGISTER_NAMES */
658 if (!strcmp (asmspec, "memory"))
661 if (!strcmp (asmspec, "cc"))
670 /* Create the DECL_RTL for a declaration for a static or external variable
671 or static or external function.
672 ASMSPEC, if not 0, is the string which the user specified
673 as the assembler symbol name.
674 TOP_LEVEL is nonzero if this is a file-scope variable.
676 This is never called for PARM_DECL nodes. */
679 make_decl_rtl (decl, asmspec, top_level)
684 const char *name = 0;
685 const char *new_name = 0;
688 /* For a duplicate declaration, we can be called twice on the
689 same DECL node. Don't discard the RTL already made. */
690 if (DECL_RTL (decl) != 0)
692 /* If the old RTL had the wrong mode, fix the mode. */
693 if (GET_MODE (DECL_RTL (decl)) != DECL_MODE (decl))
695 rtx rtl = DECL_RTL (decl);
696 PUT_MODE (rtl, DECL_MODE (decl));
699 /* ??? Another way to do this would be to do what halfpic.c does
700 and maintain a hashed table of such critters. */
701 /* ??? Another way to do this would be to pass a flag bit to
702 ENCODE_SECTION_INFO saying whether this is a new decl or not. */
703 /* Let the target reassign the RTL if it wants.
704 This is necessary, for example, when one machine specific
705 decl attribute overrides another. */
706 #ifdef REDO_SECTION_INFO_P
707 if (REDO_SECTION_INFO_P (decl))
708 ENCODE_SECTION_INFO (decl);
713 new_name = name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
715 reg_number = decode_reg_name (asmspec);
716 if (reg_number == -2)
718 /* ASMSPEC is given, and not the name of a register. Mark the
719 name with a star so assemble_name won't munge it. */
720 char *starred = alloca (strlen (asmspec) + 2);
722 strcpy (starred + 1, asmspec);
726 if (TREE_CODE (decl) != FUNCTION_DECL && DECL_REGISTER (decl))
728 /* First detect errors in declaring global registers. */
729 if (reg_number == -1)
730 error_with_decl (decl, "register name not specified for `%s'");
731 else if (reg_number < 0)
732 error_with_decl (decl, "invalid register name for `%s'");
733 else if (TYPE_MODE (TREE_TYPE (decl)) == BLKmode)
734 error_with_decl (decl,
735 "data type of `%s' isn't suitable for a register");
736 else if (! HARD_REGNO_MODE_OK (reg_number, TYPE_MODE (TREE_TYPE (decl))))
737 error_with_decl (decl,
738 "register specified for `%s' isn't suitable for data type");
739 /* Now handle properly declared static register variables. */
744 if (DECL_INITIAL (decl) != 0 && top_level)
746 DECL_INITIAL (decl) = 0;
747 error ("global register variable has initial value");
749 if (TREE_THIS_VOLATILE (decl))
750 warning ("volatile register variables don't work as you might wish");
752 /* If the user specified one of the eliminables registers here,
753 e.g., FRAME_POINTER_REGNUM, we don't want to get this variable
754 confused with that register and be eliminated. Although this
755 usage is somewhat suspect, we nevertheless use the following
756 kludge to avoid setting DECL_RTL to frame_pointer_rtx. */
759 = gen_rtx_REG (DECL_MODE (decl), FIRST_PSEUDO_REGISTER);
760 REGNO (DECL_RTL (decl)) = reg_number;
761 REG_USERVAR_P (DECL_RTL (decl)) = 1;
765 /* Make this register global, so not usable for anything
767 #ifdef ASM_DECLARE_REGISTER_GLOBAL
768 ASM_DECLARE_REGISTER_GLOBAL (asm_out_file, decl, reg_number, name);
770 nregs = HARD_REGNO_NREGS (reg_number, DECL_MODE (decl));
772 globalize_reg (reg_number + --nregs);
775 /* As a register variable, it has no section. */
780 /* Now handle ordinary static variables and functions (in memory).
781 Also handle vars declared register invalidly. */
783 if (reg_number >= 0 || reg_number == -3)
784 error_with_decl (decl,
785 "register name given for non-register variable `%s'");
787 /* Specifying a section attribute on a variable forces it into a
788 non-.bss section, and thus it cannot be common. */
789 if (TREE_CODE (decl) == VAR_DECL
790 && DECL_SECTION_NAME (decl) != NULL_TREE
791 && DECL_INITIAL (decl) == NULL_TREE
792 && DECL_COMMON (decl))
793 DECL_COMMON (decl) = 0;
795 /* Can't use just the variable's own name for a variable
796 whose scope is less than the whole file, unless it's a member
797 of a local class (which will already be unambiguous).
798 Concatenate a distinguishing number. */
799 if (!top_level && !TREE_PUBLIC (decl)
800 && ! (DECL_CONTEXT (decl) && TYPE_P (DECL_CONTEXT (decl)))
804 ASM_FORMAT_PRIVATE_NAME (label, name, var_labelno);
809 /* When -fprefix-function-name is used, the functions
810 names are prefixed. Only nested function names are not
812 else if (flag_prefix_function_name && TREE_CODE (decl) == FUNCTION_DECL)
814 size_t name_len = IDENTIFIER_LENGTH (DECL_ASSEMBLER_NAME (decl));
817 pname = alloca (name_len + CHKR_PREFIX_SIZE + 1);
818 memcpy (pname, CHKR_PREFIX, CHKR_PREFIX_SIZE);
819 memcpy (pname + CHKR_PREFIX_SIZE, name, name_len + 1);
823 if (name != new_name)
825 DECL_ASSEMBLER_NAME (decl) = get_identifier (new_name);
826 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
829 /* If this variable is to be treated as volatile, show its
830 tree node has side effects. */
831 if ((flag_volatile_global && TREE_CODE (decl) == VAR_DECL
832 && TREE_PUBLIC (decl))
833 || ((flag_volatile_static && TREE_CODE (decl) == VAR_DECL
834 && (TREE_PUBLIC (decl) || TREE_STATIC (decl)))))
835 TREE_SIDE_EFFECTS (decl) = 1;
837 DECL_RTL (decl) = gen_rtx_MEM (DECL_MODE (decl),
838 gen_rtx_SYMBOL_REF (Pmode, name));
839 if (TREE_CODE (decl) != FUNCTION_DECL)
840 set_mem_attributes (DECL_RTL (decl), decl, 1);
842 /* Optionally set flags or add text to the name to record information
843 such as that it is a function name.
844 If the name is changed, the macro ASM_OUTPUT_LABELREF
845 will have to know how to strip this information. */
846 #ifdef ENCODE_SECTION_INFO
847 ENCODE_SECTION_INFO (decl);
851 /* Make the rtl for variable VAR be volatile.
852 Use this only for static variables. */
855 make_var_volatile (var)
858 if (GET_CODE (DECL_RTL (var)) != MEM)
861 MEM_VOLATILE_P (DECL_RTL (var)) = 1;
864 /* Output alignment directive to align for constant expression EXP. */
867 assemble_constant_align (exp)
872 /* Align the location counter as required by EXP's data type. */
873 align = TYPE_ALIGN (TREE_TYPE (exp));
874 #ifdef CONSTANT_ALIGNMENT
875 align = CONSTANT_ALIGNMENT (exp, align);
878 if (align > BITS_PER_UNIT)
879 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
882 /* Output a string of literal assembler code
883 for an `asm' keyword used between functions. */
886 assemble_asm (string)
891 if (TREE_CODE (string) == ADDR_EXPR)
892 string = TREE_OPERAND (string, 0);
894 fprintf (asm_out_file, "\t%s\n", TREE_STRING_POINTER (string));
897 #if 0 /* This should no longer be needed, because
898 flag_gnu_linker should be 0 on these systems,
899 which should prevent any output
900 if ASM_OUTPUT_CONSTRUCTOR and ASM_OUTPUT_DESTRUCTOR are absent. */
901 #if !(defined(DBX_DEBUGGING_INFO) && !defined(FASCIST_ASSEMBLER))
902 #ifndef ASM_OUTPUT_CONSTRUCTOR
903 #define ASM_OUTPUT_CONSTRUCTOR(file, name)
905 #ifndef ASM_OUTPUT_DESTRUCTOR
906 #define ASM_OUTPUT_DESTRUCTOR(file, name)
911 /* Record an element in the table of global destructors.
912 How this is done depends on what sort of assembler and linker
915 NAME should be the name of a global function to be called
916 at exit time. This name is output using assemble_name. */
919 assemble_destructor (name)
922 #ifdef ASM_OUTPUT_DESTRUCTOR
923 ASM_OUTPUT_DESTRUCTOR (asm_out_file, name);
927 /* Now tell GNU LD that this is part of the static destructor set. */
928 /* This code works for any machine provided you use GNU as/ld. */
929 fprintf (asm_out_file, "%s\"___DTOR_LIST__\",22,0,0,", ASM_STABS_OP);
930 assemble_name (asm_out_file, name);
931 fputc ('\n', asm_out_file);
936 /* Likewise for global constructors. */
939 assemble_constructor (name)
942 #ifdef ASM_OUTPUT_CONSTRUCTOR
943 ASM_OUTPUT_CONSTRUCTOR (asm_out_file, name);
947 /* Now tell GNU LD that this is part of the static constructor set. */
948 /* This code works for any machine provided you use GNU as/ld. */
949 fprintf (asm_out_file, "%s\"___CTOR_LIST__\",22,0,0,", ASM_STABS_OP);
950 assemble_name (asm_out_file, name);
951 fputc ('\n', asm_out_file);
956 /* Likewise for entries we want to record for garbage collection.
957 Garbage collection is still under development. */
960 assemble_gc_entry (name)
963 #ifdef ASM_OUTPUT_GC_ENTRY
964 ASM_OUTPUT_GC_ENTRY (asm_out_file, name);
968 /* Now tell GNU LD that this is part of the static constructor set. */
969 fprintf (asm_out_file, "%s\"___PTR_LIST__\",22,0,0,", ASM_STABS_OP);
970 assemble_name (asm_out_file, name);
971 fputc ('\n', asm_out_file);
976 /* CONSTANT_POOL_BEFORE_FUNCTION may be defined as an expression with
977 a non-zero value if the constant pool should be output before the
978 start of the function, or a zero value if the pool should output
979 after the end of the function. The default is to put it before the
982 #ifndef CONSTANT_POOL_BEFORE_FUNCTION
983 #define CONSTANT_POOL_BEFORE_FUNCTION 1
986 /* Output assembler code for the constant pool of a function and associated
987 with defining the name of the function. DECL describes the function.
988 NAME is the function's name. For the constant pool, we use the current
989 constant pool data. */
992 assemble_start_function (decl, fnname)
998 /* The following code does not need preprocessing in the assembler. */
1002 if (CONSTANT_POOL_BEFORE_FUNCTION)
1003 output_constant_pool (fnname, decl);
1005 #ifdef ASM_OUTPUT_SECTION_NAME
1006 /* If the function is to be put in its own section and it's not in a section
1007 already, indicate so. */
1008 if ((flag_function_sections
1009 && DECL_SECTION_NAME (decl) == NULL_TREE)
1010 || UNIQUE_SECTION_P (decl))
1011 UNIQUE_SECTION (decl, 0);
1014 function_section (decl);
1016 /* Tell assembler to move to target machine's alignment for functions. */
1017 align = floor_log2 (FUNCTION_BOUNDARY / BITS_PER_UNIT);
1019 ASM_OUTPUT_ALIGN (asm_out_file, align);
1021 /* Handle a user-specified function alignment.
1022 Note that we still need to align to FUNCTION_BOUNDARY, as above,
1023 because ASM_OUTPUT_MAX_SKIP_ALIGN might not do any alignment at all. */
1024 if (align_functions_log > align)
1026 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
1027 ASM_OUTPUT_MAX_SKIP_ALIGN (asm_out_file,
1028 align_functions_log, align_functions-1);
1030 ASM_OUTPUT_ALIGN (asm_out_file, align_functions_log);
1034 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
1035 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file, fnname);
1038 #ifdef SDB_DEBUGGING_INFO
1039 /* Output SDB definition of the function. */
1040 if (write_symbols == SDB_DEBUG)
1041 sdbout_mark_begin_function ();
1044 #ifdef DBX_DEBUGGING_INFO
1045 /* Output DBX definition of the function. */
1046 if (write_symbols == DBX_DEBUG)
1047 dbxout_begin_function (decl);
1050 /* Make function name accessible from other files, if appropriate. */
1052 if (TREE_PUBLIC (decl))
1054 if (! first_global_object_name)
1059 STRIP_NAME_ENCODING (p, fnname);
1060 name = permalloc (strlen (p) + 1);
1063 if (! DECL_WEAK (decl) && ! DECL_ONE_ONLY (decl))
1064 first_global_object_name = name;
1066 weak_global_object_name = name;
1069 #ifdef ASM_WEAKEN_LABEL
1070 if (DECL_WEAK (decl))
1072 ASM_WEAKEN_LABEL (asm_out_file, fnname);
1073 /* Remove this function from the pending weak list so that
1074 we do not emit multiple .weak directives for it. */
1075 remove_from_pending_weak_list
1076 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl)));
1080 ASM_GLOBALIZE_LABEL (asm_out_file, fnname);
1083 /* Do any machine/system dependent processing of the function name */
1084 #ifdef ASM_DECLARE_FUNCTION_NAME
1085 ASM_DECLARE_FUNCTION_NAME (asm_out_file, fnname, current_function_decl);
1087 /* Standard thing is just output label for the function. */
1088 ASM_OUTPUT_LABEL (asm_out_file, fnname);
1089 #endif /* ASM_DECLARE_FUNCTION_NAME */
1092 /* Output assembler code associated with defining the size of the
1093 function. DECL describes the function. NAME is the function's name. */
1096 assemble_end_function (decl, fnname)
1100 #ifdef ASM_DECLARE_FUNCTION_SIZE
1101 ASM_DECLARE_FUNCTION_SIZE (asm_out_file, fnname, decl);
1103 if (! CONSTANT_POOL_BEFORE_FUNCTION)
1105 output_constant_pool (fnname, decl);
1106 function_section (decl); /* need to switch back */
1109 /* Output any constants which should appear after the function. */
1110 output_after_function_constants ();
1113 /* Assemble code to leave SIZE bytes of zeros. */
1116 assemble_zeros (size)
1119 /* Do no output if -fsyntax-only. */
1120 if (flag_syntax_only)
1123 #ifdef ASM_NO_SKIP_IN_TEXT
1124 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
1125 so we must output 0s explicitly in the text section. */
1126 if (ASM_NO_SKIP_IN_TEXT && in_text_section ())
1130 for (i = 0; i < size - 20; i += 20)
1133 fprintf (asm_out_file,
1134 "%s0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n", ASM_BYTE_OP);
1136 fprintf (asm_out_file,
1137 "\tbyte 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n");
1143 fprintf (asm_out_file, "%s0", ASM_BYTE_OP);
1145 fprintf (asm_out_file, "\tbyte 0");
1148 for (; i < size; i++)
1149 fprintf (asm_out_file, ",0");
1150 fprintf (asm_out_file, "\n");
1156 ASM_OUTPUT_SKIP (asm_out_file, size);
1159 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
1162 assemble_align (align)
1165 if (align > BITS_PER_UNIT)
1166 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
1169 /* Assemble a string constant with the specified C string as contents. */
1172 assemble_string (p, size)
1179 /* If the string is very long, split it up. */
1183 int thissize = size - pos;
1184 if (thissize > maximum)
1187 ASM_OUTPUT_ASCII (asm_out_file, p, thissize);
1195 #if defined ASM_OUTPUT_ALIGNED_DECL_LOCAL
1196 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1197 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1199 #if defined ASM_OUTPUT_ALIGNED_LOCAL
1200 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1201 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, DECL_ALIGN (decl))
1203 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1204 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded)
1208 #if defined ASM_OUTPUT_ALIGNED_BSS
1209 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1210 ASM_OUTPUT_ALIGNED_BSS (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1212 #if defined ASM_OUTPUT_BSS
1213 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1214 ASM_OUTPUT_BSS (asm_out_file, decl, name, size, rounded)
1220 #if defined ASM_OUTPUT_ALIGNED_DECL_COMMON
1221 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1222 ASM_OUTPUT_ALIGNED_DECL_COMMON (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1224 #if defined ASM_OUTPUT_ALIGNED_COMMON
1225 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1226 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file, name, size, DECL_ALIGN (decl))
1228 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1229 ASM_OUTPUT_COMMON (asm_out_file, name, size, rounded)
1234 asm_emit_uninitialised (decl, name, size, rounded)
1237 int size ATTRIBUTE_UNUSED;
1238 int rounded ATTRIBUTE_UNUSED;
1246 destination = asm_dest_local;
1248 if (TREE_PUBLIC (decl))
1250 #if defined ASM_EMIT_BSS
1251 if (! DECL_COMMON (decl))
1252 destination = asm_dest_bss;
1255 destination = asm_dest_common;
1258 if (flag_shared_data)
1260 switch (destination)
1262 #ifdef ASM_OUTPUT_SHARED_BSS
1264 ASM_OUTPUT_SHARED_BSS (asm_out_file, decl, name, size, rounded);
1267 #ifdef ASM_OUTPUT_SHARED_COMMON
1268 case asm_dest_common:
1269 ASM_OUTPUT_SHARED_COMMON (asm_out_file, name, size, rounded);
1272 #ifdef ASM_OUTPUT_SHARED_LOCAL
1273 case asm_dest_local:
1274 ASM_OUTPUT_SHARED_LOCAL (asm_out_file, name, size, rounded);
1282 #ifdef ASM_OUTPUT_SECTION_NAME
1283 /* We already know that DECL_SECTION_NAME() == NULL. */
1284 if (flag_data_sections != 0 || UNIQUE_SECTION_P (decl))
1285 UNIQUE_SECTION (decl, 0);
1288 switch (destination)
1292 ASM_EMIT_BSS (decl, name, size, rounded);
1295 case asm_dest_common:
1296 ASM_EMIT_COMMON (decl, name, size, rounded);
1298 case asm_dest_local:
1299 ASM_EMIT_LOCAL (decl, name, size, rounded);
1308 /* Assemble everything that is needed for a variable or function declaration.
1309 Not used for automatic variables, and not used for function definitions.
1310 Should not be called for variables of incomplete structure type.
1312 TOP_LEVEL is nonzero if this variable has file scope.
1313 AT_END is nonzero if this is the special handling, at end of compilation,
1314 to define things that have had only tentative definitions.
1315 DONT_OUTPUT_DATA if nonzero means don't actually output the
1316 initial value (that will be done by the caller). */
1319 assemble_variable (decl, top_level, at_end, dont_output_data)
1321 int top_level ATTRIBUTE_UNUSED;
1322 int at_end ATTRIBUTE_UNUSED;
1323 int dont_output_data;
1325 register const char *name;
1328 enum in_section saved_in_section;
1330 last_assemble_variable_decl = 0;
1332 if (GET_CODE (DECL_RTL (decl)) == REG)
1334 /* Do output symbol info for global register variables, but do nothing
1337 if (TREE_ASM_WRITTEN (decl))
1339 TREE_ASM_WRITTEN (decl) = 1;
1341 /* Do no output if -fsyntax-only. */
1342 if (flag_syntax_only)
1345 #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
1346 /* File-scope global variables are output here. */
1347 if ((write_symbols == DBX_DEBUG || write_symbols == XCOFF_DEBUG)
1349 dbxout_symbol (decl, 0);
1351 #ifdef SDB_DEBUGGING_INFO
1352 if (write_symbols == SDB_DEBUG && top_level
1353 /* Leave initialized global vars for end of compilation;
1354 see comment in compile_file. */
1355 && (TREE_PUBLIC (decl) == 0 || DECL_INITIAL (decl) == 0))
1356 sdbout_symbol (decl, 0);
1359 /* Don't output any DWARF debugging information for variables here.
1360 In the case of local variables, the information for them is output
1361 when we do our recursive traversal of the tree representation for
1362 the entire containing function. In the case of file-scope variables,
1363 we output information for all of them at the very end of compilation
1364 while we are doing our final traversal of the chain of file-scope
1370 /* Normally no need to say anything here for external references,
1371 since assemble_external is called by the language-specific code
1372 when a declaration is first seen. */
1374 if (DECL_EXTERNAL (decl))
1377 /* Output no assembler code for a function declaration.
1378 Only definitions of functions output anything. */
1380 if (TREE_CODE (decl) == FUNCTION_DECL)
1383 /* If type was incomplete when the variable was declared,
1384 see if it is complete now. */
1386 if (DECL_SIZE (decl) == 0)
1387 layout_decl (decl, 0);
1389 /* Still incomplete => don't allocate it; treat the tentative defn
1390 (which is what it must have been) as an `extern' reference. */
1392 if (!dont_output_data && DECL_SIZE (decl) == 0)
1394 error_with_file_and_line (DECL_SOURCE_FILE (decl),
1395 DECL_SOURCE_LINE (decl),
1396 "storage size of `%s' isn't known",
1397 IDENTIFIER_POINTER (DECL_NAME (decl)));
1398 TREE_ASM_WRITTEN (decl) = 1;
1402 /* The first declaration of a variable that comes through this function
1403 decides whether it is global (in C, has external linkage)
1404 or local (in C, has internal linkage). So do nothing more
1405 if this function has already run. */
1407 if (TREE_ASM_WRITTEN (decl))
1410 TREE_ASM_WRITTEN (decl) = 1;
1412 /* Do no output if -fsyntax-only. */
1413 if (flag_syntax_only)
1418 if (! dont_output_data
1419 && ! host_integerp (DECL_SIZE_UNIT (decl), 1))
1421 error_with_decl (decl, "size of variable `%s' is too large");
1425 name = XSTR (XEXP (DECL_RTL (decl), 0), 0);
1426 if (TREE_PUBLIC (decl) && DECL_NAME (decl)
1427 && ! first_global_object_name
1428 && ! (DECL_COMMON (decl) && (DECL_INITIAL (decl) == 0
1429 || DECL_INITIAL (decl) == error_mark_node))
1430 && ! DECL_WEAK (decl)
1431 && ! DECL_ONE_ONLY (decl))
1436 STRIP_NAME_ENCODING (p, name);
1437 xname = permalloc (strlen (p) + 1);
1439 first_global_object_name = xname;
1442 /* Compute the alignment of this data. */
1444 align = DECL_ALIGN (decl);
1446 /* In the case for initialing an array whose length isn't specified,
1447 where we have not yet been able to do the layout,
1448 figure out the proper alignment now. */
1449 if (dont_output_data && DECL_SIZE (decl) == 0
1450 && TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE)
1451 align = MAX (align, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl))));
1453 /* Some object file formats have a maximum alignment which they support.
1454 In particular, a.out format supports a maximum alignment of 4. */
1455 #ifndef MAX_OFILE_ALIGNMENT
1456 #define MAX_OFILE_ALIGNMENT BIGGEST_ALIGNMENT
1458 if (align > MAX_OFILE_ALIGNMENT)
1460 warning_with_decl (decl,
1461 "alignment of `%s' is greater than maximum object file alignment. Using %d.",
1462 MAX_OFILE_ALIGNMENT/BITS_PER_UNIT);
1463 align = MAX_OFILE_ALIGNMENT;
1466 /* On some machines, it is good to increase alignment sometimes. */
1467 #ifdef DATA_ALIGNMENT
1468 align = DATA_ALIGNMENT (TREE_TYPE (decl), align);
1470 #ifdef CONSTANT_ALIGNMENT
1471 if (DECL_INITIAL (decl) != 0 && DECL_INITIAL (decl) != error_mark_node)
1472 align = CONSTANT_ALIGNMENT (DECL_INITIAL (decl), align);
1475 /* Reset the alignment in case we have made it tighter, so we can benefit
1476 from it in get_pointer_alignment. */
1477 DECL_ALIGN (decl) = align;
1479 /* Handle uninitialized definitions. */
1481 if ((DECL_INITIAL (decl) == 0 || DECL_INITIAL (decl) == error_mark_node)
1482 /* If the target can't output uninitialized but not common global data
1483 in .bss, then we have to use .data. */
1484 #if ! defined ASM_EMIT_BSS
1485 && DECL_COMMON (decl)
1487 && DECL_SECTION_NAME (decl) == NULL_TREE
1488 && ! dont_output_data)
1490 unsigned HOST_WIDE_INT size = tree_low_cst (DECL_SIZE_UNIT (decl), 1);
1491 unsigned HOST_WIDE_INT rounded = size;
1493 /* Don't allocate zero bytes of common,
1494 since that means "undefined external" in the linker. */
1498 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1499 so that each uninitialized object starts on such a boundary. */
1500 rounded += (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1;
1501 rounded = (rounded / (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
1502 * (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
1504 /* Don't continue this line--convex cc version 4.1 would lose. */
1505 #if !defined(ASM_OUTPUT_ALIGNED_COMMON) && !defined(ASM_OUTPUT_ALIGNED_DECL_COMMON) && !defined(ASM_OUTPUT_ALIGNED_BSS)
1506 if ((unsigned HOST_WIDE_INT) DECL_ALIGN (decl) / BITS_PER_UNIT > rounded)
1508 (decl, "requested alignment for %s is greater than implemented alignment of %d.",rounded);
1511 #ifdef DBX_DEBUGGING_INFO
1512 /* File-scope global variables are output here. */
1513 if (write_symbols == DBX_DEBUG && top_level)
1514 dbxout_symbol (decl, 0);
1516 #ifdef SDB_DEBUGGING_INFO
1517 if (write_symbols == SDB_DEBUG && top_level
1518 /* Leave initialized global vars for end of compilation;
1519 see comment in compile_file. */
1520 && (TREE_PUBLIC (decl) == 0 || DECL_INITIAL (decl) == 0))
1521 sdbout_symbol (decl, 0);
1524 /* Don't output any DWARF debugging information for variables here.
1525 In the case of local variables, the information for them is output
1526 when we do our recursive traversal of the tree representation for
1527 the entire containing function. In the case of file-scope variables,
1528 we output information for all of them at the very end of compilation
1529 while we are doing our final traversal of the chain of file-scope
1532 #if 0 /* ??? We should either delete this or add a comment describing what
1533 it was intended to do and why we shouldn't delete it. */
1534 if (flag_shared_data)
1537 asm_emit_uninitialised (decl, name, size, rounded);
1542 /* Handle initialized definitions.
1543 Also handle uninitialized global definitions if -fno-common and the
1544 target doesn't support ASM_OUTPUT_BSS. */
1546 /* First make the assembler name(s) global if appropriate. */
1547 if (TREE_PUBLIC (decl) && DECL_NAME (decl))
1549 #ifdef ASM_WEAKEN_LABEL
1550 if (DECL_WEAK (decl))
1552 ASM_WEAKEN_LABEL (asm_out_file, name);
1553 /* Remove this variable from the pending weak list so that
1554 we do not emit multiple .weak directives for it. */
1555 remove_from_pending_weak_list
1556 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl)));
1560 ASM_GLOBALIZE_LABEL (asm_out_file, name);
1563 for (d = equivalents; d; d = TREE_CHAIN (d))
1565 tree e = TREE_VALUE (d);
1566 if (TREE_PUBLIC (e) && DECL_NAME (e))
1567 ASM_GLOBALIZE_LABEL (asm_out_file,
1568 XSTR (XEXP (DECL_RTL (e), 0), 0));
1572 /* Output any data that we will need to use the address of. */
1573 if (DECL_INITIAL (decl) == error_mark_node)
1574 reloc = contains_pointers_p (TREE_TYPE (decl));
1575 else if (DECL_INITIAL (decl))
1576 reloc = output_addressed_constants (DECL_INITIAL (decl));
1578 #ifdef ASM_OUTPUT_SECTION_NAME
1579 if ((flag_data_sections != 0 && DECL_SECTION_NAME (decl) == NULL_TREE)
1580 || UNIQUE_SECTION_P (decl))
1581 UNIQUE_SECTION (decl, reloc);
1584 /* Switch to the appropriate section. */
1585 variable_section (decl, reloc);
1587 /* dbxout.c needs to know this. */
1588 if (in_text_section ())
1589 DECL_IN_TEXT_SECTION (decl) = 1;
1591 /* Record current section so we can restore it if dbxout.c clobbers it. */
1592 saved_in_section = in_section;
1594 /* Output the dbx info now that we have chosen the section. */
1596 #ifdef DBX_DEBUGGING_INFO
1597 /* File-scope global variables are output here. */
1598 if (write_symbols == DBX_DEBUG && top_level)
1599 dbxout_symbol (decl, 0);
1601 #ifdef SDB_DEBUGGING_INFO
1602 if (write_symbols == SDB_DEBUG && top_level
1603 /* Leave initialized global vars for end of compilation;
1604 see comment in compile_file. */
1605 && (TREE_PUBLIC (decl) == 0 || DECL_INITIAL (decl) == 0))
1606 sdbout_symbol (decl, 0);
1609 /* Don't output any DWARF debugging information for variables here.
1610 In the case of local variables, the information for them is output
1611 when we do our recursive traversal of the tree representation for
1612 the entire containing function. In the case of file-scope variables,
1613 we output information for all of them at the very end of compilation
1614 while we are doing our final traversal of the chain of file-scope
1617 /* If the debugging output changed sections, reselect the section
1618 that's supposed to be selected. */
1619 if (in_section != saved_in_section)
1620 variable_section (decl, reloc);
1622 /* Output the alignment of this data. */
1623 if (align > BITS_PER_UNIT)
1624 ASM_OUTPUT_ALIGN (asm_out_file,
1625 floor_log2 (DECL_ALIGN (decl) / BITS_PER_UNIT));
1627 /* Do any machine/system dependent processing of the object. */
1628 #ifdef ASM_DECLARE_OBJECT_NAME
1629 last_assemble_variable_decl = decl;
1630 ASM_DECLARE_OBJECT_NAME (asm_out_file, name, decl);
1632 /* Standard thing is just output label for the object. */
1633 ASM_OUTPUT_LABEL (asm_out_file, name);
1634 #endif /* ASM_DECLARE_OBJECT_NAME */
1636 if (!dont_output_data)
1638 if (DECL_INITIAL (decl))
1639 /* Output the actual data. */
1640 output_constant (DECL_INITIAL (decl),
1641 tree_low_cst (DECL_SIZE_UNIT (decl), 1));
1643 /* Leave space for it. */
1644 assemble_zeros (tree_low_cst (DECL_SIZE_UNIT (decl), 1));
1648 #ifdef XCOFF_DEBUGGING_INFO
1649 /* Unfortunately, the IBM assembler cannot handle stabx before the actual
1650 declaration. When something like ".stabx "aa:S-2",aa,133,0" is emitted
1651 and `aa' hasn't been output yet, the assembler generates a stab entry with
1652 a value of zero, in addition to creating an unnecessary external entry
1653 for `aa'. Hence, we must postpone dbxout_symbol to here at the end. */
1655 /* File-scope global variables are output here. */
1656 if (write_symbols == XCOFF_DEBUG && top_level)
1658 saved_in_section = in_section;
1660 dbxout_symbol (decl, 0);
1662 if (in_section != saved_in_section)
1663 variable_section (decl, reloc);
1666 /* There must be a statement after a label. */
1671 /* Return 1 if type TYPE contains any pointers. */
1674 contains_pointers_p (type)
1677 switch (TREE_CODE (type))
1680 case REFERENCE_TYPE:
1681 /* I'm not sure whether OFFSET_TYPE needs this treatment,
1682 so I'll play safe and return 1. */
1688 case QUAL_UNION_TYPE:
1691 /* For a type that has fields, see if the fields have pointers. */
1692 for (fields = TYPE_FIELDS (type); fields; fields = TREE_CHAIN (fields))
1693 if (TREE_CODE (fields) == FIELD_DECL
1694 && contains_pointers_p (TREE_TYPE (fields)))
1700 /* An array type contains pointers if its element type does. */
1701 return contains_pointers_p (TREE_TYPE (type));
1708 /* Output something to declare an external symbol to the assembler.
1709 (Most assemblers don't need this, so we normally output nothing.)
1710 Do nothing if DECL is not external. */
1713 assemble_external (decl)
1714 tree decl ATTRIBUTE_UNUSED;
1716 #ifdef ASM_OUTPUT_EXTERNAL
1717 if (DECL_P (decl) && DECL_EXTERNAL (decl) && TREE_PUBLIC (decl))
1719 rtx rtl = DECL_RTL (decl);
1721 if (GET_CODE (rtl) == MEM && GET_CODE (XEXP (rtl, 0)) == SYMBOL_REF
1722 && ! SYMBOL_REF_USED (XEXP (rtl, 0)))
1724 /* Some systems do require some output. */
1725 SYMBOL_REF_USED (XEXP (rtl, 0)) = 1;
1726 ASM_OUTPUT_EXTERNAL (asm_out_file, decl, XSTR (XEXP (rtl, 0), 0));
1732 /* Similar, for calling a library function FUN. */
1735 assemble_external_libcall (fun)
1736 rtx fun ATTRIBUTE_UNUSED;
1738 #ifdef ASM_OUTPUT_EXTERNAL_LIBCALL
1739 /* Declare library function name external when first used, if nec. */
1740 if (! SYMBOL_REF_USED (fun))
1742 SYMBOL_REF_USED (fun) = 1;
1743 ASM_OUTPUT_EXTERNAL_LIBCALL (asm_out_file, fun);
1748 /* Declare the label NAME global. */
1751 assemble_global (name)
1754 ASM_GLOBALIZE_LABEL (asm_out_file, name);
1757 /* Assemble a label named NAME. */
1760 assemble_label (name)
1763 ASM_OUTPUT_LABEL (asm_out_file, name);
1766 /* Output to FILE a reference to the assembler name of a C-level name NAME.
1767 If NAME starts with a *, the rest of NAME is output verbatim.
1768 Otherwise NAME is transformed in an implementation-defined way
1769 (usually by the addition of an underscore).
1770 Many macros in the tm file are defined to call this function. */
1773 assemble_name (file, name)
1777 const char *real_name;
1780 STRIP_NAME_ENCODING (real_name, name);
1781 if (flag_prefix_function_name
1782 && ! memcmp (real_name, CHKR_PREFIX, CHKR_PREFIX_SIZE))
1783 real_name = real_name + CHKR_PREFIX_SIZE;
1785 id = maybe_get_identifier (real_name);
1787 TREE_SYMBOL_REFERENCED (id) = 1;
1790 fputs (&name[1], file);
1792 ASM_OUTPUT_LABELREF (file, real_name);
1795 /* Allocate SIZE bytes writable static space with a gensym name
1796 and return an RTX to refer to its address. */
1799 assemble_static_space (size)
1803 const char *namestring;
1807 if (flag_shared_data)
1811 ASM_GENERATE_INTERNAL_LABEL (name, "LF", const_labelno);
1813 namestring = ggc_strdup (name);
1815 x = gen_rtx_SYMBOL_REF (Pmode, namestring);
1817 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
1818 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, NULL_TREE, name, size,
1821 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1822 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, BIGGEST_ALIGNMENT);
1825 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1826 so that each uninitialized object starts on such a boundary. */
1827 /* Variable `rounded' might or might not be used in ASM_OUTPUT_LOCAL. */
1828 int rounded ATTRIBUTE_UNUSED
1829 = ((size + (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1)
1830 / (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
1831 * (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
1832 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded);
1839 /* Assemble the static constant template for function entry trampolines.
1840 This is done at most once per compilation.
1841 Returns an RTX for the address of the template. */
1843 #ifdef TRAMPOLINE_TEMPLATE
1845 assemble_trampoline_template ()
1851 /* By default, put trampoline templates in read-only data section. */
1853 #ifdef TRAMPOLINE_SECTION
1854 TRAMPOLINE_SECTION ();
1856 readonly_data_section ();
1859 /* Write the assembler code to define one. */
1860 align = floor_log2 (TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT);
1862 ASM_OUTPUT_ALIGN (asm_out_file, align);
1864 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LTRAMP", 0);
1865 TRAMPOLINE_TEMPLATE (asm_out_file);
1867 /* Record the rtl to refer to it. */
1868 ASM_GENERATE_INTERNAL_LABEL (label, "LTRAMP", 0);
1869 name = ggc_strdup (label);
1870 return gen_rtx_SYMBOL_REF (Pmode, name);
1874 /* Assemble the integer constant X into an object of SIZE bytes.
1875 X must be either a CONST_INT or CONST_DOUBLE.
1877 Return 1 if we were able to output the constant, otherwise 0. If FORCE is
1878 non-zero, abort if we can't output the constant. */
1881 assemble_integer (x, size, force)
1886 /* First try to use the standard 1, 2, 4, 8, and 16 byte
1887 ASM_OUTPUT... macros. */
1891 #ifdef ASM_OUTPUT_CHAR
1893 ASM_OUTPUT_CHAR (asm_out_file, x);
1897 #ifdef ASM_OUTPUT_SHORT
1899 ASM_OUTPUT_SHORT (asm_out_file, x);
1903 #ifdef ASM_OUTPUT_INT
1905 ASM_OUTPUT_INT (asm_out_file, x);
1909 #ifdef ASM_OUTPUT_DOUBLE_INT
1911 ASM_OUTPUT_DOUBLE_INT (asm_out_file, x);
1915 #ifdef ASM_OUTPUT_QUADRUPLE_INT
1917 ASM_OUTPUT_QUADRUPLE_INT (asm_out_file, x);
1922 /* If we couldn't do it that way, there are two other possibilities: First,
1923 if the machine can output an explicit byte and this is a 1 byte constant,
1924 we can use ASM_OUTPUT_BYTE. */
1926 #ifdef ASM_OUTPUT_BYTE
1927 if (size == 1 && GET_CODE (x) == CONST_INT)
1929 ASM_OUTPUT_BYTE (asm_out_file, INTVAL (x));
1934 /* Finally, if SIZE is larger than a single word, try to output the constant
1935 one word at a time. */
1937 if (size > UNITS_PER_WORD)
1940 enum machine_mode mode
1941 = mode_for_size (size * BITS_PER_UNIT, MODE_INT, 0);
1944 for (i = 0; i < size / UNITS_PER_WORD; i++)
1946 word = operand_subword (x, i, 0, mode);
1951 if (! assemble_integer (word, UNITS_PER_WORD, 0))
1955 if (i == size / UNITS_PER_WORD)
1957 /* If we output at least one word and then could not finish,
1958 there is no valid way to continue. */
1969 /* Assemble the floating-point constant D into an object of size MODE. */
1972 assemble_real (d, mode)
1974 enum machine_mode mode;
1976 jmp_buf output_constant_handler;
1978 if (setjmp (output_constant_handler))
1980 error ("floating point trap outputting a constant");
1981 #ifdef REAL_IS_NOT_DOUBLE
1982 memset ((char *) &d, 0, sizeof d);
1989 set_float_handler (output_constant_handler);
1993 #ifdef ASM_OUTPUT_BYTE_FLOAT
1995 ASM_OUTPUT_BYTE_FLOAT (asm_out_file, d);
1998 #ifdef ASM_OUTPUT_SHORT_FLOAT
2000 ASM_OUTPUT_SHORT_FLOAT (asm_out_file, d);
2003 #ifdef ASM_OUTPUT_THREE_QUARTER_FLOAT
2005 ASM_OUTPUT_THREE_QUARTER_FLOAT (asm_out_file, d);
2008 #ifdef ASM_OUTPUT_FLOAT
2010 ASM_OUTPUT_FLOAT (asm_out_file, d);
2014 #ifdef ASM_OUTPUT_DOUBLE
2016 ASM_OUTPUT_DOUBLE (asm_out_file, d);
2020 #ifdef ASM_OUTPUT_LONG_DOUBLE
2023 ASM_OUTPUT_LONG_DOUBLE (asm_out_file, d);
2031 set_float_handler (NULL_PTR);
2034 /* Here we combine duplicate floating constants to make
2035 CONST_DOUBLE rtx's, and force those out to memory when necessary. */
2037 /* Return a CONST_DOUBLE or CONST_INT for a value specified as a pair of ints.
2038 For an integer, I0 is the low-order word and I1 is the high-order word.
2039 For a real number, I0 is the word with the low address
2040 and I1 is the word with the high address. */
2043 immed_double_const (i0, i1, mode)
2044 HOST_WIDE_INT i0, i1;
2045 enum machine_mode mode;
2049 if (GET_MODE_CLASS (mode) == MODE_INT
2050 || GET_MODE_CLASS (mode) == MODE_PARTIAL_INT)
2052 /* We clear out all bits that don't belong in MODE, unless they and our
2053 sign bit are all one. So we get either a reasonable negative value
2054 or a reasonable unsigned value for this mode. */
2055 int width = GET_MODE_BITSIZE (mode);
2056 if (width < HOST_BITS_PER_WIDE_INT
2057 && ((i0 & ((HOST_WIDE_INT) (-1) << (width - 1)))
2058 != ((HOST_WIDE_INT) (-1) << (width - 1))))
2059 i0 &= ((HOST_WIDE_INT) 1 << width) - 1, i1 = 0;
2060 else if (width == HOST_BITS_PER_WIDE_INT
2061 && ! (i1 == ~0 && i0 < 0))
2063 else if (width > 2 * HOST_BITS_PER_WIDE_INT)
2064 /* We cannot represent this value as a constant. */
2067 /* If this would be an entire word for the target, but is not for
2068 the host, then sign-extend on the host so that the number will look
2069 the same way on the host that it would on the target.
2071 For example, when building a 64 bit alpha hosted 32 bit sparc
2072 targeted compiler, then we want the 32 bit unsigned value -1 to be
2073 represented as a 64 bit value -1, and not as 0x00000000ffffffff.
2074 The later confuses the sparc backend. */
2076 if (BITS_PER_WORD < HOST_BITS_PER_WIDE_INT && BITS_PER_WORD == width
2077 && (i0 & ((HOST_WIDE_INT) 1 << (width - 1))))
2078 i0 |= ((HOST_WIDE_INT) (-1) << width);
2080 /* If MODE fits within HOST_BITS_PER_WIDE_INT, always use a CONST_INT.
2082 ??? Strictly speaking, this is wrong if we create a CONST_INT
2083 for a large unsigned constant with the size of MODE being
2084 HOST_BITS_PER_WIDE_INT and later try to interpret that constant in a
2085 wider mode. In that case we will mis-interpret it as a negative
2088 Unfortunately, the only alternative is to make a CONST_DOUBLE
2089 for any constant in any mode if it is an unsigned constant larger
2090 than the maximum signed integer in an int on the host. However,
2091 doing this will break everyone that always expects to see a CONST_INT
2092 for SImode and smaller.
2094 We have always been making CONST_INTs in this case, so nothing new
2097 if (width <= HOST_BITS_PER_WIDE_INT)
2098 i1 = (i0 < 0) ? ~(HOST_WIDE_INT) 0 : 0;
2100 /* If this integer fits in one word, return a CONST_INT. */
2101 if ((i1 == 0 && i0 >= 0)
2102 || (i1 == ~0 && i0 < 0))
2103 return GEN_INT (i0);
2105 /* We use VOIDmode for integers. */
2109 /* Search the chain for an existing CONST_DOUBLE with the right value.
2110 If one is found, return it. */
2112 for (r = const_double_chain; r; r = CONST_DOUBLE_CHAIN (r))
2113 if (CONST_DOUBLE_LOW (r) == i0 && CONST_DOUBLE_HIGH (r) == i1
2114 && GET_MODE (r) == mode)
2117 /* No; make a new one and add it to the chain. */
2118 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 (! memcmp ((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
2184 r = rtx_alloc (CONST_DOUBLE);
2186 memcpy ((char *) &CONST_DOUBLE_LOW (r), (char *) &u, sizeof u);
2188 /* If we aren't inside a function, don't put r on the
2189 const_double_chain. */
2190 if (current_function_decl != 0)
2192 CONST_DOUBLE_CHAIN (r) = const_double_chain;
2193 const_double_chain = r;
2196 CONST_DOUBLE_CHAIN (r) = NULL_RTX;
2198 /* Store const0_rtx in CONST_DOUBLE_MEM since this CONST_DOUBLE is on the
2199 chain, but has not been allocated memory. Actual use of CONST_DOUBLE_MEM
2200 is only through force_const_mem. */
2202 CONST_DOUBLE_MEM (r) = const0_rtx;
2207 /* Return a CONST_DOUBLE rtx for a value specified by EXP,
2208 which must be a REAL_CST tree node. */
2211 immed_real_const (exp)
2214 return immed_real_const_1 (TREE_REAL_CST (exp), TYPE_MODE (TREE_TYPE (exp)));
2217 /* At the end of a function, forget the memory-constants
2218 previously made for CONST_DOUBLEs. Mark them as not on real_constant_chain.
2219 Also clear out real_constant_chain and clear out all the chain-pointers. */
2222 clear_const_double_mem ()
2224 register rtx r, next;
2226 for (r = const_double_chain; r; r = next)
2228 next = CONST_DOUBLE_CHAIN (r);
2229 CONST_DOUBLE_CHAIN (r) = 0;
2230 CONST_DOUBLE_MEM (r) = cc0_rtx;
2232 const_double_chain = 0;
2235 /* Given an expression EXP with a constant value,
2236 reduce it to the sum of an assembler symbol and an integer.
2237 Store them both in the structure *VALUE.
2238 Abort if EXP does not reduce. */
2243 HOST_WIDE_INT offset;
2247 decode_addr_const (exp, value)
2249 struct addr_const *value;
2251 register tree target = TREE_OPERAND (exp, 0);
2252 register int offset = 0;
2257 if (TREE_CODE (target) == COMPONENT_REF
2258 && host_integerp (byte_position (TREE_OPERAND (target, 1)), 0))
2261 offset += int_byte_position (TREE_OPERAND (target, 1));
2262 target = TREE_OPERAND (target, 0);
2264 else if (TREE_CODE (target) == ARRAY_REF)
2266 offset += (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (target)), 1)
2267 * tree_low_cst (TREE_OPERAND (target, 1), 0));
2268 target = TREE_OPERAND (target, 0);
2274 switch (TREE_CODE (target))
2278 x = DECL_RTL (target);
2282 x = gen_rtx_MEM (FUNCTION_MODE,
2283 gen_rtx_LABEL_REF (VOIDmode,
2284 label_rtx (TREE_OPERAND (exp, 0))));
2292 x = TREE_CST_RTL (target);
2299 if (GET_CODE (x) != MEM)
2304 value->offset = offset;
2309 #ifdef ONLY_INT_FIELDS
2310 unsigned int kind : 16;
2311 unsigned int mode : 16;
2313 enum kind kind : 16;
2314 enum machine_mode mode : 16;
2317 union real_extract du;
2318 struct addr_const addr;
2319 struct {HOST_WIDE_INT high, low;} di;
2323 /* Uniquize all constants that appear in memory.
2324 Each constant in memory thus far output is recorded
2325 in `const_hash_table' with a `struct constant_descriptor'
2326 that contains a polish representation of the value of
2329 We cannot store the trees in the hash table
2330 because the trees may be temporary. */
2332 struct constant_descriptor
2334 struct constant_descriptor *next;
2337 /* Make sure the data is reasonably aligned. */
2340 unsigned char contents[1];
2341 #ifdef HAVE_LONG_DOUBLE
2350 #define MAX_HASH_TABLE 1009
2351 static struct constant_descriptor *const_hash_table[MAX_HASH_TABLE];
2353 #define STRHASH(x) ((hashval_t)((long)(x) >> 3))
2355 struct deferred_string
2362 static htab_t const_str_htab;
2364 /* Mark a const_hash_table descriptor for GC. */
2367 mark_const_hash_entry (ptr)
2370 struct constant_descriptor *desc = * (struct constant_descriptor **) ptr;
2374 ggc_mark_rtx (desc->rtl);
2379 /* Mark the hash-table element X (which is really a pointer to an
2380 struct deferred_string *). */
2383 mark_const_str_htab_1 (x, data)
2385 void *data ATTRIBUTE_UNUSED;
2387 ggc_mark_tree (((struct deferred_string *) *x)->exp);
2391 /* Mark a const_str_htab for GC. */
2394 mark_const_str_htab (htab)
2397 htab_traverse (*((htab_t *) htab), mark_const_str_htab_1, NULL);
2400 /* Returns a hash code for X (which is a really a
2401 struct deferred_string *). */
2404 const_str_htab_hash (x)
2407 return STRHASH (((const struct deferred_string *) x)->label);
2410 /* Returns non-zero if the value represented by X (which is really a
2411 struct deferred_string *) is the same as that given by Y
2412 (which is really a char *). */
2415 const_str_htab_eq (x, y)
2419 return (((const struct deferred_string *) x)->label == (const char *) y);
2422 /* Delete the hash table entry dfsp. */
2425 const_str_htab_del (dfsp)
2431 /* Compute a hash code for a constant expression. */
2437 register const char *p;
2438 register int len, hi, i;
2439 register enum tree_code code = TREE_CODE (exp);
2441 /* Either set P and LEN to the address and len of something to hash and
2442 exit the switch or return a value. */
2447 p = (char *) &TREE_INT_CST (exp);
2448 len = sizeof TREE_INT_CST (exp);
2452 p = (char *) &TREE_REAL_CST (exp);
2453 len = sizeof TREE_REAL_CST (exp);
2457 p = TREE_STRING_POINTER (exp);
2458 len = TREE_STRING_LENGTH (exp);
2462 return (const_hash (TREE_REALPART (exp)) * 5
2463 + const_hash (TREE_IMAGPART (exp)));
2466 if (TREE_CODE (TREE_TYPE (exp)) == SET_TYPE)
2470 len = int_size_in_bytes (TREE_TYPE (exp));
2471 tmp = (char *) alloca (len);
2472 get_set_constructor_bytes (exp, (unsigned char *) tmp, len);
2480 /* For record type, include the type in the hashing.
2481 We do not do so for array types
2482 because (1) the sizes of the elements are sufficient
2483 and (2) distinct array types can have the same constructor.
2484 Instead, we include the array size because the constructor could
2486 if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE)
2487 hi = ((unsigned long) TREE_TYPE (exp) & ((1 << HASHBITS) - 1))
2490 hi = ((5 + int_size_in_bytes (TREE_TYPE (exp)))
2491 & ((1 << HASHBITS) - 1)) % MAX_HASH_TABLE;
2493 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
2494 if (TREE_VALUE (link))
2496 = (hi * 603 + const_hash (TREE_VALUE (link))) % MAX_HASH_TABLE;
2503 struct addr_const value;
2505 decode_addr_const (exp, &value);
2506 if (GET_CODE (value.base) == SYMBOL_REF)
2508 /* Don't hash the address of the SYMBOL_REF;
2509 only use the offset and the symbol name. */
2511 p = XSTR (value.base, 0);
2512 for (i = 0; p[i] != 0; i++)
2513 hi = ((hi * 613) + (unsigned) (p[i]));
2515 else if (GET_CODE (value.base) == LABEL_REF)
2516 hi = value.offset + CODE_LABEL_NUMBER (XEXP (value.base, 0)) * 13;
2520 hi &= (1 << HASHBITS) - 1;
2521 hi %= MAX_HASH_TABLE;
2527 return (const_hash (TREE_OPERAND (exp, 0)) * 9
2528 + const_hash (TREE_OPERAND (exp, 1)));
2532 case NON_LVALUE_EXPR:
2533 return const_hash (TREE_OPERAND (exp, 0)) * 7 + 2;
2536 /* A language specific constant. Just hash the code. */
2537 return code % MAX_HASH_TABLE;
2540 /* Compute hashing function */
2542 for (i = 0; i < len; i++)
2543 hi = ((hi * 613) + (unsigned) (p[i]));
2545 hi &= (1 << HASHBITS) - 1;
2546 hi %= MAX_HASH_TABLE;
2550 /* Compare a constant expression EXP with a constant-descriptor DESC.
2551 Return 1 if DESC describes a constant with the same value as EXP. */
2554 compare_constant (exp, desc)
2556 struct constant_descriptor *desc;
2558 return 0 != compare_constant_1 (exp, desc->u.contents);
2561 /* Compare constant expression EXP with a substring P of a constant descriptor.
2562 If they match, return a pointer to the end of the substring matched.
2563 If they do not match, return 0.
2565 Since descriptors are written in polish prefix notation,
2566 this function can be used recursively to test one operand of EXP
2567 against a subdescriptor, and if it succeeds it returns the
2568 address of the subdescriptor for the next operand. */
2570 static const unsigned char *
2571 compare_constant_1 (exp, p)
2573 const unsigned char *p;
2575 register const unsigned char *strp;
2577 register enum tree_code code = TREE_CODE (exp);
2579 if (code != (enum tree_code) *p++)
2582 /* Either set STRP, P and LEN to pointers and length to compare and exit the
2583 switch, or return the result of the comparison. */
2588 /* Integer constants are the same only if the same width of type. */
2589 if (*p++ != TYPE_PRECISION (TREE_TYPE (exp)))
2592 strp = (unsigned char *) &TREE_INT_CST (exp);
2593 len = sizeof TREE_INT_CST (exp);
2597 /* Real constants are the same only if the same width of type. */
2598 if (*p++ != TYPE_PRECISION (TREE_TYPE (exp)))
2601 strp = (unsigned char *) &TREE_REAL_CST (exp);
2602 len = sizeof TREE_REAL_CST (exp);
2606 if (flag_writable_strings)
2609 if ((enum machine_mode) *p++ != TYPE_MODE (TREE_TYPE (exp)))
2612 strp = (const unsigned char *)TREE_STRING_POINTER (exp);
2613 len = TREE_STRING_LENGTH (exp);
2614 if (memcmp ((char *) &TREE_STRING_LENGTH (exp), p,
2615 sizeof TREE_STRING_LENGTH (exp)))
2618 p += sizeof TREE_STRING_LENGTH (exp);
2622 p = compare_constant_1 (TREE_REALPART (exp), p);
2626 return compare_constant_1 (TREE_IMAGPART (exp), p);
2629 if (TREE_CODE (TREE_TYPE (exp)) == SET_TYPE)
2631 int xlen = len = int_size_in_bytes (TREE_TYPE (exp));
2632 unsigned char *tmp = (unsigned char *) alloca (len);
2634 get_set_constructor_bytes (exp, tmp, len);
2635 strp = (unsigned char *) tmp;
2636 if (memcmp ((char *) &xlen, p, sizeof xlen))
2645 int length = list_length (CONSTRUCTOR_ELTS (exp));
2647 enum machine_mode mode = TYPE_MODE (TREE_TYPE (exp));
2648 int have_purpose = 0;
2650 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
2651 if (TREE_PURPOSE (link))
2654 if (memcmp ((char *) &length, p, sizeof length))
2659 /* For record constructors, insist that the types match.
2660 For arrays, just verify both constructors are for arrays.
2661 Then insist that either both or none have any TREE_PURPOSE
2663 if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE)
2664 type = TREE_TYPE (exp);
2668 if (memcmp ((char *) &type, p, sizeof type))
2671 if (TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE)
2673 if (memcmp ((char *) &mode, p, sizeof mode))
2681 if (memcmp ((char *) &have_purpose, p, sizeof have_purpose))
2684 p += sizeof have_purpose;
2686 /* For arrays, insist that the size in bytes match. */
2687 if (TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE)
2689 HOST_WIDE_INT size = int_size_in_bytes (TREE_TYPE (exp));
2691 if (memcmp ((char *) &size, p, sizeof size))
2697 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
2699 if (TREE_VALUE (link))
2701 if ((p = compare_constant_1 (TREE_VALUE (link), p)) == 0)
2708 if (memcmp ((char *) &zero, p, sizeof zero))
2714 if (TREE_PURPOSE (link)
2715 && TREE_CODE (TREE_PURPOSE (link)) == FIELD_DECL)
2717 if (memcmp ((char *) &TREE_PURPOSE (link), p,
2718 sizeof TREE_PURPOSE (link)))
2721 p += sizeof TREE_PURPOSE (link);
2723 else if (TREE_PURPOSE (link))
2725 if ((p = compare_constant_1 (TREE_PURPOSE (link), p)) == 0)
2728 else if (have_purpose)
2732 if (memcmp ((char *) &zero, p, sizeof zero))
2744 struct addr_const value;
2746 decode_addr_const (exp, &value);
2747 strp = (unsigned char *) &value.offset;
2748 len = sizeof value.offset;
2749 /* Compare the offset. */
2751 if (*p++ != *strp++)
2754 /* Compare symbol name. */
2755 strp = (const unsigned char *) XSTR (value.base, 0);
2756 len = strlen ((const char *) strp) + 1;
2763 p = compare_constant_1 (TREE_OPERAND (exp, 0), p);
2767 return compare_constant_1 (TREE_OPERAND (exp, 1), p);
2771 case NON_LVALUE_EXPR:
2772 return compare_constant_1 (TREE_OPERAND (exp, 0), p);
2775 if (lang_expand_constant)
2777 exp = (*lang_expand_constant) (exp);
2778 return compare_constant_1 (exp, p);
2783 /* Compare constant contents. */
2785 if (*p++ != *strp++)
2791 /* Construct a constant descriptor for the expression EXP.
2792 It is up to the caller to enter the descriptor in the hash table. */
2794 static struct constant_descriptor *
2795 record_constant (exp)
2798 struct constant_descriptor *next = 0;
2803 /* Make a struct constant_descriptor. The first three pointers will
2804 be filled in later. Here we just leave space for them. */
2806 obstack_grow (&permanent_obstack, (char *) &next, sizeof next);
2807 obstack_grow (&permanent_obstack, (char *) &label, sizeof label);
2808 obstack_grow (&permanent_obstack, (char *) &rtl, sizeof rtl);
2810 /* Align the descriptor for the data payload. */
2811 pad = (offsetof (struct constant_descriptor, u)
2812 - offsetof(struct constant_descriptor, rtl)
2813 - sizeof(next->rtl));
2815 obstack_blank (&permanent_obstack, pad);
2817 record_constant_1 (exp);
2818 return (struct constant_descriptor *) obstack_finish (&permanent_obstack);
2821 /* Add a description of constant expression EXP
2822 to the object growing in `permanent_obstack'.
2823 No need to return its address; the caller will get that
2824 from the obstack when the object is complete. */
2827 record_constant_1 (exp)
2830 register const unsigned char *strp;
2832 register enum tree_code code = TREE_CODE (exp);
2834 obstack_1grow (&permanent_obstack, (unsigned int) code);
2839 obstack_1grow (&permanent_obstack, TYPE_PRECISION (TREE_TYPE (exp)));
2840 strp = (unsigned char *) &TREE_INT_CST (exp);
2841 len = sizeof TREE_INT_CST (exp);
2845 obstack_1grow (&permanent_obstack, TYPE_PRECISION (TREE_TYPE (exp)));
2846 strp = (unsigned char *) &TREE_REAL_CST (exp);
2847 len = sizeof TREE_REAL_CST (exp);
2851 if (flag_writable_strings)
2854 obstack_1grow (&permanent_obstack, TYPE_MODE (TREE_TYPE (exp)));
2855 strp = (const unsigned char *) TREE_STRING_POINTER (exp);
2856 len = TREE_STRING_LENGTH (exp);
2857 obstack_grow (&permanent_obstack, (char *) &TREE_STRING_LENGTH (exp),
2858 sizeof TREE_STRING_LENGTH (exp));
2862 record_constant_1 (TREE_REALPART (exp));
2863 record_constant_1 (TREE_IMAGPART (exp));
2867 if (TREE_CODE (TREE_TYPE (exp)) == SET_TYPE)
2869 int nbytes = int_size_in_bytes (TREE_TYPE (exp));
2870 obstack_grow (&permanent_obstack, &nbytes, sizeof (nbytes));
2871 obstack_blank (&permanent_obstack, nbytes);
2872 get_set_constructor_bytes
2873 (exp, (unsigned char *) permanent_obstack.next_free-nbytes,
2880 int length = list_length (CONSTRUCTOR_ELTS (exp));
2881 enum machine_mode mode = TYPE_MODE (TREE_TYPE (exp));
2883 int have_purpose = 0;
2885 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
2886 if (TREE_PURPOSE (link))
2889 obstack_grow (&permanent_obstack, (char *) &length, sizeof length);
2891 /* For record constructors, insist that the types match.
2892 For arrays, just verify both constructors are for arrays
2893 of the same mode. Then insist that either both or none
2894 have any TREE_PURPOSE values. */
2895 if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE)
2896 type = TREE_TYPE (exp);
2900 obstack_grow (&permanent_obstack, (char *) &type, sizeof type);
2901 if (TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE)
2902 obstack_grow (&permanent_obstack, &mode, sizeof mode);
2904 obstack_grow (&permanent_obstack, (char *) &have_purpose,
2905 sizeof have_purpose);
2907 /* For arrays, insist that the size in bytes match. */
2908 if (TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE)
2910 HOST_WIDE_INT size = int_size_in_bytes (TREE_TYPE (exp));
2911 obstack_grow (&permanent_obstack, (char *) &size, sizeof size);
2914 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
2916 if (TREE_VALUE (link))
2917 record_constant_1 (TREE_VALUE (link));
2922 obstack_grow (&permanent_obstack,
2923 (char *) &zero, sizeof zero);
2926 if (TREE_PURPOSE (link)
2927 && TREE_CODE (TREE_PURPOSE (link)) == FIELD_DECL)
2928 obstack_grow (&permanent_obstack,
2929 (char *) &TREE_PURPOSE (link),
2930 sizeof TREE_PURPOSE (link));
2931 else if (TREE_PURPOSE (link))
2932 record_constant_1 (TREE_PURPOSE (link));
2933 else if (have_purpose)
2937 obstack_grow (&permanent_obstack,
2938 (char *) &zero, sizeof zero);
2946 struct addr_const value;
2948 decode_addr_const (exp, &value);
2949 /* Record the offset. */
2950 obstack_grow (&permanent_obstack,
2951 (char *) &value.offset, sizeof value.offset);
2953 switch (GET_CODE (value.base))
2956 /* Record the symbol name. */
2957 obstack_grow (&permanent_obstack, XSTR (value.base, 0),
2958 strlen (XSTR (value.base, 0)) + 1);
2961 /* Record the address of the CODE_LABEL. It may not have
2962 been emitted yet, so it's UID may be zero. But pointer
2963 identity is good enough. */
2964 obstack_grow (&permanent_obstack, &XEXP (value.base, 0),
2976 record_constant_1 (TREE_OPERAND (exp, 0));
2977 record_constant_1 (TREE_OPERAND (exp, 1));
2982 case NON_LVALUE_EXPR:
2983 record_constant_1 (TREE_OPERAND (exp, 0));
2987 if (lang_expand_constant)
2989 exp = (*lang_expand_constant) (exp);
2990 record_constant_1 (exp);
2995 /* Record constant contents. */
2996 obstack_grow (&permanent_obstack, strp, len);
2999 /* Record a list of constant expressions that were passed to
3000 output_constant_def but that could not be output right away. */
3002 struct deferred_constant
3004 struct deferred_constant *next;
3010 static struct deferred_constant *deferred_constants;
3012 /* Another list of constants which should be output after the
3014 static struct deferred_constant *after_function_constants;
3016 /* Nonzero means defer output of addressed subconstants
3017 (i.e., those for which output_constant_def is called.) */
3018 static int defer_addressed_constants_flag;
3020 /* Start deferring output of subconstants. */
3023 defer_addressed_constants ()
3025 defer_addressed_constants_flag++;
3028 /* Stop deferring output of subconstants,
3029 and output now all those that have been deferred. */
3032 output_deferred_addressed_constants ()
3034 struct deferred_constant *p, *next;
3036 defer_addressed_constants_flag--;
3038 if (defer_addressed_constants_flag > 0)
3041 for (p = deferred_constants; p; p = next)
3043 output_constant_def_contents (p->exp, p->reloc, p->labelno);
3048 deferred_constants = 0;
3051 /* Output any constants which should appear after a function. */
3054 output_after_function_constants ()
3056 struct deferred_constant *p, *next;
3058 for (p = after_function_constants; p; p = next)
3060 output_constant_def_contents (p->exp, p->reloc, p->labelno);
3065 after_function_constants = 0;
3068 /* Make a copy of the whole tree structure for a constant.
3069 This handles the same types of nodes that compare_constant
3070 and record_constant handle. */
3076 switch (TREE_CODE (exp))
3079 /* For ADDR_EXPR, we do not want to copy the decl whose address
3080 is requested. We do want to copy constants though. */
3081 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, 0))) == 'c')
3082 return build1 (TREE_CODE (exp), TREE_TYPE (exp),
3083 copy_constant (TREE_OPERAND (exp, 0)));
3085 return copy_node (exp);
3090 return copy_node (exp);
3093 return build_complex (TREE_TYPE (exp),
3094 copy_constant (TREE_REALPART (exp)),
3095 copy_constant (TREE_IMAGPART (exp)));
3099 return build (TREE_CODE (exp), TREE_TYPE (exp),
3100 copy_constant (TREE_OPERAND (exp, 0)),
3101 copy_constant (TREE_OPERAND (exp, 1)));
3105 case NON_LVALUE_EXPR:
3106 return build1 (TREE_CODE (exp), TREE_TYPE (exp),
3107 copy_constant (TREE_OPERAND (exp, 0)));
3111 tree copy = copy_node (exp);
3112 tree list = copy_list (CONSTRUCTOR_ELTS (exp));
3115 CONSTRUCTOR_ELTS (copy) = list;
3116 for (tail = list; tail; tail = TREE_CHAIN (tail))
3117 TREE_VALUE (tail) = copy_constant (TREE_VALUE (tail));
3118 if (TREE_CODE (TREE_TYPE (exp)) == SET_TYPE)
3119 for (tail = list; tail; tail = TREE_CHAIN (tail))
3120 TREE_PURPOSE (tail) = copy_constant (TREE_PURPOSE (tail));
3130 /* Return an rtx representing a reference to constant data in memory
3131 for the constant expression EXP.
3133 If assembler code for such a constant has already been output,
3134 return an rtx to refer to it.
3135 Otherwise, output such a constant in memory (or defer it for later)
3136 and generate an rtx for it.
3138 If DEFER is non-zero, the output of string constants can be deferred
3139 and output only if referenced in the function after all optimizations.
3141 The TREE_CST_RTL of EXP is set up to point to that rtx.
3142 The const_hash_table records which constants already have label strings. */
3145 output_constant_def (exp, defer)
3150 register struct constant_descriptor *desc;
3151 struct deferred_string **defstr;
3155 int after_function = 0;
3158 if (TREE_CST_RTL (exp))
3159 return TREE_CST_RTL (exp);
3161 /* Make sure any other constants whose addresses appear in EXP
3162 are assigned label numbers. */
3164 reloc = output_addressed_constants (exp);
3166 /* Compute hash code of EXP. Search the descriptors for that hash code
3167 to see if any of them describes EXP. If yes, the descriptor records
3168 the label number already assigned. */
3170 hash = const_hash (exp) % MAX_HASH_TABLE;
3172 for (desc = const_hash_table[hash]; desc; desc = desc->next)
3173 if (compare_constant (exp, desc))
3178 /* No constant equal to EXP is known to have been output.
3179 Make a constant descriptor to enter EXP in the hash table.
3180 Assign the label number and record it in the descriptor for
3181 future calls to this function to find. */
3183 /* Create a string containing the label name, in LABEL. */
3184 labelno = const_labelno++;
3185 ASM_GENERATE_INTERNAL_LABEL (label, "LC", labelno);
3187 desc = record_constant (exp);
3188 desc->next = const_hash_table[hash];
3189 desc->label = ggc_strdup (label);
3190 const_hash_table[hash] = desc;
3192 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
3194 = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp)),
3195 gen_rtx_SYMBOL_REF (Pmode, desc->label));
3197 set_mem_attributes (desc->rtl, exp, 1);
3202 TREE_CST_RTL (exp) = desc->rtl;
3204 /* Optionally set flags or add text to the name to record information
3205 such as that it is a function name. If the name is changed, the macro
3206 ASM_OUTPUT_LABELREF will have to know how to strip this information. */
3207 #ifdef ENCODE_SECTION_INFO
3208 /* A previously-processed constant would already have section info
3212 ENCODE_SECTION_INFO (exp);
3213 desc->rtl = TREE_CST_RTL (exp);
3214 desc->label = XSTR (XEXP (desc->rtl, 0), 0);
3218 #ifdef CONSTANT_AFTER_FUNCTION_P
3219 if (current_function_decl != 0
3220 && CONSTANT_AFTER_FUNCTION_P (exp))
3225 && STRING_POOL_ADDRESS_P (XEXP (desc->rtl, 0))
3226 && (!defer || defer_addressed_constants_flag || after_function))
3228 defstr = (struct deferred_string **)
3229 htab_find_slot_with_hash (const_str_htab, desc->label,
3230 STRHASH (desc->label), NO_INSERT);
3233 /* If the string is currently deferred but we need to output it now,
3234 remove it from deferred string hash table. */
3236 labelno = (*defstr)->labelno;
3237 STRING_POOL_ADDRESS_P (XEXP (desc->rtl, 0)) = 0;
3238 htab_clear_slot (const_str_htab, (void **) defstr);
3242 /* If this is the first time we've seen this particular constant,
3243 output it (or defer its output for later). */
3246 if (defer_addressed_constants_flag || after_function)
3248 struct deferred_constant *p;
3249 p = (struct deferred_constant *) xmalloc (sizeof (struct deferred_constant));
3251 p->exp = copy_constant (exp);
3253 p->labelno = labelno;
3256 p->next = after_function_constants;
3257 after_function_constants = p;
3261 p->next = deferred_constants;
3262 deferred_constants = p;
3267 /* Do no output if -fsyntax-only. */
3268 if (! flag_syntax_only)
3270 if (TREE_CODE (exp) != STRING_CST
3272 || flag_writable_strings
3273 || (defstr = (struct deferred_string **)
3274 htab_find_slot_with_hash (const_str_htab,
3276 STRHASH (desc->label),
3278 output_constant_def_contents (exp, reloc, labelno);
3281 struct deferred_string *p;
3283 p = (struct deferred_string *)
3284 xmalloc (sizeof (struct deferred_string));
3286 p->exp = copy_constant (exp);
3287 p->label = desc->label;
3288 p->labelno = labelno;
3290 STRING_POOL_ADDRESS_P (XEXP (desc->rtl, 0)) = 1;
3296 return TREE_CST_RTL (exp);
3299 /* Now output assembler code to define the label for EXP,
3300 and follow it with the data of EXP. */
3303 output_constant_def_contents (exp, reloc, labelno)
3310 if (IN_NAMED_SECTION (exp))
3311 named_section (exp, NULL, reloc);
3314 /* First switch to text section, except for writable strings. */
3315 #ifdef SELECT_SECTION
3316 SELECT_SECTION (exp, reloc);
3318 if (((TREE_CODE (exp) == STRING_CST) && flag_writable_strings)
3319 || (flag_pic && reloc))
3322 readonly_data_section ();
3326 /* Align the location counter as required by EXP's data type. */
3327 align = TYPE_ALIGN (TREE_TYPE (exp));
3328 #ifdef CONSTANT_ALIGNMENT
3329 align = CONSTANT_ALIGNMENT (exp, align);
3332 if (align > BITS_PER_UNIT)
3333 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
3335 /* Output the label itself. */
3336 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LC", labelno);
3338 /* Output the value of EXP. */
3339 output_constant (exp,
3340 (TREE_CODE (exp) == STRING_CST
3341 ? TREE_STRING_LENGTH (exp)
3342 : int_size_in_bytes (TREE_TYPE (exp))));
3346 /* Structure to represent sufficient information about a constant so that
3347 it can be output when the constant pool is output, so that function
3348 integration can be done, and to simplify handling on machines that reference
3349 constant pool as base+displacement. */
3351 struct pool_constant
3353 struct constant_descriptor *desc;
3354 struct pool_constant *next, *next_sym;
3357 enum machine_mode mode;
3364 /* Hash code for a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true.
3365 The argument is XSTR (... , 0) */
3367 #define SYMHASH(LABEL) \
3368 ((((unsigned long) (LABEL)) & ((1 << HASHBITS) - 1)) % MAX_RTX_HASH_TABLE)
3370 /* Initialize constant pool hashing for a new function. */
3373 init_varasm_status (f)
3376 struct varasm_status *p;
3377 p = (struct varasm_status *) xmalloc (sizeof (struct varasm_status));
3379 p->x_const_rtx_hash_table
3380 = ((struct constant_descriptor **)
3381 xcalloc (MAX_RTX_HASH_TABLE, sizeof (struct constant_descriptor *)));
3382 p->x_const_rtx_sym_hash_table
3383 = ((struct pool_constant **)
3384 xcalloc (MAX_RTX_HASH_TABLE, sizeof (struct pool_constant *)));
3386 p->x_first_pool = p->x_last_pool = 0;
3387 p->x_pool_offset = 0;
3388 p->x_const_double_chain = 0;
3391 /* Mark PC for GC. */
3394 mark_pool_constant (pc)
3395 struct pool_constant *pc;
3400 ggc_mark_rtx (pc->constant);
3405 /* Mark P for GC. */
3408 mark_varasm_status (p)
3409 struct varasm_status *p;
3414 mark_pool_constant (p->x_first_pool);
3415 ggc_mark_rtx (p->x_const_double_chain);
3418 /* Clear out all parts of the state in F that can safely be discarded
3419 after the function has been compiled, to let garbage collection
3420 reclaim the memory. */
3423 free_varasm_status (f)
3426 struct varasm_status *p;
3431 /* Clear out the hash tables. */
3432 for (i = 0; i < MAX_RTX_HASH_TABLE; ++i)
3434 struct constant_descriptor* cd;
3436 cd = p->x_const_rtx_hash_table[i];
3438 struct constant_descriptor* next = cd->next;
3444 free (p->x_const_rtx_hash_table);
3445 free (p->x_const_rtx_sym_hash_table);
3450 enum kind { RTX_DOUBLE, RTX_INT };
3452 /* Express an rtx for a constant integer (perhaps symbolic)
3453 as the sum of a symbol or label plus an explicit integer.
3454 They are stored into VALUE. */
3457 decode_rtx_const (mode, x, value)
3458 enum machine_mode mode;
3460 struct rtx_const *value;
3462 /* Clear the whole structure, including any gaps. */
3463 memset (value, 0, sizeof (struct rtx_const));
3465 value->kind = RTX_INT; /* Most usual kind. */
3468 switch (GET_CODE (x))
3471 value->kind = RTX_DOUBLE;
3472 if (GET_MODE (x) != VOIDmode)
3474 value->mode = GET_MODE (x);
3475 memcpy ((char *) &value->un.du,
3476 (char *) &CONST_DOUBLE_LOW (x), sizeof value->un.du);
3480 value->un.di.low = CONST_DOUBLE_LOW (x);
3481 value->un.di.high = CONST_DOUBLE_HIGH (x);
3486 value->un.addr.offset = INTVAL (x);
3492 value->un.addr.base = x;
3497 if (GET_CODE (x) == PLUS && GET_CODE (XEXP (x, 1)) == CONST_INT)
3499 value->un.addr.base = XEXP (x, 0);
3500 value->un.addr.offset = INTVAL (XEXP (x, 1));
3502 else if (GET_CODE (x) == MINUS && GET_CODE (XEXP (x, 1)) == CONST_INT)
3504 value->un.addr.base = XEXP (x, 0);
3505 value->un.addr.offset = - INTVAL (XEXP (x, 1));
3509 value->un.addr.base = x;
3510 value->un.addr.offset = 0;
3518 if (value->kind == RTX_INT && value->un.addr.base != 0)
3519 switch (GET_CODE (value->un.addr.base))
3522 /* Use the string's address, not the SYMBOL_REF's address,
3523 for the sake of addresses of library routines. */
3524 value->un.addr.base = (rtx) XSTR (value->un.addr.base, 0);
3528 /* For a LABEL_REF, compare labels. */
3529 value->un.addr.base = XEXP (value->un.addr.base, 0);
3536 /* Given a MINUS expression, simplify it if both sides
3537 include the same symbol. */
3540 simplify_subtraction (x)
3543 struct rtx_const val0, val1;
3545 decode_rtx_const (GET_MODE (x), XEXP (x, 0), &val0);
3546 decode_rtx_const (GET_MODE (x), XEXP (x, 1), &val1);
3548 if (val0.un.addr.base == val1.un.addr.base)
3549 return GEN_INT (val0.un.addr.offset - val1.un.addr.offset);
3553 /* Compute a hash code for a constant RTL expression. */
3556 const_hash_rtx (mode, x)
3557 enum machine_mode mode;
3563 struct rtx_const value;
3564 decode_rtx_const (mode, x, &value);
3566 /* Compute hashing function */
3568 for (i = 0; i < sizeof value / sizeof (int); i++)
3569 hi += ((int *) &value)[i];
3571 hi &= (1 << HASHBITS) - 1;
3572 hi %= MAX_RTX_HASH_TABLE;
3576 /* Compare a constant rtl object X with a constant-descriptor DESC.
3577 Return 1 if DESC describes a constant with the same value as X. */
3580 compare_constant_rtx (mode, x, desc)
3581 enum machine_mode mode;
3583 struct constant_descriptor *desc;
3585 register int *p = (int *) desc->u.contents;
3588 struct rtx_const value;
3590 decode_rtx_const (mode, x, &value);
3591 strp = (int *) &value;
3592 len = sizeof value / sizeof (int);
3594 /* Compare constant contents. */
3596 if (*p++ != *strp++)
3602 /* Construct a constant descriptor for the rtl-expression X.
3603 It is up to the caller to enter the descriptor in the hash table. */
3605 static struct constant_descriptor *
3606 record_constant_rtx (mode, x)
3607 enum machine_mode mode;
3610 struct constant_descriptor *ptr;
3612 ptr = ((struct constant_descriptor *)
3613 xcalloc (1, (offsetof (struct constant_descriptor, u)
3614 + sizeof (struct rtx_const))));
3615 decode_rtx_const (mode, x, (struct rtx_const *) ptr->u.contents);
3620 /* Given a constant rtx X, make (or find) a memory constant for its value
3621 and return a MEM rtx to refer to it in memory. */
3624 force_const_mem (mode, x)
3625 enum machine_mode mode;
3629 register struct constant_descriptor *desc;
3631 const char *found = 0;
3634 /* If we want this CONST_DOUBLE in the same mode as it is in memory
3635 (this will always be true for floating CONST_DOUBLEs that have been
3636 placed in memory, but not for VOIDmode (integer) CONST_DOUBLEs),
3637 use the previous copy. Otherwise, make a new one. Note that in
3638 the unlikely event that this same CONST_DOUBLE is used in two different
3639 modes in an alternating fashion, we will allocate a lot of different
3640 memory locations, but this should be extremely rare. */
3642 if (GET_CODE (x) == CONST_DOUBLE
3643 && GET_CODE (CONST_DOUBLE_MEM (x)) == MEM
3644 && GET_MODE (CONST_DOUBLE_MEM (x)) == mode)
3645 return CONST_DOUBLE_MEM (x);
3647 /* Compute hash code of X. Search the descriptors for that hash code
3648 to see if any of them describes X. If yes, the descriptor records
3649 the label number already assigned. */
3651 hash = const_hash_rtx (mode, x);
3653 for (desc = const_rtx_hash_table[hash]; desc; desc = desc->next)
3654 if (compare_constant_rtx (mode, x, desc))
3656 found = desc->label;
3662 register struct pool_constant *pool;
3665 /* No constant equal to X is known to have been output.
3666 Make a constant descriptor to enter X in the hash table.
3667 Assign the label number and record it in the descriptor for
3668 future calls to this function to find. */
3670 desc = record_constant_rtx (mode, x);
3671 desc->next = const_rtx_hash_table[hash];
3672 const_rtx_hash_table[hash] = desc;
3674 /* Align the location counter as required by EXP's data type. */
3675 align = (mode == VOIDmode) ? UNITS_PER_WORD : GET_MODE_SIZE (mode);
3676 if (align > BIGGEST_ALIGNMENT / BITS_PER_UNIT)
3677 align = BIGGEST_ALIGNMENT / BITS_PER_UNIT;
3678 #ifdef CONSTANT_ALIGNMENT
3679 align = CONSTANT_ALIGNMENT (make_tree (type_for_mode (mode, 0), x),
3680 align * BITS_PER_UNIT) / BITS_PER_UNIT;
3683 pool_offset += align - 1;
3684 pool_offset &= ~ (align - 1);
3686 /* Allocate a pool constant descriptor, fill it in, and chain it in. */
3688 pool = (struct pool_constant *) ggc_alloc (sizeof (struct pool_constant));
3692 pool->labelno = const_labelno;
3693 pool->align = align;
3694 pool->offset = pool_offset;
3701 last_pool->next = pool;
3704 pool_offset += GET_MODE_SIZE (mode);
3706 /* Create a string containing the label name, in LABEL. */
3707 ASM_GENERATE_INTERNAL_LABEL (label, "LC", const_labelno);
3711 desc->label = found = ggc_strdup (label);
3713 /* Add label to symbol hash table. */
3714 hash = SYMHASH (found);
3715 pool->label = found;
3716 pool->next_sym = const_rtx_sym_hash_table[hash];
3717 const_rtx_sym_hash_table[hash] = pool;
3720 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
3722 def = gen_rtx_MEM (mode, gen_rtx_SYMBOL_REF (Pmode, found));
3723 set_mem_attributes (def, type_for_mode (mode, 0), 1);
3724 RTX_UNCHANGING_P (def) = 1;
3726 /* Mark the symbol_ref as belonging to this constants pool. */
3727 CONSTANT_POOL_ADDRESS_P (XEXP (def, 0)) = 1;
3728 current_function_uses_const_pool = 1;
3730 if (GET_CODE (x) == CONST_DOUBLE)
3732 if (CONST_DOUBLE_MEM (x) == cc0_rtx)
3734 CONST_DOUBLE_CHAIN (x) = const_double_chain;
3735 const_double_chain = x;
3737 CONST_DOUBLE_MEM (x) = def;
3743 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
3744 the corresponding pool_constant structure. */
3746 static struct pool_constant *
3747 find_pool_constant (f, addr)
3751 struct pool_constant *pool;
3752 const char *label = XSTR (addr, 0);
3754 for (pool = f->varasm->x_const_rtx_sym_hash_table[SYMHASH (label)]; pool;
3755 pool = pool->next_sym)
3756 if (pool->label == label)
3762 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
3765 get_pool_constant (addr)
3768 return (find_pool_constant (cfun, addr))->constant;
3771 /* Likewise, but for the constant pool of a specific function. */
3774 get_pool_constant_for_function (f, addr)
3778 return (find_pool_constant (f, addr))->constant;
3781 /* Similar, return the mode. */
3784 get_pool_mode (addr)
3787 return (find_pool_constant (cfun, addr))->mode;
3791 get_pool_mode_for_function (f, addr)
3795 return (find_pool_constant (f, addr))->mode;
3798 /* Similar, return the offset in the constant pool. */
3801 get_pool_offset (addr)
3804 return (find_pool_constant (cfun, addr))->offset;
3807 /* Return the size of the constant pool. */
3815 /* Write all the constants in the constant pool. */
3818 output_constant_pool (fnname, fndecl)
3819 const char *fnname ATTRIBUTE_UNUSED;
3820 tree fndecl ATTRIBUTE_UNUSED;
3822 struct pool_constant *pool;
3824 union real_extract u;
3826 /* It is possible for gcc to call force_const_mem and then to later
3827 discard the instructions which refer to the constant. In such a
3828 case we do not need to output the constant. */
3829 mark_constant_pool ();
3831 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3832 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file, fnname, fndecl, pool_offset);
3835 for (pool = first_pool; pool; pool = pool->next)
3844 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3845 whose CODE_LABEL has been deleted. This can occur if a jump table
3846 is eliminated by optimization. If so, write a constant of zero
3847 instead. Note that this can also happen by turning the
3848 CODE_LABEL into a NOTE. */
3849 /* ??? This seems completely and utterly wrong. Certainly it's
3850 not true for NOTE_INSN_DELETED_LABEL, but I disbelieve proper
3851 functioning even with INSN_DELETED_P and friends. */
3854 switch (GET_CODE (x))
3857 if (GET_CODE (XEXP (x, 0)) != PLUS
3858 || GET_CODE (XEXP (XEXP (x, 0), 0)) != LABEL_REF)
3860 tmp = XEXP (XEXP (x, 0), 0);
3865 if (INSN_DELETED_P (tmp)
3866 || (GET_CODE (tmp) == NOTE
3867 && NOTE_LINE_NUMBER (tmp) == NOTE_INSN_DELETED))
3878 /* First switch to correct section. */
3879 #ifdef SELECT_RTX_SECTION
3880 SELECT_RTX_SECTION (pool->mode, x);
3882 readonly_data_section ();
3885 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3886 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file, x, pool->mode,
3887 pool->align, pool->labelno, done);
3890 if (pool->align > 1)
3891 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (pool->align));
3893 /* Output the label. */
3894 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LC", pool->labelno);
3896 /* Output the value of the constant itself. */
3897 switch (GET_MODE_CLASS (pool->mode))
3900 if (GET_CODE (x) != CONST_DOUBLE)
3903 memcpy ((char *) &u, (char *) &CONST_DOUBLE_LOW (x), sizeof u);
3904 assemble_real (u.d, pool->mode);
3908 case MODE_PARTIAL_INT:
3909 assemble_integer (x, GET_MODE_SIZE (pool->mode), 1);
3916 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3922 #ifdef ASM_OUTPUT_POOL_EPILOGUE
3923 ASM_OUTPUT_POOL_EPILOGUE (asm_out_file, fnname, fndecl, pool_offset);
3926 /* Done with this pool. */
3927 first_pool = last_pool = 0;
3930 /* Look through the instructions for this function, and mark all the
3931 entries in the constant pool which are actually being used.
3932 Emit used deferred strings. */
3935 mark_constant_pool ()
3938 struct pool_constant *pool;
3940 if (first_pool == 0 && htab_elements (const_str_htab) == 0)
3943 for (pool = first_pool; pool; pool = pool->next)
3946 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
3948 mark_constants (PATTERN (insn));
3950 for (insn = current_function_epilogue_delay_list;
3952 insn = XEXP (insn, 1))
3954 mark_constants (PATTERN (insn));
3957 /* Look through appropriate parts of X, marking all entries in the
3958 constant pool which are actually being used. Entries that are only
3959 referenced by other constants are also marked as used. Emit
3960 deferred strings that are used. */
3967 register const char *format_ptr;
3972 if (GET_CODE (x) == SYMBOL_REF)
3974 mark_constant (&x, NULL);
3977 /* Never search inside a CONST_DOUBLE, because CONST_DOUBLE_MEM may be
3978 a MEM, but does not constitute a use of that MEM. */
3979 else if (GET_CODE (x) == CONST_DOUBLE)
3982 /* Insns may appear inside a SEQUENCE. Only check the patterns of
3983 insns, not any notes that may be attached. We don't want to mark
3984 a constant just because it happens to appear in a REG_EQUIV note. */
3987 mark_constants (PATTERN (x));
3991 format_ptr = GET_RTX_FORMAT (GET_CODE (x));
3993 for (i = 0; i < GET_RTX_LENGTH (GET_CODE (x)); i++)
3995 switch (*format_ptr++)
3998 mark_constants (XEXP (x, i));
4002 if (XVEC (x, i) != 0)
4006 for (j = 0; j < XVECLEN (x, i); j++)
4007 mark_constants (XVECEXP (x, i, j));
4026 /* Given a SYMBOL_REF CURRENT_RTX, mark it and all constants it refers
4027 to as used. Emit referenced deferred strings. This function can
4028 be used with for_each_rtx () to mark all SYMBOL_REFs in an rtx. */
4031 mark_constant (current_rtx, data)
4033 void *data ATTRIBUTE_UNUSED;
4035 rtx x = *current_rtx;
4039 else if (GET_CODE(x) == CONST_DOUBLE)
4040 /* Never search inside a CONST_DOUBLE because CONST_DOUBLE_MEM may
4041 be a MEM but does not constitute a use of that MEM. */
4043 else if (GET_CODE (x) == SYMBOL_REF)
4045 if (CONSTANT_POOL_ADDRESS_P (x))
4047 struct pool_constant *pool = find_pool_constant (cfun, x);
4048 if (pool->mark == 0) {
4050 for_each_rtx (&(pool->constant), &mark_constant, NULL);
4055 else if (STRING_POOL_ADDRESS_P (x))
4057 struct deferred_string **defstr;
4059 defstr = (struct deferred_string **)
4060 htab_find_slot_with_hash (const_str_htab, XSTR (x, 0),
4061 STRHASH (XSTR (x, 0)), NO_INSERT);
4064 struct deferred_string *p = *defstr;
4066 STRING_POOL_ADDRESS_P (x) = 0;
4067 output_constant_def_contents (p->exp, 0, p->labelno);
4068 htab_clear_slot (const_str_htab, (void **) defstr);
4075 /* Find all the constants whose addresses are referenced inside of EXP,
4076 and make sure assembler code with a label has been output for each one.
4077 Indicate whether an ADDR_EXPR has been encountered. */
4080 output_addressed_constants (exp)
4085 /* Give the front-end a chance to convert VALUE to something that
4086 looks more like a constant to the back-end. */
4087 if (lang_expand_constant)
4088 exp = (*lang_expand_constant) (exp);
4090 switch (TREE_CODE (exp))
4094 register tree constant = TREE_OPERAND (exp, 0);
4096 while (TREE_CODE (constant) == COMPONENT_REF)
4098 constant = TREE_OPERAND (constant, 0);
4101 if (TREE_CODE_CLASS (TREE_CODE (constant)) == 'c'
4102 || TREE_CODE (constant) == CONSTRUCTOR)
4103 /* No need to do anything here
4104 for addresses of variables or functions. */
4105 output_constant_def (constant, 0);
4112 reloc = output_addressed_constants (TREE_OPERAND (exp, 0));
4113 reloc |= output_addressed_constants (TREE_OPERAND (exp, 1));
4118 case NON_LVALUE_EXPR:
4119 reloc = output_addressed_constants (TREE_OPERAND (exp, 0));
4125 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
4126 if (TREE_VALUE (link) != 0)
4127 reloc |= output_addressed_constants (TREE_VALUE (link));
4137 /* Return nonzero if VALUE is a valid constant-valued expression
4138 for use in initializing a static variable; one that can be an
4139 element of a "constant" initializer.
4141 Return null_pointer_node if the value is absolute;
4142 if it is relocatable, return the variable that determines the relocation.
4143 We assume that VALUE has been folded as much as possible;
4144 therefore, we do not need to check for such things as
4145 arithmetic-combinations of integers. */
4148 initializer_constant_valid_p (value, endtype)
4152 /* Give the front-end a chance to convert VALUE to something that
4153 looks more like a constant to the back-end. */
4154 if (lang_expand_constant)
4155 value = (*lang_expand_constant) (value);
4157 switch (TREE_CODE (value))
4160 if ((TREE_CODE (TREE_TYPE (value)) == UNION_TYPE
4161 || TREE_CODE (TREE_TYPE (value)) == RECORD_TYPE)
4162 && TREE_CONSTANT (value)
4163 && CONSTRUCTOR_ELTS (value))
4165 initializer_constant_valid_p (TREE_VALUE (CONSTRUCTOR_ELTS (value)),
4168 return TREE_STATIC (value) ? null_pointer_node : 0;
4174 return null_pointer_node;
4177 return staticp (TREE_OPERAND (value, 0)) ? TREE_OPERAND (value, 0) : 0;
4179 case NON_LVALUE_EXPR:
4180 return initializer_constant_valid_p (TREE_OPERAND (value, 0), endtype);
4184 /* Allow conversions between pointer types. */
4185 if (POINTER_TYPE_P (TREE_TYPE (value))
4186 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0))))
4187 return initializer_constant_valid_p (TREE_OPERAND (value, 0), endtype);
4189 /* Allow conversions between real types. */
4190 if (FLOAT_TYPE_P (TREE_TYPE (value))
4191 && FLOAT_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0))))
4192 return initializer_constant_valid_p (TREE_OPERAND (value, 0), endtype);
4194 /* Allow length-preserving conversions between integer types. */
4195 if (INTEGRAL_TYPE_P (TREE_TYPE (value))
4196 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0)))
4197 && (TYPE_PRECISION (TREE_TYPE (value))
4198 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value, 0)))))
4199 return initializer_constant_valid_p (TREE_OPERAND (value, 0), endtype);
4201 /* Allow conversions between other integer types only if
4203 if (INTEGRAL_TYPE_P (TREE_TYPE (value))
4204 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0))))
4206 tree inner = initializer_constant_valid_p (TREE_OPERAND (value, 0),
4208 if (inner == null_pointer_node)
4209 return null_pointer_node;
4213 /* Allow (int) &foo provided int is as wide as a pointer. */
4214 if (INTEGRAL_TYPE_P (TREE_TYPE (value))
4215 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0)))
4216 && (TYPE_PRECISION (TREE_TYPE (value))
4217 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value, 0)))))
4218 return initializer_constant_valid_p (TREE_OPERAND (value, 0),
4221 /* Likewise conversions from int to pointers, but also allow
4222 conversions from 0. */
4223 if (POINTER_TYPE_P (TREE_TYPE (value))
4224 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0))))
4226 if (integer_zerop (TREE_OPERAND (value, 0)))
4227 return null_pointer_node;
4228 else if (TYPE_PRECISION (TREE_TYPE (value))
4229 <= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value, 0))))
4230 return initializer_constant_valid_p (TREE_OPERAND (value, 0),
4234 /* Allow conversions to union types if the value inside is okay. */
4235 if (TREE_CODE (TREE_TYPE (value)) == UNION_TYPE)
4236 return initializer_constant_valid_p (TREE_OPERAND (value, 0),
4241 if (! INTEGRAL_TYPE_P (endtype)
4242 || TYPE_PRECISION (endtype) >= POINTER_SIZE)
4244 tree valid0 = initializer_constant_valid_p (TREE_OPERAND (value, 0),
4246 tree valid1 = initializer_constant_valid_p (TREE_OPERAND (value, 1),
4248 /* If either term is absolute, use the other terms relocation. */
4249 if (valid0 == null_pointer_node)
4251 if (valid1 == null_pointer_node)
4257 if (! INTEGRAL_TYPE_P (endtype)
4258 || TYPE_PRECISION (endtype) >= POINTER_SIZE)
4260 tree valid0 = initializer_constant_valid_p (TREE_OPERAND (value, 0),
4262 tree valid1 = initializer_constant_valid_p (TREE_OPERAND (value, 1),
4264 /* Win if second argument is absolute. */
4265 if (valid1 == null_pointer_node)
4267 /* Win if both arguments have the same relocation.
4268 Then the value is absolute. */
4269 if (valid0 == valid1 && valid0 != 0)
4270 return null_pointer_node;
4272 /* Since GCC guarantees that string constants are unique in the
4273 generated code, a subtraction between two copies of the same
4274 constant string is absolute. */
4275 if (valid0 && TREE_CODE (valid0) == STRING_CST &&
4276 valid1 && TREE_CODE (valid1) == STRING_CST &&
4277 TREE_STRING_POINTER (valid0) == TREE_STRING_POINTER (valid1))
4278 return null_pointer_node;
4281 /* Support differences between labels. */
4282 if (INTEGRAL_TYPE_P (endtype))
4285 op0 = TREE_OPERAND (value, 0);
4286 op1 = TREE_OPERAND (value, 1);
4290 if (TREE_CODE (op0) == ADDR_EXPR
4291 && TREE_CODE (TREE_OPERAND (op0, 0)) == LABEL_DECL
4292 && TREE_CODE (op1) == ADDR_EXPR
4293 && TREE_CODE (TREE_OPERAND (op1, 0)) == LABEL_DECL)
4294 return null_pointer_node;
4305 /* Output assembler code for constant EXP to FILE, with no label.
4306 This includes the pseudo-op such as ".int" or ".byte", and a newline.
4307 Assumes output_addressed_constants has been done on EXP already.
4309 Generate exactly SIZE bytes of assembler data, padding at the end
4310 with zeros if necessary. SIZE must always be specified.
4312 SIZE is important for structure constructors,
4313 since trailing members may have been omitted from the constructor.
4314 It is also important for initialization of arrays from string constants
4315 since the full length of the string constant might not be wanted.
4316 It is also needed for initialization of unions, where the initializer's
4317 type is just one member, and that may not be as long as the union.
4319 There a case in which we would fail to output exactly SIZE bytes:
4320 for a structure constructor that wants to produce more than SIZE bytes.
4321 But such constructors will never be generated for any possible input. */
4324 output_constant (exp, size)
4328 register enum tree_code code = TREE_CODE (TREE_TYPE (exp));
4330 /* Some front-ends use constants other than the standard
4331 language-indepdent varieties, but which may still be output
4332 directly. Give the front-end a chance to convert EXP to a
4333 language-independent representation. */
4334 if (lang_expand_constant)
4335 exp = (*lang_expand_constant) (exp);
4337 if (size == 0 || flag_syntax_only)
4340 /* Eliminate the NON_LVALUE_EXPR_EXPR that makes a cast not be an lvalue.
4341 That way we get the constant (we hope) inside it. Also, strip off any
4342 NOP_EXPR that converts between two record, union, array, or set types
4343 or a CONVERT_EXPR that converts to a union TYPE. */
4344 while ((TREE_CODE (exp) == NOP_EXPR
4345 && (TREE_TYPE (exp) == TREE_TYPE (TREE_OPERAND (exp, 0))
4346 || AGGREGATE_TYPE_P (TREE_TYPE (exp))))
4347 || (TREE_CODE (exp) == CONVERT_EXPR
4348 && code == UNION_TYPE)
4349 || TREE_CODE (exp) == NON_LVALUE_EXPR)
4351 exp = TREE_OPERAND (exp, 0);
4352 code = TREE_CODE (TREE_TYPE (exp));
4355 /* Allow a constructor with no elements for any data type.
4356 This means to fill the space with zeros. */
4357 if (TREE_CODE (exp) == CONSTRUCTOR && CONSTRUCTOR_ELTS (exp) == 0)
4359 assemble_zeros (size);
4370 case REFERENCE_TYPE:
4371 /* ??? What about (int)((float)(int)&foo + 4) */
4372 while (TREE_CODE (exp) == NOP_EXPR || TREE_CODE (exp) == CONVERT_EXPR
4373 || TREE_CODE (exp) == NON_LVALUE_EXPR)
4374 exp = TREE_OPERAND (exp, 0);
4376 if (! assemble_integer (expand_expr (exp, NULL_RTX, VOIDmode,
4377 EXPAND_INITIALIZER),
4379 error ("initializer for integer value is too complicated");
4384 if (TREE_CODE (exp) != REAL_CST)
4385 error ("initializer for floating value is not a floating constant");
4387 assemble_real (TREE_REAL_CST (exp),
4388 mode_for_size (size * BITS_PER_UNIT, MODE_FLOAT, 0));
4393 output_constant (TREE_REALPART (exp), size / 2);
4394 output_constant (TREE_IMAGPART (exp), size / 2);
4395 size -= (size / 2) * 2;
4399 if (TREE_CODE (exp) == CONSTRUCTOR)
4401 output_constructor (exp, size);
4404 else if (TREE_CODE (exp) == STRING_CST)
4408 if (size > TREE_STRING_LENGTH (exp))
4410 excess = size - TREE_STRING_LENGTH (exp);
4411 size = TREE_STRING_LENGTH (exp);
4414 assemble_string (TREE_STRING_POINTER (exp), size);
4423 if (TREE_CODE (exp) == CONSTRUCTOR)
4424 output_constructor (exp, size);
4430 if (TREE_CODE (exp) == INTEGER_CST)
4431 assemble_integer (expand_expr (exp, NULL_RTX,
4432 VOIDmode, EXPAND_INITIALIZER),
4434 else if (TREE_CODE (exp) == CONSTRUCTOR)
4436 unsigned char *buffer = (unsigned char *) alloca (size);
4437 if (get_set_constructor_bytes (exp, buffer, size))
4439 assemble_string ((char *) buffer, size);
4442 error ("unknown set constructor type");
4450 assemble_zeros (size);
4454 /* Subroutine of output_constructor, used for computing the size of
4455 arrays of unspecified length. VAL must be a CONSTRUCTOR of an array
4456 type with an unspecified upper bound. */
4458 static unsigned HOST_WIDE_INT
4459 array_size_for_constructor (val)
4464 max_index = NULL_TREE;
4465 for (i = CONSTRUCTOR_ELTS (val); i ; i = TREE_CHAIN (i))
4467 tree index = TREE_PURPOSE (i);
4469 if (TREE_CODE (index) == RANGE_EXPR)
4470 index = TREE_OPERAND (index, 1);
4471 if (max_index == NULL_TREE || tree_int_cst_lt (max_index, index))
4475 if (max_index == NULL_TREE)
4478 /* Compute the total number of array elements. */
4479 i = size_binop (MINUS_EXPR, convert (sizetype, max_index),
4481 TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (val)))));
4482 i = size_binop (PLUS_EXPR, i, convert (sizetype, integer_one_node));
4484 /* Multiply by the array element unit size to find number of bytes. */
4485 i = size_binop (MULT_EXPR, i, TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (val))));
4487 return tree_low_cst (i, 1);
4490 /* Subroutine of output_constant, used for CONSTRUCTORs (aggregate constants).
4491 Generate at least SIZE bytes, padding if necessary. */
4494 output_constructor (exp, size)
4498 tree type = TREE_TYPE (exp);
4499 register tree link, field = 0;
4501 /* Number of bytes output or skipped so far.
4502 In other words, current position within the constructor. */
4503 HOST_WIDE_INT total_bytes = 0;
4504 /* Non-zero means BYTE contains part of a byte, to be output. */
4505 int byte_buffer_in_use = 0;
4506 register int byte = 0;
4508 if (HOST_BITS_PER_WIDE_INT < BITS_PER_UNIT)
4511 if (TREE_CODE (type) == RECORD_TYPE)
4512 field = TYPE_FIELDS (type);
4514 if (TREE_CODE (type) == ARRAY_TYPE
4515 && TYPE_DOMAIN (type) != 0)
4516 min_index = TYPE_MIN_VALUE (TYPE_DOMAIN (type));
4518 /* As LINK goes through the elements of the constant,
4519 FIELD goes through the structure fields, if the constant is a structure.
4520 if the constant is a union, then we override this,
4521 by getting the field from the TREE_LIST element.
4522 But the constant could also be an array. Then FIELD is zero.
4524 There is always a maximum of one element in the chain LINK for unions
4525 (even if the initializer in a source program incorrectly contains
4527 for (link = CONSTRUCTOR_ELTS (exp);
4529 link = TREE_CHAIN (link),
4530 field = field ? TREE_CHAIN (field) : 0)
4532 tree val = TREE_VALUE (link);
4535 /* The element in a union constructor specifies the proper field
4537 if ((TREE_CODE (type) == RECORD_TYPE || TREE_CODE (type) == UNION_TYPE
4538 || TREE_CODE (type) == QUAL_UNION_TYPE)
4539 && TREE_PURPOSE (link) != 0)
4540 field = TREE_PURPOSE (link);
4542 else if (TREE_CODE (type) == ARRAY_TYPE)
4543 index = TREE_PURPOSE (link);
4545 /* Eliminate the marker that makes a cast not be an lvalue. */
4549 if (index && TREE_CODE (index) == RANGE_EXPR)
4551 unsigned HOST_WIDE_INT fieldsize
4552 = int_size_in_bytes (TREE_TYPE (type));
4553 HOST_WIDE_INT lo_index = tree_low_cst (TREE_OPERAND (index, 0), 0);
4554 HOST_WIDE_INT hi_index = tree_low_cst (TREE_OPERAND (index, 1), 0);
4555 HOST_WIDE_INT index;
4557 for (index = lo_index; index <= hi_index; index++)
4559 /* Output the element's initial value. */
4561 assemble_zeros (fieldsize);
4563 output_constant (val, fieldsize);
4565 /* Count its size. */
4566 total_bytes += fieldsize;
4569 else if (field == 0 || !DECL_BIT_FIELD (field))
4571 /* An element that is not a bit-field. */
4573 unsigned HOST_WIDE_INT fieldsize;
4574 /* Since this structure is static,
4575 we know the positions are constant. */
4576 HOST_WIDE_INT pos = field ? int_byte_position (field) : 0;
4579 pos = (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (val)), 1)
4580 * (tree_low_cst (index, 0) - tree_low_cst (min_index, 0)));
4582 /* Output any buffered-up bit-fields preceding this element. */
4583 if (byte_buffer_in_use)
4585 ASM_OUTPUT_BYTE (asm_out_file, byte);
4587 byte_buffer_in_use = 0;
4590 /* Advance to offset of this element.
4591 Note no alignment needed in an array, since that is guaranteed
4592 if each element has the proper size. */
4593 if ((field != 0 || index != 0) && pos != total_bytes)
4595 assemble_zeros (pos - total_bytes);
4599 else if (field != 0 && DECL_PACKED (field))
4600 /* Some assemblers automaticallly align a datum according to its
4601 size if no align directive is specified. The datum, however,
4602 may be declared with 'packed' attribute, so we have to disable
4604 ASM_OUTPUT_ALIGN (asm_out_file, 0);
4606 /* Determine size this element should occupy. */
4611 /* If this is an array with an unspecified upper bound,
4612 the initializer determines the size. */
4613 /* ??? This ought to only checked if DECL_SIZE_UNIT is NULL,
4614 but we cannot do this until the deprecated support for
4615 initializing zero-length array members is removed. */
4616 if (TREE_CODE (TREE_TYPE (field)) == ARRAY_TYPE
4617 && TYPE_DOMAIN (TREE_TYPE (field))
4618 && ! TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (field))))
4620 fieldsize = array_size_for_constructor (val);
4621 /* Given a non-empty initialization, this field had
4623 if (fieldsize != 0 && TREE_CHAIN (field) != NULL_TREE)
4626 else if (DECL_SIZE_UNIT (field))
4628 /* ??? This can't be right. If the decl size overflows
4629 a host integer we will silently emit no data. */
4630 if (host_integerp (DECL_SIZE_UNIT (field), 1))
4631 fieldsize = tree_low_cst (DECL_SIZE_UNIT (field), 1);
4635 fieldsize = int_size_in_bytes (TREE_TYPE (type));
4637 /* Output the element's initial value. */
4639 assemble_zeros (fieldsize);
4641 output_constant (val, fieldsize);
4643 /* Count its size. */
4644 total_bytes += fieldsize;
4646 else if (val != 0 && TREE_CODE (val) != INTEGER_CST)
4647 error ("invalid initial value for member `%s'",
4648 IDENTIFIER_POINTER (DECL_NAME (field)));
4651 /* Element that is a bit-field. */
4653 HOST_WIDE_INT next_offset = int_bit_position (field);
4654 HOST_WIDE_INT end_offset
4655 = (next_offset + tree_low_cst (DECL_SIZE (field), 1));
4658 val = integer_zero_node;
4660 /* If this field does not start in this (or, next) byte,
4662 if (next_offset / BITS_PER_UNIT != total_bytes)
4664 /* Output remnant of any bit field in previous bytes. */
4665 if (byte_buffer_in_use)
4667 ASM_OUTPUT_BYTE (asm_out_file, byte);
4669 byte_buffer_in_use = 0;
4672 /* If still not at proper byte, advance to there. */
4673 if (next_offset / BITS_PER_UNIT != total_bytes)
4675 assemble_zeros (next_offset / BITS_PER_UNIT - total_bytes);
4676 total_bytes = next_offset / BITS_PER_UNIT;
4680 if (! byte_buffer_in_use)
4683 /* We must split the element into pieces that fall within
4684 separate bytes, and combine each byte with previous or
4685 following bit-fields. */
4687 /* next_offset is the offset n fbits from the beginning of
4688 the structure to the next bit of this element to be processed.
4689 end_offset is the offset of the first bit past the end of
4691 while (next_offset < end_offset)
4695 HOST_WIDE_INT value;
4696 HOST_WIDE_INT next_byte = next_offset / BITS_PER_UNIT;
4697 HOST_WIDE_INT next_bit = next_offset % BITS_PER_UNIT;
4699 /* Advance from byte to byte
4700 within this element when necessary. */
4701 while (next_byte != total_bytes)
4703 ASM_OUTPUT_BYTE (asm_out_file, byte);
4708 /* Number of bits we can process at once
4709 (all part of the same byte). */
4710 this_time = MIN (end_offset - next_offset,
4711 BITS_PER_UNIT - next_bit);
4712 if (BYTES_BIG_ENDIAN)
4714 /* On big-endian machine, take the most significant bits
4715 first (of the bits that are significant)
4716 and put them into bytes from the most significant end. */
4717 shift = end_offset - next_offset - this_time;
4719 /* Don't try to take a bunch of bits that cross
4720 the word boundary in the INTEGER_CST. We can
4721 only select bits from the LOW or HIGH part
4723 if (shift < HOST_BITS_PER_WIDE_INT
4724 && shift + this_time > HOST_BITS_PER_WIDE_INT)
4726 this_time = shift + this_time - HOST_BITS_PER_WIDE_INT;
4727 shift = HOST_BITS_PER_WIDE_INT;
4730 /* Now get the bits from the appropriate constant word. */
4731 if (shift < HOST_BITS_PER_WIDE_INT)
4732 value = TREE_INT_CST_LOW (val);
4733 else if (shift < 2 * HOST_BITS_PER_WIDE_INT)
4735 value = TREE_INT_CST_HIGH (val);
4736 shift -= HOST_BITS_PER_WIDE_INT;
4741 /* Get the result. This works only when:
4742 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4743 byte |= (((value >> shift)
4744 & (((HOST_WIDE_INT) 2 << (this_time - 1)) - 1))
4745 << (BITS_PER_UNIT - this_time - next_bit));
4749 /* On little-endian machines,
4750 take first the least significant bits of the value
4751 and pack them starting at the least significant
4752 bits of the bytes. */
4753 shift = next_offset - int_bit_position (field);
4755 /* Don't try to take a bunch of bits that cross
4756 the word boundary in the INTEGER_CST. We can
4757 only select bits from the LOW or HIGH part
4759 if (shift < HOST_BITS_PER_WIDE_INT
4760 && shift + this_time > HOST_BITS_PER_WIDE_INT)
4761 this_time = (HOST_BITS_PER_WIDE_INT - shift);
4763 /* Now get the bits from the appropriate constant word. */
4764 if (shift < HOST_BITS_PER_WIDE_INT)
4765 value = TREE_INT_CST_LOW (val);
4766 else if (shift < 2 * HOST_BITS_PER_WIDE_INT)
4768 value = TREE_INT_CST_HIGH (val);
4769 shift -= HOST_BITS_PER_WIDE_INT;
4774 /* Get the result. This works only when:
4775 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4776 byte |= (((value >> shift)
4777 & (((HOST_WIDE_INT) 2 << (this_time - 1)) - 1))
4781 next_offset += this_time;
4782 byte_buffer_in_use = 1;
4787 if (byte_buffer_in_use)
4789 ASM_OUTPUT_BYTE (asm_out_file, byte);
4793 if (total_bytes < size)
4794 assemble_zeros (size - total_bytes);
4797 #ifdef HANDLE_PRAGMA_WEAK
4798 /* Add function NAME to the weak symbols list. VALUE is a weak alias
4799 associatd with NAME. */
4802 add_weak (name, value)
4806 struct weak_syms *weak;
4808 weak = (struct weak_syms *) permalloc (sizeof (struct weak_syms));
4813 weak->next = weak_decls;
4815 weak->value = value;
4820 #endif /* HANDLE_PRAGMA_WEAK */
4822 /* Declare DECL to be a weak symbol. */
4828 if (! TREE_PUBLIC (decl))
4829 error_with_decl (decl, "weak declaration of `%s' must be public");
4830 else if (TREE_ASM_WRITTEN (decl))
4831 error_with_decl (decl, "weak declaration of `%s' must precede definition");
4832 else if (SUPPORTS_WEAK)
4833 DECL_WEAK (decl) = 1;
4834 #ifdef HANDLE_PRAGMA_WEAK
4835 add_weak (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl)), NULL);
4839 /* Emit any pending weak declarations. */
4841 #ifdef HANDLE_PRAGMA_WEAK
4842 struct weak_syms * weak_decls;
4848 #ifdef HANDLE_PRAGMA_WEAK
4849 if (HANDLE_PRAGMA_WEAK)
4851 struct weak_syms *t;
4852 for (t = weak_decls; t; t = t->next)
4856 ASM_WEAKEN_LABEL (asm_out_file, t->name);
4858 ASM_OUTPUT_DEF (asm_out_file, t->name, t->value);
4865 /* Remove NAME from the pending list of weak symbols. This prevents
4866 the compiler from emitting multiple .weak directives which confuses
4868 #ifdef ASM_WEAKEN_LABEL
4870 remove_from_pending_weak_list (name)
4871 const char *name ATTRIBUTE_UNUSED;
4873 #ifdef HANDLE_PRAGMA_WEAK
4874 if (HANDLE_PRAGMA_WEAK)
4876 struct weak_syms *t;
4877 for (t = weak_decls; t; t = t->next)
4879 if (t->name && strcmp (name, t->name) == 0)
4888 assemble_alias (decl, target)
4889 tree decl, target ATTRIBUTE_UNUSED;
4893 make_decl_rtl (decl, (char *) 0, 1);
4894 name = XSTR (XEXP (DECL_RTL (decl), 0), 0);
4896 #ifdef ASM_OUTPUT_DEF
4897 /* Make name accessible from other files, if appropriate. */
4899 if (TREE_PUBLIC (decl))
4901 #ifdef ASM_WEAKEN_LABEL
4902 if (DECL_WEAK (decl))
4904 ASM_WEAKEN_LABEL (asm_out_file, name);
4905 /* Remove this function from the pending weak list so that
4906 we do not emit multiple .weak directives for it. */
4907 remove_from_pending_weak_list
4908 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl)));
4912 ASM_GLOBALIZE_LABEL (asm_out_file, name);
4915 #ifdef ASM_OUTPUT_DEF_FROM_DECLS
4916 ASM_OUTPUT_DEF_FROM_DECLS (asm_out_file, decl, target);
4918 ASM_OUTPUT_DEF (asm_out_file, name, IDENTIFIER_POINTER (target));
4920 TREE_ASM_WRITTEN (decl) = 1;
4922 #ifdef ASM_OUTPUT_WEAK_ALIAS
4923 if (! DECL_WEAK (decl))
4924 warning ("only weak aliases are supported in this configuration");
4926 ASM_OUTPUT_WEAK_ALIAS (asm_out_file, name, IDENTIFIER_POINTER (target));
4927 TREE_ASM_WRITTEN (decl) = 1;
4929 warning ("alias definitions not supported in this configuration; ignored");
4934 /* This determines whether or not we support link-once semantics. */
4935 #ifndef SUPPORTS_ONE_ONLY
4936 #ifdef MAKE_DECL_ONE_ONLY
4937 #define SUPPORTS_ONE_ONLY 1
4939 #define SUPPORTS_ONE_ONLY 0
4943 /* Returns 1 if the target configuration supports defining public symbols
4944 so that one of them will be chosen at link time instead of generating a
4945 multiply-defined symbol error, whether through the use of weak symbols or
4946 a target-specific mechanism for having duplicates discarded. */
4949 supports_one_only ()
4951 if (SUPPORTS_ONE_ONLY)
4953 return SUPPORTS_WEAK;
4956 /* Set up DECL as a public symbol that can be defined in multiple
4957 translation units without generating a linker error. */
4960 make_decl_one_only (decl)
4963 if (TREE_CODE (decl) != VAR_DECL && TREE_CODE (decl) != FUNCTION_DECL)
4966 TREE_PUBLIC (decl) = 1;
4968 if (TREE_CODE (decl) == VAR_DECL
4969 && (DECL_INITIAL (decl) == 0 || DECL_INITIAL (decl) == error_mark_node))
4970 DECL_COMMON (decl) = 1;
4971 else if (SUPPORTS_ONE_ONLY)
4973 #ifdef MAKE_DECL_ONE_ONLY
4974 MAKE_DECL_ONE_ONLY (decl);
4976 DECL_ONE_ONLY (decl) = 1;
4978 else if (SUPPORTS_WEAK)
4979 DECL_WEAK (decl) = 1;
4987 const_str_htab = htab_create (128, const_str_htab_hash, const_str_htab_eq,
4988 const_str_htab_del);
4989 ggc_add_root (const_hash_table, MAX_HASH_TABLE, sizeof const_hash_table[0],
4990 mark_const_hash_entry);
4991 ggc_add_root (&const_str_htab, 1, sizeof const_str_htab,
4992 mark_const_str_htab);
4995 /* Extra support for EH values. */
4997 assemble_eh_label (name)
5000 #ifdef ASM_OUTPUT_EH_LABEL
5001 ASM_OUTPUT_EH_LABEL (asm_out_file, name);
5003 assemble_label (name);
5007 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
5010 assemble_eh_align (align)
5013 #ifdef ASM_OUTPUT_EH_ALIGN
5014 if (align > BITS_PER_UNIT)
5015 ASM_OUTPUT_EH_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
5017 assemble_align (align);
5022 /* On some platforms, we may want to specify a special mechansim to
5023 output EH data when generating with a function.. */
5025 assemble_eh_integer (x, size, force)
5033 #ifdef ASM_OUTPUT_EH_CHAR
5035 ASM_OUTPUT_EH_CHAR (asm_out_file, x);
5039 #ifdef ASM_OUTPUT_EH_SHORT
5041 ASM_OUTPUT_EH_SHORT (asm_out_file, x);
5045 #ifdef ASM_OUTPUT_EH_INT
5047 ASM_OUTPUT_EH_INT (asm_out_file, x);
5051 #ifdef ASM_OUTPUT_EH_DOUBLE_INT
5053 ASM_OUTPUT_EH_DOUBLE_INT (asm_out_file, x);
5060 return (assemble_integer (x, size, force));