1 /* Output variables, constants and external declarations, for GNU compiler.
2 Copyright (C) 1987, 88, 89, 92-97, 1998 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. */
32 /* #include <stab.h> */
40 #include "hard-reg-set.h"
49 #ifdef XCOFF_DEBUGGING_INFO
53 #ifndef TRAMPOLINE_ALIGNMENT
54 #define TRAMPOLINE_ALIGNMENT FUNCTION_BOUNDARY
58 #define ASM_STABS_OP ".stabs"
61 /* Define the prefix to use when check_memory_usage_flag is enable. */
62 #ifdef NO_DOLLAR_IN_LABEL
63 #ifdef NO_DOT_IN_LABEL
64 #define CHKR_PREFIX "chkr_prefix_"
65 #else /* !NO_DOT_IN_LABEL */
66 #define CHKR_PREFIX "chkr."
68 #else /* !NO_DOLLAR_IN_LABEL */
69 #define CHKR_PREFIX "chkr$"
71 #define CHKR_PREFIX_SIZE (sizeof (CHKR_PREFIX) - 1)
73 /* This macro gets just the user-specified name
74 out of the string in a SYMBOL_REF. On most machines,
75 we discard the * if any and that's all. */
76 #ifndef STRIP_NAME_ENCODING
77 #define STRIP_NAME_ENCODING(VAR,SYMBOL_NAME) \
78 (VAR) = ((SYMBOL_NAME) + ((SYMBOL_NAME)[0] == '*'))
81 /* File in which assembler code is being written. */
83 extern FILE *asm_out_file;
85 /* The (assembler) name of the first globally-visible object output. */
86 char *first_global_object_name;
88 extern struct obstack *current_obstack;
89 extern struct obstack *saveable_obstack;
90 extern struct obstack *rtl_obstack;
91 extern struct obstack permanent_obstack;
92 #define obstack_chunk_alloc xmalloc
94 /* Number for making the label on the next
95 constant that is stored in memory. */
99 /* Number for making the label on the next
100 static variable internal to a function. */
104 /* Carry information from ASM_DECLARE_OBJECT_NAME
105 to ASM_FINISH_DECLARE_OBJECT. */
107 int size_directive_output;
109 /* The last decl for which assemble_variable was called,
110 if it did ASM_DECLARE_OBJECT_NAME.
111 If the last call to assemble_variable didn't do that,
114 tree last_assemble_variable_decl;
117 #ifdef HANDLE_PRAGMA_WEAK
118 /* Any weak symbol declarations waiting to be emitted. */
122 struct weak_syms *next;
127 static struct weak_syms *weak_decls;
130 /* Nonzero if at least one function definition has been seen. */
132 static int function_defined;
135 struct constant_descriptor;
137 struct pool_constant;
139 static char *strip_reg_name PROTO((char *));
140 static int contains_pointers_p PROTO((tree));
141 static void decode_addr_const PROTO((tree, struct addr_const *));
142 static int const_hash PROTO((tree));
143 static int compare_constant PROTO((tree,
144 struct constant_descriptor *));
145 static char *compare_constant_1 PROTO((tree, char *));
146 static struct constant_descriptor *record_constant PROTO((tree));
147 static void record_constant_1 PROTO((tree));
148 static tree copy_constant PROTO((tree));
149 static void output_constant_def_contents PROTO((tree, int, int));
150 static void decode_rtx_const PROTO((enum machine_mode, rtx,
151 struct rtx_const *));
152 static int const_hash_rtx PROTO((enum machine_mode, rtx));
153 static int compare_constant_rtx PROTO((enum machine_mode, rtx,
154 struct constant_descriptor *));
155 static struct constant_descriptor *record_constant_rtx PROTO((enum machine_mode,
157 static struct pool_constant *find_pool_constant PROTO((rtx));
158 static void mark_constant_pool PROTO((void));
159 static void mark_constants PROTO((rtx));
160 static int output_addressed_constants PROTO((tree));
161 static void output_after_function_constants PROTO((void));
162 static void output_constructor PROTO((tree, int));
163 #ifdef ASM_OUTPUT_BSS
164 static void asm_output_bss PROTO((FILE *, tree, char *, int, int));
166 #ifdef ASM_OUTPUT_ALIGNED_BSS
167 static void asm_output_aligned_bss PROTO((FILE *, tree, char *, int, int));
170 static enum in_section { no_section, in_text, in_data, in_named
171 #ifdef BSS_SECTION_ASM_OP
174 #ifdef EH_FRAME_SECTION_ASM_OP
177 #ifdef EXTRA_SECTIONS
180 } in_section = no_section;
182 /* Return a non-zero value if DECL has a section attribute. */
183 #define IN_NAMED_SECTION(DECL) \
184 ((TREE_CODE (DECL) == FUNCTION_DECL || TREE_CODE (DECL) == VAR_DECL) \
185 && DECL_SECTION_NAME (DECL) != NULL_TREE)
187 /* Text of section name when in_section == in_named. */
188 static char *in_named_name;
190 /* Define functions like text_section for any extra sections. */
191 #ifdef EXTRA_SECTION_FUNCTIONS
192 EXTRA_SECTION_FUNCTIONS
195 /* Tell assembler to switch to text section. */
200 if (in_section != in_text)
202 fprintf (asm_out_file, "%s\n", TEXT_SECTION_ASM_OP);
203 in_section = in_text;
207 /* Tell assembler to switch to data section. */
212 if (in_section != in_data)
214 if (flag_shared_data)
216 #ifdef SHARED_SECTION_ASM_OP
217 fprintf (asm_out_file, "%s\n", SHARED_SECTION_ASM_OP);
219 fprintf (asm_out_file, "%s\n", DATA_SECTION_ASM_OP);
223 fprintf (asm_out_file, "%s\n", DATA_SECTION_ASM_OP);
225 in_section = in_data;
229 /* Tell assembler to switch to read-only data section. This is normally
233 readonly_data_section ()
235 #ifdef READONLY_DATA_SECTION
236 READONLY_DATA_SECTION (); /* Note this can call data_section. */
242 /* Determine if we're in the text section. */
247 return in_section == in_text;
250 /* Determine if we're in the data section. */
255 return in_section == in_data;
258 /* Tell assembler to change to section NAME for DECL.
259 If DECL is NULL, just switch to section NAME.
260 If NAME is NULL, get the name from DECL.
261 If RELOC is 1, the initializer for DECL contains relocs. */
264 named_section (decl, name, reloc)
269 if (decl != NULL_TREE
270 && TREE_CODE_CLASS (TREE_CODE (decl)) != 'd')
273 name = TREE_STRING_POINTER (DECL_SECTION_NAME (decl));
275 if (in_section != in_named || strcmp (name, in_named_name))
277 #ifdef ASM_OUTPUT_SECTION_NAME
278 ASM_OUTPUT_SECTION_NAME (asm_out_file, decl, name, reloc);
280 /* Section attributes are not supported if this macro isn't provided -
281 some host formats don't support them at all. The front-end should
282 already have flagged this as an error. */
286 in_named_name = obstack_alloc (&permanent_obstack, strlen (name) + 1);
287 strcpy (in_named_name, name);
288 in_section = in_named;
292 #ifdef ASM_OUTPUT_SECTION_NAME
293 #ifndef UNIQUE_SECTION
294 #define UNIQUE_SECTION(DECL,RELOC) \
297 char *name, *string; \
299 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (DECL)); \
300 /* Strip off any encoding in name. */ \
301 STRIP_NAME_ENCODING (name, name); \
303 len = strlen (name) + 1; \
304 string = alloca (len + 1); \
305 sprintf (string, ".%s", name); \
307 DECL_SECTION_NAME (DECL) = build_string (len, string); \
310 #ifndef UNIQUE_SECTION_P
311 #define UNIQUE_SECTION_P(DECL) 0
315 #ifdef BSS_SECTION_ASM_OP
317 /* Tell the assembler to switch to the bss section. */
322 if (in_section != in_bss)
324 #ifdef SHARED_BSS_SECTION_ASM_OP
325 if (flag_shared_data)
326 fprintf (asm_out_file, "%s\n", SHARED_BSS_SECTION_ASM_OP);
329 fprintf (asm_out_file, "%s\n", BSS_SECTION_ASM_OP);
335 #ifdef ASM_OUTPUT_BSS
337 /* Utility function for ASM_OUTPUT_BSS for targets to use if
338 they don't support alignments in .bss.
339 ??? It is believed that this function will work in most cases so such
340 support is localized here. */
343 asm_output_bss (file, decl, name, size, rounded)
349 ASM_GLOBALIZE_LABEL (file, name);
351 #ifdef ASM_DECLARE_OBJECT_NAME
352 last_assemble_variable_decl = decl;
353 ASM_DECLARE_OBJECT_NAME (file, name, decl);
355 /* Standard thing is just output label for the object. */
356 ASM_OUTPUT_LABEL (file, name);
357 #endif /* ASM_DECLARE_OBJECT_NAME */
358 ASM_OUTPUT_SKIP (file, rounded);
363 #ifdef ASM_OUTPUT_ALIGNED_BSS
365 /* Utility function for targets to use in implementing
366 ASM_OUTPUT_ALIGNED_BSS.
367 ??? It is believed that this function will work in most cases so such
368 support is localized here. */
371 asm_output_aligned_bss (file, decl, name, size, align)
377 ASM_GLOBALIZE_LABEL (file, name);
379 ASM_OUTPUT_ALIGN (file, floor_log2 (align / BITS_PER_UNIT));
380 #ifdef ASM_DECLARE_OBJECT_NAME
381 last_assemble_variable_decl = decl;
382 ASM_DECLARE_OBJECT_NAME (file, name, decl);
384 /* Standard thing is just output label for the object. */
385 ASM_OUTPUT_LABEL (file, name);
386 #endif /* ASM_DECLARE_OBJECT_NAME */
387 ASM_OUTPUT_SKIP (file, size ? size : 1);
392 #endif /* BSS_SECTION_ASM_OP */
394 #ifdef EH_FRAME_SECTION_ASM_OP
398 if (in_section != in_eh_frame)
400 fprintf (asm_out_file, "%s\n", EH_FRAME_SECTION_ASM_OP);
401 in_section = in_eh_frame;
406 /* Switch to the section for function DECL.
408 If DECL is NULL_TREE, switch to the text section.
409 ??? It's not clear that we will ever be passed NULL_TREE, but it's
410 safer to handle it. */
413 function_section (decl)
416 if (decl != NULL_TREE
417 && DECL_SECTION_NAME (decl) != NULL_TREE)
418 named_section (decl, (char *) 0, 0);
423 /* Switch to section for variable DECL.
425 RELOC is the `reloc' argument to SELECT_SECTION. */
428 variable_section (decl, reloc)
432 if (IN_NAMED_SECTION (decl))
433 named_section (decl, NULL, reloc);
436 /* C++ can have const variables that get initialized from constructors,
437 and thus can not be in a readonly section. We prevent this by
438 verifying that the initial value is constant for objects put in a
441 error_mark_node is used by the C front end to indicate that the
442 initializer has not been seen yet. In this case, we assume that
443 the initializer must be constant.
445 C++ uses error_mark_node for variables that have complicated
446 initializers, but these variables go in BSS so we won't be called
449 #ifdef SELECT_SECTION
450 SELECT_SECTION (decl, reloc);
452 if (DECL_READONLY_SECTION (decl, reloc))
453 readonly_data_section ();
460 /* Tell assembler to switch to the section for the exception handling
466 #if defined (EXCEPTION_SECTION)
467 EXCEPTION_SECTION ();
469 #ifdef ASM_OUTPUT_SECTION_NAME
470 named_section (NULL_TREE, ".gcc_except_table", 0);
475 readonly_data_section ();
480 /* Create the rtl to represent a function, for a function definition.
481 DECL is a FUNCTION_DECL node which describes which function.
482 The rtl is stored into DECL. */
485 make_function_rtl (decl)
488 char *name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
489 char *new_name = name;
491 /* Rename a nested function to avoid conflicts. */
492 if (decl_function_context (decl) != 0
493 && DECL_INITIAL (decl) != 0
494 && DECL_RTL (decl) == 0)
498 name = IDENTIFIER_POINTER (DECL_NAME (decl));
499 ASM_FORMAT_PRIVATE_NAME (label, name, var_labelno);
500 name = obstack_copy0 (saveable_obstack, label, strlen (label));
505 /* When -fprefix-function-name is used, every function name is
506 prefixed. Even static functions are prefixed because they
507 could be declared latter. Note that a nested function name
509 if (flag_prefix_function_name)
511 new_name = (char *) alloca (strlen (name) + CHKR_PREFIX_SIZE + 1);
512 strcpy (new_name, CHKR_PREFIX);
513 strcpy (new_name + CHKR_PREFIX_SIZE, name);
514 name = obstack_copy0 (saveable_obstack, new_name, strlen (new_name));
518 if (DECL_RTL (decl) == 0)
521 = gen_rtx_MEM (DECL_MODE (decl),
522 gen_rtx_SYMBOL_REF (Pmode, name));
524 /* Optionally set flags or add text to the name to record information
525 such as that it is a function name. If the name is changed, the macro
526 ASM_OUTPUT_LABELREF will have to know how to strip this information. */
527 #ifdef ENCODE_SECTION_INFO
528 ENCODE_SECTION_INFO (decl);
533 /* ??? Another way to do this would be to do what halfpic.c does
534 and maintain a hashed table of such critters. */
535 /* ??? Another way to do this would be to pass a flag bit to
536 ENCODE_SECTION_INFO saying whether this is a new decl or not. */
537 /* Let the target reassign the RTL if it wants.
538 This is necessary, for example, when one machine specific
539 decl attribute overrides another. */
540 #ifdef REDO_SECTION_INFO_P
541 if (REDO_SECTION_INFO_P (decl))
542 ENCODE_SECTION_INFO (decl);
546 /* Record at least one function has been defined. */
547 function_defined = 1;
550 /* Given NAME, a putative register name, discard any customary prefixes. */
553 strip_reg_name (name)
556 #ifdef REGISTER_PREFIX
557 if (!strncmp (name, REGISTER_PREFIX, strlen (REGISTER_PREFIX)))
558 name += strlen (REGISTER_PREFIX);
560 if (name[0] == '%' || name[0] == '#')
565 /* Decode an `asm' spec for a declaration as a register name.
566 Return the register number, or -1 if nothing specified,
567 or -2 if the ASMSPEC is not `cc' or `memory' and is not recognized,
568 or -3 if ASMSPEC is `cc' and is not recognized,
569 or -4 if ASMSPEC is `memory' and is not recognized.
570 Accept an exact spelling or a decimal number.
571 Prefixes such as % are optional. */
574 decode_reg_name (asmspec)
581 /* Get rid of confusing prefixes. */
582 asmspec = strip_reg_name (asmspec);
584 /* Allow a decimal number as a "register name". */
585 for (i = strlen (asmspec) - 1; i >= 0; i--)
586 if (! (asmspec[i] >= '0' && asmspec[i] <= '9'))
588 if (asmspec[0] != 0 && i < 0)
591 if (i < FIRST_PSEUDO_REGISTER && i >= 0)
597 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
599 && ! strcmp (asmspec, strip_reg_name (reg_names[i])))
602 #ifdef ADDITIONAL_REGISTER_NAMES
604 static struct { char *name; int number; } table[]
605 = ADDITIONAL_REGISTER_NAMES;
607 for (i = 0; i < sizeof (table) / sizeof (table[0]); i++)
608 if (! strcmp (asmspec, table[i].name))
609 return table[i].number;
611 #endif /* ADDITIONAL_REGISTER_NAMES */
613 if (!strcmp (asmspec, "memory"))
616 if (!strcmp (asmspec, "cc"))
625 /* Create the DECL_RTL for a declaration for a static or external variable
626 or static or external function.
627 ASMSPEC, if not 0, is the string which the user specified
628 as the assembler symbol name.
629 TOP_LEVEL is nonzero if this is a file-scope variable.
631 This is never called for PARM_DECL nodes. */
634 make_decl_rtl (decl, asmspec, top_level)
639 register char *name = 0;
642 reg_number = decode_reg_name (asmspec);
644 if (DECL_ASSEMBLER_NAME (decl) != NULL_TREE)
645 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
647 if (reg_number == -2)
649 /* ASMSPEC is given, and not the name of a register. */
650 name = (char *) obstack_alloc (saveable_obstack,
651 strlen (asmspec) + 2);
653 strcpy (&name[1], asmspec);
656 /* For a duplicate declaration, we can be called twice on the
657 same DECL node. Don't discard the RTL already made. */
658 if (DECL_RTL (decl) == 0)
662 /* First detect errors in declaring global registers. */
663 if (TREE_CODE (decl) != FUNCTION_DECL
664 && DECL_REGISTER (decl) && reg_number == -1)
665 error_with_decl (decl,
666 "register name not specified for `%s'");
667 else if (TREE_CODE (decl) != FUNCTION_DECL
668 && DECL_REGISTER (decl) && reg_number < 0)
669 error_with_decl (decl,
670 "invalid register name for `%s'");
671 else if ((reg_number >= 0 || reg_number == -3)
672 && (TREE_CODE (decl) == FUNCTION_DECL
673 && ! DECL_REGISTER (decl)))
674 error_with_decl (decl,
675 "register name given for non-register variable `%s'");
676 else if (TREE_CODE (decl) != FUNCTION_DECL
677 && DECL_REGISTER (decl)
678 && TYPE_MODE (TREE_TYPE (decl)) == BLKmode)
679 error_with_decl (decl,
680 "data type of `%s' isn't suitable for a register");
681 else if (TREE_CODE (decl) != FUNCTION_DECL && DECL_REGISTER (decl)
682 && ! HARD_REGNO_MODE_OK (reg_number,
683 TYPE_MODE (TREE_TYPE (decl))))
684 error_with_decl (decl,
685 "register number for `%s' isn't suitable for data type");
686 /* Now handle properly declared static register variables. */
687 else if (TREE_CODE (decl) != FUNCTION_DECL && DECL_REGISTER (decl))
691 if (DECL_INITIAL (decl) != 0 && top_level)
693 DECL_INITIAL (decl) = 0;
694 error ("global register variable has initial value");
696 if (fixed_regs[reg_number] == 0
697 && function_defined && top_level)
698 error ("global register variable follows a function definition");
699 if (TREE_THIS_VOLATILE (decl))
700 warning ("volatile register variables don't work as you might wish");
702 /* If the user specified one of the eliminables registers here,
703 e.g., FRAME_POINTER_REGNUM, we don't want to get this variable
704 confused with that register and be eliminated. Although this
705 usage is somewhat suspect, we nevertheless use the following
706 kludge to avoid setting DECL_RTL to frame_pointer_rtx. */
709 = gen_rtx_REG (DECL_MODE (decl), FIRST_PSEUDO_REGISTER);
710 REGNO (DECL_RTL (decl)) = reg_number;
711 REG_USERVAR_P (DECL_RTL (decl)) = 1;
715 /* Make this register global, so not usable for anything
717 nregs = HARD_REGNO_NREGS (reg_number, DECL_MODE (decl));
719 globalize_reg (reg_number + --nregs);
722 /* Specifying a section attribute on a variable forces it into a
723 non-.bss section, and thus it cannot be common. */
724 else if (TREE_CODE (decl) == VAR_DECL
725 && DECL_SECTION_NAME (decl) != NULL_TREE
726 && DECL_INITIAL (decl) == NULL_TREE
727 && DECL_COMMON (decl))
728 DECL_COMMON (decl) = 0;
730 /* Now handle ordinary static variables and functions (in memory).
731 Also handle vars declared register invalidly. */
732 if (DECL_RTL (decl) == 0)
734 /* Can't use just the variable's own name for a variable
735 whose scope is less than the whole file.
736 Concatenate a distinguishing number. */
737 if (!top_level && !TREE_PUBLIC (decl) && asmspec == 0)
741 ASM_FORMAT_PRIVATE_NAME (label, name, var_labelno);
742 name = obstack_copy0 (saveable_obstack, label, strlen (label));
746 /* ??? This results in incorrect stabs debug info for static
748 /* We've changed the name by which this entity is
749 known. In order that we can generate
750 correct references to it, we update its
751 DECL_ASSEMBLER_NAME. */
752 DECL_ASSEMBLER_NAME (decl) = get_identifier (name);
759 /* When -fprefix-function-name is used, the functions
760 names are prefixed. Only nested function names are not
762 if (flag_prefix_function_name && TREE_CODE (decl) == FUNCTION_DECL)
765 new_name = (char *) alloca (strlen (name) + CHKR_PREFIX_SIZE
767 strcpy (new_name, CHKR_PREFIX);
768 strcpy (new_name + CHKR_PREFIX_SIZE, name);
769 name = obstack_copy0 (saveable_obstack,
770 new_name, strlen (new_name));
773 DECL_RTL (decl) = gen_rtx_MEM (DECL_MODE (decl),
774 gen_rtx_SYMBOL_REF (Pmode, name));
776 /* If this variable is to be treated as volatile, show its
777 tree node has side effects. If it has side effects, either
778 because of this test or from TREE_THIS_VOLATILE also
779 being set, show the MEM is volatile. */
780 if (flag_volatile_global && TREE_CODE (decl) == VAR_DECL
781 && TREE_PUBLIC (decl))
782 TREE_SIDE_EFFECTS (decl) = 1;
783 if (TREE_SIDE_EFFECTS (decl))
784 MEM_VOLATILE_P (DECL_RTL (decl)) = 1;
786 if (TREE_READONLY (decl))
787 RTX_UNCHANGING_P (DECL_RTL (decl)) = 1;
788 MEM_IN_STRUCT_P (DECL_RTL (decl))
789 = AGGREGATE_TYPE_P (TREE_TYPE (decl));
791 /* Optionally set flags or add text to the name to record information
792 such as that it is a function name.
793 If the name is changed, the macro ASM_OUTPUT_LABELREF
794 will have to know how to strip this information. */
795 #ifdef ENCODE_SECTION_INFO
796 ENCODE_SECTION_INFO (decl);
802 /* If the old RTL had the wrong mode, fix the mode. */
803 if (GET_MODE (DECL_RTL (decl)) != DECL_MODE (decl))
805 rtx rtl = DECL_RTL (decl);
806 PUT_MODE (rtl, DECL_MODE (decl));
809 /* ??? Another way to do this would be to do what halfpic.c does
810 and maintain a hashed table of such critters. */
811 /* ??? Another way to do this would be to pass a flag bit to
812 ENCODE_SECTION_INFO saying whether this is a new decl or not. */
813 /* Let the target reassign the RTL if it wants.
814 This is necessary, for example, when one machine specific
815 decl attribute overrides another. */
816 #ifdef REDO_SECTION_INFO_P
817 if (REDO_SECTION_INFO_P (decl))
818 ENCODE_SECTION_INFO (decl);
823 /* Make the rtl for variable VAR be volatile.
824 Use this only for static variables. */
827 make_var_volatile (var)
830 if (GET_CODE (DECL_RTL (var)) != MEM)
833 MEM_VOLATILE_P (DECL_RTL (var)) = 1;
836 /* Output alignment directive to align for constant expression EXP. */
839 assemble_constant_align (exp)
844 /* Align the location counter as required by EXP's data type. */
845 align = TYPE_ALIGN (TREE_TYPE (exp));
846 #ifdef CONSTANT_ALIGNMENT
847 align = CONSTANT_ALIGNMENT (exp, align);
850 if (align > BITS_PER_UNIT)
851 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
854 /* Output a string of literal assembler code
855 for an `asm' keyword used between functions. */
858 assemble_asm (string)
863 if (TREE_CODE (string) == ADDR_EXPR)
864 string = TREE_OPERAND (string, 0);
866 fprintf (asm_out_file, "\t%s\n", TREE_STRING_POINTER (string));
869 #if 0 /* This should no longer be needed, because
870 flag_gnu_linker should be 0 on these systems,
871 which should prevent any output
872 if ASM_OUTPUT_CONSTRUCTOR and ASM_OUTPUT_DESTRUCTOR are absent. */
873 #if !(defined(DBX_DEBUGGING_INFO) && !defined(FASCIST_ASSEMBLER))
874 #ifndef ASM_OUTPUT_CONSTRUCTOR
875 #define ASM_OUTPUT_CONSTRUCTOR(file, name)
877 #ifndef ASM_OUTPUT_DESTRUCTOR
878 #define ASM_OUTPUT_DESTRUCTOR(file, name)
883 /* Record an element in the table of global destructors.
884 How this is done depends on what sort of assembler and linker
887 NAME should be the name of a global function to be called
888 at exit time. This name is output using assemble_name. */
891 assemble_destructor (name)
894 #ifdef ASM_OUTPUT_DESTRUCTOR
895 ASM_OUTPUT_DESTRUCTOR (asm_out_file, name);
899 /* Now tell GNU LD that this is part of the static destructor set. */
900 /* This code works for any machine provided you use GNU as/ld. */
901 fprintf (asm_out_file, "%s \"___DTOR_LIST__\",22,0,0,", ASM_STABS_OP);
902 assemble_name (asm_out_file, name);
903 fputc ('\n', asm_out_file);
908 /* Likewise for global constructors. */
911 assemble_constructor (name)
914 #ifdef ASM_OUTPUT_CONSTRUCTOR
915 ASM_OUTPUT_CONSTRUCTOR (asm_out_file, name);
919 /* Now tell GNU LD that this is part of the static constructor set. */
920 /* This code works for any machine provided you use GNU as/ld. */
921 fprintf (asm_out_file, "%s \"___CTOR_LIST__\",22,0,0,", ASM_STABS_OP);
922 assemble_name (asm_out_file, name);
923 fputc ('\n', asm_out_file);
928 /* Likewise for entries we want to record for garbage collection.
929 Garbage collection is still under development. */
932 assemble_gc_entry (name)
935 #ifdef ASM_OUTPUT_GC_ENTRY
936 ASM_OUTPUT_GC_ENTRY (asm_out_file, name);
940 /* Now tell GNU LD that this is part of the static constructor set. */
941 fprintf (asm_out_file, "%s \"___PTR_LIST__\",22,0,0,", ASM_STABS_OP);
942 assemble_name (asm_out_file, name);
943 fputc ('\n', asm_out_file);
948 /* CONSTANT_POOL_BEFORE_FUNCTION may be defined as an expression with
949 a non-zero value if the constant pool should be output before the
950 start of the function, or a zero value if the pool should output
951 after the end of the function. The default is to put it before the
954 #ifndef CONSTANT_POOL_BEFORE_FUNCTION
955 #define CONSTANT_POOL_BEFORE_FUNCTION 1
958 /* Output assembler code for the constant pool of a function and associated
959 with defining the name of the function. DECL describes the function.
960 NAME is the function's name. For the constant pool, we use the current
961 constant pool data. */
964 assemble_start_function (decl, fnname)
970 /* The following code does not need preprocessing in the assembler. */
974 if (CONSTANT_POOL_BEFORE_FUNCTION)
975 output_constant_pool (fnname, decl);
977 #ifdef ASM_OUTPUT_SECTION_NAME
978 /* If the function is to be put in its own section and it's not in a section
979 already, indicate so. */
980 if ((flag_function_sections
981 && DECL_SECTION_NAME (decl) == NULL_TREE)
982 || UNIQUE_SECTION_P (decl))
983 UNIQUE_SECTION (decl, 0);
986 function_section (decl);
988 /* Tell assembler to move to target machine's alignment for functions. */
989 align = floor_log2 (FUNCTION_BOUNDARY / BITS_PER_UNIT);
991 ASM_OUTPUT_ALIGN (asm_out_file, align);
993 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
994 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file, fnname);
997 #ifdef SDB_DEBUGGING_INFO
998 /* Output SDB definition of the function. */
999 if (write_symbols == SDB_DEBUG)
1000 sdbout_mark_begin_function ();
1003 #ifdef DBX_DEBUGGING_INFO
1004 /* Output DBX definition of the function. */
1005 if (write_symbols == DBX_DEBUG)
1006 dbxout_begin_function (decl);
1009 /* Make function name accessible from other files, if appropriate. */
1011 if (TREE_PUBLIC (decl))
1013 if (!first_global_object_name && ! DECL_WEAK (decl)
1014 && ! DECL_ONE_ONLY (decl))
1018 STRIP_NAME_ENCODING (p, fnname);
1019 first_global_object_name = permalloc (strlen (p) + 1);
1020 strcpy (first_global_object_name, p);
1023 #ifdef ASM_WEAKEN_LABEL
1024 if (DECL_WEAK (decl))
1025 ASM_WEAKEN_LABEL (asm_out_file, fnname);
1028 ASM_GLOBALIZE_LABEL (asm_out_file, fnname);
1031 /* Do any machine/system dependent processing of the function name */
1032 #ifdef ASM_DECLARE_FUNCTION_NAME
1033 ASM_DECLARE_FUNCTION_NAME (asm_out_file, fnname, current_function_decl);
1035 /* Standard thing is just output label for the function. */
1036 ASM_OUTPUT_LABEL (asm_out_file, fnname);
1037 #endif /* ASM_DECLARE_FUNCTION_NAME */
1040 /* Output assembler code associated with defining the size of the
1041 function. DECL describes the function. NAME is the function's name. */
1044 assemble_end_function (decl, fnname)
1048 #ifdef ASM_DECLARE_FUNCTION_SIZE
1049 ASM_DECLARE_FUNCTION_SIZE (asm_out_file, fnname, decl);
1051 if (! CONSTANT_POOL_BEFORE_FUNCTION)
1053 output_constant_pool (fnname, decl);
1054 function_section (decl); /* need to switch back */
1057 /* Output any constants which should appear after the function. */
1058 output_after_function_constants ();
1061 /* Assemble code to leave SIZE bytes of zeros. */
1064 assemble_zeros (size)
1067 #ifdef ASM_NO_SKIP_IN_TEXT
1068 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
1069 so we must output 0s explicitly in the text section. */
1070 if (ASM_NO_SKIP_IN_TEXT && in_text_section ())
1074 for (i = 0; i < size - 20; i += 20)
1077 fprintf (asm_out_file,
1078 "%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);
1080 fprintf (asm_out_file,
1081 "\tbyte 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n");
1087 fprintf (asm_out_file, "%s 0", ASM_BYTE_OP);
1089 fprintf (asm_out_file, "\tbyte 0");
1092 for (; i < size; i++)
1093 fprintf (asm_out_file, ",0");
1094 fprintf (asm_out_file, "\n");
1100 ASM_OUTPUT_SKIP (asm_out_file, size);
1103 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
1106 assemble_align (align)
1109 if (align > BITS_PER_UNIT)
1110 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
1113 /* Assemble a string constant with the specified C string as contents. */
1116 assemble_string (p, size)
1123 /* If the string is very long, split it up. */
1127 int thissize = size - pos;
1128 if (thissize > maximum)
1131 ASM_OUTPUT_ASCII (asm_out_file, p, thissize);
1139 /* Assemble everything that is needed for a variable or function declaration.
1140 Not used for automatic variables, and not used for function definitions.
1141 Should not be called for variables of incomplete structure type.
1143 TOP_LEVEL is nonzero if this variable has file scope.
1144 AT_END is nonzero if this is the special handling, at end of compilation,
1145 to define things that have had only tentative definitions.
1146 DONT_OUTPUT_DATA if nonzero means don't actually output the
1147 initial value (that will be done by the caller). */
1150 assemble_variable (decl, top_level, at_end, dont_output_data)
1154 int dont_output_data;
1156 register char *name;
1160 enum in_section saved_in_section;
1162 last_assemble_variable_decl = 0;
1164 if (GET_CODE (DECL_RTL (decl)) == REG)
1166 /* Do output symbol info for global register variables, but do nothing
1169 if (TREE_ASM_WRITTEN (decl))
1171 TREE_ASM_WRITTEN (decl) = 1;
1173 #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
1174 /* File-scope global variables are output here. */
1175 if ((write_symbols == DBX_DEBUG || write_symbols == XCOFF_DEBUG)
1177 dbxout_symbol (decl, 0);
1179 #ifdef SDB_DEBUGGING_INFO
1180 if (write_symbols == SDB_DEBUG && top_level
1181 /* Leave initialized global vars for end of compilation;
1182 see comment in compile_file. */
1183 && (TREE_PUBLIC (decl) == 0 || DECL_INITIAL (decl) == 0))
1184 sdbout_symbol (decl, 0);
1187 /* Don't output any DWARF debugging information for variables here.
1188 In the case of local variables, the information for them is output
1189 when we do our recursive traversal of the tree representation for
1190 the entire containing function. In the case of file-scope variables,
1191 we output information for all of them at the very end of compilation
1192 while we are doing our final traversal of the chain of file-scope
1198 /* Normally no need to say anything here for external references,
1199 since assemble_external is called by the language-specific code
1200 when a declaration is first seen. */
1202 if (DECL_EXTERNAL (decl))
1205 /* Output no assembler code for a function declaration.
1206 Only definitions of functions output anything. */
1208 if (TREE_CODE (decl) == FUNCTION_DECL)
1211 /* If type was incomplete when the variable was declared,
1212 see if it is complete now. */
1214 if (DECL_SIZE (decl) == 0)
1215 layout_decl (decl, 0);
1217 /* Still incomplete => don't allocate it; treat the tentative defn
1218 (which is what it must have been) as an `extern' reference. */
1220 if (!dont_output_data && DECL_SIZE (decl) == 0)
1222 error_with_file_and_line (DECL_SOURCE_FILE (decl),
1223 DECL_SOURCE_LINE (decl),
1224 "storage size of `%s' isn't known",
1225 IDENTIFIER_POINTER (DECL_NAME (decl)));
1226 TREE_ASM_WRITTEN (decl) = 1;
1230 /* The first declaration of a variable that comes through this function
1231 decides whether it is global (in C, has external linkage)
1232 or local (in C, has internal linkage). So do nothing more
1233 if this function has already run. */
1235 if (TREE_ASM_WRITTEN (decl))
1238 TREE_ASM_WRITTEN (decl) = 1;
1242 if (! dont_output_data)
1246 if (TREE_CODE (DECL_SIZE (decl)) != INTEGER_CST)
1249 /* This is better than explicit arithmetic, since it avoids overflow. */
1250 size_tree = size_binop (CEIL_DIV_EXPR,
1251 DECL_SIZE (decl), size_int (BITS_PER_UNIT));
1253 size = TREE_INT_CST_LOW (size_tree);
1254 if (TREE_INT_CST_HIGH (size_tree) != 0
1255 || size != TREE_INT_CST_LOW (size_tree))
1257 error_with_decl (decl, "size of variable `%s' is too large");
1262 name = XSTR (XEXP (DECL_RTL (decl), 0), 0);
1264 if (TREE_PUBLIC (decl) && DECL_NAME (decl)
1265 && ! first_global_object_name
1266 && ! (DECL_COMMON (decl) && (DECL_INITIAL (decl) == 0
1267 || DECL_INITIAL (decl) == error_mark_node))
1268 && ! DECL_WEAK (decl)
1269 && ! DECL_ONE_ONLY (decl))
1273 STRIP_NAME_ENCODING (p, name);
1274 first_global_object_name = permalloc (strlen (p) + 1);
1275 strcpy (first_global_object_name, p);
1278 /* Compute the alignment of this data. */
1280 align = DECL_ALIGN (decl);
1282 /* In the case for initialing an array whose length isn't specified,
1283 where we have not yet been able to do the layout,
1284 figure out the proper alignment now. */
1285 if (dont_output_data && DECL_SIZE (decl) == 0
1286 && TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE)
1287 align = MAX (align, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl))));
1289 /* Some object file formats have a maximum alignment which they support.
1290 In particular, a.out format supports a maximum alignment of 4. */
1291 #ifndef MAX_OFILE_ALIGNMENT
1292 #define MAX_OFILE_ALIGNMENT BIGGEST_ALIGNMENT
1294 if (align > MAX_OFILE_ALIGNMENT)
1296 warning_with_decl (decl,
1297 "alignment of `%s' is greater than maximum object file alignment");
1298 align = MAX_OFILE_ALIGNMENT;
1301 /* On some machines, it is good to increase alignment sometimes. */
1302 #ifdef DATA_ALIGNMENT
1303 align = DATA_ALIGNMENT (TREE_TYPE (decl), align);
1305 #ifdef CONSTANT_ALIGNMENT
1306 if (DECL_INITIAL (decl) != 0 && DECL_INITIAL (decl) != error_mark_node)
1307 align = CONSTANT_ALIGNMENT (DECL_INITIAL (decl), align);
1310 /* Reset the alignment in case we have made it tighter, so we can benefit
1311 from it in get_pointer_alignment. */
1312 DECL_ALIGN (decl) = align;
1314 /* Handle uninitialized definitions. */
1316 if ((DECL_INITIAL (decl) == 0 || DECL_INITIAL (decl) == error_mark_node)
1317 /* If the target can't output uninitialized but not common global data
1318 in .bss, then we have to use .data. */
1319 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
1320 && DECL_COMMON (decl)
1322 && ! dont_output_data)
1324 int size = TREE_INT_CST_LOW (size_tree);
1327 /* Don't allocate zero bytes of common,
1328 since that means "undefined external" in the linker. */
1329 if (size == 0) rounded = 1;
1330 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1331 so that each uninitialized object starts on such a boundary. */
1332 rounded += (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1;
1333 rounded = (rounded / (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
1334 * (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
1336 #ifdef DBX_DEBUGGING_INFO
1337 /* File-scope global variables are output here. */
1338 if (write_symbols == DBX_DEBUG && top_level)
1339 dbxout_symbol (decl, 0);
1341 #ifdef SDB_DEBUGGING_INFO
1342 if (write_symbols == SDB_DEBUG && top_level
1343 /* Leave initialized global vars for end of compilation;
1344 see comment in compile_file. */
1345 && (TREE_PUBLIC (decl) == 0 || DECL_INITIAL (decl) == 0))
1346 sdbout_symbol (decl, 0);
1349 /* Don't output any DWARF debugging information for variables here.
1350 In the case of local variables, the information for them is output
1351 when we do our recursive traversal of the tree representation for
1352 the entire containing function. In the case of file-scope variables,
1353 we output information for all of them at the very end of compilation
1354 while we are doing our final traversal of the chain of file-scope
1357 #if 0 /* ??? We should either delete this or add a comment describing what
1358 it was intended to do and why we shouldn't delete it. */
1359 if (flag_shared_data)
1363 if (TREE_PUBLIC (decl)
1364 #if defined (ASM_OUTPUT_BSS) || defined (ASM_OUTPUT_ALIGNED_BSS)
1365 && DECL_COMMON (decl)
1369 #ifdef ASM_OUTPUT_SHARED_COMMON
1370 if (flag_shared_data)
1371 ASM_OUTPUT_SHARED_COMMON (asm_out_file, name, size, rounded);
1375 #ifdef ASM_OUTPUT_ALIGNED_DECL_COMMON
1376 ASM_OUTPUT_ALIGNED_DECL_COMMON (asm_out_file, decl, name, size,
1379 #ifdef ASM_OUTPUT_ALIGNED_COMMON
1380 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file, name, size,
1383 ASM_OUTPUT_COMMON (asm_out_file, name, size, rounded);
1388 #if defined (ASM_OUTPUT_BSS) || defined (ASM_OUTPUT_ALIGNED_BSS)
1389 else if (TREE_PUBLIC (decl))
1391 #ifdef ASM_OUTPUT_SHARED_BSS
1392 if (flag_shared_data)
1393 ASM_OUTPUT_SHARED_BSS (asm_out_file, decl, name, size, rounded);
1397 #ifdef ASM_OUTPUT_ALIGNED_BSS
1398 ASM_OUTPUT_ALIGNED_BSS (asm_out_file, decl, name, size,
1401 ASM_OUTPUT_BSS (asm_out_file, decl, name, size, rounded);
1405 #endif /* ASM_OUTPUT_BSS || ASM_OUTPUT_ALIGNED_BSS */
1408 #ifdef ASM_OUTPUT_SHARED_LOCAL
1409 if (flag_shared_data)
1410 ASM_OUTPUT_SHARED_LOCAL (asm_out_file, name, size, rounded);
1414 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
1415 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, decl, name, size,
1418 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1419 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size,
1422 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded);
1430 /* Handle initialized definitions.
1431 Also handle uninitialized global definitions if -fno-common and the
1432 target doesn't support ASM_OUTPUT_BSS. */
1434 /* First make the assembler name(s) global if appropriate. */
1435 if (TREE_PUBLIC (decl) && DECL_NAME (decl))
1437 #ifdef ASM_WEAKEN_LABEL
1438 if (DECL_WEAK (decl))
1439 ASM_WEAKEN_LABEL (asm_out_file, name);
1442 ASM_GLOBALIZE_LABEL (asm_out_file, name);
1445 for (d = equivalents; d; d = TREE_CHAIN (d))
1447 tree e = TREE_VALUE (d);
1448 if (TREE_PUBLIC (e) && DECL_NAME (e))
1449 ASM_GLOBALIZE_LABEL (asm_out_file,
1450 XSTR (XEXP (DECL_RTL (e), 0), 0));
1454 /* Output any data that we will need to use the address of. */
1455 if (DECL_INITIAL (decl) == error_mark_node)
1456 reloc = contains_pointers_p (TREE_TYPE (decl));
1457 else if (DECL_INITIAL (decl))
1458 reloc = output_addressed_constants (DECL_INITIAL (decl));
1460 #ifdef ASM_OUTPUT_SECTION_NAME
1461 if (UNIQUE_SECTION_P (decl))
1462 UNIQUE_SECTION (decl, reloc);
1465 /* Switch to the appropriate section. */
1466 variable_section (decl, reloc);
1468 /* dbxout.c needs to know this. */
1469 if (in_text_section ())
1470 DECL_IN_TEXT_SECTION (decl) = 1;
1472 /* Record current section so we can restore it if dbxout.c clobbers it. */
1473 saved_in_section = in_section;
1475 /* Output the dbx info now that we have chosen the section. */
1477 #ifdef DBX_DEBUGGING_INFO
1478 /* File-scope global variables are output here. */
1479 if (write_symbols == DBX_DEBUG && top_level)
1480 dbxout_symbol (decl, 0);
1482 #ifdef SDB_DEBUGGING_INFO
1483 if (write_symbols == SDB_DEBUG && top_level
1484 /* Leave initialized global vars for end of compilation;
1485 see comment in compile_file. */
1486 && (TREE_PUBLIC (decl) == 0 || DECL_INITIAL (decl) == 0))
1487 sdbout_symbol (decl, 0);
1490 /* Don't output any DWARF debugging information for variables here.
1491 In the case of local variables, the information for them is output
1492 when we do our recursive traversal of the tree representation for
1493 the entire containing function. In the case of file-scope variables,
1494 we output information for all of them at the very end of compilation
1495 while we are doing our final traversal of the chain of file-scope
1498 /* If the debugging output changed sections, reselect the section
1499 that's supposed to be selected. */
1500 if (in_section != saved_in_section)
1501 variable_section (decl, reloc);
1503 /* Output the alignment of this data. */
1504 if (align > BITS_PER_UNIT)
1505 ASM_OUTPUT_ALIGN (asm_out_file,
1506 floor_log2 (DECL_ALIGN (decl) / BITS_PER_UNIT));
1508 /* Do any machine/system dependent processing of the object. */
1509 #ifdef ASM_DECLARE_OBJECT_NAME
1510 last_assemble_variable_decl = decl;
1511 ASM_DECLARE_OBJECT_NAME (asm_out_file, name, decl);
1513 /* Standard thing is just output label for the object. */
1514 ASM_OUTPUT_LABEL (asm_out_file, name);
1515 #endif /* ASM_DECLARE_OBJECT_NAME */
1517 if (!dont_output_data)
1519 if (DECL_INITIAL (decl))
1520 /* Output the actual data. */
1521 output_constant (DECL_INITIAL (decl), TREE_INT_CST_LOW (size_tree));
1523 /* Leave space for it. */
1524 assemble_zeros (TREE_INT_CST_LOW (size_tree));
1528 #ifdef XCOFF_DEBUGGING_INFO
1529 /* Unfortunately, the IBM assembler cannot handle stabx before the actual
1530 declaration. When something like ".stabx "aa:S-2",aa,133,0" is emitted
1531 and `aa' hasn't been output yet, the assembler generates a stab entry with
1532 a value of zero, in addition to creating an unnecessary external entry
1533 for `aa'. Hence, we must postpone dbxout_symbol to here at the end. */
1535 /* File-scope global variables are output here. */
1536 if (write_symbols == XCOFF_DEBUG && top_level)
1538 saved_in_section = in_section;
1540 dbxout_symbol (decl, 0);
1542 if (in_section != saved_in_section)
1543 variable_section (decl, reloc);
1546 /* There must be a statement after a label. */
1551 /* Return 1 if type TYPE contains any pointers. */
1554 contains_pointers_p (type)
1557 switch (TREE_CODE (type))
1560 case REFERENCE_TYPE:
1561 /* I'm not sure whether OFFSET_TYPE needs this treatment,
1562 so I'll play safe and return 1. */
1568 case QUAL_UNION_TYPE:
1571 /* For a type that has fields, see if the fields have pointers. */
1572 for (fields = TYPE_FIELDS (type); fields; fields = TREE_CHAIN (fields))
1573 if (TREE_CODE (fields) == FIELD_DECL
1574 && contains_pointers_p (TREE_TYPE (fields)))
1580 /* An array type contains pointers if its element type does. */
1581 return contains_pointers_p (TREE_TYPE (type));
1588 /* Output something to declare an external symbol to the assembler.
1589 (Most assemblers don't need this, so we normally output nothing.)
1590 Do nothing if DECL is not external. */
1593 assemble_external (decl)
1596 #ifdef ASM_OUTPUT_EXTERNAL
1597 if (TREE_CODE_CLASS (TREE_CODE (decl)) == 'd'
1598 && DECL_EXTERNAL (decl) && TREE_PUBLIC (decl))
1600 rtx rtl = DECL_RTL (decl);
1602 if (GET_CODE (rtl) == MEM && GET_CODE (XEXP (rtl, 0)) == SYMBOL_REF
1603 && ! SYMBOL_REF_USED (XEXP (rtl, 0)))
1605 /* Some systems do require some output. */
1606 SYMBOL_REF_USED (XEXP (rtl, 0)) = 1;
1607 ASM_OUTPUT_EXTERNAL (asm_out_file, decl, XSTR (XEXP (rtl, 0), 0));
1613 /* Similar, for calling a library function FUN. */
1616 assemble_external_libcall (fun)
1619 #ifdef ASM_OUTPUT_EXTERNAL_LIBCALL
1620 /* Declare library function name external when first used, if nec. */
1621 if (! SYMBOL_REF_USED (fun))
1623 SYMBOL_REF_USED (fun) = 1;
1624 ASM_OUTPUT_EXTERNAL_LIBCALL (asm_out_file, fun);
1629 /* Declare the label NAME global. */
1632 assemble_global (name)
1635 ASM_GLOBALIZE_LABEL (asm_out_file, name);
1638 /* Assemble a label named NAME. */
1641 assemble_label (name)
1644 ASM_OUTPUT_LABEL (asm_out_file, name);
1647 /* Output to FILE a reference to the assembler name of a C-level name NAME.
1648 If NAME starts with a *, the rest of NAME is output verbatim.
1649 Otherwise NAME is transformed in an implementation-defined way
1650 (usually by the addition of an underscore).
1651 Many macros in the tm file are defined to call this function. */
1654 assemble_name (file, name)
1661 STRIP_NAME_ENCODING (real_name, name);
1662 if (flag_prefix_function_name
1663 && ! bcmp (real_name, CHKR_PREFIX, CHKR_PREFIX_SIZE))
1664 real_name = real_name + CHKR_PREFIX_SIZE;
1666 id = maybe_get_identifier (real_name);
1668 TREE_SYMBOL_REFERENCED (id) = 1;
1671 fputs (&name[1], file);
1673 ASM_OUTPUT_LABELREF (file, name);
1676 /* Allocate SIZE bytes writable static space with a gensym name
1677 and return an RTX to refer to its address. */
1680 assemble_static_space (size)
1686 #ifndef ASM_OUTPUT_ALIGNED_LOCAL
1687 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1688 so that each uninitialized object starts on such a boundary. */
1689 int rounded = ((size + (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1)
1690 / (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
1691 * (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
1695 if (flag_shared_data)
1699 ASM_GENERATE_INTERNAL_LABEL (name, "LF", const_labelno);
1702 namestring = (char *) obstack_alloc (saveable_obstack,
1704 strcpy (namestring, name);
1706 x = gen_rtx_SYMBOL_REF (Pmode, namestring);
1708 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
1709 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, NULL_TREE, name, size,
1712 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1713 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, BIGGEST_ALIGNMENT);
1715 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded);
1721 /* Assemble the static constant template for function entry trampolines.
1722 This is done at most once per compilation.
1723 Returns an RTX for the address of the template. */
1725 #ifdef TRAMPOLINE_TEMPLATE
1727 assemble_trampoline_template ()
1733 /* By default, put trampoline templates in read-only data section. */
1735 #ifdef TRAMPOLINE_SECTION
1736 TRAMPOLINE_SECTION ();
1738 readonly_data_section ();
1741 /* Write the assembler code to define one. */
1742 align = floor_log2 (TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT);
1744 ASM_OUTPUT_ALIGN (asm_out_file, align);
1746 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LTRAMP", 0);
1747 TRAMPOLINE_TEMPLATE (asm_out_file);
1749 /* Record the rtl to refer to it. */
1750 ASM_GENERATE_INTERNAL_LABEL (label, "LTRAMP", 0);
1752 = (char *) obstack_copy0 (&permanent_obstack, label, strlen (label));
1753 return gen_rtx_SYMBOL_REF (Pmode, name);
1757 /* Assemble the integer constant X into an object of SIZE bytes.
1758 X must be either a CONST_INT or CONST_DOUBLE.
1760 Return 1 if we were able to output the constant, otherwise 0. If FORCE is
1761 non-zero, abort if we can't output the constant. */
1764 assemble_integer (x, size, force)
1769 /* First try to use the standard 1, 2, 4, 8, and 16 byte
1770 ASM_OUTPUT... macros. */
1774 #ifdef ASM_OUTPUT_CHAR
1776 ASM_OUTPUT_CHAR (asm_out_file, x);
1780 #ifdef ASM_OUTPUT_SHORT
1782 ASM_OUTPUT_SHORT (asm_out_file, x);
1786 #ifdef ASM_OUTPUT_INT
1788 ASM_OUTPUT_INT (asm_out_file, x);
1792 #ifdef ASM_OUTPUT_DOUBLE_INT
1794 ASM_OUTPUT_DOUBLE_INT (asm_out_file, x);
1798 #ifdef ASM_OUTPUT_QUADRUPLE_INT
1800 ASM_OUTPUT_QUADRUPLE_INT (asm_out_file, x);
1805 /* If we couldn't do it that way, there are two other possibilities: First,
1806 if the machine can output an explicit byte and this is a 1 byte constant,
1807 we can use ASM_OUTPUT_BYTE. */
1809 #ifdef ASM_OUTPUT_BYTE
1810 if (size == 1 && GET_CODE (x) == CONST_INT)
1812 ASM_OUTPUT_BYTE (asm_out_file, INTVAL (x));
1817 /* Finally, if SIZE is larger than a single word, try to output the constant
1818 one word at a time. */
1820 if (size > UNITS_PER_WORD)
1823 enum machine_mode mode
1824 = mode_for_size (size * BITS_PER_UNIT, MODE_INT, 0);
1827 for (i = 0; i < size / UNITS_PER_WORD; i++)
1829 word = operand_subword (x, i, 0, mode);
1834 if (! assemble_integer (word, UNITS_PER_WORD, 0))
1838 if (i == size / UNITS_PER_WORD)
1840 /* If we output at least one word and then could not finish,
1841 there is no valid way to continue. */
1852 /* Assemble the floating-point constant D into an object of size MODE. */
1855 assemble_real (d, mode)
1857 enum machine_mode mode;
1859 jmp_buf output_constant_handler;
1861 if (setjmp (output_constant_handler))
1863 error ("floating point trap outputting a constant");
1864 #ifdef REAL_IS_NOT_DOUBLE
1865 bzero ((char *) &d, sizeof d);
1872 set_float_handler (output_constant_handler);
1876 #ifdef ASM_OUTPUT_BYTE_FLOAT
1878 ASM_OUTPUT_BYTE_FLOAT (asm_out_file, d);
1881 #ifdef ASM_OUTPUT_SHORT_FLOAT
1883 ASM_OUTPUT_SHORT_FLOAT (asm_out_file, d);
1886 #ifdef ASM_OUTPUT_THREE_QUARTER_FLOAT
1888 ASM_OUTPUT_THREE_QUARTER_FLOAT (asm_out_file, d);
1891 #ifdef ASM_OUTPUT_FLOAT
1893 ASM_OUTPUT_FLOAT (asm_out_file, d);
1897 #ifdef ASM_OUTPUT_DOUBLE
1899 ASM_OUTPUT_DOUBLE (asm_out_file, d);
1903 #ifdef ASM_OUTPUT_LONG_DOUBLE
1906 ASM_OUTPUT_LONG_DOUBLE (asm_out_file, d);
1914 set_float_handler (NULL_PTR);
1917 /* Here we combine duplicate floating constants to make
1918 CONST_DOUBLE rtx's, and force those out to memory when necessary. */
1920 /* Chain of all CONST_DOUBLE rtx's constructed for the current function.
1921 They are chained through the CONST_DOUBLE_CHAIN.
1922 A CONST_DOUBLE rtx has CONST_DOUBLE_MEM != cc0_rtx iff it is on this chain.
1923 In that case, CONST_DOUBLE_MEM is either a MEM,
1924 or const0_rtx if no MEM has been made for this CONST_DOUBLE yet.
1926 (CONST_DOUBLE_MEM is used only for top-level functions.
1927 See force_const_mem for explanation.) */
1929 static rtx const_double_chain;
1931 /* Return a CONST_DOUBLE or CONST_INT for a value specified as a pair of ints.
1932 For an integer, I0 is the low-order word and I1 is the high-order word.
1933 For a real number, I0 is the word with the low address
1934 and I1 is the word with the high address. */
1937 immed_double_const (i0, i1, mode)
1938 HOST_WIDE_INT i0, i1;
1939 enum machine_mode mode;
1943 if (GET_MODE_CLASS (mode) == MODE_INT
1944 || GET_MODE_CLASS (mode) == MODE_PARTIAL_INT)
1946 /* We clear out all bits that don't belong in MODE, unless they and our
1947 sign bit are all one. So we get either a reasonable negative value
1948 or a reasonable unsigned value for this mode. */
1949 int width = GET_MODE_BITSIZE (mode);
1950 if (width < HOST_BITS_PER_WIDE_INT
1951 && ((i0 & ((HOST_WIDE_INT) (-1) << (width - 1)))
1952 != ((HOST_WIDE_INT) (-1) << (width - 1))))
1953 i0 &= ((HOST_WIDE_INT) 1 << width) - 1, i1 = 0;
1954 else if (width == HOST_BITS_PER_WIDE_INT
1955 && ! (i1 == ~0 && i0 < 0))
1957 else if (width > 2 * HOST_BITS_PER_WIDE_INT)
1958 /* We cannot represent this value as a constant. */
1961 /* If this would be an entire word for the target, but is not for
1962 the host, then sign-extend on the host so that the number will look
1963 the same way on the host that it would on the target.
1965 For example, when building a 64 bit alpha hosted 32 bit sparc
1966 targeted compiler, then we want the 32 bit unsigned value -1 to be
1967 represented as a 64 bit value -1, and not as 0x00000000ffffffff.
1968 The later confuses the sparc backend. */
1970 if (BITS_PER_WORD < HOST_BITS_PER_WIDE_INT && BITS_PER_WORD == width
1971 && (i0 & ((HOST_WIDE_INT) 1 << (width - 1))))
1972 i0 |= ((HOST_WIDE_INT) (-1) << width);
1974 /* If MODE fits within HOST_BITS_PER_WIDE_INT, always use a CONST_INT.
1976 ??? Strictly speaking, this is wrong if we create a CONST_INT
1977 for a large unsigned constant with the size of MODE being
1978 HOST_BITS_PER_WIDE_INT and later try to interpret that constant in a
1979 wider mode. In that case we will mis-interpret it as a negative
1982 Unfortunately, the only alternative is to make a CONST_DOUBLE
1983 for any constant in any mode if it is an unsigned constant larger
1984 than the maximum signed integer in an int on the host. However,
1985 doing this will break everyone that always expects to see a CONST_INT
1986 for SImode and smaller.
1988 We have always been making CONST_INTs in this case, so nothing new
1991 if (width <= HOST_BITS_PER_WIDE_INT)
1992 i1 = (i0 < 0) ? ~(HOST_WIDE_INT) 0 : 0;
1994 /* If this integer fits in one word, return a CONST_INT. */
1995 if ((i1 == 0 && i0 >= 0)
1996 || (i1 == ~0 && i0 < 0))
1997 return GEN_INT (i0);
1999 /* We use VOIDmode for integers. */
2003 /* Search the chain for an existing CONST_DOUBLE with the right value.
2004 If one is found, return it. */
2006 for (r = const_double_chain; r; r = CONST_DOUBLE_CHAIN (r))
2007 if (CONST_DOUBLE_LOW (r) == i0 && CONST_DOUBLE_HIGH (r) == i1
2008 && GET_MODE (r) == mode)
2011 /* No; make a new one and add it to the chain.
2013 We may be called by an optimizer which may be discarding any memory
2014 allocated during its processing (such as combine and loop). However,
2015 we will be leaving this constant on the chain, so we cannot tolerate
2016 freed memory. So switch to saveable_obstack for this allocation
2017 and then switch back if we were in current_obstack. */
2019 push_obstacks_nochange ();
2020 rtl_in_saveable_obstack ();
2021 r = gen_rtx_CONST_DOUBLE (mode, NULL_RTX, i0, i1);
2024 /* Don't touch const_double_chain in nested function; see force_const_mem.
2025 Also, don't touch it if not inside any function. */
2026 if (outer_function_chain == 0 && current_function_decl != 0)
2028 CONST_DOUBLE_CHAIN (r) = const_double_chain;
2029 const_double_chain = r;
2032 /* Store const0_rtx in mem-slot since this CONST_DOUBLE is on the chain.
2033 Actual use of mem-slot is only through force_const_mem. */
2035 CONST_DOUBLE_MEM (r) = const0_rtx;
2040 /* Return a CONST_DOUBLE for a specified `double' value
2041 and machine mode. */
2044 immed_real_const_1 (d, mode)
2046 enum machine_mode mode;
2048 union real_extract u;
2051 /* Get the desired `double' value as a sequence of ints
2052 since that is how they are stored in a CONST_DOUBLE. */
2056 /* Detect special cases. */
2058 if (REAL_VALUES_IDENTICAL (dconst0, d))
2059 return CONST0_RTX (mode);
2060 /* Check for NaN first, because some ports (specifically the i386) do not
2061 emit correct ieee-fp code by default, and thus will generate a core
2062 dump here if we pass a NaN to REAL_VALUES_EQUAL and if REAL_VALUES_EQUAL
2063 does a floating point comparison. */
2064 else if (! REAL_VALUE_ISNAN (d) && REAL_VALUES_EQUAL (dconst1, d))
2065 return CONST1_RTX (mode);
2067 if (sizeof u == 2 * sizeof (HOST_WIDE_INT))
2068 return immed_double_const (u.i[0], u.i[1], mode);
2070 /* The rest of this function handles the case where
2071 a float value requires more than 2 ints of space.
2072 It will be deleted as dead code on machines that don't need it. */
2074 /* Search the chain for an existing CONST_DOUBLE with the right value.
2075 If one is found, return it. */
2077 for (r = const_double_chain; r; r = CONST_DOUBLE_CHAIN (r))
2078 if (! bcmp ((char *) &CONST_DOUBLE_LOW (r), (char *) &u, sizeof u)
2079 && GET_MODE (r) == mode)
2082 /* No; make a new one and add it to the chain.
2084 We may be called by an optimizer which may be discarding any memory
2085 allocated during its processing (such as combine and loop). However,
2086 we will be leaving this constant on the chain, so we cannot tolerate
2087 freed memory. So switch to saveable_obstack for this allocation
2088 and then switch back if we were in current_obstack. */
2090 push_obstacks_nochange ();
2091 rtl_in_saveable_obstack ();
2092 r = rtx_alloc (CONST_DOUBLE);
2094 bcopy ((char *) &u, (char *) &CONST_DOUBLE_LOW (r), sizeof u);
2097 /* Don't touch const_double_chain in nested function; see force_const_mem.
2098 Also, don't touch it if not inside any function. */
2099 if (outer_function_chain == 0 && current_function_decl != 0)
2101 CONST_DOUBLE_CHAIN (r) = const_double_chain;
2102 const_double_chain = r;
2105 /* Store const0_rtx in CONST_DOUBLE_MEM since this CONST_DOUBLE is on the
2106 chain, but has not been allocated memory. Actual use of CONST_DOUBLE_MEM
2107 is only through force_const_mem. */
2109 CONST_DOUBLE_MEM (r) = const0_rtx;
2114 /* Return a CONST_DOUBLE rtx for a value specified by EXP,
2115 which must be a REAL_CST tree node. */
2118 immed_real_const (exp)
2121 return immed_real_const_1 (TREE_REAL_CST (exp), TYPE_MODE (TREE_TYPE (exp)));
2124 /* At the end of a function, forget the memory-constants
2125 previously made for CONST_DOUBLEs. Mark them as not on real_constant_chain.
2126 Also clear out real_constant_chain and clear out all the chain-pointers. */
2129 clear_const_double_mem ()
2131 register rtx r, next;
2133 /* Don't touch CONST_DOUBLE_MEM for nested functions.
2134 See force_const_mem for explanation. */
2135 if (outer_function_chain != 0)
2138 for (r = const_double_chain; r; r = next)
2140 next = CONST_DOUBLE_CHAIN (r);
2141 CONST_DOUBLE_CHAIN (r) = 0;
2142 CONST_DOUBLE_MEM (r) = cc0_rtx;
2144 const_double_chain = 0;
2147 /* Given an expression EXP with a constant value,
2148 reduce it to the sum of an assembler symbol and an integer.
2149 Store them both in the structure *VALUE.
2150 Abort if EXP does not reduce. */
2155 HOST_WIDE_INT offset;
2159 decode_addr_const (exp, value)
2161 struct addr_const *value;
2163 register tree target = TREE_OPERAND (exp, 0);
2164 register int offset = 0;
2169 if (TREE_CODE (target) == COMPONENT_REF
2170 && (TREE_CODE (DECL_FIELD_BITPOS (TREE_OPERAND (target, 1)))
2173 offset += TREE_INT_CST_LOW (DECL_FIELD_BITPOS (TREE_OPERAND (target, 1))) / BITS_PER_UNIT;
2174 target = TREE_OPERAND (target, 0);
2176 else if (TREE_CODE (target) == ARRAY_REF)
2178 if (TREE_CODE (TREE_OPERAND (target, 1)) != INTEGER_CST
2179 || TREE_CODE (TYPE_SIZE (TREE_TYPE (target))) != INTEGER_CST)
2181 offset += ((TREE_INT_CST_LOW (TYPE_SIZE (TREE_TYPE (target)))
2182 * TREE_INT_CST_LOW (TREE_OPERAND (target, 1)))
2184 target = TREE_OPERAND (target, 0);
2190 switch (TREE_CODE (target))
2194 x = DECL_RTL (target);
2198 x = gen_rtx_MEM (FUNCTION_MODE,
2199 gen_rtx_LABEL_REF (VOIDmode,
2200 label_rtx (TREE_OPERAND (exp, 0))));
2208 x = TREE_CST_RTL (target);
2215 if (GET_CODE (x) != MEM)
2220 value->offset = offset;
2223 /* Uniquize all constants that appear in memory.
2224 Each constant in memory thus far output is recorded
2225 in `const_hash_table' with a `struct constant_descriptor'
2226 that contains a polish representation of the value of
2229 We cannot store the trees in the hash table
2230 because the trees may be temporary. */
2232 struct constant_descriptor
2234 struct constant_descriptor *next;
2240 #define MAX_HASH_TABLE 1009
2241 static struct constant_descriptor *const_hash_table[MAX_HASH_TABLE];
2243 /* Compute a hash code for a constant expression. */
2250 register int len, hi, i;
2251 register enum tree_code code = TREE_CODE (exp);
2253 /* Either set P and LEN to the address and len of something to hash and
2254 exit the switch or return a value. */
2259 p = (char *) &TREE_INT_CST_LOW (exp);
2260 len = 2 * sizeof TREE_INT_CST_LOW (exp);
2264 p = (char *) &TREE_REAL_CST (exp);
2265 len = sizeof TREE_REAL_CST (exp);
2269 p = TREE_STRING_POINTER (exp);
2270 len = TREE_STRING_LENGTH (exp);
2274 return (const_hash (TREE_REALPART (exp)) * 5
2275 + const_hash (TREE_IMAGPART (exp)));
2278 if (TREE_CODE (TREE_TYPE (exp)) == SET_TYPE)
2280 len = int_size_in_bytes (TREE_TYPE (exp));
2281 p = (char *) alloca (len);
2282 get_set_constructor_bytes (exp, (unsigned char *) p, len);
2289 /* For record type, include the type in the hashing.
2290 We do not do so for array types
2291 because (1) the sizes of the elements are sufficient
2292 and (2) distinct array types can have the same constructor.
2293 Instead, we include the array size because the constructor could
2295 if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE)
2296 hi = ((unsigned long) TREE_TYPE (exp) & ((1 << HASHBITS) - 1))
2299 hi = ((5 + int_size_in_bytes (TREE_TYPE (exp)))
2300 & ((1 << HASHBITS) - 1)) % MAX_HASH_TABLE;
2302 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
2303 if (TREE_VALUE (link))
2305 = (hi * 603 + const_hash (TREE_VALUE (link))) % MAX_HASH_TABLE;
2312 struct addr_const value;
2314 decode_addr_const (exp, &value);
2315 if (GET_CODE (value.base) == SYMBOL_REF)
2317 /* Don't hash the address of the SYMBOL_REF;
2318 only use the offset and the symbol name. */
2320 p = XSTR (value.base, 0);
2321 for (i = 0; p[i] != 0; i++)
2322 hi = ((hi * 613) + (unsigned) (p[i]));
2324 else if (GET_CODE (value.base) == LABEL_REF)
2325 hi = value.offset + CODE_LABEL_NUMBER (XEXP (value.base, 0)) * 13;
2327 hi &= (1 << HASHBITS) - 1;
2328 hi %= MAX_HASH_TABLE;
2334 return (const_hash (TREE_OPERAND (exp, 0)) * 9
2335 + const_hash (TREE_OPERAND (exp, 1)));
2339 case NON_LVALUE_EXPR:
2340 return const_hash (TREE_OPERAND (exp, 0)) * 7 + 2;
2346 /* Compute hashing function */
2348 for (i = 0; i < len; i++)
2349 hi = ((hi * 613) + (unsigned) (p[i]));
2351 hi &= (1 << HASHBITS) - 1;
2352 hi %= MAX_HASH_TABLE;
2356 /* Compare a constant expression EXP with a constant-descriptor DESC.
2357 Return 1 if DESC describes a constant with the same value as EXP. */
2360 compare_constant (exp, desc)
2362 struct constant_descriptor *desc;
2364 return 0 != compare_constant_1 (exp, desc->contents);
2367 /* Compare constant expression EXP with a substring P of a constant descriptor.
2368 If they match, return a pointer to the end of the substring matched.
2369 If they do not match, return 0.
2371 Since descriptors are written in polish prefix notation,
2372 this function can be used recursively to test one operand of EXP
2373 against a subdescriptor, and if it succeeds it returns the
2374 address of the subdescriptor for the next operand. */
2377 compare_constant_1 (exp, p)
2381 register char *strp;
2383 register enum tree_code code = TREE_CODE (exp);
2385 if (code != (enum tree_code) *p++)
2388 /* Either set STRP, P and LEN to pointers and length to compare and exit the
2389 switch, or return the result of the comparison. */
2394 /* Integer constants are the same only if the same width of type. */
2395 if (*p++ != TYPE_PRECISION (TREE_TYPE (exp)))
2398 strp = (char *) &TREE_INT_CST_LOW (exp);
2399 len = 2 * sizeof TREE_INT_CST_LOW (exp);
2403 /* Real constants are the same only if the same width of type. */
2404 if (*p++ != TYPE_PRECISION (TREE_TYPE (exp)))
2407 strp = (char *) &TREE_REAL_CST (exp);
2408 len = sizeof TREE_REAL_CST (exp);
2412 if (flag_writable_strings)
2415 if (*p++ != TYPE_MODE (TREE_TYPE (exp)))
2418 strp = TREE_STRING_POINTER (exp);
2419 len = TREE_STRING_LENGTH (exp);
2420 if (bcmp ((char *) &TREE_STRING_LENGTH (exp), p,
2421 sizeof TREE_STRING_LENGTH (exp)))
2424 p += sizeof TREE_STRING_LENGTH (exp);
2428 p = compare_constant_1 (TREE_REALPART (exp), p);
2432 return compare_constant_1 (TREE_IMAGPART (exp), p);
2435 if (TREE_CODE (TREE_TYPE (exp)) == SET_TYPE)
2437 int xlen = len = int_size_in_bytes (TREE_TYPE (exp));
2439 strp = (char *) alloca (len);
2440 get_set_constructor_bytes (exp, (unsigned char *) strp, len);
2441 if (bcmp ((char *) &xlen, p, sizeof xlen))
2450 int length = list_length (CONSTRUCTOR_ELTS (exp));
2452 int have_purpose = 0;
2454 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
2455 if (TREE_PURPOSE (link))
2458 if (bcmp ((char *) &length, p, sizeof length))
2463 /* For record constructors, insist that the types match.
2464 For arrays, just verify both constructors are for arrays.
2465 Then insist that either both or none have any TREE_PURPOSE
2467 if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE)
2468 type = TREE_TYPE (exp);
2472 if (bcmp ((char *) &type, p, sizeof type))
2477 if (bcmp ((char *) &have_purpose, p, sizeof have_purpose))
2480 p += sizeof have_purpose;
2482 /* For arrays, insist that the size in bytes match. */
2483 if (TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE)
2485 HOST_WIDE_INT size = int_size_in_bytes (TREE_TYPE (exp));
2487 if (bcmp ((char *) &size, p, sizeof size))
2493 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
2495 if (TREE_VALUE (link))
2497 if ((p = compare_constant_1 (TREE_VALUE (link), p)) == 0)
2504 if (bcmp ((char *) &zero, p, sizeof zero))
2510 if (TREE_PURPOSE (link)
2511 && TREE_CODE (TREE_PURPOSE (link)) == FIELD_DECL)
2513 if (bcmp ((char *) &TREE_PURPOSE (link), p,
2514 sizeof TREE_PURPOSE (link)))
2517 p += sizeof TREE_PURPOSE (link);
2519 else if (TREE_PURPOSE (link))
2521 if ((p = compare_constant_1 (TREE_PURPOSE (link), p)) == 0)
2524 else if (have_purpose)
2528 if (bcmp ((char *) &zero, p, sizeof zero))
2540 struct addr_const value;
2542 decode_addr_const (exp, &value);
2543 strp = (char *) &value.offset;
2544 len = sizeof value.offset;
2545 /* Compare the offset. */
2547 if (*p++ != *strp++)
2550 /* Compare symbol name. */
2551 strp = XSTR (value.base, 0);
2552 len = strlen (strp) + 1;
2558 p = compare_constant_1 (TREE_OPERAND (exp, 0), p);
2562 return compare_constant_1 (TREE_OPERAND (exp, 1), p);
2566 case NON_LVALUE_EXPR:
2567 return compare_constant_1 (TREE_OPERAND (exp, 0), p);
2573 /* Compare constant contents. */
2575 if (*p++ != *strp++)
2581 /* Construct a constant descriptor for the expression EXP.
2582 It is up to the caller to enter the descriptor in the hash table. */
2584 static struct constant_descriptor *
2585 record_constant (exp)
2588 struct constant_descriptor *next = 0;
2591 /* Make a struct constant_descriptor. The first two pointers will
2592 be filled in later. Here we just leave space for them. */
2594 obstack_grow (&permanent_obstack, (char *) &next, sizeof next);
2595 obstack_grow (&permanent_obstack, (char *) &label, sizeof label);
2596 record_constant_1 (exp);
2597 return (struct constant_descriptor *) obstack_finish (&permanent_obstack);
2600 /* Add a description of constant expression EXP
2601 to the object growing in `permanent_obstack'.
2602 No need to return its address; the caller will get that
2603 from the obstack when the object is complete. */
2606 record_constant_1 (exp)
2609 register char *strp;
2611 register enum tree_code code = TREE_CODE (exp);
2613 obstack_1grow (&permanent_obstack, (unsigned int) code);
2618 obstack_1grow (&permanent_obstack, TYPE_PRECISION (TREE_TYPE (exp)));
2619 strp = (char *) &TREE_INT_CST_LOW (exp);
2620 len = 2 * sizeof TREE_INT_CST_LOW (exp);
2624 obstack_1grow (&permanent_obstack, TYPE_PRECISION (TREE_TYPE (exp)));
2625 strp = (char *) &TREE_REAL_CST (exp);
2626 len = sizeof TREE_REAL_CST (exp);
2630 if (flag_writable_strings)
2633 obstack_1grow (&permanent_obstack, TYPE_MODE (TREE_TYPE (exp)));
2634 strp = TREE_STRING_POINTER (exp);
2635 len = TREE_STRING_LENGTH (exp);
2636 obstack_grow (&permanent_obstack, (char *) &TREE_STRING_LENGTH (exp),
2637 sizeof TREE_STRING_LENGTH (exp));
2641 record_constant_1 (TREE_REALPART (exp));
2642 record_constant_1 (TREE_IMAGPART (exp));
2646 if (TREE_CODE (TREE_TYPE (exp)) == SET_TYPE)
2648 int nbytes = int_size_in_bytes (TREE_TYPE (exp));
2649 obstack_grow (&permanent_obstack, &nbytes, sizeof (nbytes));
2650 obstack_blank (&permanent_obstack, nbytes);
2651 get_set_constructor_bytes
2652 (exp, (unsigned char *) permanent_obstack.next_free-nbytes,
2659 int length = list_length (CONSTRUCTOR_ELTS (exp));
2661 int have_purpose = 0;
2663 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
2664 if (TREE_PURPOSE (link))
2667 obstack_grow (&permanent_obstack, (char *) &length, sizeof length);
2669 /* For record constructors, insist that the types match.
2670 For arrays, just verify both constructors are for arrays.
2671 Then insist that either both or none have any TREE_PURPOSE
2673 if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE)
2674 type = TREE_TYPE (exp);
2677 obstack_grow (&permanent_obstack, (char *) &type, sizeof type);
2678 obstack_grow (&permanent_obstack, (char *) &have_purpose,
2679 sizeof have_purpose);
2681 /* For arrays, insist that the size in bytes match. */
2682 if (TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE)
2684 HOST_WIDE_INT size = int_size_in_bytes (TREE_TYPE (exp));
2685 obstack_grow (&permanent_obstack, (char *) &size, sizeof size);
2688 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
2690 if (TREE_VALUE (link))
2691 record_constant_1 (TREE_VALUE (link));
2696 obstack_grow (&permanent_obstack,
2697 (char *) &zero, sizeof zero);
2700 if (TREE_PURPOSE (link)
2701 && TREE_CODE (TREE_PURPOSE (link)) == FIELD_DECL)
2702 obstack_grow (&permanent_obstack,
2703 (char *) &TREE_PURPOSE (link),
2704 sizeof TREE_PURPOSE (link));
2705 else if (TREE_PURPOSE (link))
2706 record_constant_1 (TREE_PURPOSE (link));
2707 else if (have_purpose)
2711 obstack_grow (&permanent_obstack,
2712 (char *) &zero, sizeof zero);
2720 struct addr_const value;
2722 decode_addr_const (exp, &value);
2723 /* Record the offset. */
2724 obstack_grow (&permanent_obstack,
2725 (char *) &value.offset, sizeof value.offset);
2726 /* Record the symbol name. */
2727 obstack_grow (&permanent_obstack, XSTR (value.base, 0),
2728 strlen (XSTR (value.base, 0)) + 1);
2734 record_constant_1 (TREE_OPERAND (exp, 0));
2735 record_constant_1 (TREE_OPERAND (exp, 1));
2740 case NON_LVALUE_EXPR:
2741 record_constant_1 (TREE_OPERAND (exp, 0));
2748 /* Record constant contents. */
2749 obstack_grow (&permanent_obstack, strp, len);
2752 /* Record a list of constant expressions that were passed to
2753 output_constant_def but that could not be output right away. */
2755 struct deferred_constant
2757 struct deferred_constant *next;
2763 static struct deferred_constant *deferred_constants;
2765 /* Another list of constants which should be output after the
2767 static struct deferred_constant *after_function_constants;
2769 /* Nonzero means defer output of addressed subconstants
2770 (i.e., those for which output_constant_def is called.) */
2771 static int defer_addressed_constants_flag;
2773 /* Start deferring output of subconstants. */
2776 defer_addressed_constants ()
2778 defer_addressed_constants_flag++;
2781 /* Stop deferring output of subconstants,
2782 and output now all those that have been deferred. */
2785 output_deferred_addressed_constants ()
2787 struct deferred_constant *p, *next;
2789 defer_addressed_constants_flag--;
2791 if (defer_addressed_constants_flag > 0)
2794 for (p = deferred_constants; p; p = next)
2796 output_constant_def_contents (p->exp, p->reloc, p->labelno);
2801 deferred_constants = 0;
2804 /* Output any constants which should appear after a function. */
2807 output_after_function_constants ()
2809 struct deferred_constant *p, *next;
2811 for (p = after_function_constants; p; p = next)
2813 output_constant_def_contents (p->exp, p->reloc, p->labelno);
2818 after_function_constants = 0;
2821 /* Make a copy of the whole tree structure for a constant.
2822 This handles the same types of nodes that compare_constant
2823 and record_constant handle. */
2829 switch (TREE_CODE (exp))
2832 /* For ADDR_EXPR, we do not want to copy the decl whose address
2833 is requested. We do want to copy constants though. */
2834 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, 0))) == 'c')
2835 return build1 (TREE_CODE (exp), TREE_TYPE (exp),
2836 copy_constant (TREE_OPERAND (exp, 0)));
2838 return copy_node (exp);
2843 return copy_node (exp);
2846 return build_complex (TREE_TYPE (exp),
2847 copy_constant (TREE_REALPART (exp)),
2848 copy_constant (TREE_IMAGPART (exp)));
2852 return build (TREE_CODE (exp), TREE_TYPE (exp),
2853 copy_constant (TREE_OPERAND (exp, 0)),
2854 copy_constant (TREE_OPERAND (exp, 1)));
2858 case NON_LVALUE_EXPR:
2859 return build1 (TREE_CODE (exp), TREE_TYPE (exp),
2860 copy_constant (TREE_OPERAND (exp, 0)));
2864 tree copy = copy_node (exp);
2865 tree list = copy_list (CONSTRUCTOR_ELTS (exp));
2868 CONSTRUCTOR_ELTS (copy) = list;
2869 for (tail = list; tail; tail = TREE_CHAIN (tail))
2870 TREE_VALUE (tail) = copy_constant (TREE_VALUE (tail));
2871 if (TREE_CODE (TREE_TYPE (exp)) == SET_TYPE)
2872 for (tail = list; tail; tail = TREE_CHAIN (tail))
2873 TREE_PURPOSE (tail) = copy_constant (TREE_PURPOSE (tail));
2883 /* Return an rtx representing a reference to constant data in memory
2884 for the constant expression EXP.
2886 If assembler code for such a constant has already been output,
2887 return an rtx to refer to it.
2888 Otherwise, output such a constant in memory (or defer it for later)
2889 and generate an rtx for it.
2891 The TREE_CST_RTL of EXP is set up to point to that rtx.
2892 The const_hash_table records which constants already have label strings. */
2895 output_constant_def (exp)
2899 register struct constant_descriptor *desc;
2905 if (TREE_CST_RTL (exp))
2906 return TREE_CST_RTL (exp);
2908 /* Make sure any other constants whose addresses appear in EXP
2909 are assigned label numbers. */
2911 reloc = output_addressed_constants (exp);
2913 /* Compute hash code of EXP. Search the descriptors for that hash code
2914 to see if any of them describes EXP. If yes, the descriptor records
2915 the label number already assigned. */
2917 hash = const_hash (exp) % MAX_HASH_TABLE;
2919 for (desc = const_hash_table[hash]; desc; desc = desc->next)
2920 if (compare_constant (exp, desc))
2922 found = desc->label;
2928 /* No constant equal to EXP is known to have been output.
2929 Make a constant descriptor to enter EXP in the hash table.
2930 Assign the label number and record it in the descriptor for
2931 future calls to this function to find. */
2933 /* Create a string containing the label name, in LABEL. */
2934 ASM_GENERATE_INTERNAL_LABEL (label, "LC", const_labelno);
2936 desc = record_constant (exp);
2937 desc->next = const_hash_table[hash];
2939 = (char *) obstack_copy0 (&permanent_obstack, label, strlen (label));
2940 const_hash_table[hash] = desc;
2944 /* Create a string containing the label name, in LABEL. */
2945 ASM_GENERATE_INTERNAL_LABEL (label, "LC", const_labelno);
2948 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
2950 push_obstacks_nochange ();
2951 if (TREE_PERMANENT (exp))
2952 end_temporary_allocation ();
2954 def = gen_rtx_SYMBOL_REF (Pmode, desc->label);
2957 = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp)), def);
2958 RTX_UNCHANGING_P (TREE_CST_RTL (exp)) = 1;
2959 if (AGGREGATE_TYPE_P (TREE_TYPE (exp)))
2960 MEM_IN_STRUCT_P (TREE_CST_RTL (exp)) = 1;
2964 /* Optionally set flags or add text to the name to record information
2965 such as that it is a function name. If the name is changed, the macro
2966 ASM_OUTPUT_LABELREF will have to know how to strip this information. */
2967 #ifdef ENCODE_SECTION_INFO
2968 ENCODE_SECTION_INFO (exp);
2971 /* If this is the first time we've seen this particular constant,
2972 output it (or defer its output for later). */
2975 int after_function = 0;
2977 #ifdef CONSTANT_AFTER_FUNCTION_P
2978 if (current_function_decl != 0
2979 && CONSTANT_AFTER_FUNCTION_P (exp))
2983 if (defer_addressed_constants_flag || after_function)
2985 struct deferred_constant *p;
2986 p = (struct deferred_constant *) xmalloc (sizeof (struct deferred_constant));
2988 push_obstacks_nochange ();
2989 suspend_momentary ();
2990 p->exp = copy_constant (exp);
2993 p->labelno = const_labelno++;
2996 p->next = after_function_constants;
2997 after_function_constants = p;
3001 p->next = deferred_constants;
3002 deferred_constants = p;
3006 output_constant_def_contents (exp, reloc, const_labelno++);
3009 return TREE_CST_RTL (exp);
3012 /* Now output assembler code to define the label for EXP,
3013 and follow it with the data of EXP. */
3016 output_constant_def_contents (exp, reloc, labelno)
3023 if (IN_NAMED_SECTION (exp))
3024 named_section (exp, NULL, reloc);
3027 /* First switch to text section, except for writable strings. */
3028 #ifdef SELECT_SECTION
3029 SELECT_SECTION (exp, reloc);
3031 if (((TREE_CODE (exp) == STRING_CST) && flag_writable_strings)
3032 || (flag_pic && reloc))
3035 readonly_data_section ();
3039 /* Align the location counter as required by EXP's data type. */
3040 align = TYPE_ALIGN (TREE_TYPE (exp));
3041 #ifdef CONSTANT_ALIGNMENT
3042 align = CONSTANT_ALIGNMENT (exp, align);
3045 if (align > BITS_PER_UNIT)
3046 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
3048 /* Output the label itself. */
3049 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LC", labelno);
3051 /* Output the value of EXP. */
3052 output_constant (exp,
3053 (TREE_CODE (exp) == STRING_CST
3054 ? TREE_STRING_LENGTH (exp)
3055 : int_size_in_bytes (TREE_TYPE (exp))));
3059 /* Similar hash facility for making memory-constants
3060 from constant rtl-expressions. It is used on RISC machines
3061 where immediate integer arguments and constant addresses are restricted
3062 so that such constants must be stored in memory.
3064 This pool of constants is reinitialized for each function
3065 so each function gets its own constants-pool that comes right before it.
3067 All structures allocated here are discarded when functions are saved for
3068 inlining, so they do not need to be allocated permanently. */
3070 #define MAX_RTX_HASH_TABLE 61
3071 static struct constant_descriptor **const_rtx_hash_table;
3073 /* Structure to represent sufficient information about a constant so that
3074 it can be output when the constant pool is output, so that function
3075 integration can be done, and to simplify handling on machines that reference
3076 constant pool as base+displacement. */
3078 struct pool_constant
3080 struct constant_descriptor *desc;
3081 struct pool_constant *next;
3082 enum machine_mode mode;
3090 /* Pointers to first and last constant in pool. */
3092 static struct pool_constant *first_pool, *last_pool;
3094 /* Current offset in constant pool (does not include any machine-specific
3097 static int pool_offset;
3099 /* Structure used to maintain hash table mapping symbols used to their
3100 corresponding constants. */
3105 struct pool_constant *pool;
3106 struct pool_sym *next;
3109 static struct pool_sym **const_rtx_sym_hash_table;
3111 /* Hash code for a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true.
3112 The argument is XSTR (... , 0) */
3114 #define SYMHASH(LABEL) \
3115 ((((unsigned long) (LABEL)) & ((1 << HASHBITS) - 1)) % MAX_RTX_HASH_TABLE)
3117 /* Initialize constant pool hashing for next function. */
3120 init_const_rtx_hash_table ()
3122 const_rtx_hash_table
3123 = ((struct constant_descriptor **)
3124 oballoc (MAX_RTX_HASH_TABLE * sizeof (struct constant_descriptor *)));
3125 const_rtx_sym_hash_table
3126 = ((struct pool_sym **)
3127 oballoc (MAX_RTX_HASH_TABLE * sizeof (struct pool_sym *)));
3128 bzero ((char *) const_rtx_hash_table,
3129 MAX_RTX_HASH_TABLE * sizeof (struct constant_descriptor *));
3130 bzero ((char *) const_rtx_sym_hash_table,
3131 MAX_RTX_HASH_TABLE * sizeof (struct pool_sym *));
3133 first_pool = last_pool = 0;
3137 /* Save and restore status for a nested function. */
3140 save_varasm_status (p, context)
3144 p->const_rtx_hash_table = const_rtx_hash_table;
3145 p->const_rtx_sym_hash_table = const_rtx_sym_hash_table;
3146 p->first_pool = first_pool;
3147 p->last_pool = last_pool;
3148 p->pool_offset = pool_offset;
3149 p->const_double_chain = const_double_chain;
3151 /* If we are pushing to toplevel, we can't reuse const_double_chain. */
3152 if (context == NULL_TREE)
3153 const_double_chain = 0;
3157 restore_varasm_status (p)
3160 const_rtx_hash_table = p->const_rtx_hash_table;
3161 const_rtx_sym_hash_table = p->const_rtx_sym_hash_table;
3162 first_pool = p->first_pool;
3163 last_pool = p->last_pool;
3164 pool_offset = p->pool_offset;
3165 const_double_chain = p->const_double_chain;
3168 enum kind { RTX_DOUBLE, RTX_INT };
3172 #ifdef ONLY_INT_FIELDS
3173 unsigned int kind : 16;
3174 unsigned int mode : 16;
3176 enum kind kind : 16;
3177 enum machine_mode mode : 16;
3180 union real_extract du;
3181 struct addr_const addr;
3182 struct {HOST_WIDE_INT high, low;} di;
3186 /* Express an rtx for a constant integer (perhaps symbolic)
3187 as the sum of a symbol or label plus an explicit integer.
3188 They are stored into VALUE. */
3191 decode_rtx_const (mode, x, value)
3192 enum machine_mode mode;
3194 struct rtx_const *value;
3196 /* Clear the whole structure, including any gaps. */
3199 int *p = (int *) value;
3200 int *end = (int *) (value + 1);
3205 value->kind = RTX_INT; /* Most usual kind. */
3208 switch (GET_CODE (x))
3211 value->kind = RTX_DOUBLE;
3212 if (GET_MODE (x) != VOIDmode)
3214 value->mode = GET_MODE (x);
3215 bcopy ((char *) &CONST_DOUBLE_LOW (x),
3216 (char *) &value->un.du, sizeof value->un.du);
3220 value->un.di.low = CONST_DOUBLE_LOW (x);
3221 value->un.di.high = CONST_DOUBLE_HIGH (x);
3226 value->un.addr.offset = INTVAL (x);
3232 value->un.addr.base = x;
3237 if (GET_CODE (x) == PLUS)
3239 value->un.addr.base = XEXP (x, 0);
3240 if (GET_CODE (XEXP (x, 1)) != CONST_INT)
3242 value->un.addr.offset = INTVAL (XEXP (x, 1));
3244 else if (GET_CODE (x) == MINUS)
3246 value->un.addr.base = XEXP (x, 0);
3247 if (GET_CODE (XEXP (x, 1)) != CONST_INT)
3249 value->un.addr.offset = - INTVAL (XEXP (x, 1));
3259 if (value->kind == RTX_INT && value->un.addr.base != 0)
3260 switch (GET_CODE (value->un.addr.base))
3264 /* Use the string's address, not the SYMBOL_REF's address,
3265 for the sake of addresses of library routines.
3266 For a LABEL_REF, compare labels. */
3267 value->un.addr.base = XEXP (value->un.addr.base, 0);
3274 /* Given a MINUS expression, simplify it if both sides
3275 include the same symbol. */
3278 simplify_subtraction (x)
3281 struct rtx_const val0, val1;
3283 decode_rtx_const (GET_MODE (x), XEXP (x, 0), &val0);
3284 decode_rtx_const (GET_MODE (x), XEXP (x, 1), &val1);
3286 if (val0.un.addr.base == val1.un.addr.base)
3287 return GEN_INT (val0.un.addr.offset - val1.un.addr.offset);
3291 /* Compute a hash code for a constant RTL expression. */
3294 const_hash_rtx (mode, x)
3295 enum machine_mode mode;
3301 struct rtx_const value;
3302 decode_rtx_const (mode, x, &value);
3304 /* Compute hashing function */
3306 for (i = 0; i < sizeof value / sizeof (int); i++)
3307 hi += ((int *) &value)[i];
3309 hi &= (1 << HASHBITS) - 1;
3310 hi %= MAX_RTX_HASH_TABLE;
3314 /* Compare a constant rtl object X with a constant-descriptor DESC.
3315 Return 1 if DESC describes a constant with the same value as X. */
3318 compare_constant_rtx (mode, x, desc)
3319 enum machine_mode mode;
3321 struct constant_descriptor *desc;
3323 register int *p = (int *) desc->contents;
3326 struct rtx_const value;
3328 decode_rtx_const (mode, x, &value);
3329 strp = (int *) &value;
3330 len = sizeof value / sizeof (int);
3332 /* Compare constant contents. */
3334 if (*p++ != *strp++)
3340 /* Construct a constant descriptor for the rtl-expression X.
3341 It is up to the caller to enter the descriptor in the hash table. */
3343 static struct constant_descriptor *
3344 record_constant_rtx (mode, x)
3345 enum machine_mode mode;
3348 struct constant_descriptor *ptr;
3350 struct rtx_const value;
3352 decode_rtx_const (mode, x, &value);
3354 /* Put these things in the saveable obstack so we can ensure it won't
3355 be freed if we are called from combine or some other phase that discards
3356 memory allocated from function_obstack (current_obstack). */
3357 obstack_grow (saveable_obstack, &ptr, sizeof ptr);
3358 obstack_grow (saveable_obstack, &label, sizeof label);
3360 /* Record constant contents. */
3361 obstack_grow (saveable_obstack, &value, sizeof value);
3363 return (struct constant_descriptor *) obstack_finish (saveable_obstack);
3366 /* Given a constant rtx X, make (or find) a memory constant for its value
3367 and return a MEM rtx to refer to it in memory. */
3370 force_const_mem (mode, x)
3371 enum machine_mode mode;
3375 register struct constant_descriptor *desc;
3380 /* If we want this CONST_DOUBLE in the same mode as it is in memory
3381 (this will always be true for floating CONST_DOUBLEs that have been
3382 placed in memory, but not for VOIDmode (integer) CONST_DOUBLEs),
3383 use the previous copy. Otherwise, make a new one. Note that in
3384 the unlikely event that this same CONST_DOUBLE is used in two different
3385 modes in an alternating fashion, we will allocate a lot of different
3386 memory locations, but this should be extremely rare. */
3388 /* Don't use CONST_DOUBLE_MEM in a nested function.
3389 Nested functions have their own constant pools,
3390 so they can't share the same values in CONST_DOUBLE_MEM
3391 with the containing function. */
3392 if (outer_function_chain == 0)
3393 if (GET_CODE (x) == CONST_DOUBLE
3394 && GET_CODE (CONST_DOUBLE_MEM (x)) == MEM
3395 && GET_MODE (CONST_DOUBLE_MEM (x)) == mode)
3396 return CONST_DOUBLE_MEM (x);
3398 /* Compute hash code of X. Search the descriptors for that hash code
3399 to see if any of them describes X. If yes, the descriptor records
3400 the label number already assigned. */
3402 hash = const_hash_rtx (mode, x);
3404 for (desc = const_rtx_hash_table[hash]; desc; desc = desc->next)
3405 if (compare_constant_rtx (mode, x, desc))
3407 found = desc->label;
3413 register struct pool_constant *pool;
3414 register struct pool_sym *sym;
3417 /* No constant equal to X is known to have been output.
3418 Make a constant descriptor to enter X in the hash table.
3419 Assign the label number and record it in the descriptor for
3420 future calls to this function to find. */
3422 desc = record_constant_rtx (mode, x);
3423 desc->next = const_rtx_hash_table[hash];
3424 const_rtx_hash_table[hash] = desc;
3426 /* Align the location counter as required by EXP's data type. */
3427 align = (mode == VOIDmode) ? UNITS_PER_WORD : GET_MODE_SIZE (mode);
3428 if (align > BIGGEST_ALIGNMENT / BITS_PER_UNIT)
3429 align = BIGGEST_ALIGNMENT / BITS_PER_UNIT;
3431 pool_offset += align - 1;
3432 pool_offset &= ~ (align - 1);
3434 /* If RTL is not being placed into the saveable obstack, make a
3435 copy of X that is in the saveable obstack in case we are
3436 being called from combine or some other phase that discards
3437 memory it allocates. We used to only do this if it is a
3438 CONST; however, reload can allocate a CONST_INT when
3439 eliminating registers. */
3440 if (rtl_obstack != saveable_obstack
3441 && (GET_CODE (x) == CONST || GET_CODE (x) == CONST_INT))
3443 push_obstacks_nochange ();
3444 rtl_in_saveable_obstack ();
3446 if (GET_CODE (x) == CONST)
3447 x = gen_rtx_CONST (GET_MODE (x),
3448 gen_rtx_PLUS (GET_MODE (x),
3449 XEXP (XEXP (x, 0), 0),
3450 XEXP (XEXP (x, 0), 1)));
3452 x = GEN_INT (INTVAL (x));
3457 /* Allocate a pool constant descriptor, fill it in, and chain it in. */
3459 pool = (struct pool_constant *) savealloc (sizeof (struct pool_constant));
3463 pool->labelno = const_labelno;
3464 pool->align = align;
3465 pool->offset = pool_offset;
3472 last_pool->next = pool;
3475 pool_offset += GET_MODE_SIZE (mode);
3477 /* Create a string containing the label name, in LABEL. */
3478 ASM_GENERATE_INTERNAL_LABEL (label, "LC", const_labelno);
3483 = (char *) obstack_copy0 (saveable_obstack, label, strlen (label));
3485 /* Add label to symbol hash table. */
3486 hash = SYMHASH (found);
3487 sym = (struct pool_sym *) savealloc (sizeof (struct pool_sym));
3490 sym->next = const_rtx_sym_hash_table[hash];
3491 const_rtx_sym_hash_table[hash] = sym;
3494 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
3496 def = gen_rtx_MEM (mode, gen_rtx_SYMBOL_REF (Pmode, found));
3498 RTX_UNCHANGING_P (def) = 1;
3499 /* Mark the symbol_ref as belonging to this constants pool. */
3500 CONSTANT_POOL_ADDRESS_P (XEXP (def, 0)) = 1;
3501 current_function_uses_const_pool = 1;
3503 if (outer_function_chain == 0)
3504 if (GET_CODE (x) == CONST_DOUBLE)
3506 if (CONST_DOUBLE_MEM (x) == cc0_rtx)
3508 CONST_DOUBLE_CHAIN (x) = const_double_chain;
3509 const_double_chain = x;
3511 CONST_DOUBLE_MEM (x) = def;
3517 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
3518 the corresponding pool_constant structure. */
3520 static struct pool_constant *
3521 find_pool_constant (addr)
3524 struct pool_sym *sym;
3525 char *label = XSTR (addr, 0);
3527 for (sym = const_rtx_sym_hash_table[SYMHASH (label)]; sym; sym = sym->next)
3528 if (sym->label == label)
3534 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
3537 get_pool_constant (addr)
3540 return (find_pool_constant (addr))->constant;
3543 /* Similar, return the mode. */
3546 get_pool_mode (addr)
3549 return (find_pool_constant (addr))->mode;
3552 /* Similar, return the offset in the constant pool. */
3555 get_pool_offset (addr)
3558 return (find_pool_constant (addr))->offset;
3561 /* Return the size of the constant pool. */
3569 /* Write all the constants in the constant pool. */
3572 output_constant_pool (fnname, fndecl)
3576 struct pool_constant *pool;
3578 union real_extract u;
3580 /* It is possible for gcc to call force_const_mem and then to later
3581 discard the instructions which refer to the constant. In such a
3582 case we do not need to output the constant. */
3583 if (optimize >= 0 && flag_expensive_optimizations)
3584 mark_constant_pool ();
3586 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3587 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file, fnname, fndecl, pool_offset);
3590 for (pool = first_pool; pool; pool = pool->next)
3597 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3598 whose CODE_LABEL has been deleted. This can occur if a jump table
3599 is eliminated by optimization. If so, write a constant of zero
3600 instead. Note that this can also happen by turning the
3601 CODE_LABEL into a NOTE. */
3602 if (((GET_CODE (x) == LABEL_REF
3603 && (INSN_DELETED_P (XEXP (x, 0))
3604 || GET_CODE (XEXP (x, 0)) == NOTE)))
3605 || (GET_CODE (x) == CONST && GET_CODE (XEXP (x, 0)) == PLUS
3606 && GET_CODE (XEXP (XEXP (x, 0), 0)) == LABEL_REF
3607 && (INSN_DELETED_P (XEXP (XEXP (XEXP (x, 0), 0), 0))
3608 || GET_CODE (XEXP (XEXP (XEXP (x, 0), 0), 0)) == NOTE)))
3611 /* First switch to correct section. */
3612 #ifdef SELECT_RTX_SECTION
3613 SELECT_RTX_SECTION (pool->mode, x);
3615 readonly_data_section ();
3618 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3619 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file, x, pool->mode,
3620 pool->align, pool->labelno, done);
3623 if (pool->align > 1)
3624 ASM_OUTPUT_ALIGN (asm_out_file, exact_log2 (pool->align));
3626 /* Output the label. */
3627 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LC", pool->labelno);
3629 /* Output the value of the constant itself. */
3630 switch (GET_MODE_CLASS (pool->mode))
3633 if (GET_CODE (x) != CONST_DOUBLE)
3636 bcopy ((char *) &CONST_DOUBLE_LOW (x), (char *) &u, sizeof u);
3637 assemble_real (u.d, pool->mode);
3641 case MODE_PARTIAL_INT:
3642 assemble_integer (x, GET_MODE_SIZE (pool->mode), 1);
3649 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3655 #ifdef ASM_OUTPUT_POOL_EPILOGUE
3656 ASM_OUTPUT_POOL_EPILOGUE (asm_out_file, fnname, fndecl, pool_offset);
3659 /* Done with this pool. */
3660 first_pool = last_pool = 0;
3663 /* Look through the instructions for this function, and mark all the
3664 entries in the constant pool which are actually being used. */
3667 mark_constant_pool ()
3670 struct pool_constant *pool;
3672 if (first_pool == 0)
3675 for (pool = first_pool; pool; pool = pool->next)
3678 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
3679 if (GET_RTX_CLASS (GET_CODE (insn)) == 'i')
3680 mark_constants (PATTERN (insn));
3682 for (insn = current_function_epilogue_delay_list;
3684 insn = XEXP (insn, 1))
3685 if (GET_RTX_CLASS (GET_CODE (insn)) == 'i')
3686 mark_constants (PATTERN (insn));
3694 register char *format_ptr;
3699 if (GET_CODE (x) == SYMBOL_REF)
3701 if (CONSTANT_POOL_ADDRESS_P (x))
3702 find_pool_constant (x)->mark = 1;
3705 /* Never search inside a CONST_DOUBLE, because CONST_DOUBLE_MEM may be
3706 a MEM, but does not constitute a use of that MEM. This is particularly
3707 important inside a nested function, because CONST_DOUBLE_MEM may be
3708 a reference to a MEM in the parent's constant pool. See the comment
3709 in force_const_mem. */
3710 else if (GET_CODE (x) == CONST_DOUBLE)
3713 /* Insns may appear inside a SEQUENCE. Only check the patterns of
3714 insns, not any notes that may be attached. We don't want to mark
3715 a constant just because it happens to appear in a REG_EQUIV note. */
3716 if (GET_RTX_CLASS (GET_CODE (x)) == 'i')
3718 mark_constants (PATTERN (x));
3722 format_ptr = GET_RTX_FORMAT (GET_CODE (x));
3724 for (i = 0; i < GET_RTX_LENGTH (GET_CODE (x)); i++)
3726 switch (*format_ptr++)
3729 mark_constants (XEXP (x, i));
3733 if (XVEC (x, i) != 0)
3737 for (j = 0; j < XVECLEN (x, i); j++)
3738 mark_constants (XVECEXP (x, i, j));
3757 /* Find all the constants whose addresses are referenced inside of EXP,
3758 and make sure assembler code with a label has been output for each one.
3759 Indicate whether an ADDR_EXPR has been encountered. */
3762 output_addressed_constants (exp)
3767 switch (TREE_CODE (exp))
3771 register tree constant = TREE_OPERAND (exp, 0);
3773 while (TREE_CODE (constant) == COMPONENT_REF)
3775 constant = TREE_OPERAND (constant, 0);
3778 if (TREE_CODE_CLASS (TREE_CODE (constant)) == 'c'
3779 || TREE_CODE (constant) == CONSTRUCTOR)
3780 /* No need to do anything here
3781 for addresses of variables or functions. */
3782 output_constant_def (constant);
3789 reloc = output_addressed_constants (TREE_OPERAND (exp, 0));
3790 reloc |= output_addressed_constants (TREE_OPERAND (exp, 1));
3795 case NON_LVALUE_EXPR:
3796 reloc = output_addressed_constants (TREE_OPERAND (exp, 0));
3802 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
3803 if (TREE_VALUE (link) != 0)
3804 reloc |= output_addressed_constants (TREE_VALUE (link));
3814 /* Output assembler code for constant EXP to FILE, with no label.
3815 This includes the pseudo-op such as ".int" or ".byte", and a newline.
3816 Assumes output_addressed_constants has been done on EXP already.
3818 Generate exactly SIZE bytes of assembler data, padding at the end
3819 with zeros if necessary. SIZE must always be specified.
3821 SIZE is important for structure constructors,
3822 since trailing members may have been omitted from the constructor.
3823 It is also important for initialization of arrays from string constants
3824 since the full length of the string constant might not be wanted.
3825 It is also needed for initialization of unions, where the initializer's
3826 type is just one member, and that may not be as long as the union.
3828 There a case in which we would fail to output exactly SIZE bytes:
3829 for a structure constructor that wants to produce more than SIZE bytes.
3830 But such constructors will never be generated for any possible input. */
3833 output_constant (exp, size)
3837 register enum tree_code code = TREE_CODE (TREE_TYPE (exp));
3842 /* Eliminate the NON_LVALUE_EXPR_EXPR that makes a cast not be an lvalue.
3843 That way we get the constant (we hope) inside it. Also, strip off any
3844 NOP_EXPR that converts between two record, union, array, or set types. */
3845 while ((TREE_CODE (exp) == NOP_EXPR
3846 && (TREE_TYPE (exp) == TREE_TYPE (TREE_OPERAND (exp, 0))
3847 || AGGREGATE_TYPE_P (TREE_TYPE (exp))))
3848 || TREE_CODE (exp) == NON_LVALUE_EXPR)
3849 exp = TREE_OPERAND (exp, 0);
3851 /* Allow a constructor with no elements for any data type.
3852 This means to fill the space with zeros. */
3853 if (TREE_CODE (exp) == CONSTRUCTOR && CONSTRUCTOR_ELTS (exp) == 0)
3855 assemble_zeros (size);
3866 case REFERENCE_TYPE:
3867 /* ??? What about (int)((float)(int)&foo + 4) */
3868 while (TREE_CODE (exp) == NOP_EXPR || TREE_CODE (exp) == CONVERT_EXPR
3869 || TREE_CODE (exp) == NON_LVALUE_EXPR)
3870 exp = TREE_OPERAND (exp, 0);
3872 if (! assemble_integer (expand_expr (exp, NULL_RTX, VOIDmode,
3873 EXPAND_INITIALIZER),
3875 error ("initializer for integer value is too complicated");
3880 if (TREE_CODE (exp) != REAL_CST)
3881 error ("initializer for floating value is not a floating constant");
3883 assemble_real (TREE_REAL_CST (exp),
3884 mode_for_size (size * BITS_PER_UNIT, MODE_FLOAT, 0));
3889 output_constant (TREE_REALPART (exp), size / 2);
3890 output_constant (TREE_IMAGPART (exp), size / 2);
3891 size -= (size / 2) * 2;
3895 if (TREE_CODE (exp) == CONSTRUCTOR)
3897 output_constructor (exp, size);
3900 else if (TREE_CODE (exp) == STRING_CST)
3904 if (size > TREE_STRING_LENGTH (exp))
3906 excess = size - TREE_STRING_LENGTH (exp);
3907 size = TREE_STRING_LENGTH (exp);
3910 assemble_string (TREE_STRING_POINTER (exp), size);
3919 if (TREE_CODE (exp) == CONSTRUCTOR)
3920 output_constructor (exp, size);
3926 if (TREE_CODE (exp) == INTEGER_CST)
3927 assemble_integer (expand_expr (exp, NULL_RTX,
3928 VOIDmode, EXPAND_INITIALIZER),
3930 else if (TREE_CODE (exp) == CONSTRUCTOR)
3932 unsigned char *buffer = (unsigned char *) alloca (size);
3933 if (get_set_constructor_bytes (exp, buffer, size))
3935 assemble_string ((char *) buffer, size);
3938 error ("unknown set constructor type");
3946 assemble_zeros (size);
3950 /* Subroutine of output_constant, used for CONSTRUCTORs
3951 (aggregate constants).
3952 Generate at least SIZE bytes, padding if necessary. */
3955 output_constructor (exp, size)
3959 register tree link, field = 0;
3960 HOST_WIDE_INT min_index = 0;
3961 /* Number of bytes output or skipped so far.
3962 In other words, current position within the constructor. */
3963 int total_bytes = 0;
3964 /* Non-zero means BYTE contains part of a byte, to be output. */
3965 int byte_buffer_in_use = 0;
3968 if (HOST_BITS_PER_WIDE_INT < BITS_PER_UNIT)
3971 if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE)
3972 field = TYPE_FIELDS (TREE_TYPE (exp));
3974 if (TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE
3975 && TYPE_DOMAIN (TREE_TYPE (exp)) != 0)
3977 = TREE_INT_CST_LOW (TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (exp))));
3979 /* As LINK goes through the elements of the constant,
3980 FIELD goes through the structure fields, if the constant is a structure.
3981 if the constant is a union, then we override this,
3982 by getting the field from the TREE_LIST element.
3983 But the constant could also be an array. Then FIELD is zero. */
3984 for (link = CONSTRUCTOR_ELTS (exp);
3986 link = TREE_CHAIN (link),
3987 field = field ? TREE_CHAIN (field) : 0)
3989 tree val = TREE_VALUE (link);
3992 /* the element in a union constructor specifies the proper field. */
3994 if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE
3995 || TREE_CODE (TREE_TYPE (exp)) == UNION_TYPE)
3997 /* if available, use the type given by link */
3998 if (TREE_PURPOSE (link) != 0)
3999 field = TREE_PURPOSE (link);
4002 if (TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE)
4003 index = TREE_PURPOSE (link);
4005 /* Eliminate the marker that makes a cast not be an lvalue. */
4009 if (index && TREE_CODE (index) == RANGE_EXPR)
4011 register int fieldsize
4012 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (exp)));
4013 HOST_WIDE_INT lo_index = TREE_INT_CST_LOW (TREE_OPERAND (index, 0));
4014 HOST_WIDE_INT hi_index = TREE_INT_CST_LOW (TREE_OPERAND (index, 1));
4015 HOST_WIDE_INT index;
4016 for (index = lo_index; index <= hi_index; index++)
4018 /* Output the element's initial value. */
4020 assemble_zeros (fieldsize);
4022 output_constant (val, fieldsize);
4024 /* Count its size. */
4025 total_bytes += fieldsize;
4028 else if (field == 0 || !DECL_BIT_FIELD (field))
4030 /* An element that is not a bit-field. */
4032 register int fieldsize;
4033 /* Since this structure is static,
4034 we know the positions are constant. */
4035 int bitpos = (field ? (TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field))
4039 bitpos = (TREE_INT_CST_LOW (TYPE_SIZE (TREE_TYPE (val)))
4041 * (TREE_INT_CST_LOW (index) - min_index));
4043 /* Output any buffered-up bit-fields preceding this element. */
4044 if (byte_buffer_in_use)
4046 ASM_OUTPUT_BYTE (asm_out_file, byte);
4048 byte_buffer_in_use = 0;
4051 /* Advance to offset of this element.
4052 Note no alignment needed in an array, since that is guaranteed
4053 if each element has the proper size. */
4054 if ((field != 0 || index != 0) && bitpos != total_bytes)
4056 assemble_zeros (bitpos - total_bytes);
4057 total_bytes = bitpos;
4060 /* Determine size this element should occupy. */
4063 if (TREE_CODE (DECL_SIZE (field)) != INTEGER_CST)
4065 if (TREE_INT_CST_LOW (DECL_SIZE (field)) > 100000)
4067 /* This avoids overflow trouble. */
4068 tree size_tree = size_binop (CEIL_DIV_EXPR,
4070 size_int (BITS_PER_UNIT));
4071 fieldsize = TREE_INT_CST_LOW (size_tree);
4075 fieldsize = TREE_INT_CST_LOW (DECL_SIZE (field));
4076 fieldsize = (fieldsize + BITS_PER_UNIT - 1) / BITS_PER_UNIT;
4080 fieldsize = int_size_in_bytes (TREE_TYPE (TREE_TYPE (exp)));
4082 /* Output the element's initial value. */
4084 assemble_zeros (fieldsize);
4086 output_constant (val, fieldsize);
4088 /* Count its size. */
4089 total_bytes += fieldsize;
4091 else if (val != 0 && TREE_CODE (val) != INTEGER_CST)
4092 error ("invalid initial value for member `%s'",
4093 IDENTIFIER_POINTER (DECL_NAME (field)));
4096 /* Element that is a bit-field. */
4098 int next_offset = TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field));
4100 = (next_offset + TREE_INT_CST_LOW (DECL_SIZE (field)));
4103 val = integer_zero_node;
4105 /* If this field does not start in this (or, next) byte,
4107 if (next_offset / BITS_PER_UNIT != total_bytes)
4109 /* Output remnant of any bit field in previous bytes. */
4110 if (byte_buffer_in_use)
4112 ASM_OUTPUT_BYTE (asm_out_file, byte);
4114 byte_buffer_in_use = 0;
4117 /* If still not at proper byte, advance to there. */
4118 if (next_offset / BITS_PER_UNIT != total_bytes)
4120 assemble_zeros (next_offset / BITS_PER_UNIT - total_bytes);
4121 total_bytes = next_offset / BITS_PER_UNIT;
4125 if (! byte_buffer_in_use)
4128 /* We must split the element into pieces that fall within
4129 separate bytes, and combine each byte with previous or
4130 following bit-fields. */
4132 /* next_offset is the offset n fbits from the beginning of
4133 the structure to the next bit of this element to be processed.
4134 end_offset is the offset of the first bit past the end of
4136 while (next_offset < end_offset)
4140 HOST_WIDE_INT value;
4141 int next_byte = next_offset / BITS_PER_UNIT;
4142 int next_bit = next_offset % BITS_PER_UNIT;
4144 /* Advance from byte to byte
4145 within this element when necessary. */
4146 while (next_byte != total_bytes)
4148 ASM_OUTPUT_BYTE (asm_out_file, byte);
4153 /* Number of bits we can process at once
4154 (all part of the same byte). */
4155 this_time = MIN (end_offset - next_offset,
4156 BITS_PER_UNIT - next_bit);
4157 if (BYTES_BIG_ENDIAN)
4159 /* On big-endian machine, take the most significant bits
4160 first (of the bits that are significant)
4161 and put them into bytes from the most significant end. */
4162 shift = end_offset - next_offset - this_time;
4163 /* Don't try to take a bunch of bits that cross
4164 the word boundary in the INTEGER_CST. */
4165 if (shift < HOST_BITS_PER_WIDE_INT
4166 && shift + this_time > HOST_BITS_PER_WIDE_INT)
4168 this_time -= (HOST_BITS_PER_WIDE_INT - shift);
4169 shift = HOST_BITS_PER_WIDE_INT;
4172 /* Now get the bits from the appropriate constant word. */
4173 if (shift < HOST_BITS_PER_WIDE_INT)
4175 value = TREE_INT_CST_LOW (val);
4177 else if (shift < 2 * HOST_BITS_PER_WIDE_INT)
4179 value = TREE_INT_CST_HIGH (val);
4180 shift -= HOST_BITS_PER_WIDE_INT;
4184 byte |= (((value >> shift)
4185 & (((HOST_WIDE_INT) 1 << this_time) - 1))
4186 << (BITS_PER_UNIT - this_time - next_bit));
4190 /* On little-endian machines,
4191 take first the least significant bits of the value
4192 and pack them starting at the least significant
4193 bits of the bytes. */
4194 shift = (next_offset
4195 - TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field)));
4196 /* Don't try to take a bunch of bits that cross
4197 the word boundary in the INTEGER_CST. */
4198 if (shift < HOST_BITS_PER_WIDE_INT
4199 && shift + this_time > HOST_BITS_PER_WIDE_INT)
4201 this_time -= (HOST_BITS_PER_WIDE_INT - shift);
4202 shift = HOST_BITS_PER_WIDE_INT;
4205 /* Now get the bits from the appropriate constant word. */
4206 if (shift < HOST_BITS_PER_WIDE_INT)
4207 value = TREE_INT_CST_LOW (val);
4208 else if (shift < 2 * HOST_BITS_PER_WIDE_INT)
4210 value = TREE_INT_CST_HIGH (val);
4211 shift -= HOST_BITS_PER_WIDE_INT;
4215 byte |= (((value >> shift)
4216 & (((HOST_WIDE_INT) 1 << this_time) - 1))
4219 next_offset += this_time;
4220 byte_buffer_in_use = 1;
4224 if (byte_buffer_in_use)
4226 ASM_OUTPUT_BYTE (asm_out_file, byte);
4229 if (total_bytes < size)
4230 assemble_zeros (size - total_bytes);
4233 /* Output asm to handle ``#pragma weak'' */
4236 handle_pragma_weak (what, name, value)
4237 enum pragma_state what;
4240 #ifdef HANDLE_PRAGMA_WEAK
4241 if (what == ps_name || what == ps_value)
4243 struct weak_syms *weak =
4244 (struct weak_syms *)permalloc (sizeof (struct weak_syms));
4245 weak->next = weak_decls;
4246 weak->name = permalloc (strlen (name) + 1);
4247 strcpy (weak->name, name);
4249 if (what != ps_value)
4250 weak->value = NULL_PTR;
4254 weak->value = permalloc (strlen (value) + 1);
4255 strcpy (weak->value, value);
4260 else if (! (what == ps_done || what == ps_start))
4261 warning ("malformed `#pragma weak'");
4262 #endif /* HANDLE_PRAGMA_WEAK */
4265 /* Declare DECL to be a weak symbol. */
4271 if (! TREE_PUBLIC (decl))
4272 error_with_decl (decl, "weak declaration of `%s' must be public");
4273 else if (TREE_ASM_WRITTEN (decl))
4274 error_with_decl (decl, "weak declaration of `%s' must precede definition");
4275 else if (SUPPORTS_WEAK)
4276 DECL_WEAK (decl) = 1;
4279 /* Emit any pending weak declarations. */
4284 #ifdef HANDLE_PRAGMA_WEAK
4285 if (HANDLE_PRAGMA_WEAK)
4287 struct weak_syms *t;
4288 for (t = weak_decls; t; t = t->next)
4290 ASM_WEAKEN_LABEL (asm_out_file, t->name);
4292 ASM_OUTPUT_DEF (asm_out_file, t->name, t->value);
4299 assemble_alias (decl, target)
4304 make_decl_rtl (decl, (char *) 0, 1);
4305 name = XSTR (XEXP (DECL_RTL (decl), 0), 0);
4307 #ifdef ASM_OUTPUT_DEF
4308 /* Make name accessible from other files, if appropriate. */
4310 if (TREE_PUBLIC (decl))
4312 #ifdef ASM_WEAKEN_LABEL
4313 if (DECL_WEAK (decl))
4314 ASM_WEAKEN_LABEL (asm_out_file, name);
4317 ASM_GLOBALIZE_LABEL (asm_out_file, name);
4320 ASM_OUTPUT_DEF (asm_out_file, name, IDENTIFIER_POINTER (target));
4321 TREE_ASM_WRITTEN (decl) = 1;
4323 #ifdef ASM_OUTPUT_WEAK_ALIAS
4324 if (! DECL_WEAK (decl))
4325 warning ("only weak aliases are supported in this configuration");
4327 ASM_OUTPUT_WEAK_ALIAS (asm_out_file, name, IDENTIFIER_POINTER (target));
4328 TREE_ASM_WRITTEN (decl) = 1;
4330 warning ("alias definitions not supported in this configuration; ignored");
4335 /* This determines whether or not we support link-once semantics. */
4336 #ifndef SUPPORTS_ONE_ONLY
4337 #ifdef MAKE_DECL_ONE_ONLY
4338 #define SUPPORTS_ONE_ONLY 1
4340 #define SUPPORTS_ONE_ONLY 0
4344 /* Returns 1 if the target configuration supports defining public symbols
4345 so that one of them will be chosen at link time instead of generating a
4346 multiply-defined symbol error, whether through the use of weak symbols or
4347 a target-specific mechanism for having duplicates discarded. */
4350 supports_one_only ()
4352 if (SUPPORTS_ONE_ONLY)
4354 return SUPPORTS_WEAK;
4357 /* Set up DECL as a public symbol that can be defined in multiple
4358 translation units without generating a linker error. */
4361 make_decl_one_only (decl)
4364 if (TREE_CODE (decl) != VAR_DECL && TREE_CODE (decl) != FUNCTION_DECL)
4367 TREE_PUBLIC (decl) = 1;
4369 if (TREE_CODE (decl) == VAR_DECL
4370 && (DECL_INITIAL (decl) == 0 || DECL_INITIAL (decl) == error_mark_node))
4371 DECL_COMMON (decl) = 1;
4372 else if (SUPPORTS_ONE_ONLY)
4374 #ifdef MAKE_DECL_ONE_ONLY
4375 MAKE_DECL_ONE_ONLY (decl);
4377 DECL_ONE_ONLY (decl) = 1;
4379 else if (SUPPORTS_WEAK)
4380 DECL_WEAK (decl) = 1;