1 /* Output variables, constants and external declarations, for GNU compiler.
2 Copyright (C) 1987, 88, 89, 92-98, 1999 Free Software Foundation, Inc.
4 This file is part of GNU CC.
6 GNU CC is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2, or (at your option)
11 GNU CC is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with GNU CC; see the file COPYING. If not, write to
18 the Free Software Foundation, 59 Temple Place - Suite 330,
19 Boston, MA 02111-1307, USA. */
22 /* This file handles generation of all the assembler code
23 *except* the instructions of a function.
24 This includes declarations of variables and their initial values.
26 We also output the assembler code for constants stored in memory
27 and are responsible for combining constants with the same value. */
38 #include "hard-reg-set.h"
50 #ifdef XCOFF_DEBUGGING_INFO
54 #ifndef TRAMPOLINE_ALIGNMENT
55 #define TRAMPOLINE_ALIGNMENT FUNCTION_BOUNDARY
59 #define ASM_STABS_OP ".stabs"
62 /* Define the prefix to use when check_memory_usage_flag is enable. */
63 #ifdef NO_DOLLAR_IN_LABEL
64 #ifdef NO_DOT_IN_LABEL
65 #define CHKR_PREFIX "chkr_prefix_"
66 #else /* !NO_DOT_IN_LABEL */
67 #define CHKR_PREFIX "chkr."
69 #else /* !NO_DOLLAR_IN_LABEL */
70 #define CHKR_PREFIX "chkr$"
72 #define CHKR_PREFIX_SIZE (sizeof (CHKR_PREFIX) - 1)
74 /* File in which assembler code is being written. */
76 extern FILE *asm_out_file;
78 /* The (assembler) name of the first globally-visible object output. */
79 char *first_global_object_name;
80 char *weak_global_object_name;
82 extern struct obstack *current_obstack;
83 extern struct obstack *saveable_obstack;
84 extern struct obstack *rtl_obstack;
85 extern struct obstack permanent_obstack;
86 #define obstack_chunk_alloc xmalloc
89 struct constant_descriptor;
93 #define MAX_RTX_HASH_TABLE 61
97 /* Hash facility for making memory-constants
98 from constant rtl-expressions. It is used on RISC machines
99 where immediate integer arguments and constant addresses are restricted
100 so that such constants must be stored in memory.
102 This pool of constants is reinitialized for each function
103 so each function gets its own constants-pool that comes right before
105 struct constant_descriptor **x_const_rtx_hash_table;
106 struct pool_sym **x_const_rtx_sym_hash_table;
108 /* Pointers to first and last constant in pool. */
109 struct pool_constant *x_first_pool, *x_last_pool;
111 /* Current offset in constant pool (does not include any machine-specific
115 /* Chain of all CONST_DOUBLE rtx's constructed for the current function.
116 They are chained through the CONST_DOUBLE_CHAIN.
117 A CONST_DOUBLE rtx has CONST_DOUBLE_MEM != cc0_rtx iff it is on this chain.
118 In that case, CONST_DOUBLE_MEM is either a MEM,
119 or const0_rtx if no MEM has been made for this CONST_DOUBLE yet. */
120 rtx x_const_double_chain;
123 #define const_rtx_hash_table (current_function->varasm->x_const_rtx_hash_table)
124 #define const_rtx_sym_hash_table (current_function->varasm->x_const_rtx_sym_hash_table)
125 #define first_pool (current_function->varasm->x_first_pool)
126 #define last_pool (current_function->varasm->x_last_pool)
127 #define pool_offset (current_function->varasm->x_pool_offset)
128 #define const_double_chain (current_function->varasm->x_const_double_chain)
130 /* Number for making the label on the next
131 constant that is stored in memory. */
135 /* Number for making the label on the next
136 static variable internal to a function. */
140 /* Carry information from ASM_DECLARE_OBJECT_NAME
141 to ASM_FINISH_DECLARE_OBJECT. */
143 int size_directive_output;
145 /* The last decl for which assemble_variable was called,
146 if it did ASM_DECLARE_OBJECT_NAME.
147 If the last call to assemble_variable didn't do that,
150 tree last_assemble_variable_decl;
152 /* Nonzero if at least one function definition has been seen. */
154 static int function_defined;
156 static const char *strip_reg_name PROTO((const char *));
157 static int contains_pointers_p PROTO((tree));
158 static void decode_addr_const PROTO((tree, struct addr_const *));
159 static int const_hash PROTO((tree));
160 static int compare_constant PROTO((tree,
161 struct constant_descriptor *));
162 static char *compare_constant_1 PROTO((tree, char *));
163 static struct constant_descriptor *record_constant PROTO((tree));
164 static void record_constant_1 PROTO((tree));
165 static tree copy_constant PROTO((tree));
166 static void output_constant_def_contents PROTO((tree, int, int));
167 static void decode_rtx_const PROTO((enum machine_mode, rtx,
168 struct rtx_const *));
169 static int const_hash_rtx PROTO((enum machine_mode, rtx));
170 static int compare_constant_rtx PROTO((enum machine_mode, rtx,
171 struct constant_descriptor *));
172 static struct constant_descriptor *record_constant_rtx PROTO((enum machine_mode,
174 static struct pool_constant *find_pool_constant PROTO((struct function *, rtx));
175 static void mark_constant_pool PROTO((void));
176 static void mark_constants PROTO((rtx));
177 static int output_addressed_constants PROTO((tree));
178 static void output_after_function_constants PROTO((void));
179 static void output_constructor PROTO((tree, int));
180 static void remove_from_pending_weak_list PROTO ((char *));
181 #ifdef ASM_OUTPUT_BSS
182 static void asm_output_bss PROTO((FILE *, tree, char *, int, int));
184 #ifdef BSS_SECTION_ASM_OP
185 #ifdef ASM_OUTPUT_ALIGNED_BSS
186 static void asm_output_aligned_bss PROTO((FILE *, tree, char *, int, int));
188 #endif /* BSS_SECTION_ASM_OP */
189 static void mark_pool_constant PROTO((struct pool_constant *));
190 static void mark_pool_sym_hash_table PROTO((struct pool_sym **));
192 static enum in_section { no_section, in_text, in_data, in_named
193 #ifdef BSS_SECTION_ASM_OP
196 #ifdef EH_FRAME_SECTION_ASM_OP
199 #ifdef EXTRA_SECTIONS
202 } in_section = no_section;
204 /* Return a non-zero value if DECL has a section attribute. */
205 #define IN_NAMED_SECTION(DECL) \
206 ((TREE_CODE (DECL) == FUNCTION_DECL || TREE_CODE (DECL) == VAR_DECL) \
207 && DECL_SECTION_NAME (DECL) != NULL_TREE)
209 /* Text of section name when in_section == in_named. */
210 static char *in_named_name;
212 /* Define functions like text_section for any extra sections. */
213 #ifdef EXTRA_SECTION_FUNCTIONS
214 EXTRA_SECTION_FUNCTIONS
217 /* Tell assembler to switch to text section. */
222 if (in_section != in_text)
224 fprintf (asm_out_file, "%s\n", TEXT_SECTION_ASM_OP);
225 in_section = in_text;
229 /* Tell assembler to switch to data section. */
234 if (in_section != in_data)
236 if (flag_shared_data)
238 #ifdef SHARED_SECTION_ASM_OP
239 fprintf (asm_out_file, "%s\n", SHARED_SECTION_ASM_OP);
241 fprintf (asm_out_file, "%s\n", DATA_SECTION_ASM_OP);
245 fprintf (asm_out_file, "%s\n", DATA_SECTION_ASM_OP);
247 in_section = in_data;
250 /* Tell assembler to ALWAYS switch to data section, in case
251 it's not sure where it it. */
254 force_data_section ()
256 in_section = no_section;
260 /* Tell assembler to switch to read-only data section. This is normally
264 readonly_data_section ()
266 #ifdef READONLY_DATA_SECTION
267 READONLY_DATA_SECTION (); /* Note this can call data_section. */
273 /* Determine if we're in the text section. */
278 return in_section == in_text;
281 /* Determine if we're in the data section. */
286 return in_section == in_data;
289 /* Tell assembler to change to section NAME for DECL.
290 If DECL is NULL, just switch to section NAME.
291 If NAME is NULL, get the name from DECL.
292 If RELOC is 1, the initializer for DECL contains relocs. */
295 named_section (decl, name, reloc)
298 int reloc ATTRIBUTE_UNUSED;
300 if (decl != NULL_TREE
301 && TREE_CODE_CLASS (TREE_CODE (decl)) != 'd')
304 name = TREE_STRING_POINTER (DECL_SECTION_NAME (decl));
306 if (in_section != in_named || strcmp (name, in_named_name))
308 #ifdef ASM_OUTPUT_SECTION_NAME
309 ASM_OUTPUT_SECTION_NAME (asm_out_file, decl, name, reloc);
311 /* Section attributes are not supported if this macro isn't provided -
312 some host formats don't support them at all. The front-end should
313 already have flagged this as an error. */
317 in_named_name = ggc_alloc_string (name, -1);
318 in_section = in_named;
322 #ifdef ASM_OUTPUT_SECTION_NAME
323 #ifndef UNIQUE_SECTION
324 #define UNIQUE_SECTION(DECL,RELOC) \
330 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (DECL)); \
331 /* Strip off any encoding in name. */ \
332 STRIP_NAME_ENCODING (name, name); \
334 len = strlen (name) + 1; \
335 string = alloca (len + 1); \
336 sprintf (string, ".%s", name); \
338 DECL_SECTION_NAME (DECL) = build_string (len, string); \
341 #ifndef UNIQUE_SECTION_P
342 #define UNIQUE_SECTION_P(DECL) 0
346 #ifdef BSS_SECTION_ASM_OP
348 /* Tell the assembler to switch to the bss section. */
353 if (in_section != in_bss)
355 #ifdef SHARED_BSS_SECTION_ASM_OP
356 if (flag_shared_data)
357 fprintf (asm_out_file, "%s\n", SHARED_BSS_SECTION_ASM_OP);
360 fprintf (asm_out_file, "%s\n", BSS_SECTION_ASM_OP);
366 #ifdef ASM_OUTPUT_BSS
368 /* Utility function for ASM_OUTPUT_BSS for targets to use if
369 they don't support alignments in .bss.
370 ??? It is believed that this function will work in most cases so such
371 support is localized here. */
374 asm_output_bss (file, decl, name, size, rounded)
380 ASM_GLOBALIZE_LABEL (file, name);
382 #ifdef ASM_DECLARE_OBJECT_NAME
383 last_assemble_variable_decl = decl;
384 ASM_DECLARE_OBJECT_NAME (file, name, decl);
386 /* Standard thing is just output label for the object. */
387 ASM_OUTPUT_LABEL (file, name);
388 #endif /* ASM_DECLARE_OBJECT_NAME */
389 ASM_OUTPUT_SKIP (file, rounded);
394 #ifdef ASM_OUTPUT_ALIGNED_BSS
396 /* Utility function for targets to use in implementing
397 ASM_OUTPUT_ALIGNED_BSS.
398 ??? It is believed that this function will work in most cases so such
399 support is localized here. */
402 asm_output_aligned_bss (file, decl, name, size, align)
408 ASM_GLOBALIZE_LABEL (file, name);
410 ASM_OUTPUT_ALIGN (file, floor_log2 (align / BITS_PER_UNIT));
411 #ifdef ASM_DECLARE_OBJECT_NAME
412 last_assemble_variable_decl = decl;
413 ASM_DECLARE_OBJECT_NAME (file, name, decl);
415 /* Standard thing is just output label for the object. */
416 ASM_OUTPUT_LABEL (file, name);
417 #endif /* ASM_DECLARE_OBJECT_NAME */
418 ASM_OUTPUT_SKIP (file, size ? size : 1);
423 #endif /* BSS_SECTION_ASM_OP */
425 #ifdef EH_FRAME_SECTION_ASM_OP
429 if (in_section != in_eh_frame)
431 fprintf (asm_out_file, "%s\n", EH_FRAME_SECTION_ASM_OP);
432 in_section = in_eh_frame;
437 /* Switch to the section for function DECL.
439 If DECL is NULL_TREE, switch to the text section.
440 ??? It's not clear that we will ever be passed NULL_TREE, but it's
441 safer to handle it. */
444 function_section (decl)
447 if (decl != NULL_TREE
448 && DECL_SECTION_NAME (decl) != NULL_TREE)
449 named_section (decl, (char *) 0, 0);
454 /* Switch to section for variable DECL.
456 RELOC is the `reloc' argument to SELECT_SECTION. */
459 variable_section (decl, reloc)
463 if (IN_NAMED_SECTION (decl))
464 named_section (decl, NULL, reloc);
467 /* C++ can have const variables that get initialized from constructors,
468 and thus can not be in a readonly section. We prevent this by
469 verifying that the initial value is constant for objects put in a
472 error_mark_node is used by the C front end to indicate that the
473 initializer has not been seen yet. In this case, we assume that
474 the initializer must be constant.
476 C++ uses error_mark_node for variables that have complicated
477 initializers, but these variables go in BSS so we won't be called
480 #ifdef SELECT_SECTION
481 SELECT_SECTION (decl, reloc);
483 if (DECL_READONLY_SECTION (decl, reloc))
484 readonly_data_section ();
491 /* Tell assembler to switch to the section for the exception handling
497 #if defined (EXCEPTION_SECTION)
498 EXCEPTION_SECTION ();
500 #ifdef ASM_OUTPUT_SECTION_NAME
501 named_section (NULL_TREE, ".gcc_except_table", 0);
506 readonly_data_section ();
511 /* Create the rtl to represent a function, for a function definition.
512 DECL is a FUNCTION_DECL node which describes which function.
513 The rtl is stored into DECL. */
516 make_function_rtl (decl)
519 char *name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
520 char *new_name = name;
522 /* Rename a nested function to avoid conflicts. */
523 if (decl_function_context (decl) != 0
524 && DECL_INITIAL (decl) != 0
525 && DECL_RTL (decl) == 0)
529 name = IDENTIFIER_POINTER (DECL_NAME (decl));
530 ASM_FORMAT_PRIVATE_NAME (label, name, var_labelno);
531 name = ggc_alloc_string (label, -1);
536 /* When -fprefix-function-name is used, every function name is
537 prefixed. Even static functions are prefixed because they
538 could be declared latter. Note that a nested function name
540 if (flag_prefix_function_name)
542 size_t name_len = strlen (name);
544 new_name = ggc_alloc_string (NULL, name_len + CHKR_PREFIX_SIZE);
545 memcpy (new_name, CHKR_PREFIX, CHKR_PREFIX_SIZE);
546 memcpy (new_name + CHKR_PREFIX_SIZE, name, name_len + 1);
551 if (DECL_RTL (decl) == 0)
554 = gen_rtx_MEM (DECL_MODE (decl),
555 gen_rtx_SYMBOL_REF (Pmode, name));
557 /* Optionally set flags or add text to the name to record information
558 such as that it is a function name. If the name is changed, the macro
559 ASM_OUTPUT_LABELREF will have to know how to strip this information. */
560 #ifdef ENCODE_SECTION_INFO
561 ENCODE_SECTION_INFO (decl);
566 /* ??? Another way to do this would be to do what halfpic.c does
567 and maintain a hashed table of such critters. */
568 /* ??? Another way to do this would be to pass a flag bit to
569 ENCODE_SECTION_INFO saying whether this is a new decl or not. */
570 /* Let the target reassign the RTL if it wants.
571 This is necessary, for example, when one machine specific
572 decl attribute overrides another. */
573 #ifdef REDO_SECTION_INFO_P
574 if (REDO_SECTION_INFO_P (decl))
575 ENCODE_SECTION_INFO (decl);
579 /* Record at least one function has been defined. */
580 function_defined = 1;
583 /* Given NAME, a putative register name, discard any customary prefixes. */
586 strip_reg_name (name)
589 #ifdef REGISTER_PREFIX
590 if (!strncmp (name, REGISTER_PREFIX, strlen (REGISTER_PREFIX)))
591 name += strlen (REGISTER_PREFIX);
593 if (name[0] == '%' || name[0] == '#')
598 /* Decode an `asm' spec for a declaration as a register name.
599 Return the register number, or -1 if nothing specified,
600 or -2 if the ASMSPEC is not `cc' or `memory' and is not recognized,
601 or -3 if ASMSPEC is `cc' and is not recognized,
602 or -4 if ASMSPEC is `memory' and is not recognized.
603 Accept an exact spelling or a decimal number.
604 Prefixes such as % are optional. */
607 decode_reg_name (asmspec)
614 /* Get rid of confusing prefixes. */
615 asmspec = strip_reg_name (asmspec);
617 /* Allow a decimal number as a "register name". */
618 for (i = strlen (asmspec) - 1; i >= 0; i--)
619 if (! (asmspec[i] >= '0' && asmspec[i] <= '9'))
621 if (asmspec[0] != 0 && i < 0)
624 if (i < FIRST_PSEUDO_REGISTER && i >= 0)
630 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
632 && ! strcmp (asmspec, strip_reg_name (reg_names[i])))
635 #ifdef ADDITIONAL_REGISTER_NAMES
637 static struct { const char *name; int number; } table[]
638 = ADDITIONAL_REGISTER_NAMES;
640 for (i = 0; i < (int)(sizeof (table) / sizeof (table[0])); i++)
641 if (! strcmp (asmspec, table[i].name))
642 return table[i].number;
644 #endif /* ADDITIONAL_REGISTER_NAMES */
646 if (!strcmp (asmspec, "memory"))
649 if (!strcmp (asmspec, "cc"))
658 /* Create the DECL_RTL for a declaration for a static or external variable
659 or static or external function.
660 ASMSPEC, if not 0, is the string which the user specified
661 as the assembler symbol name.
662 TOP_LEVEL is nonzero if this is a file-scope variable.
664 This is never called for PARM_DECL nodes. */
667 make_decl_rtl (decl, asmspec, top_level)
672 register char *name = 0;
675 reg_number = decode_reg_name (asmspec);
677 if (DECL_ASSEMBLER_NAME (decl) != NULL_TREE)
678 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
680 if (reg_number == -2)
682 /* ASMSPEC is given, and not the name of a register. */
683 size_t len = strlen (asmspec);
685 name = ggc_alloc_string (NULL, len + 1);
687 memcpy (&name[1], asmspec, len + 1);
690 /* For a duplicate declaration, we can be called twice on the
691 same DECL node. Don't discard the RTL already made. */
692 if (DECL_RTL (decl) == 0)
694 /* First detect errors in declaring global registers. */
695 if (TREE_CODE (decl) != FUNCTION_DECL
696 && DECL_REGISTER (decl) && reg_number == -1)
697 error_with_decl (decl,
698 "register name not specified for `%s'");
699 else if (TREE_CODE (decl) != FUNCTION_DECL
700 && DECL_REGISTER (decl) && reg_number < 0)
701 error_with_decl (decl,
702 "invalid register name for `%s'");
703 else if ((reg_number >= 0 || reg_number == -3)
704 && (TREE_CODE (decl) == FUNCTION_DECL
705 && ! DECL_REGISTER (decl)))
706 error_with_decl (decl,
707 "register name given for non-register variable `%s'");
708 else if (TREE_CODE (decl) != FUNCTION_DECL
709 && DECL_REGISTER (decl)
710 && TYPE_MODE (TREE_TYPE (decl)) == BLKmode)
711 error_with_decl (decl,
712 "data type of `%s' isn't suitable for a register");
713 else if (TREE_CODE (decl) != FUNCTION_DECL && DECL_REGISTER (decl)
714 && ! HARD_REGNO_MODE_OK (reg_number,
715 TYPE_MODE (TREE_TYPE (decl))))
716 error_with_decl (decl,
717 "register number for `%s' isn't suitable for data type");
718 /* Now handle properly declared static register variables. */
719 else if (TREE_CODE (decl) != FUNCTION_DECL && DECL_REGISTER (decl))
723 if (DECL_INITIAL (decl) != 0 && top_level)
725 DECL_INITIAL (decl) = 0;
726 error ("global register variable has initial value");
728 if (fixed_regs[reg_number] == 0
729 && function_defined && top_level)
730 error ("global register variable follows a function definition");
731 if (TREE_THIS_VOLATILE (decl))
732 warning ("volatile register variables don't work as you might wish");
734 /* If the user specified one of the eliminables registers here,
735 e.g., FRAME_POINTER_REGNUM, we don't want to get this variable
736 confused with that register and be eliminated. Although this
737 usage is somewhat suspect, we nevertheless use the following
738 kludge to avoid setting DECL_RTL to frame_pointer_rtx. */
741 = gen_rtx_REG (DECL_MODE (decl), FIRST_PSEUDO_REGISTER);
742 REGNO (DECL_RTL (decl)) = reg_number;
743 REG_USERVAR_P (DECL_RTL (decl)) = 1;
747 /* Make this register global, so not usable for anything
749 #ifdef ASM_DECLARE_REGISTER_GLOBAL
750 ASM_DECLARE_REGISTER_GLOBAL (asm_out_file, decl, reg_number, name);
752 nregs = HARD_REGNO_NREGS (reg_number, DECL_MODE (decl));
754 globalize_reg (reg_number + --nregs);
757 /* Specifying a section attribute on a variable forces it into a
758 non-.bss section, and thus it cannot be common. */
759 else if (TREE_CODE (decl) == VAR_DECL
760 && DECL_SECTION_NAME (decl) != NULL_TREE
761 && DECL_INITIAL (decl) == NULL_TREE
762 && DECL_COMMON (decl))
763 DECL_COMMON (decl) = 0;
765 /* Now handle ordinary static variables and functions (in memory).
766 Also handle vars declared register invalidly. */
767 if (DECL_RTL (decl) == 0)
769 /* Can't use just the variable's own name for a variable
770 whose scope is less than the whole file.
771 Concatenate a distinguishing number. */
772 if (!top_level && !TREE_PUBLIC (decl) && asmspec == 0)
776 ASM_FORMAT_PRIVATE_NAME (label, name, var_labelno);
777 name = ggc_alloc_string (label, -1);
784 /* When -fprefix-function-name is used, the functions
785 names are prefixed. Only nested function names are not
787 if (flag_prefix_function_name && TREE_CODE (decl) == FUNCTION_DECL)
789 size_t name_len = strlen (name);
792 new_name = ggc_alloc_string (NULL, name_len + CHKR_PREFIX_SIZE);
793 memcpy (new_name, CHKR_PREFIX, CHKR_PREFIX_SIZE);
794 memcpy (new_name + CHKR_PREFIX_SIZE, name, name_len + 1);
798 DECL_RTL (decl) = gen_rtx_MEM (DECL_MODE (decl),
799 gen_rtx_SYMBOL_REF (Pmode, name));
800 MEM_ALIAS_SET (DECL_RTL (decl)) = get_alias_set (decl);
802 /* If this variable is to be treated as volatile, show its
803 tree node has side effects. If it has side effects, either
804 because of this test or from TREE_THIS_VOLATILE also
805 being set, show the MEM is volatile. */
806 if (flag_volatile_global && TREE_CODE (decl) == VAR_DECL
807 && TREE_PUBLIC (decl))
808 TREE_SIDE_EFFECTS (decl) = 1;
809 else if (flag_volatile_static && TREE_CODE (decl) == VAR_DECL
810 && (TREE_PUBLIC (decl) || TREE_STATIC (decl)))
811 TREE_SIDE_EFFECTS (decl) = 1;
813 if (TREE_SIDE_EFFECTS (decl))
814 MEM_VOLATILE_P (DECL_RTL (decl)) = 1;
816 if (TREE_READONLY (decl))
817 RTX_UNCHANGING_P (DECL_RTL (decl)) = 1;
818 MEM_SET_IN_STRUCT_P (DECL_RTL (decl),
819 AGGREGATE_TYPE_P (TREE_TYPE (decl)));
821 /* Optionally set flags or add text to the name to record information
822 such as that it is a function name.
823 If the name is changed, the macro ASM_OUTPUT_LABELREF
824 will have to know how to strip this information. */
825 #ifdef ENCODE_SECTION_INFO
826 ENCODE_SECTION_INFO (decl);
832 /* If the old RTL had the wrong mode, fix the mode. */
833 if (GET_MODE (DECL_RTL (decl)) != DECL_MODE (decl))
835 rtx rtl = DECL_RTL (decl);
836 PUT_MODE (rtl, DECL_MODE (decl));
839 /* ??? Another way to do this would be to do what halfpic.c does
840 and maintain a hashed table of such critters. */
841 /* ??? Another way to do this would be to pass a flag bit to
842 ENCODE_SECTION_INFO saying whether this is a new decl or not. */
843 /* Let the target reassign the RTL if it wants.
844 This is necessary, for example, when one machine specific
845 decl attribute overrides another. */
846 #ifdef REDO_SECTION_INFO_P
847 if (REDO_SECTION_INFO_P (decl))
848 ENCODE_SECTION_INFO (decl);
853 /* Make the rtl for variable VAR be volatile.
854 Use this only for static variables. */
857 make_var_volatile (var)
860 if (GET_CODE (DECL_RTL (var)) != MEM)
863 MEM_VOLATILE_P (DECL_RTL (var)) = 1;
866 /* Output alignment directive to align for constant expression EXP. */
869 assemble_constant_align (exp)
874 /* Align the location counter as required by EXP's data type. */
875 align = TYPE_ALIGN (TREE_TYPE (exp));
876 #ifdef CONSTANT_ALIGNMENT
877 align = CONSTANT_ALIGNMENT (exp, align);
880 if (align > BITS_PER_UNIT)
881 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
884 /* Output a string of literal assembler code
885 for an `asm' keyword used between functions. */
888 assemble_asm (string)
893 if (TREE_CODE (string) == ADDR_EXPR)
894 string = TREE_OPERAND (string, 0);
896 fprintf (asm_out_file, "\t%s\n", TREE_STRING_POINTER (string));
899 #if 0 /* This should no longer be needed, because
900 flag_gnu_linker should be 0 on these systems,
901 which should prevent any output
902 if ASM_OUTPUT_CONSTRUCTOR and ASM_OUTPUT_DESTRUCTOR are absent. */
903 #if !(defined(DBX_DEBUGGING_INFO) && !defined(FASCIST_ASSEMBLER))
904 #ifndef ASM_OUTPUT_CONSTRUCTOR
905 #define ASM_OUTPUT_CONSTRUCTOR(file, name)
907 #ifndef ASM_OUTPUT_DESTRUCTOR
908 #define ASM_OUTPUT_DESTRUCTOR(file, name)
913 /* Record an element in the table of global destructors.
914 How this is done depends on what sort of assembler and linker
917 NAME should be the name of a global function to be called
918 at exit time. This name is output using assemble_name. */
921 assemble_destructor (name)
924 #ifdef ASM_OUTPUT_DESTRUCTOR
925 ASM_OUTPUT_DESTRUCTOR (asm_out_file, name);
929 /* Now tell GNU LD that this is part of the static destructor set. */
930 /* This code works for any machine provided you use GNU as/ld. */
931 fprintf (asm_out_file, "%s \"___DTOR_LIST__\",22,0,0,", ASM_STABS_OP);
932 assemble_name (asm_out_file, name);
933 fputc ('\n', asm_out_file);
938 /* Likewise for global constructors. */
941 assemble_constructor (name)
944 #ifdef ASM_OUTPUT_CONSTRUCTOR
945 ASM_OUTPUT_CONSTRUCTOR (asm_out_file, name);
949 /* Now tell GNU LD that this is part of the static constructor set. */
950 /* This code works for any machine provided you use GNU as/ld. */
951 fprintf (asm_out_file, "%s \"___CTOR_LIST__\",22,0,0,", ASM_STABS_OP);
952 assemble_name (asm_out_file, name);
953 fputc ('\n', asm_out_file);
958 /* Likewise for entries we want to record for garbage collection.
959 Garbage collection is still under development. */
962 assemble_gc_entry (name)
965 #ifdef ASM_OUTPUT_GC_ENTRY
966 ASM_OUTPUT_GC_ENTRY (asm_out_file, name);
970 /* Now tell GNU LD that this is part of the static constructor set. */
971 fprintf (asm_out_file, "%s \"___PTR_LIST__\",22,0,0,", ASM_STABS_OP);
972 assemble_name (asm_out_file, name);
973 fputc ('\n', asm_out_file);
978 /* CONSTANT_POOL_BEFORE_FUNCTION may be defined as an expression with
979 a non-zero value if the constant pool should be output before the
980 start of the function, or a zero value if the pool should output
981 after the end of the function. The default is to put it before the
984 #ifndef CONSTANT_POOL_BEFORE_FUNCTION
985 #define CONSTANT_POOL_BEFORE_FUNCTION 1
988 /* Output assembler code for the constant pool of a function and associated
989 with defining the name of the function. DECL describes the function.
990 NAME is the function's name. For the constant pool, we use the current
991 constant pool data. */
994 assemble_start_function (decl, fnname)
1000 /* The following code does not need preprocessing in the assembler. */
1004 if (CONSTANT_POOL_BEFORE_FUNCTION)
1005 output_constant_pool (fnname, decl);
1007 #ifdef ASM_OUTPUT_SECTION_NAME
1008 /* If the function is to be put in its own section and it's not in a section
1009 already, indicate so. */
1010 if ((flag_function_sections
1011 && DECL_SECTION_NAME (decl) == NULL_TREE)
1012 || UNIQUE_SECTION_P (decl))
1013 UNIQUE_SECTION (decl, 0);
1016 function_section (decl);
1018 /* Tell assembler to move to target machine's alignment for functions. */
1019 align = floor_log2 (FUNCTION_BOUNDARY / BITS_PER_UNIT);
1021 ASM_OUTPUT_ALIGN (asm_out_file, align);
1023 /* Handle a user-specified function alignment.
1024 Note that we still need to align to FUNCTION_BOUNDARY, as above,
1025 because ASM_OUTPUT_MAX_SKIP_ALIGN might not do any alignment at all. */
1026 if (align_functions_log > align)
1028 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
1029 ASM_OUTPUT_MAX_SKIP_ALIGN (asm_out_file,
1030 align_functions_log, align_functions-1);
1032 ASM_OUTPUT_ALIGN (asm_out_file, align_functions_log);
1036 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
1037 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file, fnname);
1040 #ifdef SDB_DEBUGGING_INFO
1041 /* Output SDB definition of the function. */
1042 if (write_symbols == SDB_DEBUG)
1043 sdbout_mark_begin_function ();
1046 #ifdef DBX_DEBUGGING_INFO
1047 /* Output DBX definition of the function. */
1048 if (write_symbols == DBX_DEBUG)
1049 dbxout_begin_function (decl);
1052 /* Make function name accessible from other files, if appropriate. */
1054 if (TREE_PUBLIC (decl))
1056 if (! first_global_object_name)
1061 if (! DECL_WEAK (decl) && ! DECL_ONE_ONLY (decl))
1062 name = &first_global_object_name;
1064 name = &weak_global_object_name;
1066 STRIP_NAME_ENCODING (p, fnname);
1067 *name = permalloc (strlen (p) + 1);
1071 #ifdef ASM_WEAKEN_LABEL
1072 if (DECL_WEAK (decl))
1074 ASM_WEAKEN_LABEL (asm_out_file, fnname);
1075 /* Remove this function from the pending weak list so that
1076 we do not emit multiple .weak directives for it. */
1077 remove_from_pending_weak_list
1078 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl)));
1082 ASM_GLOBALIZE_LABEL (asm_out_file, fnname);
1085 /* Do any machine/system dependent processing of the function name */
1086 #ifdef ASM_DECLARE_FUNCTION_NAME
1087 ASM_DECLARE_FUNCTION_NAME (asm_out_file, fnname, current_function_decl);
1089 /* Standard thing is just output label for the function. */
1090 ASM_OUTPUT_LABEL (asm_out_file, fnname);
1091 #endif /* ASM_DECLARE_FUNCTION_NAME */
1094 /* Output assembler code associated with defining the size of the
1095 function. DECL describes the function. NAME is the function's name. */
1098 assemble_end_function (decl, fnname)
1102 #ifdef ASM_DECLARE_FUNCTION_SIZE
1103 ASM_DECLARE_FUNCTION_SIZE (asm_out_file, fnname, decl);
1105 if (! CONSTANT_POOL_BEFORE_FUNCTION)
1107 output_constant_pool (fnname, decl);
1108 function_section (decl); /* need to switch back */
1111 /* Output any constants which should appear after the function. */
1112 output_after_function_constants ();
1115 /* Assemble code to leave SIZE bytes of zeros. */
1118 assemble_zeros (size)
1121 /* Do no output if -fsyntax-only. */
1122 if (flag_syntax_only)
1125 #ifdef ASM_NO_SKIP_IN_TEXT
1126 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
1127 so we must output 0s explicitly in the text section. */
1128 if (ASM_NO_SKIP_IN_TEXT && in_text_section ())
1132 for (i = 0; i < size - 20; i += 20)
1135 fprintf (asm_out_file,
1136 "%s 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n", ASM_BYTE_OP);
1138 fprintf (asm_out_file,
1139 "\tbyte 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n");
1145 fprintf (asm_out_file, "%s 0", ASM_BYTE_OP);
1147 fprintf (asm_out_file, "\tbyte 0");
1150 for (; i < size; i++)
1151 fprintf (asm_out_file, ",0");
1152 fprintf (asm_out_file, "\n");
1158 ASM_OUTPUT_SKIP (asm_out_file, size);
1161 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
1164 assemble_align (align)
1167 if (align > BITS_PER_UNIT)
1168 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
1171 /* Assemble a string constant with the specified C string as contents. */
1174 assemble_string (p, size)
1181 /* If the string is very long, split it up. */
1185 int thissize = size - pos;
1186 if (thissize > maximum)
1189 ASM_OUTPUT_ASCII (asm_out_file, p, thissize);
1197 /* Assemble everything that is needed for a variable or function declaration.
1198 Not used for automatic variables, and not used for function definitions.
1199 Should not be called for variables of incomplete structure type.
1201 TOP_LEVEL is nonzero if this variable has file scope.
1202 AT_END is nonzero if this is the special handling, at end of compilation,
1203 to define things that have had only tentative definitions.
1204 DONT_OUTPUT_DATA if nonzero means don't actually output the
1205 initial value (that will be done by the caller). */
1208 assemble_variable (decl, top_level, at_end, dont_output_data)
1210 int top_level ATTRIBUTE_UNUSED;
1212 int dont_output_data;
1214 register char *name;
1216 tree size_tree = NULL_TREE;
1218 enum in_section saved_in_section;
1220 last_assemble_variable_decl = 0;
1222 if (GET_CODE (DECL_RTL (decl)) == REG)
1224 /* Do output symbol info for global register variables, but do nothing
1227 if (TREE_ASM_WRITTEN (decl))
1229 TREE_ASM_WRITTEN (decl) = 1;
1231 /* Do no output if -fsyntax-only. */
1232 if (flag_syntax_only)
1235 #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
1236 /* File-scope global variables are output here. */
1237 if ((write_symbols == DBX_DEBUG || write_symbols == XCOFF_DEBUG)
1239 dbxout_symbol (decl, 0);
1241 #ifdef SDB_DEBUGGING_INFO
1242 if (write_symbols == SDB_DEBUG && top_level
1243 /* Leave initialized global vars for end of compilation;
1244 see comment in compile_file. */
1245 && (TREE_PUBLIC (decl) == 0 || DECL_INITIAL (decl) == 0))
1246 sdbout_symbol (decl, 0);
1249 /* Don't output any DWARF debugging information for variables here.
1250 In the case of local variables, the information for them is output
1251 when we do our recursive traversal of the tree representation for
1252 the entire containing function. In the case of file-scope variables,
1253 we output information for all of them at the very end of compilation
1254 while we are doing our final traversal of the chain of file-scope
1260 /* Normally no need to say anything here for external references,
1261 since assemble_external is called by the language-specific code
1262 when a declaration is first seen. */
1264 if (DECL_EXTERNAL (decl))
1267 /* Output no assembler code for a function declaration.
1268 Only definitions of functions output anything. */
1270 if (TREE_CODE (decl) == FUNCTION_DECL)
1273 /* If type was incomplete when the variable was declared,
1274 see if it is complete now. */
1276 if (DECL_SIZE (decl) == 0)
1277 layout_decl (decl, 0);
1279 /* Still incomplete => don't allocate it; treat the tentative defn
1280 (which is what it must have been) as an `extern' reference. */
1282 if (!dont_output_data && DECL_SIZE (decl) == 0)
1284 error_with_file_and_line (DECL_SOURCE_FILE (decl),
1285 DECL_SOURCE_LINE (decl),
1286 "storage size of `%s' isn't known",
1287 IDENTIFIER_POINTER (DECL_NAME (decl)));
1288 TREE_ASM_WRITTEN (decl) = 1;
1292 /* The first declaration of a variable that comes through this function
1293 decides whether it is global (in C, has external linkage)
1294 or local (in C, has internal linkage). So do nothing more
1295 if this function has already run. */
1297 if (TREE_ASM_WRITTEN (decl))
1300 TREE_ASM_WRITTEN (decl) = 1;
1302 /* Do no output if -fsyntax-only. */
1303 if (flag_syntax_only)
1308 if (! dont_output_data)
1312 if (TREE_CODE (DECL_SIZE (decl)) != INTEGER_CST)
1315 /* This is better than explicit arithmetic, since it avoids overflow. */
1316 size_tree = size_binop (CEIL_DIV_EXPR,
1317 DECL_SIZE (decl), size_int (BITS_PER_UNIT));
1319 size = TREE_INT_CST_LOW (size_tree);
1320 if (TREE_INT_CST_HIGH (size_tree) != 0
1321 || size != TREE_INT_CST_LOW (size_tree))
1323 error_with_decl (decl, "size of variable `%s' is too large");
1328 name = XSTR (XEXP (DECL_RTL (decl), 0), 0);
1330 if (TREE_PUBLIC (decl) && DECL_NAME (decl)
1331 && ! first_global_object_name
1332 && ! (DECL_COMMON (decl) && (DECL_INITIAL (decl) == 0
1333 || DECL_INITIAL (decl) == error_mark_node))
1334 && ! DECL_WEAK (decl)
1335 && ! DECL_ONE_ONLY (decl))
1339 STRIP_NAME_ENCODING (p, name);
1340 first_global_object_name = permalloc (strlen (p) + 1);
1341 strcpy (first_global_object_name, p);
1344 /* Compute the alignment of this data. */
1346 align = DECL_ALIGN (decl);
1348 /* In the case for initialing an array whose length isn't specified,
1349 where we have not yet been able to do the layout,
1350 figure out the proper alignment now. */
1351 if (dont_output_data && DECL_SIZE (decl) == 0
1352 && TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE)
1353 align = MAX (align, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl))));
1355 /* Some object file formats have a maximum alignment which they support.
1356 In particular, a.out format supports a maximum alignment of 4. */
1357 #ifndef MAX_OFILE_ALIGNMENT
1358 #define MAX_OFILE_ALIGNMENT BIGGEST_ALIGNMENT
1360 if (align > MAX_OFILE_ALIGNMENT)
1362 warning_with_decl (decl,
1363 "alignment of `%s' is greater than maximum object file alignment. Using %d.",
1364 MAX_OFILE_ALIGNMENT/BITS_PER_UNIT);
1365 align = MAX_OFILE_ALIGNMENT;
1368 /* On some machines, it is good to increase alignment sometimes. */
1369 #ifdef DATA_ALIGNMENT
1370 align = DATA_ALIGNMENT (TREE_TYPE (decl), align);
1372 #ifdef CONSTANT_ALIGNMENT
1373 if (DECL_INITIAL (decl) != 0 && DECL_INITIAL (decl) != error_mark_node)
1374 align = CONSTANT_ALIGNMENT (DECL_INITIAL (decl), align);
1377 /* Reset the alignment in case we have made it tighter, so we can benefit
1378 from it in get_pointer_alignment. */
1379 DECL_ALIGN (decl) = align;
1381 /* Handle uninitialized definitions. */
1383 if ((DECL_INITIAL (decl) == 0 || DECL_INITIAL (decl) == error_mark_node)
1384 /* If the target can't output uninitialized but not common global data
1385 in .bss, then we have to use .data. */
1386 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
1387 && DECL_COMMON (decl)
1389 && DECL_SECTION_NAME (decl) == 0
1390 && ! dont_output_data)
1392 int size = TREE_INT_CST_LOW (size_tree);
1395 /* Don't allocate zero bytes of common,
1396 since that means "undefined external" in the linker. */
1397 if (size == 0) rounded = 1;
1398 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1399 so that each uninitialized object starts on such a boundary. */
1400 rounded += (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1;
1401 rounded = (rounded / (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
1402 * (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
1404 #if !defined(ASM_OUTPUT_ALIGNED_COMMON) && !defined(ASM_OUTPUT_ALIGNED_BSS)
1405 if ( (DECL_ALIGN (decl) / BITS_PER_UNIT) > rounded)
1407 (decl, "requested alignment for %s is greater than implemented alignment of %d.",rounded);
1410 #ifdef DBX_DEBUGGING_INFO
1411 /* File-scope global variables are output here. */
1412 if (write_symbols == DBX_DEBUG && top_level)
1413 dbxout_symbol (decl, 0);
1415 #ifdef SDB_DEBUGGING_INFO
1416 if (write_symbols == SDB_DEBUG && top_level
1417 /* Leave initialized global vars for end of compilation;
1418 see comment in compile_file. */
1419 && (TREE_PUBLIC (decl) == 0 || DECL_INITIAL (decl) == 0))
1420 sdbout_symbol (decl, 0);
1423 /* Don't output any DWARF debugging information for variables here.
1424 In the case of local variables, the information for them is output
1425 when we do our recursive traversal of the tree representation for
1426 the entire containing function. In the case of file-scope variables,
1427 we output information for all of them at the very end of compilation
1428 while we are doing our final traversal of the chain of file-scope
1431 #if 0 /* ??? We should either delete this or add a comment describing what
1432 it was intended to do and why we shouldn't delete it. */
1433 if (flag_shared_data)
1437 if (TREE_PUBLIC (decl)
1438 #if defined (ASM_OUTPUT_BSS) || defined (ASM_OUTPUT_ALIGNED_BSS)
1439 && DECL_COMMON (decl)
1443 #ifdef ASM_OUTPUT_SHARED_COMMON
1444 if (flag_shared_data)
1445 ASM_OUTPUT_SHARED_COMMON (asm_out_file, name, size, rounded);
1449 #ifdef ASM_OUTPUT_ALIGNED_DECL_COMMON
1450 ASM_OUTPUT_ALIGNED_DECL_COMMON (asm_out_file, decl, name, size,
1453 #ifdef ASM_OUTPUT_ALIGNED_COMMON
1454 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file, name, size,
1457 ASM_OUTPUT_COMMON (asm_out_file, name, size, rounded);
1462 #if defined (ASM_OUTPUT_BSS) || defined (ASM_OUTPUT_ALIGNED_BSS)
1463 else if (TREE_PUBLIC (decl))
1465 #ifdef ASM_OUTPUT_SHARED_BSS
1466 if (flag_shared_data)
1467 ASM_OUTPUT_SHARED_BSS (asm_out_file, decl, name, size, rounded);
1471 #ifdef ASM_OUTPUT_ALIGNED_BSS
1472 ASM_OUTPUT_ALIGNED_BSS (asm_out_file, decl, name, size,
1475 ASM_OUTPUT_BSS (asm_out_file, decl, name, size, rounded);
1479 #endif /* ASM_OUTPUT_BSS || ASM_OUTPUT_ALIGNED_BSS */
1482 #ifdef ASM_OUTPUT_SHARED_LOCAL
1483 if (flag_shared_data)
1484 ASM_OUTPUT_SHARED_LOCAL (asm_out_file, name, size, rounded);
1488 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
1489 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, decl, name, size,
1492 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1493 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size,
1496 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded);
1504 /* Handle initialized definitions.
1505 Also handle uninitialized global definitions if -fno-common and the
1506 target doesn't support ASM_OUTPUT_BSS. */
1508 /* First make the assembler name(s) global if appropriate. */
1509 if (TREE_PUBLIC (decl) && DECL_NAME (decl))
1511 #ifdef ASM_WEAKEN_LABEL
1512 if (DECL_WEAK (decl))
1514 ASM_WEAKEN_LABEL (asm_out_file, name);
1515 /* Remove this variable from the pending weak list so that
1516 we do not emit multiple .weak directives for it. */
1517 remove_from_pending_weak_list
1518 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl)));
1522 ASM_GLOBALIZE_LABEL (asm_out_file, name);
1525 for (d = equivalents; d; d = TREE_CHAIN (d))
1527 tree e = TREE_VALUE (d);
1528 if (TREE_PUBLIC (e) && DECL_NAME (e))
1529 ASM_GLOBALIZE_LABEL (asm_out_file,
1530 XSTR (XEXP (DECL_RTL (e), 0), 0));
1534 /* Output any data that we will need to use the address of. */
1535 if (DECL_INITIAL (decl) == error_mark_node)
1536 reloc = contains_pointers_p (TREE_TYPE (decl));
1537 else if (DECL_INITIAL (decl))
1538 reloc = output_addressed_constants (DECL_INITIAL (decl));
1540 #ifdef ASM_OUTPUT_SECTION_NAME
1541 if ((flag_data_sections != 0
1542 && DECL_SECTION_NAME (decl) == NULL_TREE)
1543 || UNIQUE_SECTION_P (decl))
1544 UNIQUE_SECTION (decl, reloc);
1547 /* Switch to the appropriate section. */
1548 variable_section (decl, reloc);
1550 /* dbxout.c needs to know this. */
1551 if (in_text_section ())
1552 DECL_IN_TEXT_SECTION (decl) = 1;
1554 /* Record current section so we can restore it if dbxout.c clobbers it. */
1555 saved_in_section = in_section;
1557 /* Output the dbx info now that we have chosen the section. */
1559 #ifdef DBX_DEBUGGING_INFO
1560 /* File-scope global variables are output here. */
1561 if (write_symbols == DBX_DEBUG && top_level)
1562 dbxout_symbol (decl, 0);
1564 #ifdef SDB_DEBUGGING_INFO
1565 if (write_symbols == SDB_DEBUG && top_level
1566 /* Leave initialized global vars for end of compilation;
1567 see comment in compile_file. */
1568 && (TREE_PUBLIC (decl) == 0 || DECL_INITIAL (decl) == 0))
1569 sdbout_symbol (decl, 0);
1572 /* Don't output any DWARF debugging information for variables here.
1573 In the case of local variables, the information for them is output
1574 when we do our recursive traversal of the tree representation for
1575 the entire containing function. In the case of file-scope variables,
1576 we output information for all of them at the very end of compilation
1577 while we are doing our final traversal of the chain of file-scope
1580 /* If the debugging output changed sections, reselect the section
1581 that's supposed to be selected. */
1582 if (in_section != saved_in_section)
1583 variable_section (decl, reloc);
1585 /* Output the alignment of this data. */
1586 if (align > BITS_PER_UNIT)
1587 ASM_OUTPUT_ALIGN (asm_out_file,
1588 floor_log2 (DECL_ALIGN (decl) / BITS_PER_UNIT));
1590 /* Do any machine/system dependent processing of the object. */
1591 #ifdef ASM_DECLARE_OBJECT_NAME
1592 last_assemble_variable_decl = decl;
1593 ASM_DECLARE_OBJECT_NAME (asm_out_file, name, decl);
1595 /* Standard thing is just output label for the object. */
1596 ASM_OUTPUT_LABEL (asm_out_file, name);
1597 #endif /* ASM_DECLARE_OBJECT_NAME */
1599 if (!dont_output_data)
1601 if (DECL_INITIAL (decl))
1602 /* Output the actual data. */
1603 output_constant (DECL_INITIAL (decl), TREE_INT_CST_LOW (size_tree));
1605 /* Leave space for it. */
1606 assemble_zeros (TREE_INT_CST_LOW (size_tree));
1610 #ifdef XCOFF_DEBUGGING_INFO
1611 /* Unfortunately, the IBM assembler cannot handle stabx before the actual
1612 declaration. When something like ".stabx "aa:S-2",aa,133,0" is emitted
1613 and `aa' hasn't been output yet, the assembler generates a stab entry with
1614 a value of zero, in addition to creating an unnecessary external entry
1615 for `aa'. Hence, we must postpone dbxout_symbol to here at the end. */
1617 /* File-scope global variables are output here. */
1618 if (write_symbols == XCOFF_DEBUG && top_level)
1620 saved_in_section = in_section;
1622 dbxout_symbol (decl, 0);
1624 if (in_section != saved_in_section)
1625 variable_section (decl, reloc);
1628 /* There must be a statement after a label. */
1633 /* Return 1 if type TYPE contains any pointers. */
1636 contains_pointers_p (type)
1639 switch (TREE_CODE (type))
1642 case REFERENCE_TYPE:
1643 /* I'm not sure whether OFFSET_TYPE needs this treatment,
1644 so I'll play safe and return 1. */
1650 case QUAL_UNION_TYPE:
1653 /* For a type that has fields, see if the fields have pointers. */
1654 for (fields = TYPE_FIELDS (type); fields; fields = TREE_CHAIN (fields))
1655 if (TREE_CODE (fields) == FIELD_DECL
1656 && contains_pointers_p (TREE_TYPE (fields)))
1662 /* An array type contains pointers if its element type does. */
1663 return contains_pointers_p (TREE_TYPE (type));
1670 /* Output something to declare an external symbol to the assembler.
1671 (Most assemblers don't need this, so we normally output nothing.)
1672 Do nothing if DECL is not external. */
1675 assemble_external (decl)
1676 tree decl ATTRIBUTE_UNUSED;
1678 #ifdef ASM_OUTPUT_EXTERNAL
1679 if (TREE_CODE_CLASS (TREE_CODE (decl)) == 'd'
1680 && DECL_EXTERNAL (decl) && TREE_PUBLIC (decl))
1682 rtx rtl = DECL_RTL (decl);
1684 if (GET_CODE (rtl) == MEM && GET_CODE (XEXP (rtl, 0)) == SYMBOL_REF
1685 && ! SYMBOL_REF_USED (XEXP (rtl, 0)))
1687 /* Some systems do require some output. */
1688 SYMBOL_REF_USED (XEXP (rtl, 0)) = 1;
1689 ASM_OUTPUT_EXTERNAL (asm_out_file, decl, XSTR (XEXP (rtl, 0), 0));
1695 /* Similar, for calling a library function FUN. */
1698 assemble_external_libcall (fun)
1699 rtx fun ATTRIBUTE_UNUSED;
1701 #ifdef ASM_OUTPUT_EXTERNAL_LIBCALL
1702 /* Declare library function name external when first used, if nec. */
1703 if (! SYMBOL_REF_USED (fun))
1705 SYMBOL_REF_USED (fun) = 1;
1706 ASM_OUTPUT_EXTERNAL_LIBCALL (asm_out_file, fun);
1711 /* Declare the label NAME global. */
1714 assemble_global (name)
1717 ASM_GLOBALIZE_LABEL (asm_out_file, name);
1720 /* Assemble a label named NAME. */
1723 assemble_label (name)
1726 ASM_OUTPUT_LABEL (asm_out_file, name);
1729 /* Output to FILE a reference to the assembler name of a C-level name NAME.
1730 If NAME starts with a *, the rest of NAME is output verbatim.
1731 Otherwise NAME is transformed in an implementation-defined way
1732 (usually by the addition of an underscore).
1733 Many macros in the tm file are defined to call this function. */
1736 assemble_name (file, name)
1740 const char *real_name;
1743 STRIP_NAME_ENCODING (real_name, name);
1744 if (flag_prefix_function_name
1745 && ! bcmp (real_name, CHKR_PREFIX, CHKR_PREFIX_SIZE))
1746 real_name = real_name + CHKR_PREFIX_SIZE;
1748 id = maybe_get_identifier (real_name);
1750 TREE_SYMBOL_REFERENCED (id) = 1;
1753 fputs (&name[1], file);
1755 ASM_OUTPUT_LABELREF (file, name);
1758 /* Allocate SIZE bytes writable static space with a gensym name
1759 and return an RTX to refer to its address. */
1762 assemble_static_space (size)
1770 if (flag_shared_data)
1774 ASM_GENERATE_INTERNAL_LABEL (name, "LF", const_labelno);
1776 namestring = ggc_alloc_string (name, -1);
1778 x = gen_rtx_SYMBOL_REF (Pmode, namestring);
1780 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
1781 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, NULL_TREE, name, size,
1784 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1785 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, BIGGEST_ALIGNMENT);
1788 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1789 so that each uninitialized object starts on such a boundary. */
1790 /* Variable `rounded' might or might not be used in ASM_OUTPUT_LOCAL. */
1791 int rounded ATTRIBUTE_UNUSED
1792 = ((size + (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1)
1793 / (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
1794 * (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
1795 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded);
1802 /* Assemble the static constant template for function entry trampolines.
1803 This is done at most once per compilation.
1804 Returns an RTX for the address of the template. */
1806 #ifdef TRAMPOLINE_TEMPLATE
1808 assemble_trampoline_template ()
1814 /* By default, put trampoline templates in read-only data section. */
1816 #ifdef TRAMPOLINE_SECTION
1817 TRAMPOLINE_SECTION ();
1819 readonly_data_section ();
1822 /* Write the assembler code to define one. */
1823 align = floor_log2 (TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT);
1825 ASM_OUTPUT_ALIGN (asm_out_file, align);
1827 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LTRAMP", 0);
1828 TRAMPOLINE_TEMPLATE (asm_out_file);
1830 /* Record the rtl to refer to it. */
1831 ASM_GENERATE_INTERNAL_LABEL (label, "LTRAMP", 0);
1832 name = ggc_alloc_string (label, -1);
1833 return gen_rtx_SYMBOL_REF (Pmode, name);
1837 /* Assemble the integer constant X into an object of SIZE bytes.
1838 X must be either a CONST_INT or CONST_DOUBLE.
1840 Return 1 if we were able to output the constant, otherwise 0. If FORCE is
1841 non-zero, abort if we can't output the constant. */
1844 assemble_integer (x, size, force)
1849 /* First try to use the standard 1, 2, 4, 8, and 16 byte
1850 ASM_OUTPUT... macros. */
1854 #ifdef ASM_OUTPUT_CHAR
1856 ASM_OUTPUT_CHAR (asm_out_file, x);
1860 #ifdef ASM_OUTPUT_SHORT
1862 ASM_OUTPUT_SHORT (asm_out_file, x);
1866 #ifdef ASM_OUTPUT_INT
1868 ASM_OUTPUT_INT (asm_out_file, x);
1872 #ifdef ASM_OUTPUT_DOUBLE_INT
1874 ASM_OUTPUT_DOUBLE_INT (asm_out_file, x);
1878 #ifdef ASM_OUTPUT_QUADRUPLE_INT
1880 ASM_OUTPUT_QUADRUPLE_INT (asm_out_file, x);
1885 /* If we couldn't do it that way, there are two other possibilities: First,
1886 if the machine can output an explicit byte and this is a 1 byte constant,
1887 we can use ASM_OUTPUT_BYTE. */
1889 #ifdef ASM_OUTPUT_BYTE
1890 if (size == 1 && GET_CODE (x) == CONST_INT)
1892 ASM_OUTPUT_BYTE (asm_out_file, INTVAL (x));
1897 /* Finally, if SIZE is larger than a single word, try to output the constant
1898 one word at a time. */
1900 if (size > UNITS_PER_WORD)
1903 enum machine_mode mode
1904 = mode_for_size (size * BITS_PER_UNIT, MODE_INT, 0);
1907 for (i = 0; i < size / UNITS_PER_WORD; i++)
1909 word = operand_subword (x, i, 0, mode);
1914 if (! assemble_integer (word, UNITS_PER_WORD, 0))
1918 if (i == size / UNITS_PER_WORD)
1920 /* If we output at least one word and then could not finish,
1921 there is no valid way to continue. */
1932 /* Assemble the floating-point constant D into an object of size MODE. */
1935 assemble_real (d, mode)
1937 enum machine_mode mode;
1939 jmp_buf output_constant_handler;
1941 if (setjmp (output_constant_handler))
1943 error ("floating point trap outputting a constant");
1944 #ifdef REAL_IS_NOT_DOUBLE
1945 bzero ((char *) &d, sizeof d);
1952 set_float_handler (output_constant_handler);
1956 #ifdef ASM_OUTPUT_BYTE_FLOAT
1958 ASM_OUTPUT_BYTE_FLOAT (asm_out_file, d);
1961 #ifdef ASM_OUTPUT_SHORT_FLOAT
1963 ASM_OUTPUT_SHORT_FLOAT (asm_out_file, d);
1966 #ifdef ASM_OUTPUT_THREE_QUARTER_FLOAT
1968 ASM_OUTPUT_THREE_QUARTER_FLOAT (asm_out_file, d);
1971 #ifdef ASM_OUTPUT_FLOAT
1973 ASM_OUTPUT_FLOAT (asm_out_file, d);
1977 #ifdef ASM_OUTPUT_DOUBLE
1979 ASM_OUTPUT_DOUBLE (asm_out_file, d);
1983 #ifdef ASM_OUTPUT_LONG_DOUBLE
1986 ASM_OUTPUT_LONG_DOUBLE (asm_out_file, d);
1994 set_float_handler (NULL_PTR);
1997 /* Here we combine duplicate floating constants to make
1998 CONST_DOUBLE rtx's, and force those out to memory when necessary. */
2000 /* Return a CONST_DOUBLE or CONST_INT for a value specified as a pair of ints.
2001 For an integer, I0 is the low-order word and I1 is the high-order word.
2002 For a real number, I0 is the word with the low address
2003 and I1 is the word with the high address. */
2006 immed_double_const (i0, i1, mode)
2007 HOST_WIDE_INT i0, i1;
2008 enum machine_mode mode;
2012 if (GET_MODE_CLASS (mode) == MODE_INT
2013 || GET_MODE_CLASS (mode) == MODE_PARTIAL_INT)
2015 /* We clear out all bits that don't belong in MODE, unless they and our
2016 sign bit are all one. So we get either a reasonable negative value
2017 or a reasonable unsigned value for this mode. */
2018 int width = GET_MODE_BITSIZE (mode);
2019 if (width < HOST_BITS_PER_WIDE_INT
2020 && ((i0 & ((HOST_WIDE_INT) (-1) << (width - 1)))
2021 != ((HOST_WIDE_INT) (-1) << (width - 1))))
2022 i0 &= ((HOST_WIDE_INT) 1 << width) - 1, i1 = 0;
2023 else if (width == HOST_BITS_PER_WIDE_INT
2024 && ! (i1 == ~0 && i0 < 0))
2026 else if (width > 2 * HOST_BITS_PER_WIDE_INT)
2027 /* We cannot represent this value as a constant. */
2030 /* If this would be an entire word for the target, but is not for
2031 the host, then sign-extend on the host so that the number will look
2032 the same way on the host that it would on the target.
2034 For example, when building a 64 bit alpha hosted 32 bit sparc
2035 targeted compiler, then we want the 32 bit unsigned value -1 to be
2036 represented as a 64 bit value -1, and not as 0x00000000ffffffff.
2037 The later confuses the sparc backend. */
2039 if (BITS_PER_WORD < HOST_BITS_PER_WIDE_INT && BITS_PER_WORD == width
2040 && (i0 & ((HOST_WIDE_INT) 1 << (width - 1))))
2041 i0 |= ((HOST_WIDE_INT) (-1) << width);
2043 /* If MODE fits within HOST_BITS_PER_WIDE_INT, always use a CONST_INT.
2045 ??? Strictly speaking, this is wrong if we create a CONST_INT
2046 for a large unsigned constant with the size of MODE being
2047 HOST_BITS_PER_WIDE_INT and later try to interpret that constant in a
2048 wider mode. In that case we will mis-interpret it as a negative
2051 Unfortunately, the only alternative is to make a CONST_DOUBLE
2052 for any constant in any mode if it is an unsigned constant larger
2053 than the maximum signed integer in an int on the host. However,
2054 doing this will break everyone that always expects to see a CONST_INT
2055 for SImode and smaller.
2057 We have always been making CONST_INTs in this case, so nothing new
2060 if (width <= HOST_BITS_PER_WIDE_INT)
2061 i1 = (i0 < 0) ? ~(HOST_WIDE_INT) 0 : 0;
2063 /* If this integer fits in one word, return a CONST_INT. */
2064 if ((i1 == 0 && i0 >= 0)
2065 || (i1 == ~0 && i0 < 0))
2066 return GEN_INT (i0);
2068 /* We use VOIDmode for integers. */
2072 /* Search the chain for an existing CONST_DOUBLE with the right value.
2073 If one is found, return it. */
2074 if (current_function != 0)
2075 for (r = const_double_chain; r; r = CONST_DOUBLE_CHAIN (r))
2076 if (CONST_DOUBLE_LOW (r) == i0 && CONST_DOUBLE_HIGH (r) == i1
2077 && GET_MODE (r) == mode)
2080 /* No; make a new one and add it to the chain.
2082 We may be called by an optimizer which may be discarding any memory
2083 allocated during its processing (such as combine and loop). However,
2084 we will be leaving this constant on the chain, so we cannot tolerate
2085 freed memory. So switch to saveable_obstack for this allocation
2086 and then switch back if we were in current_obstack. */
2088 push_obstacks_nochange ();
2089 rtl_in_saveable_obstack ();
2090 r = gen_rtx_CONST_DOUBLE (mode, NULL_RTX, i0, i1);
2093 /* Don't touch const_double_chain if not inside any function. */
2094 if (current_function_decl != 0)
2096 CONST_DOUBLE_CHAIN (r) = const_double_chain;
2097 const_double_chain = r;
2100 /* Store const0_rtx in mem-slot since this CONST_DOUBLE is on the chain.
2101 Actual use of mem-slot is only through force_const_mem. */
2103 CONST_DOUBLE_MEM (r) = const0_rtx;
2108 /* Return a CONST_DOUBLE for a specified `double' value
2109 and machine mode. */
2112 immed_real_const_1 (d, mode)
2114 enum machine_mode mode;
2116 union real_extract u;
2119 /* Get the desired `double' value as a sequence of ints
2120 since that is how they are stored in a CONST_DOUBLE. */
2124 /* Detect special cases. */
2126 if (REAL_VALUES_IDENTICAL (dconst0, d))
2127 return CONST0_RTX (mode);
2128 /* Check for NaN first, because some ports (specifically the i386) do not
2129 emit correct ieee-fp code by default, and thus will generate a core
2130 dump here if we pass a NaN to REAL_VALUES_EQUAL and if REAL_VALUES_EQUAL
2131 does a floating point comparison. */
2132 else if (! REAL_VALUE_ISNAN (d) && REAL_VALUES_EQUAL (dconst1, d))
2133 return CONST1_RTX (mode);
2135 if (sizeof u == sizeof (HOST_WIDE_INT))
2136 return immed_double_const (u.i[0], 0, mode);
2137 if (sizeof u == 2 * sizeof (HOST_WIDE_INT))
2138 return immed_double_const (u.i[0], u.i[1], mode);
2140 /* The rest of this function handles the case where
2141 a float value requires more than 2 ints of space.
2142 It will be deleted as dead code on machines that don't need it. */
2144 /* Search the chain for an existing CONST_DOUBLE with the right value.
2145 If one is found, return it. */
2146 if (current_function != 0)
2147 for (r = const_double_chain; r; r = CONST_DOUBLE_CHAIN (r))
2148 if (! bcmp ((char *) &CONST_DOUBLE_LOW (r), (char *) &u, sizeof u)
2149 && GET_MODE (r) == mode)
2152 /* No; make a new one and add it to the chain.
2154 We may be called by an optimizer which may be discarding any memory
2155 allocated during its processing (such as combine and loop). However,
2156 we will be leaving this constant on the chain, so we cannot tolerate
2157 freed memory. So switch to saveable_obstack for this allocation
2158 and then switch back if we were in current_obstack. */
2159 push_obstacks_nochange ();
2160 rtl_in_saveable_obstack ();
2161 r = rtx_alloc (CONST_DOUBLE);
2164 bcopy ((char *) &u, (char *) &CONST_DOUBLE_LOW (r), sizeof u);
2166 /* Don't touch const_double_chain if not inside any function. */
2167 if (current_function_decl != 0)
2169 CONST_DOUBLE_CHAIN (r) = const_double_chain;
2170 const_double_chain = r;
2173 /* Store const0_rtx in CONST_DOUBLE_MEM since this CONST_DOUBLE is on the
2174 chain, but has not been allocated memory. Actual use of CONST_DOUBLE_MEM
2175 is only through force_const_mem. */
2177 CONST_DOUBLE_MEM (r) = const0_rtx;
2182 /* Return a CONST_DOUBLE rtx for a value specified by EXP,
2183 which must be a REAL_CST tree node. */
2186 immed_real_const (exp)
2189 return immed_real_const_1 (TREE_REAL_CST (exp), TYPE_MODE (TREE_TYPE (exp)));
2192 /* At the end of a function, forget the memory-constants
2193 previously made for CONST_DOUBLEs. Mark them as not on real_constant_chain.
2194 Also clear out real_constant_chain and clear out all the chain-pointers. */
2197 clear_const_double_mem ()
2199 register rtx r, next;
2201 for (r = const_double_chain; r; r = next)
2203 next = CONST_DOUBLE_CHAIN (r);
2204 CONST_DOUBLE_CHAIN (r) = 0;
2205 CONST_DOUBLE_MEM (r) = cc0_rtx;
2207 const_double_chain = 0;
2210 /* Given an expression EXP with a constant value,
2211 reduce it to the sum of an assembler symbol and an integer.
2212 Store them both in the structure *VALUE.
2213 Abort if EXP does not reduce. */
2218 HOST_WIDE_INT offset;
2222 decode_addr_const (exp, value)
2224 struct addr_const *value;
2226 register tree target = TREE_OPERAND (exp, 0);
2227 register int offset = 0;
2232 if (TREE_CODE (target) == COMPONENT_REF
2233 && (TREE_CODE (DECL_FIELD_BITPOS (TREE_OPERAND (target, 1)))
2236 offset += TREE_INT_CST_LOW (DECL_FIELD_BITPOS (TREE_OPERAND (target, 1))) / BITS_PER_UNIT;
2237 target = TREE_OPERAND (target, 0);
2239 else if (TREE_CODE (target) == ARRAY_REF)
2241 if (TREE_CODE (TREE_OPERAND (target, 1)) != INTEGER_CST
2242 || TREE_CODE (TYPE_SIZE (TREE_TYPE (target))) != INTEGER_CST)
2244 offset += ((TREE_INT_CST_LOW (TYPE_SIZE (TREE_TYPE (target)))
2245 * TREE_INT_CST_LOW (TREE_OPERAND (target, 1)))
2247 target = TREE_OPERAND (target, 0);
2253 switch (TREE_CODE (target))
2257 x = DECL_RTL (target);
2261 x = gen_rtx_MEM (FUNCTION_MODE,
2262 gen_rtx_LABEL_REF (VOIDmode,
2263 label_rtx (TREE_OPERAND (exp, 0))));
2271 x = TREE_CST_RTL (target);
2278 if (GET_CODE (x) != MEM)
2283 value->offset = offset;
2286 /* Uniquize all constants that appear in memory.
2287 Each constant in memory thus far output is recorded
2288 in `const_hash_table' with a `struct constant_descriptor'
2289 that contains a polish representation of the value of
2292 We cannot store the trees in the hash table
2293 because the trees may be temporary. */
2295 struct constant_descriptor
2297 struct constant_descriptor *next;
2303 #define MAX_HASH_TABLE 1009
2304 static struct constant_descriptor *const_hash_table[MAX_HASH_TABLE];
2306 /* Mark a const_hash_table descriptor for GC. */
2309 mark_const_hash_entry (ptr)
2312 struct constant_descriptor *desc = * (struct constant_descriptor **) ptr;
2316 ggc_mark_string (desc->label);
2321 /* Compute a hash code for a constant expression. */
2328 register int len, hi, i;
2329 register enum tree_code code = TREE_CODE (exp);
2331 /* Either set P and LEN to the address and len of something to hash and
2332 exit the switch or return a value. */
2337 p = (char *) &TREE_INT_CST_LOW (exp);
2338 len = 2 * sizeof TREE_INT_CST_LOW (exp);
2342 p = (char *) &TREE_REAL_CST (exp);
2343 len = sizeof TREE_REAL_CST (exp);
2347 p = TREE_STRING_POINTER (exp);
2348 len = TREE_STRING_LENGTH (exp);
2352 return (const_hash (TREE_REALPART (exp)) * 5
2353 + const_hash (TREE_IMAGPART (exp)));
2356 if (TREE_CODE (TREE_TYPE (exp)) == SET_TYPE)
2358 len = int_size_in_bytes (TREE_TYPE (exp));
2359 p = (char *) alloca (len);
2360 get_set_constructor_bytes (exp, (unsigned char *) p, len);
2367 /* For record type, include the type in the hashing.
2368 We do not do so for array types
2369 because (1) the sizes of the elements are sufficient
2370 and (2) distinct array types can have the same constructor.
2371 Instead, we include the array size because the constructor could
2373 if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE)
2374 hi = ((unsigned long) TREE_TYPE (exp) & ((1 << HASHBITS) - 1))
2377 hi = ((5 + int_size_in_bytes (TREE_TYPE (exp)))
2378 & ((1 << HASHBITS) - 1)) % MAX_HASH_TABLE;
2380 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
2381 if (TREE_VALUE (link))
2383 = (hi * 603 + const_hash (TREE_VALUE (link))) % MAX_HASH_TABLE;
2390 struct addr_const value;
2392 decode_addr_const (exp, &value);
2393 if (GET_CODE (value.base) == SYMBOL_REF)
2395 /* Don't hash the address of the SYMBOL_REF;
2396 only use the offset and the symbol name. */
2398 p = XSTR (value.base, 0);
2399 for (i = 0; p[i] != 0; i++)
2400 hi = ((hi * 613) + (unsigned) (p[i]));
2402 else if (GET_CODE (value.base) == LABEL_REF)
2403 hi = value.offset + CODE_LABEL_NUMBER (XEXP (value.base, 0)) * 13;
2407 hi &= (1 << HASHBITS) - 1;
2408 hi %= MAX_HASH_TABLE;
2414 return (const_hash (TREE_OPERAND (exp, 0)) * 9
2415 + const_hash (TREE_OPERAND (exp, 1)));
2419 case NON_LVALUE_EXPR:
2420 return const_hash (TREE_OPERAND (exp, 0)) * 7 + 2;
2426 /* Compute hashing function */
2428 for (i = 0; i < len; i++)
2429 hi = ((hi * 613) + (unsigned) (p[i]));
2431 hi &= (1 << HASHBITS) - 1;
2432 hi %= MAX_HASH_TABLE;
2436 /* Compare a constant expression EXP with a constant-descriptor DESC.
2437 Return 1 if DESC describes a constant with the same value as EXP. */
2440 compare_constant (exp, desc)
2442 struct constant_descriptor *desc;
2444 return 0 != compare_constant_1 (exp, desc->contents);
2447 /* Compare constant expression EXP with a substring P of a constant descriptor.
2448 If they match, return a pointer to the end of the substring matched.
2449 If they do not match, return 0.
2451 Since descriptors are written in polish prefix notation,
2452 this function can be used recursively to test one operand of EXP
2453 against a subdescriptor, and if it succeeds it returns the
2454 address of the subdescriptor for the next operand. */
2457 compare_constant_1 (exp, p)
2461 register char *strp;
2463 register enum tree_code code = TREE_CODE (exp);
2465 if (code != (enum tree_code) *p++)
2468 /* Either set STRP, P and LEN to pointers and length to compare and exit the
2469 switch, or return the result of the comparison. */
2474 /* Integer constants are the same only if the same width of type. */
2475 if (*p++ != TYPE_PRECISION (TREE_TYPE (exp)))
2478 strp = (char *) &TREE_INT_CST_LOW (exp);
2479 len = 2 * sizeof TREE_INT_CST_LOW (exp);
2483 /* Real constants are the same only if the same width of type. */
2484 if (*p++ != TYPE_PRECISION (TREE_TYPE (exp)))
2487 strp = (char *) &TREE_REAL_CST (exp);
2488 len = sizeof TREE_REAL_CST (exp);
2492 if (flag_writable_strings)
2495 if (*p++ != TYPE_MODE (TREE_TYPE (exp)))
2498 strp = TREE_STRING_POINTER (exp);
2499 len = TREE_STRING_LENGTH (exp);
2500 if (bcmp ((char *) &TREE_STRING_LENGTH (exp), p,
2501 sizeof TREE_STRING_LENGTH (exp)))
2504 p += sizeof TREE_STRING_LENGTH (exp);
2508 p = compare_constant_1 (TREE_REALPART (exp), p);
2512 return compare_constant_1 (TREE_IMAGPART (exp), p);
2515 if (TREE_CODE (TREE_TYPE (exp)) == SET_TYPE)
2517 int xlen = len = int_size_in_bytes (TREE_TYPE (exp));
2519 strp = (char *) alloca (len);
2520 get_set_constructor_bytes (exp, (unsigned char *) strp, len);
2521 if (bcmp ((char *) &xlen, p, sizeof xlen))
2530 int length = list_length (CONSTRUCTOR_ELTS (exp));
2532 int have_purpose = 0;
2534 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
2535 if (TREE_PURPOSE (link))
2538 if (bcmp ((char *) &length, p, sizeof length))
2543 /* For record constructors, insist that the types match.
2544 For arrays, just verify both constructors are for arrays.
2545 Then insist that either both or none have any TREE_PURPOSE
2547 if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE)
2548 type = TREE_TYPE (exp);
2552 if (bcmp ((char *) &type, p, sizeof type))
2557 if (bcmp ((char *) &have_purpose, p, sizeof have_purpose))
2560 p += sizeof have_purpose;
2562 /* For arrays, insist that the size in bytes match. */
2563 if (TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE)
2565 HOST_WIDE_INT size = int_size_in_bytes (TREE_TYPE (exp));
2567 if (bcmp ((char *) &size, p, sizeof size))
2573 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
2575 if (TREE_VALUE (link))
2577 if ((p = compare_constant_1 (TREE_VALUE (link), p)) == 0)
2584 if (bcmp ((char *) &zero, p, sizeof zero))
2590 if (TREE_PURPOSE (link)
2591 && TREE_CODE (TREE_PURPOSE (link)) == FIELD_DECL)
2593 if (bcmp ((char *) &TREE_PURPOSE (link), p,
2594 sizeof TREE_PURPOSE (link)))
2597 p += sizeof TREE_PURPOSE (link);
2599 else if (TREE_PURPOSE (link))
2601 if ((p = compare_constant_1 (TREE_PURPOSE (link), p)) == 0)
2604 else if (have_purpose)
2608 if (bcmp ((char *) &zero, p, sizeof zero))
2620 struct addr_const value;
2622 decode_addr_const (exp, &value);
2623 strp = (char *) &value.offset;
2624 len = sizeof value.offset;
2625 /* Compare the offset. */
2627 if (*p++ != *strp++)
2630 /* Compare symbol name. */
2631 strp = XSTR (value.base, 0);
2632 len = strlen (strp) + 1;
2639 p = compare_constant_1 (TREE_OPERAND (exp, 0), p);
2643 return compare_constant_1 (TREE_OPERAND (exp, 1), p);
2647 case NON_LVALUE_EXPR:
2648 return compare_constant_1 (TREE_OPERAND (exp, 0), p);
2654 /* Compare constant contents. */
2656 if (*p++ != *strp++)
2662 /* Construct a constant descriptor for the expression EXP.
2663 It is up to the caller to enter the descriptor in the hash table. */
2665 static struct constant_descriptor *
2666 record_constant (exp)
2669 struct constant_descriptor *next = 0;
2672 /* Make a struct constant_descriptor. The first two pointers will
2673 be filled in later. Here we just leave space for them. */
2675 obstack_grow (&permanent_obstack, (char *) &next, sizeof next);
2676 obstack_grow (&permanent_obstack, (char *) &label, sizeof label);
2677 record_constant_1 (exp);
2678 return (struct constant_descriptor *) obstack_finish (&permanent_obstack);
2681 /* Add a description of constant expression EXP
2682 to the object growing in `permanent_obstack'.
2683 No need to return its address; the caller will get that
2684 from the obstack when the object is complete. */
2687 record_constant_1 (exp)
2690 register char *strp;
2692 register enum tree_code code = TREE_CODE (exp);
2694 obstack_1grow (&permanent_obstack, (unsigned int) code);
2699 obstack_1grow (&permanent_obstack, TYPE_PRECISION (TREE_TYPE (exp)));
2700 strp = (char *) &TREE_INT_CST_LOW (exp);
2701 len = 2 * sizeof TREE_INT_CST_LOW (exp);
2705 obstack_1grow (&permanent_obstack, TYPE_PRECISION (TREE_TYPE (exp)));
2706 strp = (char *) &TREE_REAL_CST (exp);
2707 len = sizeof TREE_REAL_CST (exp);
2711 if (flag_writable_strings)
2714 obstack_1grow (&permanent_obstack, TYPE_MODE (TREE_TYPE (exp)));
2715 strp = TREE_STRING_POINTER (exp);
2716 len = TREE_STRING_LENGTH (exp);
2717 obstack_grow (&permanent_obstack, (char *) &TREE_STRING_LENGTH (exp),
2718 sizeof TREE_STRING_LENGTH (exp));
2722 record_constant_1 (TREE_REALPART (exp));
2723 record_constant_1 (TREE_IMAGPART (exp));
2727 if (TREE_CODE (TREE_TYPE (exp)) == SET_TYPE)
2729 int nbytes = int_size_in_bytes (TREE_TYPE (exp));
2730 obstack_grow (&permanent_obstack, &nbytes, sizeof (nbytes));
2731 obstack_blank (&permanent_obstack, nbytes);
2732 get_set_constructor_bytes
2733 (exp, (unsigned char *) permanent_obstack.next_free-nbytes,
2740 int length = list_length (CONSTRUCTOR_ELTS (exp));
2742 int have_purpose = 0;
2744 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
2745 if (TREE_PURPOSE (link))
2748 obstack_grow (&permanent_obstack, (char *) &length, sizeof length);
2750 /* For record constructors, insist that the types match.
2751 For arrays, just verify both constructors are for arrays.
2752 Then insist that either both or none have any TREE_PURPOSE
2754 if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE)
2755 type = TREE_TYPE (exp);
2758 obstack_grow (&permanent_obstack, (char *) &type, sizeof type);
2759 obstack_grow (&permanent_obstack, (char *) &have_purpose,
2760 sizeof have_purpose);
2762 /* For arrays, insist that the size in bytes match. */
2763 if (TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE)
2765 HOST_WIDE_INT size = int_size_in_bytes (TREE_TYPE (exp));
2766 obstack_grow (&permanent_obstack, (char *) &size, sizeof size);
2769 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
2771 if (TREE_VALUE (link))
2772 record_constant_1 (TREE_VALUE (link));
2777 obstack_grow (&permanent_obstack,
2778 (char *) &zero, sizeof zero);
2781 if (TREE_PURPOSE (link)
2782 && TREE_CODE (TREE_PURPOSE (link)) == FIELD_DECL)
2783 obstack_grow (&permanent_obstack,
2784 (char *) &TREE_PURPOSE (link),
2785 sizeof TREE_PURPOSE (link));
2786 else if (TREE_PURPOSE (link))
2787 record_constant_1 (TREE_PURPOSE (link));
2788 else if (have_purpose)
2792 obstack_grow (&permanent_obstack,
2793 (char *) &zero, sizeof zero);
2801 struct addr_const value;
2803 decode_addr_const (exp, &value);
2804 /* Record the offset. */
2805 obstack_grow (&permanent_obstack,
2806 (char *) &value.offset, sizeof value.offset);
2807 /* Record the symbol name. */
2808 obstack_grow (&permanent_obstack, XSTR (value.base, 0),
2809 strlen (XSTR (value.base, 0)) + 1);
2816 record_constant_1 (TREE_OPERAND (exp, 0));
2817 record_constant_1 (TREE_OPERAND (exp, 1));
2822 case NON_LVALUE_EXPR:
2823 record_constant_1 (TREE_OPERAND (exp, 0));
2830 /* Record constant contents. */
2831 obstack_grow (&permanent_obstack, strp, len);
2834 /* Record a list of constant expressions that were passed to
2835 output_constant_def but that could not be output right away. */
2837 struct deferred_constant
2839 struct deferred_constant *next;
2845 static struct deferred_constant *deferred_constants;
2847 /* Another list of constants which should be output after the
2849 static struct deferred_constant *after_function_constants;
2851 /* Nonzero means defer output of addressed subconstants
2852 (i.e., those for which output_constant_def is called.) */
2853 static int defer_addressed_constants_flag;
2855 /* Start deferring output of subconstants. */
2858 defer_addressed_constants ()
2860 defer_addressed_constants_flag++;
2863 /* Stop deferring output of subconstants,
2864 and output now all those that have been deferred. */
2867 output_deferred_addressed_constants ()
2869 struct deferred_constant *p, *next;
2871 defer_addressed_constants_flag--;
2873 if (defer_addressed_constants_flag > 0)
2876 for (p = deferred_constants; p; p = next)
2878 output_constant_def_contents (p->exp, p->reloc, p->labelno);
2883 deferred_constants = 0;
2886 /* Output any constants which should appear after a function. */
2889 output_after_function_constants ()
2891 struct deferred_constant *p, *next;
2893 for (p = after_function_constants; p; p = next)
2895 output_constant_def_contents (p->exp, p->reloc, p->labelno);
2900 after_function_constants = 0;
2903 /* Make a copy of the whole tree structure for a constant.
2904 This handles the same types of nodes that compare_constant
2905 and record_constant handle. */
2911 switch (TREE_CODE (exp))
2914 /* For ADDR_EXPR, we do not want to copy the decl whose address
2915 is requested. We do want to copy constants though. */
2916 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, 0))) == 'c')
2917 return build1 (TREE_CODE (exp), TREE_TYPE (exp),
2918 copy_constant (TREE_OPERAND (exp, 0)));
2920 return copy_node (exp);
2925 return copy_node (exp);
2928 return build_complex (TREE_TYPE (exp),
2929 copy_constant (TREE_REALPART (exp)),
2930 copy_constant (TREE_IMAGPART (exp)));
2934 return build (TREE_CODE (exp), TREE_TYPE (exp),
2935 copy_constant (TREE_OPERAND (exp, 0)),
2936 copy_constant (TREE_OPERAND (exp, 1)));
2940 case NON_LVALUE_EXPR:
2941 return build1 (TREE_CODE (exp), TREE_TYPE (exp),
2942 copy_constant (TREE_OPERAND (exp, 0)));
2946 tree copy = copy_node (exp);
2947 tree list = copy_list (CONSTRUCTOR_ELTS (exp));
2950 CONSTRUCTOR_ELTS (copy) = list;
2951 for (tail = list; tail; tail = TREE_CHAIN (tail))
2952 TREE_VALUE (tail) = copy_constant (TREE_VALUE (tail));
2953 if (TREE_CODE (TREE_TYPE (exp)) == SET_TYPE)
2954 for (tail = list; tail; tail = TREE_CHAIN (tail))
2955 TREE_PURPOSE (tail) = copy_constant (TREE_PURPOSE (tail));
2965 /* Return an rtx representing a reference to constant data in memory
2966 for the constant expression EXP.
2968 If assembler code for such a constant has already been output,
2969 return an rtx to refer to it.
2970 Otherwise, output such a constant in memory (or defer it for later)
2971 and generate an rtx for it.
2973 The TREE_CST_RTL of EXP is set up to point to that rtx.
2974 The const_hash_table records which constants already have label strings. */
2977 output_constant_def (exp)
2981 register struct constant_descriptor *desc;
2987 if (TREE_CST_RTL (exp))
2988 return TREE_CST_RTL (exp);
2990 /* Make sure any other constants whose addresses appear in EXP
2991 are assigned label numbers. */
2993 reloc = output_addressed_constants (exp);
2995 /* Compute hash code of EXP. Search the descriptors for that hash code
2996 to see if any of them describes EXP. If yes, the descriptor records
2997 the label number already assigned. */
2999 hash = const_hash (exp) % MAX_HASH_TABLE;
3001 for (desc = const_hash_table[hash]; desc; desc = desc->next)
3002 if (compare_constant (exp, desc))
3004 found = desc->label;
3010 /* No constant equal to EXP is known to have been output.
3011 Make a constant descriptor to enter EXP in the hash table.
3012 Assign the label number and record it in the descriptor for
3013 future calls to this function to find. */
3015 /* Create a string containing the label name, in LABEL. */
3016 ASM_GENERATE_INTERNAL_LABEL (label, "LC", const_labelno);
3018 desc = record_constant (exp);
3019 desc->next = const_hash_table[hash];
3020 desc->label = ggc_alloc_string (label, -1);
3021 const_hash_table[hash] = desc;
3024 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
3026 push_obstacks_nochange ();
3027 if (TREE_PERMANENT (exp))
3028 end_temporary_allocation ();
3030 def = gen_rtx_SYMBOL_REF (Pmode, desc->label);
3033 = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp)), def);
3034 RTX_UNCHANGING_P (TREE_CST_RTL (exp)) = 1;
3035 if (AGGREGATE_TYPE_P (TREE_TYPE (exp)))
3036 MEM_SET_IN_STRUCT_P (TREE_CST_RTL (exp), 1);
3040 /* Optionally set flags or add text to the name to record information
3041 such as that it is a function name. If the name is changed, the macro
3042 ASM_OUTPUT_LABELREF will have to know how to strip this information. */
3043 #ifdef ENCODE_SECTION_INFO
3044 ENCODE_SECTION_INFO (exp);
3047 /* If this is the first time we've seen this particular constant,
3048 output it (or defer its output for later). */
3051 int after_function = 0;
3053 #ifdef CONSTANT_AFTER_FUNCTION_P
3054 if (current_function_decl != 0
3055 && CONSTANT_AFTER_FUNCTION_P (exp))
3059 if (defer_addressed_constants_flag || after_function)
3061 struct deferred_constant *p;
3062 p = (struct deferred_constant *) xmalloc (sizeof (struct deferred_constant));
3064 push_obstacks_nochange ();
3065 suspend_momentary ();
3066 p->exp = copy_constant (exp);
3069 p->labelno = const_labelno++;
3072 p->next = after_function_constants;
3073 after_function_constants = p;
3077 p->next = deferred_constants;
3078 deferred_constants = p;
3083 /* Do no output if -fsyntax-only. */
3084 if (! flag_syntax_only)
3085 output_constant_def_contents (exp, reloc, const_labelno);
3090 return TREE_CST_RTL (exp);
3093 /* Now output assembler code to define the label for EXP,
3094 and follow it with the data of EXP. */
3097 output_constant_def_contents (exp, reloc, labelno)
3104 if (IN_NAMED_SECTION (exp))
3105 named_section (exp, NULL, reloc);
3108 /* First switch to text section, except for writable strings. */
3109 #ifdef SELECT_SECTION
3110 SELECT_SECTION (exp, reloc);
3112 if (((TREE_CODE (exp) == STRING_CST) && flag_writable_strings)
3113 || (flag_pic && reloc))
3116 readonly_data_section ();
3120 /* Align the location counter as required by EXP's data type. */
3121 align = TYPE_ALIGN (TREE_TYPE (exp));
3122 #ifdef CONSTANT_ALIGNMENT
3123 align = CONSTANT_ALIGNMENT (exp, align);
3126 if (align > BITS_PER_UNIT)
3127 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
3129 /* Output the label itself. */
3130 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LC", labelno);
3132 /* Output the value of EXP. */
3133 output_constant (exp,
3134 (TREE_CODE (exp) == STRING_CST
3135 ? TREE_STRING_LENGTH (exp)
3136 : int_size_in_bytes (TREE_TYPE (exp))));
3140 /* Structure to represent sufficient information about a constant so that
3141 it can be output when the constant pool is output, so that function
3142 integration can be done, and to simplify handling on machines that reference
3143 constant pool as base+displacement. */
3145 struct pool_constant
3147 struct constant_descriptor *desc;
3148 struct pool_constant *next;
3149 enum machine_mode mode;
3157 /* Structure used to maintain hash table mapping symbols used to their
3158 corresponding constants. */
3163 struct pool_constant *pool;
3164 struct pool_sym *next;
3167 /* Hash code for a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true.
3168 The argument is XSTR (... , 0) */
3170 #define SYMHASH(LABEL) \
3171 ((((unsigned long) (LABEL)) & ((1 << HASHBITS) - 1)) % MAX_RTX_HASH_TABLE)
3173 /* Initialize constant pool hashing for a new function. */
3176 init_varasm_status (f)
3179 struct varasm_status *p;
3180 p = (struct varasm_status *) xmalloc (sizeof (struct varasm_status));
3182 p->x_const_rtx_hash_table
3183 = ((struct constant_descriptor **)
3184 xmalloc (MAX_RTX_HASH_TABLE * sizeof (struct constant_descriptor *)));
3185 p->x_const_rtx_sym_hash_table
3186 = ((struct pool_sym **)
3187 xmalloc (MAX_RTX_HASH_TABLE * sizeof (struct pool_sym *)));
3188 bzero ((char *) p->x_const_rtx_hash_table,
3189 MAX_RTX_HASH_TABLE * sizeof (struct constant_descriptor *));
3190 bzero ((char *) p->x_const_rtx_sym_hash_table,
3191 MAX_RTX_HASH_TABLE * sizeof (struct pool_sym *));
3193 p->x_first_pool = p->x_last_pool = 0;
3194 p->x_pool_offset = 0;
3195 p->x_const_double_chain = 0;
3198 /* Mark PC for GC. */
3201 mark_pool_constant (pc)
3202 struct pool_constant *pc;
3206 ggc_mark_rtx (pc->constant);
3211 /* Mark PPS for GC. */
3214 mark_pool_sym_hash_table (pps)
3215 struct pool_sym **pps;
3217 struct pool_sym *ps;
3220 for (i = 0; i < MAX_RTX_HASH_TABLE; ++i)
3221 for (ps = pps[i]; ps ; ps = ps->next)
3222 ggc_mark_string (ps->label);
3225 /* Mark P for GC. */
3228 mark_varasm_state (p)
3229 struct varasm_status *p;
3231 mark_pool_constant (p->x_first_pool);
3232 mark_pool_sym_hash_table (p->x_const_rtx_sym_hash_table);
3233 ggc_mark_rtx (p->x_const_double_chain);
3236 /* Clear out all parts of the state in F that can safely be discarded
3237 after the function has been compiled, to let garbage collection
3238 reclaim the memory. D is the declaration for the function just
3239 compiled. Its output may have been deferred. */
3242 free_varasm_status (f, d)
3246 struct varasm_status *p;
3248 if (DECL_DEFER_OUTPUT (d))
3252 free (p->x_const_rtx_hash_table);
3253 free (p->x_const_rtx_sym_hash_table);
3255 p->x_first_pool = p->x_last_pool = 0;
3256 p->x_const_rtx_hash_table = 0;
3257 p->x_const_rtx_sym_hash_table = 0;
3258 p->x_const_double_chain = 0;
3261 enum kind { RTX_DOUBLE, RTX_INT };
3265 #ifdef ONLY_INT_FIELDS
3266 unsigned int kind : 16;
3267 unsigned int mode : 16;
3269 enum kind kind : 16;
3270 enum machine_mode mode : 16;
3273 union real_extract du;
3274 struct addr_const addr;
3275 struct {HOST_WIDE_INT high, low;} di;
3279 /* Express an rtx for a constant integer (perhaps symbolic)
3280 as the sum of a symbol or label plus an explicit integer.
3281 They are stored into VALUE. */
3284 decode_rtx_const (mode, x, value)
3285 enum machine_mode mode;
3287 struct rtx_const *value;
3289 /* Clear the whole structure, including any gaps. */
3292 int *p = (int *) value;
3293 int *end = (int *) (value + 1);
3298 value->kind = RTX_INT; /* Most usual kind. */
3301 switch (GET_CODE (x))
3304 value->kind = RTX_DOUBLE;
3305 if (GET_MODE (x) != VOIDmode)
3307 value->mode = GET_MODE (x);
3308 bcopy ((char *) &CONST_DOUBLE_LOW (x),
3309 (char *) &value->un.du, sizeof value->un.du);
3313 value->un.di.low = CONST_DOUBLE_LOW (x);
3314 value->un.di.high = CONST_DOUBLE_HIGH (x);
3319 value->un.addr.offset = INTVAL (x);
3325 value->un.addr.base = x;
3330 if (GET_CODE (x) == PLUS)
3332 value->un.addr.base = XEXP (x, 0);
3333 if (GET_CODE (XEXP (x, 1)) != CONST_INT)
3335 value->un.addr.offset = INTVAL (XEXP (x, 1));
3337 else if (GET_CODE (x) == MINUS)
3339 value->un.addr.base = XEXP (x, 0);
3340 if (GET_CODE (XEXP (x, 1)) != CONST_INT)
3342 value->un.addr.offset = - INTVAL (XEXP (x, 1));
3352 if (value->kind == RTX_INT && value->un.addr.base != 0)
3353 switch (GET_CODE (value->un.addr.base))
3357 /* Use the string's address, not the SYMBOL_REF's address,
3358 for the sake of addresses of library routines.
3359 For a LABEL_REF, compare labels. */
3360 value->un.addr.base = XEXP (value->un.addr.base, 0);
3367 /* Given a MINUS expression, simplify it if both sides
3368 include the same symbol. */
3371 simplify_subtraction (x)
3374 struct rtx_const val0, val1;
3376 decode_rtx_const (GET_MODE (x), XEXP (x, 0), &val0);
3377 decode_rtx_const (GET_MODE (x), XEXP (x, 1), &val1);
3379 if (val0.un.addr.base == val1.un.addr.base)
3380 return GEN_INT (val0.un.addr.offset - val1.un.addr.offset);
3384 /* Compute a hash code for a constant RTL expression. */
3387 const_hash_rtx (mode, x)
3388 enum machine_mode mode;
3394 struct rtx_const value;
3395 decode_rtx_const (mode, x, &value);
3397 /* Compute hashing function */
3399 for (i = 0; i < sizeof value / sizeof (int); i++)
3400 hi += ((int *) &value)[i];
3402 hi &= (1 << HASHBITS) - 1;
3403 hi %= MAX_RTX_HASH_TABLE;
3407 /* Compare a constant rtl object X with a constant-descriptor DESC.
3408 Return 1 if DESC describes a constant with the same value as X. */
3411 compare_constant_rtx (mode, x, desc)
3412 enum machine_mode mode;
3414 struct constant_descriptor *desc;
3416 register int *p = (int *) desc->contents;
3419 struct rtx_const value;
3421 decode_rtx_const (mode, x, &value);
3422 strp = (int *) &value;
3423 len = sizeof value / sizeof (int);
3425 /* Compare constant contents. */
3427 if (*p++ != *strp++)
3433 /* Construct a constant descriptor for the rtl-expression X.
3434 It is up to the caller to enter the descriptor in the hash table. */
3436 static struct constant_descriptor *
3437 record_constant_rtx (mode, x)
3438 enum machine_mode mode;
3441 struct constant_descriptor *ptr;
3443 struct rtx_const value;
3445 decode_rtx_const (mode, x, &value);
3447 /* Put these things in the saveable obstack so we can ensure it won't
3448 be freed if we are called from combine or some other phase that discards
3449 memory allocated from function_obstack (current_obstack). */
3450 obstack_grow (saveable_obstack, &ptr, sizeof ptr);
3451 obstack_grow (saveable_obstack, &label, sizeof label);
3453 /* Record constant contents. */
3454 obstack_grow (saveable_obstack, &value, sizeof value);
3456 return (struct constant_descriptor *) obstack_finish (saveable_obstack);
3459 /* Given a constant rtx X, make (or find) a memory constant for its value
3460 and return a MEM rtx to refer to it in memory. */
3463 force_const_mem (mode, x)
3464 enum machine_mode mode;
3468 register struct constant_descriptor *desc;
3473 /* If we want this CONST_DOUBLE in the same mode as it is in memory
3474 (this will always be true for floating CONST_DOUBLEs that have been
3475 placed in memory, but not for VOIDmode (integer) CONST_DOUBLEs),
3476 use the previous copy. Otherwise, make a new one. Note that in
3477 the unlikely event that this same CONST_DOUBLE is used in two different
3478 modes in an alternating fashion, we will allocate a lot of different
3479 memory locations, but this should be extremely rare. */
3481 if (GET_CODE (x) == CONST_DOUBLE
3482 && GET_CODE (CONST_DOUBLE_MEM (x)) == MEM
3483 && GET_MODE (CONST_DOUBLE_MEM (x)) == mode)
3484 return CONST_DOUBLE_MEM (x);
3486 /* Compute hash code of X. Search the descriptors for that hash code
3487 to see if any of them describes X. If yes, the descriptor records
3488 the label number already assigned. */
3490 hash = const_hash_rtx (mode, x);
3492 for (desc = const_rtx_hash_table[hash]; desc; desc = desc->next)
3493 if (compare_constant_rtx (mode, x, desc))
3495 found = desc->label;
3501 register struct pool_constant *pool;
3502 register struct pool_sym *sym;
3505 /* No constant equal to X is known to have been output.
3506 Make a constant descriptor to enter X in the hash table.
3507 Assign the label number and record it in the descriptor for
3508 future calls to this function to find. */
3510 desc = record_constant_rtx (mode, x);
3511 desc->next = const_rtx_hash_table[hash];
3512 const_rtx_hash_table[hash] = desc;
3514 /* Align the location counter as required by EXP's data type. */
3515 align = (mode == VOIDmode) ? UNITS_PER_WORD : GET_MODE_SIZE (mode);
3516 if (align > BIGGEST_ALIGNMENT / BITS_PER_UNIT)
3517 align = BIGGEST_ALIGNMENT / BITS_PER_UNIT;
3518 #ifdef CONSTANT_ALIGNMENT
3519 align = CONSTANT_ALIGNMENT (make_tree (type_for_mode (mode, 0), x),
3520 align * BITS_PER_UNIT) / BITS_PER_UNIT;
3523 pool_offset += align - 1;
3524 pool_offset &= ~ (align - 1);
3526 /* If RTL is not being placed into the saveable obstack, make a
3527 copy of X that is in the saveable obstack in case we are
3528 being called from combine or some other phase that discards
3529 memory it allocates. We used to only do this if it is a
3530 CONST; however, reload can allocate a CONST_INT when
3531 eliminating registers. */
3532 if (rtl_obstack != saveable_obstack
3533 && (GET_CODE (x) == CONST || GET_CODE (x) == CONST_INT))
3535 push_obstacks_nochange ();
3536 rtl_in_saveable_obstack ();
3538 if (GET_CODE (x) == CONST)
3539 x = gen_rtx_CONST (GET_MODE (x),
3540 gen_rtx_PLUS (GET_MODE (x),
3541 XEXP (XEXP (x, 0), 0),
3542 XEXP (XEXP (x, 0), 1)));
3544 x = GEN_INT (INTVAL (x));
3549 /* Allocate a pool constant descriptor, fill it in, and chain it in. */
3551 pool = (struct pool_constant *) savealloc (sizeof (struct pool_constant));
3555 pool->labelno = const_labelno;
3556 pool->align = align;
3557 pool->offset = pool_offset;
3564 last_pool->next = pool;
3567 pool_offset += GET_MODE_SIZE (mode);
3569 /* Create a string containing the label name, in LABEL. */
3570 ASM_GENERATE_INTERNAL_LABEL (label, "LC", const_labelno);
3574 desc->label = found = ggc_alloc_string (label, -1);
3576 /* Add label to symbol hash table. */
3577 hash = SYMHASH (found);
3578 sym = (struct pool_sym *) savealloc (sizeof (struct pool_sym));
3581 sym->next = const_rtx_sym_hash_table[hash];
3582 const_rtx_sym_hash_table[hash] = sym;
3585 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
3587 def = gen_rtx_MEM (mode, gen_rtx_SYMBOL_REF (Pmode, found));
3589 RTX_UNCHANGING_P (def) = 1;
3590 /* Mark the symbol_ref as belonging to this constants pool. */
3591 CONSTANT_POOL_ADDRESS_P (XEXP (def, 0)) = 1;
3592 current_function_uses_const_pool = 1;
3594 if (GET_CODE (x) == CONST_DOUBLE)
3596 if (CONST_DOUBLE_MEM (x) == cc0_rtx)
3598 CONST_DOUBLE_CHAIN (x) = const_double_chain;
3599 const_double_chain = x;
3601 CONST_DOUBLE_MEM (x) = def;
3607 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
3608 the corresponding pool_constant structure. */
3610 static struct pool_constant *
3611 find_pool_constant (f, addr)
3615 struct pool_sym *sym;
3616 char *label = XSTR (addr, 0);
3618 for (sym = f->varasm->x_const_rtx_sym_hash_table[SYMHASH (label)]; sym; sym = sym->next)
3619 if (sym->label == label)
3625 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
3628 get_pool_constant (addr)
3631 return (find_pool_constant (current_function, addr))->constant;
3634 /* Likewise, but for the constant pool of a specific function. */
3637 get_pool_constant_for_function (f, addr)
3641 return (find_pool_constant (f, addr))->constant;
3644 /* Similar, return the mode. */
3647 get_pool_mode (addr)
3650 return (find_pool_constant (current_function, addr))->mode;
3654 get_pool_mode_for_function (f, addr)
3658 return (find_pool_constant (f, addr))->mode;
3661 /* Similar, return the offset in the constant pool. */
3664 get_pool_offset (addr)
3667 return (find_pool_constant (current_function, addr))->offset;
3670 /* Return the size of the constant pool. */
3678 /* Write all the constants in the constant pool. */
3681 output_constant_pool (fnname, fndecl)
3682 char *fnname ATTRIBUTE_UNUSED;
3683 tree fndecl ATTRIBUTE_UNUSED;
3685 struct pool_constant *pool;
3687 union real_extract u;
3689 /* It is possible for gcc to call force_const_mem and then to later
3690 discard the instructions which refer to the constant. In such a
3691 case we do not need to output the constant. */
3692 mark_constant_pool ();
3694 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3695 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file, fnname, fndecl, pool_offset);
3698 for (pool = first_pool; pool; pool = pool->next)
3705 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3706 whose CODE_LABEL has been deleted. This can occur if a jump table
3707 is eliminated by optimization. If so, write a constant of zero
3708 instead. Note that this can also happen by turning the
3709 CODE_LABEL into a NOTE. */
3710 if (((GET_CODE (x) == LABEL_REF
3711 && (INSN_DELETED_P (XEXP (x, 0))
3712 || GET_CODE (XEXP (x, 0)) == NOTE)))
3713 || (GET_CODE (x) == CONST && GET_CODE (XEXP (x, 0)) == PLUS
3714 && GET_CODE (XEXP (XEXP (x, 0), 0)) == LABEL_REF
3715 && (INSN_DELETED_P (XEXP (XEXP (XEXP (x, 0), 0), 0))
3716 || GET_CODE (XEXP (XEXP (XEXP (x, 0), 0), 0)) == NOTE)))
3719 /* First switch to correct section. */
3720 #ifdef SELECT_RTX_SECTION
3721 SELECT_RTX_SECTION (pool->mode, x);
3723 readonly_data_section ();
3726 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3727 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file, x, pool->mode,
3728 pool->align, pool->labelno, done);
3731 if (pool->align > 1)
3732 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (pool->align));
3734 /* Output the label. */
3735 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LC", pool->labelno);
3737 /* Output the value of the constant itself. */
3738 switch (GET_MODE_CLASS (pool->mode))
3741 if (GET_CODE (x) != CONST_DOUBLE)
3744 bcopy ((char *) &CONST_DOUBLE_LOW (x), (char *) &u, sizeof u);
3745 assemble_real (u.d, pool->mode);
3749 case MODE_PARTIAL_INT:
3750 assemble_integer (x, GET_MODE_SIZE (pool->mode), 1);
3757 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3763 #ifdef ASM_OUTPUT_POOL_EPILOGUE
3764 ASM_OUTPUT_POOL_EPILOGUE (asm_out_file, fnname, fndecl, pool_offset);
3767 /* Done with this pool. */
3768 first_pool = last_pool = 0;
3771 /* Look through the instructions for this function, and mark all the
3772 entries in the constant pool which are actually being used. */
3775 mark_constant_pool ()
3778 struct pool_constant *pool;
3780 if (first_pool == 0)
3783 for (pool = first_pool; pool; pool = pool->next)
3786 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
3787 if (GET_RTX_CLASS (GET_CODE (insn)) == 'i')
3788 mark_constants (PATTERN (insn));
3790 for (insn = current_function_epilogue_delay_list;
3792 insn = XEXP (insn, 1))
3793 if (GET_RTX_CLASS (GET_CODE (insn)) == 'i')
3794 mark_constants (PATTERN (insn));
3796 /* It's possible that the only reference to a symbol is in a symbol
3797 that's in the constant pool. This happens in Fortran under some
3798 situations. (When the constant contains the address of another
3799 constant, and only the first is used directly in an insn.)
3800 This is potentially suboptimal if there's ever a possibility of
3801 backwards (in pool order) 2'd level references. However, it's
3802 not clear that 2'd level references can happen. */
3803 for (pool = first_pool; pool; pool = pool->next)
3805 struct pool_sym *sym;
3808 /* skip unmarked entries; no insn refers to them. */
3812 /* Skip everything except SYMBOL_REFs. */
3813 if (GET_CODE (pool->constant) != SYMBOL_REF)
3815 label = XSTR (pool->constant, 0);
3817 /* Be sure the symbol's value is marked. */
3818 for (sym = const_rtx_sym_hash_table[SYMHASH (label)]; sym;
3820 if (sym->label == label)
3821 sym->pool->mark = 1;
3822 /* If we didn't find it, there's something truly wrong here, but it
3823 will be announced by the assembler. */
3832 register const char *format_ptr;
3837 if (GET_CODE (x) == SYMBOL_REF)
3839 if (CONSTANT_POOL_ADDRESS_P (x))
3840 find_pool_constant (current_function, x)->mark = 1;
3843 /* Never search inside a CONST_DOUBLE, because CONST_DOUBLE_MEM may be
3844 a MEM, but does not constitute a use of that MEM. */
3845 else if (GET_CODE (x) == CONST_DOUBLE)
3848 /* Insns may appear inside a SEQUENCE. Only check the patterns of
3849 insns, not any notes that may be attached. We don't want to mark
3850 a constant just because it happens to appear in a REG_EQUIV note. */
3851 if (GET_RTX_CLASS (GET_CODE (x)) == 'i')
3853 mark_constants (PATTERN (x));
3857 format_ptr = GET_RTX_FORMAT (GET_CODE (x));
3859 for (i = 0; i < GET_RTX_LENGTH (GET_CODE (x)); i++)
3861 switch (*format_ptr++)
3864 mark_constants (XEXP (x, i));
3868 if (XVEC (x, i) != 0)
3872 for (j = 0; j < XVECLEN (x, i); j++)
3873 mark_constants (XVECEXP (x, i, j));
3892 /* Find all the constants whose addresses are referenced inside of EXP,
3893 and make sure assembler code with a label has been output for each one.
3894 Indicate whether an ADDR_EXPR has been encountered. */
3897 output_addressed_constants (exp)
3902 switch (TREE_CODE (exp))
3906 register tree constant = TREE_OPERAND (exp, 0);
3908 while (TREE_CODE (constant) == COMPONENT_REF)
3910 constant = TREE_OPERAND (constant, 0);
3913 if (TREE_CODE_CLASS (TREE_CODE (constant)) == 'c'
3914 || TREE_CODE (constant) == CONSTRUCTOR)
3915 /* No need to do anything here
3916 for addresses of variables or functions. */
3917 output_constant_def (constant);
3924 reloc = output_addressed_constants (TREE_OPERAND (exp, 0));
3925 reloc |= output_addressed_constants (TREE_OPERAND (exp, 1));
3930 case NON_LVALUE_EXPR:
3931 reloc = output_addressed_constants (TREE_OPERAND (exp, 0));
3937 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
3938 if (TREE_VALUE (link) != 0)
3939 reloc |= output_addressed_constants (TREE_VALUE (link));
3949 /* Output assembler code for constant EXP to FILE, with no label.
3950 This includes the pseudo-op such as ".int" or ".byte", and a newline.
3951 Assumes output_addressed_constants has been done on EXP already.
3953 Generate exactly SIZE bytes of assembler data, padding at the end
3954 with zeros if necessary. SIZE must always be specified.
3956 SIZE is important for structure constructors,
3957 since trailing members may have been omitted from the constructor.
3958 It is also important for initialization of arrays from string constants
3959 since the full length of the string constant might not be wanted.
3960 It is also needed for initialization of unions, where the initializer's
3961 type is just one member, and that may not be as long as the union.
3963 There a case in which we would fail to output exactly SIZE bytes:
3964 for a structure constructor that wants to produce more than SIZE bytes.
3965 But such constructors will never be generated for any possible input. */
3968 output_constant (exp, size)
3972 register enum tree_code code = TREE_CODE (TREE_TYPE (exp));
3974 /* Some front-ends use constants other than the standard
3975 language-indepdent varieties, but which may still be output
3976 directly. Give the front-end a chance to convert EXP to a
3977 language-independent representation. */
3978 if (lang_expand_constant)
3979 exp = (*lang_expand_constant) (exp);
3981 if (size == 0 || flag_syntax_only)
3984 /* Eliminate the NON_LVALUE_EXPR_EXPR that makes a cast not be an lvalue.
3985 That way we get the constant (we hope) inside it. Also, strip off any
3986 NOP_EXPR that converts between two record, union, array, or set types. */
3987 while ((TREE_CODE (exp) == NOP_EXPR
3988 && (TREE_TYPE (exp) == TREE_TYPE (TREE_OPERAND (exp, 0))
3989 || AGGREGATE_TYPE_P (TREE_TYPE (exp))))
3990 || TREE_CODE (exp) == NON_LVALUE_EXPR)
3991 exp = TREE_OPERAND (exp, 0);
3993 /* Allow a constructor with no elements for any data type.
3994 This means to fill the space with zeros. */
3995 if (TREE_CODE (exp) == CONSTRUCTOR && CONSTRUCTOR_ELTS (exp) == 0)
3997 assemble_zeros (size);
4008 case REFERENCE_TYPE:
4009 /* ??? What about (int)((float)(int)&foo + 4) */
4010 while (TREE_CODE (exp) == NOP_EXPR || TREE_CODE (exp) == CONVERT_EXPR
4011 || TREE_CODE (exp) == NON_LVALUE_EXPR)
4012 exp = TREE_OPERAND (exp, 0);
4014 if (! assemble_integer (expand_expr (exp, NULL_RTX, VOIDmode,
4015 EXPAND_INITIALIZER),
4017 error ("initializer for integer value is too complicated");
4022 if (TREE_CODE (exp) != REAL_CST)
4023 error ("initializer for floating value is not a floating constant");
4025 assemble_real (TREE_REAL_CST (exp),
4026 mode_for_size (size * BITS_PER_UNIT, MODE_FLOAT, 0));
4031 output_constant (TREE_REALPART (exp), size / 2);
4032 output_constant (TREE_IMAGPART (exp), size / 2);
4033 size -= (size / 2) * 2;
4037 if (TREE_CODE (exp) == CONSTRUCTOR)
4039 output_constructor (exp, size);
4042 else if (TREE_CODE (exp) == STRING_CST)
4046 if (size > TREE_STRING_LENGTH (exp))
4048 excess = size - TREE_STRING_LENGTH (exp);
4049 size = TREE_STRING_LENGTH (exp);
4052 assemble_string (TREE_STRING_POINTER (exp), size);
4061 if (TREE_CODE (exp) == CONSTRUCTOR)
4062 output_constructor (exp, size);
4068 if (TREE_CODE (exp) == INTEGER_CST)
4069 assemble_integer (expand_expr (exp, NULL_RTX,
4070 VOIDmode, EXPAND_INITIALIZER),
4072 else if (TREE_CODE (exp) == CONSTRUCTOR)
4074 unsigned char *buffer = (unsigned char *) alloca (size);
4075 if (get_set_constructor_bytes (exp, buffer, size))
4077 assemble_string ((char *) buffer, size);
4080 error ("unknown set constructor type");
4088 assemble_zeros (size);
4092 /* Subroutine of output_constant, used for CONSTRUCTORs
4093 (aggregate constants).
4094 Generate at least SIZE bytes, padding if necessary. */
4097 output_constructor (exp, size)
4101 register tree link, field = 0;
4102 HOST_WIDE_INT min_index = 0;
4103 /* Number of bytes output or skipped so far.
4104 In other words, current position within the constructor. */
4105 int total_bytes = 0;
4106 /* Non-zero means BYTE contains part of a byte, to be output. */
4107 int byte_buffer_in_use = 0;
4110 if (HOST_BITS_PER_WIDE_INT < BITS_PER_UNIT)
4113 if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE)
4114 field = TYPE_FIELDS (TREE_TYPE (exp));
4116 if (TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE
4117 && TYPE_DOMAIN (TREE_TYPE (exp)) != 0)
4119 = TREE_INT_CST_LOW (TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (exp))));
4121 /* As LINK goes through the elements of the constant,
4122 FIELD goes through the structure fields, if the constant is a structure.
4123 if the constant is a union, then we override this,
4124 by getting the field from the TREE_LIST element.
4125 But the constant could also be an array. Then FIELD is zero.
4127 There is always a maximum of one element in the chain LINK for unions
4128 (even if the initializer in a source program incorrectly contains
4130 for (link = CONSTRUCTOR_ELTS (exp);
4132 link = TREE_CHAIN (link),
4133 field = field ? TREE_CHAIN (field) : 0)
4135 tree val = TREE_VALUE (link);
4138 /* the element in a union constructor specifies the proper field. */
4140 if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE
4141 || TREE_CODE (TREE_TYPE (exp)) == UNION_TYPE)
4143 /* if available, use the type given by link */
4144 if (TREE_PURPOSE (link) != 0)
4145 field = TREE_PURPOSE (link);
4148 if (TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE)
4149 index = TREE_PURPOSE (link);
4151 /* Eliminate the marker that makes a cast not be an lvalue. */
4155 if (index && TREE_CODE (index) == RANGE_EXPR)
4157 register int fieldsize
4158 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (exp)));
4159 HOST_WIDE_INT lo_index = TREE_INT_CST_LOW (TREE_OPERAND (index, 0));
4160 HOST_WIDE_INT hi_index = TREE_INT_CST_LOW (TREE_OPERAND (index, 1));
4161 HOST_WIDE_INT index;
4162 for (index = lo_index; index <= hi_index; index++)
4164 /* Output the element's initial value. */
4166 assemble_zeros (fieldsize);
4168 output_constant (val, fieldsize);
4170 /* Count its size. */
4171 total_bytes += fieldsize;
4174 else if (field == 0 || !DECL_BIT_FIELD (field))
4176 /* An element that is not a bit-field. */
4178 register int fieldsize;
4179 /* Since this structure is static,
4180 we know the positions are constant. */
4181 int bitpos = (field ? (TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field))
4185 bitpos = (TREE_INT_CST_LOW (TYPE_SIZE (TREE_TYPE (val)))
4187 * (TREE_INT_CST_LOW (index) - min_index));
4189 /* Output any buffered-up bit-fields preceding this element. */
4190 if (byte_buffer_in_use)
4192 ASM_OUTPUT_BYTE (asm_out_file, byte);
4194 byte_buffer_in_use = 0;
4197 /* Advance to offset of this element.
4198 Note no alignment needed in an array, since that is guaranteed
4199 if each element has the proper size. */
4200 if ((field != 0 || index != 0) && bitpos != total_bytes)
4202 assemble_zeros (bitpos - total_bytes);
4203 total_bytes = bitpos;
4206 /* Determine size this element should occupy. */
4209 if (TREE_CODE (DECL_SIZE (field)) != INTEGER_CST)
4211 if (TREE_INT_CST_LOW (DECL_SIZE (field)) > 100000)
4213 /* This avoids overflow trouble. */
4214 tree size_tree = size_binop (CEIL_DIV_EXPR,
4216 size_int (BITS_PER_UNIT));
4217 fieldsize = TREE_INT_CST_LOW (size_tree);
4221 fieldsize = TREE_INT_CST_LOW (DECL_SIZE (field));
4222 fieldsize = (fieldsize + BITS_PER_UNIT - 1) / BITS_PER_UNIT;
4226 fieldsize = int_size_in_bytes (TREE_TYPE (TREE_TYPE (exp)));
4228 /* Output the element's initial value. */
4230 assemble_zeros (fieldsize);
4232 output_constant (val, fieldsize);
4234 /* Count its size. */
4235 total_bytes += fieldsize;
4237 else if (val != 0 && TREE_CODE (val) != INTEGER_CST)
4238 error ("invalid initial value for member `%s'",
4239 IDENTIFIER_POINTER (DECL_NAME (field)));
4242 /* Element that is a bit-field. */
4244 int next_offset = TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field));
4246 = (next_offset + TREE_INT_CST_LOW (DECL_SIZE (field)));
4249 val = integer_zero_node;
4251 /* If this field does not start in this (or, next) byte,
4253 if (next_offset / BITS_PER_UNIT != total_bytes)
4255 /* Output remnant of any bit field in previous bytes. */
4256 if (byte_buffer_in_use)
4258 ASM_OUTPUT_BYTE (asm_out_file, byte);
4260 byte_buffer_in_use = 0;
4263 /* If still not at proper byte, advance to there. */
4264 if (next_offset / BITS_PER_UNIT != total_bytes)
4266 assemble_zeros (next_offset / BITS_PER_UNIT - total_bytes);
4267 total_bytes = next_offset / BITS_PER_UNIT;
4271 if (! byte_buffer_in_use)
4274 /* We must split the element into pieces that fall within
4275 separate bytes, and combine each byte with previous or
4276 following bit-fields. */
4278 /* next_offset is the offset n fbits from the beginning of
4279 the structure to the next bit of this element to be processed.
4280 end_offset is the offset of the first bit past the end of
4282 while (next_offset < end_offset)
4286 HOST_WIDE_INT value;
4287 int next_byte = next_offset / BITS_PER_UNIT;
4288 int next_bit = next_offset % BITS_PER_UNIT;
4290 /* Advance from byte to byte
4291 within this element when necessary. */
4292 while (next_byte != total_bytes)
4294 ASM_OUTPUT_BYTE (asm_out_file, byte);
4299 /* Number of bits we can process at once
4300 (all part of the same byte). */
4301 this_time = MIN (end_offset - next_offset,
4302 BITS_PER_UNIT - next_bit);
4303 if (BYTES_BIG_ENDIAN)
4305 /* On big-endian machine, take the most significant bits
4306 first (of the bits that are significant)
4307 and put them into bytes from the most significant end. */
4308 shift = end_offset - next_offset - this_time;
4309 /* Don't try to take a bunch of bits that cross
4310 the word boundary in the INTEGER_CST. */
4311 if (shift < HOST_BITS_PER_WIDE_INT
4312 && shift + this_time > HOST_BITS_PER_WIDE_INT)
4314 this_time -= (HOST_BITS_PER_WIDE_INT - shift);
4315 shift = HOST_BITS_PER_WIDE_INT;
4318 /* Now get the bits from the appropriate constant word. */
4319 if (shift < HOST_BITS_PER_WIDE_INT)
4321 value = TREE_INT_CST_LOW (val);
4323 else if (shift < 2 * HOST_BITS_PER_WIDE_INT)
4325 value = TREE_INT_CST_HIGH (val);
4326 shift -= HOST_BITS_PER_WIDE_INT;
4330 byte |= (((value >> shift)
4331 & (((HOST_WIDE_INT) 1 << this_time) - 1))
4332 << (BITS_PER_UNIT - this_time - next_bit));
4336 /* On little-endian machines,
4337 take first the least significant bits of the value
4338 and pack them starting at the least significant
4339 bits of the bytes. */
4340 shift = (next_offset
4341 - TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field)));
4342 /* Don't try to take a bunch of bits that cross
4343 the word boundary in the INTEGER_CST. */
4344 if (shift < HOST_BITS_PER_WIDE_INT
4345 && shift + this_time > HOST_BITS_PER_WIDE_INT)
4347 this_time -= (HOST_BITS_PER_WIDE_INT - shift);
4348 shift = HOST_BITS_PER_WIDE_INT;
4351 /* Now get the bits from the appropriate constant word. */
4352 if (shift < HOST_BITS_PER_WIDE_INT)
4353 value = TREE_INT_CST_LOW (val);
4354 else if (shift < 2 * HOST_BITS_PER_WIDE_INT)
4356 value = TREE_INT_CST_HIGH (val);
4357 shift -= HOST_BITS_PER_WIDE_INT;
4361 byte |= (((value >> shift)
4362 & (((HOST_WIDE_INT) 1 << this_time) - 1))
4365 next_offset += this_time;
4366 byte_buffer_in_use = 1;
4370 if (byte_buffer_in_use)
4372 ASM_OUTPUT_BYTE (asm_out_file, byte);
4375 if (total_bytes < size)
4376 assemble_zeros (size - total_bytes);
4379 #ifdef HANDLE_PRAGMA_WEAK
4380 /* Add function NAME to the weak symbols list. VALUE is a weak alias
4381 associatd with NAME. */
4384 add_weak (name, value)
4388 struct weak_syms *weak;
4390 weak = (struct weak_syms *) permalloc (sizeof (struct weak_syms));
4395 weak->next = weak_decls;
4397 weak->value = value;
4402 #endif /* HANDLE_PRAGMA_WEAK */
4404 /* Declare DECL to be a weak symbol. */
4410 if (! TREE_PUBLIC (decl))
4411 error_with_decl (decl, "weak declaration of `%s' must be public");
4412 else if (TREE_ASM_WRITTEN (decl))
4413 error_with_decl (decl, "weak declaration of `%s' must precede definition");
4414 else if (SUPPORTS_WEAK)
4415 DECL_WEAK (decl) = 1;
4416 #ifdef HANDLE_PRAGMA_WEAK
4417 add_weak (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl)), NULL);
4421 /* Emit any pending weak declarations. */
4423 #ifdef HANDLE_PRAGMA_WEAK
4424 struct weak_syms * weak_decls;
4430 #ifdef HANDLE_PRAGMA_WEAK
4431 if (HANDLE_PRAGMA_WEAK)
4433 struct weak_syms *t;
4434 for (t = weak_decls; t; t = t->next)
4438 ASM_WEAKEN_LABEL (asm_out_file, t->name);
4440 ASM_OUTPUT_DEF (asm_out_file, t->name, t->value);
4447 /* Remove NAME from the pending list of weak symbols. This prevents
4448 the compiler from emitting multiple .weak directives which confuses
4451 remove_from_pending_weak_list (name)
4452 char *name ATTRIBUTE_UNUSED;
4454 #ifdef HANDLE_PRAGMA_WEAK
4455 if (HANDLE_PRAGMA_WEAK)
4457 struct weak_syms *t;
4458 for (t = weak_decls; t; t = t->next)
4460 if (t->name && strcmp (name, t->name) == 0)
4468 assemble_alias (decl, target)
4469 tree decl, target ATTRIBUTE_UNUSED;
4473 make_decl_rtl (decl, (char *) 0, 1);
4474 name = XSTR (XEXP (DECL_RTL (decl), 0), 0);
4476 #ifdef ASM_OUTPUT_DEF
4477 /* Make name accessible from other files, if appropriate. */
4479 if (TREE_PUBLIC (decl))
4481 #ifdef ASM_WEAKEN_LABEL
4482 if (DECL_WEAK (decl))
4484 ASM_WEAKEN_LABEL (asm_out_file, name);
4485 /* Remove this function from the pending weak list so that
4486 we do not emit multiple .weak directives for it. */
4487 remove_from_pending_weak_list
4488 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl)));
4492 ASM_GLOBALIZE_LABEL (asm_out_file, name);
4495 #ifdef ASM_OUTPUT_DEF_FROM_DECLS
4496 ASM_OUTPUT_DEF_FROM_DECLS (asm_out_file, decl, target);
4498 ASM_OUTPUT_DEF (asm_out_file, name, IDENTIFIER_POINTER (target));
4500 TREE_ASM_WRITTEN (decl) = 1;
4502 #ifdef ASM_OUTPUT_WEAK_ALIAS
4503 if (! DECL_WEAK (decl))
4504 warning ("only weak aliases are supported in this configuration");
4506 ASM_OUTPUT_WEAK_ALIAS (asm_out_file, name, IDENTIFIER_POINTER (target));
4507 TREE_ASM_WRITTEN (decl) = 1;
4509 warning ("alias definitions not supported in this configuration; ignored");
4514 /* This determines whether or not we support link-once semantics. */
4515 #ifndef SUPPORTS_ONE_ONLY
4516 #ifdef MAKE_DECL_ONE_ONLY
4517 #define SUPPORTS_ONE_ONLY 1
4519 #define SUPPORTS_ONE_ONLY 0
4523 /* Returns 1 if the target configuration supports defining public symbols
4524 so that one of them will be chosen at link time instead of generating a
4525 multiply-defined symbol error, whether through the use of weak symbols or
4526 a target-specific mechanism for having duplicates discarded. */
4529 supports_one_only ()
4531 if (SUPPORTS_ONE_ONLY)
4533 return SUPPORTS_WEAK;
4536 /* Set up DECL as a public symbol that can be defined in multiple
4537 translation units without generating a linker error. */
4540 make_decl_one_only (decl)
4543 if (TREE_CODE (decl) != VAR_DECL && TREE_CODE (decl) != FUNCTION_DECL)
4546 TREE_PUBLIC (decl) = 1;
4548 if (TREE_CODE (decl) == VAR_DECL
4549 && (DECL_INITIAL (decl) == 0 || DECL_INITIAL (decl) == error_mark_node))
4550 DECL_COMMON (decl) = 1;
4551 else if (SUPPORTS_ONE_ONLY)
4553 #ifdef MAKE_DECL_ONE_ONLY
4554 MAKE_DECL_ONE_ONLY (decl);
4556 DECL_ONE_ONLY (decl) = 1;
4558 else if (SUPPORTS_WEAK)
4559 DECL_WEAK (decl) = 1;
4567 ggc_add_root (const_hash_table, MAX_HASH_TABLE, sizeof(const_hash_table[0]),
4568 mark_const_hash_entry);
4569 ggc_add_string_root (&in_named_name, 1);