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. */
239 return in_section == in_data;
241 /* Tell assembler to change to section NAME for DECL.
242 If DECL is NULL, just switch to section NAME.
243 If NAME is NULL, get the name from DECL. */
246 named_section (decl, name)
250 if (decl != NULL_TREE
251 && (TREE_CODE (decl) != FUNCTION_DECL && TREE_CODE (decl) != VAR_DECL))
254 name = TREE_STRING_POINTER (DECL_SECTION_NAME (decl));
256 if (in_section != in_named || strcmp (name, in_named_name))
258 in_named_name = name;
259 in_section = in_named;
261 #ifdef ASM_OUTPUT_SECTION_NAME
262 ASM_OUTPUT_SECTION_NAME (asm_out_file, decl, name);
264 /* Section attributes are not supported if this macro isn't provided -
265 some host formats don't support them at all. The front-end should
266 already have flagged this as an error. */
272 #ifdef BSS_SECTION_ASM_OP
274 /* Tell the assembler to switch to the bss section. */
277 bss_section (decl, name)
279 if (in_section != in_bss)
285 #ifdef SHARED_BSS_SECTION_ASM_OP
286 if (flag_shared_data)
287 fprintf (asm_out_file, "%s\n", SHARED_BSS_SECTION_ASM_OP);
290 fprintf (asm_out_file, "%s\n", BSS_SECTION_ASM_OP);
297 #ifdef ASM_OUTPUT_BSS
299 /* Utility function for ASM_OUTPUT_BSS for targets to use if
300 they don't support alignments in .bss.
301 ??? It is believed that this function will work in most cases so such
302 support is localized here. */
305 asm_output_bss (file, name, size, rounded)
310 ASM_GLOBALIZE_LABEL (file, name);
312 ASM_OUTPUT_LABEL (file, name);
313 ASM_OUTPUT_SKIP (file, rounded);
318 #ifdef ASM_OUTPUT_ALIGNED_BSS
320 /* Utility function for targets to use in implementing
321 ASM_OUTPUT_ALIGNED_BSS.
322 ??? It is believed that this function will work in most cases so such
323 support is localized here. */
326 asm_output_aligned_bss (file, name, size, align)
331 ASM_GLOBALIZE_LABEL (file, name);
333 ASM_OUTPUT_ALIGN (file, floor_log2 (align / BITS_PER_UNIT));
334 ASM_OUTPUT_LABEL (file, name);
335 ASM_OUTPUT_SKIP (file, size);
340 #endif /* BSS_SECTION_ASM_OP */
342 /* Switch to the section for function DECL.
344 If DECL is NULL_TREE, switch to the text section.
345 ??? It's not clear that we will ever be passed NULL_TREE, but it's
346 safer to handle it. */
349 function_section (decl)
352 if (decl != NULL_TREE
353 && DECL_SECTION_NAME (decl) != NULL_TREE)
354 named_section (decl, (char *) 0);
359 /* Switch to section for variable DECL.
361 RELOC is the `reloc' argument to SELECT_SECTION. */
364 variable_section (decl, reloc)
368 if (IN_NAMED_SECTION (decl))
369 named_section (decl, NULL);
372 /* C++ can have const variables that get initialized from constructors,
373 and thus can not be in a readonly section. We prevent this by
374 verifying that the initial value is constant for objects put in a
377 error_mark_node is used by the C front end to indicate that the
378 initializer has not been seen yet. In this case, we assume that
379 the initializer must be constant.
381 C++ uses error_mark_node for variables that have complicated
382 initializers, but these variables go in BSS so we won't be called
385 #ifdef SELECT_SECTION
386 SELECT_SECTION (decl, reloc);
388 if (TREE_READONLY (decl)
389 && ! TREE_THIS_VOLATILE (decl)
390 && DECL_INITIAL (decl)
391 && (DECL_INITIAL (decl) == error_mark_node
392 || TREE_CONSTANT (DECL_INITIAL (decl)))
393 && ! (flag_pic && reloc))
394 readonly_data_section ();
401 /* Create the rtl to represent a function, for a function definition.
402 DECL is a FUNCTION_DECL node which describes which function.
403 The rtl is stored into DECL. */
406 make_function_rtl (decl)
409 char *name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
413 if (DECL_RTL (decl) == 0)
414 DECL_RTL (decl) = bc_gen_rtx (name, 0, (struct bc_label *) 0);
416 /* Record that at least one function has been defined. */
417 function_defined = 1;
421 /* Rename a nested function to avoid conflicts. */
422 if (decl_function_context (decl) != 0
423 && DECL_INITIAL (decl) != 0
424 && DECL_RTL (decl) == 0)
428 name = IDENTIFIER_POINTER (DECL_NAME (decl));
429 ASM_FORMAT_PRIVATE_NAME (label, name, var_labelno);
430 name = obstack_copy0 (saveable_obstack, label, strlen (label));
434 if (DECL_RTL (decl) == 0)
437 = gen_rtx (MEM, DECL_MODE (decl),
438 gen_rtx (SYMBOL_REF, Pmode, name));
440 /* Optionally set flags or add text to the name to record information
441 such as that it is a function name. If the name is changed, the macro
442 ASM_OUTPUT_LABELREF will have to know how to strip this information. */
443 #ifdef ENCODE_SECTION_INFO
444 ENCODE_SECTION_INFO (decl);
448 /* Record at least one function has been defined. */
449 function_defined = 1;
452 /* Create the DECL_RTL for a declaration for a static or external
453 variable or static or external function.
454 ASMSPEC, if not 0, is the string which the user specified
455 as the assembler symbol name.
456 TOP_LEVEL is nonzero if this is a file-scope variable.
457 This is never called for PARM_DECLs. */
460 bc_make_decl_rtl (decl, asmspec, top_level)
465 register char *name = TREE_STRING_POINTER (DECL_ASSEMBLER_NAME (decl));
467 if (DECL_RTL (decl) == 0)
469 /* Print an error message for register variables. */
470 if (DECL_REGISTER (decl))
471 error ("global register variables not supported in the interpreter");
473 /* Handle ordinary static variables and functions. */
474 if (DECL_RTL (decl) == 0)
476 /* Can't use just the variable's own name for a variable
477 whose scope is less than the whole file.
478 Concatenate a distinguishing number. */
479 if (!top_level && !DECL_EXTERNAL (decl) && asmspec == 0)
483 ASM_FORMAT_PRIVATE_NAME (label, name, var_labelno);
484 name = obstack_copy0 (saveable_obstack, label, strlen (label));
488 DECL_RTL (decl) = bc_gen_rtx (name, 0, (struct bc_label *) 0);
493 /* Given NAME, a putative register name, discard any customary prefixes. */
496 strip_reg_name (name)
499 #ifdef REGISTER_PREFIX
500 if (!strncmp (name, REGISTER_PREFIX, strlen (REGISTER_PREFIX)))
501 name += strlen (REGISTER_PREFIX);
503 if (name[0] == '%' || name[0] == '#')
508 /* Decode an `asm' spec for a declaration as a register name.
509 Return the register number, or -1 if nothing specified,
510 or -2 if the ASMSPEC is not `cc' or `memory' and is not recognized,
511 or -3 if ASMSPEC is `cc' and is not recognized,
512 or -4 if ASMSPEC is `memory' and is not recognized.
513 Accept an exact spelling or a decimal number.
514 Prefixes such as % are optional. */
517 decode_reg_name (asmspec)
524 /* Get rid of confusing prefixes. */
525 asmspec = strip_reg_name (asmspec);
527 /* Allow a decimal number as a "register name". */
528 for (i = strlen (asmspec) - 1; i >= 0; i--)
529 if (! (asmspec[i] >= '0' && asmspec[i] <= '9'))
531 if (asmspec[0] != 0 && i < 0)
534 if (i < FIRST_PSEUDO_REGISTER && i >= 0)
540 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
542 && ! strcmp (asmspec, strip_reg_name (reg_names[i])))
545 #ifdef ADDITIONAL_REGISTER_NAMES
547 static struct { char *name; int number; } table[]
548 = ADDITIONAL_REGISTER_NAMES;
550 for (i = 0; i < sizeof (table) / sizeof (table[0]); i++)
551 if (! strcmp (asmspec, table[i].name))
552 return table[i].number;
554 #endif /* ADDITIONAL_REGISTER_NAMES */
556 if (!strcmp (asmspec, "memory"))
559 if (!strcmp (asmspec, "cc"))
568 /* Create the DECL_RTL for a declaration for a static or external variable
569 or static or external function.
570 ASMSPEC, if not 0, is the string which the user specified
571 as the assembler symbol name.
572 TOP_LEVEL is nonzero if this is a file-scope variable.
574 This is never called for PARM_DECL nodes. */
577 make_decl_rtl (decl, asmspec, top_level)
582 register char *name = 0;
587 bc_make_decl_rtl (decl, asmspec, top_level);
591 reg_number = decode_reg_name (asmspec);
593 if (DECL_ASSEMBLER_NAME (decl) != NULL_TREE)
594 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
596 if (reg_number == -2)
598 /* ASMSPEC is given, and not the name of a register. */
599 name = (char *) obstack_alloc (saveable_obstack,
600 strlen (asmspec) + 2);
602 strcpy (&name[1], asmspec);
605 /* For a duplicate declaration, we can be called twice on the
606 same DECL node. Don't discard the RTL already made. */
607 if (DECL_RTL (decl) == 0)
611 /* First detect errors in declaring global registers. */
612 if (TREE_CODE (decl) != FUNCTION_DECL
613 && DECL_REGISTER (decl) && reg_number == -1)
614 error_with_decl (decl,
615 "register name not specified for `%s'");
616 else if (TREE_CODE (decl) != FUNCTION_DECL
617 && DECL_REGISTER (decl) && reg_number < 0)
618 error_with_decl (decl,
619 "invalid register name for `%s'");
620 else if ((reg_number >= 0 || reg_number == -3)
621 && (TREE_CODE (decl) == FUNCTION_DECL
622 && ! DECL_REGISTER (decl)))
623 error_with_decl (decl,
624 "register name given for non-register variable `%s'");
625 else if (TREE_CODE (decl) != FUNCTION_DECL
626 && DECL_REGISTER (decl)
627 && TYPE_MODE (TREE_TYPE (decl)) == BLKmode)
628 error_with_decl (decl,
629 "data type of `%s' isn't suitable for a register");
630 else if (TREE_CODE (decl) != FUNCTION_DECL && DECL_REGISTER (decl)
631 && ! HARD_REGNO_MODE_OK (reg_number,
632 TYPE_MODE (TREE_TYPE (decl))))
633 error_with_decl (decl,
634 "register number for `%s' isn't suitable for data type");
635 /* Now handle properly declared static register variables. */
636 else if (TREE_CODE (decl) != FUNCTION_DECL && DECL_REGISTER (decl))
640 if (DECL_INITIAL (decl) != 0 && top_level)
642 DECL_INITIAL (decl) = 0;
643 error ("global register variable has initial value");
645 if (fixed_regs[reg_number] == 0
646 && function_defined && top_level)
647 error ("global register variable follows a function definition");
648 if (TREE_THIS_VOLATILE (decl))
649 warning ("volatile register variables don't work as you might wish");
651 /* If the user specified one of the eliminables registers here,
652 e.g., FRAME_POINTER_REGNUM, we don't want to get this variable
653 confused with that register and be eliminated. Although this
654 usage is somewhat suspect, we nevertheless use the following
655 kludge to avoid setting DECL_RTL to frame_pointer_rtx. */
658 = gen_rtx (REG, DECL_MODE (decl), FIRST_PSEUDO_REGISTER);
659 REGNO (DECL_RTL (decl)) = reg_number;
660 REG_USERVAR_P (DECL_RTL (decl)) = 1;
664 /* Make this register global, so not usable for anything
666 nregs = HARD_REGNO_NREGS (reg_number, DECL_MODE (decl));
668 globalize_reg (reg_number + --nregs);
671 /* Specifying a section attribute on an uninitialized variable does not
672 (and cannot) cause it to be put in the given section. The linker
673 can only put initialized objects in specific sections, everything
674 else goes in bss for the linker to sort out later (otherwise the
675 linker would give a duplicate definition error for each compilation
676 unit that behaved thusly). So warn the user. */
677 else if (TREE_CODE (decl) == VAR_DECL
678 && DECL_SECTION_NAME (decl) != NULL_TREE
679 && DECL_INITIAL (decl) == NULL_TREE
680 && DECL_COMMON (decl)
683 warning_with_decl (decl,
684 "section attribute ignored for uninitialized variable `%s'");
685 /* Remove the section name so subsequent declarations won't see it.
686 We are ignoring it, remember. */
687 DECL_SECTION_NAME (decl) = NULL_TREE;
690 /* Now handle ordinary static variables and functions (in memory).
691 Also handle vars declared register invalidly. */
692 if (DECL_RTL (decl) == 0)
694 /* Can't use just the variable's own name for a variable
695 whose scope is less than the whole file.
696 Concatenate a distinguishing number. */
697 if (!top_level && !DECL_EXTERNAL (decl) && asmspec == 0)
701 ASM_FORMAT_PRIVATE_NAME (label, name, var_labelno);
702 name = obstack_copy0 (saveable_obstack, label, strlen (label));
709 DECL_RTL (decl) = gen_rtx (MEM, DECL_MODE (decl),
710 gen_rtx (SYMBOL_REF, Pmode, name));
712 /* If this variable is to be treated as volatile, show its
713 tree node has side effects. If it has side effects, either
714 because of this test or from TREE_THIS_VOLATILE also
715 being set, show the MEM is volatile. */
716 if (flag_volatile_global && TREE_CODE (decl) == VAR_DECL
717 && TREE_PUBLIC (decl))
718 TREE_SIDE_EFFECTS (decl) = 1;
719 if (TREE_SIDE_EFFECTS (decl))
720 MEM_VOLATILE_P (DECL_RTL (decl)) = 1;
722 if (TREE_READONLY (decl))
723 RTX_UNCHANGING_P (DECL_RTL (decl)) = 1;
724 MEM_IN_STRUCT_P (DECL_RTL (decl))
725 = AGGREGATE_TYPE_P (TREE_TYPE (decl));
727 /* Optionally set flags or add text to the name to record information
728 such as that it is a function name.
729 If the name is changed, the macro ASM_OUTPUT_LABELREF
730 will have to know how to strip this information. */
731 #ifdef ENCODE_SECTION_INFO
732 ENCODE_SECTION_INFO (decl);
736 /* If the old RTL had the wrong mode, fix the mode. */
737 else if (GET_MODE (DECL_RTL (decl)) != DECL_MODE (decl))
739 rtx rtl = DECL_RTL (decl);
740 PUT_MODE (rtl, DECL_MODE (decl));
744 /* Make the rtl for variable VAR be volatile.
745 Use this only for static variables. */
748 make_var_volatile (var)
751 if (GET_CODE (DECL_RTL (var)) != MEM)
754 MEM_VOLATILE_P (DECL_RTL (var)) = 1;
757 /* Output alignment directive to align for constant expression EXP. */
760 assemble_constant_align (exp)
765 /* Align the location counter as required by EXP's data type. */
766 align = TYPE_ALIGN (TREE_TYPE (exp));
767 #ifdef CONSTANT_ALIGNMENT
768 align = CONSTANT_ALIGNMENT (exp, align);
771 if (align > BITS_PER_UNIT)
772 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
775 /* Output a string of literal assembler code
776 for an `asm' keyword used between functions. */
779 assemble_asm (string)
784 error ("asm statements not allowed in interpreter");
790 if (TREE_CODE (string) == ADDR_EXPR)
791 string = TREE_OPERAND (string, 0);
793 fprintf (asm_out_file, "\t%s\n", TREE_STRING_POINTER (string));
796 #if 0 /* This should no longer be needed, because
797 flag_gnu_linker should be 0 on these systems,
798 which should prevent any output
799 if ASM_OUTPUT_CONSTRUCTOR and ASM_OUTPUT_DESTRUCTOR are absent. */
800 #if !(defined(DBX_DEBUGGING_INFO) && !defined(FASCIST_ASSEMBLER))
801 #ifndef ASM_OUTPUT_CONSTRUCTOR
802 #define ASM_OUTPUT_CONSTRUCTOR(file, name)
804 #ifndef ASM_OUTPUT_DESTRUCTOR
805 #define ASM_OUTPUT_DESTRUCTOR(file, name)
810 /* Record an element in the table of global destructors.
811 How this is done depends on what sort of assembler and linker
814 NAME should be the name of a global function to be called
815 at exit time. This name is output using assemble_name. */
818 assemble_destructor (name)
821 #ifdef ASM_OUTPUT_DESTRUCTOR
822 ASM_OUTPUT_DESTRUCTOR (asm_out_file, name);
826 /* Now tell GNU LD that this is part of the static destructor set. */
827 /* This code works for any machine provided you use GNU as/ld. */
828 fprintf (asm_out_file, "%s \"___DTOR_LIST__\",22,0,0,", ASM_STABS_OP);
829 assemble_name (asm_out_file, name);
830 fputc ('\n', asm_out_file);
835 /* Likewise for global constructors. */
838 assemble_constructor (name)
841 #ifdef ASM_OUTPUT_CONSTRUCTOR
842 ASM_OUTPUT_CONSTRUCTOR (asm_out_file, name);
846 /* Now tell GNU LD that this is part of the static constructor set. */
847 /* This code works for any machine provided you use GNU as/ld. */
848 fprintf (asm_out_file, "%s \"___CTOR_LIST__\",22,0,0,", ASM_STABS_OP);
849 assemble_name (asm_out_file, name);
850 fputc ('\n', asm_out_file);
855 /* Likewise for entries we want to record for garbage collection.
856 Garbage collection is still under development. */
859 assemble_gc_entry (name)
862 #ifdef ASM_OUTPUT_GC_ENTRY
863 ASM_OUTPUT_GC_ENTRY (asm_out_file, name);
867 /* Now tell GNU LD that this is part of the static constructor set. */
868 fprintf (asm_out_file, "%s \"___PTR_LIST__\",22,0,0,", ASM_STABS_OP);
869 assemble_name (asm_out_file, name);
870 fputc ('\n', asm_out_file);
875 /* Output assembler code for the constant pool of a function and associated
876 with defining the name of the function. DECL describes the function.
877 NAME is the function's name. For the constant pool, we use the current
878 constant pool data. */
881 assemble_start_function (decl, fnname)
887 /* The following code does not need preprocessing in the assembler. */
891 output_constant_pool (fnname, decl);
893 function_section (decl);
895 /* Tell assembler to move to target machine's alignment for functions. */
896 align = floor_log2 (FUNCTION_BOUNDARY / BITS_PER_UNIT);
900 BC_OUTPUT_ALIGN (asm_out_file, align);
902 ASM_OUTPUT_ALIGN (asm_out_file, align);
905 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
906 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file, fnname);
909 #ifdef SDB_DEBUGGING_INFO
910 /* Output SDB definition of the function. */
911 if (write_symbols == SDB_DEBUG)
912 sdbout_mark_begin_function ();
915 #ifdef DBX_DEBUGGING_INFO
916 /* Output DBX definition of the function. */
917 if (write_symbols == DBX_DEBUG)
918 dbxout_begin_function (decl);
921 /* Make function name accessible from other files, if appropriate. */
923 if (TREE_PUBLIC (decl))
925 if (!first_global_object_name)
929 STRIP_NAME_ENCODING (p, fnname);
930 first_global_object_name = permalloc (strlen (p) + 1);
931 strcpy (first_global_object_name, p);
934 #ifdef ASM_WEAKEN_LABEL
935 if (DECL_WEAK (decl))
936 ASM_WEAKEN_LABEL (asm_out_file, fnname);
940 BC_GLOBALIZE_LABEL (asm_out_file, fnname);
942 ASM_GLOBALIZE_LABEL (asm_out_file, fnname);
945 /* Do any machine/system dependent processing of the function name */
946 #ifdef ASM_DECLARE_FUNCTION_NAME
947 ASM_DECLARE_FUNCTION_NAME (asm_out_file, fnname, current_function_decl);
949 /* Standard thing is just output label for the function. */
951 BC_OUTPUT_LABEL (asm_out_file, fnname);
953 ASM_OUTPUT_LABEL (asm_out_file, fnname);
954 #endif /* ASM_DECLARE_FUNCTION_NAME */
957 /* Output assembler code associated with defining the size of the
958 function. DECL describes the function. NAME is the function's name. */
961 assemble_end_function (decl, fnname)
965 #ifdef ASM_DECLARE_FUNCTION_SIZE
966 ASM_DECLARE_FUNCTION_SIZE (asm_out_file, fnname, decl);
970 /* Assemble code to leave SIZE bytes of zeros. */
973 assemble_zeros (size)
978 bc_emit_const_skip (size);
982 #ifdef ASM_NO_SKIP_IN_TEXT
983 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
984 so we must output 0s explicitly in the text section. */
985 if (ASM_NO_SKIP_IN_TEXT && in_text_section ())
989 for (i = 0; i < size - 20; i += 20)
992 fprintf (asm_out_file,
993 "%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);
995 fprintf (asm_out_file,
996 "\tbyte 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n");
1002 fprintf (asm_out_file, "%s 0", ASM_BYTE_OP);
1004 fprintf (asm_out_file, "\tbyte 0");
1007 for (; i < size; i++)
1008 fprintf (asm_out_file, ",0");
1009 fprintf (asm_out_file, "\n");
1016 if (output_bytecode)
1017 BC_OUTPUT_SKIP (asm_out_file, size);
1019 ASM_OUTPUT_SKIP (asm_out_file, size);
1023 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
1026 assemble_align (align)
1029 if (align > BITS_PER_UNIT)
1030 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
1033 /* Assemble a string constant with the specified C string as contents. */
1036 assemble_string (p, size)
1044 if (output_bytecode)
1050 /* If the string is very long, split it up. */
1054 int thissize = size - pos;
1055 if (thissize > maximum)
1058 if (output_bytecode)
1059 bc_output_ascii (asm_out_file, p, thissize);
1062 ASM_OUTPUT_ASCII (asm_out_file, p, thissize);
1071 bc_output_ascii (file, p, size)
1076 BC_OUTPUT_ASCII (file, p, size);
1079 /* Assemble everything that is needed for a variable or function declaration.
1080 Not used for automatic variables, and not used for function definitions.
1081 Should not be called for variables of incomplete structure type.
1083 TOP_LEVEL is nonzero if this variable has file scope.
1084 AT_END is nonzero if this is the special handling, at end of compilation,
1085 to define things that have had only tentative definitions.
1086 DONT_OUTPUT_DATA if nonzero means don't actually output the
1087 initial value (that will be done by the caller). */
1090 assemble_variable (decl, top_level, at_end, dont_output_data)
1094 int dont_output_data;
1096 register char *name;
1100 enum in_section saved_in_section;
1102 last_assemble_variable_decl = 0;
1104 if (output_bytecode)
1107 if (GET_CODE (DECL_RTL (decl)) == REG)
1109 /* Do output symbol info for global register variables, but do nothing
1112 if (TREE_ASM_WRITTEN (decl))
1114 TREE_ASM_WRITTEN (decl) = 1;
1116 if (!output_bytecode)
1118 #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
1119 /* File-scope global variables are output here. */
1120 if ((write_symbols == DBX_DEBUG || write_symbols == XCOFF_DEBUG)
1122 dbxout_symbol (decl, 0);
1124 #ifdef SDB_DEBUGGING_INFO
1125 if (write_symbols == SDB_DEBUG && top_level
1126 /* Leave initialized global vars for end of compilation;
1127 see comment in compile_file. */
1128 && (TREE_PUBLIC (decl) == 0 || DECL_INITIAL (decl) == 0))
1129 sdbout_symbol (decl, 0);
1133 /* Don't output any DWARF debugging information for variables here.
1134 In the case of local variables, the information for them is output
1135 when we do our recursive traversal of the tree representation for
1136 the entire containing function. In the case of file-scope variables,
1137 we output information for all of them at the very end of compilation
1138 while we are doing our final traversal of the chain of file-scope
1144 /* Normally no need to say anything here for external references,
1145 since assemble_external is called by the language-specific code
1146 when a declaration is first seen. */
1148 if (DECL_EXTERNAL (decl))
1151 /* Output no assembler code for a function declaration.
1152 Only definitions of functions output anything. */
1154 if (TREE_CODE (decl) == FUNCTION_DECL)
1157 /* If type was incomplete when the variable was declared,
1158 see if it is complete now. */
1160 if (DECL_SIZE (decl) == 0)
1161 layout_decl (decl, 0);
1163 /* Still incomplete => don't allocate it; treat the tentative defn
1164 (which is what it must have been) as an `extern' reference. */
1166 if (!dont_output_data && DECL_SIZE (decl) == 0)
1168 error_with_file_and_line (DECL_SOURCE_FILE (decl),
1169 DECL_SOURCE_LINE (decl),
1170 "storage size of `%s' isn't known",
1171 IDENTIFIER_POINTER (DECL_NAME (decl)));
1172 TREE_ASM_WRITTEN (decl) = 1;
1176 /* The first declaration of a variable that comes through this function
1177 decides whether it is global (in C, has external linkage)
1178 or local (in C, has internal linkage). So do nothing more
1179 if this function has already run. */
1181 if (TREE_ASM_WRITTEN (decl))
1184 TREE_ASM_WRITTEN (decl) = 1;
1188 if (! dont_output_data)
1190 if (TREE_CODE (DECL_SIZE (decl)) != INTEGER_CST)
1193 /* This is better than explicit arithmetic, since it avoids overflow. */
1194 size_tree = size_binop (CEIL_DIV_EXPR,
1195 DECL_SIZE (decl), size_int (BITS_PER_UNIT));
1197 if (TREE_INT_CST_HIGH (size_tree) != 0)
1199 error_with_decl (decl, "size of variable `%s' is too large");
1204 name = XSTR (XEXP (DECL_RTL (decl), 0), 0);
1206 /* Handle uninitialized definitions. */
1208 /* ANSI specifies that a tentative definition which is not merged with
1209 a non-tentative definition behaves exactly like a definition with an
1210 initializer equal to zero. (Section 3.7.2)
1211 -fno-common gives strict ANSI behavior. Usually you don't want it.
1212 This matters only for variables with external linkage. */
1214 if ((DECL_INITIAL (decl) == 0 || DECL_INITIAL (decl) == error_mark_node)
1215 /* If the target can't output uninitialized but not common global data
1216 in .bss, then we have to use .data. */
1217 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
1218 && (! flag_no_common || ! TREE_PUBLIC (decl))
1219 && DECL_COMMON (decl)
1221 && ! dont_output_data)
1223 int size = TREE_INT_CST_LOW (size_tree);
1226 /* Don't allocate zero bytes of common,
1227 since that means "undefined external" in the linker. */
1228 if (size == 0) rounded = 1;
1229 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1230 so that each uninitialized object starts on such a boundary. */
1231 rounded += (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1;
1232 rounded = (rounded / (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
1233 * (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
1235 #ifdef DBX_DEBUGGING_INFO
1236 /* File-scope global variables are output here. */
1237 if (write_symbols == DBX_DEBUG && top_level)
1238 dbxout_symbol (decl, 0);
1240 #ifdef SDB_DEBUGGING_INFO
1241 if (write_symbols == SDB_DEBUG && top_level
1242 /* Leave initialized global vars for end of compilation;
1243 see comment in compile_file. */
1244 && (TREE_PUBLIC (decl) == 0 || DECL_INITIAL (decl) == 0))
1245 sdbout_symbol (decl, 0);
1248 /* Don't output any DWARF debugging information for variables here.
1249 In the case of local variables, the information for them is output
1250 when we do our recursive traversal of the tree representation for
1251 the entire containing function. In the case of file-scope variables,
1252 we output information for all of them at the very end of compilation
1253 while we are doing our final traversal of the chain of file-scope
1256 #if 0 /* ??? We should either delete this or add a comment describing what
1257 it was intended to do and why we shouldn't delete it. */
1258 if (flag_shared_data)
1262 if (TREE_PUBLIC (decl)
1263 #if defined (ASM_OUTPUT_BSS) || defined (ASM_OUTPUT_ALIGNED_BSS)
1264 && DECL_COMMON (decl)
1269 #ifdef ASM_OUTPUT_SHARED_COMMON
1270 if (flag_shared_data)
1271 ASM_OUTPUT_SHARED_COMMON (asm_out_file, name, size, rounded);
1274 if (output_bytecode)
1276 BC_OUTPUT_COMMON (asm_out_file, name, size, rounded);
1280 #ifdef ASM_OUTPUT_ALIGNED_COMMON
1281 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file, name, size,
1284 ASM_OUTPUT_COMMON (asm_out_file, name, size, rounded);
1288 #if defined (ASM_OUTPUT_BSS) || defined (ASM_OUTPUT_ALIGNED_BSS)
1289 else if (TREE_PUBLIC (decl))
1291 #ifdef ASM_OUTPUT_SHARED_BSS
1292 if (flag_shared_data)
1293 ASM_OUTPUT_SHARED_BSS (asm_out_file, name, size, rounded);
1296 if (output_bytecode)
1298 BC_OUTPUT_BSS (asm_out_file, name, size, rounded);
1302 #ifdef ASM_OUTPUT_ALIGNED_BSS
1303 ASM_OUTPUT_ALIGNED_BSS (asm_out_file, name, size,
1306 ASM_OUTPUT_BSS (asm_out_file, name, size, rounded);
1310 #endif /* ASM_OUTPUT_BSS || ASM_OUTPUT_ALIGNED_BSS */
1313 #ifdef ASM_OUTPUT_SHARED_LOCAL
1314 if (flag_shared_data)
1315 ASM_OUTPUT_SHARED_LOCAL (asm_out_file, name, size, rounded);
1318 if (output_bytecode)
1320 BC_OUTPUT_LOCAL (asm_out_file, name, size, rounded);
1324 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1325 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size,
1328 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded);
1335 /* Handle initialized definitions.
1336 Also handle uninitialized global definitions if -fno-common and the
1337 target doesn't support ASM_OUTPUT_BSS. */
1339 /* First make the assembler name(s) global if appropriate. */
1340 if (TREE_PUBLIC (decl) && DECL_NAME (decl))
1342 if (!first_global_object_name)
1346 STRIP_NAME_ENCODING (p, name);
1347 first_global_object_name = permalloc (strlen (p) + 1);
1348 strcpy (first_global_object_name, p);
1351 #ifdef ASM_WEAKEN_LABEL
1352 if (DECL_WEAK (decl))
1353 ASM_WEAKEN_LABEL (asm_out_file, name);
1356 ASM_GLOBALIZE_LABEL (asm_out_file, name);
1359 for (d = equivalents; d; d = TREE_CHAIN (d))
1361 tree e = TREE_VALUE (d);
1362 if (TREE_PUBLIC (e) && DECL_NAME (e))
1363 ASM_GLOBALIZE_LABEL (asm_out_file,
1364 XSTR (XEXP (DECL_RTL (e), 0), 0));
1368 /* Output any data that we will need to use the address of. */
1369 if (DECL_INITIAL (decl) == error_mark_node)
1370 reloc = contains_pointers_p (TREE_TYPE (decl));
1371 else if (DECL_INITIAL (decl))
1372 reloc = output_addressed_constants (DECL_INITIAL (decl));
1374 /* Switch to the appropriate section. */
1375 variable_section (decl, reloc);
1377 /* dbxout.c needs to know this. */
1378 if (in_text_section ())
1379 DECL_IN_TEXT_SECTION (decl) = 1;
1381 /* Record current section so we can restore it if dbxout.c clobbers it. */
1382 saved_in_section = in_section;
1384 /* Output the dbx info now that we have chosen the section. */
1386 #ifdef DBX_DEBUGGING_INFO
1387 /* File-scope global variables are output here. */
1388 if (write_symbols == DBX_DEBUG && top_level)
1389 dbxout_symbol (decl, 0);
1391 #ifdef SDB_DEBUGGING_INFO
1392 if (write_symbols == SDB_DEBUG && top_level
1393 /* Leave initialized global vars for end of compilation;
1394 see comment in compile_file. */
1395 && (TREE_PUBLIC (decl) == 0 || DECL_INITIAL (decl) == 0))
1396 sdbout_symbol (decl, 0);
1399 /* Don't output any DWARF debugging information for variables here.
1400 In the case of local variables, the information for them is output
1401 when we do our recursive traversal of the tree representation for
1402 the entire containing function. In the case of file-scope variables,
1403 we output information for all of them at the very end of compilation
1404 while we are doing our final traversal of the chain of file-scope
1407 /* If the debugging output changed sections, reselect the section
1408 that's supposed to be selected. */
1409 if (in_section != saved_in_section)
1410 variable_section (decl, reloc);
1412 /* Compute and output the alignment of this data. */
1414 align = DECL_ALIGN (decl);
1415 /* In the case for initialing an array whose length isn't specified,
1416 where we have not yet been able to do the layout,
1417 figure out the proper alignment now. */
1418 if (dont_output_data && DECL_SIZE (decl) == 0
1419 && TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE)
1420 align = MAX (align, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl))));
1422 /* Some object file formats have a maximum alignment which they support.
1423 In particular, a.out format supports a maximum alignment of 4. */
1424 #ifndef MAX_OFILE_ALIGNMENT
1425 #define MAX_OFILE_ALIGNMENT BIGGEST_ALIGNMENT
1427 if (align > MAX_OFILE_ALIGNMENT)
1429 warning_with_decl (decl,
1430 "alignment of `%s' is greater than maximum object file alignment");
1431 align = MAX_OFILE_ALIGNMENT;
1433 #ifdef DATA_ALIGNMENT
1434 /* On some machines, it is good to increase alignment sometimes. */
1435 align = DATA_ALIGNMENT (TREE_TYPE (decl), align);
1437 #ifdef CONSTANT_ALIGNMENT
1438 if (DECL_INITIAL (decl))
1439 align = CONSTANT_ALIGNMENT (DECL_INITIAL (decl), align);
1442 /* Reset the alignment in case we have made it tighter, so we can benefit
1443 from it in get_pointer_alignment. */
1444 DECL_ALIGN (decl) = align;
1446 if (align > BITS_PER_UNIT)
1448 if (output_bytecode)
1449 BC_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
1451 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
1454 /* Do any machine/system dependent processing of the object. */
1455 #ifdef ASM_DECLARE_OBJECT_NAME
1456 last_assemble_variable_decl = decl;
1457 ASM_DECLARE_OBJECT_NAME (asm_out_file, name, decl);
1459 /* Standard thing is just output label for the object. */
1460 if (output_bytecode)
1461 BC_OUTPUT_LABEL (asm_out_file, name);
1463 ASM_OUTPUT_LABEL (asm_out_file, name);
1464 #endif /* ASM_DECLARE_OBJECT_NAME */
1466 if (!dont_output_data)
1468 if (DECL_INITIAL (decl))
1469 /* Output the actual data. */
1470 output_constant (DECL_INITIAL (decl), TREE_INT_CST_LOW (size_tree));
1472 /* Leave space for it. */
1473 assemble_zeros (TREE_INT_CST_LOW (size_tree));
1477 #ifdef XCOFF_DEBUGGING_INFO
1478 /* Unfortunately, the IBM assembler cannot handle stabx before the actual
1479 declaration. When something like ".stabx "aa:S-2",aa,133,0" is emitted
1480 and `aa' hasn't been output yet, the assembler generates a stab entry with
1481 a value of zero, in addition to creating an unnecessary external entry
1482 for `aa'. Hence, we must postpone dbxout_symbol to here at the end. */
1484 /* File-scope global variables are output here. */
1485 if (write_symbols == XCOFF_DEBUG && top_level)
1487 saved_in_section = in_section;
1489 dbxout_symbol (decl, 0);
1491 if (in_section != saved_in_section)
1492 variable_section (decl, reloc);
1495 /* There must be a statement after a label. */
1500 /* Return 1 if type TYPE contains any pointers. */
1503 contains_pointers_p (type)
1506 switch (TREE_CODE (type))
1509 case REFERENCE_TYPE:
1510 /* I'm not sure whether OFFSET_TYPE needs this treatment,
1511 so I'll play safe and return 1. */
1517 case QUAL_UNION_TYPE:
1520 /* For a type that has fields, see if the fields have pointers. */
1521 for (fields = TYPE_FIELDS (type); fields; fields = TREE_CHAIN (fields))
1522 if (TREE_CODE (fields) == FIELD_DECL
1523 && contains_pointers_p (TREE_TYPE (fields)))
1529 /* An array type contains pointers if its element type does. */
1530 return contains_pointers_p (TREE_TYPE (type));
1537 /* Output text storage for constructor CONSTR. */
1540 bc_output_constructor (constr, size)
1546 /* Must always be a literal; non-literal constructors are handled
1549 if (!TREE_CONSTANT (constr))
1556 for (i = 0; TYPE_ALIGN (constr) >= BITS_PER_UNIT << (i + 1); i++)
1560 BC_OUTPUT_ALIGN (asm_out_file, i);
1563 output_constant (constr, size);
1566 /* Create storage for constructor CONSTR. */
1569 bc_output_data_constructor (constr)
1574 /* Put in data section */
1578 for (i = 0; TYPE_ALIGN (constr) >= BITS_PER_UNIT << (i + 1); i++);
1580 BC_OUTPUT_ALIGN (asm_out_file, i);
1582 /* The constructor is filled in at runtime. */
1583 BC_OUTPUT_SKIP (asm_out_file, int_size_in_bytes (TREE_TYPE (constr)));
1586 /* Output something to declare an external symbol to the assembler.
1587 (Most assemblers don't need this, so we normally output nothing.)
1588 Do nothing if DECL is not external. */
1591 assemble_external (decl)
1594 if (output_bytecode)
1597 #ifdef ASM_OUTPUT_EXTERNAL
1598 if (TREE_CODE_CLASS (TREE_CODE (decl)) == 'd'
1599 && DECL_EXTERNAL (decl) && TREE_PUBLIC (decl))
1601 rtx rtl = DECL_RTL (decl);
1603 if (GET_CODE (rtl) == MEM && GET_CODE (XEXP (rtl, 0)) == SYMBOL_REF
1604 && ! SYMBOL_REF_USED (XEXP (rtl, 0)))
1606 /* Some systems do require some output. */
1607 SYMBOL_REF_USED (XEXP (rtl, 0)) = 1;
1608 ASM_OUTPUT_EXTERNAL (asm_out_file, decl, XSTR (XEXP (rtl, 0), 0));
1614 /* Similar, for calling a library function FUN. */
1617 assemble_external_libcall (fun)
1620 #ifdef ASM_OUTPUT_EXTERNAL_LIBCALL
1621 if (!output_bytecode)
1623 /* Declare library function name external when first used, if nec. */
1624 if (! SYMBOL_REF_USED (fun))
1626 SYMBOL_REF_USED (fun) = 1;
1627 ASM_OUTPUT_EXTERNAL_LIBCALL (asm_out_file, fun);
1633 /* Declare the label NAME global. */
1636 assemble_global (name)
1639 ASM_GLOBALIZE_LABEL (asm_out_file, name);
1642 /* Assemble a label named NAME. */
1645 assemble_label (name)
1648 if (output_bytecode)
1649 BC_OUTPUT_LABEL (asm_out_file, name);
1651 ASM_OUTPUT_LABEL (asm_out_file, name);
1654 /* Output to FILE a reference to the assembler name of a C-level name NAME.
1655 If NAME starts with a *, the rest of NAME is output verbatim.
1656 Otherwise NAME is transformed in an implementation-defined way
1657 (usually by the addition of an underscore).
1658 Many macros in the tm file are defined to call this function. */
1661 assemble_name (file, name)
1666 int save_warn_id_clash = warn_id_clash;
1668 STRIP_NAME_ENCODING (real_name, name);
1670 /* Don't warn about an identifier name length clash on this name, since
1671 it can be a user symbol suffixed by a number. */
1673 TREE_SYMBOL_REFERENCED (get_identifier (real_name)) = 1;
1674 warn_id_clash = save_warn_id_clash;
1678 if (output_bytecode)
1679 bc_emit_labelref (name, 0);
1681 fputs (&name[1], file);
1685 if (output_bytecode)
1686 BC_OUTPUT_LABELREF (file, name);
1688 ASM_OUTPUT_LABELREF (file, name);
1692 /* Allocate SIZE bytes writable static space with a gensym name
1693 and return an RTX to refer to its address. */
1696 assemble_static_space (size)
1702 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1703 so that each uninitialized object starts on such a boundary. */
1704 int rounded = ((size + (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1)
1705 / (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
1706 * (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
1709 if (flag_shared_data)
1713 ASM_GENERATE_INTERNAL_LABEL (name, "LF", const_labelno);
1716 namestring = (char *) obstack_alloc (saveable_obstack,
1718 strcpy (namestring, name);
1720 if (output_bytecode)
1721 x = bc_gen_rtx (namestring, 0, (struct bc_label *) 0);
1723 x = gen_rtx (SYMBOL_REF, Pmode, namestring);
1725 if (output_bytecode)
1727 BC_OUTPUT_LOCAL (asm_out_file, name, size, rounded);
1731 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1732 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, BIGGEST_ALIGNMENT);
1734 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded);
1740 /* Assemble the static constant template for function entry trampolines.
1741 This is done at most once per compilation.
1742 Returns an RTX for the address of the template. */
1745 assemble_trampoline_template ()
1751 /* Shouldn't get here */
1752 if (output_bytecode)
1755 /* By default, put trampoline templates in read-only data section. */
1757 #ifdef TRAMPOLINE_SECTION
1758 TRAMPOLINE_SECTION ();
1760 readonly_data_section ();
1763 /* Write the assembler code to define one. */
1764 align = floor_log2 (FUNCTION_BOUNDARY / BITS_PER_UNIT);
1766 ASM_OUTPUT_ALIGN (asm_out_file, align);
1768 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LTRAMP", 0);
1769 TRAMPOLINE_TEMPLATE (asm_out_file);
1771 /* Record the rtl to refer to it. */
1772 ASM_GENERATE_INTERNAL_LABEL (label, "LTRAMP", 0);
1774 = (char *) obstack_copy0 (&permanent_obstack, label, strlen (label));
1775 return gen_rtx (SYMBOL_REF, Pmode, name);
1778 /* Assemble the integer constant X into an object of SIZE bytes.
1779 X must be either a CONST_INT or CONST_DOUBLE.
1781 Return 1 if we were able to output the constant, otherwise 0. If FORCE is
1782 non-zero, abort if we can't output the constant. */
1785 assemble_integer (x, size, force)
1790 /* First try to use the standard 1, 2, 4, 8, and 16 byte
1791 ASM_OUTPUT... macros. */
1795 #ifdef ASM_OUTPUT_CHAR
1797 ASM_OUTPUT_CHAR (asm_out_file, x);
1801 #ifdef ASM_OUTPUT_SHORT
1803 ASM_OUTPUT_SHORT (asm_out_file, x);
1807 #ifdef ASM_OUTPUT_INT
1809 ASM_OUTPUT_INT (asm_out_file, x);
1813 #ifdef ASM_OUTPUT_DOUBLE_INT
1815 ASM_OUTPUT_DOUBLE_INT (asm_out_file, x);
1819 #ifdef ASM_OUTPUT_QUADRUPLE_INT
1821 ASM_OUTPUT_QUADRUPLE_INT (asm_out_file, x);
1826 /* If we couldn't do it that way, there are two other possibilities: First,
1827 if the machine can output an explicit byte and this is a 1 byte constant,
1828 we can use ASM_OUTPUT_BYTE. */
1830 #ifdef ASM_OUTPUT_BYTE
1831 if (size == 1 && GET_CODE (x) == CONST_INT)
1833 ASM_OUTPUT_BYTE (asm_out_file, INTVAL (x));
1838 /* Finally, if SIZE is larger than a single word, try to output the constant
1839 one word at a time. */
1841 if (size > UNITS_PER_WORD)
1844 enum machine_mode mode
1845 = mode_for_size (size * BITS_PER_UNIT, MODE_INT, 0);
1848 for (i = 0; i < size / UNITS_PER_WORD; i++)
1850 word = operand_subword (x, i, 0, mode);
1855 if (! assemble_integer (word, UNITS_PER_WORD, 0))
1859 if (i == size / UNITS_PER_WORD)
1861 /* If we output at least one word and then could not finish,
1862 there is no valid way to continue. */
1873 /* Assemble the floating-point constant D into an object of size MODE. */
1876 assemble_real (d, mode)
1878 enum machine_mode mode;
1880 jmp_buf output_constant_handler;
1882 if (setjmp (output_constant_handler))
1884 error ("floating point trap outputting a constant");
1885 #ifdef REAL_IS_NOT_DOUBLE
1886 bzero ((char *) &d, sizeof d);
1893 set_float_handler (output_constant_handler);
1897 #ifdef ASM_OUTPUT_BYTE_FLOAT
1899 ASM_OUTPUT_BYTE_FLOAT (asm_out_file, d);
1902 #ifdef ASM_OUTPUT_SHORT_FLOAT
1904 ASM_OUTPUT_SHORT_FLOAT (asm_out_file, d);
1907 #ifdef ASM_OUTPUT_THREE_QUARTER_FLOAT
1909 ASM_OUTPUT_THREE_QUARTER_FLOAT (asm_out_file, d);
1912 #ifdef ASM_OUTPUT_FLOAT
1914 ASM_OUTPUT_FLOAT (asm_out_file, d);
1918 #ifdef ASM_OUTPUT_DOUBLE
1920 ASM_OUTPUT_DOUBLE (asm_out_file, d);
1924 #ifdef ASM_OUTPUT_LONG_DOUBLE
1927 ASM_OUTPUT_LONG_DOUBLE (asm_out_file, d);
1935 set_float_handler (NULL_PTR);
1938 /* Here we combine duplicate floating constants to make
1939 CONST_DOUBLE rtx's, and force those out to memory when necessary. */
1941 /* Chain of all CONST_DOUBLE rtx's constructed for the current function.
1942 They are chained through the CONST_DOUBLE_CHAIN.
1943 A CONST_DOUBLE rtx has CONST_DOUBLE_MEM != cc0_rtx iff it is on this chain.
1944 In that case, CONST_DOUBLE_MEM is either a MEM,
1945 or const0_rtx if no MEM has been made for this CONST_DOUBLE yet.
1947 (CONST_DOUBLE_MEM is used only for top-level functions.
1948 See force_const_mem for explanation.) */
1950 static rtx const_double_chain;
1952 /* Return a CONST_DOUBLE or CONST_INT for a value specified as a pair of ints.
1953 For an integer, I0 is the low-order word and I1 is the high-order word.
1954 For a real number, I0 is the word with the low address
1955 and I1 is the word with the high address. */
1958 immed_double_const (i0, i1, mode)
1959 HOST_WIDE_INT i0, i1;
1960 enum machine_mode mode;
1963 int in_current_obstack;
1965 if (GET_MODE_CLASS (mode) == MODE_INT
1966 || GET_MODE_CLASS (mode) == MODE_PARTIAL_INT)
1968 /* We clear out all bits that don't belong in MODE, unless they and our
1969 sign bit are all one. So we get either a reasonable negative value
1970 or a reasonable unsigned value for this mode. */
1971 int width = GET_MODE_BITSIZE (mode);
1972 if (width < HOST_BITS_PER_WIDE_INT
1973 && ((i0 & ((HOST_WIDE_INT) (-1) << (width - 1)))
1974 != ((HOST_WIDE_INT) (-1) << (width - 1))))
1975 i0 &= ((HOST_WIDE_INT) 1 << width) - 1, i1 = 0;
1976 else if (width == HOST_BITS_PER_WIDE_INT
1977 && ! (i1 == ~0 && i0 < 0))
1979 else if (width > 2 * HOST_BITS_PER_WIDE_INT)
1980 /* We cannot represent this value as a constant. */
1983 /* If this would be an entire word for the target, but is not for
1984 the host, then sign-extend on the host so that the number will look
1985 the same way on the host that it would on the target.
1987 For example, when building a 64 bit alpha hosted 32 bit sparc
1988 targeted compiler, then we want the 32 bit unsigned value -1 to be
1989 represented as a 64 bit value -1, and not as 0x00000000ffffffff.
1990 The later confuses the sparc backend. */
1992 if (BITS_PER_WORD < HOST_BITS_PER_WIDE_INT && BITS_PER_WORD == width
1993 && (i0 & ((HOST_WIDE_INT) 1 << (width - 1))))
1994 i0 |= ((HOST_WIDE_INT) (-1) << width);
1996 /* If MODE fits within HOST_BITS_PER_WIDE_INT, always use a CONST_INT.
1998 ??? Strictly speaking, this is wrong if we create a CONST_INT
1999 for a large unsigned constant with the size of MODE being
2000 HOST_BITS_PER_WIDE_INT and later try to interpret that constant in a
2001 wider mode. In that case we will mis-interpret it as a negative
2004 Unfortunately, the only alternative is to make a CONST_DOUBLE
2005 for any constant in any mode if it is an unsigned constant larger
2006 than the maximum signed integer in an int on the host. However,
2007 doing this will break everyone that always expects to see a CONST_INT
2008 for SImode and smaller.
2010 We have always been making CONST_INTs in this case, so nothing new
2013 if (width <= HOST_BITS_PER_WIDE_INT)
2014 i1 = (i0 < 0) ? ~0 : 0;
2016 /* If this integer fits in one word, return a CONST_INT. */
2017 if ((i1 == 0 && i0 >= 0)
2018 || (i1 == ~0 && i0 < 0))
2019 return GEN_INT (i0);
2021 /* We use VOIDmode for integers. */
2025 /* Search the chain for an existing CONST_DOUBLE with the right value.
2026 If one is found, return it. */
2028 for (r = const_double_chain; r; r = CONST_DOUBLE_CHAIN (r))
2029 if (CONST_DOUBLE_LOW (r) == i0 && CONST_DOUBLE_HIGH (r) == i1
2030 && GET_MODE (r) == mode)
2033 /* No; make a new one and add it to the chain.
2035 We may be called by an optimizer which may be discarding any memory
2036 allocated during its processing (such as combine and loop). However,
2037 we will be leaving this constant on the chain, so we cannot tolerate
2038 freed memory. So switch to saveable_obstack for this allocation
2039 and then switch back if we were in current_obstack. */
2041 push_obstacks_nochange ();
2042 rtl_in_saveable_obstack ();
2043 r = gen_rtx (CONST_DOUBLE, mode, 0, i0, i1);
2046 /* Don't touch const_double_chain in nested function; see force_const_mem.
2047 Also, don't touch it if not inside any function. */
2048 if (outer_function_chain == 0 && current_function_decl != 0)
2050 CONST_DOUBLE_CHAIN (r) = const_double_chain;
2051 const_double_chain = r;
2054 /* Store const0_rtx in mem-slot since this CONST_DOUBLE is on the chain.
2055 Actual use of mem-slot is only through force_const_mem. */
2057 CONST_DOUBLE_MEM (r) = const0_rtx;
2062 /* Return a CONST_DOUBLE for a specified `double' value
2063 and machine mode. */
2066 immed_real_const_1 (d, mode)
2068 enum machine_mode mode;
2070 union real_extract u;
2072 int in_current_obstack;
2074 /* Get the desired `double' value as a sequence of ints
2075 since that is how they are stored in a CONST_DOUBLE. */
2079 /* Detect special cases. */
2081 /* Avoid REAL_VALUES_EQUAL here in order to distinguish minus zero. */
2082 if (!bcmp ((char *) &dconst0, (char *) &d, sizeof d))
2083 return CONST0_RTX (mode);
2084 /* Check for NaN first, because some ports (specifically the i386) do not
2085 emit correct ieee-fp code by default, and thus will generate a core
2086 dump here if we pass a NaN to REAL_VALUES_EQUAL and if REAL_VALUES_EQUAL
2087 does a floating point comparison. */
2088 else if (! REAL_VALUE_ISNAN (d) && REAL_VALUES_EQUAL (dconst1, d))
2089 return CONST1_RTX (mode);
2091 if (sizeof u == 2 * sizeof (HOST_WIDE_INT))
2092 return immed_double_const (u.i[0], u.i[1], mode);
2094 /* The rest of this function handles the case where
2095 a float value requires more than 2 ints of space.
2096 It will be deleted as dead code on machines that don't need it. */
2098 /* Search the chain for an existing CONST_DOUBLE with the right value.
2099 If one is found, return it. */
2101 for (r = const_double_chain; r; r = CONST_DOUBLE_CHAIN (r))
2102 if (! bcmp ((char *) &CONST_DOUBLE_LOW (r), (char *) &u, sizeof u)
2103 && GET_MODE (r) == mode)
2106 /* No; make a new one and add it to the chain.
2108 We may be called by an optimizer which may be discarding any memory
2109 allocated during its processing (such as combine and loop). However,
2110 we will be leaving this constant on the chain, so we cannot tolerate
2111 freed memory. So switch to saveable_obstack for this allocation
2112 and then switch back if we were in current_obstack. */
2114 push_obstacks_nochange ();
2115 rtl_in_saveable_obstack ();
2116 r = rtx_alloc (CONST_DOUBLE);
2118 bcopy ((char *) &u, (char *) &CONST_DOUBLE_LOW (r), sizeof u);
2121 /* Don't touch const_double_chain in nested function; see force_const_mem.
2122 Also, don't touch it if not inside any function. */
2123 if (outer_function_chain == 0 && current_function_decl != 0)
2125 CONST_DOUBLE_CHAIN (r) = const_double_chain;
2126 const_double_chain = r;
2129 /* Store const0_rtx in CONST_DOUBLE_MEM since this CONST_DOUBLE is on the
2130 chain, but has not been allocated memory. Actual use of CONST_DOUBLE_MEM
2131 is only through force_const_mem. */
2133 CONST_DOUBLE_MEM (r) = const0_rtx;
2138 /* Return a CONST_DOUBLE rtx for a value specified by EXP,
2139 which must be a REAL_CST tree node. */
2142 immed_real_const (exp)
2145 return immed_real_const_1 (TREE_REAL_CST (exp), TYPE_MODE (TREE_TYPE (exp)));
2148 /* At the end of a function, forget the memory-constants
2149 previously made for CONST_DOUBLEs. Mark them as not on real_constant_chain.
2150 Also clear out real_constant_chain and clear out all the chain-pointers. */
2153 clear_const_double_mem ()
2155 register rtx r, next;
2157 /* Don't touch CONST_DOUBLE_MEM for nested functions.
2158 See force_const_mem for explanation. */
2159 if (outer_function_chain != 0)
2162 for (r = const_double_chain; r; r = next)
2164 next = CONST_DOUBLE_CHAIN (r);
2165 CONST_DOUBLE_CHAIN (r) = 0;
2166 CONST_DOUBLE_MEM (r) = cc0_rtx;
2168 const_double_chain = 0;
2171 /* Given an expression EXP with a constant value,
2172 reduce it to the sum of an assembler symbol and an integer.
2173 Store them both in the structure *VALUE.
2174 Abort if EXP does not reduce. */
2179 HOST_WIDE_INT offset;
2183 decode_addr_const (exp, value)
2185 struct addr_const *value;
2187 register tree target = TREE_OPERAND (exp, 0);
2188 register int offset = 0;
2193 if (TREE_CODE (target) == COMPONENT_REF
2194 && (TREE_CODE (DECL_FIELD_BITPOS (TREE_OPERAND (target, 1)))
2197 offset += TREE_INT_CST_LOW (DECL_FIELD_BITPOS (TREE_OPERAND (target, 1))) / BITS_PER_UNIT;
2198 target = TREE_OPERAND (target, 0);
2200 else if (TREE_CODE (target) == ARRAY_REF)
2202 if (TREE_CODE (TREE_OPERAND (target, 1)) != INTEGER_CST
2203 || TREE_CODE (TYPE_SIZE (TREE_TYPE (target))) != INTEGER_CST)
2205 offset += ((TREE_INT_CST_LOW (TYPE_SIZE (TREE_TYPE (target)))
2206 * TREE_INT_CST_LOW (TREE_OPERAND (target, 1)))
2208 target = TREE_OPERAND (target, 0);
2214 switch (TREE_CODE (target))
2218 x = DECL_RTL (target);
2222 if (output_bytecode)
2223 /* FIXME: this may not be correct, check it */
2224 x = bc_gen_rtx (TREE_STRING_POINTER (target), 0, (struct bc_label *) 0);
2226 x = gen_rtx (MEM, FUNCTION_MODE,
2227 gen_rtx (LABEL_REF, VOIDmode,
2228 label_rtx (TREE_OPERAND (exp, 0))));
2235 x = TREE_CST_RTL (target);
2242 if (!output_bytecode)
2244 if (GET_CODE (x) != MEM)
2250 value->offset = offset;
2253 /* Uniquize all constants that appear in memory.
2254 Each constant in memory thus far output is recorded
2255 in `const_hash_table' with a `struct constant_descriptor'
2256 that contains a polish representation of the value of
2259 We cannot store the trees in the hash table
2260 because the trees may be temporary. */
2262 struct constant_descriptor
2264 struct constant_descriptor *next;
2270 #define MAX_HASH_TABLE 1009
2271 static struct constant_descriptor *const_hash_table[MAX_HASH_TABLE];
2273 /* Compute a hash code for a constant expression. */
2280 register int len, hi, i;
2281 register enum tree_code code = TREE_CODE (exp);
2283 if (code == INTEGER_CST)
2285 p = (char *) &TREE_INT_CST_LOW (exp);
2286 len = 2 * sizeof TREE_INT_CST_LOW (exp);
2288 else if (code == REAL_CST)
2290 p = (char *) &TREE_REAL_CST (exp);
2291 len = sizeof TREE_REAL_CST (exp);
2293 else if (code == STRING_CST)
2294 p = TREE_STRING_POINTER (exp), len = TREE_STRING_LENGTH (exp);
2295 else if (code == COMPLEX_CST)
2296 return const_hash (TREE_REALPART (exp)) * 5
2297 + const_hash (TREE_IMAGPART (exp));
2298 else if (code == CONSTRUCTOR && TREE_CODE (TREE_TYPE (exp)) == SET_TYPE)
2300 len = int_size_in_bytes (TREE_TYPE (exp));
2301 p = (char*) alloca (len);
2302 get_set_constructor_bytes (exp, (unsigned char *) p, len);
2304 else if (code == CONSTRUCTOR)
2308 /* For record type, include the type in the hashing.
2309 We do not do so for array types
2310 because (1) the sizes of the elements are sufficient
2311 and (2) distinct array types can have the same constructor.
2312 Instead, we include the array size because the constructor could
2314 if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE)
2315 hi = ((HOST_WIDE_INT) TREE_TYPE (exp) & ((1 << HASHBITS) - 1))
2318 hi = ((5 + int_size_in_bytes (TREE_TYPE (exp)))
2319 & ((1 << HASHBITS) - 1)) % MAX_HASH_TABLE;
2321 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
2322 if (TREE_VALUE (link))
2323 hi = (hi * 603 + const_hash (TREE_VALUE (link))) % MAX_HASH_TABLE;
2327 else if (code == ADDR_EXPR)
2329 struct addr_const value;
2330 decode_addr_const (exp, &value);
2331 if (GET_CODE (value.base) == SYMBOL_REF)
2333 /* Don't hash the address of the SYMBOL_REF;
2334 only use the offset and the symbol name. */
2336 p = XSTR (value.base, 0);
2337 for (i = 0; p[i] != 0; i++)
2338 hi = ((hi * 613) + (unsigned)(p[i]));
2340 else if (GET_CODE (value.base) == LABEL_REF)
2341 hi = value.offset + CODE_LABEL_NUMBER (XEXP (value.base, 0)) * 13;
2343 hi &= (1 << HASHBITS) - 1;
2344 hi %= MAX_HASH_TABLE;
2347 else if (code == PLUS_EXPR || code == MINUS_EXPR)
2348 return const_hash (TREE_OPERAND (exp, 0)) * 9
2349 + const_hash (TREE_OPERAND (exp, 1));
2350 else if (code == NOP_EXPR || code == CONVERT_EXPR)
2351 return const_hash (TREE_OPERAND (exp, 0)) * 7 + 2;
2353 /* Compute hashing function */
2355 for (i = 0; i < len; i++)
2356 hi = ((hi * 613) + (unsigned)(p[i]));
2358 hi &= (1 << HASHBITS) - 1;
2359 hi %= MAX_HASH_TABLE;
2363 /* Compare a constant expression EXP with a constant-descriptor DESC.
2364 Return 1 if DESC describes a constant with the same value as EXP. */
2367 compare_constant (exp, desc)
2369 struct constant_descriptor *desc;
2371 return 0 != compare_constant_1 (exp, desc->contents);
2374 /* Compare constant expression EXP with a substring P of a constant descriptor.
2375 If they match, return a pointer to the end of the substring matched.
2376 If they do not match, return 0.
2378 Since descriptors are written in polish prefix notation,
2379 this function can be used recursively to test one operand of EXP
2380 against a subdescriptor, and if it succeeds it returns the
2381 address of the subdescriptor for the next operand. */
2384 compare_constant_1 (exp, p)
2388 register char *strp;
2390 register enum tree_code code = TREE_CODE (exp);
2392 if (code != (enum tree_code) *p++)
2395 if (code == INTEGER_CST)
2397 /* Integer constants are the same only if the same width of type. */
2398 if (*p++ != TYPE_PRECISION (TREE_TYPE (exp)))
2400 strp = (char *) &TREE_INT_CST_LOW (exp);
2401 len = 2 * sizeof TREE_INT_CST_LOW (exp);
2403 else if (code == REAL_CST)
2405 /* Real constants are the same only if the same width of type. */
2406 if (*p++ != TYPE_PRECISION (TREE_TYPE (exp)))
2408 strp = (char *) &TREE_REAL_CST (exp);
2409 len = sizeof TREE_REAL_CST (exp);
2411 else if (code == STRING_CST)
2413 if (flag_writable_strings)
2415 strp = TREE_STRING_POINTER (exp);
2416 len = TREE_STRING_LENGTH (exp);
2417 if (bcmp ((char *) &TREE_STRING_LENGTH (exp), p,
2418 sizeof TREE_STRING_LENGTH (exp)))
2420 p += sizeof TREE_STRING_LENGTH (exp);
2422 else if (code == COMPLEX_CST)
2424 p = compare_constant_1 (TREE_REALPART (exp), p);
2425 if (p == 0) return 0;
2426 p = compare_constant_1 (TREE_IMAGPART (exp), p);
2429 else if (code == CONSTRUCTOR && TREE_CODE (TREE_TYPE (exp)) == SET_TYPE)
2431 int xlen = len = int_size_in_bytes (TREE_TYPE (exp));
2432 strp = (char*) alloca (len);
2433 get_set_constructor_bytes (exp, (unsigned char *) strp, len);
2434 if (bcmp ((char *) &xlen, p, sizeof xlen))
2438 else if (code == CONSTRUCTOR)
2441 int length = list_length (CONSTRUCTOR_ELTS (exp));
2444 if (bcmp ((char *) &length, p, sizeof length))
2448 /* For record constructors, insist that the types match.
2449 For arrays, just verify both constructors are for arrays. */
2450 if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE)
2451 type = TREE_TYPE (exp);
2454 if (bcmp ((char *) &type, p, sizeof type))
2458 /* For arrays, insist that the size in bytes match. */
2459 if (TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE)
2461 int size = int_size_in_bytes (TREE_TYPE (exp));
2462 if (bcmp ((char *) &size, p, sizeof size))
2467 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
2469 if (TREE_VALUE (link))
2471 if ((p = compare_constant_1 (TREE_VALUE (link), p)) == 0)
2478 if (bcmp ((char *) &zero, p, sizeof zero))
2486 else if (code == ADDR_EXPR)
2488 struct addr_const value;
2489 decode_addr_const (exp, &value);
2490 strp = (char *) &value.offset;
2491 len = sizeof value.offset;
2492 /* Compare the offset. */
2494 if (*p++ != *strp++)
2496 /* Compare symbol name. */
2497 strp = XSTR (value.base, 0);
2498 len = strlen (strp) + 1;
2500 else if (code == PLUS_EXPR || code == MINUS_EXPR)
2502 p = compare_constant_1 (TREE_OPERAND (exp, 0), p);
2503 if (p == 0) return 0;
2504 p = compare_constant_1 (TREE_OPERAND (exp, 1), p);
2507 else if (code == NOP_EXPR || code == CONVERT_EXPR)
2509 p = compare_constant_1 (TREE_OPERAND (exp, 0), p);
2513 /* Compare constant contents. */
2515 if (*p++ != *strp++)
2521 /* Construct a constant descriptor for the expression EXP.
2522 It is up to the caller to enter the descriptor in the hash table. */
2524 static struct constant_descriptor *
2525 record_constant (exp)
2528 struct constant_descriptor *next = 0;
2531 /* Make a struct constant_descriptor. The first two pointers will
2532 be filled in later. Here we just leave space for them. */
2534 obstack_grow (&permanent_obstack, (char *) &next, sizeof next);
2535 obstack_grow (&permanent_obstack, (char *) &label, sizeof label);
2536 record_constant_1 (exp);
2537 return (struct constant_descriptor *) obstack_finish (&permanent_obstack);
2540 /* Add a description of constant expression EXP
2541 to the object growing in `permanent_obstack'.
2542 No need to return its address; the caller will get that
2543 from the obstack when the object is complete. */
2546 record_constant_1 (exp)
2549 register char *strp;
2551 register enum tree_code code = TREE_CODE (exp);
2553 obstack_1grow (&permanent_obstack, (unsigned int) code);
2558 obstack_1grow (&permanent_obstack, TYPE_PRECISION (TREE_TYPE (exp)));
2559 strp = (char *) &TREE_INT_CST_LOW (exp);
2560 len = 2 * sizeof TREE_INT_CST_LOW (exp);
2564 obstack_1grow (&permanent_obstack, TYPE_PRECISION (TREE_TYPE (exp)));
2565 strp = (char *) &TREE_REAL_CST (exp);
2566 len = sizeof TREE_REAL_CST (exp);
2570 if (flag_writable_strings)
2573 strp = TREE_STRING_POINTER (exp);
2574 len = TREE_STRING_LENGTH (exp);
2575 obstack_grow (&permanent_obstack, (char *) &TREE_STRING_LENGTH (exp),
2576 sizeof TREE_STRING_LENGTH (exp));
2580 record_constant_1 (TREE_REALPART (exp));
2581 record_constant_1 (TREE_IMAGPART (exp));
2585 if (TREE_CODE (TREE_TYPE (exp)) == SET_TYPE)
2587 int nbytes = int_size_in_bytes (TREE_TYPE (exp));
2588 obstack_grow (&permanent_obstack, &nbytes, sizeof (nbytes));
2589 obstack_blank (&permanent_obstack, nbytes);
2590 get_set_constructor_bytes
2591 (exp, (unsigned char *) permanent_obstack.next_free-nbytes,
2598 int length = list_length (CONSTRUCTOR_ELTS (exp));
2601 obstack_grow (&permanent_obstack, (char *) &length, sizeof length);
2603 /* For record constructors, insist that the types match.
2604 For arrays, just verify both constructors are for arrays. */
2605 if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE)
2606 type = TREE_TYPE (exp);
2609 obstack_grow (&permanent_obstack, (char *) &type, sizeof type);
2611 /* For arrays, insist that the size in bytes match. */
2612 if (TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE)
2614 int size = int_size_in_bytes (TREE_TYPE (exp));
2615 obstack_grow (&permanent_obstack, (char *) &size, sizeof size);
2618 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
2620 if (TREE_VALUE (link))
2621 record_constant_1 (TREE_VALUE (link));
2626 obstack_grow (&permanent_obstack,
2627 (char *) &zero, sizeof zero);
2635 struct addr_const value;
2637 decode_addr_const (exp, &value);
2638 /* Record the offset. */
2639 obstack_grow (&permanent_obstack,
2640 (char *) &value.offset, sizeof value.offset);
2641 /* Record the symbol name. */
2642 obstack_grow (&permanent_obstack, XSTR (value.base, 0),
2643 strlen (XSTR (value.base, 0)) + 1);
2649 record_constant_1 (TREE_OPERAND (exp, 0));
2650 record_constant_1 (TREE_OPERAND (exp, 1));
2655 case NON_LVALUE_EXPR:
2656 record_constant_1 (TREE_OPERAND (exp, 0));
2663 /* Record constant contents. */
2664 obstack_grow (&permanent_obstack, strp, len);
2667 /* Record a list of constant expressions that were passed to
2668 output_constant_def but that could not be output right away. */
2670 struct deferred_constant
2672 struct deferred_constant *next;
2678 static struct deferred_constant *deferred_constants;
2680 /* Nonzero means defer output of addressed subconstants
2681 (i.e., those for which output_constant_def is called.) */
2682 static int defer_addressed_constants_flag;
2684 /* Start deferring output of subconstants. */
2687 defer_addressed_constants ()
2689 defer_addressed_constants_flag++;
2692 /* Stop deferring output of subconstants,
2693 and output now all those that have been deferred. */
2696 output_deferred_addressed_constants ()
2698 struct deferred_constant *p, *next;
2700 defer_addressed_constants_flag--;
2702 if (defer_addressed_constants_flag > 0)
2705 for (p = deferred_constants; p; p = next)
2707 output_constant_def_contents (p->exp, p->reloc, p->labelno);
2712 deferred_constants = 0;
2715 /* Make a copy of the whole tree structure for a constant.
2716 This handles the same types of nodes that compare_constant
2717 and record_constant handle. */
2723 switch (TREE_CODE (exp))
2726 /* For ADDR_EXPR, we do not want to copy the decl whose address
2727 is requested. We do want to copy constants though. */
2728 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, 0))) == 'c')
2729 return build1 (TREE_CODE (exp), TREE_TYPE (exp),
2730 copy_constant (TREE_OPERAND (exp, 0)));
2732 return copy_node (exp);
2737 return copy_node (exp);
2740 return build_complex (copy_constant (TREE_REALPART (exp)),
2741 copy_constant (TREE_IMAGPART (exp)));
2745 return build (TREE_CODE (exp), TREE_TYPE (exp),
2746 copy_constant (TREE_OPERAND (exp, 0)),
2747 copy_constant (TREE_OPERAND (exp, 1)));
2751 return build1 (TREE_CODE (exp), TREE_TYPE (exp),
2752 copy_constant (TREE_OPERAND (exp, 0)));
2756 tree copy = copy_node (exp);
2757 tree list = copy_list (CONSTRUCTOR_ELTS (exp));
2760 CONSTRUCTOR_ELTS (copy) = list;
2761 for (tail = list; tail; tail = TREE_CHAIN (tail))
2762 TREE_VALUE (tail) = copy_constant (TREE_VALUE (tail));
2763 if (TREE_CODE (TREE_TYPE (exp)) == SET_TYPE)
2764 for (tail = list; tail; tail = TREE_CHAIN (tail))
2765 TREE_PURPOSE (tail) = copy_constant (TREE_PURPOSE (tail));
2775 /* Return an rtx representing a reference to constant data in memory
2776 for the constant expression EXP.
2778 If assembler code for such a constant has already been output,
2779 return an rtx to refer to it.
2780 Otherwise, output such a constant in memory (or defer it for later)
2781 and generate an rtx for it.
2783 The TREE_CST_RTL of EXP is set up to point to that rtx.
2784 The const_hash_table records which constants already have label strings. */
2787 output_constant_def (exp)
2791 register struct constant_descriptor *desc;
2797 if (TREE_CODE (exp) == INTEGER_CST)
2798 abort (); /* No TREE_CST_RTL slot in these. */
2800 if (TREE_CST_RTL (exp))
2801 return TREE_CST_RTL (exp);
2803 /* Make sure any other constants whose addresses appear in EXP
2804 are assigned label numbers. */
2806 reloc = output_addressed_constants (exp);
2808 /* Compute hash code of EXP. Search the descriptors for that hash code
2809 to see if any of them describes EXP. If yes, the descriptor records
2810 the label number already assigned. */
2812 hash = const_hash (exp) % MAX_HASH_TABLE;
2814 for (desc = const_hash_table[hash]; desc; desc = desc->next)
2815 if (compare_constant (exp, desc))
2817 found = desc->label;
2823 /* No constant equal to EXP is known to have been output.
2824 Make a constant descriptor to enter EXP in the hash table.
2825 Assign the label number and record it in the descriptor for
2826 future calls to this function to find. */
2828 /* Create a string containing the label name, in LABEL. */
2829 ASM_GENERATE_INTERNAL_LABEL (label, "LC", const_labelno);
2831 desc = record_constant (exp);
2832 desc->next = const_hash_table[hash];
2834 = (char *) obstack_copy0 (&permanent_obstack, label, strlen (label));
2835 const_hash_table[hash] = desc;
2839 /* Create a string containing the label name, in LABEL. */
2840 ASM_GENERATE_INTERNAL_LABEL (label, "LC", const_labelno);
2843 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
2845 push_obstacks_nochange ();
2846 if (TREE_PERMANENT (exp))
2847 end_temporary_allocation ();
2849 def = gen_rtx (SYMBOL_REF, Pmode, desc->label);
2852 = gen_rtx (MEM, TYPE_MODE (TREE_TYPE (exp)), def);
2853 RTX_UNCHANGING_P (TREE_CST_RTL (exp)) = 1;
2854 if (AGGREGATE_TYPE_P (TREE_TYPE (exp)))
2855 MEM_IN_STRUCT_P (TREE_CST_RTL (exp)) = 1;
2859 /* Optionally set flags or add text to the name to record information
2860 such as that it is a function name. If the name is changed, the macro
2861 ASM_OUTPUT_LABELREF will have to know how to strip this information. */
2862 #ifdef ENCODE_SECTION_INFO
2863 ENCODE_SECTION_INFO (exp);
2866 /* If this is the first time we've seen this particular constant,
2867 output it (or defer its output for later). */
2870 if (defer_addressed_constants_flag)
2872 struct deferred_constant *p;
2873 p = (struct deferred_constant *) xmalloc (sizeof (struct deferred_constant));
2875 push_obstacks_nochange ();
2876 suspend_momentary ();
2877 p->exp = copy_constant (exp);
2880 p->labelno = const_labelno++;
2881 p->next = deferred_constants;
2882 deferred_constants = p;
2885 output_constant_def_contents (exp, reloc, const_labelno++);
2888 return TREE_CST_RTL (exp);
2891 /* Now output assembler code to define the label for EXP,
2892 and follow it with the data of EXP. */
2895 output_constant_def_contents (exp, reloc, labelno)
2902 if (IN_NAMED_SECTION (exp))
2903 named_section (exp, NULL);
2906 /* First switch to text section, except for writable strings. */
2907 #ifdef SELECT_SECTION
2908 SELECT_SECTION (exp, reloc);
2910 if (((TREE_CODE (exp) == STRING_CST) && flag_writable_strings)
2911 || (flag_pic && reloc))
2914 readonly_data_section ();
2918 /* Align the location counter as required by EXP's data type. */
2919 align = TYPE_ALIGN (TREE_TYPE (exp));
2920 #ifdef CONSTANT_ALIGNMENT
2921 align = CONSTANT_ALIGNMENT (exp, align);
2924 if (align > BITS_PER_UNIT)
2926 if (!output_bytecode)
2928 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
2932 BC_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
2936 /* Output the label itself. */
2937 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LC", labelno);
2939 /* Output the value of EXP. */
2940 output_constant (exp,
2941 (TREE_CODE (exp) == STRING_CST
2942 ? TREE_STRING_LENGTH (exp)
2943 : int_size_in_bytes (TREE_TYPE (exp))));
2947 /* Similar hash facility for making memory-constants
2948 from constant rtl-expressions. It is used on RISC machines
2949 where immediate integer arguments and constant addresses are restricted
2950 so that such constants must be stored in memory.
2952 This pool of constants is reinitialized for each function
2953 so each function gets its own constants-pool that comes right before it.
2955 All structures allocated here are discarded when functions are saved for
2956 inlining, so they do not need to be allocated permanently. */
2958 #define MAX_RTX_HASH_TABLE 61
2959 static struct constant_descriptor **const_rtx_hash_table;
2961 /* Structure to represent sufficient information about a constant so that
2962 it can be output when the constant pool is output, so that function
2963 integration can be done, and to simplify handling on machines that reference
2964 constant pool as base+displacement. */
2966 struct pool_constant
2968 struct constant_descriptor *desc;
2969 struct pool_constant *next;
2970 enum machine_mode mode;
2977 /* Pointers to first and last constant in pool. */
2979 static struct pool_constant *first_pool, *last_pool;
2981 /* Current offset in constant pool (does not include any machine-specific
2984 static int pool_offset;
2986 /* Structure used to maintain hash table mapping symbols used to their
2987 corresponding constants. */
2992 struct pool_constant *pool;
2993 struct pool_sym *next;
2996 static struct pool_sym **const_rtx_sym_hash_table;
2998 /* Hash code for a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true.
2999 The argument is XSTR (... , 0) */
3001 #define SYMHASH(LABEL) \
3002 ((((HOST_WIDE_INT) (LABEL)) & ((1 << HASHBITS) - 1)) % MAX_RTX_HASH_TABLE)
3004 /* Initialize constant pool hashing for next function. */
3007 init_const_rtx_hash_table ()
3009 const_rtx_hash_table
3010 = ((struct constant_descriptor **)
3011 oballoc (MAX_RTX_HASH_TABLE * sizeof (struct constant_descriptor *)));
3012 const_rtx_sym_hash_table
3013 = ((struct pool_sym **)
3014 oballoc (MAX_RTX_HASH_TABLE * sizeof (struct pool_sym *)));
3015 bzero ((char *) const_rtx_hash_table,
3016 MAX_RTX_HASH_TABLE * sizeof (struct constant_descriptor *));
3017 bzero ((char *) const_rtx_sym_hash_table,
3018 MAX_RTX_HASH_TABLE * sizeof (struct pool_sym *));
3020 first_pool = last_pool = 0;
3024 /* Save and restore status for a nested function. */
3027 save_varasm_status (p)
3030 p->const_rtx_hash_table = const_rtx_hash_table;
3031 p->const_rtx_sym_hash_table = const_rtx_sym_hash_table;
3032 p->first_pool = first_pool;
3033 p->last_pool = last_pool;
3034 p->pool_offset = pool_offset;
3038 restore_varasm_status (p)
3041 const_rtx_hash_table = p->const_rtx_hash_table;
3042 const_rtx_sym_hash_table = p->const_rtx_sym_hash_table;
3043 first_pool = p->first_pool;
3044 last_pool = p->last_pool;
3045 pool_offset = p->pool_offset;
3048 enum kind { RTX_DOUBLE, RTX_INT };
3052 #ifdef ONLY_INT_FIELDS
3053 unsigned int kind : 16;
3054 unsigned int mode : 16;
3056 enum kind kind : 16;
3057 enum machine_mode mode : 16;
3060 union real_extract du;
3061 struct addr_const addr;
3062 struct {HOST_WIDE_INT high, low;} di;
3066 /* Express an rtx for a constant integer (perhaps symbolic)
3067 as the sum of a symbol or label plus an explicit integer.
3068 They are stored into VALUE. */
3071 decode_rtx_const (mode, x, value)
3072 enum machine_mode mode;
3074 struct rtx_const *value;
3076 /* Clear the whole structure, including any gaps. */
3079 int *p = (int *) value;
3080 int *end = (int *) (value + 1);
3085 value->kind = RTX_INT; /* Most usual kind. */
3088 switch (GET_CODE (x))
3091 value->kind = RTX_DOUBLE;
3092 if (GET_MODE (x) != VOIDmode)
3094 value->mode = GET_MODE (x);
3095 bcopy ((char *) &CONST_DOUBLE_LOW (x),
3096 (char *) &value->un.du, sizeof value->un.du);
3100 value->un.di.low = CONST_DOUBLE_LOW (x);
3101 value->un.di.high = CONST_DOUBLE_HIGH (x);
3106 value->un.addr.offset = INTVAL (x);
3112 value->un.addr.base = x;
3117 if (GET_CODE (x) == PLUS)
3119 value->un.addr.base = XEXP (x, 0);
3120 if (GET_CODE (XEXP (x, 1)) != CONST_INT)
3122 value->un.addr.offset = INTVAL (XEXP (x, 1));
3124 else if (GET_CODE (x) == MINUS)
3126 value->un.addr.base = XEXP (x, 0);
3127 if (GET_CODE (XEXP (x, 1)) != CONST_INT)
3129 value->un.addr.offset = - INTVAL (XEXP (x, 1));
3139 if (value->kind == RTX_INT && value->un.addr.base != 0)
3140 switch (GET_CODE (value->un.addr.base))
3144 /* Use the string's address, not the SYMBOL_REF's address,
3145 for the sake of addresses of library routines.
3146 For a LABEL_REF, compare labels. */
3147 value->un.addr.base = XEXP (value->un.addr.base, 0);
3151 /* Given a MINUS expression, simplify it if both sides
3152 include the same symbol. */
3155 simplify_subtraction (x)
3158 struct rtx_const val0, val1;
3160 decode_rtx_const (GET_MODE (x), XEXP (x, 0), &val0);
3161 decode_rtx_const (GET_MODE (x), XEXP (x, 1), &val1);
3163 if (val0.un.addr.base == val1.un.addr.base)
3164 return GEN_INT (val0.un.addr.offset - val1.un.addr.offset);
3168 /* Compute a hash code for a constant RTL expression. */
3171 const_hash_rtx (mode, x)
3172 enum machine_mode mode;
3177 struct rtx_const value;
3178 decode_rtx_const (mode, x, &value);
3180 /* Compute hashing function */
3182 for (i = 0; i < sizeof value / sizeof (int); i++)
3183 hi += ((int *) &value)[i];
3185 hi &= (1 << HASHBITS) - 1;
3186 hi %= MAX_RTX_HASH_TABLE;
3190 /* Compare a constant rtl object X with a constant-descriptor DESC.
3191 Return 1 if DESC describes a constant with the same value as X. */
3194 compare_constant_rtx (mode, x, desc)
3195 enum machine_mode mode;
3197 struct constant_descriptor *desc;
3199 register int *p = (int *) desc->contents;
3202 struct rtx_const value;
3204 decode_rtx_const (mode, x, &value);
3205 strp = (int *) &value;
3206 len = sizeof value / sizeof (int);
3208 /* Compare constant contents. */
3210 if (*p++ != *strp++)
3216 /* Construct a constant descriptor for the rtl-expression X.
3217 It is up to the caller to enter the descriptor in the hash table. */
3219 static struct constant_descriptor *
3220 record_constant_rtx (mode, x)
3221 enum machine_mode mode;
3224 struct constant_descriptor *ptr;
3226 struct rtx_const value;
3228 decode_rtx_const (mode, x, &value);
3230 /* Put these things in the saveable obstack so we can ensure it won't
3231 be freed if we are called from combine or some other phase that discards
3232 memory allocated from function_obstack (current_obstack). */
3233 obstack_grow (saveable_obstack, &ptr, sizeof ptr);
3234 obstack_grow (saveable_obstack, &label, sizeof label);
3236 /* Record constant contents. */
3237 obstack_grow (saveable_obstack, &value, sizeof value);
3239 return (struct constant_descriptor *) obstack_finish (saveable_obstack);
3242 /* Given a constant rtx X, make (or find) a memory constant for its value
3243 and return a MEM rtx to refer to it in memory. */
3246 force_const_mem (mode, x)
3247 enum machine_mode mode;
3251 register struct constant_descriptor *desc;
3256 /* If we want this CONST_DOUBLE in the same mode as it is in memory
3257 (this will always be true for floating CONST_DOUBLEs that have been
3258 placed in memory, but not for VOIDmode (integer) CONST_DOUBLEs),
3259 use the previous copy. Otherwise, make a new one. Note that in
3260 the unlikely event that this same CONST_DOUBLE is used in two different
3261 modes in an alternating fashion, we will allocate a lot of different
3262 memory locations, but this should be extremely rare. */
3264 /* Don't use CONST_DOUBLE_MEM in a nested function.
3265 Nested functions have their own constant pools,
3266 so they can't share the same values in CONST_DOUBLE_MEM
3267 with the containing function. */
3268 if (outer_function_chain == 0)
3269 if (GET_CODE (x) == CONST_DOUBLE
3270 && GET_CODE (CONST_DOUBLE_MEM (x)) == MEM
3271 && GET_MODE (CONST_DOUBLE_MEM (x)) == mode)
3272 return CONST_DOUBLE_MEM (x);
3274 /* Compute hash code of X. Search the descriptors for that hash code
3275 to see if any of them describes X. If yes, the descriptor records
3276 the label number already assigned. */
3278 hash = const_hash_rtx (mode, x);
3280 for (desc = const_rtx_hash_table[hash]; desc; desc = desc->next)
3281 if (compare_constant_rtx (mode, x, desc))
3283 found = desc->label;
3289 register struct pool_constant *pool;
3290 register struct pool_sym *sym;
3293 /* No constant equal to X is known to have been output.
3294 Make a constant descriptor to enter X in the hash table.
3295 Assign the label number and record it in the descriptor for
3296 future calls to this function to find. */
3298 desc = record_constant_rtx (mode, x);
3299 desc->next = const_rtx_hash_table[hash];
3300 const_rtx_hash_table[hash] = desc;
3302 /* Align the location counter as required by EXP's data type. */
3303 align = (mode == VOIDmode) ? UNITS_PER_WORD : GET_MODE_SIZE (mode);
3304 if (align > BIGGEST_ALIGNMENT / BITS_PER_UNIT)
3305 align = BIGGEST_ALIGNMENT / BITS_PER_UNIT;
3307 pool_offset += align - 1;
3308 pool_offset &= ~ (align - 1);
3310 /* If RTL is not being placed into the saveable obstack, make a
3311 copy of X that is in the saveable obstack in case we are being
3312 called from combine or some other phase that discards memory
3313 it allocates. We need only do this if it is a CONST, since
3314 no other RTX should be allocated in this situation. */
3315 if (rtl_obstack != saveable_obstack
3316 && GET_CODE (x) == CONST)
3318 push_obstacks_nochange ();
3319 rtl_in_saveable_obstack ();
3321 x = gen_rtx (CONST, GET_MODE (x),
3322 gen_rtx (PLUS, GET_MODE (x),
3323 XEXP (XEXP (x, 0), 0), XEXP (XEXP (x, 0), 1)));
3327 /* Allocate a pool constant descriptor, fill it in, and chain it in. */
3329 pool = (struct pool_constant *) savealloc (sizeof (struct pool_constant));
3333 pool->labelno = const_labelno;
3334 pool->align = align;
3335 pool->offset = pool_offset;
3341 last_pool->next = pool;
3344 pool_offset += GET_MODE_SIZE (mode);
3346 /* Create a string containing the label name, in LABEL. */
3347 ASM_GENERATE_INTERNAL_LABEL (label, "LC", const_labelno);
3352 = (char *) obstack_copy0 (saveable_obstack, label, strlen (label));
3354 /* Add label to symbol hash table. */
3355 hash = SYMHASH (found);
3356 sym = (struct pool_sym *) savealloc (sizeof (struct pool_sym));
3359 sym->next = const_rtx_sym_hash_table[hash];
3360 const_rtx_sym_hash_table[hash] = sym;
3363 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
3365 def = gen_rtx (MEM, mode, gen_rtx (SYMBOL_REF, Pmode, found));
3367 RTX_UNCHANGING_P (def) = 1;
3368 /* Mark the symbol_ref as belonging to this constants pool. */
3369 CONSTANT_POOL_ADDRESS_P (XEXP (def, 0)) = 1;
3370 current_function_uses_const_pool = 1;
3372 if (outer_function_chain == 0)
3373 if (GET_CODE (x) == CONST_DOUBLE)
3375 if (CONST_DOUBLE_MEM (x) == cc0_rtx)
3377 CONST_DOUBLE_CHAIN (x) = const_double_chain;
3378 const_double_chain = x;
3380 CONST_DOUBLE_MEM (x) = def;
3386 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
3387 the corresponding pool_constant structure. */
3389 static struct pool_constant *
3390 find_pool_constant (addr)
3393 struct pool_sym *sym;
3394 char *label = XSTR (addr, 0);
3396 for (sym = const_rtx_sym_hash_table[SYMHASH (label)]; sym; sym = sym->next)
3397 if (sym->label == label)
3403 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
3406 get_pool_constant (addr)
3409 return (find_pool_constant (addr))->constant;
3412 /* Similar, return the mode. */
3415 get_pool_mode (addr)
3418 return (find_pool_constant (addr))->mode;
3421 /* Similar, return the offset in the constant pool. */
3424 get_pool_offset (addr)
3427 return (find_pool_constant (addr))->offset;
3430 /* Return the size of the constant pool. */
3438 /* Write all the constants in the constant pool. */
3441 output_constant_pool (fnname, fndecl)
3445 struct pool_constant *pool;
3447 union real_extract u;
3449 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3450 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file, fnname, fndecl, pool_offset);
3453 for (pool = first_pool; pool; pool = pool->next)
3457 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3458 whose CODE_LABEL has been deleted. This can occur if a jump table
3459 is eliminated by optimization. If so, write a constant of zero
3460 instead. Note that this can also happen by turning the
3461 CODE_LABEL into a NOTE. */
3462 if (((GET_CODE (x) == LABEL_REF
3463 && (INSN_DELETED_P (XEXP (x, 0))
3464 || GET_CODE (XEXP (x, 0)) == NOTE)))
3465 || (GET_CODE (x) == CONST && GET_CODE (XEXP (x, 0)) == PLUS
3466 && GET_CODE (XEXP (XEXP (x, 0), 0)) == LABEL_REF
3467 && (INSN_DELETED_P (XEXP (XEXP (XEXP (x, 0), 0), 0))
3468 || GET_CODE (XEXP (XEXP (XEXP (x, 0), 0), 0)) == NOTE)))
3471 /* First switch to correct section. */
3472 #ifdef SELECT_RTX_SECTION
3473 SELECT_RTX_SECTION (pool->mode, x);
3475 readonly_data_section ();
3478 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3479 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file, x, pool->mode,
3480 pool->align, pool->labelno, done);
3483 if (pool->align > 1)
3484 ASM_OUTPUT_ALIGN (asm_out_file, exact_log2 (pool->align));
3486 /* Output the label. */
3487 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LC", pool->labelno);
3489 /* Output the value of the constant itself. */
3490 switch (GET_MODE_CLASS (pool->mode))
3493 if (GET_CODE (x) != CONST_DOUBLE)
3496 bcopy ((char *) &CONST_DOUBLE_LOW (x), (char *) &u, sizeof u);
3497 assemble_real (u.d, pool->mode);
3501 case MODE_PARTIAL_INT:
3502 assemble_integer (x, GET_MODE_SIZE (pool->mode), 1);
3512 /* Done with this pool. */
3513 first_pool = last_pool = 0;
3516 /* Find all the constants whose addresses are referenced inside of EXP,
3517 and make sure assembler code with a label has been output for each one.
3518 Indicate whether an ADDR_EXPR has been encountered. */
3521 output_addressed_constants (exp)
3526 switch (TREE_CODE (exp))
3530 register tree constant = TREE_OPERAND (exp, 0);
3532 while (TREE_CODE (constant) == COMPONENT_REF)
3534 constant = TREE_OPERAND (constant, 0);
3537 if (TREE_CODE_CLASS (TREE_CODE (constant)) == 'c'
3538 || TREE_CODE (constant) == CONSTRUCTOR)
3539 /* No need to do anything here
3540 for addresses of variables or functions. */
3541 output_constant_def (constant);
3548 reloc = output_addressed_constants (TREE_OPERAND (exp, 0));
3549 reloc |= output_addressed_constants (TREE_OPERAND (exp, 1));
3554 case NON_LVALUE_EXPR:
3555 reloc = output_addressed_constants (TREE_OPERAND (exp, 0));
3561 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
3562 if (TREE_VALUE (link) != 0)
3563 reloc |= output_addressed_constants (TREE_VALUE (link));
3573 /* Output assembler code for constant EXP to FILE, with no label.
3574 This includes the pseudo-op such as ".int" or ".byte", and a newline.
3575 Assumes output_addressed_constants has been done on EXP already.
3577 Generate exactly SIZE bytes of assembler data, padding at the end
3578 with zeros if necessary. SIZE must always be specified.
3580 SIZE is important for structure constructors,
3581 since trailing members may have been omitted from the constructor.
3582 It is also important for initialization of arrays from string constants
3583 since the full length of the string constant might not be wanted.
3584 It is also needed for initialization of unions, where the initializer's
3585 type is just one member, and that may not be as long as the union.
3587 There a case in which we would fail to output exactly SIZE bytes:
3588 for a structure constructor that wants to produce more than SIZE bytes.
3589 But such constructors will never be generated for any possible input. */
3592 output_constant (exp, size)
3596 register enum tree_code code = TREE_CODE (TREE_TYPE (exp));
3602 /* Eliminate the NON_LVALUE_EXPR_EXPR that makes a cast not be an lvalue.
3603 That way we get the constant (we hope) inside it. Also, strip off any
3604 NOP_EXPR that converts between two record, union, array, or set types. */
3605 while ((TREE_CODE (exp) == NOP_EXPR
3606 && (TREE_TYPE (exp) == TREE_TYPE (TREE_OPERAND (exp, 0))
3607 || AGGREGATE_TYPE_P (TREE_TYPE (exp))))
3608 || TREE_CODE (exp) == NON_LVALUE_EXPR)
3609 exp = TREE_OPERAND (exp, 0);
3611 /* Allow a constructor with no elements for any data type.
3612 This means to fill the space with zeros. */
3613 if (TREE_CODE (exp) == CONSTRUCTOR && CONSTRUCTOR_ELTS (exp) == 0)
3615 if (output_bytecode)
3616 bc_emit_const_skip (size);
3618 assemble_zeros (size);
3629 case REFERENCE_TYPE:
3630 /* ??? What about (int)((float)(int)&foo + 4) */
3631 while (TREE_CODE (exp) == NOP_EXPR || TREE_CODE (exp) == CONVERT_EXPR
3632 || TREE_CODE (exp) == NON_LVALUE_EXPR)
3633 exp = TREE_OPERAND (exp, 0);
3635 if (! assemble_integer (expand_expr (exp, NULL_RTX, VOIDmode,
3636 EXPAND_INITIALIZER),
3638 error ("initializer for integer value is too complicated");
3643 if (TREE_CODE (exp) != REAL_CST)
3644 error ("initializer for floating value is not a floating constant");
3646 assemble_real (TREE_REAL_CST (exp),
3647 mode_for_size (size * BITS_PER_UNIT, MODE_FLOAT, 0));
3652 output_constant (TREE_REALPART (exp), size / 2);
3653 output_constant (TREE_IMAGPART (exp), size / 2);
3654 size -= (size / 2) * 2;
3658 if (TREE_CODE (exp) == CONSTRUCTOR)
3660 output_constructor (exp, size);
3663 else if (TREE_CODE (exp) == STRING_CST)
3667 if (size > TREE_STRING_LENGTH (exp))
3669 excess = size - TREE_STRING_LENGTH (exp);
3670 size = TREE_STRING_LENGTH (exp);
3673 assemble_string (TREE_STRING_POINTER (exp), size);
3682 if (TREE_CODE (exp) == CONSTRUCTOR)
3683 output_constructor (exp, size);
3689 if (TREE_CODE (exp) == INTEGER_CST)
3690 assemble_integer (expand_expr (exp, NULL_RTX,
3691 VOIDmode, EXPAND_INITIALIZER),
3693 else if (TREE_CODE (exp) == CONSTRUCTOR)
3695 unsigned char *buffer = (unsigned char *) alloca (size);
3696 if (get_set_constructor_bytes (exp, buffer, size))
3698 assemble_string ((char *) buffer, size);
3701 error ("unknown set constructor type");
3706 assemble_zeros (size);
3709 /* Bytecode specific code to output assembler for integer. */
3712 bc_assemble_integer (exp, size)
3720 /* FIXME: is this fold() business going to be as good as the
3721 expand_expr() using EXPAND_SUM above in the RTL case? I
3723 FIXME: Copied as is from BC-GCC1; may need work. Don't hate. -bson */
3727 while (TREE_CODE (exp) == NOP_EXPR || TREE_CODE (exp) == CONVERT_EXPR)
3728 exp = TREE_OPERAND (exp, 0);
3729 if (TREE_CODE (exp) == INTEGER_CST)
3734 else if (TREE_CODE (exp) == PLUS_EXPR)
3736 const_part = TREE_OPERAND (exp, 0);
3737 while (TREE_CODE (const_part) == NOP_EXPR
3738 || TREE_CODE (const_part) == CONVERT_EXPR)
3739 const_part = TREE_OPERAND (const_part, 0);
3740 addr_part = TREE_OPERAND (exp, 1);
3741 while (TREE_CODE (addr_part) == NOP_EXPR
3742 || TREE_CODE (addr_part) == CONVERT_EXPR)
3743 addr_part = TREE_OPERAND (addr_part, 0);
3744 if (TREE_CODE (const_part) != INTEGER_CST)
3745 tmp = const_part, const_part = addr_part, addr_part = tmp;
3746 if (TREE_CODE (const_part) != INTEGER_CST
3747 || TREE_CODE (addr_part) != ADDR_EXPR)
3748 abort (); /* FIXME: we really haven't considered
3749 all the possible cases here. */
3751 else if (TREE_CODE (exp) == ADDR_EXPR)
3753 const_part = integer_zero_node;
3757 abort (); /* FIXME: ditto previous. */
3763 char c = TREE_INT_CST_LOW (const_part);
3769 short s = TREE_INT_CST_LOW (const_part);
3770 bc_emit ((char *) &s, 2);
3775 int i = TREE_INT_CST_LOW (const_part);
3776 bc_emit ((char *) &i, 4);
3781 if (WORDS_BIG_ENDIAN)
3783 int i = TREE_INT_CST_HIGH (const_part);
3784 bc_emit ((char *) &i, 4);
3785 i = TREE_INT_CST_LOW (const_part);
3786 bc_emit ((char *) &i, 4);
3790 int i = TREE_INT_CST_LOW (const_part);
3791 bc_emit ((char *) &i, 4);
3792 i = TREE_INT_CST_HIGH (const_part);
3793 bc_emit ((char *) &i, 4);
3800 && TREE_CODE (TREE_OPERAND (addr_part, 0)) == VAR_DECL)
3801 bc_emit_labelref (IDENTIFIER_POINTER
3802 (DECL_ASSEMBLER_NAME (TREE_OPERAND (addr_part, 0))),
3803 TREE_INT_CST_LOW (const_part));
3805 abort (); /* FIXME: there may be more cases. */
3808 /* Subroutine of output_constant, used for CONSTRUCTORs
3809 (aggregate constants).
3810 Generate at least SIZE bytes, padding if necessary. */
3813 output_constructor (exp, size)
3817 register tree link, field = 0;
3818 HOST_WIDE_INT min_index = 0;
3819 /* Number of bytes output or skipped so far.
3820 In other words, current position within the constructor. */
3821 int total_bytes = 0;
3822 /* Non-zero means BYTE contains part of a byte, to be output. */
3823 int byte_buffer_in_use = 0;
3826 if (HOST_BITS_PER_WIDE_INT < BITS_PER_UNIT)
3829 if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE)
3830 field = TYPE_FIELDS (TREE_TYPE (exp));
3832 if (TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE
3833 && TYPE_DOMAIN (TREE_TYPE (exp)) != 0)
3835 = TREE_INT_CST_LOW (TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (exp))));
3837 /* As LINK goes through the elements of the constant,
3838 FIELD goes through the structure fields, if the constant is a structure.
3839 if the constant is a union, then we override this,
3840 by getting the field from the TREE_LIST element.
3841 But the constant could also be an array. Then FIELD is zero. */
3842 for (link = CONSTRUCTOR_ELTS (exp);
3844 link = TREE_CHAIN (link),
3845 field = field ? TREE_CHAIN (field) : 0)
3847 tree val = TREE_VALUE (link);
3850 /* the element in a union constructor specifies the proper field. */
3852 if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE
3853 || TREE_CODE (TREE_TYPE (exp)) == UNION_TYPE)
3855 /* if available, use the type given by link */
3856 if (TREE_PURPOSE (link) != 0)
3857 field = TREE_PURPOSE (link);
3860 if (TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE)
3861 index = TREE_PURPOSE (link);
3863 /* Eliminate the marker that makes a cast not be an lvalue. */
3867 if (field == 0 || !DECL_BIT_FIELD (field))
3869 /* An element that is not a bit-field. */
3871 register int fieldsize;
3872 /* Since this structure is static,
3873 we know the positions are constant. */
3874 int bitpos = (field ? (TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field))
3878 bitpos = (TREE_INT_CST_LOW (TYPE_SIZE (TREE_TYPE (val)))
3880 * (TREE_INT_CST_LOW (index) - min_index));
3882 /* Output any buffered-up bit-fields preceding this element. */
3883 if (byte_buffer_in_use)
3885 ASM_OUTPUT_BYTE (asm_out_file, byte);
3887 byte_buffer_in_use = 0;
3890 /* Advance to offset of this element.
3891 Note no alignment needed in an array, since that is guaranteed
3892 if each element has the proper size. */
3893 if ((field != 0 || index != 0) && bitpos != total_bytes)
3895 if (!output_bytecode)
3896 assemble_zeros (bitpos - total_bytes);
3898 bc_emit_const_skip (bitpos - total_bytes);
3899 total_bytes = bitpos;
3902 /* Determine size this element should occupy. */
3905 if (TREE_CODE (DECL_SIZE (field)) != INTEGER_CST)
3907 if (TREE_INT_CST_LOW (DECL_SIZE (field)) > 100000)
3909 /* This avoids overflow trouble. */
3910 tree size_tree = size_binop (CEIL_DIV_EXPR,
3912 size_int (BITS_PER_UNIT));
3913 fieldsize = TREE_INT_CST_LOW (size_tree);
3917 fieldsize = TREE_INT_CST_LOW (DECL_SIZE (field));
3918 fieldsize = (fieldsize + BITS_PER_UNIT - 1) / BITS_PER_UNIT;
3922 fieldsize = int_size_in_bytes (TREE_TYPE (TREE_TYPE (exp)));
3924 /* Output the element's initial value. */
3926 assemble_zeros (fieldsize);
3928 output_constant (val, fieldsize);
3930 /* Count its size. */
3931 total_bytes += fieldsize;
3933 else if (val != 0 && TREE_CODE (val) != INTEGER_CST)
3934 error ("invalid initial value for member `%s'",
3935 IDENTIFIER_POINTER (DECL_NAME (field)));
3938 /* Element that is a bit-field. */
3940 int next_offset = TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field));
3942 = (next_offset + TREE_INT_CST_LOW (DECL_SIZE (field)));
3945 val = integer_zero_node;
3947 /* If this field does not start in this (or, next) byte,
3949 if (next_offset / BITS_PER_UNIT != total_bytes)
3951 /* Output remnant of any bit field in previous bytes. */
3952 if (byte_buffer_in_use)
3954 ASM_OUTPUT_BYTE (asm_out_file, byte);
3956 byte_buffer_in_use = 0;
3959 /* If still not at proper byte, advance to there. */
3960 if (next_offset / BITS_PER_UNIT != total_bytes)
3962 assemble_zeros (next_offset / BITS_PER_UNIT - total_bytes);
3963 total_bytes = next_offset / BITS_PER_UNIT;
3967 if (! byte_buffer_in_use)
3970 /* We must split the element into pieces that fall within
3971 separate bytes, and combine each byte with previous or
3972 following bit-fields. */
3974 /* next_offset is the offset n fbits from the beginning of
3975 the structure to the next bit of this element to be processed.
3976 end_offset is the offset of the first bit past the end of
3978 while (next_offset < end_offset)
3982 HOST_WIDE_INT value;
3983 int next_byte = next_offset / BITS_PER_UNIT;
3984 int next_bit = next_offset % BITS_PER_UNIT;
3986 /* Advance from byte to byte
3987 within this element when necessary. */
3988 while (next_byte != total_bytes)
3990 ASM_OUTPUT_BYTE (asm_out_file, byte);
3995 /* Number of bits we can process at once
3996 (all part of the same byte). */
3997 this_time = MIN (end_offset - next_offset,
3998 BITS_PER_UNIT - next_bit);
3999 if (BYTES_BIG_ENDIAN)
4001 /* On big-endian machine, take the most significant bits
4002 first (of the bits that are significant)
4003 and put them into bytes from the most significant end. */
4004 shift = end_offset - next_offset - this_time;
4005 /* Don't try to take a bunch of bits that cross
4006 the word boundary in the INTEGER_CST. */
4007 if (shift < HOST_BITS_PER_WIDE_INT
4008 && shift + this_time > HOST_BITS_PER_WIDE_INT)
4010 this_time -= (HOST_BITS_PER_WIDE_INT - shift);
4011 shift = HOST_BITS_PER_WIDE_INT;
4014 /* Now get the bits from the appropriate constant word. */
4015 if (shift < HOST_BITS_PER_WIDE_INT)
4017 value = TREE_INT_CST_LOW (val);
4019 else if (shift < 2 * HOST_BITS_PER_WIDE_INT)
4021 value = TREE_INT_CST_HIGH (val);
4022 shift -= HOST_BITS_PER_WIDE_INT;
4026 byte |= (((value >> shift)
4027 & (((HOST_WIDE_INT) 1 << this_time) - 1))
4028 << (BITS_PER_UNIT - this_time - next_bit));
4032 /* On little-endian machines,
4033 take first the least significant bits of the value
4034 and pack them starting at the least significant
4035 bits of the bytes. */
4036 shift = (next_offset
4037 - TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field)));
4038 /* Don't try to take a bunch of bits that cross
4039 the word boundary in the INTEGER_CST. */
4040 if (shift < HOST_BITS_PER_WIDE_INT
4041 && shift + this_time > HOST_BITS_PER_WIDE_INT)
4043 this_time -= (HOST_BITS_PER_WIDE_INT - shift);
4044 shift = HOST_BITS_PER_WIDE_INT;
4047 /* Now get the bits from the appropriate constant word. */
4048 if (shift < HOST_BITS_PER_INT)
4049 value = TREE_INT_CST_LOW (val);
4050 else if (shift < 2 * HOST_BITS_PER_WIDE_INT)
4052 value = TREE_INT_CST_HIGH (val);
4053 shift -= HOST_BITS_PER_WIDE_INT;
4057 byte |= (((value >> shift)
4058 & (((HOST_WIDE_INT) 1 << this_time) - 1))
4061 next_offset += this_time;
4062 byte_buffer_in_use = 1;
4066 if (byte_buffer_in_use)
4068 ASM_OUTPUT_BYTE (asm_out_file, byte);
4071 if (total_bytes < size)
4072 assemble_zeros (size - total_bytes);
4075 /* Output asm to handle ``#pragma weak'' */
4077 handle_pragma_weak (what, name, value)
4078 enum pragma_state what;
4081 #ifdef HANDLE_PRAGMA_WEAK
4082 if (what == ps_name || what == ps_value)
4084 struct weak_syms *weak =
4085 (struct weak_syms *)permalloc (sizeof (struct weak_syms));
4086 weak->next = weak_decls;
4087 weak->name = permalloc (strlen (name) + 1);
4088 strcpy (weak->name, name);
4090 if (what != ps_value)
4091 weak->value = NULL_PTR;
4095 weak->value = permalloc (strlen (value) + 1);
4096 strcpy (weak->value, value);
4101 else if (! (what == ps_done || what == ps_start))
4102 warning ("malformed `#pragma weak'");
4103 #endif /* HANDLE_PRAGMA_WEAK */
4106 /* Declare DECL to be a weak symbol. */
4112 if (! TREE_PUBLIC (decl))
4113 error_with_decl (decl, "weak declaration of `%s' must be public");
4114 else if (TREE_ASM_WRITTEN (decl))
4115 error_with_decl (decl, "weak declaration of `%s' must precede definition");
4116 else if (SUPPORTS_WEAK)
4117 DECL_WEAK (decl) = 1;
4120 /* Emit any pending weak declarations. */
4125 #ifdef HANDLE_PRAGMA_WEAK
4126 if (HANDLE_PRAGMA_WEAK)
4128 struct weak_syms *t;
4129 for (t = weak_decls; t; t = t->next)
4131 ASM_WEAKEN_LABEL (asm_out_file, t->name);
4133 ASM_OUTPUT_DEF (asm_out_file, t->name, t->value);
4140 assemble_alias (decl, target)
4143 #ifdef ASM_OUTPUT_DEF
4146 make_decl_rtl (decl, (char*)0, 1);
4147 name = XSTR (XEXP (DECL_RTL (decl), 0), 0);
4149 /* Make name accessible from other files, if appropriate. */
4151 if (TREE_PUBLIC (decl))
4153 #ifdef ASM_WEAKEN_LABEL
4154 if (DECL_WEAK (decl))
4155 ASM_WEAKEN_LABEL (asm_out_file, name);
4158 if (output_bytecode)
4159 BC_GLOBALIZE_LABEL (asm_out_file, name);
4161 ASM_GLOBALIZE_LABEL (asm_out_file, name);
4164 ASM_OUTPUT_DEF (asm_out_file, name, IDENTIFIER_POINTER (target));
4165 TREE_ASM_WRITTEN (decl) = 1;
4167 warning ("alias definitions not supported in this configuration");