1 /* Output variables, constants and external declarations, for GNU compiler.
2 Copyright (C) 1987, 88, 89, 92-5, 1996 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. */
31 /* #include <stab.h> */
40 #include "hard-reg-set.h"
49 #ifdef XCOFF_DEBUGGING_INFO
56 #define ASM_STABS_OP ".stabs"
59 /* This macro gets just the user-specified name
60 out of the string in a SYMBOL_REF. On most machines,
61 we discard the * if any and that's all. */
62 #ifndef STRIP_NAME_ENCODING
63 #define STRIP_NAME_ENCODING(VAR,SYMBOL_NAME) \
64 (VAR) = ((SYMBOL_NAME) + ((SYMBOL_NAME)[0] == '*'))
67 /* File in which assembler code is being written. */
69 extern FILE *asm_out_file;
71 /* The (assembler) name of the first globally-visible object output. */
72 char *first_global_object_name;
74 extern struct obstack *current_obstack;
75 extern struct obstack *saveable_obstack;
76 extern struct obstack *rtl_obstack;
77 extern struct obstack permanent_obstack;
78 #define obstack_chunk_alloc xmalloc
80 /* Number for making the label on the next
81 constant that is stored in memory. */
85 /* Number for making the label on the next
86 static variable internal to a function. */
90 /* Carry information from ASM_DECLARE_OBJECT_NAME
91 to ASM_FINISH_DECLARE_OBJECT. */
93 int size_directive_output;
95 /* The last decl for which assemble_variable was called,
96 if it did ASM_DECLARE_OBJECT_NAME.
97 If the last call to assemble_variable didn't do that,
100 tree last_assemble_variable_decl;
103 #ifdef HANDLE_PRAGMA_WEAK
104 /* Any weak symbol declarations waiting to be emitted. */
108 struct weak_syms *next;
113 static struct weak_syms *weak_decls;
116 /* Nonzero if at least one function definition has been seen. */
118 static int function_defined;
121 struct constant_descriptor;
123 struct pool_constant;
125 static void bc_make_decl_rtl PROTO((tree, char *, int));
126 static char *strip_reg_name PROTO((char *));
127 static void bc_output_ascii PROTO((FILE *, char *, int));
128 static int contains_pointers_p PROTO((tree));
129 static void decode_addr_const PROTO((tree, struct addr_const *));
130 static int const_hash PROTO((tree));
131 static int compare_constant PROTO((tree,
132 struct constant_descriptor *));
133 static char *compare_constant_1 PROTO((tree, char *));
134 static struct constant_descriptor *record_constant PROTO((tree));
135 static void record_constant_1 PROTO((tree));
136 static tree copy_constant PROTO((tree));
137 static void output_constant_def_contents PROTO((tree, int, int));
138 static void decode_rtx_const PROTO((enum machine_mode, rtx,
139 struct rtx_const *));
140 static int const_hash_rtx PROTO((enum machine_mode, rtx));
141 static int compare_constant_rtx PROTO((enum machine_mode, rtx,
142 struct constant_descriptor *));
143 static struct constant_descriptor *record_constant_rtx PROTO((enum machine_mode,
145 static struct pool_constant *find_pool_constant PROTO((rtx));
146 static int output_addressed_constants PROTO((tree));
147 static void bc_assemble_integer PROTO((tree, int));
148 static void output_constructor PROTO((tree, int));
150 static enum in_section { no_section, in_text, in_data, in_named
151 #ifdef BSS_SECTION_ASM_OP
154 #ifdef EXTRA_SECTIONS
157 } in_section = no_section;
159 /* Return a non-zero value if DECL has a section attribute. */
160 #define IN_NAMED_SECTION(DECL) \
161 ((TREE_CODE (DECL) == FUNCTION_DECL || TREE_CODE (DECL) == VAR_DECL) \
162 && DECL_SECTION_NAME (DECL) != NULL_TREE)
164 /* Text of section name when in_section == in_named. */
165 static char *in_named_name;
167 /* Define functions like text_section for any extra sections. */
168 #ifdef EXTRA_SECTION_FUNCTIONS
169 EXTRA_SECTION_FUNCTIONS
172 /* Tell assembler to switch to text section. */
177 if (in_section != in_text)
182 fprintf (asm_out_file, "%s\n", TEXT_SECTION_ASM_OP);
184 in_section = in_text;
188 /* Tell assembler to switch to data section. */
193 if (in_section != in_data)
199 if (flag_shared_data)
201 #ifdef SHARED_SECTION_ASM_OP
202 fprintf (asm_out_file, "%s\n", SHARED_SECTION_ASM_OP);
204 fprintf (asm_out_file, "%s\n", DATA_SECTION_ASM_OP);
208 fprintf (asm_out_file, "%s\n", DATA_SECTION_ASM_OP);
211 in_section = in_data;
215 /* Tell assembler to switch to read-only data section. This is normally
219 readonly_data_section ()
221 #ifdef READONLY_DATA_SECTION
222 READONLY_DATA_SECTION (); /* Note this can call data_section. */
228 /* Determine if we're in the text section. */
233 return in_section == in_text;
236 /* Determine if we're in the data section. */
241 return in_section == in_data;
244 /* Tell assembler to change to section NAME for DECL.
245 If DECL is NULL, just switch to section NAME.
246 If NAME is NULL, get the name from DECL. */
249 named_section (decl, name)
253 if (decl != NULL_TREE
254 && TREE_CODE_CLASS (TREE_CODE (decl)) != 'd')
257 name = TREE_STRING_POINTER (DECL_SECTION_NAME (decl));
259 if (in_section != in_named || strcmp (name, in_named_name))
261 in_named_name = obstack_alloc (&permanent_obstack, strlen (name) + 1);
262 strcpy (in_named_name, name);
263 in_section = in_named;
265 #ifdef ASM_OUTPUT_SECTION_NAME
266 ASM_OUTPUT_SECTION_NAME (asm_out_file, decl, name);
268 /* Section attributes are not supported if this macro isn't provided -
269 some host formats don't support them at all. The front-end should
270 already have flagged this as an error. */
276 #ifdef BSS_SECTION_ASM_OP
278 /* Tell the assembler to switch to the bss section. */
283 if (in_section != in_bss)
289 #ifdef SHARED_BSS_SECTION_ASM_OP
290 if (flag_shared_data)
291 fprintf (asm_out_file, "%s\n", SHARED_BSS_SECTION_ASM_OP);
294 fprintf (asm_out_file, "%s\n", BSS_SECTION_ASM_OP);
301 #ifdef ASM_OUTPUT_BSS
303 /* Utility function for ASM_OUTPUT_BSS for targets to use if
304 they don't support alignments in .bss.
305 ??? It is believed that this function will work in most cases so such
306 support is localized here. */
309 asm_output_bss (file, decl, name, size, rounded)
315 ASM_GLOBALIZE_LABEL (file, name);
317 #ifdef ASM_DECLARE_OBJECT_NAME
318 last_assemble_variable_decl = decl;
319 ASM_DECLARE_OBJECT_NAME (file, name, decl);
321 /* Standard thing is just output label for the object. */
322 ASM_OUTPUT_LABEL (file, name);
323 #endif /* ASM_DECLARE_OBJECT_NAME */
324 ASM_OUTPUT_SKIP (file, rounded);
329 #ifdef ASM_OUTPUT_ALIGNED_BSS
331 /* Utility function for targets to use in implementing
332 ASM_OUTPUT_ALIGNED_BSS.
333 ??? It is believed that this function will work in most cases so such
334 support is localized here. */
337 asm_output_aligned_bss (file, decl, name, size, align)
343 ASM_GLOBALIZE_LABEL (file, name);
345 ASM_OUTPUT_ALIGN (file, floor_log2 (align / BITS_PER_UNIT));
346 #ifdef ASM_DECLARE_OBJECT_NAME
347 last_assemble_variable_decl = decl;
348 ASM_DECLARE_OBJECT_NAME (file, name, decl);
350 /* Standard thing is just output label for the object. */
351 ASM_OUTPUT_LABEL (file, name);
352 #endif /* ASM_DECLARE_OBJECT_NAME */
353 ASM_OUTPUT_SKIP (file, size ? size : 1);
358 #endif /* BSS_SECTION_ASM_OP */
360 /* Switch to the section for function DECL.
362 If DECL is NULL_TREE, switch to the text section.
363 ??? It's not clear that we will ever be passed NULL_TREE, but it's
364 safer to handle it. */
367 function_section (decl)
370 if (decl != NULL_TREE
371 && DECL_SECTION_NAME (decl) != NULL_TREE)
372 named_section (decl, (char *) 0);
377 /* Switch to section for variable DECL.
379 RELOC is the `reloc' argument to SELECT_SECTION. */
382 variable_section (decl, reloc)
386 if (IN_NAMED_SECTION (decl))
387 named_section (decl, NULL);
390 /* C++ can have const variables that get initialized from constructors,
391 and thus can not be in a readonly section. We prevent this by
392 verifying that the initial value is constant for objects put in a
395 error_mark_node is used by the C front end to indicate that the
396 initializer has not been seen yet. In this case, we assume that
397 the initializer must be constant.
399 C++ uses error_mark_node for variables that have complicated
400 initializers, but these variables go in BSS so we won't be called
403 #ifdef SELECT_SECTION
404 SELECT_SECTION (decl, reloc);
406 if (TREE_READONLY (decl)
407 && ! TREE_THIS_VOLATILE (decl)
408 && DECL_INITIAL (decl)
409 && (DECL_INITIAL (decl) == error_mark_node
410 || TREE_CONSTANT (DECL_INITIAL (decl)))
411 && ! (flag_pic && reloc))
412 readonly_data_section ();
419 /* Tell assembler to switch to the section for the exception handling
425 #ifdef ASM_OUTPUT_SECTION_NAME
426 named_section (NULL_TREE, ".gcc_except_table");
431 #if defined (EXCEPTION_SECTION)
432 EXCEPTION_SECTION ();
434 readonly_data_section ();
439 /* Create the rtl to represent a function, for a function definition.
440 DECL is a FUNCTION_DECL node which describes which function.
441 The rtl is stored into DECL. */
444 make_function_rtl (decl)
447 char *name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
451 if (DECL_RTL (decl) == 0)
452 DECL_RTL (decl) = bc_gen_rtx (name, 0, (struct bc_label *) 0);
454 /* Record that at least one function has been defined. */
455 function_defined = 1;
459 /* Rename a nested function to avoid conflicts. */
460 if (decl_function_context (decl) != 0
461 && DECL_INITIAL (decl) != 0
462 && DECL_RTL (decl) == 0)
466 name = IDENTIFIER_POINTER (DECL_NAME (decl));
467 ASM_FORMAT_PRIVATE_NAME (label, name, var_labelno);
468 name = obstack_copy0 (saveable_obstack, label, strlen (label));
472 if (DECL_RTL (decl) == 0)
475 = gen_rtx (MEM, DECL_MODE (decl),
476 gen_rtx (SYMBOL_REF, Pmode, name));
478 /* Optionally set flags or add text to the name to record information
479 such as that it is a function name. If the name is changed, the macro
480 ASM_OUTPUT_LABELREF will have to know how to strip this information. */
481 #ifdef ENCODE_SECTION_INFO
482 ENCODE_SECTION_INFO (decl);
486 /* Record at least one function has been defined. */
487 function_defined = 1;
490 /* Create the DECL_RTL for a declaration for a static or external
491 variable or static or external function.
492 ASMSPEC, if not 0, is the string which the user specified
493 as the assembler symbol name.
494 TOP_LEVEL is nonzero if this is a file-scope variable.
495 This is never called for PARM_DECLs. */
498 bc_make_decl_rtl (decl, asmspec, top_level)
503 register char *name = TREE_STRING_POINTER (DECL_ASSEMBLER_NAME (decl));
505 if (DECL_RTL (decl) == 0)
507 /* Print an error message for register variables. */
508 if (DECL_REGISTER (decl))
509 error ("global register variables not supported in the interpreter");
511 /* Handle ordinary static variables and functions. */
512 if (DECL_RTL (decl) == 0)
514 /* Can't use just the variable's own name for a variable
515 whose scope is less than the whole file.
516 Concatenate a distinguishing number. */
517 if (!top_level && !DECL_EXTERNAL (decl) && asmspec == 0)
521 ASM_FORMAT_PRIVATE_NAME (label, name, var_labelno);
522 name = obstack_copy0 (saveable_obstack, label, strlen (label));
526 DECL_RTL (decl) = bc_gen_rtx (name, 0, (struct bc_label *) 0);
531 /* Given NAME, a putative register name, discard any customary prefixes. */
534 strip_reg_name (name)
537 #ifdef REGISTER_PREFIX
538 if (!strncmp (name, REGISTER_PREFIX, strlen (REGISTER_PREFIX)))
539 name += strlen (REGISTER_PREFIX);
541 if (name[0] == '%' || name[0] == '#')
546 /* Decode an `asm' spec for a declaration as a register name.
547 Return the register number, or -1 if nothing specified,
548 or -2 if the ASMSPEC is not `cc' or `memory' and is not recognized,
549 or -3 if ASMSPEC is `cc' and is not recognized,
550 or -4 if ASMSPEC is `memory' and is not recognized.
551 Accept an exact spelling or a decimal number.
552 Prefixes such as % are optional. */
555 decode_reg_name (asmspec)
562 /* Get rid of confusing prefixes. */
563 asmspec = strip_reg_name (asmspec);
565 /* Allow a decimal number as a "register name". */
566 for (i = strlen (asmspec) - 1; i >= 0; i--)
567 if (! (asmspec[i] >= '0' && asmspec[i] <= '9'))
569 if (asmspec[0] != 0 && i < 0)
572 if (i < FIRST_PSEUDO_REGISTER && i >= 0)
578 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
580 && ! strcmp (asmspec, strip_reg_name (reg_names[i])))
583 #ifdef ADDITIONAL_REGISTER_NAMES
585 static struct { char *name; int number; } table[]
586 = ADDITIONAL_REGISTER_NAMES;
588 for (i = 0; i < sizeof (table) / sizeof (table[0]); i++)
589 if (! strcmp (asmspec, table[i].name))
590 return table[i].number;
592 #endif /* ADDITIONAL_REGISTER_NAMES */
594 if (!strcmp (asmspec, "memory"))
597 if (!strcmp (asmspec, "cc"))
606 /* Create the DECL_RTL for a declaration for a static or external variable
607 or static or external function.
608 ASMSPEC, if not 0, is the string which the user specified
609 as the assembler symbol name.
610 TOP_LEVEL is nonzero if this is a file-scope variable.
612 This is never called for PARM_DECL nodes. */
615 make_decl_rtl (decl, asmspec, top_level)
620 register char *name = 0;
625 bc_make_decl_rtl (decl, asmspec, top_level);
629 reg_number = decode_reg_name (asmspec);
631 if (DECL_ASSEMBLER_NAME (decl) != NULL_TREE)
632 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
634 if (reg_number == -2)
636 /* ASMSPEC is given, and not the name of a register. */
637 name = (char *) obstack_alloc (saveable_obstack,
638 strlen (asmspec) + 2);
640 strcpy (&name[1], asmspec);
643 /* For a duplicate declaration, we can be called twice on the
644 same DECL node. Don't discard the RTL already made. */
645 if (DECL_RTL (decl) == 0)
649 /* First detect errors in declaring global registers. */
650 if (TREE_CODE (decl) != FUNCTION_DECL
651 && DECL_REGISTER (decl) && reg_number == -1)
652 error_with_decl (decl,
653 "register name not specified for `%s'");
654 else if (TREE_CODE (decl) != FUNCTION_DECL
655 && DECL_REGISTER (decl) && reg_number < 0)
656 error_with_decl (decl,
657 "invalid register name for `%s'");
658 else if ((reg_number >= 0 || reg_number == -3)
659 && (TREE_CODE (decl) == FUNCTION_DECL
660 && ! DECL_REGISTER (decl)))
661 error_with_decl (decl,
662 "register name given for non-register variable `%s'");
663 else if (TREE_CODE (decl) != FUNCTION_DECL
664 && DECL_REGISTER (decl)
665 && TYPE_MODE (TREE_TYPE (decl)) == BLKmode)
666 error_with_decl (decl,
667 "data type of `%s' isn't suitable for a register");
668 else if (TREE_CODE (decl) != FUNCTION_DECL && DECL_REGISTER (decl)
669 && ! HARD_REGNO_MODE_OK (reg_number,
670 TYPE_MODE (TREE_TYPE (decl))))
671 error_with_decl (decl,
672 "register number for `%s' isn't suitable for data type");
673 /* Now handle properly declared static register variables. */
674 else if (TREE_CODE (decl) != FUNCTION_DECL && DECL_REGISTER (decl))
678 if (DECL_INITIAL (decl) != 0 && top_level)
680 DECL_INITIAL (decl) = 0;
681 error ("global register variable has initial value");
683 if (fixed_regs[reg_number] == 0
684 && function_defined && top_level)
685 error ("global register variable follows a function definition");
686 if (TREE_THIS_VOLATILE (decl))
687 warning ("volatile register variables don't work as you might wish");
689 /* If the user specified one of the eliminables registers here,
690 e.g., FRAME_POINTER_REGNUM, we don't want to get this variable
691 confused with that register and be eliminated. Although this
692 usage is somewhat suspect, we nevertheless use the following
693 kludge to avoid setting DECL_RTL to frame_pointer_rtx. */
696 = gen_rtx (REG, DECL_MODE (decl), FIRST_PSEUDO_REGISTER);
697 REGNO (DECL_RTL (decl)) = reg_number;
698 REG_USERVAR_P (DECL_RTL (decl)) = 1;
702 /* Make this register global, so not usable for anything
704 nregs = HARD_REGNO_NREGS (reg_number, DECL_MODE (decl));
706 globalize_reg (reg_number + --nregs);
709 /* Specifying a section attribute on a variable forces it into a
710 non-.bss section, and thus it cannot be common. */
711 else if (TREE_CODE (decl) == VAR_DECL
712 && DECL_SECTION_NAME (decl) != NULL_TREE
713 && DECL_INITIAL (decl) == NULL_TREE
714 && DECL_COMMON (decl))
715 DECL_COMMON (decl) = 0;
717 /* Now handle ordinary static variables and functions (in memory).
718 Also handle vars declared register invalidly. */
719 if (DECL_RTL (decl) == 0)
721 /* Can't use just the variable's own name for a variable
722 whose scope is less than the whole file.
723 Concatenate a distinguishing number. */
724 if (!top_level && !DECL_EXTERNAL (decl) && asmspec == 0)
728 ASM_FORMAT_PRIVATE_NAME (label, name, var_labelno);
729 name = obstack_copy0 (saveable_obstack, label, strlen (label));
736 DECL_RTL (decl) = gen_rtx (MEM, DECL_MODE (decl),
737 gen_rtx (SYMBOL_REF, Pmode, name));
739 /* If this variable is to be treated as volatile, show its
740 tree node has side effects. If it has side effects, either
741 because of this test or from TREE_THIS_VOLATILE also
742 being set, show the MEM is volatile. */
743 if (flag_volatile_global && TREE_CODE (decl) == VAR_DECL
744 && TREE_PUBLIC (decl))
745 TREE_SIDE_EFFECTS (decl) = 1;
746 if (TREE_SIDE_EFFECTS (decl))
747 MEM_VOLATILE_P (DECL_RTL (decl)) = 1;
749 if (TREE_READONLY (decl))
750 RTX_UNCHANGING_P (DECL_RTL (decl)) = 1;
751 MEM_IN_STRUCT_P (DECL_RTL (decl))
752 = AGGREGATE_TYPE_P (TREE_TYPE (decl));
754 /* Optionally set flags or add text to the name to record information
755 such as that it is a function name.
756 If the name is changed, the macro ASM_OUTPUT_LABELREF
757 will have to know how to strip this information. */
758 #ifdef ENCODE_SECTION_INFO
759 ENCODE_SECTION_INFO (decl);
763 /* If the old RTL had the wrong mode, fix the mode. */
764 else if (GET_MODE (DECL_RTL (decl)) != DECL_MODE (decl))
766 rtx rtl = DECL_RTL (decl);
767 PUT_MODE (rtl, DECL_MODE (decl));
771 /* Make the rtl for variable VAR be volatile.
772 Use this only for static variables. */
775 make_var_volatile (var)
778 if (GET_CODE (DECL_RTL (var)) != MEM)
781 MEM_VOLATILE_P (DECL_RTL (var)) = 1;
784 /* Output alignment directive to align for constant expression EXP. */
787 assemble_constant_align (exp)
792 /* Align the location counter as required by EXP's data type. */
793 align = TYPE_ALIGN (TREE_TYPE (exp));
794 #ifdef CONSTANT_ALIGNMENT
795 align = CONSTANT_ALIGNMENT (exp, align);
798 if (align > BITS_PER_UNIT)
799 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
802 /* Output a string of literal assembler code
803 for an `asm' keyword used between functions. */
806 assemble_asm (string)
811 error ("asm statements not allowed in interpreter");
817 if (TREE_CODE (string) == ADDR_EXPR)
818 string = TREE_OPERAND (string, 0);
820 fprintf (asm_out_file, "\t%s\n", TREE_STRING_POINTER (string));
823 #if 0 /* This should no longer be needed, because
824 flag_gnu_linker should be 0 on these systems,
825 which should prevent any output
826 if ASM_OUTPUT_CONSTRUCTOR and ASM_OUTPUT_DESTRUCTOR are absent. */
827 #if !(defined(DBX_DEBUGGING_INFO) && !defined(FASCIST_ASSEMBLER))
828 #ifndef ASM_OUTPUT_CONSTRUCTOR
829 #define ASM_OUTPUT_CONSTRUCTOR(file, name)
831 #ifndef ASM_OUTPUT_DESTRUCTOR
832 #define ASM_OUTPUT_DESTRUCTOR(file, name)
837 /* Record an element in the table of global destructors.
838 How this is done depends on what sort of assembler and linker
841 NAME should be the name of a global function to be called
842 at exit time. This name is output using assemble_name. */
845 assemble_destructor (name)
848 #ifdef ASM_OUTPUT_DESTRUCTOR
849 ASM_OUTPUT_DESTRUCTOR (asm_out_file, name);
853 /* Now tell GNU LD that this is part of the static destructor set. */
854 /* This code works for any machine provided you use GNU as/ld. */
855 fprintf (asm_out_file, "%s \"___DTOR_LIST__\",22,0,0,", ASM_STABS_OP);
856 assemble_name (asm_out_file, name);
857 fputc ('\n', asm_out_file);
862 /* Likewise for global constructors. */
865 assemble_constructor (name)
868 #ifdef ASM_OUTPUT_CONSTRUCTOR
869 ASM_OUTPUT_CONSTRUCTOR (asm_out_file, name);
873 /* Now tell GNU LD that this is part of the static constructor set. */
874 /* This code works for any machine provided you use GNU as/ld. */
875 fprintf (asm_out_file, "%s \"___CTOR_LIST__\",22,0,0,", ASM_STABS_OP);
876 assemble_name (asm_out_file, name);
877 fputc ('\n', asm_out_file);
882 /* Likewise for entries we want to record for garbage collection.
883 Garbage collection is still under development. */
886 assemble_gc_entry (name)
889 #ifdef ASM_OUTPUT_GC_ENTRY
890 ASM_OUTPUT_GC_ENTRY (asm_out_file, name);
894 /* Now tell GNU LD that this is part of the static constructor set. */
895 fprintf (asm_out_file, "%s \"___PTR_LIST__\",22,0,0,", ASM_STABS_OP);
896 assemble_name (asm_out_file, name);
897 fputc ('\n', asm_out_file);
902 /* Output assembler code for the constant pool of a function and associated
903 with defining the name of the function. DECL describes the function.
904 NAME is the function's name. For the constant pool, we use the current
905 constant pool data. */
908 assemble_start_function (decl, fnname)
914 /* The following code does not need preprocessing in the assembler. */
918 output_constant_pool (fnname, decl);
920 #ifdef ASM_OUTPUT_SECTION_NAME
921 /* If the function is to be put in its own section and it's not in a section
922 already, indicate so. */
923 if (flag_function_sections
924 && DECL_SECTION_NAME (decl) == NULL_TREE)
926 #ifdef UNIQUE_SECTION
927 DECL_SECTION_NAME(decl) = UNIQUE_SECTION (decl);
929 char *name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
930 /* Strip off any encoding in name. */
931 STRIP_NAME_ENCODING (name, name);
932 DECL_SECTION_NAME (decl) = build_string (strlen (name), name);
937 function_section (decl);
939 /* Tell assembler to move to target machine's alignment for functions. */
940 align = floor_log2 (FUNCTION_BOUNDARY / BITS_PER_UNIT);
944 BC_OUTPUT_ALIGN (asm_out_file, align);
946 ASM_OUTPUT_ALIGN (asm_out_file, align);
949 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
950 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file, fnname);
953 #ifdef SDB_DEBUGGING_INFO
954 /* Output SDB definition of the function. */
955 if (write_symbols == SDB_DEBUG)
956 sdbout_mark_begin_function ();
959 #ifdef DBX_DEBUGGING_INFO
960 /* Output DBX definition of the function. */
961 if (write_symbols == DBX_DEBUG)
962 dbxout_begin_function (decl);
965 /* Make function name accessible from other files, if appropriate. */
967 if (TREE_PUBLIC (decl))
969 if (!first_global_object_name && ! DECL_WEAK (decl)
970 && ! DECL_ONE_ONLY (decl))
974 STRIP_NAME_ENCODING (p, fnname);
975 first_global_object_name = permalloc (strlen (p) + 1);
976 strcpy (first_global_object_name, p);
979 #ifdef ASM_WEAKEN_LABEL
980 if (DECL_WEAK (decl))
981 ASM_WEAKEN_LABEL (asm_out_file, fnname);
985 BC_GLOBALIZE_LABEL (asm_out_file, fnname);
987 ASM_GLOBALIZE_LABEL (asm_out_file, fnname);
990 /* Do any machine/system dependent processing of the function name */
992 BC_OUTPUT_LABEL (asm_out_file, fnname);
995 #ifdef ASM_DECLARE_FUNCTION_NAME
996 ASM_DECLARE_FUNCTION_NAME (asm_out_file, fnname, current_function_decl);
998 /* Standard thing is just output label for the function. */
999 ASM_OUTPUT_LABEL (asm_out_file, fnname);
1000 #endif /* ASM_DECLARE_FUNCTION_NAME */
1004 /* Output assembler code associated with defining the size of the
1005 function. DECL describes the function. NAME is the function's name. */
1008 assemble_end_function (decl, fnname)
1012 #ifdef ASM_DECLARE_FUNCTION_SIZE
1013 ASM_DECLARE_FUNCTION_SIZE (asm_out_file, fnname, decl);
1017 /* Assemble code to leave SIZE bytes of zeros. */
1020 assemble_zeros (size)
1023 if (output_bytecode)
1025 bc_emit_const_skip (size);
1029 #ifdef ASM_NO_SKIP_IN_TEXT
1030 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
1031 so we must output 0s explicitly in the text section. */
1032 if (ASM_NO_SKIP_IN_TEXT && in_text_section ())
1036 for (i = 0; i < size - 20; i += 20)
1039 fprintf (asm_out_file,
1040 "%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);
1042 fprintf (asm_out_file,
1043 "\tbyte 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n");
1049 fprintf (asm_out_file, "%s 0", ASM_BYTE_OP);
1051 fprintf (asm_out_file, "\tbyte 0");
1054 for (; i < size; i++)
1055 fprintf (asm_out_file, ",0");
1056 fprintf (asm_out_file, "\n");
1063 if (output_bytecode)
1064 BC_OUTPUT_SKIP (asm_out_file, size);
1066 ASM_OUTPUT_SKIP (asm_out_file, size);
1070 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
1073 assemble_align (align)
1076 if (align > BITS_PER_UNIT)
1077 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
1080 /* Assemble a string constant with the specified C string as contents. */
1083 assemble_string (p, size)
1091 if (output_bytecode)
1097 /* If the string is very long, split it up. */
1101 int thissize = size - pos;
1102 if (thissize > maximum)
1105 if (output_bytecode)
1106 bc_output_ascii (asm_out_file, p, thissize);
1109 ASM_OUTPUT_ASCII (asm_out_file, p, thissize);
1118 bc_output_ascii (file, p, size)
1123 BC_OUTPUT_ASCII (file, p, size);
1126 /* Assemble everything that is needed for a variable or function declaration.
1127 Not used for automatic variables, and not used for function definitions.
1128 Should not be called for variables of incomplete structure type.
1130 TOP_LEVEL is nonzero if this variable has file scope.
1131 AT_END is nonzero if this is the special handling, at end of compilation,
1132 to define things that have had only tentative definitions.
1133 DONT_OUTPUT_DATA if nonzero means don't actually output the
1134 initial value (that will be done by the caller). */
1137 assemble_variable (decl, top_level, at_end, dont_output_data)
1141 int dont_output_data;
1143 register char *name;
1147 enum in_section saved_in_section;
1149 last_assemble_variable_decl = 0;
1151 if (output_bytecode)
1154 if (GET_CODE (DECL_RTL (decl)) == REG)
1156 /* Do output symbol info for global register variables, but do nothing
1159 if (TREE_ASM_WRITTEN (decl))
1161 TREE_ASM_WRITTEN (decl) = 1;
1163 if (!output_bytecode)
1165 #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
1166 /* File-scope global variables are output here. */
1167 if ((write_symbols == DBX_DEBUG || write_symbols == XCOFF_DEBUG)
1169 dbxout_symbol (decl, 0);
1171 #ifdef SDB_DEBUGGING_INFO
1172 if (write_symbols == SDB_DEBUG && top_level
1173 /* Leave initialized global vars for end of compilation;
1174 see comment in compile_file. */
1175 && (TREE_PUBLIC (decl) == 0 || DECL_INITIAL (decl) == 0))
1176 sdbout_symbol (decl, 0);
1178 #ifdef DWARF_DEBUGGING_INFO
1179 if (write_symbols == DWARF_DEBUG && top_level
1180 && DECL_CONTEXT (decl))
1181 dwarfout_file_scope_decl (decl, 0);
1183 #ifdef DWARF2_DEBUGGING_INFO
1184 if (write_symbols == DWARF2_DEBUG && top_level
1185 && DECL_CONTEXT (decl))
1186 dwarf2out_decl (decl);
1190 /* Only output DWARF debugging information for record-scope variables
1191 here. In the case of function-scope variables, the information
1192 for them is output when we do our recursive traversal of the tree
1193 representation for the entire containing function. In the case of
1194 file-scope variables, we output information for all of them at the
1195 very end of compilation while we are doing our final traversal of
1196 the chain of file-scope declarations. */
1201 /* Normally no need to say anything here for external references,
1202 since assemble_external is called by the language-specific code
1203 when a declaration is first seen. */
1205 if (DECL_EXTERNAL (decl))
1208 /* Output no assembler code for a function declaration.
1209 Only definitions of functions output anything. */
1211 if (TREE_CODE (decl) == FUNCTION_DECL)
1214 /* If type was incomplete when the variable was declared,
1215 see if it is complete now. */
1217 if (DECL_SIZE (decl) == 0)
1218 layout_decl (decl, 0);
1220 /* Still incomplete => don't allocate it; treat the tentative defn
1221 (which is what it must have been) as an `extern' reference. */
1223 if (!dont_output_data && DECL_SIZE (decl) == 0)
1225 error_with_file_and_line (DECL_SOURCE_FILE (decl),
1226 DECL_SOURCE_LINE (decl),
1227 "storage size of `%s' isn't known",
1228 IDENTIFIER_POINTER (DECL_NAME (decl)));
1229 TREE_ASM_WRITTEN (decl) = 1;
1233 /* The first declaration of a variable that comes through this function
1234 decides whether it is global (in C, has external linkage)
1235 or local (in C, has internal linkage). So do nothing more
1236 if this function has already run. */
1238 if (TREE_ASM_WRITTEN (decl))
1241 TREE_ASM_WRITTEN (decl) = 1;
1245 if (! dont_output_data)
1247 if (TREE_CODE (DECL_SIZE (decl)) != INTEGER_CST)
1250 /* This is better than explicit arithmetic, since it avoids overflow. */
1251 size_tree = size_binop (CEIL_DIV_EXPR,
1252 DECL_SIZE (decl), size_int (BITS_PER_UNIT));
1254 if (TREE_INT_CST_HIGH (size_tree) != 0)
1256 error_with_decl (decl, "size of variable `%s' is too large");
1261 name = XSTR (XEXP (DECL_RTL (decl), 0), 0);
1263 if (TREE_PUBLIC (decl) && DECL_NAME (decl)
1264 && ! first_global_object_name
1265 && ! (DECL_COMMON (decl) && (DECL_INITIAL (decl) == 0
1266 || DECL_INITIAL (decl) == error_mark_node))
1267 && ! DECL_WEAK (decl)
1268 && ! DECL_ONE_ONLY (decl))
1272 STRIP_NAME_ENCODING (p, name);
1273 first_global_object_name = permalloc (strlen (p) + 1);
1274 strcpy (first_global_object_name, p);
1277 /* Handle uninitialized definitions. */
1279 if ((DECL_INITIAL (decl) == 0 || DECL_INITIAL (decl) == error_mark_node)
1280 /* If the target can't output uninitialized but not common global data
1281 in .bss, then we have to use .data. */
1282 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
1283 && DECL_COMMON (decl)
1285 && ! dont_output_data)
1287 int size = TREE_INT_CST_LOW (size_tree);
1290 /* Don't allocate zero bytes of common,
1291 since that means "undefined external" in the linker. */
1292 if (size == 0) rounded = 1;
1293 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1294 so that each uninitialized object starts on such a boundary. */
1295 rounded += (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1;
1296 rounded = (rounded / (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
1297 * (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
1299 #ifdef DBX_DEBUGGING_INFO
1300 /* File-scope global variables are output here. */
1301 if (write_symbols == DBX_DEBUG && top_level)
1302 dbxout_symbol (decl, 0);
1304 #ifdef SDB_DEBUGGING_INFO
1305 if (write_symbols == SDB_DEBUG && top_level
1306 /* Leave initialized global vars for end of compilation;
1307 see comment in compile_file. */
1308 && (TREE_PUBLIC (decl) == 0 || DECL_INITIAL (decl) == 0))
1309 sdbout_symbol (decl, 0);
1311 #ifdef DWARF_DEBUGGING_INFO
1312 if (write_symbols == DWARF_DEBUG && top_level
1313 && DECL_CONTEXT (decl))
1314 dwarfout_file_scope_decl (decl, 0);
1316 #ifdef DWARF2_DEBUGGING_INFO
1317 if (write_symbols == DWARF2_DEBUG && top_level
1318 && DECL_CONTEXT (decl))
1319 dwarf2out_decl (decl);
1322 /* Only output DWARF debugging information for record-scope variables
1323 here. In the case of function-scope variables, the information
1324 for them is output when we do our recursive traversal of the tree
1325 representation for the entire containing function. In the case of
1326 file-scope variables, we output information for all of them at the
1327 very end of compilation while we are doing our final traversal of
1328 the chain of file-scope declarations. */
1330 #if 0 /* ??? We should either delete this or add a comment describing what
1331 it was intended to do and why we shouldn't delete it. */
1332 if (flag_shared_data)
1336 if (TREE_PUBLIC (decl)
1337 #if defined (ASM_OUTPUT_BSS) || defined (ASM_OUTPUT_ALIGNED_BSS)
1338 && DECL_COMMON (decl)
1342 #ifdef ASM_OUTPUT_SHARED_COMMON
1343 if (flag_shared_data)
1344 ASM_OUTPUT_SHARED_COMMON (asm_out_file, name, size, rounded);
1347 if (output_bytecode)
1349 BC_OUTPUT_COMMON (asm_out_file, name, size, rounded);
1353 #ifdef ASM_OUTPUT_ALIGNED_COMMON
1354 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file, name, size,
1357 ASM_OUTPUT_COMMON (asm_out_file, name, size, rounded);
1361 #if defined (ASM_OUTPUT_BSS) || defined (ASM_OUTPUT_ALIGNED_BSS)
1362 else if (TREE_PUBLIC (decl))
1364 #ifdef ASM_OUTPUT_SHARED_BSS
1365 if (flag_shared_data)
1366 ASM_OUTPUT_SHARED_BSS (asm_out_file, decl, name, size, rounded);
1369 if (output_bytecode)
1371 BC_OUTPUT_BSS (asm_out_file, name, size, rounded);
1375 #ifdef ASM_OUTPUT_ALIGNED_BSS
1376 ASM_OUTPUT_ALIGNED_BSS (asm_out_file, decl, name, size,
1379 ASM_OUTPUT_BSS (asm_out_file, decl, name, size, rounded);
1383 #endif /* ASM_OUTPUT_BSS || ASM_OUTPUT_ALIGNED_BSS */
1386 #ifdef ASM_OUTPUT_SHARED_LOCAL
1387 if (flag_shared_data)
1388 ASM_OUTPUT_SHARED_LOCAL (asm_out_file, name, size, rounded);
1391 if (output_bytecode)
1393 BC_OUTPUT_LOCAL (asm_out_file, name, size, rounded);
1397 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1398 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size,
1401 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded);
1408 /* Handle initialized definitions.
1409 Also handle uninitialized global definitions if -fno-common and the
1410 target doesn't support ASM_OUTPUT_BSS. */
1412 /* First make the assembler name(s) global if appropriate. */
1413 if (TREE_PUBLIC (decl) && DECL_NAME (decl))
1415 #ifdef ASM_WEAKEN_LABEL
1416 if (DECL_WEAK (decl))
1417 ASM_WEAKEN_LABEL (asm_out_file, name);
1420 ASM_GLOBALIZE_LABEL (asm_out_file, name);
1423 for (d = equivalents; d; d = TREE_CHAIN (d))
1425 tree e = TREE_VALUE (d);
1426 if (TREE_PUBLIC (e) && DECL_NAME (e))
1427 ASM_GLOBALIZE_LABEL (asm_out_file,
1428 XSTR (XEXP (DECL_RTL (e), 0), 0));
1432 /* Output any data that we will need to use the address of. */
1433 if (DECL_INITIAL (decl) == error_mark_node)
1434 reloc = contains_pointers_p (TREE_TYPE (decl));
1435 else if (DECL_INITIAL (decl))
1436 reloc = output_addressed_constants (DECL_INITIAL (decl));
1438 /* Switch to the appropriate section. */
1439 variable_section (decl, reloc);
1441 /* dbxout.c needs to know this. */
1442 if (in_text_section ())
1443 DECL_IN_TEXT_SECTION (decl) = 1;
1445 /* Record current section so we can restore it if dbxout.c clobbers it. */
1446 saved_in_section = in_section;
1448 /* Output the dbx info now that we have chosen the section. */
1450 #ifdef DBX_DEBUGGING_INFO
1451 /* File-scope global variables are output here. */
1452 if (write_symbols == DBX_DEBUG && top_level)
1453 dbxout_symbol (decl, 0);
1455 #ifdef SDB_DEBUGGING_INFO
1456 if (write_symbols == SDB_DEBUG && top_level
1457 /* Leave initialized global vars for end of compilation;
1458 see comment in compile_file. */
1459 && (TREE_PUBLIC (decl) == 0 || DECL_INITIAL (decl) == 0))
1460 sdbout_symbol (decl, 0);
1463 /* Don't output any DWARF debugging information for variables here.
1464 In the case of local variables, the information for them is output
1465 when we do our recursive traversal of the tree representation for
1466 the entire containing function. In the case of file-scope variables,
1467 we output information for all of them at the very end of compilation
1468 while we are doing our final traversal of the chain of file-scope
1471 /* If the debugging output changed sections, reselect the section
1472 that's supposed to be selected. */
1473 if (in_section != saved_in_section)
1474 variable_section (decl, reloc);
1476 /* Compute and output the alignment of this data. */
1478 align = DECL_ALIGN (decl);
1479 /* In the case for initialing an array whose length isn't specified,
1480 where we have not yet been able to do the layout,
1481 figure out the proper alignment now. */
1482 if (dont_output_data && DECL_SIZE (decl) == 0
1483 && TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE)
1484 align = MAX (align, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl))));
1486 /* Some object file formats have a maximum alignment which they support.
1487 In particular, a.out format supports a maximum alignment of 4. */
1488 #ifndef MAX_OFILE_ALIGNMENT
1489 #define MAX_OFILE_ALIGNMENT BIGGEST_ALIGNMENT
1491 if (align > MAX_OFILE_ALIGNMENT)
1493 warning_with_decl (decl,
1494 "alignment of `%s' is greater than maximum object file alignment");
1495 align = MAX_OFILE_ALIGNMENT;
1497 #ifdef DATA_ALIGNMENT
1498 /* On some machines, it is good to increase alignment sometimes. */
1499 align = DATA_ALIGNMENT (TREE_TYPE (decl), align);
1501 #ifdef CONSTANT_ALIGNMENT
1502 if (DECL_INITIAL (decl))
1503 align = CONSTANT_ALIGNMENT (DECL_INITIAL (decl), align);
1506 /* Reset the alignment in case we have made it tighter, so we can benefit
1507 from it in get_pointer_alignment. */
1508 DECL_ALIGN (decl) = align;
1510 if (align > BITS_PER_UNIT)
1512 if (output_bytecode)
1513 BC_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
1515 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
1518 /* Do any machine/system dependent processing of the object. */
1519 if (output_bytecode)
1520 BC_OUTPUT_LABEL (asm_out_file, name);
1523 #ifdef ASM_DECLARE_OBJECT_NAME
1524 last_assemble_variable_decl = decl;
1525 ASM_DECLARE_OBJECT_NAME (asm_out_file, name, decl);
1527 /* Standard thing is just output label for the object. */
1528 ASM_OUTPUT_LABEL (asm_out_file, name);
1529 #endif /* ASM_DECLARE_OBJECT_NAME */
1532 if (!dont_output_data)
1534 if (DECL_INITIAL (decl))
1535 /* Output the actual data. */
1536 output_constant (DECL_INITIAL (decl), TREE_INT_CST_LOW (size_tree));
1538 /* Leave space for it. */
1539 assemble_zeros (TREE_INT_CST_LOW (size_tree));
1543 #ifdef XCOFF_DEBUGGING_INFO
1544 /* Unfortunately, the IBM assembler cannot handle stabx before the actual
1545 declaration. When something like ".stabx "aa:S-2",aa,133,0" is emitted
1546 and `aa' hasn't been output yet, the assembler generates a stab entry with
1547 a value of zero, in addition to creating an unnecessary external entry
1548 for `aa'. Hence, we must postpone dbxout_symbol to here at the end. */
1550 /* File-scope global variables are output here. */
1551 if (write_symbols == XCOFF_DEBUG && top_level)
1553 saved_in_section = in_section;
1555 dbxout_symbol (decl, 0);
1557 if (in_section != saved_in_section)
1558 variable_section (decl, reloc);
1561 /* There must be a statement after a label. */
1566 /* Return 1 if type TYPE contains any pointers. */
1569 contains_pointers_p (type)
1572 switch (TREE_CODE (type))
1575 case REFERENCE_TYPE:
1576 /* I'm not sure whether OFFSET_TYPE needs this treatment,
1577 so I'll play safe and return 1. */
1583 case QUAL_UNION_TYPE:
1586 /* For a type that has fields, see if the fields have pointers. */
1587 for (fields = TYPE_FIELDS (type); fields; fields = TREE_CHAIN (fields))
1588 if (TREE_CODE (fields) == FIELD_DECL
1589 && contains_pointers_p (TREE_TYPE (fields)))
1595 /* An array type contains pointers if its element type does. */
1596 return contains_pointers_p (TREE_TYPE (type));
1603 /* Output text storage for constructor CONSTR. */
1606 bc_output_constructor (constr, size)
1612 /* Must always be a literal; non-literal constructors are handled
1615 if (!TREE_CONSTANT (constr))
1622 for (i = 0; TYPE_ALIGN (constr) >= BITS_PER_UNIT << (i + 1); i++)
1626 BC_OUTPUT_ALIGN (asm_out_file, i);
1629 output_constant (constr, size);
1632 /* Create storage for constructor CONSTR. */
1635 bc_output_data_constructor (constr)
1640 /* Put in data section */
1644 for (i = 0; TYPE_ALIGN (constr) >= BITS_PER_UNIT << (i + 1); i++);
1646 BC_OUTPUT_ALIGN (asm_out_file, i);
1648 /* The constructor is filled in at runtime. */
1649 BC_OUTPUT_SKIP (asm_out_file, int_size_in_bytes (TREE_TYPE (constr)));
1652 /* Output something to declare an external symbol to the assembler.
1653 (Most assemblers don't need this, so we normally output nothing.)
1654 Do nothing if DECL is not external. */
1657 assemble_external (decl)
1660 if (output_bytecode)
1663 #ifdef ASM_OUTPUT_EXTERNAL
1664 if (TREE_CODE_CLASS (TREE_CODE (decl)) == 'd'
1665 && DECL_EXTERNAL (decl) && TREE_PUBLIC (decl))
1667 rtx rtl = DECL_RTL (decl);
1669 if (GET_CODE (rtl) == MEM && GET_CODE (XEXP (rtl, 0)) == SYMBOL_REF
1670 && ! SYMBOL_REF_USED (XEXP (rtl, 0)))
1672 /* Some systems do require some output. */
1673 SYMBOL_REF_USED (XEXP (rtl, 0)) = 1;
1674 ASM_OUTPUT_EXTERNAL (asm_out_file, decl, XSTR (XEXP (rtl, 0), 0));
1680 /* Similar, for calling a library function FUN. */
1683 assemble_external_libcall (fun)
1686 #ifdef ASM_OUTPUT_EXTERNAL_LIBCALL
1687 if (!output_bytecode)
1689 /* Declare library function name external when first used, if nec. */
1690 if (! SYMBOL_REF_USED (fun))
1692 SYMBOL_REF_USED (fun) = 1;
1693 ASM_OUTPUT_EXTERNAL_LIBCALL (asm_out_file, fun);
1699 /* Declare the label NAME global. */
1702 assemble_global (name)
1705 ASM_GLOBALIZE_LABEL (asm_out_file, name);
1708 /* Assemble a label named NAME. */
1711 assemble_label (name)
1714 if (output_bytecode)
1715 BC_OUTPUT_LABEL (asm_out_file, name);
1717 ASM_OUTPUT_LABEL (asm_out_file, name);
1720 /* Output to FILE a reference to the assembler name of a C-level name NAME.
1721 If NAME starts with a *, the rest of NAME is output verbatim.
1722 Otherwise NAME is transformed in an implementation-defined way
1723 (usually by the addition of an underscore).
1724 Many macros in the tm file are defined to call this function. */
1727 assemble_name (file, name)
1732 int save_warn_id_clash = warn_id_clash;
1734 STRIP_NAME_ENCODING (real_name, name);
1736 /* Don't warn about an identifier name length clash on this name, since
1737 it can be a user symbol suffixed by a number. */
1739 TREE_SYMBOL_REFERENCED (get_identifier (real_name)) = 1;
1740 warn_id_clash = save_warn_id_clash;
1744 if (output_bytecode)
1745 bc_emit_labelref (name, 0);
1747 fputs (&name[1], file);
1751 if (output_bytecode)
1752 BC_OUTPUT_LABELREF (file, name);
1754 ASM_OUTPUT_LABELREF (file, name);
1758 /* Allocate SIZE bytes writable static space with a gensym name
1759 and return an RTX to refer to its address. */
1762 assemble_static_space (size)
1768 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1769 so that each uninitialized object starts on such a boundary. */
1770 int rounded = ((size + (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1)
1771 / (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
1772 * (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
1775 if (flag_shared_data)
1779 ASM_GENERATE_INTERNAL_LABEL (name, "LF", const_labelno);
1782 namestring = (char *) obstack_alloc (saveable_obstack,
1784 strcpy (namestring, name);
1786 if (output_bytecode)
1787 x = bc_gen_rtx (namestring, 0, (struct bc_label *) 0);
1789 x = gen_rtx (SYMBOL_REF, Pmode, namestring);
1791 if (output_bytecode)
1793 BC_OUTPUT_LOCAL (asm_out_file, name, size, rounded);
1797 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1798 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, BIGGEST_ALIGNMENT);
1800 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded);
1806 /* Assemble the static constant template for function entry trampolines.
1807 This is done at most once per compilation.
1808 Returns an RTX for the address of the template. */
1810 #ifdef TRAMPOLINE_TEMPLATE
1812 assemble_trampoline_template ()
1818 /* Shouldn't get here */
1819 if (output_bytecode)
1822 /* By default, put trampoline templates in read-only data section. */
1824 #ifdef TRAMPOLINE_SECTION
1825 TRAMPOLINE_SECTION ();
1827 readonly_data_section ();
1830 /* Write the assembler code to define one. */
1831 align = floor_log2 (FUNCTION_BOUNDARY / BITS_PER_UNIT);
1833 ASM_OUTPUT_ALIGN (asm_out_file, align);
1835 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LTRAMP", 0);
1836 TRAMPOLINE_TEMPLATE (asm_out_file);
1838 /* Record the rtl to refer to it. */
1839 ASM_GENERATE_INTERNAL_LABEL (label, "LTRAMP", 0);
1841 = (char *) obstack_copy0 (&permanent_obstack, label, strlen (label));
1842 return gen_rtx (SYMBOL_REF, Pmode, name);
1846 /* Assemble the integer constant X into an object of SIZE bytes.
1847 X must be either a CONST_INT or CONST_DOUBLE.
1849 Return 1 if we were able to output the constant, otherwise 0. If FORCE is
1850 non-zero, abort if we can't output the constant. */
1853 assemble_integer (x, size, force)
1858 /* First try to use the standard 1, 2, 4, 8, and 16 byte
1859 ASM_OUTPUT... macros. */
1863 #ifdef ASM_OUTPUT_CHAR
1865 ASM_OUTPUT_CHAR (asm_out_file, x);
1869 #ifdef ASM_OUTPUT_SHORT
1871 ASM_OUTPUT_SHORT (asm_out_file, x);
1875 #ifdef ASM_OUTPUT_INT
1877 ASM_OUTPUT_INT (asm_out_file, x);
1881 #ifdef ASM_OUTPUT_DOUBLE_INT
1883 ASM_OUTPUT_DOUBLE_INT (asm_out_file, x);
1887 #ifdef ASM_OUTPUT_QUADRUPLE_INT
1889 ASM_OUTPUT_QUADRUPLE_INT (asm_out_file, x);
1894 /* If we couldn't do it that way, there are two other possibilities: First,
1895 if the machine can output an explicit byte and this is a 1 byte constant,
1896 we can use ASM_OUTPUT_BYTE. */
1898 #ifdef ASM_OUTPUT_BYTE
1899 if (size == 1 && GET_CODE (x) == CONST_INT)
1901 ASM_OUTPUT_BYTE (asm_out_file, INTVAL (x));
1906 /* Finally, if SIZE is larger than a single word, try to output the constant
1907 one word at a time. */
1909 if (size > UNITS_PER_WORD)
1912 enum machine_mode mode
1913 = mode_for_size (size * BITS_PER_UNIT, MODE_INT, 0);
1916 for (i = 0; i < size / UNITS_PER_WORD; i++)
1918 word = operand_subword (x, i, 0, mode);
1923 if (! assemble_integer (word, UNITS_PER_WORD, 0))
1927 if (i == size / UNITS_PER_WORD)
1929 /* If we output at least one word and then could not finish,
1930 there is no valid way to continue. */
1941 /* Assemble the floating-point constant D into an object of size MODE. */
1944 assemble_real (d, mode)
1946 enum machine_mode mode;
1948 jmp_buf output_constant_handler;
1950 if (setjmp (output_constant_handler))
1952 error ("floating point trap outputting a constant");
1953 #ifdef REAL_IS_NOT_DOUBLE
1954 bzero ((char *) &d, sizeof d);
1961 set_float_handler (output_constant_handler);
1965 #ifdef ASM_OUTPUT_BYTE_FLOAT
1967 ASM_OUTPUT_BYTE_FLOAT (asm_out_file, d);
1970 #ifdef ASM_OUTPUT_SHORT_FLOAT
1972 ASM_OUTPUT_SHORT_FLOAT (asm_out_file, d);
1975 #ifdef ASM_OUTPUT_THREE_QUARTER_FLOAT
1977 ASM_OUTPUT_THREE_QUARTER_FLOAT (asm_out_file, d);
1980 #ifdef ASM_OUTPUT_FLOAT
1982 ASM_OUTPUT_FLOAT (asm_out_file, d);
1986 #ifdef ASM_OUTPUT_DOUBLE
1988 ASM_OUTPUT_DOUBLE (asm_out_file, d);
1992 #ifdef ASM_OUTPUT_LONG_DOUBLE
1995 ASM_OUTPUT_LONG_DOUBLE (asm_out_file, d);
2003 set_float_handler (NULL_PTR);
2006 /* Here we combine duplicate floating constants to make
2007 CONST_DOUBLE rtx's, and force those out to memory when necessary. */
2009 /* Chain of all CONST_DOUBLE rtx's constructed for the current function.
2010 They are chained through the CONST_DOUBLE_CHAIN.
2011 A CONST_DOUBLE rtx has CONST_DOUBLE_MEM != cc0_rtx iff it is on this chain.
2012 In that case, CONST_DOUBLE_MEM is either a MEM,
2013 or const0_rtx if no MEM has been made for this CONST_DOUBLE yet.
2015 (CONST_DOUBLE_MEM is used only for top-level functions.
2016 See force_const_mem for explanation.) */
2018 static rtx const_double_chain;
2020 /* Return a CONST_DOUBLE or CONST_INT for a value specified as a pair of ints.
2021 For an integer, I0 is the low-order word and I1 is the high-order word.
2022 For a real number, I0 is the word with the low address
2023 and I1 is the word with the high address. */
2026 immed_double_const (i0, i1, mode)
2027 HOST_WIDE_INT i0, i1;
2028 enum machine_mode mode;
2031 int in_current_obstack;
2033 if (GET_MODE_CLASS (mode) == MODE_INT
2034 || GET_MODE_CLASS (mode) == MODE_PARTIAL_INT)
2036 /* We clear out all bits that don't belong in MODE, unless they and our
2037 sign bit are all one. So we get either a reasonable negative value
2038 or a reasonable unsigned value for this mode. */
2039 int width = GET_MODE_BITSIZE (mode);
2040 if (width < HOST_BITS_PER_WIDE_INT
2041 && ((i0 & ((HOST_WIDE_INT) (-1) << (width - 1)))
2042 != ((HOST_WIDE_INT) (-1) << (width - 1))))
2043 i0 &= ((HOST_WIDE_INT) 1 << width) - 1, i1 = 0;
2044 else if (width == HOST_BITS_PER_WIDE_INT
2045 && ! (i1 == ~0 && i0 < 0))
2047 else if (width > 2 * HOST_BITS_PER_WIDE_INT)
2048 /* We cannot represent this value as a constant. */
2051 /* If this would be an entire word for the target, but is not for
2052 the host, then sign-extend on the host so that the number will look
2053 the same way on the host that it would on the target.
2055 For example, when building a 64 bit alpha hosted 32 bit sparc
2056 targeted compiler, then we want the 32 bit unsigned value -1 to be
2057 represented as a 64 bit value -1, and not as 0x00000000ffffffff.
2058 The later confuses the sparc backend. */
2060 if (BITS_PER_WORD < HOST_BITS_PER_WIDE_INT && BITS_PER_WORD == width
2061 && (i0 & ((HOST_WIDE_INT) 1 << (width - 1))))
2062 i0 |= ((HOST_WIDE_INT) (-1) << width);
2064 /* If MODE fits within HOST_BITS_PER_WIDE_INT, always use a CONST_INT.
2066 ??? Strictly speaking, this is wrong if we create a CONST_INT
2067 for a large unsigned constant with the size of MODE being
2068 HOST_BITS_PER_WIDE_INT and later try to interpret that constant in a
2069 wider mode. In that case we will mis-interpret it as a negative
2072 Unfortunately, the only alternative is to make a CONST_DOUBLE
2073 for any constant in any mode if it is an unsigned constant larger
2074 than the maximum signed integer in an int on the host. However,
2075 doing this will break everyone that always expects to see a CONST_INT
2076 for SImode and smaller.
2078 We have always been making CONST_INTs in this case, so nothing new
2081 if (width <= HOST_BITS_PER_WIDE_INT)
2082 i1 = (i0 < 0) ? ~0 : 0;
2084 /* If this integer fits in one word, return a CONST_INT. */
2085 if ((i1 == 0 && i0 >= 0)
2086 || (i1 == ~0 && i0 < 0))
2087 return GEN_INT (i0);
2089 /* We use VOIDmode for integers. */
2093 /* Search the chain for an existing CONST_DOUBLE with the right value.
2094 If one is found, return it. */
2096 for (r = const_double_chain; r; r = CONST_DOUBLE_CHAIN (r))
2097 if (CONST_DOUBLE_LOW (r) == i0 && CONST_DOUBLE_HIGH (r) == i1
2098 && GET_MODE (r) == mode)
2101 /* No; make a new one and add it to the chain.
2103 We may be called by an optimizer which may be discarding any memory
2104 allocated during its processing (such as combine and loop). However,
2105 we will be leaving this constant on the chain, so we cannot tolerate
2106 freed memory. So switch to saveable_obstack for this allocation
2107 and then switch back if we were in current_obstack. */
2109 push_obstacks_nochange ();
2110 rtl_in_saveable_obstack ();
2111 r = gen_rtx (CONST_DOUBLE, mode, 0, i0, i1);
2114 /* Don't touch const_double_chain in nested function; see force_const_mem.
2115 Also, don't touch it if not inside any function. */
2116 if (outer_function_chain == 0 && current_function_decl != 0)
2118 CONST_DOUBLE_CHAIN (r) = const_double_chain;
2119 const_double_chain = r;
2122 /* Store const0_rtx in mem-slot since this CONST_DOUBLE is on the chain.
2123 Actual use of mem-slot is only through force_const_mem. */
2125 CONST_DOUBLE_MEM (r) = const0_rtx;
2130 /* Return a CONST_DOUBLE for a specified `double' value
2131 and machine mode. */
2134 immed_real_const_1 (d, mode)
2136 enum machine_mode mode;
2138 union real_extract u;
2140 int in_current_obstack;
2142 /* Get the desired `double' value as a sequence of ints
2143 since that is how they are stored in a CONST_DOUBLE. */
2147 /* Detect special cases. */
2149 /* Avoid REAL_VALUES_EQUAL here in order to distinguish minus zero. */
2150 if (!bcmp ((char *) &dconst0, (char *) &d, sizeof d))
2151 return CONST0_RTX (mode);
2152 /* Check for NaN first, because some ports (specifically the i386) do not
2153 emit correct ieee-fp code by default, and thus will generate a core
2154 dump here if we pass a NaN to REAL_VALUES_EQUAL and if REAL_VALUES_EQUAL
2155 does a floating point comparison. */
2156 else if (! REAL_VALUE_ISNAN (d) && REAL_VALUES_EQUAL (dconst1, d))
2157 return CONST1_RTX (mode);
2159 if (sizeof u == 2 * sizeof (HOST_WIDE_INT))
2160 return immed_double_const (u.i[0], u.i[1], mode);
2162 /* The rest of this function handles the case where
2163 a float value requires more than 2 ints of space.
2164 It will be deleted as dead code on machines that don't need it. */
2166 /* Search the chain for an existing CONST_DOUBLE with the right value.
2167 If one is found, return it. */
2169 for (r = const_double_chain; r; r = CONST_DOUBLE_CHAIN (r))
2170 if (! bcmp ((char *) &CONST_DOUBLE_LOW (r), (char *) &u, sizeof u)
2171 && GET_MODE (r) == mode)
2174 /* No; make a new one and add it to the chain.
2176 We may be called by an optimizer which may be discarding any memory
2177 allocated during its processing (such as combine and loop). However,
2178 we will be leaving this constant on the chain, so we cannot tolerate
2179 freed memory. So switch to saveable_obstack for this allocation
2180 and then switch back if we were in current_obstack. */
2182 push_obstacks_nochange ();
2183 rtl_in_saveable_obstack ();
2184 r = rtx_alloc (CONST_DOUBLE);
2186 bcopy ((char *) &u, (char *) &CONST_DOUBLE_LOW (r), sizeof u);
2189 /* Don't touch const_double_chain in nested function; see force_const_mem.
2190 Also, don't touch it if not inside any function. */
2191 if (outer_function_chain == 0 && current_function_decl != 0)
2193 CONST_DOUBLE_CHAIN (r) = const_double_chain;
2194 const_double_chain = r;
2197 /* Store const0_rtx in CONST_DOUBLE_MEM since this CONST_DOUBLE is on the
2198 chain, but has not been allocated memory. Actual use of CONST_DOUBLE_MEM
2199 is only through force_const_mem. */
2201 CONST_DOUBLE_MEM (r) = const0_rtx;
2206 /* Return a CONST_DOUBLE rtx for a value specified by EXP,
2207 which must be a REAL_CST tree node. */
2210 immed_real_const (exp)
2213 return immed_real_const_1 (TREE_REAL_CST (exp), TYPE_MODE (TREE_TYPE (exp)));
2216 /* At the end of a function, forget the memory-constants
2217 previously made for CONST_DOUBLEs. Mark them as not on real_constant_chain.
2218 Also clear out real_constant_chain and clear out all the chain-pointers. */
2221 clear_const_double_mem ()
2223 register rtx r, next;
2225 /* Don't touch CONST_DOUBLE_MEM for nested functions.
2226 See force_const_mem for explanation. */
2227 if (outer_function_chain != 0)
2230 for (r = const_double_chain; r; r = next)
2232 next = CONST_DOUBLE_CHAIN (r);
2233 CONST_DOUBLE_CHAIN (r) = 0;
2234 CONST_DOUBLE_MEM (r) = cc0_rtx;
2236 const_double_chain = 0;
2239 /* Given an expression EXP with a constant value,
2240 reduce it to the sum of an assembler symbol and an integer.
2241 Store them both in the structure *VALUE.
2242 Abort if EXP does not reduce. */
2247 HOST_WIDE_INT offset;
2251 decode_addr_const (exp, value)
2253 struct addr_const *value;
2255 register tree target = TREE_OPERAND (exp, 0);
2256 register int offset = 0;
2261 if (TREE_CODE (target) == COMPONENT_REF
2262 && (TREE_CODE (DECL_FIELD_BITPOS (TREE_OPERAND (target, 1)))
2265 offset += TREE_INT_CST_LOW (DECL_FIELD_BITPOS (TREE_OPERAND (target, 1))) / BITS_PER_UNIT;
2266 target = TREE_OPERAND (target, 0);
2268 else if (TREE_CODE (target) == ARRAY_REF)
2270 if (TREE_CODE (TREE_OPERAND (target, 1)) != INTEGER_CST
2271 || TREE_CODE (TYPE_SIZE (TREE_TYPE (target))) != INTEGER_CST)
2273 offset += ((TREE_INT_CST_LOW (TYPE_SIZE (TREE_TYPE (target)))
2274 * TREE_INT_CST_LOW (TREE_OPERAND (target, 1)))
2276 target = TREE_OPERAND (target, 0);
2282 switch (TREE_CODE (target))
2286 x = DECL_RTL (target);
2290 if (output_bytecode)
2291 /* FIXME: this may not be correct, check it */
2292 x = bc_gen_rtx (TREE_STRING_POINTER (target), 0, (struct bc_label *) 0);
2294 x = gen_rtx (MEM, FUNCTION_MODE,
2295 gen_rtx (LABEL_REF, VOIDmode,
2296 label_rtx (TREE_OPERAND (exp, 0))));
2304 x = TREE_CST_RTL (target);
2311 if (!output_bytecode)
2313 if (GET_CODE (x) != MEM)
2319 value->offset = offset;
2322 /* Uniquize all constants that appear in memory.
2323 Each constant in memory thus far output is recorded
2324 in `const_hash_table' with a `struct constant_descriptor'
2325 that contains a polish representation of the value of
2328 We cannot store the trees in the hash table
2329 because the trees may be temporary. */
2331 struct constant_descriptor
2333 struct constant_descriptor *next;
2339 #define MAX_HASH_TABLE 1009
2340 static struct constant_descriptor *const_hash_table[MAX_HASH_TABLE];
2342 /* Compute a hash code for a constant expression. */
2349 register int len, hi, i;
2350 register enum tree_code code = TREE_CODE (exp);
2352 if (code == INTEGER_CST)
2354 p = (char *) &TREE_INT_CST_LOW (exp);
2355 len = 2 * sizeof TREE_INT_CST_LOW (exp);
2357 else if (code == REAL_CST)
2359 p = (char *) &TREE_REAL_CST (exp);
2360 len = sizeof TREE_REAL_CST (exp);
2362 else if (code == STRING_CST)
2363 p = TREE_STRING_POINTER (exp), len = TREE_STRING_LENGTH (exp);
2364 else if (code == COMPLEX_CST)
2365 return const_hash (TREE_REALPART (exp)) * 5
2366 + const_hash (TREE_IMAGPART (exp));
2367 else if (code == CONSTRUCTOR && TREE_CODE (TREE_TYPE (exp)) == SET_TYPE)
2369 len = int_size_in_bytes (TREE_TYPE (exp));
2370 p = (char *) alloca (len);
2371 get_set_constructor_bytes (exp, (unsigned char *) p, len);
2373 else if (code == CONSTRUCTOR)
2377 /* For record type, include the type in the hashing.
2378 We do not do so for array types
2379 because (1) the sizes of the elements are sufficient
2380 and (2) distinct array types can have the same constructor.
2381 Instead, we include the array size because the constructor could
2383 if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE)
2384 hi = ((HOST_WIDE_INT) TREE_TYPE (exp) & ((1 << HASHBITS) - 1))
2387 hi = ((5 + int_size_in_bytes (TREE_TYPE (exp)))
2388 & ((1 << HASHBITS) - 1)) % MAX_HASH_TABLE;
2390 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
2391 if (TREE_VALUE (link))
2392 hi = (hi * 603 + const_hash (TREE_VALUE (link))) % MAX_HASH_TABLE;
2396 else if (code == ADDR_EXPR)
2398 struct addr_const value;
2399 decode_addr_const (exp, &value);
2400 if (GET_CODE (value.base) == SYMBOL_REF)
2402 /* Don't hash the address of the SYMBOL_REF;
2403 only use the offset and the symbol name. */
2405 p = XSTR (value.base, 0);
2406 for (i = 0; p[i] != 0; i++)
2407 hi = ((hi * 613) + (unsigned) (p[i]));
2409 else if (GET_CODE (value.base) == LABEL_REF)
2410 hi = value.offset + CODE_LABEL_NUMBER (XEXP (value.base, 0)) * 13;
2412 hi &= (1 << HASHBITS) - 1;
2413 hi %= MAX_HASH_TABLE;
2416 else if (code == PLUS_EXPR || code == MINUS_EXPR)
2417 return const_hash (TREE_OPERAND (exp, 0)) * 9
2418 + const_hash (TREE_OPERAND (exp, 1));
2419 else if (code == NOP_EXPR || code == CONVERT_EXPR)
2420 return const_hash (TREE_OPERAND (exp, 0)) * 7 + 2;
2422 /* Compute hashing function */
2424 for (i = 0; i < len; i++)
2425 hi = ((hi * 613) + (unsigned) (p[i]));
2427 hi &= (1 << HASHBITS) - 1;
2428 hi %= MAX_HASH_TABLE;
2432 /* Compare a constant expression EXP with a constant-descriptor DESC.
2433 Return 1 if DESC describes a constant with the same value as EXP. */
2436 compare_constant (exp, desc)
2438 struct constant_descriptor *desc;
2440 return 0 != compare_constant_1 (exp, desc->contents);
2443 /* Compare constant expression EXP with a substring P of a constant descriptor.
2444 If they match, return a pointer to the end of the substring matched.
2445 If they do not match, return 0.
2447 Since descriptors are written in polish prefix notation,
2448 this function can be used recursively to test one operand of EXP
2449 against a subdescriptor, and if it succeeds it returns the
2450 address of the subdescriptor for the next operand. */
2453 compare_constant_1 (exp, p)
2457 register char *strp;
2459 register enum tree_code code = TREE_CODE (exp);
2461 if (code != (enum tree_code) *p++)
2464 if (code == INTEGER_CST)
2466 /* Integer constants are the same only if the same width of type. */
2467 if (*p++ != TYPE_PRECISION (TREE_TYPE (exp)))
2469 strp = (char *) &TREE_INT_CST_LOW (exp);
2470 len = 2 * sizeof TREE_INT_CST_LOW (exp);
2472 else if (code == REAL_CST)
2474 /* Real constants are the same only if the same width of type. */
2475 if (*p++ != TYPE_PRECISION (TREE_TYPE (exp)))
2477 strp = (char *) &TREE_REAL_CST (exp);
2478 len = sizeof TREE_REAL_CST (exp);
2480 else if (code == STRING_CST)
2482 if (flag_writable_strings)
2484 strp = TREE_STRING_POINTER (exp);
2485 len = TREE_STRING_LENGTH (exp);
2486 if (bcmp ((char *) &TREE_STRING_LENGTH (exp), p,
2487 sizeof TREE_STRING_LENGTH (exp)))
2489 p += sizeof TREE_STRING_LENGTH (exp);
2491 else if (code == COMPLEX_CST)
2493 p = compare_constant_1 (TREE_REALPART (exp), p);
2494 if (p == 0) return 0;
2495 p = compare_constant_1 (TREE_IMAGPART (exp), p);
2498 else if (code == CONSTRUCTOR && TREE_CODE (TREE_TYPE (exp)) == SET_TYPE)
2500 int xlen = len = int_size_in_bytes (TREE_TYPE (exp));
2501 strp = (char *) alloca (len);
2502 get_set_constructor_bytes (exp, (unsigned char *) strp, len);
2503 if (bcmp ((char *) &xlen, p, sizeof xlen))
2507 else if (code == CONSTRUCTOR)
2510 int length = list_length (CONSTRUCTOR_ELTS (exp));
2513 if (bcmp ((char *) &length, p, sizeof length))
2517 /* For record constructors, insist that the types match.
2518 For arrays, just verify both constructors are for arrays. */
2519 if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE)
2520 type = TREE_TYPE (exp);
2523 if (bcmp ((char *) &type, p, sizeof type))
2527 /* For arrays, insist that the size in bytes match. */
2528 if (TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE)
2530 int size = int_size_in_bytes (TREE_TYPE (exp));
2531 if (bcmp ((char *) &size, p, sizeof size))
2536 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
2538 if (TREE_VALUE (link))
2540 if ((p = compare_constant_1 (TREE_VALUE (link), p)) == 0)
2547 if (bcmp ((char *) &zero, p, sizeof zero))
2555 else if (code == ADDR_EXPR)
2557 struct addr_const value;
2558 decode_addr_const (exp, &value);
2559 strp = (char *) &value.offset;
2560 len = sizeof value.offset;
2561 /* Compare the offset. */
2563 if (*p++ != *strp++)
2565 /* Compare symbol name. */
2566 strp = XSTR (value.base, 0);
2567 len = strlen (strp) + 1;
2569 else if (code == PLUS_EXPR || code == MINUS_EXPR)
2571 p = compare_constant_1 (TREE_OPERAND (exp, 0), p);
2572 if (p == 0) return 0;
2573 p = compare_constant_1 (TREE_OPERAND (exp, 1), p);
2576 else if (code == NOP_EXPR || code == CONVERT_EXPR)
2578 p = compare_constant_1 (TREE_OPERAND (exp, 0), p);
2582 /* Compare constant contents. */
2584 if (*p++ != *strp++)
2590 /* Construct a constant descriptor for the expression EXP.
2591 It is up to the caller to enter the descriptor in the hash table. */
2593 static struct constant_descriptor *
2594 record_constant (exp)
2597 struct constant_descriptor *next = 0;
2600 /* Make a struct constant_descriptor. The first two pointers will
2601 be filled in later. Here we just leave space for them. */
2603 obstack_grow (&permanent_obstack, (char *) &next, sizeof next);
2604 obstack_grow (&permanent_obstack, (char *) &label, sizeof label);
2605 record_constant_1 (exp);
2606 return (struct constant_descriptor *) obstack_finish (&permanent_obstack);
2609 /* Add a description of constant expression EXP
2610 to the object growing in `permanent_obstack'.
2611 No need to return its address; the caller will get that
2612 from the obstack when the object is complete. */
2615 record_constant_1 (exp)
2618 register char *strp;
2620 register enum tree_code code = TREE_CODE (exp);
2622 obstack_1grow (&permanent_obstack, (unsigned int) code);
2627 obstack_1grow (&permanent_obstack, TYPE_PRECISION (TREE_TYPE (exp)));
2628 strp = (char *) &TREE_INT_CST_LOW (exp);
2629 len = 2 * sizeof TREE_INT_CST_LOW (exp);
2633 obstack_1grow (&permanent_obstack, TYPE_PRECISION (TREE_TYPE (exp)));
2634 strp = (char *) &TREE_REAL_CST (exp);
2635 len = sizeof TREE_REAL_CST (exp);
2639 if (flag_writable_strings)
2642 strp = TREE_STRING_POINTER (exp);
2643 len = TREE_STRING_LENGTH (exp);
2644 obstack_grow (&permanent_obstack, (char *) &TREE_STRING_LENGTH (exp),
2645 sizeof TREE_STRING_LENGTH (exp));
2649 record_constant_1 (TREE_REALPART (exp));
2650 record_constant_1 (TREE_IMAGPART (exp));
2654 if (TREE_CODE (TREE_TYPE (exp)) == SET_TYPE)
2656 int nbytes = int_size_in_bytes (TREE_TYPE (exp));
2657 obstack_grow (&permanent_obstack, &nbytes, sizeof (nbytes));
2658 obstack_blank (&permanent_obstack, nbytes);
2659 get_set_constructor_bytes
2660 (exp, (unsigned char *) permanent_obstack.next_free-nbytes,
2667 int length = list_length (CONSTRUCTOR_ELTS (exp));
2670 obstack_grow (&permanent_obstack, (char *) &length, sizeof length);
2672 /* For record constructors, insist that the types match.
2673 For arrays, just verify both constructors are for arrays. */
2674 if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE)
2675 type = TREE_TYPE (exp);
2678 obstack_grow (&permanent_obstack, (char *) &type, sizeof type);
2680 /* For arrays, insist that the size in bytes match. */
2681 if (TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE)
2683 int size = int_size_in_bytes (TREE_TYPE (exp));
2684 obstack_grow (&permanent_obstack, (char *) &size, sizeof size);
2687 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
2689 if (TREE_VALUE (link))
2690 record_constant_1 (TREE_VALUE (link));
2695 obstack_grow (&permanent_obstack,
2696 (char *) &zero, sizeof zero);
2704 struct addr_const value;
2706 decode_addr_const (exp, &value);
2707 /* Record the offset. */
2708 obstack_grow (&permanent_obstack,
2709 (char *) &value.offset, sizeof value.offset);
2710 /* Record the symbol name. */
2711 obstack_grow (&permanent_obstack, XSTR (value.base, 0),
2712 strlen (XSTR (value.base, 0)) + 1);
2718 record_constant_1 (TREE_OPERAND (exp, 0));
2719 record_constant_1 (TREE_OPERAND (exp, 1));
2724 case NON_LVALUE_EXPR:
2725 record_constant_1 (TREE_OPERAND (exp, 0));
2732 /* Record constant contents. */
2733 obstack_grow (&permanent_obstack, strp, len);
2736 /* Record a list of constant expressions that were passed to
2737 output_constant_def but that could not be output right away. */
2739 struct deferred_constant
2741 struct deferred_constant *next;
2747 static struct deferred_constant *deferred_constants;
2749 /* Nonzero means defer output of addressed subconstants
2750 (i.e., those for which output_constant_def is called.) */
2751 static int defer_addressed_constants_flag;
2753 /* Start deferring output of subconstants. */
2756 defer_addressed_constants ()
2758 defer_addressed_constants_flag++;
2761 /* Stop deferring output of subconstants,
2762 and output now all those that have been deferred. */
2765 output_deferred_addressed_constants ()
2767 struct deferred_constant *p, *next;
2769 defer_addressed_constants_flag--;
2771 if (defer_addressed_constants_flag > 0)
2774 for (p = deferred_constants; p; p = next)
2776 output_constant_def_contents (p->exp, p->reloc, p->labelno);
2781 deferred_constants = 0;
2784 /* Make a copy of the whole tree structure for a constant.
2785 This handles the same types of nodes that compare_constant
2786 and record_constant handle. */
2792 switch (TREE_CODE (exp))
2795 /* For ADDR_EXPR, we do not want to copy the decl whose address
2796 is requested. We do want to copy constants though. */
2797 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, 0))) == 'c')
2798 return build1 (TREE_CODE (exp), TREE_TYPE (exp),
2799 copy_constant (TREE_OPERAND (exp, 0)));
2801 return copy_node (exp);
2806 return copy_node (exp);
2809 return build_complex (TREE_TYPE (exp),
2810 copy_constant (TREE_REALPART (exp)),
2811 copy_constant (TREE_IMAGPART (exp)));
2815 return build (TREE_CODE (exp), TREE_TYPE (exp),
2816 copy_constant (TREE_OPERAND (exp, 0)),
2817 copy_constant (TREE_OPERAND (exp, 1)));
2821 return build1 (TREE_CODE (exp), TREE_TYPE (exp),
2822 copy_constant (TREE_OPERAND (exp, 0)));
2826 tree copy = copy_node (exp);
2827 tree list = copy_list (CONSTRUCTOR_ELTS (exp));
2830 CONSTRUCTOR_ELTS (copy) = list;
2831 for (tail = list; tail; tail = TREE_CHAIN (tail))
2832 TREE_VALUE (tail) = copy_constant (TREE_VALUE (tail));
2833 if (TREE_CODE (TREE_TYPE (exp)) == SET_TYPE)
2834 for (tail = list; tail; tail = TREE_CHAIN (tail))
2835 TREE_PURPOSE (tail) = copy_constant (TREE_PURPOSE (tail));
2845 /* Return an rtx representing a reference to constant data in memory
2846 for the constant expression EXP.
2848 If assembler code for such a constant has already been output,
2849 return an rtx to refer to it.
2850 Otherwise, output such a constant in memory (or defer it for later)
2851 and generate an rtx for it.
2853 The TREE_CST_RTL of EXP is set up to point to that rtx.
2854 The const_hash_table records which constants already have label strings. */
2857 output_constant_def (exp)
2861 register struct constant_descriptor *desc;
2867 if (TREE_CST_RTL (exp))
2868 return TREE_CST_RTL (exp);
2870 /* Make sure any other constants whose addresses appear in EXP
2871 are assigned label numbers. */
2873 reloc = output_addressed_constants (exp);
2875 /* Compute hash code of EXP. Search the descriptors for that hash code
2876 to see if any of them describes EXP. If yes, the descriptor records
2877 the label number already assigned. */
2879 hash = const_hash (exp) % MAX_HASH_TABLE;
2881 for (desc = const_hash_table[hash]; desc; desc = desc->next)
2882 if (compare_constant (exp, desc))
2884 found = desc->label;
2890 /* No constant equal to EXP is known to have been output.
2891 Make a constant descriptor to enter EXP in the hash table.
2892 Assign the label number and record it in the descriptor for
2893 future calls to this function to find. */
2895 /* Create a string containing the label name, in LABEL. */
2896 ASM_GENERATE_INTERNAL_LABEL (label, "LC", const_labelno);
2898 desc = record_constant (exp);
2899 desc->next = const_hash_table[hash];
2901 = (char *) obstack_copy0 (&permanent_obstack, label, strlen (label));
2902 const_hash_table[hash] = desc;
2906 /* Create a string containing the label name, in LABEL. */
2907 ASM_GENERATE_INTERNAL_LABEL (label, "LC", const_labelno);
2910 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
2912 push_obstacks_nochange ();
2913 if (TREE_PERMANENT (exp))
2914 end_temporary_allocation ();
2916 def = gen_rtx (SYMBOL_REF, Pmode, desc->label);
2919 = gen_rtx (MEM, TYPE_MODE (TREE_TYPE (exp)), def);
2920 RTX_UNCHANGING_P (TREE_CST_RTL (exp)) = 1;
2921 if (AGGREGATE_TYPE_P (TREE_TYPE (exp)))
2922 MEM_IN_STRUCT_P (TREE_CST_RTL (exp)) = 1;
2926 /* Optionally set flags or add text to the name to record information
2927 such as that it is a function name. If the name is changed, the macro
2928 ASM_OUTPUT_LABELREF will have to know how to strip this information. */
2929 #ifdef ENCODE_SECTION_INFO
2930 ENCODE_SECTION_INFO (exp);
2933 /* If this is the first time we've seen this particular constant,
2934 output it (or defer its output for later). */
2937 if (defer_addressed_constants_flag)
2939 struct deferred_constant *p;
2940 p = (struct deferred_constant *) xmalloc (sizeof (struct deferred_constant));
2942 push_obstacks_nochange ();
2943 suspend_momentary ();
2944 p->exp = copy_constant (exp);
2947 p->labelno = const_labelno++;
2948 p->next = deferred_constants;
2949 deferred_constants = p;
2952 output_constant_def_contents (exp, reloc, const_labelno++);
2955 return TREE_CST_RTL (exp);
2958 /* Now output assembler code to define the label for EXP,
2959 and follow it with the data of EXP. */
2962 output_constant_def_contents (exp, reloc, labelno)
2969 if (IN_NAMED_SECTION (exp))
2970 named_section (exp, NULL);
2973 /* First switch to text section, except for writable strings. */
2974 #ifdef SELECT_SECTION
2975 SELECT_SECTION (exp, reloc);
2977 if (((TREE_CODE (exp) == STRING_CST) && flag_writable_strings)
2978 || (flag_pic && reloc))
2981 readonly_data_section ();
2985 /* Align the location counter as required by EXP's data type. */
2986 align = TYPE_ALIGN (TREE_TYPE (exp));
2987 #ifdef CONSTANT_ALIGNMENT
2988 align = CONSTANT_ALIGNMENT (exp, align);
2991 if (align > BITS_PER_UNIT)
2993 if (!output_bytecode)
2995 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
2999 BC_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
3003 /* Output the label itself. */
3004 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LC", labelno);
3006 /* Output the value of EXP. */
3007 output_constant (exp,
3008 (TREE_CODE (exp) == STRING_CST
3009 ? TREE_STRING_LENGTH (exp)
3010 : int_size_in_bytes (TREE_TYPE (exp))));
3014 /* Similar hash facility for making memory-constants
3015 from constant rtl-expressions. It is used on RISC machines
3016 where immediate integer arguments and constant addresses are restricted
3017 so that such constants must be stored in memory.
3019 This pool of constants is reinitialized for each function
3020 so each function gets its own constants-pool that comes right before it.
3022 All structures allocated here are discarded when functions are saved for
3023 inlining, so they do not need to be allocated permanently. */
3025 #define MAX_RTX_HASH_TABLE 61
3026 static struct constant_descriptor **const_rtx_hash_table;
3028 /* Structure to represent sufficient information about a constant so that
3029 it can be output when the constant pool is output, so that function
3030 integration can be done, and to simplify handling on machines that reference
3031 constant pool as base+displacement. */
3033 struct pool_constant
3035 struct constant_descriptor *desc;
3036 struct pool_constant *next;
3037 enum machine_mode mode;
3044 /* Pointers to first and last constant in pool. */
3046 static struct pool_constant *first_pool, *last_pool;
3048 /* Current offset in constant pool (does not include any machine-specific
3051 static int pool_offset;
3053 /* Structure used to maintain hash table mapping symbols used to their
3054 corresponding constants. */
3059 struct pool_constant *pool;
3060 struct pool_sym *next;
3063 static struct pool_sym **const_rtx_sym_hash_table;
3065 /* Hash code for a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true.
3066 The argument is XSTR (... , 0) */
3068 #define SYMHASH(LABEL) \
3069 ((((HOST_WIDE_INT) (LABEL)) & ((1 << HASHBITS) - 1)) % MAX_RTX_HASH_TABLE)
3071 /* Initialize constant pool hashing for next function. */
3074 init_const_rtx_hash_table ()
3076 const_rtx_hash_table
3077 = ((struct constant_descriptor **)
3078 oballoc (MAX_RTX_HASH_TABLE * sizeof (struct constant_descriptor *)));
3079 const_rtx_sym_hash_table
3080 = ((struct pool_sym **)
3081 oballoc (MAX_RTX_HASH_TABLE * sizeof (struct pool_sym *)));
3082 bzero ((char *) const_rtx_hash_table,
3083 MAX_RTX_HASH_TABLE * sizeof (struct constant_descriptor *));
3084 bzero ((char *) const_rtx_sym_hash_table,
3085 MAX_RTX_HASH_TABLE * sizeof (struct pool_sym *));
3087 first_pool = last_pool = 0;
3091 /* Save and restore status for a nested function. */
3094 save_varasm_status (p)
3097 p->const_rtx_hash_table = const_rtx_hash_table;
3098 p->const_rtx_sym_hash_table = const_rtx_sym_hash_table;
3099 p->first_pool = first_pool;
3100 p->last_pool = last_pool;
3101 p->pool_offset = pool_offset;
3105 restore_varasm_status (p)
3108 const_rtx_hash_table = p->const_rtx_hash_table;
3109 const_rtx_sym_hash_table = p->const_rtx_sym_hash_table;
3110 first_pool = p->first_pool;
3111 last_pool = p->last_pool;
3112 pool_offset = p->pool_offset;
3115 enum kind { RTX_DOUBLE, RTX_INT };
3119 #ifdef ONLY_INT_FIELDS
3120 unsigned int kind : 16;
3121 unsigned int mode : 16;
3123 enum kind kind : 16;
3124 enum machine_mode mode : 16;
3127 union real_extract du;
3128 struct addr_const addr;
3129 struct {HOST_WIDE_INT high, low;} di;
3133 /* Express an rtx for a constant integer (perhaps symbolic)
3134 as the sum of a symbol or label plus an explicit integer.
3135 They are stored into VALUE. */
3138 decode_rtx_const (mode, x, value)
3139 enum machine_mode mode;
3141 struct rtx_const *value;
3143 /* Clear the whole structure, including any gaps. */
3146 int *p = (int *) value;
3147 int *end = (int *) (value + 1);
3152 value->kind = RTX_INT; /* Most usual kind. */
3155 switch (GET_CODE (x))
3158 value->kind = RTX_DOUBLE;
3159 if (GET_MODE (x) != VOIDmode)
3161 value->mode = GET_MODE (x);
3162 bcopy ((char *) &CONST_DOUBLE_LOW (x),
3163 (char *) &value->un.du, sizeof value->un.du);
3167 value->un.di.low = CONST_DOUBLE_LOW (x);
3168 value->un.di.high = CONST_DOUBLE_HIGH (x);
3173 value->un.addr.offset = INTVAL (x);
3179 value->un.addr.base = x;
3184 if (GET_CODE (x) == PLUS)
3186 value->un.addr.base = XEXP (x, 0);
3187 if (GET_CODE (XEXP (x, 1)) != CONST_INT)
3189 value->un.addr.offset = INTVAL (XEXP (x, 1));
3191 else if (GET_CODE (x) == MINUS)
3193 value->un.addr.base = XEXP (x, 0);
3194 if (GET_CODE (XEXP (x, 1)) != CONST_INT)
3196 value->un.addr.offset = - INTVAL (XEXP (x, 1));
3206 if (value->kind == RTX_INT && value->un.addr.base != 0)
3207 switch (GET_CODE (value->un.addr.base))
3211 /* Use the string's address, not the SYMBOL_REF's address,
3212 for the sake of addresses of library routines.
3213 For a LABEL_REF, compare labels. */
3214 value->un.addr.base = XEXP (value->un.addr.base, 0);
3218 /* Given a MINUS expression, simplify it if both sides
3219 include the same symbol. */
3222 simplify_subtraction (x)
3225 struct rtx_const val0, val1;
3227 decode_rtx_const (GET_MODE (x), XEXP (x, 0), &val0);
3228 decode_rtx_const (GET_MODE (x), XEXP (x, 1), &val1);
3230 if (val0.un.addr.base == val1.un.addr.base)
3231 return GEN_INT (val0.un.addr.offset - val1.un.addr.offset);
3235 /* Compute a hash code for a constant RTL expression. */
3238 const_hash_rtx (mode, x)
3239 enum machine_mode mode;
3244 struct rtx_const value;
3245 decode_rtx_const (mode, x, &value);
3247 /* Compute hashing function */
3249 for (i = 0; i < sizeof value / sizeof (int); i++)
3250 hi += ((int *) &value)[i];
3252 hi &= (1 << HASHBITS) - 1;
3253 hi %= MAX_RTX_HASH_TABLE;
3257 /* Compare a constant rtl object X with a constant-descriptor DESC.
3258 Return 1 if DESC describes a constant with the same value as X. */
3261 compare_constant_rtx (mode, x, desc)
3262 enum machine_mode mode;
3264 struct constant_descriptor *desc;
3266 register int *p = (int *) desc->contents;
3269 struct rtx_const value;
3271 decode_rtx_const (mode, x, &value);
3272 strp = (int *) &value;
3273 len = sizeof value / sizeof (int);
3275 /* Compare constant contents. */
3277 if (*p++ != *strp++)
3283 /* Construct a constant descriptor for the rtl-expression X.
3284 It is up to the caller to enter the descriptor in the hash table. */
3286 static struct constant_descriptor *
3287 record_constant_rtx (mode, x)
3288 enum machine_mode mode;
3291 struct constant_descriptor *ptr;
3293 struct rtx_const value;
3295 decode_rtx_const (mode, x, &value);
3297 /* Put these things in the saveable obstack so we can ensure it won't
3298 be freed if we are called from combine or some other phase that discards
3299 memory allocated from function_obstack (current_obstack). */
3300 obstack_grow (saveable_obstack, &ptr, sizeof ptr);
3301 obstack_grow (saveable_obstack, &label, sizeof label);
3303 /* Record constant contents. */
3304 obstack_grow (saveable_obstack, &value, sizeof value);
3306 return (struct constant_descriptor *) obstack_finish (saveable_obstack);
3309 /* Given a constant rtx X, make (or find) a memory constant for its value
3310 and return a MEM rtx to refer to it in memory. */
3313 force_const_mem (mode, x)
3314 enum machine_mode mode;
3318 register struct constant_descriptor *desc;
3323 /* If we want this CONST_DOUBLE in the same mode as it is in memory
3324 (this will always be true for floating CONST_DOUBLEs that have been
3325 placed in memory, but not for VOIDmode (integer) CONST_DOUBLEs),
3326 use the previous copy. Otherwise, make a new one. Note that in
3327 the unlikely event that this same CONST_DOUBLE is used in two different
3328 modes in an alternating fashion, we will allocate a lot of different
3329 memory locations, but this should be extremely rare. */
3331 /* Don't use CONST_DOUBLE_MEM in a nested function.
3332 Nested functions have their own constant pools,
3333 so they can't share the same values in CONST_DOUBLE_MEM
3334 with the containing function. */
3335 if (outer_function_chain == 0)
3336 if (GET_CODE (x) == CONST_DOUBLE
3337 && GET_CODE (CONST_DOUBLE_MEM (x)) == MEM
3338 && GET_MODE (CONST_DOUBLE_MEM (x)) == mode)
3339 return CONST_DOUBLE_MEM (x);
3341 /* Compute hash code of X. Search the descriptors for that hash code
3342 to see if any of them describes X. If yes, the descriptor records
3343 the label number already assigned. */
3345 hash = const_hash_rtx (mode, x);
3347 for (desc = const_rtx_hash_table[hash]; desc; desc = desc->next)
3348 if (compare_constant_rtx (mode, x, desc))
3350 found = desc->label;
3356 register struct pool_constant *pool;
3357 register struct pool_sym *sym;
3360 /* No constant equal to X is known to have been output.
3361 Make a constant descriptor to enter X in the hash table.
3362 Assign the label number and record it in the descriptor for
3363 future calls to this function to find. */
3365 desc = record_constant_rtx (mode, x);
3366 desc->next = const_rtx_hash_table[hash];
3367 const_rtx_hash_table[hash] = desc;
3369 /* Align the location counter as required by EXP's data type. */
3370 align = (mode == VOIDmode) ? UNITS_PER_WORD : GET_MODE_SIZE (mode);
3371 if (align > BIGGEST_ALIGNMENT / BITS_PER_UNIT)
3372 align = BIGGEST_ALIGNMENT / BITS_PER_UNIT;
3374 pool_offset += align - 1;
3375 pool_offset &= ~ (align - 1);
3377 /* If RTL is not being placed into the saveable obstack, make a
3378 copy of X that is in the saveable obstack in case we are being
3379 called from combine or some other phase that discards memory
3380 it allocates. We need only do this if it is a CONST, since
3381 no other RTX should be allocated in this situation. */
3382 if (rtl_obstack != saveable_obstack
3383 && GET_CODE (x) == CONST)
3385 push_obstacks_nochange ();
3386 rtl_in_saveable_obstack ();
3388 x = gen_rtx (CONST, GET_MODE (x),
3389 gen_rtx (PLUS, GET_MODE (x),
3390 XEXP (XEXP (x, 0), 0), XEXP (XEXP (x, 0), 1)));
3394 /* Allocate a pool constant descriptor, fill it in, and chain it in. */
3396 pool = (struct pool_constant *) savealloc (sizeof (struct pool_constant));
3400 pool->labelno = const_labelno;
3401 pool->align = align;
3402 pool->offset = pool_offset;
3408 last_pool->next = pool;
3411 pool_offset += GET_MODE_SIZE (mode);
3413 /* Create a string containing the label name, in LABEL. */
3414 ASM_GENERATE_INTERNAL_LABEL (label, "LC", const_labelno);
3419 = (char *) obstack_copy0 (saveable_obstack, label, strlen (label));
3421 /* Add label to symbol hash table. */
3422 hash = SYMHASH (found);
3423 sym = (struct pool_sym *) savealloc (sizeof (struct pool_sym));
3426 sym->next = const_rtx_sym_hash_table[hash];
3427 const_rtx_sym_hash_table[hash] = sym;
3430 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
3432 def = gen_rtx (MEM, mode, gen_rtx (SYMBOL_REF, Pmode, found));
3434 RTX_UNCHANGING_P (def) = 1;
3435 /* Mark the symbol_ref as belonging to this constants pool. */
3436 CONSTANT_POOL_ADDRESS_P (XEXP (def, 0)) = 1;
3437 current_function_uses_const_pool = 1;
3439 if (outer_function_chain == 0)
3440 if (GET_CODE (x) == CONST_DOUBLE)
3442 if (CONST_DOUBLE_MEM (x) == cc0_rtx)
3444 CONST_DOUBLE_CHAIN (x) = const_double_chain;
3445 const_double_chain = x;
3447 CONST_DOUBLE_MEM (x) = def;
3453 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
3454 the corresponding pool_constant structure. */
3456 static struct pool_constant *
3457 find_pool_constant (addr)
3460 struct pool_sym *sym;
3461 char *label = XSTR (addr, 0);
3463 for (sym = const_rtx_sym_hash_table[SYMHASH (label)]; sym; sym = sym->next)
3464 if (sym->label == label)
3470 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
3473 get_pool_constant (addr)
3476 return (find_pool_constant (addr))->constant;
3479 /* Similar, return the mode. */
3482 get_pool_mode (addr)
3485 return (find_pool_constant (addr))->mode;
3488 /* Similar, return the offset in the constant pool. */
3491 get_pool_offset (addr)
3494 return (find_pool_constant (addr))->offset;
3497 /* Return the size of the constant pool. */
3505 /* Write all the constants in the constant pool. */
3508 output_constant_pool (fnname, fndecl)
3512 struct pool_constant *pool;
3514 union real_extract u;
3516 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3517 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file, fnname, fndecl, pool_offset);
3520 for (pool = first_pool; pool; pool = pool->next)
3524 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3525 whose CODE_LABEL has been deleted. This can occur if a jump table
3526 is eliminated by optimization. If so, write a constant of zero
3527 instead. Note that this can also happen by turning the
3528 CODE_LABEL into a NOTE. */
3529 if (((GET_CODE (x) == LABEL_REF
3530 && (INSN_DELETED_P (XEXP (x, 0))
3531 || GET_CODE (XEXP (x, 0)) == NOTE)))
3532 || (GET_CODE (x) == CONST && GET_CODE (XEXP (x, 0)) == PLUS
3533 && GET_CODE (XEXP (XEXP (x, 0), 0)) == LABEL_REF
3534 && (INSN_DELETED_P (XEXP (XEXP (XEXP (x, 0), 0), 0))
3535 || GET_CODE (XEXP (XEXP (XEXP (x, 0), 0), 0)) == NOTE)))
3538 /* First switch to correct section. */
3539 #ifdef SELECT_RTX_SECTION
3540 SELECT_RTX_SECTION (pool->mode, x);
3542 readonly_data_section ();
3545 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3546 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file, x, pool->mode,
3547 pool->align, pool->labelno, done);
3550 if (pool->align > 1)
3551 ASM_OUTPUT_ALIGN (asm_out_file, exact_log2 (pool->align));
3553 /* Output the label. */
3554 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LC", pool->labelno);
3556 /* Output the value of the constant itself. */
3557 switch (GET_MODE_CLASS (pool->mode))
3560 if (GET_CODE (x) != CONST_DOUBLE)
3563 bcopy ((char *) &CONST_DOUBLE_LOW (x), (char *) &u, sizeof u);
3564 assemble_real (u.d, pool->mode);
3568 case MODE_PARTIAL_INT:
3569 assemble_integer (x, GET_MODE_SIZE (pool->mode), 1);
3579 /* Done with this pool. */
3580 first_pool = last_pool = 0;
3583 /* Find all the constants whose addresses are referenced inside of EXP,
3584 and make sure assembler code with a label has been output for each one.
3585 Indicate whether an ADDR_EXPR has been encountered. */
3588 output_addressed_constants (exp)
3593 switch (TREE_CODE (exp))
3597 register tree constant = TREE_OPERAND (exp, 0);
3599 while (TREE_CODE (constant) == COMPONENT_REF)
3601 constant = TREE_OPERAND (constant, 0);
3604 if (TREE_CODE_CLASS (TREE_CODE (constant)) == 'c'
3605 || TREE_CODE (constant) == CONSTRUCTOR)
3606 /* No need to do anything here
3607 for addresses of variables or functions. */
3608 output_constant_def (constant);
3615 reloc = output_addressed_constants (TREE_OPERAND (exp, 0));
3616 reloc |= output_addressed_constants (TREE_OPERAND (exp, 1));
3621 case NON_LVALUE_EXPR:
3622 reloc = output_addressed_constants (TREE_OPERAND (exp, 0));
3628 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
3629 if (TREE_VALUE (link) != 0)
3630 reloc |= output_addressed_constants (TREE_VALUE (link));
3640 /* Output assembler code for constant EXP to FILE, with no label.
3641 This includes the pseudo-op such as ".int" or ".byte", and a newline.
3642 Assumes output_addressed_constants has been done on EXP already.
3644 Generate exactly SIZE bytes of assembler data, padding at the end
3645 with zeros if necessary. SIZE must always be specified.
3647 SIZE is important for structure constructors,
3648 since trailing members may have been omitted from the constructor.
3649 It is also important for initialization of arrays from string constants
3650 since the full length of the string constant might not be wanted.
3651 It is also needed for initialization of unions, where the initializer's
3652 type is just one member, and that may not be as long as the union.
3654 There a case in which we would fail to output exactly SIZE bytes:
3655 for a structure constructor that wants to produce more than SIZE bytes.
3656 But such constructors will never be generated for any possible input. */
3659 output_constant (exp, size)
3663 register enum tree_code code = TREE_CODE (TREE_TYPE (exp));
3669 /* Eliminate the NON_LVALUE_EXPR_EXPR that makes a cast not be an lvalue.
3670 That way we get the constant (we hope) inside it. Also, strip off any
3671 NOP_EXPR that converts between two record, union, array, or set types. */
3672 while ((TREE_CODE (exp) == NOP_EXPR
3673 && (TREE_TYPE (exp) == TREE_TYPE (TREE_OPERAND (exp, 0))
3674 || AGGREGATE_TYPE_P (TREE_TYPE (exp))))
3675 || TREE_CODE (exp) == NON_LVALUE_EXPR)
3676 exp = TREE_OPERAND (exp, 0);
3678 /* Allow a constructor with no elements for any data type.
3679 This means to fill the space with zeros. */
3680 if (TREE_CODE (exp) == CONSTRUCTOR && CONSTRUCTOR_ELTS (exp) == 0)
3682 if (output_bytecode)
3683 bc_emit_const_skip (size);
3685 assemble_zeros (size);
3696 case REFERENCE_TYPE:
3697 /* ??? What about (int)((float)(int)&foo + 4) */
3698 while (TREE_CODE (exp) == NOP_EXPR || TREE_CODE (exp) == CONVERT_EXPR
3699 || TREE_CODE (exp) == NON_LVALUE_EXPR)
3700 exp = TREE_OPERAND (exp, 0);
3702 if (! assemble_integer (expand_expr (exp, NULL_RTX, VOIDmode,
3703 EXPAND_INITIALIZER),
3705 error ("initializer for integer value is too complicated");
3710 if (TREE_CODE (exp) != REAL_CST)
3711 error ("initializer for floating value is not a floating constant");
3713 assemble_real (TREE_REAL_CST (exp),
3714 mode_for_size (size * BITS_PER_UNIT, MODE_FLOAT, 0));
3719 output_constant (TREE_REALPART (exp), size / 2);
3720 output_constant (TREE_IMAGPART (exp), size / 2);
3721 size -= (size / 2) * 2;
3725 if (TREE_CODE (exp) == CONSTRUCTOR)
3727 output_constructor (exp, size);
3730 else if (TREE_CODE (exp) == STRING_CST)
3734 if (size > TREE_STRING_LENGTH (exp))
3736 excess = size - TREE_STRING_LENGTH (exp);
3737 size = TREE_STRING_LENGTH (exp);
3740 assemble_string (TREE_STRING_POINTER (exp), size);
3749 if (TREE_CODE (exp) == CONSTRUCTOR)
3750 output_constructor (exp, size);
3756 if (TREE_CODE (exp) == INTEGER_CST)
3757 assemble_integer (expand_expr (exp, NULL_RTX,
3758 VOIDmode, EXPAND_INITIALIZER),
3760 else if (TREE_CODE (exp) == CONSTRUCTOR)
3762 unsigned char *buffer = (unsigned char *) alloca (size);
3763 if (get_set_constructor_bytes (exp, buffer, size))
3765 assemble_string ((char *) buffer, size);
3768 error ("unknown set constructor type");
3773 assemble_zeros (size);
3776 /* Bytecode specific code to output assembler for integer. */
3779 bc_assemble_integer (exp, size)
3787 /* FIXME: is this fold() business going to be as good as the
3788 expand_expr() using EXPAND_SUM above in the RTL case? I
3790 FIXME: Copied as is from BC-GCC1; may need work. Don't hate. -bson */
3794 while (TREE_CODE (exp) == NOP_EXPR || TREE_CODE (exp) == CONVERT_EXPR)
3795 exp = TREE_OPERAND (exp, 0);
3796 if (TREE_CODE (exp) == INTEGER_CST)
3801 else if (TREE_CODE (exp) == PLUS_EXPR)
3803 const_part = TREE_OPERAND (exp, 0);
3804 while (TREE_CODE (const_part) == NOP_EXPR
3805 || TREE_CODE (const_part) == CONVERT_EXPR)
3806 const_part = TREE_OPERAND (const_part, 0);
3807 addr_part = TREE_OPERAND (exp, 1);
3808 while (TREE_CODE (addr_part) == NOP_EXPR
3809 || TREE_CODE (addr_part) == CONVERT_EXPR)
3810 addr_part = TREE_OPERAND (addr_part, 0);
3811 if (TREE_CODE (const_part) != INTEGER_CST)
3812 tmp = const_part, const_part = addr_part, addr_part = tmp;
3813 if (TREE_CODE (const_part) != INTEGER_CST
3814 || TREE_CODE (addr_part) != ADDR_EXPR)
3815 abort (); /* FIXME: we really haven't considered
3816 all the possible cases here. */
3818 else if (TREE_CODE (exp) == ADDR_EXPR)
3820 const_part = integer_zero_node;
3824 abort (); /* FIXME: ditto previous. */
3830 char c = TREE_INT_CST_LOW (const_part);
3836 short s = TREE_INT_CST_LOW (const_part);
3837 bc_emit ((char *) &s, 2);
3842 int i = TREE_INT_CST_LOW (const_part);
3843 bc_emit ((char *) &i, 4);
3848 if (WORDS_BIG_ENDIAN)
3850 int i = TREE_INT_CST_HIGH (const_part);
3851 bc_emit ((char *) &i, 4);
3852 i = TREE_INT_CST_LOW (const_part);
3853 bc_emit ((char *) &i, 4);
3857 int i = TREE_INT_CST_LOW (const_part);
3858 bc_emit ((char *) &i, 4);
3859 i = TREE_INT_CST_HIGH (const_part);
3860 bc_emit ((char *) &i, 4);
3867 && TREE_CODE (TREE_OPERAND (addr_part, 0)) == VAR_DECL)
3868 bc_emit_labelref (IDENTIFIER_POINTER
3869 (DECL_ASSEMBLER_NAME (TREE_OPERAND (addr_part, 0))),
3870 TREE_INT_CST_LOW (const_part));
3872 abort (); /* FIXME: there may be more cases. */
3875 /* Subroutine of output_constant, used for CONSTRUCTORs
3876 (aggregate constants).
3877 Generate at least SIZE bytes, padding if necessary. */
3880 output_constructor (exp, size)
3884 register tree link, field = 0;
3885 HOST_WIDE_INT min_index = 0;
3886 /* Number of bytes output or skipped so far.
3887 In other words, current position within the constructor. */
3888 int total_bytes = 0;
3889 /* Non-zero means BYTE contains part of a byte, to be output. */
3890 int byte_buffer_in_use = 0;
3893 if (HOST_BITS_PER_WIDE_INT < BITS_PER_UNIT)
3896 if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE)
3897 field = TYPE_FIELDS (TREE_TYPE (exp));
3899 if (TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE
3900 && TYPE_DOMAIN (TREE_TYPE (exp)) != 0)
3902 = TREE_INT_CST_LOW (TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (exp))));
3904 /* As LINK goes through the elements of the constant,
3905 FIELD goes through the structure fields, if the constant is a structure.
3906 if the constant is a union, then we override this,
3907 by getting the field from the TREE_LIST element.
3908 But the constant could also be an array. Then FIELD is zero. */
3909 for (link = CONSTRUCTOR_ELTS (exp);
3911 link = TREE_CHAIN (link),
3912 field = field ? TREE_CHAIN (field) : 0)
3914 tree val = TREE_VALUE (link);
3917 /* the element in a union constructor specifies the proper field. */
3919 if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE
3920 || TREE_CODE (TREE_TYPE (exp)) == UNION_TYPE)
3922 /* if available, use the type given by link */
3923 if (TREE_PURPOSE (link) != 0)
3924 field = TREE_PURPOSE (link);
3927 if (TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE)
3928 index = TREE_PURPOSE (link);
3930 /* Eliminate the marker that makes a cast not be an lvalue. */
3934 if (index && TREE_CODE (index) == RANGE_EXPR)
3936 register int fieldsize
3937 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (exp)));
3938 HOST_WIDE_INT lo_index = TREE_INT_CST_LOW (TREE_OPERAND (index, 0));
3939 HOST_WIDE_INT hi_index = TREE_INT_CST_LOW (TREE_OPERAND (index, 1));
3940 HOST_WIDE_INT index;
3941 for (index = lo_index; index <= hi_index; index++)
3943 /* Output the element's initial value. */
3945 assemble_zeros (fieldsize);
3947 output_constant (val, fieldsize);
3949 /* Count its size. */
3950 total_bytes += fieldsize;
3953 else if (field == 0 || !DECL_BIT_FIELD (field))
3955 /* An element that is not a bit-field. */
3957 register int fieldsize;
3958 /* Since this structure is static,
3959 we know the positions are constant. */
3960 int bitpos = (field ? (TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field))
3964 bitpos = (TREE_INT_CST_LOW (TYPE_SIZE (TREE_TYPE (val)))
3966 * (TREE_INT_CST_LOW (index) - min_index));
3968 /* Output any buffered-up bit-fields preceding this element. */
3969 if (byte_buffer_in_use)
3971 ASM_OUTPUT_BYTE (asm_out_file, byte);
3973 byte_buffer_in_use = 0;
3976 /* Advance to offset of this element.
3977 Note no alignment needed in an array, since that is guaranteed
3978 if each element has the proper size. */
3979 if ((field != 0 || index != 0) && bitpos != total_bytes)
3981 if (!output_bytecode)
3982 assemble_zeros (bitpos - total_bytes);
3984 bc_emit_const_skip (bitpos - total_bytes);
3985 total_bytes = bitpos;
3988 /* Determine size this element should occupy. */
3991 if (TREE_CODE (DECL_SIZE (field)) != INTEGER_CST)
3993 if (TREE_INT_CST_LOW (DECL_SIZE (field)) > 100000)
3995 /* This avoids overflow trouble. */
3996 tree size_tree = size_binop (CEIL_DIV_EXPR,
3998 size_int (BITS_PER_UNIT));
3999 fieldsize = TREE_INT_CST_LOW (size_tree);
4003 fieldsize = TREE_INT_CST_LOW (DECL_SIZE (field));
4004 fieldsize = (fieldsize + BITS_PER_UNIT - 1) / BITS_PER_UNIT;
4008 fieldsize = int_size_in_bytes (TREE_TYPE (TREE_TYPE (exp)));
4010 /* Output the element's initial value. */
4012 assemble_zeros (fieldsize);
4014 output_constant (val, fieldsize);
4016 /* Count its size. */
4017 total_bytes += fieldsize;
4019 else if (val != 0 && TREE_CODE (val) != INTEGER_CST)
4020 error ("invalid initial value for member `%s'",
4021 IDENTIFIER_POINTER (DECL_NAME (field)));
4024 /* Element that is a bit-field. */
4026 int next_offset = TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field));
4028 = (next_offset + TREE_INT_CST_LOW (DECL_SIZE (field)));
4031 val = integer_zero_node;
4033 /* If this field does not start in this (or, next) byte,
4035 if (next_offset / BITS_PER_UNIT != total_bytes)
4037 /* Output remnant of any bit field in previous bytes. */
4038 if (byte_buffer_in_use)
4040 ASM_OUTPUT_BYTE (asm_out_file, byte);
4042 byte_buffer_in_use = 0;
4045 /* If still not at proper byte, advance to there. */
4046 if (next_offset / BITS_PER_UNIT != total_bytes)
4048 assemble_zeros (next_offset / BITS_PER_UNIT - total_bytes);
4049 total_bytes = next_offset / BITS_PER_UNIT;
4053 if (! byte_buffer_in_use)
4056 /* We must split the element into pieces that fall within
4057 separate bytes, and combine each byte with previous or
4058 following bit-fields. */
4060 /* next_offset is the offset n fbits from the beginning of
4061 the structure to the next bit of this element to be processed.
4062 end_offset is the offset of the first bit past the end of
4064 while (next_offset < end_offset)
4068 HOST_WIDE_INT value;
4069 int next_byte = next_offset / BITS_PER_UNIT;
4070 int next_bit = next_offset % BITS_PER_UNIT;
4072 /* Advance from byte to byte
4073 within this element when necessary. */
4074 while (next_byte != total_bytes)
4076 ASM_OUTPUT_BYTE (asm_out_file, byte);
4081 /* Number of bits we can process at once
4082 (all part of the same byte). */
4083 this_time = MIN (end_offset - next_offset,
4084 BITS_PER_UNIT - next_bit);
4085 if (BYTES_BIG_ENDIAN)
4087 /* On big-endian machine, take the most significant bits
4088 first (of the bits that are significant)
4089 and put them into bytes from the most significant end. */
4090 shift = end_offset - next_offset - this_time;
4091 /* Don't try to take a bunch of bits that cross
4092 the word boundary in the INTEGER_CST. */
4093 if (shift < HOST_BITS_PER_WIDE_INT
4094 && shift + this_time > HOST_BITS_PER_WIDE_INT)
4096 this_time -= (HOST_BITS_PER_WIDE_INT - shift);
4097 shift = HOST_BITS_PER_WIDE_INT;
4100 /* Now get the bits from the appropriate constant word. */
4101 if (shift < HOST_BITS_PER_WIDE_INT)
4103 value = TREE_INT_CST_LOW (val);
4105 else if (shift < 2 * HOST_BITS_PER_WIDE_INT)
4107 value = TREE_INT_CST_HIGH (val);
4108 shift -= HOST_BITS_PER_WIDE_INT;
4112 byte |= (((value >> shift)
4113 & (((HOST_WIDE_INT) 1 << this_time) - 1))
4114 << (BITS_PER_UNIT - this_time - next_bit));
4118 /* On little-endian machines,
4119 take first the least significant bits of the value
4120 and pack them starting at the least significant
4121 bits of the bytes. */
4122 shift = (next_offset
4123 - TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field)));
4124 /* Don't try to take a bunch of bits that cross
4125 the word boundary in the INTEGER_CST. */
4126 if (shift < HOST_BITS_PER_WIDE_INT
4127 && shift + this_time > HOST_BITS_PER_WIDE_INT)
4129 this_time -= (HOST_BITS_PER_WIDE_INT - shift);
4130 shift = HOST_BITS_PER_WIDE_INT;
4133 /* Now get the bits from the appropriate constant word. */
4134 if (shift < HOST_BITS_PER_INT)
4135 value = TREE_INT_CST_LOW (val);
4136 else if (shift < 2 * HOST_BITS_PER_WIDE_INT)
4138 value = TREE_INT_CST_HIGH (val);
4139 shift -= HOST_BITS_PER_WIDE_INT;
4143 byte |= (((value >> shift)
4144 & (((HOST_WIDE_INT) 1 << this_time) - 1))
4147 next_offset += this_time;
4148 byte_buffer_in_use = 1;
4152 if (byte_buffer_in_use)
4154 ASM_OUTPUT_BYTE (asm_out_file, byte);
4157 if (total_bytes < size)
4158 assemble_zeros (size - total_bytes);
4161 /* Output asm to handle ``#pragma weak'' */
4164 handle_pragma_weak (what, name, value)
4165 enum pragma_state what;
4168 #ifdef HANDLE_PRAGMA_WEAK
4169 if (what == ps_name || what == ps_value)
4171 struct weak_syms *weak =
4172 (struct weak_syms *)permalloc (sizeof (struct weak_syms));
4173 weak->next = weak_decls;
4174 weak->name = permalloc (strlen (name) + 1);
4175 strcpy (weak->name, name);
4177 if (what != ps_value)
4178 weak->value = NULL_PTR;
4182 weak->value = permalloc (strlen (value) + 1);
4183 strcpy (weak->value, value);
4188 else if (! (what == ps_done || what == ps_start))
4189 warning ("malformed `#pragma weak'");
4190 #endif /* HANDLE_PRAGMA_WEAK */
4193 /* Declare DECL to be a weak symbol. */
4199 if (! TREE_PUBLIC (decl))
4200 error_with_decl (decl, "weak declaration of `%s' must be public");
4201 else if (TREE_ASM_WRITTEN (decl))
4202 error_with_decl (decl, "weak declaration of `%s' must precede definition");
4203 else if (SUPPORTS_WEAK)
4204 DECL_WEAK (decl) = 1;
4207 /* Emit any pending weak declarations. */
4212 #ifdef HANDLE_PRAGMA_WEAK
4213 if (HANDLE_PRAGMA_WEAK)
4215 struct weak_syms *t;
4216 for (t = weak_decls; t; t = t->next)
4218 ASM_WEAKEN_LABEL (asm_out_file, t->name);
4220 ASM_OUTPUT_DEF (asm_out_file, t->name, t->value);
4227 assemble_alias (decl, target)
4232 make_decl_rtl (decl, (char *) 0, 1);
4233 name = XSTR (XEXP (DECL_RTL (decl), 0), 0);
4235 #ifdef ASM_OUTPUT_DEF
4236 /* Make name accessible from other files, if appropriate. */
4238 if (TREE_PUBLIC (decl))
4240 #ifdef ASM_WEAKEN_LABEL
4241 if (DECL_WEAK (decl))
4242 ASM_WEAKEN_LABEL (asm_out_file, name);
4245 if (output_bytecode)
4246 BC_GLOBALIZE_LABEL (asm_out_file, name);
4248 ASM_GLOBALIZE_LABEL (asm_out_file, name);
4251 ASM_OUTPUT_DEF (asm_out_file, name, IDENTIFIER_POINTER (target));
4252 TREE_ASM_WRITTEN (decl) = 1;
4254 #ifdef ASM_OUTPUT_WEAK_ALIAS
4255 if (! DECL_WEAK (decl))
4256 warning ("only weak aliases are supported in this configuration");
4258 ASM_OUTPUT_WEAK_ALIAS (asm_out_file, name, IDENTIFIER_POINTER (target));
4259 TREE_ASM_WRITTEN (decl) = 1;
4261 warning ("alias definitions not supported in this configuration; ignored");
4266 /* This determines whether or not we support link-once semantics. */
4267 #ifndef SUPPORTS_ONE_ONLY
4268 #ifdef MAKE_DECL_ONE_ONLY
4269 #define SUPPORTS_ONE_ONLY 1
4271 #define SUPPORTS_ONE_ONLY 0
4275 /* Returns 1 if the target configuration supports defining public symbols
4276 so that one of them will be chosen at link time instead of generating a
4277 multiply-defined symbol error, whether through the use of weak symbols or
4278 a target-specific mechanism for having duplicates discarded. */
4281 supports_one_only ()
4283 if (SUPPORTS_ONE_ONLY)
4285 return SUPPORTS_WEAK;
4288 /* Set up DECL as a public symbol that can be defined in multiple
4289 translation units without generating a linker error. */
4292 make_decl_one_only (decl)
4295 if (TREE_CODE (decl) != VAR_DECL && TREE_CODE (decl) != FUNCTION_DECL)
4298 TREE_PUBLIC (decl) = 1;
4300 if (TREE_CODE (decl) == VAR_DECL
4301 && (DECL_INITIAL (decl) == 0 || DECL_INITIAL (decl) == error_mark_node))
4302 DECL_COMMON (decl) = 1;
4303 else if (SUPPORTS_ONE_ONLY)
4305 #ifdef MAKE_DECL_ONE_ONLY
4306 MAKE_DECL_ONE_ONLY (decl);
4308 DECL_ONE_ONLY (decl) = 1;
4310 else if (SUPPORTS_WEAK)
4311 DECL_WEAK (decl) = 1;