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> */
39 #include "hard-reg-set.h"
48 #ifdef XCOFF_DEBUGGING_INFO
55 #define ASM_STABS_OP ".stabs"
58 /* This macro gets just the user-specified name
59 out of the string in a SYMBOL_REF. On most machines,
60 we discard the * if any and that's all. */
61 #ifndef STRIP_NAME_ENCODING
62 #define STRIP_NAME_ENCODING(VAR,SYMBOL_NAME) \
63 (VAR) = ((SYMBOL_NAME) + ((SYMBOL_NAME)[0] == '*'))
66 /* File in which assembler code is being written. */
68 extern FILE *asm_out_file;
70 /* The (assembler) name of the first globally-visible object output. */
71 char *first_global_object_name;
73 extern struct obstack *current_obstack;
74 extern struct obstack *saveable_obstack;
75 extern struct obstack *rtl_obstack;
76 extern struct obstack permanent_obstack;
77 #define obstack_chunk_alloc xmalloc
79 /* Number for making the label on the next
80 constant that is stored in memory. */
84 /* Number for making the label on the next
85 static variable internal to a function. */
89 /* Carry information from ASM_DECLARE_OBJECT_NAME
90 to ASM_FINISH_DECLARE_OBJECT. */
92 int size_directive_output;
94 /* The last decl for which assemble_variable was called,
95 if it did ASM_DECLARE_OBJECT_NAME.
96 If the last call to assemble_variable didn't do that,
99 tree last_assemble_variable_decl;
102 #ifdef HANDLE_PRAGMA_WEAK
103 /* Any weak symbol declarations waiting to be emitted. */
107 struct weak_syms *next;
112 static struct weak_syms *weak_decls;
115 /* Nonzero if at least one function definition has been seen. */
117 static int function_defined;
120 struct constant_descriptor;
122 struct pool_constant;
124 static void bc_make_decl_rtl PROTO((tree, char *, int));
125 static char *strip_reg_name PROTO((char *));
126 static void bc_output_ascii PROTO((FILE *, char *, int));
127 static int contains_pointers_p PROTO((tree));
128 static void decode_addr_const PROTO((tree, struct addr_const *));
129 static int const_hash PROTO((tree));
130 static int compare_constant PROTO((tree,
131 struct constant_descriptor *));
132 static char *compare_constant_1 PROTO((tree, char *));
133 static struct constant_descriptor *record_constant PROTO((tree));
134 static void record_constant_1 PROTO((tree));
135 static tree copy_constant PROTO((tree));
136 static void output_constant_def_contents PROTO((tree, int, int));
137 static void decode_rtx_const PROTO((enum machine_mode, rtx,
138 struct rtx_const *));
139 static int const_hash_rtx PROTO((enum machine_mode, rtx));
140 static int compare_constant_rtx PROTO((enum machine_mode, rtx,
141 struct constant_descriptor *));
142 static struct constant_descriptor *record_constant_rtx PROTO((enum machine_mode,
144 static struct pool_constant *find_pool_constant PROTO((rtx));
145 static int output_addressed_constants PROTO((tree));
146 static void bc_assemble_integer PROTO((tree, int));
147 static void output_constructor PROTO((tree, int));
149 static enum in_section { no_section, in_text, in_data, in_named
150 #ifdef BSS_SECTION_ASM_OP
153 #ifdef EXTRA_SECTIONS
156 } in_section = no_section;
158 /* Return a non-zero value if DECL has a section attribute. */
159 #define IN_NAMED_SECTION(DECL) \
160 ((TREE_CODE (DECL) == FUNCTION_DECL || TREE_CODE (DECL) == VAR_DECL) \
161 && DECL_SECTION_NAME (DECL) != NULL_TREE)
163 /* Text of section name when in_section == in_named. */
164 static char *in_named_name;
166 /* Define functions like text_section for any extra sections. */
167 #ifdef EXTRA_SECTION_FUNCTIONS
168 EXTRA_SECTION_FUNCTIONS
171 /* Tell assembler to switch to text section. */
176 if (in_section != in_text)
181 fprintf (asm_out_file, "%s\n", TEXT_SECTION_ASM_OP);
183 in_section = in_text;
187 /* Tell assembler to switch to data section. */
192 if (in_section != in_data)
198 if (flag_shared_data)
200 #ifdef SHARED_SECTION_ASM_OP
201 fprintf (asm_out_file, "%s\n", SHARED_SECTION_ASM_OP);
203 fprintf (asm_out_file, "%s\n", DATA_SECTION_ASM_OP);
207 fprintf (asm_out_file, "%s\n", DATA_SECTION_ASM_OP);
210 in_section = in_data;
214 /* Tell assembler to switch to read-only data section. This is normally
218 readonly_data_section ()
220 #ifdef READONLY_DATA_SECTION
221 READONLY_DATA_SECTION (); /* Note this can call data_section. */
227 /* Determine if we're in the text section. */
232 return in_section == in_text;
235 /* Determine if we're in the data section. */
240 return in_section == in_data;
243 /* Tell assembler to change to section NAME for DECL.
244 If DECL is NULL, just switch to section NAME.
245 If NAME is NULL, get the name from DECL. */
248 named_section (decl, name)
252 if (decl != NULL_TREE
253 && TREE_CODE_CLASS (TREE_CODE (decl)) != 'd')
256 name = TREE_STRING_POINTER (DECL_SECTION_NAME (decl));
258 if (in_section != in_named || strcmp (name, in_named_name))
260 in_named_name = obstack_alloc (&permanent_obstack, strlen (name) + 1);
261 strcpy (in_named_name, name);
262 in_section = in_named;
264 #ifdef ASM_OUTPUT_SECTION_NAME
265 ASM_OUTPUT_SECTION_NAME (asm_out_file, decl, name);
267 /* Section attributes are not supported if this macro isn't provided -
268 some host formats don't support them at all. The front-end should
269 already have flagged this as an error. */
275 #ifdef BSS_SECTION_ASM_OP
277 /* Tell the assembler to switch to the bss section. */
280 bss_section (decl, name)
282 if (in_section != in_bss)
288 #ifdef SHARED_BSS_SECTION_ASM_OP
289 if (flag_shared_data)
290 fprintf (asm_out_file, "%s\n", SHARED_BSS_SECTION_ASM_OP);
293 fprintf (asm_out_file, "%s\n", BSS_SECTION_ASM_OP);
300 #ifdef ASM_OUTPUT_BSS
302 /* Utility function for ASM_OUTPUT_BSS for targets to use if
303 they don't support alignments in .bss.
304 ??? It is believed that this function will work in most cases so such
305 support is localized here. */
308 asm_output_bss (file, name, size, rounded)
313 ASM_GLOBALIZE_LABEL (file, name);
315 ASM_OUTPUT_LABEL (file, name);
316 ASM_OUTPUT_SKIP (file, rounded);
321 #ifdef ASM_OUTPUT_ALIGNED_BSS
323 /* Utility function for targets to use in implementing
324 ASM_OUTPUT_ALIGNED_BSS.
325 ??? It is believed that this function will work in most cases so such
326 support is localized here. */
329 asm_output_aligned_bss (file, name, size, align)
334 ASM_GLOBALIZE_LABEL (file, name);
336 ASM_OUTPUT_ALIGN (file, floor_log2 (align / BITS_PER_UNIT));
337 ASM_OUTPUT_LABEL (file, name);
338 ASM_OUTPUT_SKIP (file, size);
343 #endif /* BSS_SECTION_ASM_OP */
345 /* Switch to the section for function DECL.
347 If DECL is NULL_TREE, switch to the text section.
348 ??? It's not clear that we will ever be passed NULL_TREE, but it's
349 safer to handle it. */
352 function_section (decl)
356 #ifdef ASM_OUTPUT_SECTION_NAME
357 /* If we are placing functions into their own sections, and this
358 function doesn't already have a section specified, set it now. */
359 if (flag_function_sections
361 && DECL_SECTION_NAME (decl) == NULL_TREE)
366 len = IDENTIFIER_LENGTH (DECL_ASSEMBLER_NAME (decl)) + 1;
367 string = alloca (len);
368 strcpy (string, IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl)));
370 /* Strip off any encoding in fnname. */
371 STRIP_NAME_ENCODING (string, string);
373 /* Set DECL_SECTION_NAME. */
374 DECL_SECTION_NAME (decl) = build_string (len, string);
378 if (decl != NULL_TREE
379 && DECL_SECTION_NAME (decl) != NULL_TREE)
380 named_section (decl, (char *) 0);
385 /* Switch to section for variable DECL.
387 RELOC is the `reloc' argument to SELECT_SECTION. */
390 variable_section (decl, reloc)
394 if (IN_NAMED_SECTION (decl))
395 named_section (decl, NULL);
398 /* C++ can have const variables that get initialized from constructors,
399 and thus can not be in a readonly section. We prevent this by
400 verifying that the initial value is constant for objects put in a
403 error_mark_node is used by the C front end to indicate that the
404 initializer has not been seen yet. In this case, we assume that
405 the initializer must be constant.
407 C++ uses error_mark_node for variables that have complicated
408 initializers, but these variables go in BSS so we won't be called
411 #ifdef SELECT_SECTION
412 SELECT_SECTION (decl, reloc);
414 if (TREE_READONLY (decl)
415 && ! TREE_THIS_VOLATILE (decl)
416 && DECL_INITIAL (decl)
417 && (DECL_INITIAL (decl) == error_mark_node
418 || TREE_CONSTANT (DECL_INITIAL (decl)))
419 && ! (flag_pic && reloc))
420 readonly_data_section ();
427 /* Create the rtl to represent a function, for a function definition.
428 DECL is a FUNCTION_DECL node which describes which function.
429 The rtl is stored into DECL. */
432 make_function_rtl (decl)
435 char *name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
439 if (DECL_RTL (decl) == 0)
440 DECL_RTL (decl) = bc_gen_rtx (name, 0, (struct bc_label *) 0);
442 /* Record that at least one function has been defined. */
443 function_defined = 1;
447 /* Rename a nested function to avoid conflicts. */
448 if (decl_function_context (decl) != 0
449 && DECL_INITIAL (decl) != 0
450 && DECL_RTL (decl) == 0)
454 name = IDENTIFIER_POINTER (DECL_NAME (decl));
455 ASM_FORMAT_PRIVATE_NAME (label, name, var_labelno);
456 name = obstack_copy0 (saveable_obstack, label, strlen (label));
460 if (DECL_RTL (decl) == 0)
463 = gen_rtx (MEM, DECL_MODE (decl),
464 gen_rtx (SYMBOL_REF, Pmode, name));
466 /* Optionally set flags or add text to the name to record information
467 such as that it is a function name. If the name is changed, the macro
468 ASM_OUTPUT_LABELREF will have to know how to strip this information. */
469 #ifdef ENCODE_SECTION_INFO
470 ENCODE_SECTION_INFO (decl);
474 /* Record at least one function has been defined. */
475 function_defined = 1;
478 /* Create the DECL_RTL for a declaration for a static or external
479 variable or static or external function.
480 ASMSPEC, if not 0, is the string which the user specified
481 as the assembler symbol name.
482 TOP_LEVEL is nonzero if this is a file-scope variable.
483 This is never called for PARM_DECLs. */
486 bc_make_decl_rtl (decl, asmspec, top_level)
491 register char *name = TREE_STRING_POINTER (DECL_ASSEMBLER_NAME (decl));
493 if (DECL_RTL (decl) == 0)
495 /* Print an error message for register variables. */
496 if (DECL_REGISTER (decl))
497 error ("global register variables not supported in the interpreter");
499 /* Handle ordinary static variables and functions. */
500 if (DECL_RTL (decl) == 0)
502 /* Can't use just the variable's own name for a variable
503 whose scope is less than the whole file.
504 Concatenate a distinguishing number. */
505 if (!top_level && !DECL_EXTERNAL (decl) && asmspec == 0)
509 ASM_FORMAT_PRIVATE_NAME (label, name, var_labelno);
510 name = obstack_copy0 (saveable_obstack, label, strlen (label));
514 DECL_RTL (decl) = bc_gen_rtx (name, 0, (struct bc_label *) 0);
519 /* Given NAME, a putative register name, discard any customary prefixes. */
522 strip_reg_name (name)
525 #ifdef REGISTER_PREFIX
526 if (!strncmp (name, REGISTER_PREFIX, strlen (REGISTER_PREFIX)))
527 name += strlen (REGISTER_PREFIX);
529 if (name[0] == '%' || name[0] == '#')
534 /* Decode an `asm' spec for a declaration as a register name.
535 Return the register number, or -1 if nothing specified,
536 or -2 if the ASMSPEC is not `cc' or `memory' and is not recognized,
537 or -3 if ASMSPEC is `cc' and is not recognized,
538 or -4 if ASMSPEC is `memory' and is not recognized.
539 Accept an exact spelling or a decimal number.
540 Prefixes such as % are optional. */
543 decode_reg_name (asmspec)
550 /* Get rid of confusing prefixes. */
551 asmspec = strip_reg_name (asmspec);
553 /* Allow a decimal number as a "register name". */
554 for (i = strlen (asmspec) - 1; i >= 0; i--)
555 if (! (asmspec[i] >= '0' && asmspec[i] <= '9'))
557 if (asmspec[0] != 0 && i < 0)
560 if (i < FIRST_PSEUDO_REGISTER && i >= 0)
566 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
568 && ! strcmp (asmspec, strip_reg_name (reg_names[i])))
571 #ifdef ADDITIONAL_REGISTER_NAMES
573 static struct { char *name; int number; } table[]
574 = ADDITIONAL_REGISTER_NAMES;
576 for (i = 0; i < sizeof (table) / sizeof (table[0]); i++)
577 if (! strcmp (asmspec, table[i].name))
578 return table[i].number;
580 #endif /* ADDITIONAL_REGISTER_NAMES */
582 if (!strcmp (asmspec, "memory"))
585 if (!strcmp (asmspec, "cc"))
594 /* Create the DECL_RTL for a declaration for a static or external variable
595 or static or external function.
596 ASMSPEC, if not 0, is the string which the user specified
597 as the assembler symbol name.
598 TOP_LEVEL is nonzero if this is a file-scope variable.
600 This is never called for PARM_DECL nodes. */
603 make_decl_rtl (decl, asmspec, top_level)
608 register char *name = 0;
613 bc_make_decl_rtl (decl, asmspec, top_level);
617 reg_number = decode_reg_name (asmspec);
619 if (DECL_ASSEMBLER_NAME (decl) != NULL_TREE)
620 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
622 if (reg_number == -2)
624 /* ASMSPEC is given, and not the name of a register. */
625 name = (char *) obstack_alloc (saveable_obstack,
626 strlen (asmspec) + 2);
628 strcpy (&name[1], asmspec);
631 /* For a duplicate declaration, we can be called twice on the
632 same DECL node. Don't discard the RTL already made. */
633 if (DECL_RTL (decl) == 0)
637 /* First detect errors in declaring global registers. */
638 if (TREE_CODE (decl) != FUNCTION_DECL
639 && DECL_REGISTER (decl) && reg_number == -1)
640 error_with_decl (decl,
641 "register name not specified for `%s'");
642 else if (TREE_CODE (decl) != FUNCTION_DECL
643 && DECL_REGISTER (decl) && reg_number < 0)
644 error_with_decl (decl,
645 "invalid register name for `%s'");
646 else if ((reg_number >= 0 || reg_number == -3)
647 && (TREE_CODE (decl) == FUNCTION_DECL
648 && ! DECL_REGISTER (decl)))
649 error_with_decl (decl,
650 "register name given for non-register variable `%s'");
651 else if (TREE_CODE (decl) != FUNCTION_DECL
652 && DECL_REGISTER (decl)
653 && TYPE_MODE (TREE_TYPE (decl)) == BLKmode)
654 error_with_decl (decl,
655 "data type of `%s' isn't suitable for a register");
656 else if (TREE_CODE (decl) != FUNCTION_DECL && DECL_REGISTER (decl)
657 && ! HARD_REGNO_MODE_OK (reg_number,
658 TYPE_MODE (TREE_TYPE (decl))))
659 error_with_decl (decl,
660 "register number for `%s' isn't suitable for data type");
661 /* Now handle properly declared static register variables. */
662 else if (TREE_CODE (decl) != FUNCTION_DECL && DECL_REGISTER (decl))
666 if (DECL_INITIAL (decl) != 0 && top_level)
668 DECL_INITIAL (decl) = 0;
669 error ("global register variable has initial value");
671 if (fixed_regs[reg_number] == 0
672 && function_defined && top_level)
673 error ("global register variable follows a function definition");
674 if (TREE_THIS_VOLATILE (decl))
675 warning ("volatile register variables don't work as you might wish");
677 /* If the user specified one of the eliminables registers here,
678 e.g., FRAME_POINTER_REGNUM, we don't want to get this variable
679 confused with that register and be eliminated. Although this
680 usage is somewhat suspect, we nevertheless use the following
681 kludge to avoid setting DECL_RTL to frame_pointer_rtx. */
684 = gen_rtx (REG, DECL_MODE (decl), FIRST_PSEUDO_REGISTER);
685 REGNO (DECL_RTL (decl)) = reg_number;
686 REG_USERVAR_P (DECL_RTL (decl)) = 1;
690 /* Make this register global, so not usable for anything
692 nregs = HARD_REGNO_NREGS (reg_number, DECL_MODE (decl));
694 globalize_reg (reg_number + --nregs);
697 /* Specifying a section attribute on an uninitialized variable does not
698 (and cannot) cause it to be put in the given section. The linker
699 can only put initialized objects in specific sections, everything
700 else goes in bss for the linker to sort out later (otherwise the
701 linker would give a duplicate definition error for each compilation
702 unit that behaved thusly). So warn the user. */
703 else if (TREE_CODE (decl) == VAR_DECL
704 && DECL_SECTION_NAME (decl) != NULL_TREE
705 && DECL_INITIAL (decl) == NULL_TREE
706 && DECL_COMMON (decl))
708 warning_with_decl (decl,
709 "section attribute ignored for uninitialized variable `%s'");
710 /* Remove the section name so subsequent declarations won't see it.
711 We are ignoring it, remember. */
712 DECL_SECTION_NAME (decl) = NULL_TREE;
715 /* Now handle ordinary static variables and functions (in memory).
716 Also handle vars declared register invalidly. */
717 if (DECL_RTL (decl) == 0)
719 /* Can't use just the variable's own name for a variable
720 whose scope is less than the whole file.
721 Concatenate a distinguishing number. */
722 if (!top_level && !DECL_EXTERNAL (decl) && asmspec == 0)
726 ASM_FORMAT_PRIVATE_NAME (label, name, var_labelno);
727 name = obstack_copy0 (saveable_obstack, label, strlen (label));
734 DECL_RTL (decl) = gen_rtx (MEM, DECL_MODE (decl),
735 gen_rtx (SYMBOL_REF, Pmode, name));
736 DECL_ASSEMBLER_NAME (decl) = get_identifier (name);
738 /* If this variable is to be treated as volatile, show its
739 tree node has side effects. If it has side effects, either
740 because of this test or from TREE_THIS_VOLATILE also
741 being set, show the MEM is volatile. */
742 if (flag_volatile_global && TREE_CODE (decl) == VAR_DECL
743 && TREE_PUBLIC (decl))
744 TREE_SIDE_EFFECTS (decl) = 1;
745 if (TREE_SIDE_EFFECTS (decl))
746 MEM_VOLATILE_P (DECL_RTL (decl)) = 1;
748 if (TREE_READONLY (decl))
749 RTX_UNCHANGING_P (DECL_RTL (decl)) = 1;
750 MEM_IN_STRUCT_P (DECL_RTL (decl))
751 = AGGREGATE_TYPE_P (TREE_TYPE (decl));
753 /* Optionally set flags or add text to the name to record information
754 such as that it is a function name.
755 If the name is changed, the macro ASM_OUTPUT_LABELREF
756 will have to know how to strip this information. */
757 #ifdef ENCODE_SECTION_INFO
758 ENCODE_SECTION_INFO (decl);
762 /* If the old RTL had the wrong mode, fix the mode. */
763 else if (GET_MODE (DECL_RTL (decl)) != DECL_MODE (decl))
765 rtx rtl = DECL_RTL (decl);
766 PUT_MODE (rtl, DECL_MODE (decl));
770 /* Make the rtl for variable VAR be volatile.
771 Use this only for static variables. */
774 make_var_volatile (var)
777 if (GET_CODE (DECL_RTL (var)) != MEM)
780 MEM_VOLATILE_P (DECL_RTL (var)) = 1;
783 /* Output alignment directive to align for constant expression EXP. */
786 assemble_constant_align (exp)
791 /* Align the location counter as required by EXP's data type. */
792 align = TYPE_ALIGN (TREE_TYPE (exp));
793 #ifdef CONSTANT_ALIGNMENT
794 align = CONSTANT_ALIGNMENT (exp, align);
797 if (align > BITS_PER_UNIT)
798 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
801 /* Output a string of literal assembler code
802 for an `asm' keyword used between functions. */
805 assemble_asm (string)
810 error ("asm statements not allowed in interpreter");
816 if (TREE_CODE (string) == ADDR_EXPR)
817 string = TREE_OPERAND (string, 0);
819 fprintf (asm_out_file, "\t%s\n", TREE_STRING_POINTER (string));
822 #if 0 /* This should no longer be needed, because
823 flag_gnu_linker should be 0 on these systems,
824 which should prevent any output
825 if ASM_OUTPUT_CONSTRUCTOR and ASM_OUTPUT_DESTRUCTOR are absent. */
826 #if !(defined(DBX_DEBUGGING_INFO) && !defined(FASCIST_ASSEMBLER))
827 #ifndef ASM_OUTPUT_CONSTRUCTOR
828 #define ASM_OUTPUT_CONSTRUCTOR(file, name)
830 #ifndef ASM_OUTPUT_DESTRUCTOR
831 #define ASM_OUTPUT_DESTRUCTOR(file, name)
836 /* Record an element in the table of global destructors.
837 How this is done depends on what sort of assembler and linker
840 NAME should be the name of a global function to be called
841 at exit time. This name is output using assemble_name. */
844 assemble_destructor (name)
847 #ifdef ASM_OUTPUT_DESTRUCTOR
848 ASM_OUTPUT_DESTRUCTOR (asm_out_file, name);
852 /* Now tell GNU LD that this is part of the static destructor set. */
853 /* This code works for any machine provided you use GNU as/ld. */
854 fprintf (asm_out_file, "%s \"___DTOR_LIST__\",22,0,0,", ASM_STABS_OP);
855 assemble_name (asm_out_file, name);
856 fputc ('\n', asm_out_file);
861 /* Likewise for global constructors. */
864 assemble_constructor (name)
867 #ifdef ASM_OUTPUT_CONSTRUCTOR
868 ASM_OUTPUT_CONSTRUCTOR (asm_out_file, name);
872 /* Now tell GNU LD that this is part of the static constructor set. */
873 /* This code works for any machine provided you use GNU as/ld. */
874 fprintf (asm_out_file, "%s \"___CTOR_LIST__\",22,0,0,", ASM_STABS_OP);
875 assemble_name (asm_out_file, name);
876 fputc ('\n', asm_out_file);
881 /* Likewise for entries we want to record for garbage collection.
882 Garbage collection is still under development. */
885 assemble_gc_entry (name)
888 #ifdef ASM_OUTPUT_GC_ENTRY
889 ASM_OUTPUT_GC_ENTRY (asm_out_file, name);
893 /* Now tell GNU LD that this is part of the static constructor set. */
894 fprintf (asm_out_file, "%s \"___PTR_LIST__\",22,0,0,", ASM_STABS_OP);
895 assemble_name (asm_out_file, name);
896 fputc ('\n', asm_out_file);
901 /* Output assembler code for the constant pool of a function and associated
902 with defining the name of the function. DECL describes the function.
903 NAME is the function's name. For the constant pool, we use the current
904 constant pool data. */
907 assemble_start_function (decl, fnname)
913 /* The following code does not need preprocessing in the assembler. */
917 output_constant_pool (fnname, decl);
919 function_section (decl);
921 /* Tell assembler to move to target machine's alignment for functions. */
922 align = floor_log2 (FUNCTION_BOUNDARY / BITS_PER_UNIT);
926 BC_OUTPUT_ALIGN (asm_out_file, align);
928 ASM_OUTPUT_ALIGN (asm_out_file, align);
931 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
932 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file, fnname);
935 #ifdef SDB_DEBUGGING_INFO
936 /* Output SDB definition of the function. */
937 if (write_symbols == SDB_DEBUG)
938 sdbout_mark_begin_function ();
941 #ifdef DBX_DEBUGGING_INFO
942 /* Output DBX definition of the function. */
943 if (write_symbols == DBX_DEBUG)
944 dbxout_begin_function (decl);
947 /* Make function name accessible from other files, if appropriate. */
949 if (TREE_PUBLIC (decl))
951 if (!first_global_object_name)
955 STRIP_NAME_ENCODING (p, fnname);
956 first_global_object_name = permalloc (strlen (p) + 1);
957 strcpy (first_global_object_name, p);
960 #ifdef ASM_WEAKEN_LABEL
961 if (DECL_WEAK (decl))
962 ASM_WEAKEN_LABEL (asm_out_file, fnname);
966 BC_GLOBALIZE_LABEL (asm_out_file, fnname);
968 ASM_GLOBALIZE_LABEL (asm_out_file, fnname);
971 /* Do any machine/system dependent processing of the function name */
973 BC_OUTPUT_LABEL (asm_out_file, fnname);
976 #ifdef ASM_DECLARE_FUNCTION_NAME
977 ASM_DECLARE_FUNCTION_NAME (asm_out_file, fnname, current_function_decl);
979 /* Standard thing is just output label for the function. */
980 ASM_OUTPUT_LABEL (asm_out_file, fnname);
981 #endif /* ASM_DECLARE_FUNCTION_NAME */
985 /* Output assembler code associated with defining the size of the
986 function. DECL describes the function. NAME is the function's name. */
989 assemble_end_function (decl, fnname)
993 #ifdef ASM_DECLARE_FUNCTION_SIZE
994 ASM_DECLARE_FUNCTION_SIZE (asm_out_file, fnname, decl);
998 /* Assemble code to leave SIZE bytes of zeros. */
1001 assemble_zeros (size)
1004 if (output_bytecode)
1006 bc_emit_const_skip (size);
1010 #ifdef ASM_NO_SKIP_IN_TEXT
1011 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
1012 so we must output 0s explicitly in the text section. */
1013 if (ASM_NO_SKIP_IN_TEXT && in_text_section ())
1017 for (i = 0; i < size - 20; i += 20)
1020 fprintf (asm_out_file,
1021 "%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);
1023 fprintf (asm_out_file,
1024 "\tbyte 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n");
1030 fprintf (asm_out_file, "%s 0", ASM_BYTE_OP);
1032 fprintf (asm_out_file, "\tbyte 0");
1035 for (; i < size; i++)
1036 fprintf (asm_out_file, ",0");
1037 fprintf (asm_out_file, "\n");
1044 if (output_bytecode)
1045 BC_OUTPUT_SKIP (asm_out_file, size);
1047 ASM_OUTPUT_SKIP (asm_out_file, size);
1051 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
1054 assemble_align (align)
1057 if (align > BITS_PER_UNIT)
1058 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
1061 /* Assemble a string constant with the specified C string as contents. */
1064 assemble_string (p, size)
1072 if (output_bytecode)
1078 /* If the string is very long, split it up. */
1082 int thissize = size - pos;
1083 if (thissize > maximum)
1086 if (output_bytecode)
1087 bc_output_ascii (asm_out_file, p, thissize);
1090 ASM_OUTPUT_ASCII (asm_out_file, p, thissize);
1099 bc_output_ascii (file, p, size)
1104 BC_OUTPUT_ASCII (file, p, size);
1107 /* Assemble everything that is needed for a variable or function declaration.
1108 Not used for automatic variables, and not used for function definitions.
1109 Should not be called for variables of incomplete structure type.
1111 TOP_LEVEL is nonzero if this variable has file scope.
1112 AT_END is nonzero if this is the special handling, at end of compilation,
1113 to define things that have had only tentative definitions.
1114 DONT_OUTPUT_DATA if nonzero means don't actually output the
1115 initial value (that will be done by the caller). */
1118 assemble_variable (decl, top_level, at_end, dont_output_data)
1122 int dont_output_data;
1124 register char *name;
1128 enum in_section saved_in_section;
1130 last_assemble_variable_decl = 0;
1132 if (output_bytecode)
1135 if (GET_CODE (DECL_RTL (decl)) == REG)
1137 /* Do output symbol info for global register variables, but do nothing
1140 if (TREE_ASM_WRITTEN (decl))
1142 TREE_ASM_WRITTEN (decl) = 1;
1144 if (!output_bytecode)
1146 #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
1147 /* File-scope global variables are output here. */
1148 if ((write_symbols == DBX_DEBUG || write_symbols == XCOFF_DEBUG)
1150 dbxout_symbol (decl, 0);
1152 #ifdef SDB_DEBUGGING_INFO
1153 if (write_symbols == SDB_DEBUG && top_level
1154 /* Leave initialized global vars for end of compilation;
1155 see comment in compile_file. */
1156 && (TREE_PUBLIC (decl) == 0 || DECL_INITIAL (decl) == 0))
1157 sdbout_symbol (decl, 0);
1161 /* Don't output any DWARF debugging information for variables here.
1162 In the case of local variables, the information for them is output
1163 when we do our recursive traversal of the tree representation for
1164 the entire containing function. In the case of file-scope variables,
1165 we output information for all of them at the very end of compilation
1166 while we are doing our final traversal of the chain of file-scope
1172 /* Normally no need to say anything here for external references,
1173 since assemble_external is called by the language-specific code
1174 when a declaration is first seen. */
1176 if (DECL_EXTERNAL (decl))
1179 /* Output no assembler code for a function declaration.
1180 Only definitions of functions output anything. */
1182 if (TREE_CODE (decl) == FUNCTION_DECL)
1185 /* If type was incomplete when the variable was declared,
1186 see if it is complete now. */
1188 if (DECL_SIZE (decl) == 0)
1189 layout_decl (decl, 0);
1191 /* Still incomplete => don't allocate it; treat the tentative defn
1192 (which is what it must have been) as an `extern' reference. */
1194 if (!dont_output_data && DECL_SIZE (decl) == 0)
1196 error_with_file_and_line (DECL_SOURCE_FILE (decl),
1197 DECL_SOURCE_LINE (decl),
1198 "storage size of `%s' isn't known",
1199 IDENTIFIER_POINTER (DECL_NAME (decl)));
1200 TREE_ASM_WRITTEN (decl) = 1;
1204 /* The first declaration of a variable that comes through this function
1205 decides whether it is global (in C, has external linkage)
1206 or local (in C, has internal linkage). So do nothing more
1207 if this function has already run. */
1209 if (TREE_ASM_WRITTEN (decl))
1212 TREE_ASM_WRITTEN (decl) = 1;
1216 if (! dont_output_data)
1218 if (TREE_CODE (DECL_SIZE (decl)) != INTEGER_CST)
1221 /* This is better than explicit arithmetic, since it avoids overflow. */
1222 size_tree = size_binop (CEIL_DIV_EXPR,
1223 DECL_SIZE (decl), size_int (BITS_PER_UNIT));
1225 if (TREE_INT_CST_HIGH (size_tree) != 0)
1227 error_with_decl (decl, "size of variable `%s' is too large");
1232 name = XSTR (XEXP (DECL_RTL (decl), 0), 0);
1234 /* Handle uninitialized definitions. */
1236 if ((DECL_INITIAL (decl) == 0 || DECL_INITIAL (decl) == error_mark_node)
1237 /* If the target can't output uninitialized but not common global data
1238 in .bss, then we have to use .data. */
1239 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
1240 && (DECL_COMMON (decl) || ! TREE_PUBLIC (decl))
1242 && ! dont_output_data)
1244 int size = TREE_INT_CST_LOW (size_tree);
1247 /* Don't allocate zero bytes of common,
1248 since that means "undefined external" in the linker. */
1249 if (size == 0) rounded = 1;
1250 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1251 so that each uninitialized object starts on such a boundary. */
1252 rounded += (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1;
1253 rounded = (rounded / (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
1254 * (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
1256 #ifdef DBX_DEBUGGING_INFO
1257 /* File-scope global variables are output here. */
1258 if (write_symbols == DBX_DEBUG && top_level)
1259 dbxout_symbol (decl, 0);
1261 #ifdef SDB_DEBUGGING_INFO
1262 if (write_symbols == SDB_DEBUG && top_level
1263 /* Leave initialized global vars for end of compilation;
1264 see comment in compile_file. */
1265 && (TREE_PUBLIC (decl) == 0 || DECL_INITIAL (decl) == 0))
1266 sdbout_symbol (decl, 0);
1269 /* Don't output any DWARF debugging information for variables here.
1270 In the case of local variables, the information for them is output
1271 when we do our recursive traversal of the tree representation for
1272 the entire containing function. In the case of file-scope variables,
1273 we output information for all of them at the very end of compilation
1274 while we are doing our final traversal of the chain of file-scope
1277 #if 0 /* ??? We should either delete this or add a comment describing what
1278 it was intended to do and why we shouldn't delete it. */
1279 if (flag_shared_data)
1283 if (TREE_PUBLIC (decl)
1284 #if defined (ASM_OUTPUT_BSS) || defined (ASM_OUTPUT_ALIGNED_BSS)
1285 && DECL_COMMON (decl)
1289 #ifdef ASM_OUTPUT_SHARED_COMMON
1290 if (flag_shared_data)
1291 ASM_OUTPUT_SHARED_COMMON (asm_out_file, name, size, rounded);
1294 if (output_bytecode)
1296 BC_OUTPUT_COMMON (asm_out_file, name, size, rounded);
1300 #ifdef ASM_OUTPUT_ALIGNED_COMMON
1301 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file, name, size,
1304 ASM_OUTPUT_COMMON (asm_out_file, name, size, rounded);
1308 #if defined (ASM_OUTPUT_BSS) || defined (ASM_OUTPUT_ALIGNED_BSS)
1309 else if (TREE_PUBLIC (decl))
1311 #ifdef ASM_OUTPUT_SHARED_BSS
1312 if (flag_shared_data)
1313 ASM_OUTPUT_SHARED_BSS (asm_out_file, name, size, rounded);
1316 if (output_bytecode)
1318 BC_OUTPUT_BSS (asm_out_file, name, size, rounded);
1322 #ifdef ASM_OUTPUT_ALIGNED_BSS
1323 ASM_OUTPUT_ALIGNED_BSS (asm_out_file, name, size,
1326 ASM_OUTPUT_BSS (asm_out_file, name, size, rounded);
1330 #endif /* ASM_OUTPUT_BSS || ASM_OUTPUT_ALIGNED_BSS */
1333 #ifdef ASM_OUTPUT_SHARED_LOCAL
1334 if (flag_shared_data)
1335 ASM_OUTPUT_SHARED_LOCAL (asm_out_file, name, size, rounded);
1338 if (output_bytecode)
1340 BC_OUTPUT_LOCAL (asm_out_file, name, size, rounded);
1344 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1345 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size,
1348 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded);
1355 /* Handle initialized definitions.
1356 Also handle uninitialized global definitions if -fno-common and the
1357 target doesn't support ASM_OUTPUT_BSS. */
1359 /* First make the assembler name(s) global if appropriate. */
1360 if (TREE_PUBLIC (decl) && DECL_NAME (decl))
1362 if (!first_global_object_name)
1366 STRIP_NAME_ENCODING (p, name);
1367 first_global_object_name = permalloc (strlen (p) + 1);
1368 strcpy (first_global_object_name, p);
1371 #ifdef ASM_WEAKEN_LABEL
1372 if (DECL_WEAK (decl))
1373 ASM_WEAKEN_LABEL (asm_out_file, name);
1376 ASM_GLOBALIZE_LABEL (asm_out_file, name);
1379 for (d = equivalents; d; d = TREE_CHAIN (d))
1381 tree e = TREE_VALUE (d);
1382 if (TREE_PUBLIC (e) && DECL_NAME (e))
1383 ASM_GLOBALIZE_LABEL (asm_out_file,
1384 XSTR (XEXP (DECL_RTL (e), 0), 0));
1388 /* Output any data that we will need to use the address of. */
1389 if (DECL_INITIAL (decl) == error_mark_node)
1390 reloc = contains_pointers_p (TREE_TYPE (decl));
1391 else if (DECL_INITIAL (decl))
1392 reloc = output_addressed_constants (DECL_INITIAL (decl));
1394 /* Switch to the appropriate section. */
1395 variable_section (decl, reloc);
1397 /* dbxout.c needs to know this. */
1398 if (in_text_section ())
1399 DECL_IN_TEXT_SECTION (decl) = 1;
1401 /* Record current section so we can restore it if dbxout.c clobbers it. */
1402 saved_in_section = in_section;
1404 /* Output the dbx info now that we have chosen the section. */
1406 #ifdef DBX_DEBUGGING_INFO
1407 /* File-scope global variables are output here. */
1408 if (write_symbols == DBX_DEBUG && top_level)
1409 dbxout_symbol (decl, 0);
1411 #ifdef SDB_DEBUGGING_INFO
1412 if (write_symbols == SDB_DEBUG && top_level
1413 /* Leave initialized global vars for end of compilation;
1414 see comment in compile_file. */
1415 && (TREE_PUBLIC (decl) == 0 || DECL_INITIAL (decl) == 0))
1416 sdbout_symbol (decl, 0);
1419 /* Don't output any DWARF debugging information for variables here.
1420 In the case of local variables, the information for them is output
1421 when we do our recursive traversal of the tree representation for
1422 the entire containing function. In the case of file-scope variables,
1423 we output information for all of them at the very end of compilation
1424 while we are doing our final traversal of the chain of file-scope
1427 /* If the debugging output changed sections, reselect the section
1428 that's supposed to be selected. */
1429 if (in_section != saved_in_section)
1430 variable_section (decl, reloc);
1432 /* Compute and output the alignment of this data. */
1434 align = DECL_ALIGN (decl);
1435 /* In the case for initialing an array whose length isn't specified,
1436 where we have not yet been able to do the layout,
1437 figure out the proper alignment now. */
1438 if (dont_output_data && DECL_SIZE (decl) == 0
1439 && TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE)
1440 align = MAX (align, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl))));
1442 /* Some object file formats have a maximum alignment which they support.
1443 In particular, a.out format supports a maximum alignment of 4. */
1444 #ifndef MAX_OFILE_ALIGNMENT
1445 #define MAX_OFILE_ALIGNMENT BIGGEST_ALIGNMENT
1447 if (align > MAX_OFILE_ALIGNMENT)
1449 warning_with_decl (decl,
1450 "alignment of `%s' is greater than maximum object file alignment");
1451 align = MAX_OFILE_ALIGNMENT;
1453 #ifdef DATA_ALIGNMENT
1454 /* On some machines, it is good to increase alignment sometimes. */
1455 align = DATA_ALIGNMENT (TREE_TYPE (decl), align);
1457 #ifdef CONSTANT_ALIGNMENT
1458 if (DECL_INITIAL (decl))
1459 align = CONSTANT_ALIGNMENT (DECL_INITIAL (decl), align);
1462 /* Reset the alignment in case we have made it tighter, so we can benefit
1463 from it in get_pointer_alignment. */
1464 DECL_ALIGN (decl) = align;
1466 if (align > BITS_PER_UNIT)
1468 if (output_bytecode)
1469 BC_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
1471 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
1474 /* Do any machine/system dependent processing of the object. */
1475 if (output_bytecode)
1476 BC_OUTPUT_LABEL (asm_out_file, name);
1479 #ifdef ASM_DECLARE_OBJECT_NAME
1480 last_assemble_variable_decl = decl;
1481 ASM_DECLARE_OBJECT_NAME (asm_out_file, name, decl);
1483 /* Standard thing is just output label for the object. */
1484 ASM_OUTPUT_LABEL (asm_out_file, name);
1485 #endif /* ASM_DECLARE_OBJECT_NAME */
1488 if (!dont_output_data)
1490 if (DECL_INITIAL (decl))
1491 /* Output the actual data. */
1492 output_constant (DECL_INITIAL (decl), TREE_INT_CST_LOW (size_tree));
1494 /* Leave space for it. */
1495 assemble_zeros (TREE_INT_CST_LOW (size_tree));
1499 #ifdef XCOFF_DEBUGGING_INFO
1500 /* Unfortunately, the IBM assembler cannot handle stabx before the actual
1501 declaration. When something like ".stabx "aa:S-2",aa,133,0" is emitted
1502 and `aa' hasn't been output yet, the assembler generates a stab entry with
1503 a value of zero, in addition to creating an unnecessary external entry
1504 for `aa'. Hence, we must postpone dbxout_symbol to here at the end. */
1506 /* File-scope global variables are output here. */
1507 if (write_symbols == XCOFF_DEBUG && top_level)
1509 saved_in_section = in_section;
1511 dbxout_symbol (decl, 0);
1513 if (in_section != saved_in_section)
1514 variable_section (decl, reloc);
1517 /* There must be a statement after a label. */
1522 /* Return 1 if type TYPE contains any pointers. */
1525 contains_pointers_p (type)
1528 switch (TREE_CODE (type))
1531 case REFERENCE_TYPE:
1532 /* I'm not sure whether OFFSET_TYPE needs this treatment,
1533 so I'll play safe and return 1. */
1539 case QUAL_UNION_TYPE:
1542 /* For a type that has fields, see if the fields have pointers. */
1543 for (fields = TYPE_FIELDS (type); fields; fields = TREE_CHAIN (fields))
1544 if (TREE_CODE (fields) == FIELD_DECL
1545 && contains_pointers_p (TREE_TYPE (fields)))
1551 /* An array type contains pointers if its element type does. */
1552 return contains_pointers_p (TREE_TYPE (type));
1559 /* Output text storage for constructor CONSTR. */
1562 bc_output_constructor (constr, size)
1568 /* Must always be a literal; non-literal constructors are handled
1571 if (!TREE_CONSTANT (constr))
1578 for (i = 0; TYPE_ALIGN (constr) >= BITS_PER_UNIT << (i + 1); i++)
1582 BC_OUTPUT_ALIGN (asm_out_file, i);
1585 output_constant (constr, size);
1588 /* Create storage for constructor CONSTR. */
1591 bc_output_data_constructor (constr)
1596 /* Put in data section */
1600 for (i = 0; TYPE_ALIGN (constr) >= BITS_PER_UNIT << (i + 1); i++);
1602 BC_OUTPUT_ALIGN (asm_out_file, i);
1604 /* The constructor is filled in at runtime. */
1605 BC_OUTPUT_SKIP (asm_out_file, int_size_in_bytes (TREE_TYPE (constr)));
1608 /* Output something to declare an external symbol to the assembler.
1609 (Most assemblers don't need this, so we normally output nothing.)
1610 Do nothing if DECL is not external. */
1613 assemble_external (decl)
1616 if (output_bytecode)
1619 #ifdef ASM_OUTPUT_EXTERNAL
1620 if (TREE_CODE_CLASS (TREE_CODE (decl)) == 'd'
1621 && DECL_EXTERNAL (decl) && TREE_PUBLIC (decl))
1623 rtx rtl = DECL_RTL (decl);
1625 if (GET_CODE (rtl) == MEM && GET_CODE (XEXP (rtl, 0)) == SYMBOL_REF
1626 && ! SYMBOL_REF_USED (XEXP (rtl, 0)))
1628 /* Some systems do require some output. */
1629 SYMBOL_REF_USED (XEXP (rtl, 0)) = 1;
1630 ASM_OUTPUT_EXTERNAL (asm_out_file, decl, XSTR (XEXP (rtl, 0), 0));
1636 /* Similar, for calling a library function FUN. */
1639 assemble_external_libcall (fun)
1642 #ifdef ASM_OUTPUT_EXTERNAL_LIBCALL
1643 if (!output_bytecode)
1645 /* Declare library function name external when first used, if nec. */
1646 if (! SYMBOL_REF_USED (fun))
1648 SYMBOL_REF_USED (fun) = 1;
1649 ASM_OUTPUT_EXTERNAL_LIBCALL (asm_out_file, fun);
1655 /* Declare the label NAME global. */
1658 assemble_global (name)
1661 ASM_GLOBALIZE_LABEL (asm_out_file, name);
1664 /* Assemble a label named NAME. */
1667 assemble_label (name)
1670 if (output_bytecode)
1671 BC_OUTPUT_LABEL (asm_out_file, name);
1673 ASM_OUTPUT_LABEL (asm_out_file, name);
1676 /* Output to FILE a reference to the assembler name of a C-level name NAME.
1677 If NAME starts with a *, the rest of NAME is output verbatim.
1678 Otherwise NAME is transformed in an implementation-defined way
1679 (usually by the addition of an underscore).
1680 Many macros in the tm file are defined to call this function. */
1683 assemble_name (file, name)
1688 int save_warn_id_clash = warn_id_clash;
1690 STRIP_NAME_ENCODING (real_name, name);
1692 /* Don't warn about an identifier name length clash on this name, since
1693 it can be a user symbol suffixed by a number. */
1695 TREE_SYMBOL_REFERENCED (get_identifier (real_name)) = 1;
1696 warn_id_clash = save_warn_id_clash;
1700 if (output_bytecode)
1701 bc_emit_labelref (name, 0);
1703 fputs (&name[1], file);
1707 if (output_bytecode)
1708 BC_OUTPUT_LABELREF (file, name);
1710 ASM_OUTPUT_LABELREF (file, name);
1714 /* Allocate SIZE bytes writable static space with a gensym name
1715 and return an RTX to refer to its address. */
1718 assemble_static_space (size)
1724 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1725 so that each uninitialized object starts on such a boundary. */
1726 int rounded = ((size + (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1)
1727 / (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
1728 * (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
1731 if (flag_shared_data)
1735 ASM_GENERATE_INTERNAL_LABEL (name, "LF", const_labelno);
1738 namestring = (char *) obstack_alloc (saveable_obstack,
1740 strcpy (namestring, name);
1742 if (output_bytecode)
1743 x = bc_gen_rtx (namestring, 0, (struct bc_label *) 0);
1745 x = gen_rtx (SYMBOL_REF, Pmode, namestring);
1747 if (output_bytecode)
1749 BC_OUTPUT_LOCAL (asm_out_file, name, size, rounded);
1753 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1754 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, BIGGEST_ALIGNMENT);
1756 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded);
1762 /* Assemble the static constant template for function entry trampolines.
1763 This is done at most once per compilation.
1764 Returns an RTX for the address of the template. */
1766 #ifdef TRAMPOLINE_TEMPLATE
1768 assemble_trampoline_template ()
1774 /* Shouldn't get here */
1775 if (output_bytecode)
1778 /* By default, put trampoline templates in read-only data section. */
1780 #ifdef TRAMPOLINE_SECTION
1781 TRAMPOLINE_SECTION ();
1783 readonly_data_section ();
1786 /* Write the assembler code to define one. */
1787 align = floor_log2 (FUNCTION_BOUNDARY / BITS_PER_UNIT);
1789 ASM_OUTPUT_ALIGN (asm_out_file, align);
1791 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LTRAMP", 0);
1792 TRAMPOLINE_TEMPLATE (asm_out_file);
1794 /* Record the rtl to refer to it. */
1795 ASM_GENERATE_INTERNAL_LABEL (label, "LTRAMP", 0);
1797 = (char *) obstack_copy0 (&permanent_obstack, label, strlen (label));
1798 return gen_rtx (SYMBOL_REF, Pmode, name);
1802 /* Assemble the integer constant X into an object of SIZE bytes.
1803 X must be either a CONST_INT or CONST_DOUBLE.
1805 Return 1 if we were able to output the constant, otherwise 0. If FORCE is
1806 non-zero, abort if we can't output the constant. */
1809 assemble_integer (x, size, force)
1814 /* First try to use the standard 1, 2, 4, 8, and 16 byte
1815 ASM_OUTPUT... macros. */
1819 #ifdef ASM_OUTPUT_CHAR
1821 ASM_OUTPUT_CHAR (asm_out_file, x);
1825 #ifdef ASM_OUTPUT_SHORT
1827 ASM_OUTPUT_SHORT (asm_out_file, x);
1831 #ifdef ASM_OUTPUT_INT
1833 ASM_OUTPUT_INT (asm_out_file, x);
1837 #ifdef ASM_OUTPUT_DOUBLE_INT
1839 ASM_OUTPUT_DOUBLE_INT (asm_out_file, x);
1843 #ifdef ASM_OUTPUT_QUADRUPLE_INT
1845 ASM_OUTPUT_QUADRUPLE_INT (asm_out_file, x);
1850 /* If we couldn't do it that way, there are two other possibilities: First,
1851 if the machine can output an explicit byte and this is a 1 byte constant,
1852 we can use ASM_OUTPUT_BYTE. */
1854 #ifdef ASM_OUTPUT_BYTE
1855 if (size == 1 && GET_CODE (x) == CONST_INT)
1857 ASM_OUTPUT_BYTE (asm_out_file, INTVAL (x));
1862 /* Finally, if SIZE is larger than a single word, try to output the constant
1863 one word at a time. */
1865 if (size > UNITS_PER_WORD)
1868 enum machine_mode mode
1869 = mode_for_size (size * BITS_PER_UNIT, MODE_INT, 0);
1872 for (i = 0; i < size / UNITS_PER_WORD; i++)
1874 word = operand_subword (x, i, 0, mode);
1879 if (! assemble_integer (word, UNITS_PER_WORD, 0))
1883 if (i == size / UNITS_PER_WORD)
1885 /* If we output at least one word and then could not finish,
1886 there is no valid way to continue. */
1897 /* Assemble the floating-point constant D into an object of size MODE. */
1900 assemble_real (d, mode)
1902 enum machine_mode mode;
1904 jmp_buf output_constant_handler;
1906 if (setjmp (output_constant_handler))
1908 error ("floating point trap outputting a constant");
1909 #ifdef REAL_IS_NOT_DOUBLE
1910 bzero ((char *) &d, sizeof d);
1917 set_float_handler (output_constant_handler);
1921 #ifdef ASM_OUTPUT_BYTE_FLOAT
1923 ASM_OUTPUT_BYTE_FLOAT (asm_out_file, d);
1926 #ifdef ASM_OUTPUT_SHORT_FLOAT
1928 ASM_OUTPUT_SHORT_FLOAT (asm_out_file, d);
1931 #ifdef ASM_OUTPUT_THREE_QUARTER_FLOAT
1933 ASM_OUTPUT_THREE_QUARTER_FLOAT (asm_out_file, d);
1936 #ifdef ASM_OUTPUT_FLOAT
1938 ASM_OUTPUT_FLOAT (asm_out_file, d);
1942 #ifdef ASM_OUTPUT_DOUBLE
1944 ASM_OUTPUT_DOUBLE (asm_out_file, d);
1948 #ifdef ASM_OUTPUT_LONG_DOUBLE
1951 ASM_OUTPUT_LONG_DOUBLE (asm_out_file, d);
1959 set_float_handler (NULL_PTR);
1962 /* Here we combine duplicate floating constants to make
1963 CONST_DOUBLE rtx's, and force those out to memory when necessary. */
1965 /* Chain of all CONST_DOUBLE rtx's constructed for the current function.
1966 They are chained through the CONST_DOUBLE_CHAIN.
1967 A CONST_DOUBLE rtx has CONST_DOUBLE_MEM != cc0_rtx iff it is on this chain.
1968 In that case, CONST_DOUBLE_MEM is either a MEM,
1969 or const0_rtx if no MEM has been made for this CONST_DOUBLE yet.
1971 (CONST_DOUBLE_MEM is used only for top-level functions.
1972 See force_const_mem for explanation.) */
1974 static rtx const_double_chain;
1976 /* Return a CONST_DOUBLE or CONST_INT for a value specified as a pair of ints.
1977 For an integer, I0 is the low-order word and I1 is the high-order word.
1978 For a real number, I0 is the word with the low address
1979 and I1 is the word with the high address. */
1982 immed_double_const (i0, i1, mode)
1983 HOST_WIDE_INT i0, i1;
1984 enum machine_mode mode;
1987 int in_current_obstack;
1989 if (GET_MODE_CLASS (mode) == MODE_INT
1990 || GET_MODE_CLASS (mode) == MODE_PARTIAL_INT)
1992 /* We clear out all bits that don't belong in MODE, unless they and our
1993 sign bit are all one. So we get either a reasonable negative value
1994 or a reasonable unsigned value for this mode. */
1995 int width = GET_MODE_BITSIZE (mode);
1996 if (width < HOST_BITS_PER_WIDE_INT
1997 && ((i0 & ((HOST_WIDE_INT) (-1) << (width - 1)))
1998 != ((HOST_WIDE_INT) (-1) << (width - 1))))
1999 i0 &= ((HOST_WIDE_INT) 1 << width) - 1, i1 = 0;
2000 else if (width == HOST_BITS_PER_WIDE_INT
2001 && ! (i1 == ~0 && i0 < 0))
2003 else if (width > 2 * HOST_BITS_PER_WIDE_INT)
2004 /* We cannot represent this value as a constant. */
2007 /* If this would be an entire word for the target, but is not for
2008 the host, then sign-extend on the host so that the number will look
2009 the same way on the host that it would on the target.
2011 For example, when building a 64 bit alpha hosted 32 bit sparc
2012 targeted compiler, then we want the 32 bit unsigned value -1 to be
2013 represented as a 64 bit value -1, and not as 0x00000000ffffffff.
2014 The later confuses the sparc backend. */
2016 if (BITS_PER_WORD < HOST_BITS_PER_WIDE_INT && BITS_PER_WORD == width
2017 && (i0 & ((HOST_WIDE_INT) 1 << (width - 1))))
2018 i0 |= ((HOST_WIDE_INT) (-1) << width);
2020 /* If MODE fits within HOST_BITS_PER_WIDE_INT, always use a CONST_INT.
2022 ??? Strictly speaking, this is wrong if we create a CONST_INT
2023 for a large unsigned constant with the size of MODE being
2024 HOST_BITS_PER_WIDE_INT and later try to interpret that constant in a
2025 wider mode. In that case we will mis-interpret it as a negative
2028 Unfortunately, the only alternative is to make a CONST_DOUBLE
2029 for any constant in any mode if it is an unsigned constant larger
2030 than the maximum signed integer in an int on the host. However,
2031 doing this will break everyone that always expects to see a CONST_INT
2032 for SImode and smaller.
2034 We have always been making CONST_INTs in this case, so nothing new
2037 if (width <= HOST_BITS_PER_WIDE_INT)
2038 i1 = (i0 < 0) ? ~0 : 0;
2040 /* If this integer fits in one word, return a CONST_INT. */
2041 if ((i1 == 0 && i0 >= 0)
2042 || (i1 == ~0 && i0 < 0))
2043 return GEN_INT (i0);
2045 /* We use VOIDmode for integers. */
2049 /* Search the chain for an existing CONST_DOUBLE with the right value.
2050 If one is found, return it. */
2052 for (r = const_double_chain; r; r = CONST_DOUBLE_CHAIN (r))
2053 if (CONST_DOUBLE_LOW (r) == i0 && CONST_DOUBLE_HIGH (r) == i1
2054 && GET_MODE (r) == mode)
2057 /* No; make a new one and add it to the chain.
2059 We may be called by an optimizer which may be discarding any memory
2060 allocated during its processing (such as combine and loop). However,
2061 we will be leaving this constant on the chain, so we cannot tolerate
2062 freed memory. So switch to saveable_obstack for this allocation
2063 and then switch back if we were in current_obstack. */
2065 push_obstacks_nochange ();
2066 rtl_in_saveable_obstack ();
2067 r = gen_rtx (CONST_DOUBLE, mode, 0, i0, i1);
2070 /* Don't touch const_double_chain in nested function; see force_const_mem.
2071 Also, don't touch it if not inside any function. */
2072 if (outer_function_chain == 0 && current_function_decl != 0)
2074 CONST_DOUBLE_CHAIN (r) = const_double_chain;
2075 const_double_chain = r;
2078 /* Store const0_rtx in mem-slot since this CONST_DOUBLE is on the chain.
2079 Actual use of mem-slot is only through force_const_mem. */
2081 CONST_DOUBLE_MEM (r) = const0_rtx;
2086 /* Return a CONST_DOUBLE for a specified `double' value
2087 and machine mode. */
2090 immed_real_const_1 (d, mode)
2092 enum machine_mode mode;
2094 union real_extract u;
2096 int in_current_obstack;
2098 /* Get the desired `double' value as a sequence of ints
2099 since that is how they are stored in a CONST_DOUBLE. */
2103 /* Detect special cases. */
2105 /* Avoid REAL_VALUES_EQUAL here in order to distinguish minus zero. */
2106 if (!bcmp ((char *) &dconst0, (char *) &d, sizeof d))
2107 return CONST0_RTX (mode);
2108 /* Check for NaN first, because some ports (specifically the i386) do not
2109 emit correct ieee-fp code by default, and thus will generate a core
2110 dump here if we pass a NaN to REAL_VALUES_EQUAL and if REAL_VALUES_EQUAL
2111 does a floating point comparison. */
2112 else if (! REAL_VALUE_ISNAN (d) && REAL_VALUES_EQUAL (dconst1, d))
2113 return CONST1_RTX (mode);
2115 if (sizeof u == 2 * sizeof (HOST_WIDE_INT))
2116 return immed_double_const (u.i[0], u.i[1], mode);
2118 /* The rest of this function handles the case where
2119 a float value requires more than 2 ints of space.
2120 It will be deleted as dead code on machines that don't need it. */
2122 /* Search the chain for an existing CONST_DOUBLE with the right value.
2123 If one is found, return it. */
2125 for (r = const_double_chain; r; r = CONST_DOUBLE_CHAIN (r))
2126 if (! bcmp ((char *) &CONST_DOUBLE_LOW (r), (char *) &u, sizeof u)
2127 && GET_MODE (r) == mode)
2130 /* No; make a new one and add it to the chain.
2132 We may be called by an optimizer which may be discarding any memory
2133 allocated during its processing (such as combine and loop). However,
2134 we will be leaving this constant on the chain, so we cannot tolerate
2135 freed memory. So switch to saveable_obstack for this allocation
2136 and then switch back if we were in current_obstack. */
2138 push_obstacks_nochange ();
2139 rtl_in_saveable_obstack ();
2140 r = rtx_alloc (CONST_DOUBLE);
2142 bcopy ((char *) &u, (char *) &CONST_DOUBLE_LOW (r), sizeof u);
2145 /* Don't touch const_double_chain in nested function; see force_const_mem.
2146 Also, don't touch it if not inside any function. */
2147 if (outer_function_chain == 0 && current_function_decl != 0)
2149 CONST_DOUBLE_CHAIN (r) = const_double_chain;
2150 const_double_chain = r;
2153 /* Store const0_rtx in CONST_DOUBLE_MEM since this CONST_DOUBLE is on the
2154 chain, but has not been allocated memory. Actual use of CONST_DOUBLE_MEM
2155 is only through force_const_mem. */
2157 CONST_DOUBLE_MEM (r) = const0_rtx;
2162 /* Return a CONST_DOUBLE rtx for a value specified by EXP,
2163 which must be a REAL_CST tree node. */
2166 immed_real_const (exp)
2169 return immed_real_const_1 (TREE_REAL_CST (exp), TYPE_MODE (TREE_TYPE (exp)));
2172 /* At the end of a function, forget the memory-constants
2173 previously made for CONST_DOUBLEs. Mark them as not on real_constant_chain.
2174 Also clear out real_constant_chain and clear out all the chain-pointers. */
2177 clear_const_double_mem ()
2179 register rtx r, next;
2181 /* Don't touch CONST_DOUBLE_MEM for nested functions.
2182 See force_const_mem for explanation. */
2183 if (outer_function_chain != 0)
2186 for (r = const_double_chain; r; r = next)
2188 next = CONST_DOUBLE_CHAIN (r);
2189 CONST_DOUBLE_CHAIN (r) = 0;
2190 CONST_DOUBLE_MEM (r) = cc0_rtx;
2192 const_double_chain = 0;
2195 /* Given an expression EXP with a constant value,
2196 reduce it to the sum of an assembler symbol and an integer.
2197 Store them both in the structure *VALUE.
2198 Abort if EXP does not reduce. */
2203 HOST_WIDE_INT offset;
2207 decode_addr_const (exp, value)
2209 struct addr_const *value;
2211 register tree target = TREE_OPERAND (exp, 0);
2212 register int offset = 0;
2217 if (TREE_CODE (target) == COMPONENT_REF
2218 && (TREE_CODE (DECL_FIELD_BITPOS (TREE_OPERAND (target, 1)))
2221 offset += TREE_INT_CST_LOW (DECL_FIELD_BITPOS (TREE_OPERAND (target, 1))) / BITS_PER_UNIT;
2222 target = TREE_OPERAND (target, 0);
2224 else if (TREE_CODE (target) == ARRAY_REF)
2226 if (TREE_CODE (TREE_OPERAND (target, 1)) != INTEGER_CST
2227 || TREE_CODE (TYPE_SIZE (TREE_TYPE (target))) != INTEGER_CST)
2229 offset += ((TREE_INT_CST_LOW (TYPE_SIZE (TREE_TYPE (target)))
2230 * TREE_INT_CST_LOW (TREE_OPERAND (target, 1)))
2232 target = TREE_OPERAND (target, 0);
2238 switch (TREE_CODE (target))
2242 x = DECL_RTL (target);
2246 if (output_bytecode)
2247 /* FIXME: this may not be correct, check it */
2248 x = bc_gen_rtx (TREE_STRING_POINTER (target), 0, (struct bc_label *) 0);
2250 x = gen_rtx (MEM, FUNCTION_MODE,
2251 gen_rtx (LABEL_REF, VOIDmode,
2252 label_rtx (TREE_OPERAND (exp, 0))));
2259 x = TREE_CST_RTL (target);
2266 if (!output_bytecode)
2268 if (GET_CODE (x) != MEM)
2274 value->offset = offset;
2277 /* Uniquize all constants that appear in memory.
2278 Each constant in memory thus far output is recorded
2279 in `const_hash_table' with a `struct constant_descriptor'
2280 that contains a polish representation of the value of
2283 We cannot store the trees in the hash table
2284 because the trees may be temporary. */
2286 struct constant_descriptor
2288 struct constant_descriptor *next;
2294 #define MAX_HASH_TABLE 1009
2295 static struct constant_descriptor *const_hash_table[MAX_HASH_TABLE];
2297 /* Compute a hash code for a constant expression. */
2304 register int len, hi, i;
2305 register enum tree_code code = TREE_CODE (exp);
2307 if (code == INTEGER_CST)
2309 p = (char *) &TREE_INT_CST_LOW (exp);
2310 len = 2 * sizeof TREE_INT_CST_LOW (exp);
2312 else if (code == REAL_CST)
2314 p = (char *) &TREE_REAL_CST (exp);
2315 len = sizeof TREE_REAL_CST (exp);
2317 else if (code == STRING_CST)
2318 p = TREE_STRING_POINTER (exp), len = TREE_STRING_LENGTH (exp);
2319 else if (code == COMPLEX_CST)
2320 return const_hash (TREE_REALPART (exp)) * 5
2321 + const_hash (TREE_IMAGPART (exp));
2322 else if (code == CONSTRUCTOR && TREE_CODE (TREE_TYPE (exp)) == SET_TYPE)
2324 len = int_size_in_bytes (TREE_TYPE (exp));
2325 p = (char*) alloca (len);
2326 get_set_constructor_bytes (exp, (unsigned char *) p, len);
2328 else if (code == CONSTRUCTOR)
2332 /* For record type, include the type in the hashing.
2333 We do not do so for array types
2334 because (1) the sizes of the elements are sufficient
2335 and (2) distinct array types can have the same constructor.
2336 Instead, we include the array size because the constructor could
2338 if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE)
2339 hi = ((HOST_WIDE_INT) TREE_TYPE (exp) & ((1 << HASHBITS) - 1))
2342 hi = ((5 + int_size_in_bytes (TREE_TYPE (exp)))
2343 & ((1 << HASHBITS) - 1)) % MAX_HASH_TABLE;
2345 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
2346 if (TREE_VALUE (link))
2347 hi = (hi * 603 + const_hash (TREE_VALUE (link))) % MAX_HASH_TABLE;
2351 else if (code == ADDR_EXPR)
2353 struct addr_const value;
2354 decode_addr_const (exp, &value);
2355 if (GET_CODE (value.base) == SYMBOL_REF)
2357 /* Don't hash the address of the SYMBOL_REF;
2358 only use the offset and the symbol name. */
2360 p = XSTR (value.base, 0);
2361 for (i = 0; p[i] != 0; i++)
2362 hi = ((hi * 613) + (unsigned)(p[i]));
2364 else if (GET_CODE (value.base) == LABEL_REF)
2365 hi = value.offset + CODE_LABEL_NUMBER (XEXP (value.base, 0)) * 13;
2367 hi &= (1 << HASHBITS) - 1;
2368 hi %= MAX_HASH_TABLE;
2371 else if (code == PLUS_EXPR || code == MINUS_EXPR)
2372 return const_hash (TREE_OPERAND (exp, 0)) * 9
2373 + const_hash (TREE_OPERAND (exp, 1));
2374 else if (code == NOP_EXPR || code == CONVERT_EXPR)
2375 return const_hash (TREE_OPERAND (exp, 0)) * 7 + 2;
2377 /* Compute hashing function */
2379 for (i = 0; i < len; i++)
2380 hi = ((hi * 613) + (unsigned)(p[i]));
2382 hi &= (1 << HASHBITS) - 1;
2383 hi %= MAX_HASH_TABLE;
2387 /* Compare a constant expression EXP with a constant-descriptor DESC.
2388 Return 1 if DESC describes a constant with the same value as EXP. */
2391 compare_constant (exp, desc)
2393 struct constant_descriptor *desc;
2395 return 0 != compare_constant_1 (exp, desc->contents);
2398 /* Compare constant expression EXP with a substring P of a constant descriptor.
2399 If they match, return a pointer to the end of the substring matched.
2400 If they do not match, return 0.
2402 Since descriptors are written in polish prefix notation,
2403 this function can be used recursively to test one operand of EXP
2404 against a subdescriptor, and if it succeeds it returns the
2405 address of the subdescriptor for the next operand. */
2408 compare_constant_1 (exp, p)
2412 register char *strp;
2414 register enum tree_code code = TREE_CODE (exp);
2416 if (code != (enum tree_code) *p++)
2419 if (code == INTEGER_CST)
2421 /* Integer constants are the same only if the same width of type. */
2422 if (*p++ != TYPE_PRECISION (TREE_TYPE (exp)))
2424 strp = (char *) &TREE_INT_CST_LOW (exp);
2425 len = 2 * sizeof TREE_INT_CST_LOW (exp);
2427 else if (code == REAL_CST)
2429 /* Real constants are the same only if the same width of type. */
2430 if (*p++ != TYPE_PRECISION (TREE_TYPE (exp)))
2432 strp = (char *) &TREE_REAL_CST (exp);
2433 len = sizeof TREE_REAL_CST (exp);
2435 else if (code == STRING_CST)
2437 if (flag_writable_strings)
2439 strp = TREE_STRING_POINTER (exp);
2440 len = TREE_STRING_LENGTH (exp);
2441 if (bcmp ((char *) &TREE_STRING_LENGTH (exp), p,
2442 sizeof TREE_STRING_LENGTH (exp)))
2444 p += sizeof TREE_STRING_LENGTH (exp);
2446 else if (code == COMPLEX_CST)
2448 p = compare_constant_1 (TREE_REALPART (exp), p);
2449 if (p == 0) return 0;
2450 p = compare_constant_1 (TREE_IMAGPART (exp), p);
2453 else if (code == CONSTRUCTOR && TREE_CODE (TREE_TYPE (exp)) == SET_TYPE)
2455 int xlen = len = int_size_in_bytes (TREE_TYPE (exp));
2456 strp = (char*) alloca (len);
2457 get_set_constructor_bytes (exp, (unsigned char *) strp, len);
2458 if (bcmp ((char *) &xlen, p, sizeof xlen))
2462 else if (code == CONSTRUCTOR)
2465 int length = list_length (CONSTRUCTOR_ELTS (exp));
2468 if (bcmp ((char *) &length, p, sizeof length))
2472 /* For record constructors, insist that the types match.
2473 For arrays, just verify both constructors are for arrays. */
2474 if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE)
2475 type = TREE_TYPE (exp);
2478 if (bcmp ((char *) &type, p, sizeof type))
2482 /* For arrays, insist that the size in bytes match. */
2483 if (TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE)
2485 int size = int_size_in_bytes (TREE_TYPE (exp));
2486 if (bcmp ((char *) &size, p, sizeof size))
2491 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
2493 if (TREE_VALUE (link))
2495 if ((p = compare_constant_1 (TREE_VALUE (link), p)) == 0)
2502 if (bcmp ((char *) &zero, p, sizeof zero))
2510 else if (code == ADDR_EXPR)
2512 struct addr_const value;
2513 decode_addr_const (exp, &value);
2514 strp = (char *) &value.offset;
2515 len = sizeof value.offset;
2516 /* Compare the offset. */
2518 if (*p++ != *strp++)
2520 /* Compare symbol name. */
2521 strp = XSTR (value.base, 0);
2522 len = strlen (strp) + 1;
2524 else if (code == PLUS_EXPR || code == MINUS_EXPR)
2526 p = compare_constant_1 (TREE_OPERAND (exp, 0), p);
2527 if (p == 0) return 0;
2528 p = compare_constant_1 (TREE_OPERAND (exp, 1), p);
2531 else if (code == NOP_EXPR || code == CONVERT_EXPR)
2533 p = compare_constant_1 (TREE_OPERAND (exp, 0), p);
2537 /* Compare constant contents. */
2539 if (*p++ != *strp++)
2545 /* Construct a constant descriptor for the expression EXP.
2546 It is up to the caller to enter the descriptor in the hash table. */
2548 static struct constant_descriptor *
2549 record_constant (exp)
2552 struct constant_descriptor *next = 0;
2555 /* Make a struct constant_descriptor. The first two pointers will
2556 be filled in later. Here we just leave space for them. */
2558 obstack_grow (&permanent_obstack, (char *) &next, sizeof next);
2559 obstack_grow (&permanent_obstack, (char *) &label, sizeof label);
2560 record_constant_1 (exp);
2561 return (struct constant_descriptor *) obstack_finish (&permanent_obstack);
2564 /* Add a description of constant expression EXP
2565 to the object growing in `permanent_obstack'.
2566 No need to return its address; the caller will get that
2567 from the obstack when the object is complete. */
2570 record_constant_1 (exp)
2573 register char *strp;
2575 register enum tree_code code = TREE_CODE (exp);
2577 obstack_1grow (&permanent_obstack, (unsigned int) code);
2582 obstack_1grow (&permanent_obstack, TYPE_PRECISION (TREE_TYPE (exp)));
2583 strp = (char *) &TREE_INT_CST_LOW (exp);
2584 len = 2 * sizeof TREE_INT_CST_LOW (exp);
2588 obstack_1grow (&permanent_obstack, TYPE_PRECISION (TREE_TYPE (exp)));
2589 strp = (char *) &TREE_REAL_CST (exp);
2590 len = sizeof TREE_REAL_CST (exp);
2594 if (flag_writable_strings)
2597 strp = TREE_STRING_POINTER (exp);
2598 len = TREE_STRING_LENGTH (exp);
2599 obstack_grow (&permanent_obstack, (char *) &TREE_STRING_LENGTH (exp),
2600 sizeof TREE_STRING_LENGTH (exp));
2604 record_constant_1 (TREE_REALPART (exp));
2605 record_constant_1 (TREE_IMAGPART (exp));
2609 if (TREE_CODE (TREE_TYPE (exp)) == SET_TYPE)
2611 int nbytes = int_size_in_bytes (TREE_TYPE (exp));
2612 obstack_grow (&permanent_obstack, &nbytes, sizeof (nbytes));
2613 obstack_blank (&permanent_obstack, nbytes);
2614 get_set_constructor_bytes
2615 (exp, (unsigned char *) permanent_obstack.next_free-nbytes,
2622 int length = list_length (CONSTRUCTOR_ELTS (exp));
2625 obstack_grow (&permanent_obstack, (char *) &length, sizeof length);
2627 /* For record constructors, insist that the types match.
2628 For arrays, just verify both constructors are for arrays. */
2629 if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE)
2630 type = TREE_TYPE (exp);
2633 obstack_grow (&permanent_obstack, (char *) &type, sizeof type);
2635 /* For arrays, insist that the size in bytes match. */
2636 if (TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE)
2638 int size = int_size_in_bytes (TREE_TYPE (exp));
2639 obstack_grow (&permanent_obstack, (char *) &size, sizeof size);
2642 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
2644 if (TREE_VALUE (link))
2645 record_constant_1 (TREE_VALUE (link));
2650 obstack_grow (&permanent_obstack,
2651 (char *) &zero, sizeof zero);
2659 struct addr_const value;
2661 decode_addr_const (exp, &value);
2662 /* Record the offset. */
2663 obstack_grow (&permanent_obstack,
2664 (char *) &value.offset, sizeof value.offset);
2665 /* Record the symbol name. */
2666 obstack_grow (&permanent_obstack, XSTR (value.base, 0),
2667 strlen (XSTR (value.base, 0)) + 1);
2673 record_constant_1 (TREE_OPERAND (exp, 0));
2674 record_constant_1 (TREE_OPERAND (exp, 1));
2679 case NON_LVALUE_EXPR:
2680 record_constant_1 (TREE_OPERAND (exp, 0));
2687 /* Record constant contents. */
2688 obstack_grow (&permanent_obstack, strp, len);
2691 /* Record a list of constant expressions that were passed to
2692 output_constant_def but that could not be output right away. */
2694 struct deferred_constant
2696 struct deferred_constant *next;
2702 static struct deferred_constant *deferred_constants;
2704 /* Nonzero means defer output of addressed subconstants
2705 (i.e., those for which output_constant_def is called.) */
2706 static int defer_addressed_constants_flag;
2708 /* Start deferring output of subconstants. */
2711 defer_addressed_constants ()
2713 defer_addressed_constants_flag++;
2716 /* Stop deferring output of subconstants,
2717 and output now all those that have been deferred. */
2720 output_deferred_addressed_constants ()
2722 struct deferred_constant *p, *next;
2724 defer_addressed_constants_flag--;
2726 if (defer_addressed_constants_flag > 0)
2729 for (p = deferred_constants; p; p = next)
2731 output_constant_def_contents (p->exp, p->reloc, p->labelno);
2736 deferred_constants = 0;
2739 /* Make a copy of the whole tree structure for a constant.
2740 This handles the same types of nodes that compare_constant
2741 and record_constant handle. */
2747 switch (TREE_CODE (exp))
2750 /* For ADDR_EXPR, we do not want to copy the decl whose address
2751 is requested. We do want to copy constants though. */
2752 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, 0))) == 'c')
2753 return build1 (TREE_CODE (exp), TREE_TYPE (exp),
2754 copy_constant (TREE_OPERAND (exp, 0)));
2756 return copy_node (exp);
2761 return copy_node (exp);
2764 return build_complex (copy_constant (TREE_REALPART (exp)),
2765 copy_constant (TREE_IMAGPART (exp)));
2769 return build (TREE_CODE (exp), TREE_TYPE (exp),
2770 copy_constant (TREE_OPERAND (exp, 0)),
2771 copy_constant (TREE_OPERAND (exp, 1)));
2775 return build1 (TREE_CODE (exp), TREE_TYPE (exp),
2776 copy_constant (TREE_OPERAND (exp, 0)));
2780 tree copy = copy_node (exp);
2781 tree list = copy_list (CONSTRUCTOR_ELTS (exp));
2784 CONSTRUCTOR_ELTS (copy) = list;
2785 for (tail = list; tail; tail = TREE_CHAIN (tail))
2786 TREE_VALUE (tail) = copy_constant (TREE_VALUE (tail));
2787 if (TREE_CODE (TREE_TYPE (exp)) == SET_TYPE)
2788 for (tail = list; tail; tail = TREE_CHAIN (tail))
2789 TREE_PURPOSE (tail) = copy_constant (TREE_PURPOSE (tail));
2799 /* Return an rtx representing a reference to constant data in memory
2800 for the constant expression EXP.
2802 If assembler code for such a constant has already been output,
2803 return an rtx to refer to it.
2804 Otherwise, output such a constant in memory (or defer it for later)
2805 and generate an rtx for it.
2807 The TREE_CST_RTL of EXP is set up to point to that rtx.
2808 The const_hash_table records which constants already have label strings. */
2811 output_constant_def (exp)
2815 register struct constant_descriptor *desc;
2821 if (TREE_CODE (exp) == INTEGER_CST)
2822 abort (); /* No TREE_CST_RTL slot in these. */
2824 if (TREE_CST_RTL (exp))
2825 return TREE_CST_RTL (exp);
2827 /* Make sure any other constants whose addresses appear in EXP
2828 are assigned label numbers. */
2830 reloc = output_addressed_constants (exp);
2832 /* Compute hash code of EXP. Search the descriptors for that hash code
2833 to see if any of them describes EXP. If yes, the descriptor records
2834 the label number already assigned. */
2836 hash = const_hash (exp) % MAX_HASH_TABLE;
2838 for (desc = const_hash_table[hash]; desc; desc = desc->next)
2839 if (compare_constant (exp, desc))
2841 found = desc->label;
2847 /* No constant equal to EXP is known to have been output.
2848 Make a constant descriptor to enter EXP in the hash table.
2849 Assign the label number and record it in the descriptor for
2850 future calls to this function to find. */
2852 /* Create a string containing the label name, in LABEL. */
2853 ASM_GENERATE_INTERNAL_LABEL (label, "LC", const_labelno);
2855 desc = record_constant (exp);
2856 desc->next = const_hash_table[hash];
2858 = (char *) obstack_copy0 (&permanent_obstack, label, strlen (label));
2859 const_hash_table[hash] = desc;
2863 /* Create a string containing the label name, in LABEL. */
2864 ASM_GENERATE_INTERNAL_LABEL (label, "LC", const_labelno);
2867 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
2869 push_obstacks_nochange ();
2870 if (TREE_PERMANENT (exp))
2871 end_temporary_allocation ();
2873 def = gen_rtx (SYMBOL_REF, Pmode, desc->label);
2876 = gen_rtx (MEM, TYPE_MODE (TREE_TYPE (exp)), def);
2877 RTX_UNCHANGING_P (TREE_CST_RTL (exp)) = 1;
2878 if (AGGREGATE_TYPE_P (TREE_TYPE (exp)))
2879 MEM_IN_STRUCT_P (TREE_CST_RTL (exp)) = 1;
2883 /* Optionally set flags or add text to the name to record information
2884 such as that it is a function name. If the name is changed, the macro
2885 ASM_OUTPUT_LABELREF will have to know how to strip this information. */
2886 #ifdef ENCODE_SECTION_INFO
2887 ENCODE_SECTION_INFO (exp);
2890 /* If this is the first time we've seen this particular constant,
2891 output it (or defer its output for later). */
2894 if (defer_addressed_constants_flag)
2896 struct deferred_constant *p;
2897 p = (struct deferred_constant *) xmalloc (sizeof (struct deferred_constant));
2899 push_obstacks_nochange ();
2900 suspend_momentary ();
2901 p->exp = copy_constant (exp);
2904 p->labelno = const_labelno++;
2905 p->next = deferred_constants;
2906 deferred_constants = p;
2909 output_constant_def_contents (exp, reloc, const_labelno++);
2912 return TREE_CST_RTL (exp);
2915 /* Now output assembler code to define the label for EXP,
2916 and follow it with the data of EXP. */
2919 output_constant_def_contents (exp, reloc, labelno)
2926 if (IN_NAMED_SECTION (exp))
2927 named_section (exp, NULL);
2930 /* First switch to text section, except for writable strings. */
2931 #ifdef SELECT_SECTION
2932 SELECT_SECTION (exp, reloc);
2934 if (((TREE_CODE (exp) == STRING_CST) && flag_writable_strings)
2935 || (flag_pic && reloc))
2938 readonly_data_section ();
2942 /* Align the location counter as required by EXP's data type. */
2943 align = TYPE_ALIGN (TREE_TYPE (exp));
2944 #ifdef CONSTANT_ALIGNMENT
2945 align = CONSTANT_ALIGNMENT (exp, align);
2948 if (align > BITS_PER_UNIT)
2950 if (!output_bytecode)
2952 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
2956 BC_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
2960 /* Output the label itself. */
2961 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LC", labelno);
2963 /* Output the value of EXP. */
2964 output_constant (exp,
2965 (TREE_CODE (exp) == STRING_CST
2966 ? TREE_STRING_LENGTH (exp)
2967 : int_size_in_bytes (TREE_TYPE (exp))));
2971 /* Similar hash facility for making memory-constants
2972 from constant rtl-expressions. It is used on RISC machines
2973 where immediate integer arguments and constant addresses are restricted
2974 so that such constants must be stored in memory.
2976 This pool of constants is reinitialized for each function
2977 so each function gets its own constants-pool that comes right before it.
2979 All structures allocated here are discarded when functions are saved for
2980 inlining, so they do not need to be allocated permanently. */
2982 #define MAX_RTX_HASH_TABLE 61
2983 static struct constant_descriptor **const_rtx_hash_table;
2985 /* Structure to represent sufficient information about a constant so that
2986 it can be output when the constant pool is output, so that function
2987 integration can be done, and to simplify handling on machines that reference
2988 constant pool as base+displacement. */
2990 struct pool_constant
2992 struct constant_descriptor *desc;
2993 struct pool_constant *next;
2994 enum machine_mode mode;
3001 /* Pointers to first and last constant in pool. */
3003 static struct pool_constant *first_pool, *last_pool;
3005 /* Current offset in constant pool (does not include any machine-specific
3008 static int pool_offset;
3010 /* Structure used to maintain hash table mapping symbols used to their
3011 corresponding constants. */
3016 struct pool_constant *pool;
3017 struct pool_sym *next;
3020 static struct pool_sym **const_rtx_sym_hash_table;
3022 /* Hash code for a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true.
3023 The argument is XSTR (... , 0) */
3025 #define SYMHASH(LABEL) \
3026 ((((HOST_WIDE_INT) (LABEL)) & ((1 << HASHBITS) - 1)) % MAX_RTX_HASH_TABLE)
3028 /* Initialize constant pool hashing for next function. */
3031 init_const_rtx_hash_table ()
3033 const_rtx_hash_table
3034 = ((struct constant_descriptor **)
3035 oballoc (MAX_RTX_HASH_TABLE * sizeof (struct constant_descriptor *)));
3036 const_rtx_sym_hash_table
3037 = ((struct pool_sym **)
3038 oballoc (MAX_RTX_HASH_TABLE * sizeof (struct pool_sym *)));
3039 bzero ((char *) const_rtx_hash_table,
3040 MAX_RTX_HASH_TABLE * sizeof (struct constant_descriptor *));
3041 bzero ((char *) const_rtx_sym_hash_table,
3042 MAX_RTX_HASH_TABLE * sizeof (struct pool_sym *));
3044 first_pool = last_pool = 0;
3048 /* Save and restore status for a nested function. */
3051 save_varasm_status (p)
3054 p->const_rtx_hash_table = const_rtx_hash_table;
3055 p->const_rtx_sym_hash_table = const_rtx_sym_hash_table;
3056 p->first_pool = first_pool;
3057 p->last_pool = last_pool;
3058 p->pool_offset = pool_offset;
3062 restore_varasm_status (p)
3065 const_rtx_hash_table = p->const_rtx_hash_table;
3066 const_rtx_sym_hash_table = p->const_rtx_sym_hash_table;
3067 first_pool = p->first_pool;
3068 last_pool = p->last_pool;
3069 pool_offset = p->pool_offset;
3072 enum kind { RTX_DOUBLE, RTX_INT };
3076 #ifdef ONLY_INT_FIELDS
3077 unsigned int kind : 16;
3078 unsigned int mode : 16;
3080 enum kind kind : 16;
3081 enum machine_mode mode : 16;
3084 union real_extract du;
3085 struct addr_const addr;
3086 struct {HOST_WIDE_INT high, low;} di;
3090 /* Express an rtx for a constant integer (perhaps symbolic)
3091 as the sum of a symbol or label plus an explicit integer.
3092 They are stored into VALUE. */
3095 decode_rtx_const (mode, x, value)
3096 enum machine_mode mode;
3098 struct rtx_const *value;
3100 /* Clear the whole structure, including any gaps. */
3103 int *p = (int *) value;
3104 int *end = (int *) (value + 1);
3109 value->kind = RTX_INT; /* Most usual kind. */
3112 switch (GET_CODE (x))
3115 value->kind = RTX_DOUBLE;
3116 if (GET_MODE (x) != VOIDmode)
3118 value->mode = GET_MODE (x);
3119 bcopy ((char *) &CONST_DOUBLE_LOW (x),
3120 (char *) &value->un.du, sizeof value->un.du);
3124 value->un.di.low = CONST_DOUBLE_LOW (x);
3125 value->un.di.high = CONST_DOUBLE_HIGH (x);
3130 value->un.addr.offset = INTVAL (x);
3136 value->un.addr.base = x;
3141 if (GET_CODE (x) == PLUS)
3143 value->un.addr.base = XEXP (x, 0);
3144 if (GET_CODE (XEXP (x, 1)) != CONST_INT)
3146 value->un.addr.offset = INTVAL (XEXP (x, 1));
3148 else if (GET_CODE (x) == MINUS)
3150 value->un.addr.base = XEXP (x, 0);
3151 if (GET_CODE (XEXP (x, 1)) != CONST_INT)
3153 value->un.addr.offset = - INTVAL (XEXP (x, 1));
3163 if (value->kind == RTX_INT && value->un.addr.base != 0)
3164 switch (GET_CODE (value->un.addr.base))
3168 /* Use the string's address, not the SYMBOL_REF's address,
3169 for the sake of addresses of library routines.
3170 For a LABEL_REF, compare labels. */
3171 value->un.addr.base = XEXP (value->un.addr.base, 0);
3175 /* Given a MINUS expression, simplify it if both sides
3176 include the same symbol. */
3179 simplify_subtraction (x)
3182 struct rtx_const val0, val1;
3184 decode_rtx_const (GET_MODE (x), XEXP (x, 0), &val0);
3185 decode_rtx_const (GET_MODE (x), XEXP (x, 1), &val1);
3187 if (val0.un.addr.base == val1.un.addr.base)
3188 return GEN_INT (val0.un.addr.offset - val1.un.addr.offset);
3192 /* Compute a hash code for a constant RTL expression. */
3195 const_hash_rtx (mode, x)
3196 enum machine_mode mode;
3201 struct rtx_const value;
3202 decode_rtx_const (mode, x, &value);
3204 /* Compute hashing function */
3206 for (i = 0; i < sizeof value / sizeof (int); i++)
3207 hi += ((int *) &value)[i];
3209 hi &= (1 << HASHBITS) - 1;
3210 hi %= MAX_RTX_HASH_TABLE;
3214 /* Compare a constant rtl object X with a constant-descriptor DESC.
3215 Return 1 if DESC describes a constant with the same value as X. */
3218 compare_constant_rtx (mode, x, desc)
3219 enum machine_mode mode;
3221 struct constant_descriptor *desc;
3223 register int *p = (int *) desc->contents;
3226 struct rtx_const value;
3228 decode_rtx_const (mode, x, &value);
3229 strp = (int *) &value;
3230 len = sizeof value / sizeof (int);
3232 /* Compare constant contents. */
3234 if (*p++ != *strp++)
3240 /* Construct a constant descriptor for the rtl-expression X.
3241 It is up to the caller to enter the descriptor in the hash table. */
3243 static struct constant_descriptor *
3244 record_constant_rtx (mode, x)
3245 enum machine_mode mode;
3248 struct constant_descriptor *ptr;
3250 struct rtx_const value;
3252 decode_rtx_const (mode, x, &value);
3254 /* Put these things in the saveable obstack so we can ensure it won't
3255 be freed if we are called from combine or some other phase that discards
3256 memory allocated from function_obstack (current_obstack). */
3257 obstack_grow (saveable_obstack, &ptr, sizeof ptr);
3258 obstack_grow (saveable_obstack, &label, sizeof label);
3260 /* Record constant contents. */
3261 obstack_grow (saveable_obstack, &value, sizeof value);
3263 return (struct constant_descriptor *) obstack_finish (saveable_obstack);
3266 /* Given a constant rtx X, make (or find) a memory constant for its value
3267 and return a MEM rtx to refer to it in memory. */
3270 force_const_mem (mode, x)
3271 enum machine_mode mode;
3275 register struct constant_descriptor *desc;
3280 /* If we want this CONST_DOUBLE in the same mode as it is in memory
3281 (this will always be true for floating CONST_DOUBLEs that have been
3282 placed in memory, but not for VOIDmode (integer) CONST_DOUBLEs),
3283 use the previous copy. Otherwise, make a new one. Note that in
3284 the unlikely event that this same CONST_DOUBLE is used in two different
3285 modes in an alternating fashion, we will allocate a lot of different
3286 memory locations, but this should be extremely rare. */
3288 /* Don't use CONST_DOUBLE_MEM in a nested function.
3289 Nested functions have their own constant pools,
3290 so they can't share the same values in CONST_DOUBLE_MEM
3291 with the containing function. */
3292 if (outer_function_chain == 0)
3293 if (GET_CODE (x) == CONST_DOUBLE
3294 && GET_CODE (CONST_DOUBLE_MEM (x)) == MEM
3295 && GET_MODE (CONST_DOUBLE_MEM (x)) == mode)
3296 return CONST_DOUBLE_MEM (x);
3298 /* Compute hash code of X. Search the descriptors for that hash code
3299 to see if any of them describes X. If yes, the descriptor records
3300 the label number already assigned. */
3302 hash = const_hash_rtx (mode, x);
3304 for (desc = const_rtx_hash_table[hash]; desc; desc = desc->next)
3305 if (compare_constant_rtx (mode, x, desc))
3307 found = desc->label;
3313 register struct pool_constant *pool;
3314 register struct pool_sym *sym;
3317 /* No constant equal to X is known to have been output.
3318 Make a constant descriptor to enter X in the hash table.
3319 Assign the label number and record it in the descriptor for
3320 future calls to this function to find. */
3322 desc = record_constant_rtx (mode, x);
3323 desc->next = const_rtx_hash_table[hash];
3324 const_rtx_hash_table[hash] = desc;
3326 /* Align the location counter as required by EXP's data type. */
3327 align = (mode == VOIDmode) ? UNITS_PER_WORD : GET_MODE_SIZE (mode);
3328 if (align > BIGGEST_ALIGNMENT / BITS_PER_UNIT)
3329 align = BIGGEST_ALIGNMENT / BITS_PER_UNIT;
3331 pool_offset += align - 1;
3332 pool_offset &= ~ (align - 1);
3334 /* If RTL is not being placed into the saveable obstack, make a
3335 copy of X that is in the saveable obstack in case we are being
3336 called from combine or some other phase that discards memory
3337 it allocates. We need only do this if it is a CONST, since
3338 no other RTX should be allocated in this situation. */
3339 if (rtl_obstack != saveable_obstack
3340 && GET_CODE (x) == CONST)
3342 push_obstacks_nochange ();
3343 rtl_in_saveable_obstack ();
3345 x = gen_rtx (CONST, GET_MODE (x),
3346 gen_rtx (PLUS, GET_MODE (x),
3347 XEXP (XEXP (x, 0), 0), XEXP (XEXP (x, 0), 1)));
3351 /* Allocate a pool constant descriptor, fill it in, and chain it in. */
3353 pool = (struct pool_constant *) savealloc (sizeof (struct pool_constant));
3357 pool->labelno = const_labelno;
3358 pool->align = align;
3359 pool->offset = pool_offset;
3365 last_pool->next = pool;
3368 pool_offset += GET_MODE_SIZE (mode);
3370 /* Create a string containing the label name, in LABEL. */
3371 ASM_GENERATE_INTERNAL_LABEL (label, "LC", const_labelno);
3376 = (char *) obstack_copy0 (saveable_obstack, label, strlen (label));
3378 /* Add label to symbol hash table. */
3379 hash = SYMHASH (found);
3380 sym = (struct pool_sym *) savealloc (sizeof (struct pool_sym));
3383 sym->next = const_rtx_sym_hash_table[hash];
3384 const_rtx_sym_hash_table[hash] = sym;
3387 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
3389 def = gen_rtx (MEM, mode, gen_rtx (SYMBOL_REF, Pmode, found));
3391 RTX_UNCHANGING_P (def) = 1;
3392 /* Mark the symbol_ref as belonging to this constants pool. */
3393 CONSTANT_POOL_ADDRESS_P (XEXP (def, 0)) = 1;
3394 current_function_uses_const_pool = 1;
3396 if (outer_function_chain == 0)
3397 if (GET_CODE (x) == CONST_DOUBLE)
3399 if (CONST_DOUBLE_MEM (x) == cc0_rtx)
3401 CONST_DOUBLE_CHAIN (x) = const_double_chain;
3402 const_double_chain = x;
3404 CONST_DOUBLE_MEM (x) = def;
3410 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
3411 the corresponding pool_constant structure. */
3413 static struct pool_constant *
3414 find_pool_constant (addr)
3417 struct pool_sym *sym;
3418 char *label = XSTR (addr, 0);
3420 for (sym = const_rtx_sym_hash_table[SYMHASH (label)]; sym; sym = sym->next)
3421 if (sym->label == label)
3427 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
3430 get_pool_constant (addr)
3433 return (find_pool_constant (addr))->constant;
3436 /* Similar, return the mode. */
3439 get_pool_mode (addr)
3442 return (find_pool_constant (addr))->mode;
3445 /* Similar, return the offset in the constant pool. */
3448 get_pool_offset (addr)
3451 return (find_pool_constant (addr))->offset;
3454 /* Return the size of the constant pool. */
3462 /* Write all the constants in the constant pool. */
3465 output_constant_pool (fnname, fndecl)
3469 struct pool_constant *pool;
3471 union real_extract u;
3473 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3474 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file, fnname, fndecl, pool_offset);
3477 for (pool = first_pool; pool; pool = pool->next)
3481 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3482 whose CODE_LABEL has been deleted. This can occur if a jump table
3483 is eliminated by optimization. If so, write a constant of zero
3484 instead. Note that this can also happen by turning the
3485 CODE_LABEL into a NOTE. */
3486 if (((GET_CODE (x) == LABEL_REF
3487 && (INSN_DELETED_P (XEXP (x, 0))
3488 || GET_CODE (XEXP (x, 0)) == NOTE)))
3489 || (GET_CODE (x) == CONST && GET_CODE (XEXP (x, 0)) == PLUS
3490 && GET_CODE (XEXP (XEXP (x, 0), 0)) == LABEL_REF
3491 && (INSN_DELETED_P (XEXP (XEXP (XEXP (x, 0), 0), 0))
3492 || GET_CODE (XEXP (XEXP (XEXP (x, 0), 0), 0)) == NOTE)))
3495 /* First switch to correct section. */
3496 #ifdef SELECT_RTX_SECTION
3497 SELECT_RTX_SECTION (pool->mode, x);
3499 readonly_data_section ();
3502 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3503 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file, x, pool->mode,
3504 pool->align, pool->labelno, done);
3507 if (pool->align > 1)
3508 ASM_OUTPUT_ALIGN (asm_out_file, exact_log2 (pool->align));
3510 /* Output the label. */
3511 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LC", pool->labelno);
3513 /* Output the value of the constant itself. */
3514 switch (GET_MODE_CLASS (pool->mode))
3517 if (GET_CODE (x) != CONST_DOUBLE)
3520 bcopy ((char *) &CONST_DOUBLE_LOW (x), (char *) &u, sizeof u);
3521 assemble_real (u.d, pool->mode);
3525 case MODE_PARTIAL_INT:
3526 assemble_integer (x, GET_MODE_SIZE (pool->mode), 1);
3536 /* Done with this pool. */
3537 first_pool = last_pool = 0;
3540 /* Find all the constants whose addresses are referenced inside of EXP,
3541 and make sure assembler code with a label has been output for each one.
3542 Indicate whether an ADDR_EXPR has been encountered. */
3545 output_addressed_constants (exp)
3550 switch (TREE_CODE (exp))
3554 register tree constant = TREE_OPERAND (exp, 0);
3556 while (TREE_CODE (constant) == COMPONENT_REF)
3558 constant = TREE_OPERAND (constant, 0);
3561 if (TREE_CODE_CLASS (TREE_CODE (constant)) == 'c'
3562 || TREE_CODE (constant) == CONSTRUCTOR)
3563 /* No need to do anything here
3564 for addresses of variables or functions. */
3565 output_constant_def (constant);
3572 reloc = output_addressed_constants (TREE_OPERAND (exp, 0));
3573 reloc |= output_addressed_constants (TREE_OPERAND (exp, 1));
3578 case NON_LVALUE_EXPR:
3579 reloc = output_addressed_constants (TREE_OPERAND (exp, 0));
3585 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
3586 if (TREE_VALUE (link) != 0)
3587 reloc |= output_addressed_constants (TREE_VALUE (link));
3597 /* Output assembler code for constant EXP to FILE, with no label.
3598 This includes the pseudo-op such as ".int" or ".byte", and a newline.
3599 Assumes output_addressed_constants has been done on EXP already.
3601 Generate exactly SIZE bytes of assembler data, padding at the end
3602 with zeros if necessary. SIZE must always be specified.
3604 SIZE is important for structure constructors,
3605 since trailing members may have been omitted from the constructor.
3606 It is also important for initialization of arrays from string constants
3607 since the full length of the string constant might not be wanted.
3608 It is also needed for initialization of unions, where the initializer's
3609 type is just one member, and that may not be as long as the union.
3611 There a case in which we would fail to output exactly SIZE bytes:
3612 for a structure constructor that wants to produce more than SIZE bytes.
3613 But such constructors will never be generated for any possible input. */
3616 output_constant (exp, size)
3620 register enum tree_code code = TREE_CODE (TREE_TYPE (exp));
3626 /* Eliminate the NON_LVALUE_EXPR_EXPR that makes a cast not be an lvalue.
3627 That way we get the constant (we hope) inside it. Also, strip off any
3628 NOP_EXPR that converts between two record, union, array, or set types. */
3629 while ((TREE_CODE (exp) == NOP_EXPR
3630 && (TREE_TYPE (exp) == TREE_TYPE (TREE_OPERAND (exp, 0))
3631 || AGGREGATE_TYPE_P (TREE_TYPE (exp))))
3632 || TREE_CODE (exp) == NON_LVALUE_EXPR)
3633 exp = TREE_OPERAND (exp, 0);
3635 /* Allow a constructor with no elements for any data type.
3636 This means to fill the space with zeros. */
3637 if (TREE_CODE (exp) == CONSTRUCTOR && CONSTRUCTOR_ELTS (exp) == 0)
3639 if (output_bytecode)
3640 bc_emit_const_skip (size);
3642 assemble_zeros (size);
3653 case REFERENCE_TYPE:
3654 /* ??? What about (int)((float)(int)&foo + 4) */
3655 while (TREE_CODE (exp) == NOP_EXPR || TREE_CODE (exp) == CONVERT_EXPR
3656 || TREE_CODE (exp) == NON_LVALUE_EXPR)
3657 exp = TREE_OPERAND (exp, 0);
3659 if (! assemble_integer (expand_expr (exp, NULL_RTX, VOIDmode,
3660 EXPAND_INITIALIZER),
3662 error ("initializer for integer value is too complicated");
3667 if (TREE_CODE (exp) != REAL_CST)
3668 error ("initializer for floating value is not a floating constant");
3670 assemble_real (TREE_REAL_CST (exp),
3671 mode_for_size (size * BITS_PER_UNIT, MODE_FLOAT, 0));
3676 output_constant (TREE_REALPART (exp), size / 2);
3677 output_constant (TREE_IMAGPART (exp), size / 2);
3678 size -= (size / 2) * 2;
3682 if (TREE_CODE (exp) == CONSTRUCTOR)
3684 output_constructor (exp, size);
3687 else if (TREE_CODE (exp) == STRING_CST)
3691 if (size > TREE_STRING_LENGTH (exp))
3693 excess = size - TREE_STRING_LENGTH (exp);
3694 size = TREE_STRING_LENGTH (exp);
3697 assemble_string (TREE_STRING_POINTER (exp), size);
3706 if (TREE_CODE (exp) == CONSTRUCTOR)
3707 output_constructor (exp, size);
3713 if (TREE_CODE (exp) == INTEGER_CST)
3714 assemble_integer (expand_expr (exp, NULL_RTX,
3715 VOIDmode, EXPAND_INITIALIZER),
3717 else if (TREE_CODE (exp) == CONSTRUCTOR)
3719 unsigned char *buffer = (unsigned char *) alloca (size);
3720 if (get_set_constructor_bytes (exp, buffer, size))
3722 assemble_string ((char *) buffer, size);
3725 error ("unknown set constructor type");
3730 assemble_zeros (size);
3733 /* Bytecode specific code to output assembler for integer. */
3736 bc_assemble_integer (exp, size)
3744 /* FIXME: is this fold() business going to be as good as the
3745 expand_expr() using EXPAND_SUM above in the RTL case? I
3747 FIXME: Copied as is from BC-GCC1; may need work. Don't hate. -bson */
3751 while (TREE_CODE (exp) == NOP_EXPR || TREE_CODE (exp) == CONVERT_EXPR)
3752 exp = TREE_OPERAND (exp, 0);
3753 if (TREE_CODE (exp) == INTEGER_CST)
3758 else if (TREE_CODE (exp) == PLUS_EXPR)
3760 const_part = TREE_OPERAND (exp, 0);
3761 while (TREE_CODE (const_part) == NOP_EXPR
3762 || TREE_CODE (const_part) == CONVERT_EXPR)
3763 const_part = TREE_OPERAND (const_part, 0);
3764 addr_part = TREE_OPERAND (exp, 1);
3765 while (TREE_CODE (addr_part) == NOP_EXPR
3766 || TREE_CODE (addr_part) == CONVERT_EXPR)
3767 addr_part = TREE_OPERAND (addr_part, 0);
3768 if (TREE_CODE (const_part) != INTEGER_CST)
3769 tmp = const_part, const_part = addr_part, addr_part = tmp;
3770 if (TREE_CODE (const_part) != INTEGER_CST
3771 || TREE_CODE (addr_part) != ADDR_EXPR)
3772 abort (); /* FIXME: we really haven't considered
3773 all the possible cases here. */
3775 else if (TREE_CODE (exp) == ADDR_EXPR)
3777 const_part = integer_zero_node;
3781 abort (); /* FIXME: ditto previous. */
3787 char c = TREE_INT_CST_LOW (const_part);
3793 short s = TREE_INT_CST_LOW (const_part);
3794 bc_emit ((char *) &s, 2);
3799 int i = TREE_INT_CST_LOW (const_part);
3800 bc_emit ((char *) &i, 4);
3805 if (WORDS_BIG_ENDIAN)
3807 int i = TREE_INT_CST_HIGH (const_part);
3808 bc_emit ((char *) &i, 4);
3809 i = TREE_INT_CST_LOW (const_part);
3810 bc_emit ((char *) &i, 4);
3814 int i = TREE_INT_CST_LOW (const_part);
3815 bc_emit ((char *) &i, 4);
3816 i = TREE_INT_CST_HIGH (const_part);
3817 bc_emit ((char *) &i, 4);
3824 && TREE_CODE (TREE_OPERAND (addr_part, 0)) == VAR_DECL)
3825 bc_emit_labelref (IDENTIFIER_POINTER
3826 (DECL_ASSEMBLER_NAME (TREE_OPERAND (addr_part, 0))),
3827 TREE_INT_CST_LOW (const_part));
3829 abort (); /* FIXME: there may be more cases. */
3832 /* Subroutine of output_constant, used for CONSTRUCTORs
3833 (aggregate constants).
3834 Generate at least SIZE bytes, padding if necessary. */
3837 output_constructor (exp, size)
3841 register tree link, field = 0;
3842 HOST_WIDE_INT min_index = 0;
3843 /* Number of bytes output or skipped so far.
3844 In other words, current position within the constructor. */
3845 int total_bytes = 0;
3846 /* Non-zero means BYTE contains part of a byte, to be output. */
3847 int byte_buffer_in_use = 0;
3850 if (HOST_BITS_PER_WIDE_INT < BITS_PER_UNIT)
3853 if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE)
3854 field = TYPE_FIELDS (TREE_TYPE (exp));
3856 if (TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE
3857 && TYPE_DOMAIN (TREE_TYPE (exp)) != 0)
3859 = TREE_INT_CST_LOW (TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (exp))));
3861 /* As LINK goes through the elements of the constant,
3862 FIELD goes through the structure fields, if the constant is a structure.
3863 if the constant is a union, then we override this,
3864 by getting the field from the TREE_LIST element.
3865 But the constant could also be an array. Then FIELD is zero. */
3866 for (link = CONSTRUCTOR_ELTS (exp);
3868 link = TREE_CHAIN (link),
3869 field = field ? TREE_CHAIN (field) : 0)
3871 tree val = TREE_VALUE (link);
3874 /* the element in a union constructor specifies the proper field. */
3876 if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE
3877 || TREE_CODE (TREE_TYPE (exp)) == UNION_TYPE)
3879 /* if available, use the type given by link */
3880 if (TREE_PURPOSE (link) != 0)
3881 field = TREE_PURPOSE (link);
3884 if (TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE)
3885 index = TREE_PURPOSE (link);
3887 /* Eliminate the marker that makes a cast not be an lvalue. */
3891 if (field == 0 || !DECL_BIT_FIELD (field))
3893 /* An element that is not a bit-field. */
3895 register int fieldsize;
3896 /* Since this structure is static,
3897 we know the positions are constant. */
3898 int bitpos = (field ? (TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field))
3902 bitpos = (TREE_INT_CST_LOW (TYPE_SIZE (TREE_TYPE (val)))
3904 * (TREE_INT_CST_LOW (index) - min_index));
3906 /* Output any buffered-up bit-fields preceding this element. */
3907 if (byte_buffer_in_use)
3909 ASM_OUTPUT_BYTE (asm_out_file, byte);
3911 byte_buffer_in_use = 0;
3914 /* Advance to offset of this element.
3915 Note no alignment needed in an array, since that is guaranteed
3916 if each element has the proper size. */
3917 if ((field != 0 || index != 0) && bitpos != total_bytes)
3919 if (!output_bytecode)
3920 assemble_zeros (bitpos - total_bytes);
3922 bc_emit_const_skip (bitpos - total_bytes);
3923 total_bytes = bitpos;
3926 /* Determine size this element should occupy. */
3929 if (TREE_CODE (DECL_SIZE (field)) != INTEGER_CST)
3931 if (TREE_INT_CST_LOW (DECL_SIZE (field)) > 100000)
3933 /* This avoids overflow trouble. */
3934 tree size_tree = size_binop (CEIL_DIV_EXPR,
3936 size_int (BITS_PER_UNIT));
3937 fieldsize = TREE_INT_CST_LOW (size_tree);
3941 fieldsize = TREE_INT_CST_LOW (DECL_SIZE (field));
3942 fieldsize = (fieldsize + BITS_PER_UNIT - 1) / BITS_PER_UNIT;
3946 fieldsize = int_size_in_bytes (TREE_TYPE (TREE_TYPE (exp)));
3948 /* Output the element's initial value. */
3950 assemble_zeros (fieldsize);
3952 output_constant (val, fieldsize);
3954 /* Count its size. */
3955 total_bytes += fieldsize;
3957 else if (val != 0 && TREE_CODE (val) != INTEGER_CST)
3958 error ("invalid initial value for member `%s'",
3959 IDENTIFIER_POINTER (DECL_NAME (field)));
3962 /* Element that is a bit-field. */
3964 int next_offset = TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field));
3966 = (next_offset + TREE_INT_CST_LOW (DECL_SIZE (field)));
3969 val = integer_zero_node;
3971 /* If this field does not start in this (or, next) byte,
3973 if (next_offset / BITS_PER_UNIT != total_bytes)
3975 /* Output remnant of any bit field in previous bytes. */
3976 if (byte_buffer_in_use)
3978 ASM_OUTPUT_BYTE (asm_out_file, byte);
3980 byte_buffer_in_use = 0;
3983 /* If still not at proper byte, advance to there. */
3984 if (next_offset / BITS_PER_UNIT != total_bytes)
3986 assemble_zeros (next_offset / BITS_PER_UNIT - total_bytes);
3987 total_bytes = next_offset / BITS_PER_UNIT;
3991 if (! byte_buffer_in_use)
3994 /* We must split the element into pieces that fall within
3995 separate bytes, and combine each byte with previous or
3996 following bit-fields. */
3998 /* next_offset is the offset n fbits from the beginning of
3999 the structure to the next bit of this element to be processed.
4000 end_offset is the offset of the first bit past the end of
4002 while (next_offset < end_offset)
4006 HOST_WIDE_INT value;
4007 int next_byte = next_offset / BITS_PER_UNIT;
4008 int next_bit = next_offset % BITS_PER_UNIT;
4010 /* Advance from byte to byte
4011 within this element when necessary. */
4012 while (next_byte != total_bytes)
4014 ASM_OUTPUT_BYTE (asm_out_file, byte);
4019 /* Number of bits we can process at once
4020 (all part of the same byte). */
4021 this_time = MIN (end_offset - next_offset,
4022 BITS_PER_UNIT - next_bit);
4023 if (BYTES_BIG_ENDIAN)
4025 /* On big-endian machine, take the most significant bits
4026 first (of the bits that are significant)
4027 and put them into bytes from the most significant end. */
4028 shift = end_offset - next_offset - this_time;
4029 /* Don't try to take a bunch of bits that cross
4030 the word boundary in the INTEGER_CST. */
4031 if (shift < HOST_BITS_PER_WIDE_INT
4032 && shift + this_time > HOST_BITS_PER_WIDE_INT)
4034 this_time -= (HOST_BITS_PER_WIDE_INT - shift);
4035 shift = HOST_BITS_PER_WIDE_INT;
4038 /* Now get the bits from the appropriate constant word. */
4039 if (shift < HOST_BITS_PER_WIDE_INT)
4041 value = TREE_INT_CST_LOW (val);
4043 else if (shift < 2 * HOST_BITS_PER_WIDE_INT)
4045 value = TREE_INT_CST_HIGH (val);
4046 shift -= HOST_BITS_PER_WIDE_INT;
4050 byte |= (((value >> shift)
4051 & (((HOST_WIDE_INT) 1 << this_time) - 1))
4052 << (BITS_PER_UNIT - this_time - next_bit));
4056 /* On little-endian machines,
4057 take first the least significant bits of the value
4058 and pack them starting at the least significant
4059 bits of the bytes. */
4060 shift = (next_offset
4061 - TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field)));
4062 /* Don't try to take a bunch of bits that cross
4063 the word boundary in the INTEGER_CST. */
4064 if (shift < HOST_BITS_PER_WIDE_INT
4065 && shift + this_time > HOST_BITS_PER_WIDE_INT)
4067 this_time -= (HOST_BITS_PER_WIDE_INT - shift);
4068 shift = HOST_BITS_PER_WIDE_INT;
4071 /* Now get the bits from the appropriate constant word. */
4072 if (shift < HOST_BITS_PER_INT)
4073 value = TREE_INT_CST_LOW (val);
4074 else if (shift < 2 * HOST_BITS_PER_WIDE_INT)
4076 value = TREE_INT_CST_HIGH (val);
4077 shift -= HOST_BITS_PER_WIDE_INT;
4081 byte |= (((value >> shift)
4082 & (((HOST_WIDE_INT) 1 << this_time) - 1))
4085 next_offset += this_time;
4086 byte_buffer_in_use = 1;
4090 if (byte_buffer_in_use)
4092 ASM_OUTPUT_BYTE (asm_out_file, byte);
4095 if (total_bytes < size)
4096 assemble_zeros (size - total_bytes);
4099 /* Output asm to handle ``#pragma weak'' */
4101 handle_pragma_weak (what, name, value)
4102 enum pragma_state what;
4105 #ifdef HANDLE_PRAGMA_WEAK
4106 if (what == ps_name || what == ps_value)
4108 struct weak_syms *weak =
4109 (struct weak_syms *)permalloc (sizeof (struct weak_syms));
4110 weak->next = weak_decls;
4111 weak->name = permalloc (strlen (name) + 1);
4112 strcpy (weak->name, name);
4114 if (what != ps_value)
4115 weak->value = NULL_PTR;
4119 weak->value = permalloc (strlen (value) + 1);
4120 strcpy (weak->value, value);
4125 else if (! (what == ps_done || what == ps_start))
4126 warning ("malformed `#pragma weak'");
4127 #endif /* HANDLE_PRAGMA_WEAK */
4130 /* Declare DECL to be a weak symbol. */
4136 if (! TREE_PUBLIC (decl))
4137 error_with_decl (decl, "weak declaration of `%s' must be public");
4138 else if (TREE_ASM_WRITTEN (decl))
4139 error_with_decl (decl, "weak declaration of `%s' must precede definition");
4140 else if (SUPPORTS_WEAK)
4141 DECL_WEAK (decl) = 1;
4144 /* Emit any pending weak declarations. */
4149 #ifdef HANDLE_PRAGMA_WEAK
4150 if (HANDLE_PRAGMA_WEAK)
4152 struct weak_syms *t;
4153 for (t = weak_decls; t; t = t->next)
4155 ASM_WEAKEN_LABEL (asm_out_file, t->name);
4157 ASM_OUTPUT_DEF (asm_out_file, t->name, t->value);
4164 assemble_alias (decl, target)
4167 #ifdef ASM_OUTPUT_DEF
4170 make_decl_rtl (decl, (char*)0, 1);
4171 name = XSTR (XEXP (DECL_RTL (decl), 0), 0);
4173 /* Make name accessible from other files, if appropriate. */
4175 if (TREE_PUBLIC (decl))
4177 #ifdef ASM_WEAKEN_LABEL
4178 if (DECL_WEAK (decl))
4179 ASM_WEAKEN_LABEL (asm_out_file, name);
4182 if (output_bytecode)
4183 BC_GLOBALIZE_LABEL (asm_out_file, name);
4185 ASM_GLOBALIZE_LABEL (asm_out_file, name);
4188 ASM_OUTPUT_DEF (asm_out_file, name, IDENTIFIER_POINTER (target));
4189 TREE_ASM_WRITTEN (decl) = 1;
4191 warning ("alias definitions not supported in this configuration");