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 *));
191 static enum in_section { no_section, in_text, in_data, in_named
192 #ifdef BSS_SECTION_ASM_OP
195 #ifdef EH_FRAME_SECTION_ASM_OP
198 #ifdef EXTRA_SECTIONS
201 } in_section = no_section;
203 /* Return a non-zero value if DECL has a section attribute. */
204 #define IN_NAMED_SECTION(DECL) \
205 ((TREE_CODE (DECL) == FUNCTION_DECL || TREE_CODE (DECL) == VAR_DECL) \
206 && DECL_SECTION_NAME (DECL) != NULL_TREE)
208 /* Text of section name when in_section == in_named. */
209 static char *in_named_name;
211 /* Define functions like text_section for any extra sections. */
212 #ifdef EXTRA_SECTION_FUNCTIONS
213 EXTRA_SECTION_FUNCTIONS
216 /* Tell assembler to switch to text section. */
221 if (in_section != in_text)
223 fprintf (asm_out_file, "%s\n", TEXT_SECTION_ASM_OP);
224 in_section = in_text;
228 /* Tell assembler to switch to data section. */
233 if (in_section != in_data)
235 if (flag_shared_data)
237 #ifdef SHARED_SECTION_ASM_OP
238 fprintf (asm_out_file, "%s\n", SHARED_SECTION_ASM_OP);
240 fprintf (asm_out_file, "%s\n", DATA_SECTION_ASM_OP);
244 fprintf (asm_out_file, "%s\n", DATA_SECTION_ASM_OP);
246 in_section = in_data;
249 /* Tell assembler to ALWAYS switch to data section, in case
250 it's not sure where it it. */
253 force_data_section ()
255 in_section = no_section;
259 /* Tell assembler to switch to read-only data section. This is normally
263 readonly_data_section ()
265 #ifdef READONLY_DATA_SECTION
266 READONLY_DATA_SECTION (); /* Note this can call data_section. */
272 /* Determine if we're in the text section. */
277 return in_section == in_text;
280 /* Determine if we're in the data section. */
285 return in_section == in_data;
288 /* Tell assembler to change to section NAME for DECL.
289 If DECL is NULL, just switch to section NAME.
290 If NAME is NULL, get the name from DECL.
291 If RELOC is 1, the initializer for DECL contains relocs. */
294 named_section (decl, name, reloc)
297 int reloc ATTRIBUTE_UNUSED;
299 if (decl != NULL_TREE
300 && TREE_CODE_CLASS (TREE_CODE (decl)) != 'd')
303 name = TREE_STRING_POINTER (DECL_SECTION_NAME (decl));
305 if (in_section != in_named || strcmp (name, in_named_name))
307 #ifdef ASM_OUTPUT_SECTION_NAME
308 ASM_OUTPUT_SECTION_NAME (asm_out_file, decl, name, reloc);
310 /* Section attributes are not supported if this macro isn't provided -
311 some host formats don't support them at all. The front-end should
312 already have flagged this as an error. */
316 in_named_name = obstack_alloc (&permanent_obstack, strlen (name) + 1);
317 strcpy (in_named_name, name);
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 = obstack_copy0 (saveable_obstack, label, strlen (label));
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 new_name = (char *) alloca (strlen (name) + CHKR_PREFIX_SIZE + 1);
543 strcpy (new_name, CHKR_PREFIX);
544 strcpy (new_name + CHKR_PREFIX_SIZE, name);
545 name = obstack_copy0 (saveable_obstack, new_name, strlen (new_name));
549 if (DECL_RTL (decl) == 0)
552 = gen_rtx_MEM (DECL_MODE (decl),
553 gen_rtx_SYMBOL_REF (Pmode, name));
555 /* Optionally set flags or add text to the name to record information
556 such as that it is a function name. If the name is changed, the macro
557 ASM_OUTPUT_LABELREF will have to know how to strip this information. */
558 #ifdef ENCODE_SECTION_INFO
559 ENCODE_SECTION_INFO (decl);
564 /* ??? Another way to do this would be to do what halfpic.c does
565 and maintain a hashed table of such critters. */
566 /* ??? Another way to do this would be to pass a flag bit to
567 ENCODE_SECTION_INFO saying whether this is a new decl or not. */
568 /* Let the target reassign the RTL if it wants.
569 This is necessary, for example, when one machine specific
570 decl attribute overrides another. */
571 #ifdef REDO_SECTION_INFO_P
572 if (REDO_SECTION_INFO_P (decl))
573 ENCODE_SECTION_INFO (decl);
577 /* Record at least one function has been defined. */
578 function_defined = 1;
581 /* Given NAME, a putative register name, discard any customary prefixes. */
584 strip_reg_name (name)
587 #ifdef REGISTER_PREFIX
588 if (!strncmp (name, REGISTER_PREFIX, strlen (REGISTER_PREFIX)))
589 name += strlen (REGISTER_PREFIX);
591 if (name[0] == '%' || name[0] == '#')
596 /* Decode an `asm' spec for a declaration as a register name.
597 Return the register number, or -1 if nothing specified,
598 or -2 if the ASMSPEC is not `cc' or `memory' and is not recognized,
599 or -3 if ASMSPEC is `cc' and is not recognized,
600 or -4 if ASMSPEC is `memory' and is not recognized.
601 Accept an exact spelling or a decimal number.
602 Prefixes such as % are optional. */
605 decode_reg_name (asmspec)
612 /* Get rid of confusing prefixes. */
613 asmspec = strip_reg_name (asmspec);
615 /* Allow a decimal number as a "register name". */
616 for (i = strlen (asmspec) - 1; i >= 0; i--)
617 if (! (asmspec[i] >= '0' && asmspec[i] <= '9'))
619 if (asmspec[0] != 0 && i < 0)
622 if (i < FIRST_PSEUDO_REGISTER && i >= 0)
628 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
630 && ! strcmp (asmspec, strip_reg_name (reg_names[i])))
633 #ifdef ADDITIONAL_REGISTER_NAMES
635 static struct { const char *name; int number; } table[]
636 = ADDITIONAL_REGISTER_NAMES;
638 for (i = 0; i < (int)(sizeof (table) / sizeof (table[0])); i++)
639 if (! strcmp (asmspec, table[i].name))
640 return table[i].number;
642 #endif /* ADDITIONAL_REGISTER_NAMES */
644 if (!strcmp (asmspec, "memory"))
647 if (!strcmp (asmspec, "cc"))
656 /* Create the DECL_RTL for a declaration for a static or external variable
657 or static or external function.
658 ASMSPEC, if not 0, is the string which the user specified
659 as the assembler symbol name.
660 TOP_LEVEL is nonzero if this is a file-scope variable.
662 This is never called for PARM_DECL nodes. */
665 make_decl_rtl (decl, asmspec, top_level)
670 register char *name = 0;
673 reg_number = decode_reg_name (asmspec);
675 if (DECL_ASSEMBLER_NAME (decl) != NULL_TREE)
676 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
678 if (reg_number == -2)
680 /* ASMSPEC is given, and not the name of a register. */
681 name = (char *) obstack_alloc (saveable_obstack,
682 strlen (asmspec) + 2);
684 strcpy (&name[1], asmspec);
687 /* For a duplicate declaration, we can be called twice on the
688 same DECL node. Don't discard the RTL already made. */
689 if (DECL_RTL (decl) == 0)
691 /* First detect errors in declaring global registers. */
692 if (TREE_CODE (decl) != FUNCTION_DECL
693 && DECL_REGISTER (decl) && reg_number == -1)
694 error_with_decl (decl,
695 "register name not specified for `%s'");
696 else if (TREE_CODE (decl) != FUNCTION_DECL
697 && DECL_REGISTER (decl) && reg_number < 0)
698 error_with_decl (decl,
699 "invalid register name for `%s'");
700 else if ((reg_number >= 0 || reg_number == -3)
701 && (TREE_CODE (decl) == FUNCTION_DECL
702 && ! DECL_REGISTER (decl)))
703 error_with_decl (decl,
704 "register name given for non-register variable `%s'");
705 else if (TREE_CODE (decl) != FUNCTION_DECL
706 && DECL_REGISTER (decl)
707 && TYPE_MODE (TREE_TYPE (decl)) == BLKmode)
708 error_with_decl (decl,
709 "data type of `%s' isn't suitable for a register");
710 else if (TREE_CODE (decl) != FUNCTION_DECL && DECL_REGISTER (decl)
711 && ! HARD_REGNO_MODE_OK (reg_number,
712 TYPE_MODE (TREE_TYPE (decl))))
713 error_with_decl (decl,
714 "register number for `%s' isn't suitable for data type");
715 /* Now handle properly declared static register variables. */
716 else if (TREE_CODE (decl) != FUNCTION_DECL && DECL_REGISTER (decl))
720 if (DECL_INITIAL (decl) != 0 && top_level)
722 DECL_INITIAL (decl) = 0;
723 error ("global register variable has initial value");
725 if (fixed_regs[reg_number] == 0
726 && function_defined && top_level)
727 error ("global register variable follows a function definition");
728 if (TREE_THIS_VOLATILE (decl))
729 warning ("volatile register variables don't work as you might wish");
731 /* If the user specified one of the eliminables registers here,
732 e.g., FRAME_POINTER_REGNUM, we don't want to get this variable
733 confused with that register and be eliminated. Although this
734 usage is somewhat suspect, we nevertheless use the following
735 kludge to avoid setting DECL_RTL to frame_pointer_rtx. */
738 = gen_rtx_REG (DECL_MODE (decl), FIRST_PSEUDO_REGISTER);
739 REGNO (DECL_RTL (decl)) = reg_number;
740 REG_USERVAR_P (DECL_RTL (decl)) = 1;
744 /* Make this register global, so not usable for anything
746 #ifdef ASM_DECLARE_REGISTER_GLOBAL
747 ASM_DECLARE_REGISTER_GLOBAL (asm_out_file, decl, reg_number, name);
749 nregs = HARD_REGNO_NREGS (reg_number, DECL_MODE (decl));
751 globalize_reg (reg_number + --nregs);
754 /* Specifying a section attribute on a variable forces it into a
755 non-.bss section, and thus it cannot be common. */
756 else if (TREE_CODE (decl) == VAR_DECL
757 && DECL_SECTION_NAME (decl) != NULL_TREE
758 && DECL_INITIAL (decl) == NULL_TREE
759 && DECL_COMMON (decl))
760 DECL_COMMON (decl) = 0;
762 /* Now handle ordinary static variables and functions (in memory).
763 Also handle vars declared register invalidly. */
764 if (DECL_RTL (decl) == 0)
766 /* Can't use just the variable's own name for a variable
767 whose scope is less than the whole file.
768 Concatenate a distinguishing number. */
769 if (!top_level && !TREE_PUBLIC (decl) && asmspec == 0)
773 ASM_FORMAT_PRIVATE_NAME (label, name, var_labelno);
774 name = obstack_copy0 (saveable_obstack, label, strlen (label));
781 /* When -fprefix-function-name is used, the functions
782 names are prefixed. Only nested function names are not
784 if (flag_prefix_function_name && TREE_CODE (decl) == FUNCTION_DECL)
787 new_name = (char *) alloca (strlen (name) + CHKR_PREFIX_SIZE
789 strcpy (new_name, CHKR_PREFIX);
790 strcpy (new_name + CHKR_PREFIX_SIZE, name);
791 name = obstack_copy0 (saveable_obstack,
792 new_name, strlen (new_name));
795 DECL_RTL (decl) = gen_rtx_MEM (DECL_MODE (decl),
796 gen_rtx_SYMBOL_REF (Pmode, name));
797 MEM_ALIAS_SET (DECL_RTL (decl)) = get_alias_set (decl);
799 /* If this variable is to be treated as volatile, show its
800 tree node has side effects. If it has side effects, either
801 because of this test or from TREE_THIS_VOLATILE also
802 being set, show the MEM is volatile. */
803 if (flag_volatile_global && TREE_CODE (decl) == VAR_DECL
804 && TREE_PUBLIC (decl))
805 TREE_SIDE_EFFECTS (decl) = 1;
806 else if (flag_volatile_static && TREE_CODE (decl) == VAR_DECL
807 && (TREE_PUBLIC (decl) || TREE_STATIC (decl)))
808 TREE_SIDE_EFFECTS (decl) = 1;
810 if (TREE_SIDE_EFFECTS (decl))
811 MEM_VOLATILE_P (DECL_RTL (decl)) = 1;
813 if (TREE_READONLY (decl))
814 RTX_UNCHANGING_P (DECL_RTL (decl)) = 1;
815 MEM_SET_IN_STRUCT_P (DECL_RTL (decl),
816 AGGREGATE_TYPE_P (TREE_TYPE (decl)));
818 /* Optionally set flags or add text to the name to record information
819 such as that it is a function name.
820 If the name is changed, the macro ASM_OUTPUT_LABELREF
821 will have to know how to strip this information. */
822 #ifdef ENCODE_SECTION_INFO
823 ENCODE_SECTION_INFO (decl);
829 /* If the old RTL had the wrong mode, fix the mode. */
830 if (GET_MODE (DECL_RTL (decl)) != DECL_MODE (decl))
832 rtx rtl = DECL_RTL (decl);
833 PUT_MODE (rtl, DECL_MODE (decl));
836 /* ??? Another way to do this would be to do what halfpic.c does
837 and maintain a hashed table of such critters. */
838 /* ??? Another way to do this would be to pass a flag bit to
839 ENCODE_SECTION_INFO saying whether this is a new decl or not. */
840 /* Let the target reassign the RTL if it wants.
841 This is necessary, for example, when one machine specific
842 decl attribute overrides another. */
843 #ifdef REDO_SECTION_INFO_P
844 if (REDO_SECTION_INFO_P (decl))
845 ENCODE_SECTION_INFO (decl);
850 /* Make the rtl for variable VAR be volatile.
851 Use this only for static variables. */
854 make_var_volatile (var)
857 if (GET_CODE (DECL_RTL (var)) != MEM)
860 MEM_VOLATILE_P (DECL_RTL (var)) = 1;
863 /* Output alignment directive to align for constant expression EXP. */
866 assemble_constant_align (exp)
871 /* Align the location counter as required by EXP's data type. */
872 align = TYPE_ALIGN (TREE_TYPE (exp));
873 #ifdef CONSTANT_ALIGNMENT
874 align = CONSTANT_ALIGNMENT (exp, align);
877 if (align > BITS_PER_UNIT)
878 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
881 /* Output a string of literal assembler code
882 for an `asm' keyword used between functions. */
885 assemble_asm (string)
890 if (TREE_CODE (string) == ADDR_EXPR)
891 string = TREE_OPERAND (string, 0);
893 fprintf (asm_out_file, "\t%s\n", TREE_STRING_POINTER (string));
896 #if 0 /* This should no longer be needed, because
897 flag_gnu_linker should be 0 on these systems,
898 which should prevent any output
899 if ASM_OUTPUT_CONSTRUCTOR and ASM_OUTPUT_DESTRUCTOR are absent. */
900 #if !(defined(DBX_DEBUGGING_INFO) && !defined(FASCIST_ASSEMBLER))
901 #ifndef ASM_OUTPUT_CONSTRUCTOR
902 #define ASM_OUTPUT_CONSTRUCTOR(file, name)
904 #ifndef ASM_OUTPUT_DESTRUCTOR
905 #define ASM_OUTPUT_DESTRUCTOR(file, name)
910 /* Record an element in the table of global destructors.
911 How this is done depends on what sort of assembler and linker
914 NAME should be the name of a global function to be called
915 at exit time. This name is output using assemble_name. */
918 assemble_destructor (name)
921 #ifdef ASM_OUTPUT_DESTRUCTOR
922 ASM_OUTPUT_DESTRUCTOR (asm_out_file, name);
926 /* Now tell GNU LD that this is part of the static destructor set. */
927 /* This code works for any machine provided you use GNU as/ld. */
928 fprintf (asm_out_file, "%s \"___DTOR_LIST__\",22,0,0,", ASM_STABS_OP);
929 assemble_name (asm_out_file, name);
930 fputc ('\n', asm_out_file);
935 /* Likewise for global constructors. */
938 assemble_constructor (name)
941 #ifdef ASM_OUTPUT_CONSTRUCTOR
942 ASM_OUTPUT_CONSTRUCTOR (asm_out_file, name);
946 /* Now tell GNU LD that this is part of the static constructor set. */
947 /* This code works for any machine provided you use GNU as/ld. */
948 fprintf (asm_out_file, "%s \"___CTOR_LIST__\",22,0,0,", ASM_STABS_OP);
949 assemble_name (asm_out_file, name);
950 fputc ('\n', asm_out_file);
955 /* Likewise for entries we want to record for garbage collection.
956 Garbage collection is still under development. */
959 assemble_gc_entry (name)
962 #ifdef ASM_OUTPUT_GC_ENTRY
963 ASM_OUTPUT_GC_ENTRY (asm_out_file, name);
967 /* Now tell GNU LD that this is part of the static constructor set. */
968 fprintf (asm_out_file, "%s \"___PTR_LIST__\",22,0,0,", ASM_STABS_OP);
969 assemble_name (asm_out_file, name);
970 fputc ('\n', asm_out_file);
975 /* CONSTANT_POOL_BEFORE_FUNCTION may be defined as an expression with
976 a non-zero value if the constant pool should be output before the
977 start of the function, or a zero value if the pool should output
978 after the end of the function. The default is to put it before the
981 #ifndef CONSTANT_POOL_BEFORE_FUNCTION
982 #define CONSTANT_POOL_BEFORE_FUNCTION 1
985 /* Output assembler code for the constant pool of a function and associated
986 with defining the name of the function. DECL describes the function.
987 NAME is the function's name. For the constant pool, we use the current
988 constant pool data. */
991 assemble_start_function (decl, fnname)
997 /* The following code does not need preprocessing in the assembler. */
1001 if (CONSTANT_POOL_BEFORE_FUNCTION)
1002 output_constant_pool (fnname, decl);
1004 #ifdef ASM_OUTPUT_SECTION_NAME
1005 /* If the function is to be put in its own section and it's not in a section
1006 already, indicate so. */
1007 if ((flag_function_sections
1008 && DECL_SECTION_NAME (decl) == NULL_TREE)
1009 || UNIQUE_SECTION_P (decl))
1010 UNIQUE_SECTION (decl, 0);
1013 function_section (decl);
1015 /* Tell assembler to move to target machine's alignment for functions. */
1016 align = floor_log2 (FUNCTION_BOUNDARY / BITS_PER_UNIT);
1018 ASM_OUTPUT_ALIGN (asm_out_file, align);
1020 /* Handle a user-specified function alignment.
1021 Note that we still need to align to FUNCTION_BOUNDARY, as above,
1022 because ASM_OUTPUT_MAX_SKIP_ALIGN might not do any alignment at all. */
1023 if (align_functions_log > align)
1025 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
1026 ASM_OUTPUT_MAX_SKIP_ALIGN (asm_out_file,
1027 align_functions_log, align_functions-1);
1029 ASM_OUTPUT_ALIGN (asm_out_file, align_functions_log);
1033 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
1034 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file, fnname);
1037 #ifdef SDB_DEBUGGING_INFO
1038 /* Output SDB definition of the function. */
1039 if (write_symbols == SDB_DEBUG)
1040 sdbout_mark_begin_function ();
1043 #ifdef DBX_DEBUGGING_INFO
1044 /* Output DBX definition of the function. */
1045 if (write_symbols == DBX_DEBUG)
1046 dbxout_begin_function (decl);
1049 /* Make function name accessible from other files, if appropriate. */
1051 if (TREE_PUBLIC (decl))
1053 if (! first_global_object_name)
1058 if (! DECL_WEAK (decl) && ! DECL_ONE_ONLY (decl))
1059 name = &first_global_object_name;
1061 name = &weak_global_object_name;
1063 STRIP_NAME_ENCODING (p, fnname);
1064 *name = permalloc (strlen (p) + 1);
1068 #ifdef ASM_WEAKEN_LABEL
1069 if (DECL_WEAK (decl))
1071 ASM_WEAKEN_LABEL (asm_out_file, fnname);
1072 /* Remove this function from the pending weak list so that
1073 we do not emit multiple .weak directives for it. */
1074 remove_from_pending_weak_list
1075 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl)));
1079 ASM_GLOBALIZE_LABEL (asm_out_file, fnname);
1082 /* Do any machine/system dependent processing of the function name */
1083 #ifdef ASM_DECLARE_FUNCTION_NAME
1084 ASM_DECLARE_FUNCTION_NAME (asm_out_file, fnname, current_function_decl);
1086 /* Standard thing is just output label for the function. */
1087 ASM_OUTPUT_LABEL (asm_out_file, fnname);
1088 #endif /* ASM_DECLARE_FUNCTION_NAME */
1091 /* Output assembler code associated with defining the size of the
1092 function. DECL describes the function. NAME is the function's name. */
1095 assemble_end_function (decl, fnname)
1099 #ifdef ASM_DECLARE_FUNCTION_SIZE
1100 ASM_DECLARE_FUNCTION_SIZE (asm_out_file, fnname, decl);
1102 if (! CONSTANT_POOL_BEFORE_FUNCTION)
1104 output_constant_pool (fnname, decl);
1105 function_section (decl); /* need to switch back */
1108 /* Output any constants which should appear after the function. */
1109 output_after_function_constants ();
1112 /* Assemble code to leave SIZE bytes of zeros. */
1115 assemble_zeros (size)
1118 /* Do no output if -fsyntax-only. */
1119 if (flag_syntax_only)
1122 #ifdef ASM_NO_SKIP_IN_TEXT
1123 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
1124 so we must output 0s explicitly in the text section. */
1125 if (ASM_NO_SKIP_IN_TEXT && in_text_section ())
1129 for (i = 0; i < size - 20; i += 20)
1132 fprintf (asm_out_file,
1133 "%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);
1135 fprintf (asm_out_file,
1136 "\tbyte 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n");
1142 fprintf (asm_out_file, "%s 0", ASM_BYTE_OP);
1144 fprintf (asm_out_file, "\tbyte 0");
1147 for (; i < size; i++)
1148 fprintf (asm_out_file, ",0");
1149 fprintf (asm_out_file, "\n");
1155 ASM_OUTPUT_SKIP (asm_out_file, size);
1158 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
1161 assemble_align (align)
1164 if (align > BITS_PER_UNIT)
1165 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
1168 /* Assemble a string constant with the specified C string as contents. */
1171 assemble_string (p, size)
1178 /* If the string is very long, split it up. */
1182 int thissize = size - pos;
1183 if (thissize > maximum)
1186 ASM_OUTPUT_ASCII (asm_out_file, p, thissize);
1194 /* Assemble everything that is needed for a variable or function declaration.
1195 Not used for automatic variables, and not used for function definitions.
1196 Should not be called for variables of incomplete structure type.
1198 TOP_LEVEL is nonzero if this variable has file scope.
1199 AT_END is nonzero if this is the special handling, at end of compilation,
1200 to define things that have had only tentative definitions.
1201 DONT_OUTPUT_DATA if nonzero means don't actually output the
1202 initial value (that will be done by the caller). */
1205 assemble_variable (decl, top_level, at_end, dont_output_data)
1207 int top_level ATTRIBUTE_UNUSED;
1209 int dont_output_data;
1211 register char *name;
1213 tree size_tree = NULL_TREE;
1215 enum in_section saved_in_section;
1217 last_assemble_variable_decl = 0;
1219 if (GET_CODE (DECL_RTL (decl)) == REG)
1221 /* Do output symbol info for global register variables, but do nothing
1224 if (TREE_ASM_WRITTEN (decl))
1226 TREE_ASM_WRITTEN (decl) = 1;
1228 /* Do no output if -fsyntax-only. */
1229 if (flag_syntax_only)
1232 #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
1233 /* File-scope global variables are output here. */
1234 if ((write_symbols == DBX_DEBUG || write_symbols == XCOFF_DEBUG)
1236 dbxout_symbol (decl, 0);
1238 #ifdef SDB_DEBUGGING_INFO
1239 if (write_symbols == SDB_DEBUG && top_level
1240 /* Leave initialized global vars for end of compilation;
1241 see comment in compile_file. */
1242 && (TREE_PUBLIC (decl) == 0 || DECL_INITIAL (decl) == 0))
1243 sdbout_symbol (decl, 0);
1246 /* Don't output any DWARF debugging information for variables here.
1247 In the case of local variables, the information for them is output
1248 when we do our recursive traversal of the tree representation for
1249 the entire containing function. In the case of file-scope variables,
1250 we output information for all of them at the very end of compilation
1251 while we are doing our final traversal of the chain of file-scope
1257 /* Normally no need to say anything here for external references,
1258 since assemble_external is called by the language-specific code
1259 when a declaration is first seen. */
1261 if (DECL_EXTERNAL (decl))
1264 /* Output no assembler code for a function declaration.
1265 Only definitions of functions output anything. */
1267 if (TREE_CODE (decl) == FUNCTION_DECL)
1270 /* If type was incomplete when the variable was declared,
1271 see if it is complete now. */
1273 if (DECL_SIZE (decl) == 0)
1274 layout_decl (decl, 0);
1276 /* Still incomplete => don't allocate it; treat the tentative defn
1277 (which is what it must have been) as an `extern' reference. */
1279 if (!dont_output_data && DECL_SIZE (decl) == 0)
1281 error_with_file_and_line (DECL_SOURCE_FILE (decl),
1282 DECL_SOURCE_LINE (decl),
1283 "storage size of `%s' isn't known",
1284 IDENTIFIER_POINTER (DECL_NAME (decl)));
1285 TREE_ASM_WRITTEN (decl) = 1;
1289 /* The first declaration of a variable that comes through this function
1290 decides whether it is global (in C, has external linkage)
1291 or local (in C, has internal linkage). So do nothing more
1292 if this function has already run. */
1294 if (TREE_ASM_WRITTEN (decl))
1297 TREE_ASM_WRITTEN (decl) = 1;
1299 /* Do no output if -fsyntax-only. */
1300 if (flag_syntax_only)
1305 if (! dont_output_data)
1309 if (TREE_CODE (DECL_SIZE (decl)) != INTEGER_CST)
1312 /* This is better than explicit arithmetic, since it avoids overflow. */
1313 size_tree = size_binop (CEIL_DIV_EXPR,
1314 DECL_SIZE (decl), size_int (BITS_PER_UNIT));
1316 size = TREE_INT_CST_LOW (size_tree);
1317 if (TREE_INT_CST_HIGH (size_tree) != 0
1318 || size != TREE_INT_CST_LOW (size_tree))
1320 error_with_decl (decl, "size of variable `%s' is too large");
1325 name = XSTR (XEXP (DECL_RTL (decl), 0), 0);
1327 if (TREE_PUBLIC (decl) && DECL_NAME (decl)
1328 && ! first_global_object_name
1329 && ! (DECL_COMMON (decl) && (DECL_INITIAL (decl) == 0
1330 || DECL_INITIAL (decl) == error_mark_node))
1331 && ! DECL_WEAK (decl)
1332 && ! DECL_ONE_ONLY (decl))
1336 STRIP_NAME_ENCODING (p, name);
1337 first_global_object_name = permalloc (strlen (p) + 1);
1338 strcpy (first_global_object_name, p);
1341 /* Compute the alignment of this data. */
1343 align = DECL_ALIGN (decl);
1345 /* In the case for initialing an array whose length isn't specified,
1346 where we have not yet been able to do the layout,
1347 figure out the proper alignment now. */
1348 if (dont_output_data && DECL_SIZE (decl) == 0
1349 && TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE)
1350 align = MAX (align, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl))));
1352 /* Some object file formats have a maximum alignment which they support.
1353 In particular, a.out format supports a maximum alignment of 4. */
1354 #ifndef MAX_OFILE_ALIGNMENT
1355 #define MAX_OFILE_ALIGNMENT BIGGEST_ALIGNMENT
1357 if (align > MAX_OFILE_ALIGNMENT)
1359 warning_with_decl (decl,
1360 "alignment of `%s' is greater than maximum object file alignment. Using %d.",
1361 MAX_OFILE_ALIGNMENT/BITS_PER_UNIT);
1362 align = MAX_OFILE_ALIGNMENT;
1365 /* On some machines, it is good to increase alignment sometimes. */
1366 #ifdef DATA_ALIGNMENT
1367 align = DATA_ALIGNMENT (TREE_TYPE (decl), align);
1369 #ifdef CONSTANT_ALIGNMENT
1370 if (DECL_INITIAL (decl) != 0 && DECL_INITIAL (decl) != error_mark_node)
1371 align = CONSTANT_ALIGNMENT (DECL_INITIAL (decl), align);
1374 /* Reset the alignment in case we have made it tighter, so we can benefit
1375 from it in get_pointer_alignment. */
1376 DECL_ALIGN (decl) = align;
1378 /* Handle uninitialized definitions. */
1380 if ((DECL_INITIAL (decl) == 0 || DECL_INITIAL (decl) == error_mark_node)
1381 /* If the target can't output uninitialized but not common global data
1382 in .bss, then we have to use .data. */
1383 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
1384 && DECL_COMMON (decl)
1386 && DECL_SECTION_NAME (decl) == 0
1387 && ! dont_output_data)
1389 int size = TREE_INT_CST_LOW (size_tree);
1392 /* Don't allocate zero bytes of common,
1393 since that means "undefined external" in the linker. */
1394 if (size == 0) rounded = 1;
1395 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1396 so that each uninitialized object starts on such a boundary. */
1397 rounded += (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1;
1398 rounded = (rounded / (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
1399 * (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
1401 #if !defined(ASM_OUTPUT_ALIGNED_COMMON) && !defined(ASM_OUTPUT_ALIGNED_BSS)
1402 if ( (DECL_ALIGN (decl) / BITS_PER_UNIT) > rounded)
1404 (decl, "requested alignment for %s is greater than implemented alignment of %d.",rounded);
1407 #ifdef DBX_DEBUGGING_INFO
1408 /* File-scope global variables are output here. */
1409 if (write_symbols == DBX_DEBUG && top_level)
1410 dbxout_symbol (decl, 0);
1412 #ifdef SDB_DEBUGGING_INFO
1413 if (write_symbols == SDB_DEBUG && top_level
1414 /* Leave initialized global vars for end of compilation;
1415 see comment in compile_file. */
1416 && (TREE_PUBLIC (decl) == 0 || DECL_INITIAL (decl) == 0))
1417 sdbout_symbol (decl, 0);
1420 /* Don't output any DWARF debugging information for variables here.
1421 In the case of local variables, the information for them is output
1422 when we do our recursive traversal of the tree representation for
1423 the entire containing function. In the case of file-scope variables,
1424 we output information for all of them at the very end of compilation
1425 while we are doing our final traversal of the chain of file-scope
1428 #if 0 /* ??? We should either delete this or add a comment describing what
1429 it was intended to do and why we shouldn't delete it. */
1430 if (flag_shared_data)
1434 if (TREE_PUBLIC (decl)
1435 #if defined (ASM_OUTPUT_BSS) || defined (ASM_OUTPUT_ALIGNED_BSS)
1436 && DECL_COMMON (decl)
1440 #ifdef ASM_OUTPUT_SHARED_COMMON
1441 if (flag_shared_data)
1442 ASM_OUTPUT_SHARED_COMMON (asm_out_file, name, size, rounded);
1446 #ifdef ASM_OUTPUT_ALIGNED_DECL_COMMON
1447 ASM_OUTPUT_ALIGNED_DECL_COMMON (asm_out_file, decl, name, size,
1450 #ifdef ASM_OUTPUT_ALIGNED_COMMON
1451 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file, name, size,
1454 ASM_OUTPUT_COMMON (asm_out_file, name, size, rounded);
1459 #if defined (ASM_OUTPUT_BSS) || defined (ASM_OUTPUT_ALIGNED_BSS)
1460 else if (TREE_PUBLIC (decl))
1462 #ifdef ASM_OUTPUT_SHARED_BSS
1463 if (flag_shared_data)
1464 ASM_OUTPUT_SHARED_BSS (asm_out_file, decl, name, size, rounded);
1468 #ifdef ASM_OUTPUT_ALIGNED_BSS
1469 ASM_OUTPUT_ALIGNED_BSS (asm_out_file, decl, name, size,
1472 ASM_OUTPUT_BSS (asm_out_file, decl, name, size, rounded);
1476 #endif /* ASM_OUTPUT_BSS || ASM_OUTPUT_ALIGNED_BSS */
1479 #ifdef ASM_OUTPUT_SHARED_LOCAL
1480 if (flag_shared_data)
1481 ASM_OUTPUT_SHARED_LOCAL (asm_out_file, name, size, rounded);
1485 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
1486 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, decl, name, size,
1489 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1490 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size,
1493 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded);
1501 /* Handle initialized definitions.
1502 Also handle uninitialized global definitions if -fno-common and the
1503 target doesn't support ASM_OUTPUT_BSS. */
1505 /* First make the assembler name(s) global if appropriate. */
1506 if (TREE_PUBLIC (decl) && DECL_NAME (decl))
1508 #ifdef ASM_WEAKEN_LABEL
1509 if (DECL_WEAK (decl))
1511 ASM_WEAKEN_LABEL (asm_out_file, name);
1512 /* Remove this variable from the pending weak list so that
1513 we do not emit multiple .weak directives for it. */
1514 remove_from_pending_weak_list
1515 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl)));
1519 ASM_GLOBALIZE_LABEL (asm_out_file, name);
1522 for (d = equivalents; d; d = TREE_CHAIN (d))
1524 tree e = TREE_VALUE (d);
1525 if (TREE_PUBLIC (e) && DECL_NAME (e))
1526 ASM_GLOBALIZE_LABEL (asm_out_file,
1527 XSTR (XEXP (DECL_RTL (e), 0), 0));
1531 /* Output any data that we will need to use the address of. */
1532 if (DECL_INITIAL (decl) == error_mark_node)
1533 reloc = contains_pointers_p (TREE_TYPE (decl));
1534 else if (DECL_INITIAL (decl))
1535 reloc = output_addressed_constants (DECL_INITIAL (decl));
1537 #ifdef ASM_OUTPUT_SECTION_NAME
1538 if ((flag_data_sections != 0
1539 && DECL_SECTION_NAME (decl) == NULL_TREE)
1540 || UNIQUE_SECTION_P (decl))
1541 UNIQUE_SECTION (decl, reloc);
1544 /* Switch to the appropriate section. */
1545 variable_section (decl, reloc);
1547 /* dbxout.c needs to know this. */
1548 if (in_text_section ())
1549 DECL_IN_TEXT_SECTION (decl) = 1;
1551 /* Record current section so we can restore it if dbxout.c clobbers it. */
1552 saved_in_section = in_section;
1554 /* Output the dbx info now that we have chosen the section. */
1556 #ifdef DBX_DEBUGGING_INFO
1557 /* File-scope global variables are output here. */
1558 if (write_symbols == DBX_DEBUG && top_level)
1559 dbxout_symbol (decl, 0);
1561 #ifdef SDB_DEBUGGING_INFO
1562 if (write_symbols == SDB_DEBUG && top_level
1563 /* Leave initialized global vars for end of compilation;
1564 see comment in compile_file. */
1565 && (TREE_PUBLIC (decl) == 0 || DECL_INITIAL (decl) == 0))
1566 sdbout_symbol (decl, 0);
1569 /* Don't output any DWARF debugging information for variables here.
1570 In the case of local variables, the information for them is output
1571 when we do our recursive traversal of the tree representation for
1572 the entire containing function. In the case of file-scope variables,
1573 we output information for all of them at the very end of compilation
1574 while we are doing our final traversal of the chain of file-scope
1577 /* If the debugging output changed sections, reselect the section
1578 that's supposed to be selected. */
1579 if (in_section != saved_in_section)
1580 variable_section (decl, reloc);
1582 /* Output the alignment of this data. */
1583 if (align > BITS_PER_UNIT)
1584 ASM_OUTPUT_ALIGN (asm_out_file,
1585 floor_log2 (DECL_ALIGN (decl) / BITS_PER_UNIT));
1587 /* Do any machine/system dependent processing of the object. */
1588 #ifdef ASM_DECLARE_OBJECT_NAME
1589 last_assemble_variable_decl = decl;
1590 ASM_DECLARE_OBJECT_NAME (asm_out_file, name, decl);
1592 /* Standard thing is just output label for the object. */
1593 ASM_OUTPUT_LABEL (asm_out_file, name);
1594 #endif /* ASM_DECLARE_OBJECT_NAME */
1596 if (!dont_output_data)
1598 if (DECL_INITIAL (decl))
1599 /* Output the actual data. */
1600 output_constant (DECL_INITIAL (decl), TREE_INT_CST_LOW (size_tree));
1602 /* Leave space for it. */
1603 assemble_zeros (TREE_INT_CST_LOW (size_tree));
1607 #ifdef XCOFF_DEBUGGING_INFO
1608 /* Unfortunately, the IBM assembler cannot handle stabx before the actual
1609 declaration. When something like ".stabx "aa:S-2",aa,133,0" is emitted
1610 and `aa' hasn't been output yet, the assembler generates a stab entry with
1611 a value of zero, in addition to creating an unnecessary external entry
1612 for `aa'. Hence, we must postpone dbxout_symbol to here at the end. */
1614 /* File-scope global variables are output here. */
1615 if (write_symbols == XCOFF_DEBUG && top_level)
1617 saved_in_section = in_section;
1619 dbxout_symbol (decl, 0);
1621 if (in_section != saved_in_section)
1622 variable_section (decl, reloc);
1625 /* There must be a statement after a label. */
1630 /* Return 1 if type TYPE contains any pointers. */
1633 contains_pointers_p (type)
1636 switch (TREE_CODE (type))
1639 case REFERENCE_TYPE:
1640 /* I'm not sure whether OFFSET_TYPE needs this treatment,
1641 so I'll play safe and return 1. */
1647 case QUAL_UNION_TYPE:
1650 /* For a type that has fields, see if the fields have pointers. */
1651 for (fields = TYPE_FIELDS (type); fields; fields = TREE_CHAIN (fields))
1652 if (TREE_CODE (fields) == FIELD_DECL
1653 && contains_pointers_p (TREE_TYPE (fields)))
1659 /* An array type contains pointers if its element type does. */
1660 return contains_pointers_p (TREE_TYPE (type));
1667 /* Output something to declare an external symbol to the assembler.
1668 (Most assemblers don't need this, so we normally output nothing.)
1669 Do nothing if DECL is not external. */
1672 assemble_external (decl)
1673 tree decl ATTRIBUTE_UNUSED;
1675 #ifdef ASM_OUTPUT_EXTERNAL
1676 if (TREE_CODE_CLASS (TREE_CODE (decl)) == 'd'
1677 && DECL_EXTERNAL (decl) && TREE_PUBLIC (decl))
1679 rtx rtl = DECL_RTL (decl);
1681 if (GET_CODE (rtl) == MEM && GET_CODE (XEXP (rtl, 0)) == SYMBOL_REF
1682 && ! SYMBOL_REF_USED (XEXP (rtl, 0)))
1684 /* Some systems do require some output. */
1685 SYMBOL_REF_USED (XEXP (rtl, 0)) = 1;
1686 ASM_OUTPUT_EXTERNAL (asm_out_file, decl, XSTR (XEXP (rtl, 0), 0));
1692 /* Similar, for calling a library function FUN. */
1695 assemble_external_libcall (fun)
1696 rtx fun ATTRIBUTE_UNUSED;
1698 #ifdef ASM_OUTPUT_EXTERNAL_LIBCALL
1699 /* Declare library function name external when first used, if nec. */
1700 if (! SYMBOL_REF_USED (fun))
1702 SYMBOL_REF_USED (fun) = 1;
1703 ASM_OUTPUT_EXTERNAL_LIBCALL (asm_out_file, fun);
1708 /* Declare the label NAME global. */
1711 assemble_global (name)
1714 ASM_GLOBALIZE_LABEL (asm_out_file, name);
1717 /* Assemble a label named NAME. */
1720 assemble_label (name)
1723 ASM_OUTPUT_LABEL (asm_out_file, name);
1726 /* Output to FILE a reference to the assembler name of a C-level name NAME.
1727 If NAME starts with a *, the rest of NAME is output verbatim.
1728 Otherwise NAME is transformed in an implementation-defined way
1729 (usually by the addition of an underscore).
1730 Many macros in the tm file are defined to call this function. */
1733 assemble_name (file, name)
1737 const char *real_name;
1740 STRIP_NAME_ENCODING (real_name, name);
1741 if (flag_prefix_function_name
1742 && ! bcmp (real_name, CHKR_PREFIX, CHKR_PREFIX_SIZE))
1743 real_name = real_name + CHKR_PREFIX_SIZE;
1745 id = maybe_get_identifier (real_name);
1747 TREE_SYMBOL_REFERENCED (id) = 1;
1750 fputs (&name[1], file);
1752 ASM_OUTPUT_LABELREF (file, name);
1755 /* Allocate SIZE bytes writable static space with a gensym name
1756 and return an RTX to refer to its address. */
1759 assemble_static_space (size)
1767 if (flag_shared_data)
1771 ASM_GENERATE_INTERNAL_LABEL (name, "LF", const_labelno);
1774 namestring = (char *) obstack_alloc (saveable_obstack,
1776 strcpy (namestring, name);
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);
1833 = (char *) obstack_copy0 (&permanent_obstack, label, strlen (label));
1834 return gen_rtx_SYMBOL_REF (Pmode, name);
1838 /* Assemble the integer constant X into an object of SIZE bytes.
1839 X must be either a CONST_INT or CONST_DOUBLE.
1841 Return 1 if we were able to output the constant, otherwise 0. If FORCE is
1842 non-zero, abort if we can't output the constant. */
1845 assemble_integer (x, size, force)
1850 /* First try to use the standard 1, 2, 4, 8, and 16 byte
1851 ASM_OUTPUT... macros. */
1855 #ifdef ASM_OUTPUT_CHAR
1857 ASM_OUTPUT_CHAR (asm_out_file, x);
1861 #ifdef ASM_OUTPUT_SHORT
1863 ASM_OUTPUT_SHORT (asm_out_file, x);
1867 #ifdef ASM_OUTPUT_INT
1869 ASM_OUTPUT_INT (asm_out_file, x);
1873 #ifdef ASM_OUTPUT_DOUBLE_INT
1875 ASM_OUTPUT_DOUBLE_INT (asm_out_file, x);
1879 #ifdef ASM_OUTPUT_QUADRUPLE_INT
1881 ASM_OUTPUT_QUADRUPLE_INT (asm_out_file, x);
1886 /* If we couldn't do it that way, there are two other possibilities: First,
1887 if the machine can output an explicit byte and this is a 1 byte constant,
1888 we can use ASM_OUTPUT_BYTE. */
1890 #ifdef ASM_OUTPUT_BYTE
1891 if (size == 1 && GET_CODE (x) == CONST_INT)
1893 ASM_OUTPUT_BYTE (asm_out_file, INTVAL (x));
1898 /* Finally, if SIZE is larger than a single word, try to output the constant
1899 one word at a time. */
1901 if (size > UNITS_PER_WORD)
1904 enum machine_mode mode
1905 = mode_for_size (size * BITS_PER_UNIT, MODE_INT, 0);
1908 for (i = 0; i < size / UNITS_PER_WORD; i++)
1910 word = operand_subword (x, i, 0, mode);
1915 if (! assemble_integer (word, UNITS_PER_WORD, 0))
1919 if (i == size / UNITS_PER_WORD)
1921 /* If we output at least one word and then could not finish,
1922 there is no valid way to continue. */
1933 /* Assemble the floating-point constant D into an object of size MODE. */
1936 assemble_real (d, mode)
1938 enum machine_mode mode;
1940 jmp_buf output_constant_handler;
1942 if (setjmp (output_constant_handler))
1944 error ("floating point trap outputting a constant");
1945 #ifdef REAL_IS_NOT_DOUBLE
1946 bzero ((char *) &d, sizeof d);
1953 set_float_handler (output_constant_handler);
1957 #ifdef ASM_OUTPUT_BYTE_FLOAT
1959 ASM_OUTPUT_BYTE_FLOAT (asm_out_file, d);
1962 #ifdef ASM_OUTPUT_SHORT_FLOAT
1964 ASM_OUTPUT_SHORT_FLOAT (asm_out_file, d);
1967 #ifdef ASM_OUTPUT_THREE_QUARTER_FLOAT
1969 ASM_OUTPUT_THREE_QUARTER_FLOAT (asm_out_file, d);
1972 #ifdef ASM_OUTPUT_FLOAT
1974 ASM_OUTPUT_FLOAT (asm_out_file, d);
1978 #ifdef ASM_OUTPUT_DOUBLE
1980 ASM_OUTPUT_DOUBLE (asm_out_file, d);
1984 #ifdef ASM_OUTPUT_LONG_DOUBLE
1987 ASM_OUTPUT_LONG_DOUBLE (asm_out_file, d);
1995 set_float_handler (NULL_PTR);
1998 /* Here we combine duplicate floating constants to make
1999 CONST_DOUBLE rtx's, and force those out to memory when necessary. */
2001 /* Return a CONST_DOUBLE or CONST_INT for a value specified as a pair of ints.
2002 For an integer, I0 is the low-order word and I1 is the high-order word.
2003 For a real number, I0 is the word with the low address
2004 and I1 is the word with the high address. */
2007 immed_double_const (i0, i1, mode)
2008 HOST_WIDE_INT i0, i1;
2009 enum machine_mode mode;
2013 if (GET_MODE_CLASS (mode) == MODE_INT
2014 || GET_MODE_CLASS (mode) == MODE_PARTIAL_INT)
2016 /* We clear out all bits that don't belong in MODE, unless they and our
2017 sign bit are all one. So we get either a reasonable negative value
2018 or a reasonable unsigned value for this mode. */
2019 int width = GET_MODE_BITSIZE (mode);
2020 if (width < HOST_BITS_PER_WIDE_INT
2021 && ((i0 & ((HOST_WIDE_INT) (-1) << (width - 1)))
2022 != ((HOST_WIDE_INT) (-1) << (width - 1))))
2023 i0 &= ((HOST_WIDE_INT) 1 << width) - 1, i1 = 0;
2024 else if (width == HOST_BITS_PER_WIDE_INT
2025 && ! (i1 == ~0 && i0 < 0))
2027 else if (width > 2 * HOST_BITS_PER_WIDE_INT)
2028 /* We cannot represent this value as a constant. */
2031 /* If this would be an entire word for the target, but is not for
2032 the host, then sign-extend on the host so that the number will look
2033 the same way on the host that it would on the target.
2035 For example, when building a 64 bit alpha hosted 32 bit sparc
2036 targeted compiler, then we want the 32 bit unsigned value -1 to be
2037 represented as a 64 bit value -1, and not as 0x00000000ffffffff.
2038 The later confuses the sparc backend. */
2040 if (BITS_PER_WORD < HOST_BITS_PER_WIDE_INT && BITS_PER_WORD == width
2041 && (i0 & ((HOST_WIDE_INT) 1 << (width - 1))))
2042 i0 |= ((HOST_WIDE_INT) (-1) << width);
2044 /* If MODE fits within HOST_BITS_PER_WIDE_INT, always use a CONST_INT.
2046 ??? Strictly speaking, this is wrong if we create a CONST_INT
2047 for a large unsigned constant with the size of MODE being
2048 HOST_BITS_PER_WIDE_INT and later try to interpret that constant in a
2049 wider mode. In that case we will mis-interpret it as a negative
2052 Unfortunately, the only alternative is to make a CONST_DOUBLE
2053 for any constant in any mode if it is an unsigned constant larger
2054 than the maximum signed integer in an int on the host. However,
2055 doing this will break everyone that always expects to see a CONST_INT
2056 for SImode and smaller.
2058 We have always been making CONST_INTs in this case, so nothing new
2061 if (width <= HOST_BITS_PER_WIDE_INT)
2062 i1 = (i0 < 0) ? ~(HOST_WIDE_INT) 0 : 0;
2064 /* If this integer fits in one word, return a CONST_INT. */
2065 if ((i1 == 0 && i0 >= 0)
2066 || (i1 == ~0 && i0 < 0))
2067 return GEN_INT (i0);
2069 /* We use VOIDmode for integers. */
2073 /* Search the chain for an existing CONST_DOUBLE with the right value.
2074 If one is found, return it. */
2075 if (current_function != 0)
2076 for (r = const_double_chain; r; r = CONST_DOUBLE_CHAIN (r))
2077 if (CONST_DOUBLE_LOW (r) == i0 && CONST_DOUBLE_HIGH (r) == i1
2078 && GET_MODE (r) == mode)
2081 /* No; make a new one and add it to the chain.
2083 We may be called by an optimizer which may be discarding any memory
2084 allocated during its processing (such as combine and loop). However,
2085 we will be leaving this constant on the chain, so we cannot tolerate
2086 freed memory. So switch to saveable_obstack for this allocation
2087 and then switch back if we were in current_obstack. */
2089 push_obstacks_nochange ();
2090 rtl_in_saveable_obstack ();
2091 r = gen_rtx_CONST_DOUBLE (mode, NULL_RTX, i0, i1);
2094 /* Don't touch const_double_chain if not inside any function. */
2095 if (current_function_decl != 0)
2097 CONST_DOUBLE_CHAIN (r) = const_double_chain;
2098 const_double_chain = r;
2101 /* Store const0_rtx in mem-slot since this CONST_DOUBLE is on the chain.
2102 Actual use of mem-slot is only through force_const_mem. */
2104 CONST_DOUBLE_MEM (r) = const0_rtx;
2109 /* Return a CONST_DOUBLE for a specified `double' value
2110 and machine mode. */
2113 immed_real_const_1 (d, mode)
2115 enum machine_mode mode;
2117 union real_extract u;
2120 /* Get the desired `double' value as a sequence of ints
2121 since that is how they are stored in a CONST_DOUBLE. */
2125 /* Detect special cases. */
2127 if (REAL_VALUES_IDENTICAL (dconst0, d))
2128 return CONST0_RTX (mode);
2129 /* Check for NaN first, because some ports (specifically the i386) do not
2130 emit correct ieee-fp code by default, and thus will generate a core
2131 dump here if we pass a NaN to REAL_VALUES_EQUAL and if REAL_VALUES_EQUAL
2132 does a floating point comparison. */
2133 else if (! REAL_VALUE_ISNAN (d) && REAL_VALUES_EQUAL (dconst1, d))
2134 return CONST1_RTX (mode);
2136 if (sizeof u == sizeof (HOST_WIDE_INT))
2137 return immed_double_const (u.i[0], 0, mode);
2138 if (sizeof u == 2 * sizeof (HOST_WIDE_INT))
2139 return immed_double_const (u.i[0], u.i[1], mode);
2141 /* The rest of this function handles the case where
2142 a float value requires more than 2 ints of space.
2143 It will be deleted as dead code on machines that don't need it. */
2145 /* Search the chain for an existing CONST_DOUBLE with the right value.
2146 If one is found, return it. */
2147 if (current_function != 0)
2148 for (r = const_double_chain; r; r = CONST_DOUBLE_CHAIN (r))
2149 if (! bcmp ((char *) &CONST_DOUBLE_LOW (r), (char *) &u, sizeof u)
2150 && GET_MODE (r) == mode)
2153 /* No; make a new one and add it to the chain.
2155 We may be called by an optimizer which may be discarding any memory
2156 allocated during its processing (such as combine and loop). However,
2157 we will be leaving this constant on the chain, so we cannot tolerate
2158 freed memory. So switch to saveable_obstack for this allocation
2159 and then switch back if we were in current_obstack. */
2160 push_obstacks_nochange ();
2161 rtl_in_saveable_obstack ();
2162 r = rtx_alloc (CONST_DOUBLE);
2165 bcopy ((char *) &u, (char *) &CONST_DOUBLE_LOW (r), sizeof u);
2167 /* Don't touch const_double_chain if not inside any function. */
2168 if (current_function_decl != 0)
2170 CONST_DOUBLE_CHAIN (r) = const_double_chain;
2171 const_double_chain = r;
2174 /* Store const0_rtx in CONST_DOUBLE_MEM since this CONST_DOUBLE is on the
2175 chain, but has not been allocated memory. Actual use of CONST_DOUBLE_MEM
2176 is only through force_const_mem. */
2178 CONST_DOUBLE_MEM (r) = const0_rtx;
2183 /* Return a CONST_DOUBLE rtx for a value specified by EXP,
2184 which must be a REAL_CST tree node. */
2187 immed_real_const (exp)
2190 return immed_real_const_1 (TREE_REAL_CST (exp), TYPE_MODE (TREE_TYPE (exp)));
2193 /* At the end of a function, forget the memory-constants
2194 previously made for CONST_DOUBLEs. Mark them as not on real_constant_chain.
2195 Also clear out real_constant_chain and clear out all the chain-pointers. */
2198 clear_const_double_mem ()
2200 register rtx r, next;
2202 for (r = const_double_chain; r; r = next)
2204 next = CONST_DOUBLE_CHAIN (r);
2205 CONST_DOUBLE_CHAIN (r) = 0;
2206 CONST_DOUBLE_MEM (r) = cc0_rtx;
2208 const_double_chain = 0;
2211 /* Given an expression EXP with a constant value,
2212 reduce it to the sum of an assembler symbol and an integer.
2213 Store them both in the structure *VALUE.
2214 Abort if EXP does not reduce. */
2219 HOST_WIDE_INT offset;
2223 decode_addr_const (exp, value)
2225 struct addr_const *value;
2227 register tree target = TREE_OPERAND (exp, 0);
2228 register int offset = 0;
2233 if (TREE_CODE (target) == COMPONENT_REF
2234 && (TREE_CODE (DECL_FIELD_BITPOS (TREE_OPERAND (target, 1)))
2237 offset += TREE_INT_CST_LOW (DECL_FIELD_BITPOS (TREE_OPERAND (target, 1))) / BITS_PER_UNIT;
2238 target = TREE_OPERAND (target, 0);
2240 else if (TREE_CODE (target) == ARRAY_REF)
2242 if (TREE_CODE (TREE_OPERAND (target, 1)) != INTEGER_CST
2243 || TREE_CODE (TYPE_SIZE (TREE_TYPE (target))) != INTEGER_CST)
2245 offset += ((TREE_INT_CST_LOW (TYPE_SIZE (TREE_TYPE (target)))
2246 * TREE_INT_CST_LOW (TREE_OPERAND (target, 1)))
2248 target = TREE_OPERAND (target, 0);
2254 switch (TREE_CODE (target))
2258 x = DECL_RTL (target);
2262 x = gen_rtx_MEM (FUNCTION_MODE,
2263 gen_rtx_LABEL_REF (VOIDmode,
2264 label_rtx (TREE_OPERAND (exp, 0))));
2272 x = TREE_CST_RTL (target);
2279 if (GET_CODE (x) != MEM)
2284 value->offset = offset;
2287 /* Uniquize all constants that appear in memory.
2288 Each constant in memory thus far output is recorded
2289 in `const_hash_table' with a `struct constant_descriptor'
2290 that contains a polish representation of the value of
2293 We cannot store the trees in the hash table
2294 because the trees may be temporary. */
2296 struct constant_descriptor
2298 struct constant_descriptor *next;
2304 #define MAX_HASH_TABLE 1009
2305 static struct constant_descriptor *const_hash_table[MAX_HASH_TABLE];
2307 /* Compute a hash code for a constant expression. */
2314 register int len, hi, i;
2315 register enum tree_code code = TREE_CODE (exp);
2317 /* Either set P and LEN to the address and len of something to hash and
2318 exit the switch or return a value. */
2323 p = (char *) &TREE_INT_CST_LOW (exp);
2324 len = 2 * sizeof TREE_INT_CST_LOW (exp);
2328 p = (char *) &TREE_REAL_CST (exp);
2329 len = sizeof TREE_REAL_CST (exp);
2333 p = TREE_STRING_POINTER (exp);
2334 len = TREE_STRING_LENGTH (exp);
2338 return (const_hash (TREE_REALPART (exp)) * 5
2339 + const_hash (TREE_IMAGPART (exp)));
2342 if (TREE_CODE (TREE_TYPE (exp)) == SET_TYPE)
2344 len = int_size_in_bytes (TREE_TYPE (exp));
2345 p = (char *) alloca (len);
2346 get_set_constructor_bytes (exp, (unsigned char *) p, len);
2353 /* For record type, include the type in the hashing.
2354 We do not do so for array types
2355 because (1) the sizes of the elements are sufficient
2356 and (2) distinct array types can have the same constructor.
2357 Instead, we include the array size because the constructor could
2359 if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE)
2360 hi = ((unsigned long) TREE_TYPE (exp) & ((1 << HASHBITS) - 1))
2363 hi = ((5 + int_size_in_bytes (TREE_TYPE (exp)))
2364 & ((1 << HASHBITS) - 1)) % MAX_HASH_TABLE;
2366 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
2367 if (TREE_VALUE (link))
2369 = (hi * 603 + const_hash (TREE_VALUE (link))) % MAX_HASH_TABLE;
2376 struct addr_const value;
2378 decode_addr_const (exp, &value);
2379 if (GET_CODE (value.base) == SYMBOL_REF)
2381 /* Don't hash the address of the SYMBOL_REF;
2382 only use the offset and the symbol name. */
2384 p = XSTR (value.base, 0);
2385 for (i = 0; p[i] != 0; i++)
2386 hi = ((hi * 613) + (unsigned) (p[i]));
2388 else if (GET_CODE (value.base) == LABEL_REF)
2389 hi = value.offset + CODE_LABEL_NUMBER (XEXP (value.base, 0)) * 13;
2393 hi &= (1 << HASHBITS) - 1;
2394 hi %= MAX_HASH_TABLE;
2400 return (const_hash (TREE_OPERAND (exp, 0)) * 9
2401 + const_hash (TREE_OPERAND (exp, 1)));
2405 case NON_LVALUE_EXPR:
2406 return const_hash (TREE_OPERAND (exp, 0)) * 7 + 2;
2412 /* Compute hashing function */
2414 for (i = 0; i < len; i++)
2415 hi = ((hi * 613) + (unsigned) (p[i]));
2417 hi &= (1 << HASHBITS) - 1;
2418 hi %= MAX_HASH_TABLE;
2422 /* Compare a constant expression EXP with a constant-descriptor DESC.
2423 Return 1 if DESC describes a constant with the same value as EXP. */
2426 compare_constant (exp, desc)
2428 struct constant_descriptor *desc;
2430 return 0 != compare_constant_1 (exp, desc->contents);
2433 /* Compare constant expression EXP with a substring P of a constant descriptor.
2434 If they match, return a pointer to the end of the substring matched.
2435 If they do not match, return 0.
2437 Since descriptors are written in polish prefix notation,
2438 this function can be used recursively to test one operand of EXP
2439 against a subdescriptor, and if it succeeds it returns the
2440 address of the subdescriptor for the next operand. */
2443 compare_constant_1 (exp, p)
2447 register char *strp;
2449 register enum tree_code code = TREE_CODE (exp);
2451 if (code != (enum tree_code) *p++)
2454 /* Either set STRP, P and LEN to pointers and length to compare and exit the
2455 switch, or return the result of the comparison. */
2460 /* Integer constants are the same only if the same width of type. */
2461 if (*p++ != TYPE_PRECISION (TREE_TYPE (exp)))
2464 strp = (char *) &TREE_INT_CST_LOW (exp);
2465 len = 2 * sizeof TREE_INT_CST_LOW (exp);
2469 /* Real constants are the same only if the same width of type. */
2470 if (*p++ != TYPE_PRECISION (TREE_TYPE (exp)))
2473 strp = (char *) &TREE_REAL_CST (exp);
2474 len = sizeof TREE_REAL_CST (exp);
2478 if (flag_writable_strings)
2481 if (*p++ != TYPE_MODE (TREE_TYPE (exp)))
2484 strp = TREE_STRING_POINTER (exp);
2485 len = TREE_STRING_LENGTH (exp);
2486 if (bcmp ((char *) &TREE_STRING_LENGTH (exp), p,
2487 sizeof TREE_STRING_LENGTH (exp)))
2490 p += sizeof TREE_STRING_LENGTH (exp);
2494 p = compare_constant_1 (TREE_REALPART (exp), p);
2498 return compare_constant_1 (TREE_IMAGPART (exp), p);
2501 if (TREE_CODE (TREE_TYPE (exp)) == SET_TYPE)
2503 int xlen = len = int_size_in_bytes (TREE_TYPE (exp));
2505 strp = (char *) alloca (len);
2506 get_set_constructor_bytes (exp, (unsigned char *) strp, len);
2507 if (bcmp ((char *) &xlen, p, sizeof xlen))
2516 int length = list_length (CONSTRUCTOR_ELTS (exp));
2518 int have_purpose = 0;
2520 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
2521 if (TREE_PURPOSE (link))
2524 if (bcmp ((char *) &length, p, sizeof length))
2529 /* For record constructors, insist that the types match.
2530 For arrays, just verify both constructors are for arrays.
2531 Then insist that either both or none have any TREE_PURPOSE
2533 if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE)
2534 type = TREE_TYPE (exp);
2538 if (bcmp ((char *) &type, p, sizeof type))
2543 if (bcmp ((char *) &have_purpose, p, sizeof have_purpose))
2546 p += sizeof have_purpose;
2548 /* For arrays, insist that the size in bytes match. */
2549 if (TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE)
2551 HOST_WIDE_INT size = int_size_in_bytes (TREE_TYPE (exp));
2553 if (bcmp ((char *) &size, p, sizeof size))
2559 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
2561 if (TREE_VALUE (link))
2563 if ((p = compare_constant_1 (TREE_VALUE (link), p)) == 0)
2570 if (bcmp ((char *) &zero, p, sizeof zero))
2576 if (TREE_PURPOSE (link)
2577 && TREE_CODE (TREE_PURPOSE (link)) == FIELD_DECL)
2579 if (bcmp ((char *) &TREE_PURPOSE (link), p,
2580 sizeof TREE_PURPOSE (link)))
2583 p += sizeof TREE_PURPOSE (link);
2585 else if (TREE_PURPOSE (link))
2587 if ((p = compare_constant_1 (TREE_PURPOSE (link), p)) == 0)
2590 else if (have_purpose)
2594 if (bcmp ((char *) &zero, p, sizeof zero))
2606 struct addr_const value;
2608 decode_addr_const (exp, &value);
2609 strp = (char *) &value.offset;
2610 len = sizeof value.offset;
2611 /* Compare the offset. */
2613 if (*p++ != *strp++)
2616 /* Compare symbol name. */
2617 strp = XSTR (value.base, 0);
2618 len = strlen (strp) + 1;
2625 p = compare_constant_1 (TREE_OPERAND (exp, 0), p);
2629 return compare_constant_1 (TREE_OPERAND (exp, 1), p);
2633 case NON_LVALUE_EXPR:
2634 return compare_constant_1 (TREE_OPERAND (exp, 0), p);
2640 /* Compare constant contents. */
2642 if (*p++ != *strp++)
2648 /* Construct a constant descriptor for the expression EXP.
2649 It is up to the caller to enter the descriptor in the hash table. */
2651 static struct constant_descriptor *
2652 record_constant (exp)
2655 struct constant_descriptor *next = 0;
2658 /* Make a struct constant_descriptor. The first two pointers will
2659 be filled in later. Here we just leave space for them. */
2661 obstack_grow (&permanent_obstack, (char *) &next, sizeof next);
2662 obstack_grow (&permanent_obstack, (char *) &label, sizeof label);
2663 record_constant_1 (exp);
2664 return (struct constant_descriptor *) obstack_finish (&permanent_obstack);
2667 /* Add a description of constant expression EXP
2668 to the object growing in `permanent_obstack'.
2669 No need to return its address; the caller will get that
2670 from the obstack when the object is complete. */
2673 record_constant_1 (exp)
2676 register char *strp;
2678 register enum tree_code code = TREE_CODE (exp);
2680 obstack_1grow (&permanent_obstack, (unsigned int) code);
2685 obstack_1grow (&permanent_obstack, TYPE_PRECISION (TREE_TYPE (exp)));
2686 strp = (char *) &TREE_INT_CST_LOW (exp);
2687 len = 2 * sizeof TREE_INT_CST_LOW (exp);
2691 obstack_1grow (&permanent_obstack, TYPE_PRECISION (TREE_TYPE (exp)));
2692 strp = (char *) &TREE_REAL_CST (exp);
2693 len = sizeof TREE_REAL_CST (exp);
2697 if (flag_writable_strings)
2700 obstack_1grow (&permanent_obstack, TYPE_MODE (TREE_TYPE (exp)));
2701 strp = TREE_STRING_POINTER (exp);
2702 len = TREE_STRING_LENGTH (exp);
2703 obstack_grow (&permanent_obstack, (char *) &TREE_STRING_LENGTH (exp),
2704 sizeof TREE_STRING_LENGTH (exp));
2708 record_constant_1 (TREE_REALPART (exp));
2709 record_constant_1 (TREE_IMAGPART (exp));
2713 if (TREE_CODE (TREE_TYPE (exp)) == SET_TYPE)
2715 int nbytes = int_size_in_bytes (TREE_TYPE (exp));
2716 obstack_grow (&permanent_obstack, &nbytes, sizeof (nbytes));
2717 obstack_blank (&permanent_obstack, nbytes);
2718 get_set_constructor_bytes
2719 (exp, (unsigned char *) permanent_obstack.next_free-nbytes,
2726 int length = list_length (CONSTRUCTOR_ELTS (exp));
2728 int have_purpose = 0;
2730 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
2731 if (TREE_PURPOSE (link))
2734 obstack_grow (&permanent_obstack, (char *) &length, sizeof length);
2736 /* For record constructors, insist that the types match.
2737 For arrays, just verify both constructors are for arrays.
2738 Then insist that either both or none have any TREE_PURPOSE
2740 if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE)
2741 type = TREE_TYPE (exp);
2744 obstack_grow (&permanent_obstack, (char *) &type, sizeof type);
2745 obstack_grow (&permanent_obstack, (char *) &have_purpose,
2746 sizeof have_purpose);
2748 /* For arrays, insist that the size in bytes match. */
2749 if (TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE)
2751 HOST_WIDE_INT size = int_size_in_bytes (TREE_TYPE (exp));
2752 obstack_grow (&permanent_obstack, (char *) &size, sizeof size);
2755 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
2757 if (TREE_VALUE (link))
2758 record_constant_1 (TREE_VALUE (link));
2763 obstack_grow (&permanent_obstack,
2764 (char *) &zero, sizeof zero);
2767 if (TREE_PURPOSE (link)
2768 && TREE_CODE (TREE_PURPOSE (link)) == FIELD_DECL)
2769 obstack_grow (&permanent_obstack,
2770 (char *) &TREE_PURPOSE (link),
2771 sizeof TREE_PURPOSE (link));
2772 else if (TREE_PURPOSE (link))
2773 record_constant_1 (TREE_PURPOSE (link));
2774 else if (have_purpose)
2778 obstack_grow (&permanent_obstack,
2779 (char *) &zero, sizeof zero);
2787 struct addr_const value;
2789 decode_addr_const (exp, &value);
2790 /* Record the offset. */
2791 obstack_grow (&permanent_obstack,
2792 (char *) &value.offset, sizeof value.offset);
2793 /* Record the symbol name. */
2794 obstack_grow (&permanent_obstack, XSTR (value.base, 0),
2795 strlen (XSTR (value.base, 0)) + 1);
2802 record_constant_1 (TREE_OPERAND (exp, 0));
2803 record_constant_1 (TREE_OPERAND (exp, 1));
2808 case NON_LVALUE_EXPR:
2809 record_constant_1 (TREE_OPERAND (exp, 0));
2816 /* Record constant contents. */
2817 obstack_grow (&permanent_obstack, strp, len);
2820 /* Record a list of constant expressions that were passed to
2821 output_constant_def but that could not be output right away. */
2823 struct deferred_constant
2825 struct deferred_constant *next;
2831 static struct deferred_constant *deferred_constants;
2833 /* Another list of constants which should be output after the
2835 static struct deferred_constant *after_function_constants;
2837 /* Nonzero means defer output of addressed subconstants
2838 (i.e., those for which output_constant_def is called.) */
2839 static int defer_addressed_constants_flag;
2841 /* Start deferring output of subconstants. */
2844 defer_addressed_constants ()
2846 defer_addressed_constants_flag++;
2849 /* Stop deferring output of subconstants,
2850 and output now all those that have been deferred. */
2853 output_deferred_addressed_constants ()
2855 struct deferred_constant *p, *next;
2857 defer_addressed_constants_flag--;
2859 if (defer_addressed_constants_flag > 0)
2862 for (p = deferred_constants; p; p = next)
2864 output_constant_def_contents (p->exp, p->reloc, p->labelno);
2869 deferred_constants = 0;
2872 /* Output any constants which should appear after a function. */
2875 output_after_function_constants ()
2877 struct deferred_constant *p, *next;
2879 for (p = after_function_constants; p; p = next)
2881 output_constant_def_contents (p->exp, p->reloc, p->labelno);
2886 after_function_constants = 0;
2889 /* Make a copy of the whole tree structure for a constant.
2890 This handles the same types of nodes that compare_constant
2891 and record_constant handle. */
2897 switch (TREE_CODE (exp))
2900 /* For ADDR_EXPR, we do not want to copy the decl whose address
2901 is requested. We do want to copy constants though. */
2902 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, 0))) == 'c')
2903 return build1 (TREE_CODE (exp), TREE_TYPE (exp),
2904 copy_constant (TREE_OPERAND (exp, 0)));
2906 return copy_node (exp);
2911 return copy_node (exp);
2914 return build_complex (TREE_TYPE (exp),
2915 copy_constant (TREE_REALPART (exp)),
2916 copy_constant (TREE_IMAGPART (exp)));
2920 return build (TREE_CODE (exp), TREE_TYPE (exp),
2921 copy_constant (TREE_OPERAND (exp, 0)),
2922 copy_constant (TREE_OPERAND (exp, 1)));
2926 case NON_LVALUE_EXPR:
2927 return build1 (TREE_CODE (exp), TREE_TYPE (exp),
2928 copy_constant (TREE_OPERAND (exp, 0)));
2932 tree copy = copy_node (exp);
2933 tree list = copy_list (CONSTRUCTOR_ELTS (exp));
2936 CONSTRUCTOR_ELTS (copy) = list;
2937 for (tail = list; tail; tail = TREE_CHAIN (tail))
2938 TREE_VALUE (tail) = copy_constant (TREE_VALUE (tail));
2939 if (TREE_CODE (TREE_TYPE (exp)) == SET_TYPE)
2940 for (tail = list; tail; tail = TREE_CHAIN (tail))
2941 TREE_PURPOSE (tail) = copy_constant (TREE_PURPOSE (tail));
2951 /* Return an rtx representing a reference to constant data in memory
2952 for the constant expression EXP.
2954 If assembler code for such a constant has already been output,
2955 return an rtx to refer to it.
2956 Otherwise, output such a constant in memory (or defer it for later)
2957 and generate an rtx for it.
2959 The TREE_CST_RTL of EXP is set up to point to that rtx.
2960 The const_hash_table records which constants already have label strings. */
2963 output_constant_def (exp)
2967 register struct constant_descriptor *desc;
2973 if (TREE_CST_RTL (exp))
2974 return TREE_CST_RTL (exp);
2976 /* Make sure any other constants whose addresses appear in EXP
2977 are assigned label numbers. */
2979 reloc = output_addressed_constants (exp);
2981 /* Compute hash code of EXP. Search the descriptors for that hash code
2982 to see if any of them describes EXP. If yes, the descriptor records
2983 the label number already assigned. */
2985 hash = const_hash (exp) % MAX_HASH_TABLE;
2987 for (desc = const_hash_table[hash]; desc; desc = desc->next)
2988 if (compare_constant (exp, desc))
2990 found = desc->label;
2996 /* No constant equal to EXP is known to have been output.
2997 Make a constant descriptor to enter EXP in the hash table.
2998 Assign the label number and record it in the descriptor for
2999 future calls to this function to find. */
3001 /* Create a string containing the label name, in LABEL. */
3002 ASM_GENERATE_INTERNAL_LABEL (label, "LC", const_labelno);
3004 desc = record_constant (exp);
3005 desc->next = const_hash_table[hash];
3007 = (char *) obstack_copy0 (&permanent_obstack, label, strlen (label));
3008 const_hash_table[hash] = desc;
3012 /* Create a string containing the label name, in LABEL. */
3013 ASM_GENERATE_INTERNAL_LABEL (label, "LC", const_labelno);
3016 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
3018 push_obstacks_nochange ();
3019 if (TREE_PERMANENT (exp))
3020 end_temporary_allocation ();
3022 def = gen_rtx_SYMBOL_REF (Pmode, desc->label);
3025 = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp)), def);
3026 RTX_UNCHANGING_P (TREE_CST_RTL (exp)) = 1;
3027 if (AGGREGATE_TYPE_P (TREE_TYPE (exp)))
3028 MEM_SET_IN_STRUCT_P (TREE_CST_RTL (exp), 1);
3032 /* Optionally set flags or add text to the name to record information
3033 such as that it is a function name. If the name is changed, the macro
3034 ASM_OUTPUT_LABELREF will have to know how to strip this information. */
3035 #ifdef ENCODE_SECTION_INFO
3036 ENCODE_SECTION_INFO (exp);
3039 /* If this is the first time we've seen this particular constant,
3040 output it (or defer its output for later). */
3043 int after_function = 0;
3045 #ifdef CONSTANT_AFTER_FUNCTION_P
3046 if (current_function_decl != 0
3047 && CONSTANT_AFTER_FUNCTION_P (exp))
3051 if (defer_addressed_constants_flag || after_function)
3053 struct deferred_constant *p;
3054 p = (struct deferred_constant *) xmalloc (sizeof (struct deferred_constant));
3056 push_obstacks_nochange ();
3057 suspend_momentary ();
3058 p->exp = copy_constant (exp);
3061 p->labelno = const_labelno++;
3064 p->next = after_function_constants;
3065 after_function_constants = p;
3069 p->next = deferred_constants;
3070 deferred_constants = p;
3075 /* Do no output if -fsyntax-only. */
3076 if (! flag_syntax_only)
3077 output_constant_def_contents (exp, reloc, const_labelno);
3082 return TREE_CST_RTL (exp);
3085 /* Now output assembler code to define the label for EXP,
3086 and follow it with the data of EXP. */
3089 output_constant_def_contents (exp, reloc, labelno)
3096 if (IN_NAMED_SECTION (exp))
3097 named_section (exp, NULL, reloc);
3100 /* First switch to text section, except for writable strings. */
3101 #ifdef SELECT_SECTION
3102 SELECT_SECTION (exp, reloc);
3104 if (((TREE_CODE (exp) == STRING_CST) && flag_writable_strings)
3105 || (flag_pic && reloc))
3108 readonly_data_section ();
3112 /* Align the location counter as required by EXP's data type. */
3113 align = TYPE_ALIGN (TREE_TYPE (exp));
3114 #ifdef CONSTANT_ALIGNMENT
3115 align = CONSTANT_ALIGNMENT (exp, align);
3118 if (align > BITS_PER_UNIT)
3119 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
3121 /* Output the label itself. */
3122 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LC", labelno);
3124 /* Output the value of EXP. */
3125 output_constant (exp,
3126 (TREE_CODE (exp) == STRING_CST
3127 ? TREE_STRING_LENGTH (exp)
3128 : int_size_in_bytes (TREE_TYPE (exp))));
3132 /* Structure to represent sufficient information about a constant so that
3133 it can be output when the constant pool is output, so that function
3134 integration can be done, and to simplify handling on machines that reference
3135 constant pool as base+displacement. */
3137 struct pool_constant
3139 struct constant_descriptor *desc;
3140 struct pool_constant *next;
3141 enum machine_mode mode;
3149 /* Structure used to maintain hash table mapping symbols used to their
3150 corresponding constants. */
3155 struct pool_constant *pool;
3156 struct pool_sym *next;
3159 /* Hash code for a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true.
3160 The argument is XSTR (... , 0) */
3162 #define SYMHASH(LABEL) \
3163 ((((unsigned long) (LABEL)) & ((1 << HASHBITS) - 1)) % MAX_RTX_HASH_TABLE)
3165 /* Initialize constant pool hashing for a new function. */
3168 init_varasm_status (f)
3171 struct varasm_status *p;
3172 p = (struct varasm_status *) xmalloc (sizeof (struct varasm_status));
3174 p->x_const_rtx_hash_table
3175 = ((struct constant_descriptor **)
3176 xmalloc (MAX_RTX_HASH_TABLE * sizeof (struct constant_descriptor *)));
3177 p->x_const_rtx_sym_hash_table
3178 = ((struct pool_sym **)
3179 xmalloc (MAX_RTX_HASH_TABLE * sizeof (struct pool_sym *)));
3180 bzero ((char *) p->x_const_rtx_hash_table,
3181 MAX_RTX_HASH_TABLE * sizeof (struct constant_descriptor *));
3182 bzero ((char *) p->x_const_rtx_sym_hash_table,
3183 MAX_RTX_HASH_TABLE * sizeof (struct pool_sym *));
3185 p->x_first_pool = p->x_last_pool = 0;
3186 p->x_pool_offset = 0;
3187 p->x_const_double_chain = 0;
3190 /* Mark PC for GC. */
3193 mark_pool_constant (pc)
3194 struct pool_constant *pc;
3198 ggc_mark_rtx (pc->constant);
3203 /* Mark P for GC. */
3206 mark_varasm_state (p)
3207 struct varasm_status *p;
3209 mark_pool_constant (p->x_first_pool);
3210 ggc_mark_rtx (p->x_const_double_chain);
3213 /* Clear out all parts of our state in F that can safely be discarded
3214 after the function has been compiled. */
3216 free_varasm_status (f)
3219 struct varasm_status *p = f->varasm;
3220 free (p->x_const_rtx_hash_table);
3221 free (p->x_const_rtx_sym_hash_table);
3223 p->x_first_pool = p->x_last_pool = 0;
3224 p->x_const_rtx_hash_table = 0;
3225 p->x_const_rtx_sym_hash_table = 0;
3226 p->x_const_double_chain = 0;
3229 enum kind { RTX_DOUBLE, RTX_INT };
3233 #ifdef ONLY_INT_FIELDS
3234 unsigned int kind : 16;
3235 unsigned int mode : 16;
3237 enum kind kind : 16;
3238 enum machine_mode mode : 16;
3241 union real_extract du;
3242 struct addr_const addr;
3243 struct {HOST_WIDE_INT high, low;} di;
3247 /* Express an rtx for a constant integer (perhaps symbolic)
3248 as the sum of a symbol or label plus an explicit integer.
3249 They are stored into VALUE. */
3252 decode_rtx_const (mode, x, value)
3253 enum machine_mode mode;
3255 struct rtx_const *value;
3257 /* Clear the whole structure, including any gaps. */
3260 int *p = (int *) value;
3261 int *end = (int *) (value + 1);
3266 value->kind = RTX_INT; /* Most usual kind. */
3269 switch (GET_CODE (x))
3272 value->kind = RTX_DOUBLE;
3273 if (GET_MODE (x) != VOIDmode)
3275 value->mode = GET_MODE (x);
3276 bcopy ((char *) &CONST_DOUBLE_LOW (x),
3277 (char *) &value->un.du, sizeof value->un.du);
3281 value->un.di.low = CONST_DOUBLE_LOW (x);
3282 value->un.di.high = CONST_DOUBLE_HIGH (x);
3287 value->un.addr.offset = INTVAL (x);
3293 value->un.addr.base = x;
3298 if (GET_CODE (x) == PLUS)
3300 value->un.addr.base = XEXP (x, 0);
3301 if (GET_CODE (XEXP (x, 1)) != CONST_INT)
3303 value->un.addr.offset = INTVAL (XEXP (x, 1));
3305 else if (GET_CODE (x) == MINUS)
3307 value->un.addr.base = XEXP (x, 0);
3308 if (GET_CODE (XEXP (x, 1)) != CONST_INT)
3310 value->un.addr.offset = - INTVAL (XEXP (x, 1));
3320 if (value->kind == RTX_INT && value->un.addr.base != 0)
3321 switch (GET_CODE (value->un.addr.base))
3325 /* Use the string's address, not the SYMBOL_REF's address,
3326 for the sake of addresses of library routines.
3327 For a LABEL_REF, compare labels. */
3328 value->un.addr.base = XEXP (value->un.addr.base, 0);
3335 /* Given a MINUS expression, simplify it if both sides
3336 include the same symbol. */
3339 simplify_subtraction (x)
3342 struct rtx_const val0, val1;
3344 decode_rtx_const (GET_MODE (x), XEXP (x, 0), &val0);
3345 decode_rtx_const (GET_MODE (x), XEXP (x, 1), &val1);
3347 if (val0.un.addr.base == val1.un.addr.base)
3348 return GEN_INT (val0.un.addr.offset - val1.un.addr.offset);
3352 /* Compute a hash code for a constant RTL expression. */
3355 const_hash_rtx (mode, x)
3356 enum machine_mode mode;
3362 struct rtx_const value;
3363 decode_rtx_const (mode, x, &value);
3365 /* Compute hashing function */
3367 for (i = 0; i < sizeof value / sizeof (int); i++)
3368 hi += ((int *) &value)[i];
3370 hi &= (1 << HASHBITS) - 1;
3371 hi %= MAX_RTX_HASH_TABLE;
3375 /* Compare a constant rtl object X with a constant-descriptor DESC.
3376 Return 1 if DESC describes a constant with the same value as X. */
3379 compare_constant_rtx (mode, x, desc)
3380 enum machine_mode mode;
3382 struct constant_descriptor *desc;
3384 register int *p = (int *) desc->contents;
3387 struct rtx_const value;
3389 decode_rtx_const (mode, x, &value);
3390 strp = (int *) &value;
3391 len = sizeof value / sizeof (int);
3393 /* Compare constant contents. */
3395 if (*p++ != *strp++)
3401 /* Construct a constant descriptor for the rtl-expression X.
3402 It is up to the caller to enter the descriptor in the hash table. */
3404 static struct constant_descriptor *
3405 record_constant_rtx (mode, x)
3406 enum machine_mode mode;
3409 struct constant_descriptor *ptr;
3411 struct rtx_const value;
3413 decode_rtx_const (mode, x, &value);
3415 /* Put these things in the saveable obstack so we can ensure it won't
3416 be freed if we are called from combine or some other phase that discards
3417 memory allocated from function_obstack (current_obstack). */
3418 obstack_grow (saveable_obstack, &ptr, sizeof ptr);
3419 obstack_grow (saveable_obstack, &label, sizeof label);
3421 /* Record constant contents. */
3422 obstack_grow (saveable_obstack, &value, sizeof value);
3424 return (struct constant_descriptor *) obstack_finish (saveable_obstack);
3427 /* Given a constant rtx X, make (or find) a memory constant for its value
3428 and return a MEM rtx to refer to it in memory. */
3431 force_const_mem (mode, x)
3432 enum machine_mode mode;
3436 register struct constant_descriptor *desc;
3441 /* If we want this CONST_DOUBLE in the same mode as it is in memory
3442 (this will always be true for floating CONST_DOUBLEs that have been
3443 placed in memory, but not for VOIDmode (integer) CONST_DOUBLEs),
3444 use the previous copy. Otherwise, make a new one. Note that in
3445 the unlikely event that this same CONST_DOUBLE is used in two different
3446 modes in an alternating fashion, we will allocate a lot of different
3447 memory locations, but this should be extremely rare. */
3449 if (GET_CODE (x) == CONST_DOUBLE
3450 && GET_CODE (CONST_DOUBLE_MEM (x)) == MEM
3451 && GET_MODE (CONST_DOUBLE_MEM (x)) == mode)
3452 return CONST_DOUBLE_MEM (x);
3454 /* Compute hash code of X. Search the descriptors for that hash code
3455 to see if any of them describes X. If yes, the descriptor records
3456 the label number already assigned. */
3458 hash = const_hash_rtx (mode, x);
3460 for (desc = const_rtx_hash_table[hash]; desc; desc = desc->next)
3461 if (compare_constant_rtx (mode, x, desc))
3463 found = desc->label;
3469 register struct pool_constant *pool;
3470 register struct pool_sym *sym;
3473 /* No constant equal to X is known to have been output.
3474 Make a constant descriptor to enter X in the hash table.
3475 Assign the label number and record it in the descriptor for
3476 future calls to this function to find. */
3478 desc = record_constant_rtx (mode, x);
3479 desc->next = const_rtx_hash_table[hash];
3480 const_rtx_hash_table[hash] = desc;
3482 /* Align the location counter as required by EXP's data type. */
3483 align = (mode == VOIDmode) ? UNITS_PER_WORD : GET_MODE_SIZE (mode);
3484 if (align > BIGGEST_ALIGNMENT / BITS_PER_UNIT)
3485 align = BIGGEST_ALIGNMENT / BITS_PER_UNIT;
3486 #ifdef CONSTANT_ALIGNMENT
3487 align = CONSTANT_ALIGNMENT (make_tree (type_for_mode (mode, 0), x),
3488 align * BITS_PER_UNIT) / BITS_PER_UNIT;
3491 pool_offset += align - 1;
3492 pool_offset &= ~ (align - 1);
3494 /* If RTL is not being placed into the saveable obstack, make a
3495 copy of X that is in the saveable obstack in case we are
3496 being called from combine or some other phase that discards
3497 memory it allocates. We used to only do this if it is a
3498 CONST; however, reload can allocate a CONST_INT when
3499 eliminating registers. */
3500 if (rtl_obstack != saveable_obstack
3501 && (GET_CODE (x) == CONST || GET_CODE (x) == CONST_INT))
3503 push_obstacks_nochange ();
3504 rtl_in_saveable_obstack ();
3506 if (GET_CODE (x) == CONST)
3507 x = gen_rtx_CONST (GET_MODE (x),
3508 gen_rtx_PLUS (GET_MODE (x),
3509 XEXP (XEXP (x, 0), 0),
3510 XEXP (XEXP (x, 0), 1)));
3512 x = GEN_INT (INTVAL (x));
3517 /* Allocate a pool constant descriptor, fill it in, and chain it in. */
3519 pool = (struct pool_constant *) savealloc (sizeof (struct pool_constant));
3523 pool->labelno = const_labelno;
3524 pool->align = align;
3525 pool->offset = pool_offset;
3532 last_pool->next = pool;
3535 pool_offset += GET_MODE_SIZE (mode);
3537 /* Create a string containing the label name, in LABEL. */
3538 ASM_GENERATE_INTERNAL_LABEL (label, "LC", const_labelno);
3543 = (char *) obstack_copy0 (saveable_obstack, label, strlen (label));
3545 /* Add label to symbol hash table. */
3546 hash = SYMHASH (found);
3547 sym = (struct pool_sym *) savealloc (sizeof (struct pool_sym));
3550 sym->next = const_rtx_sym_hash_table[hash];
3551 const_rtx_sym_hash_table[hash] = sym;
3554 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
3556 def = gen_rtx_MEM (mode, gen_rtx_SYMBOL_REF (Pmode, found));
3558 RTX_UNCHANGING_P (def) = 1;
3559 /* Mark the symbol_ref as belonging to this constants pool. */
3560 CONSTANT_POOL_ADDRESS_P (XEXP (def, 0)) = 1;
3561 current_function_uses_const_pool = 1;
3563 if (GET_CODE (x) == CONST_DOUBLE)
3565 if (CONST_DOUBLE_MEM (x) == cc0_rtx)
3567 CONST_DOUBLE_CHAIN (x) = const_double_chain;
3568 const_double_chain = x;
3570 CONST_DOUBLE_MEM (x) = def;
3576 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
3577 the corresponding pool_constant structure. */
3579 static struct pool_constant *
3580 find_pool_constant (f, addr)
3584 struct pool_sym *sym;
3585 char *label = XSTR (addr, 0);
3587 for (sym = f->varasm->x_const_rtx_sym_hash_table[SYMHASH (label)]; sym; sym = sym->next)
3588 if (sym->label == label)
3594 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
3597 get_pool_constant (addr)
3600 return (find_pool_constant (current_function, addr))->constant;
3603 /* Likewise, but for the constant pool of a specific function. */
3606 get_pool_constant_for_function (f, addr)
3610 return (find_pool_constant (f, addr))->constant;
3613 /* Similar, return the mode. */
3616 get_pool_mode (addr)
3619 return (find_pool_constant (current_function, addr))->mode;
3623 get_pool_mode_for_function (f, addr)
3627 return (find_pool_constant (f, addr))->mode;
3630 /* Similar, return the offset in the constant pool. */
3633 get_pool_offset (addr)
3636 return (find_pool_constant (current_function, addr))->offset;
3639 /* Return the size of the constant pool. */
3647 /* Write all the constants in the constant pool. */
3650 output_constant_pool (fnname, fndecl)
3651 char *fnname ATTRIBUTE_UNUSED;
3652 tree fndecl ATTRIBUTE_UNUSED;
3654 struct pool_constant *pool;
3656 union real_extract u;
3658 /* It is possible for gcc to call force_const_mem and then to later
3659 discard the instructions which refer to the constant. In such a
3660 case we do not need to output the constant. */
3661 mark_constant_pool ();
3663 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3664 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file, fnname, fndecl, pool_offset);
3667 for (pool = first_pool; pool; pool = pool->next)
3674 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3675 whose CODE_LABEL has been deleted. This can occur if a jump table
3676 is eliminated by optimization. If so, write a constant of zero
3677 instead. Note that this can also happen by turning the
3678 CODE_LABEL into a NOTE. */
3679 if (((GET_CODE (x) == LABEL_REF
3680 && (INSN_DELETED_P (XEXP (x, 0))
3681 || GET_CODE (XEXP (x, 0)) == NOTE)))
3682 || (GET_CODE (x) == CONST && GET_CODE (XEXP (x, 0)) == PLUS
3683 && GET_CODE (XEXP (XEXP (x, 0), 0)) == LABEL_REF
3684 && (INSN_DELETED_P (XEXP (XEXP (XEXP (x, 0), 0), 0))
3685 || GET_CODE (XEXP (XEXP (XEXP (x, 0), 0), 0)) == NOTE)))
3688 /* First switch to correct section. */
3689 #ifdef SELECT_RTX_SECTION
3690 SELECT_RTX_SECTION (pool->mode, x);
3692 readonly_data_section ();
3695 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3696 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file, x, pool->mode,
3697 pool->align, pool->labelno, done);
3700 if (pool->align > 1)
3701 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (pool->align));
3703 /* Output the label. */
3704 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LC", pool->labelno);
3706 /* Output the value of the constant itself. */
3707 switch (GET_MODE_CLASS (pool->mode))
3710 if (GET_CODE (x) != CONST_DOUBLE)
3713 bcopy ((char *) &CONST_DOUBLE_LOW (x), (char *) &u, sizeof u);
3714 assemble_real (u.d, pool->mode);
3718 case MODE_PARTIAL_INT:
3719 assemble_integer (x, GET_MODE_SIZE (pool->mode), 1);
3726 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3732 #ifdef ASM_OUTPUT_POOL_EPILOGUE
3733 ASM_OUTPUT_POOL_EPILOGUE (asm_out_file, fnname, fndecl, pool_offset);
3736 /* Done with this pool. */
3737 first_pool = last_pool = 0;
3740 /* Look through the instructions for this function, and mark all the
3741 entries in the constant pool which are actually being used. */
3744 mark_constant_pool ()
3747 struct pool_constant *pool;
3749 if (first_pool == 0)
3752 for (pool = first_pool; pool; pool = pool->next)
3755 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
3756 if (GET_RTX_CLASS (GET_CODE (insn)) == 'i')
3757 mark_constants (PATTERN (insn));
3759 for (insn = current_function_epilogue_delay_list;
3761 insn = XEXP (insn, 1))
3762 if (GET_RTX_CLASS (GET_CODE (insn)) == 'i')
3763 mark_constants (PATTERN (insn));
3765 /* It's possible that the only reference to a symbol is in a symbol
3766 that's in the constant pool. This happens in Fortran under some
3767 situations. (When the constant contains the address of another
3768 constant, and only the first is used directly in an insn.)
3769 This is potentially suboptimal if there's ever a possibility of
3770 backwards (in pool order) 2'd level references. However, it's
3771 not clear that 2'd level references can happen. */
3772 for (pool = first_pool; pool; pool = pool->next)
3774 struct pool_sym *sym;
3777 /* skip unmarked entries; no insn refers to them. */
3781 /* Skip everything except SYMBOL_REFs. */
3782 if (GET_CODE (pool->constant) != SYMBOL_REF)
3784 label = XSTR (pool->constant, 0);
3786 /* Be sure the symbol's value is marked. */
3787 for (sym = const_rtx_sym_hash_table[SYMHASH (label)]; sym;
3789 if (sym->label == label)
3790 sym->pool->mark = 1;
3791 /* If we didn't find it, there's something truly wrong here, but it
3792 will be announced by the assembler. */
3801 register const char *format_ptr;
3806 if (GET_CODE (x) == SYMBOL_REF)
3808 if (CONSTANT_POOL_ADDRESS_P (x))
3809 find_pool_constant (current_function, x)->mark = 1;
3812 /* Never search inside a CONST_DOUBLE, because CONST_DOUBLE_MEM may be
3813 a MEM, but does not constitute a use of that MEM. */
3814 else if (GET_CODE (x) == CONST_DOUBLE)
3817 /* Insns may appear inside a SEQUENCE. Only check the patterns of
3818 insns, not any notes that may be attached. We don't want to mark
3819 a constant just because it happens to appear in a REG_EQUIV note. */
3820 if (GET_RTX_CLASS (GET_CODE (x)) == 'i')
3822 mark_constants (PATTERN (x));
3826 format_ptr = GET_RTX_FORMAT (GET_CODE (x));
3828 for (i = 0; i < GET_RTX_LENGTH (GET_CODE (x)); i++)
3830 switch (*format_ptr++)
3833 mark_constants (XEXP (x, i));
3837 if (XVEC (x, i) != 0)
3841 for (j = 0; j < XVECLEN (x, i); j++)
3842 mark_constants (XVECEXP (x, i, j));
3861 /* Find all the constants whose addresses are referenced inside of EXP,
3862 and make sure assembler code with a label has been output for each one.
3863 Indicate whether an ADDR_EXPR has been encountered. */
3866 output_addressed_constants (exp)
3871 switch (TREE_CODE (exp))
3875 register tree constant = TREE_OPERAND (exp, 0);
3877 while (TREE_CODE (constant) == COMPONENT_REF)
3879 constant = TREE_OPERAND (constant, 0);
3882 if (TREE_CODE_CLASS (TREE_CODE (constant)) == 'c'
3883 || TREE_CODE (constant) == CONSTRUCTOR)
3884 /* No need to do anything here
3885 for addresses of variables or functions. */
3886 output_constant_def (constant);
3893 reloc = output_addressed_constants (TREE_OPERAND (exp, 0));
3894 reloc |= output_addressed_constants (TREE_OPERAND (exp, 1));
3899 case NON_LVALUE_EXPR:
3900 reloc = output_addressed_constants (TREE_OPERAND (exp, 0));
3906 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
3907 if (TREE_VALUE (link) != 0)
3908 reloc |= output_addressed_constants (TREE_VALUE (link));
3918 /* Output assembler code for constant EXP to FILE, with no label.
3919 This includes the pseudo-op such as ".int" or ".byte", and a newline.
3920 Assumes output_addressed_constants has been done on EXP already.
3922 Generate exactly SIZE bytes of assembler data, padding at the end
3923 with zeros if necessary. SIZE must always be specified.
3925 SIZE is important for structure constructors,
3926 since trailing members may have been omitted from the constructor.
3927 It is also important for initialization of arrays from string constants
3928 since the full length of the string constant might not be wanted.
3929 It is also needed for initialization of unions, where the initializer's
3930 type is just one member, and that may not be as long as the union.
3932 There a case in which we would fail to output exactly SIZE bytes:
3933 for a structure constructor that wants to produce more than SIZE bytes.
3934 But such constructors will never be generated for any possible input. */
3937 output_constant (exp, size)
3941 register enum tree_code code = TREE_CODE (TREE_TYPE (exp));
3943 /* Some front-ends use constants other than the standard
3944 language-indepdent varieties, but which may still be output
3945 directly. Give the front-end a chance to convert EXP to a
3946 language-independent representation. */
3947 if (lang_expand_constant)
3948 exp = (*lang_expand_constant) (exp);
3950 if (size == 0 || flag_syntax_only)
3953 /* Eliminate the NON_LVALUE_EXPR_EXPR that makes a cast not be an lvalue.
3954 That way we get the constant (we hope) inside it. Also, strip off any
3955 NOP_EXPR that converts between two record, union, array, or set types. */
3956 while ((TREE_CODE (exp) == NOP_EXPR
3957 && (TREE_TYPE (exp) == TREE_TYPE (TREE_OPERAND (exp, 0))
3958 || AGGREGATE_TYPE_P (TREE_TYPE (exp))))
3959 || TREE_CODE (exp) == NON_LVALUE_EXPR)
3960 exp = TREE_OPERAND (exp, 0);
3962 /* Allow a constructor with no elements for any data type.
3963 This means to fill the space with zeros. */
3964 if (TREE_CODE (exp) == CONSTRUCTOR && CONSTRUCTOR_ELTS (exp) == 0)
3966 assemble_zeros (size);
3977 case REFERENCE_TYPE:
3978 /* ??? What about (int)((float)(int)&foo + 4) */
3979 while (TREE_CODE (exp) == NOP_EXPR || TREE_CODE (exp) == CONVERT_EXPR
3980 || TREE_CODE (exp) == NON_LVALUE_EXPR)
3981 exp = TREE_OPERAND (exp, 0);
3983 if (! assemble_integer (expand_expr (exp, NULL_RTX, VOIDmode,
3984 EXPAND_INITIALIZER),
3986 error ("initializer for integer value is too complicated");
3991 if (TREE_CODE (exp) != REAL_CST)
3992 error ("initializer for floating value is not a floating constant");
3994 assemble_real (TREE_REAL_CST (exp),
3995 mode_for_size (size * BITS_PER_UNIT, MODE_FLOAT, 0));
4000 output_constant (TREE_REALPART (exp), size / 2);
4001 output_constant (TREE_IMAGPART (exp), size / 2);
4002 size -= (size / 2) * 2;
4006 if (TREE_CODE (exp) == CONSTRUCTOR)
4008 output_constructor (exp, size);
4011 else if (TREE_CODE (exp) == STRING_CST)
4015 if (size > TREE_STRING_LENGTH (exp))
4017 excess = size - TREE_STRING_LENGTH (exp);
4018 size = TREE_STRING_LENGTH (exp);
4021 assemble_string (TREE_STRING_POINTER (exp), size);
4030 if (TREE_CODE (exp) == CONSTRUCTOR)
4031 output_constructor (exp, size);
4037 if (TREE_CODE (exp) == INTEGER_CST)
4038 assemble_integer (expand_expr (exp, NULL_RTX,
4039 VOIDmode, EXPAND_INITIALIZER),
4041 else if (TREE_CODE (exp) == CONSTRUCTOR)
4043 unsigned char *buffer = (unsigned char *) alloca (size);
4044 if (get_set_constructor_bytes (exp, buffer, size))
4046 assemble_string ((char *) buffer, size);
4049 error ("unknown set constructor type");
4057 assemble_zeros (size);
4061 /* Subroutine of output_constant, used for CONSTRUCTORs
4062 (aggregate constants).
4063 Generate at least SIZE bytes, padding if necessary. */
4066 output_constructor (exp, size)
4070 register tree link, field = 0;
4071 HOST_WIDE_INT min_index = 0;
4072 /* Number of bytes output or skipped so far.
4073 In other words, current position within the constructor. */
4074 int total_bytes = 0;
4075 /* Non-zero means BYTE contains part of a byte, to be output. */
4076 int byte_buffer_in_use = 0;
4079 if (HOST_BITS_PER_WIDE_INT < BITS_PER_UNIT)
4082 if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE)
4083 field = TYPE_FIELDS (TREE_TYPE (exp));
4085 if (TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE
4086 && TYPE_DOMAIN (TREE_TYPE (exp)) != 0)
4088 = TREE_INT_CST_LOW (TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (exp))));
4090 /* As LINK goes through the elements of the constant,
4091 FIELD goes through the structure fields, if the constant is a structure.
4092 if the constant is a union, then we override this,
4093 by getting the field from the TREE_LIST element.
4094 But the constant could also be an array. Then FIELD is zero.
4096 There is always a maximum of one element in the chain LINK for unions
4097 (even if the initializer in a source program incorrectly contains
4099 for (link = CONSTRUCTOR_ELTS (exp);
4101 link = TREE_CHAIN (link),
4102 field = field ? TREE_CHAIN (field) : 0)
4104 tree val = TREE_VALUE (link);
4107 /* the element in a union constructor specifies the proper field. */
4109 if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE
4110 || TREE_CODE (TREE_TYPE (exp)) == UNION_TYPE)
4112 /* if available, use the type given by link */
4113 if (TREE_PURPOSE (link) != 0)
4114 field = TREE_PURPOSE (link);
4117 if (TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE)
4118 index = TREE_PURPOSE (link);
4120 /* Eliminate the marker that makes a cast not be an lvalue. */
4124 if (index && TREE_CODE (index) == RANGE_EXPR)
4126 register int fieldsize
4127 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (exp)));
4128 HOST_WIDE_INT lo_index = TREE_INT_CST_LOW (TREE_OPERAND (index, 0));
4129 HOST_WIDE_INT hi_index = TREE_INT_CST_LOW (TREE_OPERAND (index, 1));
4130 HOST_WIDE_INT index;
4131 for (index = lo_index; index <= hi_index; index++)
4133 /* Output the element's initial value. */
4135 assemble_zeros (fieldsize);
4137 output_constant (val, fieldsize);
4139 /* Count its size. */
4140 total_bytes += fieldsize;
4143 else if (field == 0 || !DECL_BIT_FIELD (field))
4145 /* An element that is not a bit-field. */
4147 register int fieldsize;
4148 /* Since this structure is static,
4149 we know the positions are constant. */
4150 int bitpos = (field ? (TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field))
4154 bitpos = (TREE_INT_CST_LOW (TYPE_SIZE (TREE_TYPE (val)))
4156 * (TREE_INT_CST_LOW (index) - min_index));
4158 /* Output any buffered-up bit-fields preceding this element. */
4159 if (byte_buffer_in_use)
4161 ASM_OUTPUT_BYTE (asm_out_file, byte);
4163 byte_buffer_in_use = 0;
4166 /* Advance to offset of this element.
4167 Note no alignment needed in an array, since that is guaranteed
4168 if each element has the proper size. */
4169 if ((field != 0 || index != 0) && bitpos != total_bytes)
4171 assemble_zeros (bitpos - total_bytes);
4172 total_bytes = bitpos;
4175 /* Determine size this element should occupy. */
4178 if (TREE_CODE (DECL_SIZE (field)) != INTEGER_CST)
4180 if (TREE_INT_CST_LOW (DECL_SIZE (field)) > 100000)
4182 /* This avoids overflow trouble. */
4183 tree size_tree = size_binop (CEIL_DIV_EXPR,
4185 size_int (BITS_PER_UNIT));
4186 fieldsize = TREE_INT_CST_LOW (size_tree);
4190 fieldsize = TREE_INT_CST_LOW (DECL_SIZE (field));
4191 fieldsize = (fieldsize + BITS_PER_UNIT - 1) / BITS_PER_UNIT;
4195 fieldsize = int_size_in_bytes (TREE_TYPE (TREE_TYPE (exp)));
4197 /* Output the element's initial value. */
4199 assemble_zeros (fieldsize);
4201 output_constant (val, fieldsize);
4203 /* Count its size. */
4204 total_bytes += fieldsize;
4206 else if (val != 0 && TREE_CODE (val) != INTEGER_CST)
4207 error ("invalid initial value for member `%s'",
4208 IDENTIFIER_POINTER (DECL_NAME (field)));
4211 /* Element that is a bit-field. */
4213 int next_offset = TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field));
4215 = (next_offset + TREE_INT_CST_LOW (DECL_SIZE (field)));
4218 val = integer_zero_node;
4220 /* If this field does not start in this (or, next) byte,
4222 if (next_offset / BITS_PER_UNIT != total_bytes)
4224 /* Output remnant of any bit field in previous bytes. */
4225 if (byte_buffer_in_use)
4227 ASM_OUTPUT_BYTE (asm_out_file, byte);
4229 byte_buffer_in_use = 0;
4232 /* If still not at proper byte, advance to there. */
4233 if (next_offset / BITS_PER_UNIT != total_bytes)
4235 assemble_zeros (next_offset / BITS_PER_UNIT - total_bytes);
4236 total_bytes = next_offset / BITS_PER_UNIT;
4240 if (! byte_buffer_in_use)
4243 /* We must split the element into pieces that fall within
4244 separate bytes, and combine each byte with previous or
4245 following bit-fields. */
4247 /* next_offset is the offset n fbits from the beginning of
4248 the structure to the next bit of this element to be processed.
4249 end_offset is the offset of the first bit past the end of
4251 while (next_offset < end_offset)
4255 HOST_WIDE_INT value;
4256 int next_byte = next_offset / BITS_PER_UNIT;
4257 int next_bit = next_offset % BITS_PER_UNIT;
4259 /* Advance from byte to byte
4260 within this element when necessary. */
4261 while (next_byte != total_bytes)
4263 ASM_OUTPUT_BYTE (asm_out_file, byte);
4268 /* Number of bits we can process at once
4269 (all part of the same byte). */
4270 this_time = MIN (end_offset - next_offset,
4271 BITS_PER_UNIT - next_bit);
4272 if (BYTES_BIG_ENDIAN)
4274 /* On big-endian machine, take the most significant bits
4275 first (of the bits that are significant)
4276 and put them into bytes from the most significant end. */
4277 shift = end_offset - next_offset - this_time;
4278 /* Don't try to take a bunch of bits that cross
4279 the word boundary in the INTEGER_CST. */
4280 if (shift < HOST_BITS_PER_WIDE_INT
4281 && shift + this_time > HOST_BITS_PER_WIDE_INT)
4283 this_time -= (HOST_BITS_PER_WIDE_INT - shift);
4284 shift = HOST_BITS_PER_WIDE_INT;
4287 /* Now get the bits from the appropriate constant word. */
4288 if (shift < HOST_BITS_PER_WIDE_INT)
4290 value = TREE_INT_CST_LOW (val);
4292 else if (shift < 2 * HOST_BITS_PER_WIDE_INT)
4294 value = TREE_INT_CST_HIGH (val);
4295 shift -= HOST_BITS_PER_WIDE_INT;
4299 byte |= (((value >> shift)
4300 & (((HOST_WIDE_INT) 1 << this_time) - 1))
4301 << (BITS_PER_UNIT - this_time - next_bit));
4305 /* On little-endian machines,
4306 take first the least significant bits of the value
4307 and pack them starting at the least significant
4308 bits of the bytes. */
4309 shift = (next_offset
4310 - TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field)));
4311 /* Don't try to take a bunch of bits that cross
4312 the word boundary in the INTEGER_CST. */
4313 if (shift < HOST_BITS_PER_WIDE_INT
4314 && shift + this_time > HOST_BITS_PER_WIDE_INT)
4316 this_time -= (HOST_BITS_PER_WIDE_INT - shift);
4317 shift = HOST_BITS_PER_WIDE_INT;
4320 /* Now get the bits from the appropriate constant word. */
4321 if (shift < HOST_BITS_PER_WIDE_INT)
4322 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))
4334 next_offset += this_time;
4335 byte_buffer_in_use = 1;
4339 if (byte_buffer_in_use)
4341 ASM_OUTPUT_BYTE (asm_out_file, byte);
4344 if (total_bytes < size)
4345 assemble_zeros (size - total_bytes);
4348 #ifdef HANDLE_PRAGMA_WEAK
4349 /* Add function NAME to the weak symbols list. VALUE is a weak alias
4350 associatd with NAME. */
4353 add_weak (name, value)
4357 struct weak_syms *weak;
4359 weak = (struct weak_syms *) permalloc (sizeof (struct weak_syms));
4364 weak->next = weak_decls;
4366 weak->value = value;
4371 #endif /* HANDLE_PRAGMA_WEAK */
4373 /* Declare DECL to be a weak symbol. */
4379 if (! TREE_PUBLIC (decl))
4380 error_with_decl (decl, "weak declaration of `%s' must be public");
4381 else if (TREE_ASM_WRITTEN (decl))
4382 error_with_decl (decl, "weak declaration of `%s' must precede definition");
4383 else if (SUPPORTS_WEAK)
4384 DECL_WEAK (decl) = 1;
4385 #ifdef HANDLE_PRAGMA_WEAK
4386 add_weak (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl)), NULL);
4390 /* Emit any pending weak declarations. */
4392 #ifdef HANDLE_PRAGMA_WEAK
4393 struct weak_syms * weak_decls;
4399 #ifdef HANDLE_PRAGMA_WEAK
4400 if (HANDLE_PRAGMA_WEAK)
4402 struct weak_syms *t;
4403 for (t = weak_decls; t; t = t->next)
4407 ASM_WEAKEN_LABEL (asm_out_file, t->name);
4409 ASM_OUTPUT_DEF (asm_out_file, t->name, t->value);
4416 /* Remove NAME from the pending list of weak symbols. This prevents
4417 the compiler from emitting multiple .weak directives which confuses
4420 remove_from_pending_weak_list (name)
4421 char *name ATTRIBUTE_UNUSED;
4423 #ifdef HANDLE_PRAGMA_WEAK
4424 if (HANDLE_PRAGMA_WEAK)
4426 struct weak_syms *t;
4427 for (t = weak_decls; t; t = t->next)
4429 if (t->name && strcmp (name, t->name) == 0)
4437 assemble_alias (decl, target)
4438 tree decl, target ATTRIBUTE_UNUSED;
4442 make_decl_rtl (decl, (char *) 0, 1);
4443 name = XSTR (XEXP (DECL_RTL (decl), 0), 0);
4445 #ifdef ASM_OUTPUT_DEF
4446 /* Make name accessible from other files, if appropriate. */
4448 if (TREE_PUBLIC (decl))
4450 #ifdef ASM_WEAKEN_LABEL
4451 if (DECL_WEAK (decl))
4453 ASM_WEAKEN_LABEL (asm_out_file, name);
4454 /* Remove this function from the pending weak list so that
4455 we do not emit multiple .weak directives for it. */
4456 remove_from_pending_weak_list
4457 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl)));
4461 ASM_GLOBALIZE_LABEL (asm_out_file, name);
4464 #ifdef ASM_OUTPUT_DEF_FROM_DECLS
4465 ASM_OUTPUT_DEF_FROM_DECLS (asm_out_file, decl, target);
4467 ASM_OUTPUT_DEF (asm_out_file, name, IDENTIFIER_POINTER (target));
4469 TREE_ASM_WRITTEN (decl) = 1;
4471 #ifdef ASM_OUTPUT_WEAK_ALIAS
4472 if (! DECL_WEAK (decl))
4473 warning ("only weak aliases are supported in this configuration");
4475 ASM_OUTPUT_WEAK_ALIAS (asm_out_file, name, IDENTIFIER_POINTER (target));
4476 TREE_ASM_WRITTEN (decl) = 1;
4478 warning ("alias definitions not supported in this configuration; ignored");
4483 /* This determines whether or not we support link-once semantics. */
4484 #ifndef SUPPORTS_ONE_ONLY
4485 #ifdef MAKE_DECL_ONE_ONLY
4486 #define SUPPORTS_ONE_ONLY 1
4488 #define SUPPORTS_ONE_ONLY 0
4492 /* Returns 1 if the target configuration supports defining public symbols
4493 so that one of them will be chosen at link time instead of generating a
4494 multiply-defined symbol error, whether through the use of weak symbols or
4495 a target-specific mechanism for having duplicates discarded. */
4498 supports_one_only ()
4500 if (SUPPORTS_ONE_ONLY)
4502 return SUPPORTS_WEAK;
4505 /* Set up DECL as a public symbol that can be defined in multiple
4506 translation units without generating a linker error. */
4509 make_decl_one_only (decl)
4512 if (TREE_CODE (decl) != VAR_DECL && TREE_CODE (decl) != FUNCTION_DECL)
4515 TREE_PUBLIC (decl) = 1;
4517 if (TREE_CODE (decl) == VAR_DECL
4518 && (DECL_INITIAL (decl) == 0 || DECL_INITIAL (decl) == error_mark_node))
4519 DECL_COMMON (decl) = 1;
4520 else if (SUPPORTS_ONE_ONLY)
4522 #ifdef MAKE_DECL_ONE_ONLY
4523 MAKE_DECL_ONE_ONLY (decl);
4525 DECL_ONE_ONLY (decl) = 1;
4527 else if (SUPPORTS_WEAK)
4528 DECL_WEAK (decl) = 1;