1 /* Output variables, constants and external declarations, for GNU compiler.
2 Copyright (C) 1987, 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997,
3 1998, 1999, 2000, 2001 Free Software Foundation, Inc.
5 This file is part of GNU CC.
7 GNU CC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GNU CC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU CC; see the file COPYING. If not, write to
19 the Free Software Foundation, 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
23 /* This file handles generation of all the assembler code
24 *except* the instructions of a function.
25 This includes declarations of variables and their initial values.
27 We also output the assembler code for constants stored in memory
28 and are responsible for combining constants with the same value. */
38 #include "hard-reg-set.h"
51 #ifdef XCOFF_DEBUGGING_INFO
52 #include "xcoffout.h" /* Needed for external data
53 declarations for e.g. AIX 4.x. */
56 #ifndef TRAMPOLINE_ALIGNMENT
57 #define TRAMPOLINE_ALIGNMENT FUNCTION_BOUNDARY
61 #define ASM_STABS_OP "\t.stabs\t"
64 /* Define the prefix to use when check_memory_usage_flag is enable. */
65 #define CHKR_PREFIX "_CHKR_"
66 #define CHKR_PREFIX_SIZE (sizeof (CHKR_PREFIX) - 1)
68 /* The (assembler) name of the first globally-visible object output. */
69 const char *first_global_object_name;
70 const char *weak_global_object_name;
72 extern struct obstack permanent_obstack;
73 #define obstack_chunk_alloc xmalloc
76 struct constant_descriptor;
80 #define MAX_RTX_HASH_TABLE 61
84 /* Hash facility for making memory-constants
85 from constant rtl-expressions. It is used on RISC machines
86 where immediate integer arguments and constant addresses are restricted
87 so that such constants must be stored in memory.
89 This pool of constants is reinitialized for each function
90 so each function gets its own constants-pool that comes right before
92 struct constant_descriptor **x_const_rtx_hash_table;
93 struct pool_constant **x_const_rtx_sym_hash_table;
95 /* Pointers to first and last constant in pool. */
96 struct pool_constant *x_first_pool, *x_last_pool;
98 /* Current offset in constant pool (does not include any machine-specific
102 /* Chain of all CONST_DOUBLE rtx's constructed for the current function.
103 They are chained through the CONST_DOUBLE_CHAIN.
104 A CONST_DOUBLE rtx has CONST_DOUBLE_MEM != cc0_rtx iff it is on this chain.
105 In that case, CONST_DOUBLE_MEM is either a MEM,
106 or const0_rtx if no MEM has been made for this CONST_DOUBLE yet. */
107 rtx x_const_double_chain;
110 #define const_rtx_hash_table (cfun->varasm->x_const_rtx_hash_table)
111 #define const_rtx_sym_hash_table (cfun->varasm->x_const_rtx_sym_hash_table)
112 #define first_pool (cfun->varasm->x_first_pool)
113 #define last_pool (cfun->varasm->x_last_pool)
114 #define pool_offset (cfun->varasm->x_pool_offset)
115 #define const_double_chain (cfun->varasm->x_const_double_chain)
117 /* Number for making the label on the next
118 constant that is stored in memory. */
122 /* Number for making the label on the next
123 static variable internal to a function. */
127 /* Carry information from ASM_DECLARE_OBJECT_NAME
128 to ASM_FINISH_DECLARE_OBJECT. */
130 int size_directive_output;
132 /* The last decl for which assemble_variable was called,
133 if it did ASM_DECLARE_OBJECT_NAME.
134 If the last call to assemble_variable didn't do that,
137 tree last_assemble_variable_decl;
139 static const char *strip_reg_name PARAMS ((const char *));
140 static int contains_pointers_p PARAMS ((tree));
141 static void decode_addr_const PARAMS ((tree, struct addr_const *));
142 static int const_hash PARAMS ((tree));
143 static int compare_constant PARAMS ((tree,
144 struct constant_descriptor *));
145 static const unsigned char *compare_constant_1 PARAMS ((tree, const unsigned char *));
146 static struct constant_descriptor *record_constant PARAMS ((tree));
147 static void record_constant_1 PARAMS ((tree));
148 static tree copy_constant PARAMS ((tree));
149 static void output_constant_def_contents PARAMS ((tree, int, int));
150 static void decode_rtx_const PARAMS ((enum machine_mode, rtx,
151 struct rtx_const *));
152 static int const_hash_rtx PARAMS ((enum machine_mode, rtx));
153 static int compare_constant_rtx PARAMS ((enum machine_mode, rtx,
154 struct constant_descriptor *));
155 static struct constant_descriptor *record_constant_rtx PARAMS ((enum machine_mode,
157 static struct pool_constant *find_pool_constant PARAMS ((struct function *, rtx));
158 static void mark_constant_pool PARAMS ((void));
159 static void mark_constants PARAMS ((rtx));
160 static int mark_constant PARAMS ((rtx *current_rtx, void *data));
161 static int output_addressed_constants PARAMS ((tree));
162 static void output_after_function_constants PARAMS ((void));
163 static unsigned HOST_WIDE_INT array_size_for_constructor PARAMS ((tree));
164 static void output_constructor PARAMS ((tree, int));
165 #ifdef ASM_WEAKEN_LABEL
166 static void remove_from_pending_weak_list PARAMS ((const char *));
168 #ifdef ASM_OUTPUT_BSS
169 static void asm_output_bss PARAMS ((FILE *, tree, const char *, int, int));
171 #ifdef BSS_SECTION_ASM_OP
172 #ifdef ASM_OUTPUT_ALIGNED_BSS
173 static void asm_output_aligned_bss PARAMS ((FILE *, tree, const char *,
176 #endif /* BSS_SECTION_ASM_OP */
177 static void mark_pool_constant PARAMS ((struct pool_constant *));
178 static void mark_const_hash_entry PARAMS ((void *));
179 static int mark_const_str_htab_1 PARAMS ((void **, void *));
180 static void mark_const_str_htab PARAMS ((void *));
181 static hashval_t const_str_htab_hash PARAMS ((const void *x));
182 static int const_str_htab_eq PARAMS ((const void *x, const void *y));
183 static void const_str_htab_del PARAMS ((void *));
184 static void asm_emit_uninitialised PARAMS ((tree, const char*, int, int));
185 static void resolve_unique_section PARAMS ((tree, int));
187 static enum in_section { no_section, in_text, in_data, in_named
188 #ifdef BSS_SECTION_ASM_OP
191 #ifdef EXTRA_SECTIONS
194 } in_section = no_section;
196 /* Return a non-zero value if DECL has a section attribute. */
197 #ifndef IN_NAMED_SECTION
198 #define IN_NAMED_SECTION(DECL) \
199 ((TREE_CODE (DECL) == FUNCTION_DECL || TREE_CODE (DECL) == VAR_DECL) \
200 && DECL_SECTION_NAME (DECL) != NULL_TREE)
203 /* Text of section name when in_section == in_named. */
204 static const char *in_named_name;
206 /* Define functions like text_section for any extra sections. */
207 #ifdef EXTRA_SECTION_FUNCTIONS
208 EXTRA_SECTION_FUNCTIONS
211 /* Tell assembler to switch to text section. */
216 if (in_section != in_text)
218 fprintf (asm_out_file, "%s\n", TEXT_SECTION_ASM_OP);
219 in_section = in_text;
223 /* Tell assembler to switch to data section. */
228 if (in_section != in_data)
230 if (flag_shared_data)
232 #ifdef SHARED_SECTION_ASM_OP
233 fprintf (asm_out_file, "%s\n", SHARED_SECTION_ASM_OP);
235 fprintf (asm_out_file, "%s\n", DATA_SECTION_ASM_OP);
239 fprintf (asm_out_file, "%s\n", DATA_SECTION_ASM_OP);
241 in_section = in_data;
244 /* Tell assembler to ALWAYS switch to data section, in case
245 it's not sure where it it. */
248 force_data_section ()
250 in_section = no_section;
254 /* Tell assembler to switch to read-only data section. This is normally
258 readonly_data_section ()
260 #ifdef READONLY_DATA_SECTION
261 READONLY_DATA_SECTION (); /* Note this can call data_section. */
267 /* Determine if we're in the text section. */
272 return in_section == in_text;
275 /* Determine if we're in the data section. */
280 return in_section == in_data;
283 /* Tell assembler to change to section NAME with attributes FLAGS. */
286 named_section_flags (name, flags, align)
291 if (in_section != in_named || strcmp (name, in_named_name))
293 (* targetm.asm_out.named_section) (name, flags, align);
295 if (flags & SECTION_FORGET)
296 in_section = no_section;
299 in_named_name = ggc_strdup (name);
300 in_section = in_named;
305 /* Tell assembler to change to section NAME for DECL.
306 If DECL is NULL, just switch to section NAME.
307 If NAME is NULL, get the name from DECL.
308 If RELOC is 1, the initializer for DECL contains relocs. */
311 named_section (decl, name, reloc)
318 if (decl != NULL_TREE && !DECL_P (decl))
321 name = TREE_STRING_POINTER (DECL_SECTION_NAME (decl));
323 flags = (* targetm.section_type_flags) (decl, name, reloc);
324 named_section_flags (name, flags, 0);
327 /* If required, set DECL_SECTION_NAME to a unique name. */
330 resolve_unique_section (decl, reloc)
334 if (DECL_SECTION_NAME (decl) == NULL_TREE
335 && (flag_function_sections
336 || (targetm.have_named_sections
337 && DECL_ONE_ONLY (decl))))
338 UNIQUE_SECTION (decl, reloc);
341 #ifdef BSS_SECTION_ASM_OP
343 /* Tell the assembler to switch to the bss section. */
348 if (in_section != in_bss)
350 #ifdef SHARED_BSS_SECTION_ASM_OP
351 if (flag_shared_data)
352 fprintf (asm_out_file, "%s\n", SHARED_BSS_SECTION_ASM_OP);
355 fprintf (asm_out_file, "%s\n", BSS_SECTION_ASM_OP);
361 #ifdef ASM_OUTPUT_BSS
363 /* Utility function for ASM_OUTPUT_BSS for targets to use if
364 they don't support alignments in .bss.
365 ??? It is believed that this function will work in most cases so such
366 support is localized here. */
369 asm_output_bss (file, decl, name, size, rounded)
371 tree decl ATTRIBUTE_UNUSED;
373 int size ATTRIBUTE_UNUSED, rounded;
375 ASM_GLOBALIZE_LABEL (file, name);
377 #ifdef ASM_DECLARE_OBJECT_NAME
378 last_assemble_variable_decl = decl;
379 ASM_DECLARE_OBJECT_NAME (file, name, decl);
381 /* Standard thing is just output label for the object. */
382 ASM_OUTPUT_LABEL (file, name);
383 #endif /* ASM_DECLARE_OBJECT_NAME */
384 ASM_OUTPUT_SKIP (file, rounded);
389 #ifdef ASM_OUTPUT_ALIGNED_BSS
391 /* Utility function for targets to use in implementing
392 ASM_OUTPUT_ALIGNED_BSS.
393 ??? It is believed that this function will work in most cases so such
394 support is localized here. */
397 asm_output_aligned_bss (file, decl, name, size, align)
403 ASM_GLOBALIZE_LABEL (file, name);
405 ASM_OUTPUT_ALIGN (file, floor_log2 (align / BITS_PER_UNIT));
406 #ifdef ASM_DECLARE_OBJECT_NAME
407 last_assemble_variable_decl = decl;
408 ASM_DECLARE_OBJECT_NAME (file, name, decl);
410 /* Standard thing is just output label for the object. */
411 ASM_OUTPUT_LABEL (file, name);
412 #endif /* ASM_DECLARE_OBJECT_NAME */
413 ASM_OUTPUT_SKIP (file, size ? size : 1);
418 #endif /* BSS_SECTION_ASM_OP */
420 /* Switch to the section for function DECL.
422 If DECL is NULL_TREE, switch to the text section.
423 ??? It's not clear that we will ever be passed NULL_TREE, but it's
424 safer to handle it. */
427 function_section (decl)
430 if (decl != NULL_TREE
431 && DECL_SECTION_NAME (decl) != NULL_TREE)
432 named_section (decl, (char *) 0, 0);
437 /* Switch to section for variable DECL.
439 RELOC is the `reloc' argument to SELECT_SECTION. */
442 variable_section (decl, reloc)
446 if (IN_NAMED_SECTION (decl))
447 named_section (decl, NULL, reloc);
450 /* C++ can have const variables that get initialized from constructors,
451 and thus can not be in a readonly section. We prevent this by
452 verifying that the initial value is constant for objects put in a
455 error_mark_node is used by the C front end to indicate that the
456 initializer has not been seen yet. In this case, we assume that
457 the initializer must be constant.
459 C++ uses error_mark_node for variables that have complicated
460 initializers, but these variables go in BSS so we won't be called
463 #ifdef SELECT_SECTION
464 SELECT_SECTION (decl, reloc);
466 if (DECL_READONLY_SECTION (decl, reloc))
467 readonly_data_section ();
474 /* Tell assembler to switch to the section for the exception handling
480 #if defined (EXCEPTION_SECTION)
481 EXCEPTION_SECTION ();
483 if (targetm.have_named_sections)
484 named_section (NULL_TREE, ".gcc_except_table", 0);
488 readonly_data_section ();
492 /* Given NAME, a putative register name, discard any customary prefixes. */
495 strip_reg_name (name)
498 #ifdef REGISTER_PREFIX
499 if (!strncmp (name, REGISTER_PREFIX, strlen (REGISTER_PREFIX)))
500 name += strlen (REGISTER_PREFIX);
502 if (name[0] == '%' || name[0] == '#')
507 /* Decode an `asm' spec for a declaration as a register name.
508 Return the register number, or -1 if nothing specified,
509 or -2 if the ASMSPEC is not `cc' or `memory' and is not recognized,
510 or -3 if ASMSPEC is `cc' and is not recognized,
511 or -4 if ASMSPEC is `memory' and is not recognized.
512 Accept an exact spelling or a decimal number.
513 Prefixes such as % are optional. */
516 decode_reg_name (asmspec)
523 /* Get rid of confusing prefixes. */
524 asmspec = strip_reg_name (asmspec);
526 /* Allow a decimal number as a "register name". */
527 for (i = strlen (asmspec) - 1; i >= 0; i--)
528 if (! (asmspec[i] >= '0' && asmspec[i] <= '9'))
530 if (asmspec[0] != 0 && i < 0)
533 if (i < FIRST_PSEUDO_REGISTER && i >= 0)
539 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
541 && ! strcmp (asmspec, strip_reg_name (reg_names[i])))
544 #ifdef ADDITIONAL_REGISTER_NAMES
546 static struct { const char *name; int number; } table[]
547 = ADDITIONAL_REGISTER_NAMES;
549 for (i = 0; i < (int) ARRAY_SIZE (table); i++)
550 if (! strcmp (asmspec, table[i].name))
551 return table[i].number;
553 #endif /* ADDITIONAL_REGISTER_NAMES */
555 if (!strcmp (asmspec, "memory"))
558 if (!strcmp (asmspec, "cc"))
567 /* Create the DECL_RTL for a VAR_DECL or FUNCTION_DECL. DECL should
568 have static storage duration. In other words, it should not be an
569 automatic variable, including PARM_DECLs.
571 There is, however, one exception: this function handles variables
572 explicitly placed in a particular register by the user.
574 ASMSPEC, if not 0, is the string which the user specified as the
575 assembler symbol name.
577 This is never called for PARM_DECL nodes. */
580 make_decl_rtl (decl, asmspec)
584 int top_level = (DECL_CONTEXT (decl) == NULL_TREE);
585 const char *name = 0;
586 const char *new_name = 0;
589 /* Check that we are not being given an automatic variable. */
590 /* A weak alias has TREE_PUBLIC set but not the other bits. */
591 if (TREE_CODE (decl) == PARM_DECL
592 || TREE_CODE (decl) == RESULT_DECL
593 || (TREE_CODE (decl) == VAR_DECL
594 && !TREE_STATIC (decl)
595 && !TREE_PUBLIC (decl)
596 && !DECL_EXTERNAL (decl)
597 && !DECL_REGISTER (decl)))
599 /* And that we were not given a type or a label. */
600 else if (TREE_CODE (decl) == TYPE_DECL
601 || TREE_CODE (decl) == LABEL_DECL)
604 /* For a duplicate declaration, we can be called twice on the
605 same DECL node. Don't discard the RTL already made. */
606 if (DECL_RTL_SET_P (decl))
608 /* If the old RTL had the wrong mode, fix the mode. */
609 if (GET_MODE (DECL_RTL (decl)) != DECL_MODE (decl))
611 rtx rtl = DECL_RTL (decl);
612 PUT_MODE (rtl, DECL_MODE (decl));
615 /* ??? Another way to do this would be to do what halfpic.c does
616 and maintain a hashed table of such critters. */
617 /* ??? Another way to do this would be to pass a flag bit to
618 ENCODE_SECTION_INFO saying whether this is a new decl or not. */
619 /* Let the target reassign the RTL if it wants.
620 This is necessary, for example, when one machine specific
621 decl attribute overrides another. */
622 #ifdef REDO_SECTION_INFO_P
623 if (REDO_SECTION_INFO_P (decl))
624 ENCODE_SECTION_INFO (decl);
629 new_name = name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
631 reg_number = decode_reg_name (asmspec);
632 if (reg_number == -2)
634 /* ASMSPEC is given, and not the name of a register. Mark the
635 name with a star so assemble_name won't munge it. */
636 char *starred = alloca (strlen (asmspec) + 2);
638 strcpy (starred + 1, asmspec);
642 if (TREE_CODE (decl) != FUNCTION_DECL && DECL_REGISTER (decl))
644 /* First detect errors in declaring global registers. */
645 if (reg_number == -1)
646 error_with_decl (decl, "register name not specified for `%s'");
647 else if (reg_number < 0)
648 error_with_decl (decl, "invalid register name for `%s'");
649 else if (TYPE_MODE (TREE_TYPE (decl)) == BLKmode)
650 error_with_decl (decl,
651 "data type of `%s' isn't suitable for a register");
652 else if (! HARD_REGNO_MODE_OK (reg_number, TYPE_MODE (TREE_TYPE (decl))))
653 error_with_decl (decl,
654 "register specified for `%s' isn't suitable for data type");
655 /* Now handle properly declared static register variables. */
660 if (DECL_INITIAL (decl) != 0 && TREE_STATIC (decl))
662 DECL_INITIAL (decl) = 0;
663 error ("global register variable has initial value");
665 if (TREE_THIS_VOLATILE (decl))
666 warning ("volatile register variables don't work as you might wish");
668 /* If the user specified one of the eliminables registers here,
669 e.g., FRAME_POINTER_REGNUM, we don't want to get this variable
670 confused with that register and be eliminated. Although this
671 usage is somewhat suspect, we nevertheless use the following
672 kludge to avoid setting DECL_RTL to frame_pointer_rtx. */
675 gen_rtx_REG (DECL_MODE (decl),
676 FIRST_PSEUDO_REGISTER));
677 REGNO (DECL_RTL (decl)) = reg_number;
678 REG_USERVAR_P (DECL_RTL (decl)) = 1;
680 if (TREE_STATIC (decl))
682 /* Make this register global, so not usable for anything
684 #ifdef ASM_DECLARE_REGISTER_GLOBAL
685 ASM_DECLARE_REGISTER_GLOBAL (asm_out_file, decl, reg_number, name);
687 nregs = HARD_REGNO_NREGS (reg_number, DECL_MODE (decl));
689 globalize_reg (reg_number + --nregs);
692 /* As a register variable, it has no section. */
697 /* Now handle ordinary static variables and functions (in memory).
698 Also handle vars declared register invalidly. */
700 if (reg_number >= 0 || reg_number == -3)
701 error_with_decl (decl,
702 "register name given for non-register variable `%s'");
704 /* Specifying a section attribute on a variable forces it into a
705 non-.bss section, and thus it cannot be common. */
706 if (TREE_CODE (decl) == VAR_DECL
707 && DECL_SECTION_NAME (decl) != NULL_TREE
708 && DECL_INITIAL (decl) == NULL_TREE
709 && DECL_COMMON (decl))
710 DECL_COMMON (decl) = 0;
712 /* Can't use just the variable's own name for a variable
713 whose scope is less than the whole file, unless it's a member
714 of a local class (which will already be unambiguous).
715 Concatenate a distinguishing number. */
716 if (!top_level && !TREE_PUBLIC (decl)
717 && ! (DECL_CONTEXT (decl) && TYPE_P (DECL_CONTEXT (decl)))
719 && name == IDENTIFIER_POINTER (DECL_NAME (decl)))
722 ASM_FORMAT_PRIVATE_NAME (label, name, var_labelno);
727 /* When -fprefix-function-name is used, the functions
728 names are prefixed. Only nested function names are not
730 else if (flag_prefix_function_name && TREE_CODE (decl) == FUNCTION_DECL)
732 size_t name_len = IDENTIFIER_LENGTH (DECL_ASSEMBLER_NAME (decl));
735 pname = alloca (name_len + CHKR_PREFIX_SIZE + 1);
736 memcpy (pname, CHKR_PREFIX, CHKR_PREFIX_SIZE);
737 memcpy (pname + CHKR_PREFIX_SIZE, name, name_len + 1);
741 if (name != new_name)
743 SET_DECL_ASSEMBLER_NAME (decl, get_identifier (new_name));
744 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
747 /* If this variable is to be treated as volatile, show its
748 tree node has side effects. */
749 if ((flag_volatile_global && TREE_CODE (decl) == VAR_DECL
750 && TREE_PUBLIC (decl))
751 || ((flag_volatile_static && TREE_CODE (decl) == VAR_DECL
752 && (TREE_PUBLIC (decl) || TREE_STATIC (decl)))))
753 TREE_SIDE_EFFECTS (decl) = 1;
755 SET_DECL_RTL (decl, gen_rtx_MEM (DECL_MODE (decl),
756 gen_rtx_SYMBOL_REF (Pmode, name)));
757 SYMBOL_REF_WEAK (XEXP (DECL_RTL (decl), 0)) = DECL_WEAK (decl);
758 if (TREE_CODE (decl) != FUNCTION_DECL)
759 set_mem_attributes (DECL_RTL (decl), decl, 1);
761 /* Optionally set flags or add text to the name to record information
762 such as that it is a function name.
763 If the name is changed, the macro ASM_OUTPUT_LABELREF
764 will have to know how to strip this information. */
765 #ifdef ENCODE_SECTION_INFO
766 ENCODE_SECTION_INFO (decl);
770 /* Make the rtl for variable VAR be volatile.
771 Use this only for static variables. */
774 make_var_volatile (var)
777 if (GET_CODE (DECL_RTL (var)) != MEM)
780 MEM_VOLATILE_P (DECL_RTL (var)) = 1;
783 /* Output alignment directive to align for constant expression EXP. */
786 assemble_constant_align (exp)
791 /* Align the location counter as required by EXP's data type. */
792 align = TYPE_ALIGN (TREE_TYPE (exp));
793 #ifdef CONSTANT_ALIGNMENT
794 align = CONSTANT_ALIGNMENT (exp, align);
797 if (align > BITS_PER_UNIT)
798 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
801 /* Output a string of literal assembler code
802 for an `asm' keyword used between functions. */
805 assemble_asm (string)
810 if (TREE_CODE (string) == ADDR_EXPR)
811 string = TREE_OPERAND (string, 0);
813 fprintf (asm_out_file, "\t%s\n", TREE_STRING_POINTER (string));
816 /* Record an element in the table of global destructors. The argument
817 should be a SYMBOL_REF of the function to be called. */
820 assemble_destructor (symbol, priority)
826 if (GET_CODE (symbol) != SYMBOL_REF)
828 name = XSTR (symbol, 0);
830 if (priority != DEFAULT_INIT_PRIORITY
831 && targetm.have_named_sections)
834 sprintf (buf, ".dtors.%.5u",
835 /* Invert the numbering so the linker puts us in the proper
836 order; constructors are run from right to left, and the
837 linker sorts in increasing order. */
838 MAX_INIT_PRIORITY - priority);
839 named_section_flags (buf, SECTION_WRITE, POINTER_SIZE / BITS_PER_UNIT);
840 assemble_integer (symbol, POINTER_SIZE / BITS_PER_UNIT, 1);
844 #ifdef ASM_OUTPUT_DESTRUCTOR
845 ASM_OUTPUT_DESTRUCTOR (asm_out_file, name);
849 /* Now tell GNU LD that this is part of the static destructor set. */
850 /* This code works for any machine provided you use GNU as/ld. */
851 fprintf (asm_out_file, "%s\"___DTOR_LIST__\",22,0,0,", ASM_STABS_OP);
852 assemble_name (asm_out_file, name);
853 fputc ('\n', asm_out_file);
858 /* Likewise for global constructors. */
861 assemble_constructor (symbol, priority)
867 if (GET_CODE (symbol) != SYMBOL_REF)
869 name = XSTR (symbol, 0);
871 if (priority != DEFAULT_INIT_PRIORITY
872 && targetm.have_named_sections)
875 sprintf (buf, ".ctors.%.5u",
876 /* Invert the numbering so the linker puts us in the proper
877 order; constructors are run from right to left, and the
878 linker sorts in increasing order. */
879 MAX_INIT_PRIORITY - priority);
880 named_section_flags (buf, SECTION_WRITE, POINTER_SIZE / BITS_PER_UNIT);
881 assemble_integer (symbol, POINTER_SIZE / BITS_PER_UNIT, 1);
885 #ifdef ASM_OUTPUT_CONSTRUCTOR
886 ASM_OUTPUT_CONSTRUCTOR (asm_out_file, name);
890 /* Now tell GNU LD that this is part of the static constructor set. */
891 /* This code works for any machine provided you use GNU as/ld. */
892 fprintf (asm_out_file, "%s\"___CTOR_LIST__\",22,0,0,", ASM_STABS_OP);
893 assemble_name (asm_out_file, name);
894 fputc ('\n', asm_out_file);
899 /* CONSTANT_POOL_BEFORE_FUNCTION may be defined as an expression with
900 a non-zero value if the constant pool should be output before the
901 start of the function, or a zero value if the pool should output
902 after the end of the function. The default is to put it before the
905 #ifndef CONSTANT_POOL_BEFORE_FUNCTION
906 #define CONSTANT_POOL_BEFORE_FUNCTION 1
909 /* Output assembler code for the constant pool of a function and associated
910 with defining the name of the function. DECL describes the function.
911 NAME is the function's name. For the constant pool, we use the current
912 constant pool data. */
915 assemble_start_function (decl, fnname)
921 /* The following code does not need preprocessing in the assembler. */
925 if (CONSTANT_POOL_BEFORE_FUNCTION)
926 output_constant_pool (fnname, decl);
928 resolve_unique_section (decl, 0);
929 function_section (decl);
931 /* Tell assembler to move to target machine's alignment for functions. */
932 align = floor_log2 (FUNCTION_BOUNDARY / BITS_PER_UNIT);
934 ASM_OUTPUT_ALIGN (asm_out_file, align);
936 /* Handle a user-specified function alignment.
937 Note that we still need to align to FUNCTION_BOUNDARY, as above,
938 because ASM_OUTPUT_MAX_SKIP_ALIGN might not do any alignment at all. */
939 if (align_functions_log > align)
941 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
942 ASM_OUTPUT_MAX_SKIP_ALIGN (asm_out_file,
943 align_functions_log, align_functions-1);
945 ASM_OUTPUT_ALIGN (asm_out_file, align_functions_log);
949 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
950 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file, fnname);
953 (*debug_hooks->begin_function) (decl);
955 /* Make function name accessible from other files, if appropriate. */
957 if (TREE_PUBLIC (decl))
959 if (! first_global_object_name)
964 STRIP_NAME_ENCODING (p, fnname);
965 name = permalloc (strlen (p) + 1);
968 if (! DECL_WEAK (decl) && ! DECL_ONE_ONLY (decl))
969 first_global_object_name = name;
971 weak_global_object_name = name;
974 #ifdef ASM_WEAKEN_LABEL
975 if (DECL_WEAK (decl))
977 ASM_WEAKEN_LABEL (asm_out_file, fnname);
978 /* Remove this function from the pending weak list so that
979 we do not emit multiple .weak directives for it. */
980 remove_from_pending_weak_list
981 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl)));
985 ASM_GLOBALIZE_LABEL (asm_out_file, fnname);
988 /* Do any machine/system dependent processing of the function name */
989 #ifdef ASM_DECLARE_FUNCTION_NAME
990 ASM_DECLARE_FUNCTION_NAME (asm_out_file, fnname, current_function_decl);
992 /* Standard thing is just output label for the function. */
993 ASM_OUTPUT_LABEL (asm_out_file, fnname);
994 #endif /* ASM_DECLARE_FUNCTION_NAME */
997 /* Output assembler code associated with defining the size of the
998 function. DECL describes the function. NAME is the function's name. */
1001 assemble_end_function (decl, fnname)
1005 #ifdef ASM_DECLARE_FUNCTION_SIZE
1006 ASM_DECLARE_FUNCTION_SIZE (asm_out_file, fnname, decl);
1008 if (! CONSTANT_POOL_BEFORE_FUNCTION)
1010 output_constant_pool (fnname, decl);
1011 function_section (decl); /* need to switch back */
1014 /* Output any constants which should appear after the function. */
1015 output_after_function_constants ();
1018 /* Assemble code to leave SIZE bytes of zeros. */
1021 assemble_zeros (size)
1024 /* Do no output if -fsyntax-only. */
1025 if (flag_syntax_only)
1028 #ifdef ASM_NO_SKIP_IN_TEXT
1029 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
1030 so we must output 0s explicitly in the text section. */
1031 if (ASM_NO_SKIP_IN_TEXT && in_text_section ())
1035 for (i = 0; i < size - 20; i += 20)
1038 fprintf (asm_out_file,
1039 "%s0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n", ASM_BYTE_OP);
1041 fprintf (asm_out_file,
1042 "\tbyte 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n");
1048 fprintf (asm_out_file, "%s0", ASM_BYTE_OP);
1050 fprintf (asm_out_file, "\tbyte 0");
1053 for (; i < size; i++)
1054 fprintf (asm_out_file, ",0");
1055 fprintf (asm_out_file, "\n");
1061 ASM_OUTPUT_SKIP (asm_out_file, size);
1064 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
1067 assemble_align (align)
1070 if (align > BITS_PER_UNIT)
1071 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
1074 /* Assemble a string constant with the specified C string as contents. */
1077 assemble_string (p, size)
1084 /* If the string is very long, split it up. */
1088 int thissize = size - pos;
1089 if (thissize > maximum)
1092 ASM_OUTPUT_ASCII (asm_out_file, p, thissize);
1100 #if defined ASM_OUTPUT_ALIGNED_DECL_LOCAL
1101 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1102 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1104 #if defined ASM_OUTPUT_ALIGNED_LOCAL
1105 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1106 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, DECL_ALIGN (decl))
1108 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1109 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded)
1113 #if defined ASM_OUTPUT_ALIGNED_BSS
1114 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1115 ASM_OUTPUT_ALIGNED_BSS (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1117 #if defined ASM_OUTPUT_BSS
1118 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1119 ASM_OUTPUT_BSS (asm_out_file, decl, name, size, rounded)
1125 #if defined ASM_OUTPUT_ALIGNED_DECL_COMMON
1126 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1127 ASM_OUTPUT_ALIGNED_DECL_COMMON (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1129 #if defined ASM_OUTPUT_ALIGNED_COMMON
1130 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1131 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file, name, size, DECL_ALIGN (decl))
1133 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1134 ASM_OUTPUT_COMMON (asm_out_file, name, size, rounded)
1139 asm_emit_uninitialised (decl, name, size, rounded)
1142 int size ATTRIBUTE_UNUSED;
1143 int rounded ATTRIBUTE_UNUSED;
1151 destination = asm_dest_local;
1153 if (TREE_PUBLIC (decl))
1155 #if defined ASM_EMIT_BSS
1156 if (! DECL_COMMON (decl))
1157 destination = asm_dest_bss;
1160 destination = asm_dest_common;
1163 if (flag_shared_data)
1165 switch (destination)
1167 #ifdef ASM_OUTPUT_SHARED_BSS
1169 ASM_OUTPUT_SHARED_BSS (asm_out_file, decl, name, size, rounded);
1172 #ifdef ASM_OUTPUT_SHARED_COMMON
1173 case asm_dest_common:
1174 ASM_OUTPUT_SHARED_COMMON (asm_out_file, name, size, rounded);
1177 #ifdef ASM_OUTPUT_SHARED_LOCAL
1178 case asm_dest_local:
1179 ASM_OUTPUT_SHARED_LOCAL (asm_out_file, name, size, rounded);
1187 resolve_unique_section (decl, 0);
1189 switch (destination)
1193 ASM_EMIT_BSS (decl, name, size, rounded);
1196 case asm_dest_common:
1197 ASM_EMIT_COMMON (decl, name, size, rounded);
1199 case asm_dest_local:
1200 ASM_EMIT_LOCAL (decl, name, size, rounded);
1209 /* Assemble everything that is needed for a variable or function declaration.
1210 Not used for automatic variables, and not used for function definitions.
1211 Should not be called for variables of incomplete structure type.
1213 TOP_LEVEL is nonzero if this variable has file scope.
1214 AT_END is nonzero if this is the special handling, at end of compilation,
1215 to define things that have had only tentative definitions.
1216 DONT_OUTPUT_DATA if nonzero means don't actually output the
1217 initial value (that will be done by the caller). */
1220 assemble_variable (decl, top_level, at_end, dont_output_data)
1222 int top_level ATTRIBUTE_UNUSED;
1223 int at_end ATTRIBUTE_UNUSED;
1224 int dont_output_data;
1226 register const char *name;
1231 last_assemble_variable_decl = 0;
1233 /* Normally no need to say anything here for external references,
1234 since assemble_external is called by the language-specific code
1235 when a declaration is first seen. */
1237 if (DECL_EXTERNAL (decl))
1240 /* Output no assembler code for a function declaration.
1241 Only definitions of functions output anything. */
1243 if (TREE_CODE (decl) == FUNCTION_DECL)
1246 /* Do nothing for global register variables. */
1247 if (DECL_RTL_SET_P (decl) && GET_CODE (DECL_RTL (decl)) == REG)
1249 TREE_ASM_WRITTEN (decl) = 1;
1253 /* If type was incomplete when the variable was declared,
1254 see if it is complete now. */
1256 if (DECL_SIZE (decl) == 0)
1257 layout_decl (decl, 0);
1259 /* Still incomplete => don't allocate it; treat the tentative defn
1260 (which is what it must have been) as an `extern' reference. */
1262 if (!dont_output_data && DECL_SIZE (decl) == 0)
1264 error_with_file_and_line (DECL_SOURCE_FILE (decl),
1265 DECL_SOURCE_LINE (decl),
1266 "storage size of `%s' isn't known",
1267 IDENTIFIER_POINTER (DECL_NAME (decl)));
1268 TREE_ASM_WRITTEN (decl) = 1;
1272 /* The first declaration of a variable that comes through this function
1273 decides whether it is global (in C, has external linkage)
1274 or local (in C, has internal linkage). So do nothing more
1275 if this function has already run. */
1277 if (TREE_ASM_WRITTEN (decl))
1280 /* Make sure ENCODE_SECTION_INFO is invoked before we set ASM_WRITTEN. */
1281 decl_rtl = DECL_RTL (decl);
1283 TREE_ASM_WRITTEN (decl) = 1;
1285 /* Do no output if -fsyntax-only. */
1286 if (flag_syntax_only)
1291 if (! dont_output_data
1292 && ! host_integerp (DECL_SIZE_UNIT (decl), 1))
1294 error_with_decl (decl, "size of variable `%s' is too large");
1298 name = XSTR (XEXP (decl_rtl, 0), 0);
1299 if (TREE_PUBLIC (decl) && DECL_NAME (decl)
1300 && ! first_global_object_name
1301 && ! (DECL_COMMON (decl) && (DECL_INITIAL (decl) == 0
1302 || DECL_INITIAL (decl) == error_mark_node))
1303 && ! DECL_WEAK (decl)
1304 && ! DECL_ONE_ONLY (decl))
1309 STRIP_NAME_ENCODING (p, name);
1310 xname = permalloc (strlen (p) + 1);
1312 first_global_object_name = xname;
1315 /* Compute the alignment of this data. */
1317 align = DECL_ALIGN (decl);
1319 /* In the case for initialing an array whose length isn't specified,
1320 where we have not yet been able to do the layout,
1321 figure out the proper alignment now. */
1322 if (dont_output_data && DECL_SIZE (decl) == 0
1323 && TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE)
1324 align = MAX (align, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl))));
1326 /* Some object file formats have a maximum alignment which they support.
1327 In particular, a.out format supports a maximum alignment of 4. */
1328 #ifndef MAX_OFILE_ALIGNMENT
1329 #define MAX_OFILE_ALIGNMENT BIGGEST_ALIGNMENT
1331 if (align > MAX_OFILE_ALIGNMENT)
1333 warning_with_decl (decl,
1334 "alignment of `%s' is greater than maximum object file alignment. Using %d.",
1335 MAX_OFILE_ALIGNMENT/BITS_PER_UNIT);
1336 align = MAX_OFILE_ALIGNMENT;
1339 /* On some machines, it is good to increase alignment sometimes. */
1340 #ifdef DATA_ALIGNMENT
1341 align = DATA_ALIGNMENT (TREE_TYPE (decl), align);
1343 #ifdef CONSTANT_ALIGNMENT
1344 if (DECL_INITIAL (decl) != 0 && DECL_INITIAL (decl) != error_mark_node)
1345 align = CONSTANT_ALIGNMENT (DECL_INITIAL (decl), align);
1348 /* Reset the alignment in case we have made it tighter, so we can benefit
1349 from it in get_pointer_alignment. */
1350 DECL_ALIGN (decl) = align;
1352 /* Handle uninitialized definitions. */
1354 if ((DECL_INITIAL (decl) == 0 || DECL_INITIAL (decl) == error_mark_node)
1355 /* If the target can't output uninitialized but not common global data
1356 in .bss, then we have to use .data. */
1357 #if ! defined ASM_EMIT_BSS
1358 && DECL_COMMON (decl)
1360 && DECL_SECTION_NAME (decl) == NULL_TREE
1361 && ! dont_output_data)
1363 unsigned HOST_WIDE_INT size = tree_low_cst (DECL_SIZE_UNIT (decl), 1);
1364 unsigned HOST_WIDE_INT rounded = size;
1366 /* Don't allocate zero bytes of common,
1367 since that means "undefined external" in the linker. */
1371 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1372 so that each uninitialized object starts on such a boundary. */
1373 rounded += (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1;
1374 rounded = (rounded / (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
1375 * (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
1377 /* Don't continue this line--convex cc version 4.1 would lose. */
1378 #if !defined(ASM_OUTPUT_ALIGNED_COMMON) && !defined(ASM_OUTPUT_ALIGNED_DECL_COMMON) && !defined(ASM_OUTPUT_ALIGNED_BSS)
1379 if ((unsigned HOST_WIDE_INT) DECL_ALIGN (decl) / BITS_PER_UNIT > rounded)
1381 (decl, "requested alignment for %s is greater than implemented alignment of %d.",rounded);
1384 asm_emit_uninitialised (decl, name, size, rounded);
1389 /* Handle initialized definitions.
1390 Also handle uninitialized global definitions if -fno-common and the
1391 target doesn't support ASM_OUTPUT_BSS. */
1393 /* First make the assembler name(s) global if appropriate. */
1394 if (TREE_PUBLIC (decl) && DECL_NAME (decl))
1396 #ifdef ASM_WEAKEN_LABEL
1397 if (DECL_WEAK (decl))
1399 ASM_WEAKEN_LABEL (asm_out_file, name);
1400 /* Remove this variable from the pending weak list so that
1401 we do not emit multiple .weak directives for it. */
1402 remove_from_pending_weak_list
1403 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl)));
1407 ASM_GLOBALIZE_LABEL (asm_out_file, name);
1410 /* Output any data that we will need to use the address of. */
1411 if (DECL_INITIAL (decl) == error_mark_node)
1412 reloc = contains_pointers_p (TREE_TYPE (decl));
1413 else if (DECL_INITIAL (decl))
1414 reloc = output_addressed_constants (DECL_INITIAL (decl));
1416 /* Switch to the appropriate section. */
1417 resolve_unique_section (decl, reloc);
1418 variable_section (decl, reloc);
1420 /* dbxout.c needs to know this. */
1421 if (in_text_section ())
1422 DECL_IN_TEXT_SECTION (decl) = 1;
1424 /* Output the alignment of this data. */
1425 if (align > BITS_PER_UNIT)
1426 ASM_OUTPUT_ALIGN (asm_out_file,
1427 floor_log2 (DECL_ALIGN (decl) / BITS_PER_UNIT));
1429 /* Do any machine/system dependent processing of the object. */
1430 #ifdef ASM_DECLARE_OBJECT_NAME
1431 last_assemble_variable_decl = decl;
1432 ASM_DECLARE_OBJECT_NAME (asm_out_file, name, decl);
1434 /* Standard thing is just output label for the object. */
1435 ASM_OUTPUT_LABEL (asm_out_file, name);
1436 #endif /* ASM_DECLARE_OBJECT_NAME */
1438 if (!dont_output_data)
1440 if (DECL_INITIAL (decl))
1441 /* Output the actual data. */
1442 output_constant (DECL_INITIAL (decl),
1443 tree_low_cst (DECL_SIZE_UNIT (decl), 1));
1445 /* Leave space for it. */
1446 assemble_zeros (tree_low_cst (DECL_SIZE_UNIT (decl), 1));
1450 /* Return 1 if type TYPE contains any pointers. */
1453 contains_pointers_p (type)
1456 switch (TREE_CODE (type))
1459 case REFERENCE_TYPE:
1460 /* I'm not sure whether OFFSET_TYPE needs this treatment,
1461 so I'll play safe and return 1. */
1467 case QUAL_UNION_TYPE:
1470 /* For a type that has fields, see if the fields have pointers. */
1471 for (fields = TYPE_FIELDS (type); fields; fields = TREE_CHAIN (fields))
1472 if (TREE_CODE (fields) == FIELD_DECL
1473 && contains_pointers_p (TREE_TYPE (fields)))
1479 /* An array type contains pointers if its element type does. */
1480 return contains_pointers_p (TREE_TYPE (type));
1487 /* Output something to declare an external symbol to the assembler.
1488 (Most assemblers don't need this, so we normally output nothing.)
1489 Do nothing if DECL is not external. */
1492 assemble_external (decl)
1493 tree decl ATTRIBUTE_UNUSED;
1495 /* Because most platforms do not define ASM_OUTPUT_EXTERNAL, the
1496 main body of this code is only rarely exercised. To provide some
1497 testing, on all platforms, we make sure that the ASM_OUT_FILE is
1498 open. If it's not, we should not be calling this function. */
1502 #ifdef ASM_OUTPUT_EXTERNAL
1503 if (DECL_P (decl) && DECL_EXTERNAL (decl) && TREE_PUBLIC (decl))
1505 rtx rtl = DECL_RTL (decl);
1507 if (GET_CODE (rtl) == MEM && GET_CODE (XEXP (rtl, 0)) == SYMBOL_REF
1508 && ! SYMBOL_REF_USED (XEXP (rtl, 0)))
1510 /* Some systems do require some output. */
1511 SYMBOL_REF_USED (XEXP (rtl, 0)) = 1;
1512 ASM_OUTPUT_EXTERNAL (asm_out_file, decl, XSTR (XEXP (rtl, 0), 0));
1518 /* Similar, for calling a library function FUN. */
1521 assemble_external_libcall (fun)
1522 rtx fun ATTRIBUTE_UNUSED;
1524 #ifdef ASM_OUTPUT_EXTERNAL_LIBCALL
1525 /* Declare library function name external when first used, if nec. */
1526 if (! SYMBOL_REF_USED (fun))
1528 SYMBOL_REF_USED (fun) = 1;
1529 ASM_OUTPUT_EXTERNAL_LIBCALL (asm_out_file, fun);
1534 /* Declare the label NAME global. */
1537 assemble_global (name)
1540 ASM_GLOBALIZE_LABEL (asm_out_file, name);
1543 /* Assemble a label named NAME. */
1546 assemble_label (name)
1549 ASM_OUTPUT_LABEL (asm_out_file, name);
1552 /* Output to FILE a reference to the assembler name of a C-level name NAME.
1553 If NAME starts with a *, the rest of NAME is output verbatim.
1554 Otherwise NAME is transformed in an implementation-defined way
1555 (usually by the addition of an underscore).
1556 Many macros in the tm file are defined to call this function. */
1559 assemble_name (file, name)
1563 const char *real_name;
1566 STRIP_NAME_ENCODING (real_name, name);
1567 if (flag_prefix_function_name
1568 && ! memcmp (real_name, CHKR_PREFIX, CHKR_PREFIX_SIZE))
1569 real_name = real_name + CHKR_PREFIX_SIZE;
1571 id = maybe_get_identifier (real_name);
1573 TREE_SYMBOL_REFERENCED (id) = 1;
1576 fputs (&name[1], file);
1578 ASM_OUTPUT_LABELREF (file, name);
1581 /* Allocate SIZE bytes writable static space with a gensym name
1582 and return an RTX to refer to its address. */
1585 assemble_static_space (size)
1589 const char *namestring;
1593 if (flag_shared_data)
1597 ASM_GENERATE_INTERNAL_LABEL (name, "LF", const_labelno);
1599 namestring = ggc_strdup (name);
1601 x = gen_rtx_SYMBOL_REF (Pmode, namestring);
1603 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
1604 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, NULL_TREE, name, size,
1607 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1608 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, BIGGEST_ALIGNMENT);
1611 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1612 so that each uninitialized object starts on such a boundary. */
1613 /* Variable `rounded' might or might not be used in ASM_OUTPUT_LOCAL. */
1614 int rounded ATTRIBUTE_UNUSED
1615 = ((size + (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1)
1616 / (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
1617 * (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
1618 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded);
1625 /* Assemble the static constant template for function entry trampolines.
1626 This is done at most once per compilation.
1627 Returns an RTX for the address of the template. */
1629 #ifdef TRAMPOLINE_TEMPLATE
1631 assemble_trampoline_template ()
1637 /* By default, put trampoline templates in read-only data section. */
1639 #ifdef TRAMPOLINE_SECTION
1640 TRAMPOLINE_SECTION ();
1642 readonly_data_section ();
1645 /* Write the assembler code to define one. */
1646 align = floor_log2 (TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT);
1648 ASM_OUTPUT_ALIGN (asm_out_file, align);
1650 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LTRAMP", 0);
1651 TRAMPOLINE_TEMPLATE (asm_out_file);
1653 /* Record the rtl to refer to it. */
1654 ASM_GENERATE_INTERNAL_LABEL (label, "LTRAMP", 0);
1655 name = ggc_strdup (label);
1656 return gen_rtx_SYMBOL_REF (Pmode, name);
1660 /* Assemble the integer constant X into an object of SIZE bytes.
1661 X must be either a CONST_INT or CONST_DOUBLE.
1663 Return 1 if we were able to output the constant, otherwise 0. If FORCE is
1664 non-zero, abort if we can't output the constant. */
1667 assemble_integer (x, size, force)
1672 /* First try to use the standard 1, 2, 4, 8, and 16 byte
1673 ASM_OUTPUT... macros. */
1677 #ifdef ASM_OUTPUT_CHAR
1679 ASM_OUTPUT_CHAR (asm_out_file, x);
1683 #ifdef ASM_OUTPUT_SHORT
1685 ASM_OUTPUT_SHORT (asm_out_file, x);
1689 #ifdef ASM_OUTPUT_INT
1691 ASM_OUTPUT_INT (asm_out_file, x);
1695 #ifdef ASM_OUTPUT_DOUBLE_INT
1697 ASM_OUTPUT_DOUBLE_INT (asm_out_file, x);
1701 #ifdef ASM_OUTPUT_QUADRUPLE_INT
1703 ASM_OUTPUT_QUADRUPLE_INT (asm_out_file, x);
1708 /* If we couldn't do it that way, there are two other possibilities: First,
1709 if the machine can output an explicit byte and this is a 1 byte constant,
1710 we can use ASM_OUTPUT_BYTE. */
1712 #ifdef ASM_OUTPUT_BYTE
1713 if (size == 1 && GET_CODE (x) == CONST_INT)
1715 ASM_OUTPUT_BYTE (asm_out_file, INTVAL (x));
1720 /* Finally, if SIZE is larger than a single word, try to output the constant
1721 one word at a time. */
1723 if (size > UNITS_PER_WORD)
1726 enum machine_mode mode
1727 = mode_for_size (size * BITS_PER_UNIT, MODE_INT, 0);
1730 for (i = 0; i < size / UNITS_PER_WORD; i++)
1732 word = operand_subword (x, i, 0, mode);
1737 if (! assemble_integer (word, UNITS_PER_WORD, 0))
1741 if (i == size / UNITS_PER_WORD)
1743 /* If we output at least one word and then could not finish,
1744 there is no valid way to continue. */
1755 /* Assemble the floating-point constant D into an object of size MODE. */
1758 assemble_real (d, mode)
1760 enum machine_mode mode;
1762 jmp_buf output_constant_handler;
1764 if (setjmp (output_constant_handler))
1766 error ("floating point trap outputting a constant");
1767 #ifdef REAL_IS_NOT_DOUBLE
1768 memset ((char *) &d, 0, sizeof d);
1775 set_float_handler (output_constant_handler);
1779 #ifdef ASM_OUTPUT_BYTE_FLOAT
1781 ASM_OUTPUT_BYTE_FLOAT (asm_out_file, d);
1784 #ifdef ASM_OUTPUT_SHORT_FLOAT
1786 ASM_OUTPUT_SHORT_FLOAT (asm_out_file, d);
1789 #ifdef ASM_OUTPUT_THREE_QUARTER_FLOAT
1791 ASM_OUTPUT_THREE_QUARTER_FLOAT (asm_out_file, d);
1794 #ifdef ASM_OUTPUT_FLOAT
1796 ASM_OUTPUT_FLOAT (asm_out_file, d);
1800 #ifdef ASM_OUTPUT_DOUBLE
1802 ASM_OUTPUT_DOUBLE (asm_out_file, d);
1806 #ifdef ASM_OUTPUT_LONG_DOUBLE
1809 ASM_OUTPUT_LONG_DOUBLE (asm_out_file, d);
1817 set_float_handler (NULL);
1820 /* Here we combine duplicate floating constants to make
1821 CONST_DOUBLE rtx's, and force those out to memory when necessary. */
1823 /* Return a CONST_DOUBLE or CONST_INT for a value specified as a pair of ints.
1824 For an integer, I0 is the low-order word and I1 is the high-order word.
1825 For a real number, I0 is the word with the low address
1826 and I1 is the word with the high address. */
1829 immed_double_const (i0, i1, mode)
1830 HOST_WIDE_INT i0, i1;
1831 enum machine_mode mode;
1835 if (GET_MODE_CLASS (mode) == MODE_INT
1836 || GET_MODE_CLASS (mode) == MODE_PARTIAL_INT)
1838 /* We clear out all bits that don't belong in MODE, unless they and our
1839 sign bit are all one. So we get either a reasonable negative value
1840 or a reasonable unsigned value for this mode. */
1841 int width = GET_MODE_BITSIZE (mode);
1842 if (width < HOST_BITS_PER_WIDE_INT
1843 && ((i0 & ((HOST_WIDE_INT) (-1) << (width - 1)))
1844 != ((HOST_WIDE_INT) (-1) << (width - 1))))
1845 i0 &= ((HOST_WIDE_INT) 1 << width) - 1, i1 = 0;
1846 else if (width == HOST_BITS_PER_WIDE_INT
1847 && ! (i1 == ~0 && i0 < 0))
1849 else if (width > 2 * HOST_BITS_PER_WIDE_INT)
1850 /* We cannot represent this value as a constant. */
1853 /* If this would be an entire word for the target, but is not for
1854 the host, then sign-extend on the host so that the number will look
1855 the same way on the host that it would on the target.
1857 For example, when building a 64 bit alpha hosted 32 bit sparc
1858 targeted compiler, then we want the 32 bit unsigned value -1 to be
1859 represented as a 64 bit value -1, and not as 0x00000000ffffffff.
1860 The later confuses the sparc backend. */
1862 if (width < HOST_BITS_PER_WIDE_INT
1863 && (i0 & ((HOST_WIDE_INT) 1 << (width - 1))))
1864 i0 |= ((HOST_WIDE_INT) (-1) << width);
1866 /* If MODE fits within HOST_BITS_PER_WIDE_INT, always use a CONST_INT.
1868 ??? Strictly speaking, this is wrong if we create a CONST_INT
1869 for a large unsigned constant with the size of MODE being
1870 HOST_BITS_PER_WIDE_INT and later try to interpret that constant in a
1871 wider mode. In that case we will mis-interpret it as a negative
1874 Unfortunately, the only alternative is to make a CONST_DOUBLE
1875 for any constant in any mode if it is an unsigned constant larger
1876 than the maximum signed integer in an int on the host. However,
1877 doing this will break everyone that always expects to see a CONST_INT
1878 for SImode and smaller.
1880 We have always been making CONST_INTs in this case, so nothing new
1883 if (width <= HOST_BITS_PER_WIDE_INT)
1884 i1 = (i0 < 0) ? ~(HOST_WIDE_INT) 0 : 0;
1886 /* If this integer fits in one word, return a CONST_INT. */
1887 if ((i1 == 0 && i0 >= 0)
1888 || (i1 == ~0 && i0 < 0))
1889 return GEN_INT (i0);
1891 /* We use VOIDmode for integers. */
1895 /* Search the chain for an existing CONST_DOUBLE with the right value.
1896 If one is found, return it. */
1898 for (r = const_double_chain; r; r = CONST_DOUBLE_CHAIN (r))
1899 if (CONST_DOUBLE_LOW (r) == i0 && CONST_DOUBLE_HIGH (r) == i1
1900 && GET_MODE (r) == mode)
1903 /* No; make a new one and add it to the chain. */
1904 r = gen_rtx_CONST_DOUBLE (mode, const0_rtx, i0, i1);
1906 /* Don't touch const_double_chain if not inside any function. */
1907 if (current_function_decl != 0)
1909 CONST_DOUBLE_CHAIN (r) = const_double_chain;
1910 const_double_chain = r;
1916 /* Return a CONST_DOUBLE for a specified `double' value
1917 and machine mode. */
1920 immed_real_const_1 (d, mode)
1922 enum machine_mode mode;
1924 union real_extract u;
1927 /* Get the desired `double' value as a sequence of ints
1928 since that is how they are stored in a CONST_DOUBLE. */
1932 /* Detect special cases. */
1933 if (REAL_VALUES_IDENTICAL (dconst0, d))
1934 return CONST0_RTX (mode);
1936 /* Check for NaN first, because some ports (specifically the i386) do not
1937 emit correct ieee-fp code by default, and thus will generate a core
1938 dump here if we pass a NaN to REAL_VALUES_EQUAL and if REAL_VALUES_EQUAL
1939 does a floating point comparison. */
1940 else if (! REAL_VALUE_ISNAN (d) && REAL_VALUES_EQUAL (dconst1, d))
1941 return CONST1_RTX (mode);
1943 if (sizeof u == sizeof (HOST_WIDE_INT))
1944 return immed_double_const (u.i[0], 0, mode);
1945 if (sizeof u == 2 * sizeof (HOST_WIDE_INT))
1946 return immed_double_const (u.i[0], u.i[1], mode);
1948 /* The rest of this function handles the case where
1949 a float value requires more than 2 ints of space.
1950 It will be deleted as dead code on machines that don't need it. */
1952 /* Search the chain for an existing CONST_DOUBLE with the right value.
1953 If one is found, return it. */
1955 for (r = const_double_chain; r; r = CONST_DOUBLE_CHAIN (r))
1956 if (! memcmp ((char *) &CONST_DOUBLE_LOW (r), (char *) &u, sizeof u)
1957 && GET_MODE (r) == mode)
1960 /* No; make a new one and add it to the chain.
1962 We may be called by an optimizer which may be discarding any memory
1963 allocated during its processing (such as combine and loop). However,
1964 we will be leaving this constant on the chain, so we cannot tolerate
1966 r = rtx_alloc (CONST_DOUBLE);
1968 memcpy ((char *) &CONST_DOUBLE_LOW (r), (char *) &u, sizeof u);
1970 /* If we aren't inside a function, don't put r on the
1971 const_double_chain. */
1972 if (current_function_decl != 0)
1974 CONST_DOUBLE_CHAIN (r) = const_double_chain;
1975 const_double_chain = r;
1978 CONST_DOUBLE_CHAIN (r) = NULL_RTX;
1980 /* Store const0_rtx in CONST_DOUBLE_MEM since this CONST_DOUBLE is on the
1981 chain, but has not been allocated memory. Actual use of CONST_DOUBLE_MEM
1982 is only through force_const_mem. */
1984 CONST_DOUBLE_MEM (r) = const0_rtx;
1989 /* Return a CONST_DOUBLE rtx for a value specified by EXP,
1990 which must be a REAL_CST tree node. */
1993 immed_real_const (exp)
1996 return immed_real_const_1 (TREE_REAL_CST (exp), TYPE_MODE (TREE_TYPE (exp)));
1999 /* At the end of a function, forget the memory-constants
2000 previously made for CONST_DOUBLEs. Mark them as not on real_constant_chain.
2001 Also clear out real_constant_chain and clear out all the chain-pointers. */
2004 clear_const_double_mem ()
2006 register rtx r, next;
2007 enum machine_mode mode;
2010 for (r = const_double_chain; r; r = next)
2012 next = CONST_DOUBLE_CHAIN (r);
2013 CONST_DOUBLE_CHAIN (r) = 0;
2014 CONST_DOUBLE_MEM (r) = cc0_rtx;
2016 const_double_chain = 0;
2018 for (i = 0; i <= 2; i++)
2019 for (mode = GET_CLASS_NARROWEST_MODE (MODE_FLOAT); mode != VOIDmode;
2020 mode = GET_MODE_WIDER_MODE (mode))
2022 r = const_tiny_rtx[i][(int) mode];
2023 CONST_DOUBLE_CHAIN (r) = 0;
2024 CONST_DOUBLE_MEM (r) = cc0_rtx;
2028 /* Given an expression EXP with a constant value,
2029 reduce it to the sum of an assembler symbol and an integer.
2030 Store them both in the structure *VALUE.
2031 Abort if EXP does not reduce. */
2036 HOST_WIDE_INT offset;
2040 decode_addr_const (exp, value)
2042 struct addr_const *value;
2044 register tree target = TREE_OPERAND (exp, 0);
2045 register int offset = 0;
2050 if (TREE_CODE (target) == COMPONENT_REF
2051 && host_integerp (byte_position (TREE_OPERAND (target, 1)), 0))
2054 offset += int_byte_position (TREE_OPERAND (target, 1));
2055 target = TREE_OPERAND (target, 0);
2057 else if (TREE_CODE (target) == ARRAY_REF
2058 || TREE_CODE (target) == ARRAY_RANGE_REF)
2060 offset += (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (target)), 1)
2061 * tree_low_cst (TREE_OPERAND (target, 1), 0));
2062 target = TREE_OPERAND (target, 0);
2068 switch (TREE_CODE (target))
2072 x = DECL_RTL (target);
2076 x = gen_rtx_MEM (FUNCTION_MODE,
2077 gen_rtx_LABEL_REF (VOIDmode,
2078 label_rtx (TREE_OPERAND (exp, 0))));
2086 x = TREE_CST_RTL (target);
2093 if (GET_CODE (x) != MEM)
2098 value->offset = offset;
2101 enum kind { RTX_DOUBLE, RTX_INT };
2104 ENUM_BITFIELD(kind) kind : 16;
2105 ENUM_BITFIELD(machine_mode) mode : 16;
2107 union real_extract du;
2108 struct addr_const addr;
2109 struct {HOST_WIDE_INT high, low;} di;
2113 /* Uniquize all constants that appear in memory.
2114 Each constant in memory thus far output is recorded
2115 in `const_hash_table' with a `struct constant_descriptor'
2116 that contains a polish representation of the value of
2119 We cannot store the trees in the hash table
2120 because the trees may be temporary. */
2122 struct constant_descriptor
2124 struct constant_descriptor *next;
2127 /* Make sure the data is reasonably aligned. */
2130 unsigned char contents[1];
2131 #ifdef HAVE_LONG_DOUBLE
2140 #define MAX_HASH_TABLE 1009
2141 static struct constant_descriptor *const_hash_table[MAX_HASH_TABLE];
2143 #define STRHASH(x) ((hashval_t)((long)(x) >> 3))
2145 struct deferred_string
2152 static htab_t const_str_htab;
2154 /* Mark a const_hash_table descriptor for GC. */
2157 mark_const_hash_entry (ptr)
2160 struct constant_descriptor *desc = * (struct constant_descriptor **) ptr;
2164 ggc_mark_rtx (desc->rtl);
2169 /* Mark the hash-table element X (which is really a pointer to an
2170 struct deferred_string *). */
2173 mark_const_str_htab_1 (x, data)
2175 void *data ATTRIBUTE_UNUSED;
2177 ggc_mark_tree (((struct deferred_string *) *x)->exp);
2181 /* Mark a const_str_htab for GC. */
2184 mark_const_str_htab (htab)
2187 htab_traverse (*((htab_t *) htab), mark_const_str_htab_1, NULL);
2190 /* Returns a hash code for X (which is a really a
2191 struct deferred_string *). */
2194 const_str_htab_hash (x)
2197 return STRHASH (((const struct deferred_string *) x)->label);
2200 /* Returns non-zero if the value represented by X (which is really a
2201 struct deferred_string *) is the same as that given by Y
2202 (which is really a char *). */
2205 const_str_htab_eq (x, y)
2209 return (((const struct deferred_string *) x)->label == (const char *) y);
2212 /* Delete the hash table entry dfsp. */
2215 const_str_htab_del (dfsp)
2221 /* Compute a hash code for a constant expression. */
2227 register const char *p;
2228 register int len, hi, i;
2229 register enum tree_code code = TREE_CODE (exp);
2231 /* Either set P and LEN to the address and len of something to hash and
2232 exit the switch or return a value. */
2237 p = (char *) &TREE_INT_CST (exp);
2238 len = sizeof TREE_INT_CST (exp);
2242 p = (char *) &TREE_REAL_CST (exp);
2243 len = sizeof TREE_REAL_CST (exp);
2247 p = TREE_STRING_POINTER (exp);
2248 len = TREE_STRING_LENGTH (exp);
2252 return (const_hash (TREE_REALPART (exp)) * 5
2253 + const_hash (TREE_IMAGPART (exp)));
2256 if (TREE_CODE (TREE_TYPE (exp)) == SET_TYPE)
2260 len = int_size_in_bytes (TREE_TYPE (exp));
2261 tmp = (char *) alloca (len);
2262 get_set_constructor_bytes (exp, (unsigned char *) tmp, len);
2270 /* For record type, include the type in the hashing.
2271 We do not do so for array types
2272 because (1) the sizes of the elements are sufficient
2273 and (2) distinct array types can have the same constructor.
2274 Instead, we include the array size because the constructor could
2276 if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE)
2277 hi = ((unsigned long) TREE_TYPE (exp) & ((1 << HASHBITS) - 1))
2280 hi = ((5 + int_size_in_bytes (TREE_TYPE (exp)))
2281 & ((1 << HASHBITS) - 1)) % MAX_HASH_TABLE;
2283 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
2284 if (TREE_VALUE (link))
2286 = (hi * 603 + const_hash (TREE_VALUE (link))) % MAX_HASH_TABLE;
2293 struct addr_const value;
2295 decode_addr_const (exp, &value);
2296 if (GET_CODE (value.base) == SYMBOL_REF)
2298 /* Don't hash the address of the SYMBOL_REF;
2299 only use the offset and the symbol name. */
2301 p = XSTR (value.base, 0);
2302 for (i = 0; p[i] != 0; i++)
2303 hi = ((hi * 613) + (unsigned) (p[i]));
2305 else if (GET_CODE (value.base) == LABEL_REF)
2306 hi = value.offset + CODE_LABEL_NUMBER (XEXP (value.base, 0)) * 13;
2310 hi &= (1 << HASHBITS) - 1;
2311 hi %= MAX_HASH_TABLE;
2317 return (const_hash (TREE_OPERAND (exp, 0)) * 9
2318 + const_hash (TREE_OPERAND (exp, 1)));
2322 case NON_LVALUE_EXPR:
2323 return const_hash (TREE_OPERAND (exp, 0)) * 7 + 2;
2326 /* A language specific constant. Just hash the code. */
2327 return (int) code % MAX_HASH_TABLE;
2330 /* Compute hashing function */
2332 for (i = 0; i < len; i++)
2333 hi = ((hi * 613) + (unsigned) (p[i]));
2335 hi &= (1 << HASHBITS) - 1;
2336 hi %= MAX_HASH_TABLE;
2340 /* Compare a constant expression EXP with a constant-descriptor DESC.
2341 Return 1 if DESC describes a constant with the same value as EXP. */
2344 compare_constant (exp, desc)
2346 struct constant_descriptor *desc;
2348 return 0 != compare_constant_1 (exp, desc->u.contents);
2351 /* Compare constant expression EXP with a substring P of a constant descriptor.
2352 If they match, return a pointer to the end of the substring matched.
2353 If they do not match, return 0.
2355 Since descriptors are written in polish prefix notation,
2356 this function can be used recursively to test one operand of EXP
2357 against a subdescriptor, and if it succeeds it returns the
2358 address of the subdescriptor for the next operand. */
2360 static const unsigned char *
2361 compare_constant_1 (exp, p)
2363 const unsigned char *p;
2365 register const unsigned char *strp;
2367 register enum tree_code code = TREE_CODE (exp);
2369 if (code != (enum tree_code) *p++)
2372 /* Either set STRP, P and LEN to pointers and length to compare and exit the
2373 switch, or return the result of the comparison. */
2378 /* Integer constants are the same only if the same width of type. */
2379 if (*p++ != TYPE_PRECISION (TREE_TYPE (exp)))
2382 strp = (unsigned char *) &TREE_INT_CST (exp);
2383 len = sizeof TREE_INT_CST (exp);
2387 /* Real constants are the same only if the same width of type. */
2388 if (*p++ != TYPE_PRECISION (TREE_TYPE (exp)))
2391 strp = (unsigned char *) &TREE_REAL_CST (exp);
2392 len = sizeof TREE_REAL_CST (exp);
2396 if (flag_writable_strings)
2399 if ((enum machine_mode) *p++ != TYPE_MODE (TREE_TYPE (exp)))
2402 strp = (const unsigned char *)TREE_STRING_POINTER (exp);
2403 len = TREE_STRING_LENGTH (exp);
2404 if (memcmp ((char *) &TREE_STRING_LENGTH (exp), p,
2405 sizeof TREE_STRING_LENGTH (exp)))
2408 p += sizeof TREE_STRING_LENGTH (exp);
2412 p = compare_constant_1 (TREE_REALPART (exp), p);
2416 return compare_constant_1 (TREE_IMAGPART (exp), p);
2419 if (TREE_CODE (TREE_TYPE (exp)) == SET_TYPE)
2421 int xlen = len = int_size_in_bytes (TREE_TYPE (exp));
2422 unsigned char *tmp = (unsigned char *) alloca (len);
2424 get_set_constructor_bytes (exp, tmp, len);
2425 strp = (unsigned char *) tmp;
2426 if (memcmp ((char *) &xlen, p, sizeof xlen))
2435 int length = list_length (CONSTRUCTOR_ELTS (exp));
2437 enum machine_mode mode = TYPE_MODE (TREE_TYPE (exp));
2438 int have_purpose = 0;
2440 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
2441 if (TREE_PURPOSE (link))
2444 if (memcmp ((char *) &length, p, sizeof length))
2449 /* For record constructors, insist that the types match.
2450 For arrays, just verify both constructors are for arrays.
2451 Then insist that either both or none have any TREE_PURPOSE
2453 if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE)
2454 type = TREE_TYPE (exp);
2458 if (memcmp ((char *) &type, p, sizeof type))
2461 if (TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE)
2463 if (memcmp ((char *) &mode, p, sizeof mode))
2471 if (memcmp ((char *) &have_purpose, p, sizeof have_purpose))
2474 p += sizeof have_purpose;
2476 /* For arrays, insist that the size in bytes match. */
2477 if (TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE)
2479 HOST_WIDE_INT size = int_size_in_bytes (TREE_TYPE (exp));
2481 if (memcmp ((char *) &size, p, sizeof size))
2487 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
2489 if (TREE_VALUE (link))
2491 if ((p = compare_constant_1 (TREE_VALUE (link), p)) == 0)
2498 if (memcmp ((char *) &zero, p, sizeof zero))
2504 if (TREE_PURPOSE (link)
2505 && TREE_CODE (TREE_PURPOSE (link)) == FIELD_DECL)
2507 if (memcmp ((char *) &TREE_PURPOSE (link), p,
2508 sizeof TREE_PURPOSE (link)))
2511 p += sizeof TREE_PURPOSE (link);
2513 else if (TREE_PURPOSE (link))
2515 if ((p = compare_constant_1 (TREE_PURPOSE (link), p)) == 0)
2518 else if (have_purpose)
2522 if (memcmp ((char *) &zero, p, sizeof zero))
2534 struct addr_const value;
2536 decode_addr_const (exp, &value);
2537 strp = (unsigned char *) &value.offset;
2538 len = sizeof value.offset;
2539 /* Compare the offset. */
2541 if (*p++ != *strp++)
2544 /* Compare symbol name. */
2545 strp = (const unsigned char *) XSTR (value.base, 0);
2546 len = strlen ((const char *) strp) + 1;
2553 p = compare_constant_1 (TREE_OPERAND (exp, 0), p);
2557 return compare_constant_1 (TREE_OPERAND (exp, 1), p);
2561 case NON_LVALUE_EXPR:
2562 return compare_constant_1 (TREE_OPERAND (exp, 0), p);
2565 if (lang_expand_constant)
2567 exp = (*lang_expand_constant) (exp);
2568 return compare_constant_1 (exp, p);
2573 /* Compare constant contents. */
2575 if (*p++ != *strp++)
2581 /* Construct a constant descriptor for the expression EXP.
2582 It is up to the caller to enter the descriptor in the hash table. */
2584 static struct constant_descriptor *
2585 record_constant (exp)
2588 struct constant_descriptor *next = 0;
2593 /* Make a struct constant_descriptor. The first three pointers will
2594 be filled in later. Here we just leave space for them. */
2596 obstack_grow (&permanent_obstack, (char *) &next, sizeof next);
2597 obstack_grow (&permanent_obstack, (char *) &label, sizeof label);
2598 obstack_grow (&permanent_obstack, (char *) &rtl, sizeof rtl);
2600 /* Align the descriptor for the data payload. */
2601 pad = (offsetof (struct constant_descriptor, u)
2602 - offsetof(struct constant_descriptor, rtl)
2603 - sizeof(next->rtl));
2605 obstack_blank (&permanent_obstack, pad);
2607 record_constant_1 (exp);
2608 return (struct constant_descriptor *) obstack_finish (&permanent_obstack);
2611 /* Add a description of constant expression EXP
2612 to the object growing in `permanent_obstack'.
2613 No need to return its address; the caller will get that
2614 from the obstack when the object is complete. */
2617 record_constant_1 (exp)
2620 register const unsigned char *strp;
2622 register enum tree_code code = TREE_CODE (exp);
2624 obstack_1grow (&permanent_obstack, (unsigned int) code);
2629 obstack_1grow (&permanent_obstack, TYPE_PRECISION (TREE_TYPE (exp)));
2630 strp = (unsigned char *) &TREE_INT_CST (exp);
2631 len = sizeof TREE_INT_CST (exp);
2635 obstack_1grow (&permanent_obstack, TYPE_PRECISION (TREE_TYPE (exp)));
2636 strp = (unsigned char *) &TREE_REAL_CST (exp);
2637 len = sizeof TREE_REAL_CST (exp);
2641 if (flag_writable_strings)
2644 obstack_1grow (&permanent_obstack, TYPE_MODE (TREE_TYPE (exp)));
2645 strp = (const unsigned char *) TREE_STRING_POINTER (exp);
2646 len = TREE_STRING_LENGTH (exp);
2647 obstack_grow (&permanent_obstack, (char *) &TREE_STRING_LENGTH (exp),
2648 sizeof TREE_STRING_LENGTH (exp));
2652 record_constant_1 (TREE_REALPART (exp));
2653 record_constant_1 (TREE_IMAGPART (exp));
2657 if (TREE_CODE (TREE_TYPE (exp)) == SET_TYPE)
2659 int nbytes = int_size_in_bytes (TREE_TYPE (exp));
2660 obstack_grow (&permanent_obstack, &nbytes, sizeof (nbytes));
2661 obstack_blank (&permanent_obstack, nbytes);
2662 get_set_constructor_bytes
2663 (exp, (unsigned char *) permanent_obstack.next_free-nbytes,
2670 int length = list_length (CONSTRUCTOR_ELTS (exp));
2671 enum machine_mode mode = TYPE_MODE (TREE_TYPE (exp));
2673 int have_purpose = 0;
2675 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
2676 if (TREE_PURPOSE (link))
2679 obstack_grow (&permanent_obstack, (char *) &length, sizeof length);
2681 /* For record constructors, insist that the types match.
2682 For arrays, just verify both constructors are for arrays
2683 of the same mode. Then insist that either both or none
2684 have any TREE_PURPOSE values. */
2685 if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE)
2686 type = TREE_TYPE (exp);
2690 obstack_grow (&permanent_obstack, (char *) &type, sizeof type);
2691 if (TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE)
2692 obstack_grow (&permanent_obstack, &mode, sizeof mode);
2694 obstack_grow (&permanent_obstack, (char *) &have_purpose,
2695 sizeof have_purpose);
2697 /* For arrays, insist that the size in bytes match. */
2698 if (TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE)
2700 HOST_WIDE_INT size = int_size_in_bytes (TREE_TYPE (exp));
2701 obstack_grow (&permanent_obstack, (char *) &size, sizeof size);
2704 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
2706 if (TREE_VALUE (link))
2707 record_constant_1 (TREE_VALUE (link));
2712 obstack_grow (&permanent_obstack,
2713 (char *) &zero, sizeof zero);
2716 if (TREE_PURPOSE (link)
2717 && TREE_CODE (TREE_PURPOSE (link)) == FIELD_DECL)
2718 obstack_grow (&permanent_obstack,
2719 (char *) &TREE_PURPOSE (link),
2720 sizeof TREE_PURPOSE (link));
2721 else if (TREE_PURPOSE (link))
2722 record_constant_1 (TREE_PURPOSE (link));
2723 else if (have_purpose)
2727 obstack_grow (&permanent_obstack,
2728 (char *) &zero, sizeof zero);
2736 struct addr_const value;
2738 decode_addr_const (exp, &value);
2739 /* Record the offset. */
2740 obstack_grow (&permanent_obstack,
2741 (char *) &value.offset, sizeof value.offset);
2743 switch (GET_CODE (value.base))
2746 /* Record the symbol name. */
2747 obstack_grow (&permanent_obstack, XSTR (value.base, 0),
2748 strlen (XSTR (value.base, 0)) + 1);
2751 /* Record the address of the CODE_LABEL. It may not have
2752 been emitted yet, so it's UID may be zero. But pointer
2753 identity is good enough. */
2754 obstack_grow (&permanent_obstack, &XEXP (value.base, 0),
2766 record_constant_1 (TREE_OPERAND (exp, 0));
2767 record_constant_1 (TREE_OPERAND (exp, 1));
2772 case NON_LVALUE_EXPR:
2773 record_constant_1 (TREE_OPERAND (exp, 0));
2777 if (lang_expand_constant)
2779 exp = (*lang_expand_constant) (exp);
2780 record_constant_1 (exp);
2785 /* Record constant contents. */
2786 obstack_grow (&permanent_obstack, strp, len);
2789 /* Record a list of constant expressions that were passed to
2790 output_constant_def but that could not be output right away. */
2792 struct deferred_constant
2794 struct deferred_constant *next;
2800 static struct deferred_constant *deferred_constants;
2802 /* Another list of constants which should be output after the
2804 static struct deferred_constant *after_function_constants;
2806 /* Nonzero means defer output of addressed subconstants
2807 (i.e., those for which output_constant_def is called.) */
2808 static int defer_addressed_constants_flag;
2810 /* Start deferring output of subconstants. */
2813 defer_addressed_constants ()
2815 defer_addressed_constants_flag++;
2818 /* Stop deferring output of subconstants,
2819 and output now all those that have been deferred. */
2822 output_deferred_addressed_constants ()
2824 struct deferred_constant *p, *next;
2826 defer_addressed_constants_flag--;
2828 if (defer_addressed_constants_flag > 0)
2831 for (p = deferred_constants; p; p = next)
2833 output_constant_def_contents (p->exp, p->reloc, p->labelno);
2838 deferred_constants = 0;
2841 /* Output any constants which should appear after a function. */
2844 output_after_function_constants ()
2846 struct deferred_constant *p, *next;
2848 for (p = after_function_constants; p; p = next)
2850 output_constant_def_contents (p->exp, p->reloc, p->labelno);
2855 after_function_constants = 0;
2858 /* Make a copy of the whole tree structure for a constant.
2859 This handles the same types of nodes that compare_constant
2860 and record_constant handle. */
2866 switch (TREE_CODE (exp))
2869 /* For ADDR_EXPR, we do not want to copy the decl whose address
2870 is requested. We do want to copy constants though. */
2871 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, 0))) == 'c')
2872 return build1 (TREE_CODE (exp), TREE_TYPE (exp),
2873 copy_constant (TREE_OPERAND (exp, 0)));
2875 return copy_node (exp);
2880 return copy_node (exp);
2883 return build_complex (TREE_TYPE (exp),
2884 copy_constant (TREE_REALPART (exp)),
2885 copy_constant (TREE_IMAGPART (exp)));
2889 return build (TREE_CODE (exp), TREE_TYPE (exp),
2890 copy_constant (TREE_OPERAND (exp, 0)),
2891 copy_constant (TREE_OPERAND (exp, 1)));
2895 case NON_LVALUE_EXPR:
2896 return build1 (TREE_CODE (exp), TREE_TYPE (exp),
2897 copy_constant (TREE_OPERAND (exp, 0)));
2901 tree copy = copy_node (exp);
2902 tree list = copy_list (CONSTRUCTOR_ELTS (exp));
2905 CONSTRUCTOR_ELTS (copy) = list;
2906 for (tail = list; tail; tail = TREE_CHAIN (tail))
2907 TREE_VALUE (tail) = copy_constant (TREE_VALUE (tail));
2908 if (TREE_CODE (TREE_TYPE (exp)) == SET_TYPE)
2909 for (tail = list; tail; tail = TREE_CHAIN (tail))
2910 TREE_PURPOSE (tail) = copy_constant (TREE_PURPOSE (tail));
2920 /* Return an rtx representing a reference to constant data in memory
2921 for the constant expression EXP.
2923 If assembler code for such a constant has already been output,
2924 return an rtx to refer to it.
2925 Otherwise, output such a constant in memory (or defer it for later)
2926 and generate an rtx for it.
2928 If DEFER is non-zero, the output of string constants can be deferred
2929 and output only if referenced in the function after all optimizations.
2931 The TREE_CST_RTL of EXP is set up to point to that rtx.
2932 The const_hash_table records which constants already have label strings. */
2935 output_constant_def (exp, defer)
2940 register struct constant_descriptor *desc;
2941 struct deferred_string **defstr;
2945 int after_function = 0;
2948 if (TREE_CST_RTL (exp))
2949 return TREE_CST_RTL (exp);
2951 /* Make sure any other constants whose addresses appear in EXP
2952 are assigned label numbers. */
2954 reloc = output_addressed_constants (exp);
2956 /* Compute hash code of EXP. Search the descriptors for that hash code
2957 to see if any of them describes EXP. If yes, the descriptor records
2958 the label number already assigned. */
2960 hash = const_hash (exp) % MAX_HASH_TABLE;
2962 for (desc = const_hash_table[hash]; desc; desc = desc->next)
2963 if (compare_constant (exp, desc))
2968 /* No constant equal to EXP is known to have been output.
2969 Make a constant descriptor to enter EXP in the hash table.
2970 Assign the label number and record it in the descriptor for
2971 future calls to this function to find. */
2973 /* Create a string containing the label name, in LABEL. */
2974 labelno = const_labelno++;
2975 ASM_GENERATE_INTERNAL_LABEL (label, "LC", labelno);
2977 desc = record_constant (exp);
2978 desc->next = const_hash_table[hash];
2979 desc->label = ggc_strdup (label);
2980 const_hash_table[hash] = desc;
2982 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
2984 = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp)),
2985 gen_rtx_SYMBOL_REF (Pmode, desc->label));
2987 set_mem_attributes (desc->rtl, exp, 1);
2992 TREE_CST_RTL (exp) = desc->rtl;
2994 /* Optionally set flags or add text to the name to record information
2995 such as that it is a function name. If the name is changed, the macro
2996 ASM_OUTPUT_LABELREF will have to know how to strip this information. */
2997 #ifdef ENCODE_SECTION_INFO
2998 /* A previously-processed constant would already have section info
3002 ENCODE_SECTION_INFO (exp);
3003 desc->rtl = TREE_CST_RTL (exp);
3004 desc->label = XSTR (XEXP (desc->rtl, 0), 0);
3008 #ifdef CONSTANT_AFTER_FUNCTION_P
3009 if (current_function_decl != 0
3010 && CONSTANT_AFTER_FUNCTION_P (exp))
3015 && STRING_POOL_ADDRESS_P (XEXP (desc->rtl, 0))
3016 && (!defer || defer_addressed_constants_flag || after_function))
3018 defstr = (struct deferred_string **)
3019 htab_find_slot_with_hash (const_str_htab, desc->label,
3020 STRHASH (desc->label), NO_INSERT);
3023 /* If the string is currently deferred but we need to output it now,
3024 remove it from deferred string hash table. */
3026 labelno = (*defstr)->labelno;
3027 STRING_POOL_ADDRESS_P (XEXP (desc->rtl, 0)) = 0;
3028 htab_clear_slot (const_str_htab, (void **) defstr);
3032 /* If this is the first time we've seen this particular constant,
3033 output it (or defer its output for later). */
3036 if (defer_addressed_constants_flag || after_function)
3038 struct deferred_constant *p;
3039 p = (struct deferred_constant *) xmalloc (sizeof (struct deferred_constant));
3041 p->exp = copy_constant (exp);
3043 p->labelno = labelno;
3046 p->next = after_function_constants;
3047 after_function_constants = p;
3051 p->next = deferred_constants;
3052 deferred_constants = p;
3057 /* Do no output if -fsyntax-only. */
3058 if (! flag_syntax_only)
3060 if (TREE_CODE (exp) != STRING_CST
3062 || flag_writable_strings
3063 || (defstr = (struct deferred_string **)
3064 htab_find_slot_with_hash (const_str_htab,
3066 STRHASH (desc->label),
3068 output_constant_def_contents (exp, reloc, labelno);
3071 struct deferred_string *p;
3073 p = (struct deferred_string *)
3074 xmalloc (sizeof (struct deferred_string));
3076 p->exp = copy_constant (exp);
3077 p->label = desc->label;
3078 p->labelno = labelno;
3080 STRING_POOL_ADDRESS_P (XEXP (desc->rtl, 0)) = 1;
3086 return TREE_CST_RTL (exp);
3089 /* Now output assembler code to define the label for EXP,
3090 and follow it with the data of EXP. */
3093 output_constant_def_contents (exp, reloc, labelno)
3100 if (IN_NAMED_SECTION (exp))
3101 named_section (exp, NULL, reloc);
3104 /* First switch to text section, except for writable strings. */
3105 #ifdef SELECT_SECTION
3106 SELECT_SECTION (exp, reloc);
3108 if (((TREE_CODE (exp) == STRING_CST) && flag_writable_strings)
3109 || (flag_pic && reloc))
3112 readonly_data_section ();
3116 /* Align the location counter as required by EXP's data type. */
3117 align = TYPE_ALIGN (TREE_TYPE (exp));
3118 #ifdef CONSTANT_ALIGNMENT
3119 align = CONSTANT_ALIGNMENT (exp, align);
3122 if (align > BITS_PER_UNIT)
3123 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
3125 /* Output the label itself. */
3126 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LC", labelno);
3128 /* Output the value of EXP. */
3129 output_constant (exp,
3130 (TREE_CODE (exp) == STRING_CST
3131 ? MAX (TREE_STRING_LENGTH (exp),
3132 int_size_in_bytes (TREE_TYPE (exp)))
3133 : int_size_in_bytes (TREE_TYPE (exp))));
3137 /* Structure to represent sufficient information about a constant so that
3138 it can be output when the constant pool is output, so that function
3139 integration can be done, and to simplify handling on machines that reference
3140 constant pool as base+displacement. */
3142 struct pool_constant
3144 struct constant_descriptor *desc;
3145 struct pool_constant *next, *next_sym;
3148 enum machine_mode mode;
3155 /* Hash code for a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true.
3156 The argument is XSTR (... , 0) */
3158 #define SYMHASH(LABEL) \
3159 ((((unsigned long) (LABEL)) & ((1 << HASHBITS) - 1)) % MAX_RTX_HASH_TABLE)
3161 /* Initialize constant pool hashing for a new function. */
3164 init_varasm_status (f)
3167 struct varasm_status *p;
3168 p = (struct varasm_status *) xmalloc (sizeof (struct varasm_status));
3170 p->x_const_rtx_hash_table
3171 = ((struct constant_descriptor **)
3172 xcalloc (MAX_RTX_HASH_TABLE, sizeof (struct constant_descriptor *)));
3173 p->x_const_rtx_sym_hash_table
3174 = ((struct pool_constant **)
3175 xcalloc (MAX_RTX_HASH_TABLE, sizeof (struct pool_constant *)));
3177 p->x_first_pool = p->x_last_pool = 0;
3178 p->x_pool_offset = 0;
3179 p->x_const_double_chain = 0;
3182 /* Mark PC for GC. */
3185 mark_pool_constant (pc)
3186 struct pool_constant *pc;
3191 ggc_mark_rtx (pc->constant);
3196 /* Mark P for GC. */
3199 mark_varasm_status (p)
3200 struct varasm_status *p;
3205 mark_pool_constant (p->x_first_pool);
3206 ggc_mark_rtx (p->x_const_double_chain);
3209 /* Clear out all parts of the state in F that can safely be discarded
3210 after the function has been compiled, to let garbage collection
3211 reclaim the memory. */
3214 free_varasm_status (f)
3217 struct varasm_status *p;
3222 /* Clear out the hash tables. */
3223 for (i = 0; i < MAX_RTX_HASH_TABLE; ++i)
3225 struct constant_descriptor* cd;
3227 cd = p->x_const_rtx_hash_table[i];
3229 struct constant_descriptor* next = cd->next;
3235 free (p->x_const_rtx_hash_table);
3236 free (p->x_const_rtx_sym_hash_table);
3242 /* Express an rtx for a constant integer (perhaps symbolic)
3243 as the sum of a symbol or label plus an explicit integer.
3244 They are stored into VALUE. */
3247 decode_rtx_const (mode, x, value)
3248 enum machine_mode mode;
3250 struct rtx_const *value;
3252 /* Clear the whole structure, including any gaps. */
3253 memset (value, 0, sizeof (struct rtx_const));
3255 value->kind = RTX_INT; /* Most usual kind. */
3258 switch (GET_CODE (x))
3261 value->kind = RTX_DOUBLE;
3262 if (GET_MODE (x) != VOIDmode)
3264 value->mode = GET_MODE (x);
3265 memcpy ((char *) &value->un.du,
3266 (char *) &CONST_DOUBLE_LOW (x), sizeof value->un.du);
3270 value->un.di.low = CONST_DOUBLE_LOW (x);
3271 value->un.di.high = CONST_DOUBLE_HIGH (x);
3276 value->un.addr.offset = INTVAL (x);
3282 value->un.addr.base = x;
3287 if (GET_CODE (x) == PLUS && GET_CODE (XEXP (x, 1)) == CONST_INT)
3289 value->un.addr.base = XEXP (x, 0);
3290 value->un.addr.offset = INTVAL (XEXP (x, 1));
3292 else if (GET_CODE (x) == MINUS && GET_CODE (XEXP (x, 1)) == CONST_INT)
3294 value->un.addr.base = XEXP (x, 0);
3295 value->un.addr.offset = - INTVAL (XEXP (x, 1));
3299 value->un.addr.base = x;
3300 value->un.addr.offset = 0;
3308 if (value->kind == RTX_INT && value->un.addr.base != 0)
3309 switch (GET_CODE (value->un.addr.base))
3312 /* Use the string's address, not the SYMBOL_REF's address,
3313 for the sake of addresses of library routines. */
3314 value->un.addr.base = (rtx) XSTR (value->un.addr.base, 0);
3318 /* For a LABEL_REF, compare labels. */
3319 value->un.addr.base = XEXP (value->un.addr.base, 0);
3326 /* Given a MINUS expression, simplify it if both sides
3327 include the same symbol. */
3330 simplify_subtraction (x)
3333 struct rtx_const val0, val1;
3335 decode_rtx_const (GET_MODE (x), XEXP (x, 0), &val0);
3336 decode_rtx_const (GET_MODE (x), XEXP (x, 1), &val1);
3338 if (val0.un.addr.base == val1.un.addr.base)
3339 return GEN_INT (val0.un.addr.offset - val1.un.addr.offset);
3343 /* Compute a hash code for a constant RTL expression. */
3346 const_hash_rtx (mode, x)
3347 enum machine_mode mode;
3353 struct rtx_const value;
3354 decode_rtx_const (mode, x, &value);
3356 /* Compute hashing function */
3358 for (i = 0; i < sizeof value / sizeof (int); i++)
3359 hi += ((int *) &value)[i];
3361 hi &= (1 << HASHBITS) - 1;
3362 hi %= MAX_RTX_HASH_TABLE;
3366 /* Compare a constant rtl object X with a constant-descriptor DESC.
3367 Return 1 if DESC describes a constant with the same value as X. */
3370 compare_constant_rtx (mode, x, desc)
3371 enum machine_mode mode;
3373 struct constant_descriptor *desc;
3375 register int *p = (int *) desc->u.contents;
3378 struct rtx_const value;
3380 decode_rtx_const (mode, x, &value);
3381 strp = (int *) &value;
3382 len = sizeof value / sizeof (int);
3384 /* Compare constant contents. */
3386 if (*p++ != *strp++)
3392 /* Construct a constant descriptor for the rtl-expression X.
3393 It is up to the caller to enter the descriptor in the hash table. */
3395 static struct constant_descriptor *
3396 record_constant_rtx (mode, x)
3397 enum machine_mode mode;
3400 struct constant_descriptor *ptr;
3402 ptr = ((struct constant_descriptor *)
3403 xcalloc (1, (offsetof (struct constant_descriptor, u)
3404 + sizeof (struct rtx_const))));
3405 decode_rtx_const (mode, x, (struct rtx_const *) ptr->u.contents);
3410 /* Given a constant rtx X, make (or find) a memory constant for its value
3411 and return a MEM rtx to refer to it in memory. */
3414 force_const_mem (mode, x)
3415 enum machine_mode mode;
3419 register struct constant_descriptor *desc;
3421 const char *found = 0;
3424 /* If we want this CONST_DOUBLE in the same mode as it is in memory
3425 (this will always be true for floating CONST_DOUBLEs that have been
3426 placed in memory, but not for VOIDmode (integer) CONST_DOUBLEs),
3427 use the previous copy. Otherwise, make a new one. Note that in
3428 the unlikely event that this same CONST_DOUBLE is used in two different
3429 modes in an alternating fashion, we will allocate a lot of different
3430 memory locations, but this should be extremely rare. */
3432 if (GET_CODE (x) == CONST_DOUBLE
3433 && GET_CODE (CONST_DOUBLE_MEM (x)) == MEM
3434 && GET_MODE (CONST_DOUBLE_MEM (x)) == mode)
3435 return CONST_DOUBLE_MEM (x);
3437 /* Compute hash code of X. Search the descriptors for that hash code
3438 to see if any of them describes X. If yes, the descriptor records
3439 the label number already assigned. */
3441 hash = const_hash_rtx (mode, x);
3443 for (desc = const_rtx_hash_table[hash]; desc; desc = desc->next)
3444 if (compare_constant_rtx (mode, x, desc))
3446 found = desc->label;
3452 register struct pool_constant *pool;
3455 /* No constant equal to X is known to have been output.
3456 Make a constant descriptor to enter X in the hash table.
3457 Assign the label number and record it in the descriptor for
3458 future calls to this function to find. */
3460 desc = record_constant_rtx (mode, x);
3461 desc->next = const_rtx_hash_table[hash];
3462 const_rtx_hash_table[hash] = desc;
3464 /* Align the location counter as required by EXP's data type. */
3465 align = (mode == VOIDmode) ? UNITS_PER_WORD : GET_MODE_SIZE (mode);
3466 if (align > BIGGEST_ALIGNMENT / BITS_PER_UNIT)
3467 align = BIGGEST_ALIGNMENT / BITS_PER_UNIT;
3468 #ifdef CONSTANT_ALIGNMENT
3469 align = CONSTANT_ALIGNMENT (make_tree (type_for_mode (mode, 0), x),
3470 align * BITS_PER_UNIT) / BITS_PER_UNIT;
3473 pool_offset += align - 1;
3474 pool_offset &= ~ (align - 1);
3476 if (GET_CODE (x) == LABEL_REF)
3477 LABEL_PRESERVE_P (XEXP (x, 0)) = 1;
3479 /* Allocate a pool constant descriptor, fill it in, and chain it in. */
3481 pool = (struct pool_constant *) ggc_alloc (sizeof (struct pool_constant));
3485 pool->labelno = const_labelno;
3486 pool->align = align;
3487 pool->offset = pool_offset;
3494 last_pool->next = pool;
3497 pool_offset += GET_MODE_SIZE (mode);
3499 /* Create a string containing the label name, in LABEL. */
3500 ASM_GENERATE_INTERNAL_LABEL (label, "LC", const_labelno);
3504 desc->label = found = ggc_strdup (label);
3506 /* Add label to symbol hash table. */
3507 hash = SYMHASH (found);
3508 pool->label = found;
3509 pool->next_sym = const_rtx_sym_hash_table[hash];
3510 const_rtx_sym_hash_table[hash] = pool;
3513 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
3515 def = gen_rtx_MEM (mode, gen_rtx_SYMBOL_REF (Pmode, found));
3516 set_mem_attributes (def, type_for_mode (mode, 0), 1);
3517 RTX_UNCHANGING_P (def) = 1;
3519 /* Mark the symbol_ref as belonging to this constants pool. */
3520 CONSTANT_POOL_ADDRESS_P (XEXP (def, 0)) = 1;
3521 current_function_uses_const_pool = 1;
3523 if (GET_CODE (x) == CONST_DOUBLE)
3525 if (CONST_DOUBLE_MEM (x) == cc0_rtx)
3527 CONST_DOUBLE_CHAIN (x) = const_double_chain;
3528 const_double_chain = x;
3530 CONST_DOUBLE_MEM (x) = def;
3536 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
3537 the corresponding pool_constant structure. */
3539 static struct pool_constant *
3540 find_pool_constant (f, addr)
3544 struct pool_constant *pool;
3545 const char *label = XSTR (addr, 0);
3547 for (pool = f->varasm->x_const_rtx_sym_hash_table[SYMHASH (label)]; pool;
3548 pool = pool->next_sym)
3549 if (pool->label == label)
3555 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
3558 get_pool_constant (addr)
3561 return (find_pool_constant (cfun, addr))->constant;
3564 /* Likewise, but for the constant pool of a specific function. */
3567 get_pool_constant_for_function (f, addr)
3571 return (find_pool_constant (f, addr))->constant;
3574 /* Similar, return the mode. */
3577 get_pool_mode (addr)
3580 return (find_pool_constant (cfun, addr))->mode;
3584 get_pool_mode_for_function (f, addr)
3588 return (find_pool_constant (f, addr))->mode;
3591 /* Similar, return the offset in the constant pool. */
3594 get_pool_offset (addr)
3597 return (find_pool_constant (cfun, addr))->offset;
3600 /* Return the size of the constant pool. */
3608 /* Write all the constants in the constant pool. */
3611 output_constant_pool (fnname, fndecl)
3612 const char *fnname ATTRIBUTE_UNUSED;
3613 tree fndecl ATTRIBUTE_UNUSED;
3615 struct pool_constant *pool;
3617 union real_extract u;
3619 /* It is possible for gcc to call force_const_mem and then to later
3620 discard the instructions which refer to the constant. In such a
3621 case we do not need to output the constant. */
3622 mark_constant_pool ();
3624 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3625 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file, fnname, fndecl, pool_offset);
3628 for (pool = first_pool; pool; pool = pool->next)
3637 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3638 whose CODE_LABEL has been deleted. This can occur if a jump table
3639 is eliminated by optimization. If so, write a constant of zero
3640 instead. Note that this can also happen by turning the
3641 CODE_LABEL into a NOTE. */
3642 /* ??? This seems completely and utterly wrong. Certainly it's
3643 not true for NOTE_INSN_DELETED_LABEL, but I disbelieve proper
3644 functioning even with INSN_DELETED_P and friends. */
3647 switch (GET_CODE (x))
3650 if (GET_CODE (XEXP (x, 0)) != PLUS
3651 || GET_CODE (XEXP (XEXP (x, 0), 0)) != LABEL_REF)
3653 tmp = XEXP (XEXP (x, 0), 0);
3658 if (INSN_DELETED_P (tmp)
3659 || (GET_CODE (tmp) == NOTE
3660 && NOTE_LINE_NUMBER (tmp) == NOTE_INSN_DELETED))
3671 /* First switch to correct section. */
3672 #ifdef SELECT_RTX_SECTION
3673 SELECT_RTX_SECTION (pool->mode, x);
3675 readonly_data_section ();
3678 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3679 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file, x, pool->mode,
3680 pool->align, pool->labelno, done);
3683 if (pool->align > 1)
3684 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (pool->align));
3686 /* Output the label. */
3687 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LC", pool->labelno);
3689 /* Output the value of the constant itself. */
3690 switch (GET_MODE_CLASS (pool->mode))
3693 if (GET_CODE (x) != CONST_DOUBLE)
3696 memcpy ((char *) &u, (char *) &CONST_DOUBLE_LOW (x), sizeof u);
3697 assemble_real (u.d, pool->mode);
3701 case MODE_PARTIAL_INT:
3702 assemble_integer (x, GET_MODE_SIZE (pool->mode), 1);
3709 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3715 #ifdef ASM_OUTPUT_POOL_EPILOGUE
3716 ASM_OUTPUT_POOL_EPILOGUE (asm_out_file, fnname, fndecl, pool_offset);
3719 /* Done with this pool. */
3720 first_pool = last_pool = 0;
3723 /* Look through the instructions for this function, and mark all the
3724 entries in the constant pool which are actually being used.
3725 Emit used deferred strings. */
3728 mark_constant_pool ()
3731 struct pool_constant *pool;
3733 if (first_pool == 0 && htab_elements (const_str_htab) == 0)
3736 for (pool = first_pool; pool; pool = pool->next)
3739 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
3741 mark_constants (PATTERN (insn));
3743 for (insn = current_function_epilogue_delay_list;
3745 insn = XEXP (insn, 1))
3747 mark_constants (PATTERN (insn));
3750 /* Look through appropriate parts of X, marking all entries in the
3751 constant pool which are actually being used. Entries that are only
3752 referenced by other constants are also marked as used. Emit
3753 deferred strings that are used. */
3760 register const char *format_ptr;
3765 if (GET_CODE (x) == SYMBOL_REF)
3767 mark_constant (&x, NULL);
3770 /* Never search inside a CONST_DOUBLE, because CONST_DOUBLE_MEM may be
3771 a MEM, but does not constitute a use of that MEM. */
3772 else if (GET_CODE (x) == CONST_DOUBLE)
3775 /* Insns may appear inside a SEQUENCE. Only check the patterns of
3776 insns, not any notes that may be attached. We don't want to mark
3777 a constant just because it happens to appear in a REG_EQUIV note. */
3780 mark_constants (PATTERN (x));
3784 format_ptr = GET_RTX_FORMAT (GET_CODE (x));
3786 for (i = 0; i < GET_RTX_LENGTH (GET_CODE (x)); i++)
3788 switch (*format_ptr++)
3791 mark_constants (XEXP (x, i));
3795 if (XVEC (x, i) != 0)
3799 for (j = 0; j < XVECLEN (x, i); j++)
3800 mark_constants (XVECEXP (x, i, j));
3819 /* Given a SYMBOL_REF CURRENT_RTX, mark it and all constants it refers
3820 to as used. Emit referenced deferred strings. This function can
3821 be used with for_each_rtx () to mark all SYMBOL_REFs in an rtx. */
3824 mark_constant (current_rtx, data)
3826 void *data ATTRIBUTE_UNUSED;
3828 rtx x = *current_rtx;
3832 else if (GET_CODE(x) == CONST_DOUBLE)
3833 /* Never search inside a CONST_DOUBLE because CONST_DOUBLE_MEM may
3834 be a MEM but does not constitute a use of that MEM. */
3836 else if (GET_CODE (x) == SYMBOL_REF)
3838 if (CONSTANT_POOL_ADDRESS_P (x))
3840 struct pool_constant *pool = find_pool_constant (cfun, x);
3841 if (pool->mark == 0) {
3843 for_each_rtx (&(pool->constant), &mark_constant, NULL);
3848 else if (STRING_POOL_ADDRESS_P (x))
3850 struct deferred_string **defstr;
3852 defstr = (struct deferred_string **)
3853 htab_find_slot_with_hash (const_str_htab, XSTR (x, 0),
3854 STRHASH (XSTR (x, 0)), NO_INSERT);
3857 struct deferred_string *p = *defstr;
3859 STRING_POOL_ADDRESS_P (x) = 0;
3860 output_constant_def_contents (p->exp, 0, p->labelno);
3861 htab_clear_slot (const_str_htab, (void **) defstr);
3868 /* Find all the constants whose addresses are referenced inside of EXP,
3869 and make sure assembler code with a label has been output for each one.
3870 Indicate whether an ADDR_EXPR has been encountered. */
3873 output_addressed_constants (exp)
3878 /* Give the front-end a chance to convert VALUE to something that
3879 looks more like a constant to the back-end. */
3880 if (lang_expand_constant)
3881 exp = (*lang_expand_constant) (exp);
3883 switch (TREE_CODE (exp))
3887 register tree constant = TREE_OPERAND (exp, 0);
3889 while (TREE_CODE (constant) == COMPONENT_REF)
3891 constant = TREE_OPERAND (constant, 0);
3894 if (TREE_CODE_CLASS (TREE_CODE (constant)) == 'c'
3895 || TREE_CODE (constant) == CONSTRUCTOR)
3896 /* No need to do anything here
3897 for addresses of variables or functions. */
3898 output_constant_def (constant, 0);
3905 reloc = output_addressed_constants (TREE_OPERAND (exp, 0));
3906 reloc |= output_addressed_constants (TREE_OPERAND (exp, 1));
3911 case NON_LVALUE_EXPR:
3912 reloc = output_addressed_constants (TREE_OPERAND (exp, 0));
3918 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
3919 if (TREE_VALUE (link) != 0)
3920 reloc |= output_addressed_constants (TREE_VALUE (link));
3930 /* Return nonzero if VALUE is a valid constant-valued expression
3931 for use in initializing a static variable; one that can be an
3932 element of a "constant" initializer.
3934 Return null_pointer_node if the value is absolute;
3935 if it is relocatable, return the variable that determines the relocation.
3936 We assume that VALUE has been folded as much as possible;
3937 therefore, we do not need to check for such things as
3938 arithmetic-combinations of integers. */
3941 initializer_constant_valid_p (value, endtype)
3945 /* Give the front-end a chance to convert VALUE to something that
3946 looks more like a constant to the back-end. */
3947 if (lang_expand_constant)
3948 value = (*lang_expand_constant) (value);
3950 switch (TREE_CODE (value))
3953 if ((TREE_CODE (TREE_TYPE (value)) == UNION_TYPE
3954 || TREE_CODE (TREE_TYPE (value)) == RECORD_TYPE)
3955 && TREE_CONSTANT (value)
3956 && CONSTRUCTOR_ELTS (value))
3958 initializer_constant_valid_p (TREE_VALUE (CONSTRUCTOR_ELTS (value)),
3961 return TREE_STATIC (value) ? null_pointer_node : 0;
3967 return null_pointer_node;
3970 return staticp (TREE_OPERAND (value, 0)) ? TREE_OPERAND (value, 0) : 0;
3972 case NON_LVALUE_EXPR:
3973 return initializer_constant_valid_p (TREE_OPERAND (value, 0), endtype);
3977 /* Allow conversions between pointer types. */
3978 if (POINTER_TYPE_P (TREE_TYPE (value))
3979 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0))))
3980 return initializer_constant_valid_p (TREE_OPERAND (value, 0), endtype);
3982 /* Allow conversions between real types. */
3983 if (FLOAT_TYPE_P (TREE_TYPE (value))
3984 && FLOAT_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0))))
3985 return initializer_constant_valid_p (TREE_OPERAND (value, 0), endtype);
3987 /* Allow length-preserving conversions between integer types. */
3988 if (INTEGRAL_TYPE_P (TREE_TYPE (value))
3989 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0)))
3990 && (TYPE_PRECISION (TREE_TYPE (value))
3991 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value, 0)))))
3992 return initializer_constant_valid_p (TREE_OPERAND (value, 0), endtype);
3994 /* Allow conversions between other integer types only if
3996 if (INTEGRAL_TYPE_P (TREE_TYPE (value))
3997 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0))))
3999 tree inner = initializer_constant_valid_p (TREE_OPERAND (value, 0),
4001 if (inner == null_pointer_node)
4002 return null_pointer_node;
4006 /* Allow (int) &foo provided int is as wide as a pointer. */
4007 if (INTEGRAL_TYPE_P (TREE_TYPE (value))
4008 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0)))
4009 && (TYPE_PRECISION (TREE_TYPE (value))
4010 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value, 0)))))
4011 return initializer_constant_valid_p (TREE_OPERAND (value, 0),
4014 /* Likewise conversions from int to pointers, but also allow
4015 conversions from 0. */
4016 if (POINTER_TYPE_P (TREE_TYPE (value))
4017 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0))))
4019 if (integer_zerop (TREE_OPERAND (value, 0)))
4020 return null_pointer_node;
4021 else if (TYPE_PRECISION (TREE_TYPE (value))
4022 <= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value, 0))))
4023 return initializer_constant_valid_p (TREE_OPERAND (value, 0),
4027 /* Allow conversions to union types if the value inside is okay. */
4028 if (TREE_CODE (TREE_TYPE (value)) == UNION_TYPE)
4029 return initializer_constant_valid_p (TREE_OPERAND (value, 0),
4034 if (! INTEGRAL_TYPE_P (endtype)
4035 || TYPE_PRECISION (endtype) >= POINTER_SIZE)
4037 tree valid0 = initializer_constant_valid_p (TREE_OPERAND (value, 0),
4039 tree valid1 = initializer_constant_valid_p (TREE_OPERAND (value, 1),
4041 /* If either term is absolute, use the other terms relocation. */
4042 if (valid0 == null_pointer_node)
4044 if (valid1 == null_pointer_node)
4050 if (! INTEGRAL_TYPE_P (endtype)
4051 || TYPE_PRECISION (endtype) >= POINTER_SIZE)
4053 tree valid0 = initializer_constant_valid_p (TREE_OPERAND (value, 0),
4055 tree valid1 = initializer_constant_valid_p (TREE_OPERAND (value, 1),
4057 /* Win if second argument is absolute. */
4058 if (valid1 == null_pointer_node)
4060 /* Win if both arguments have the same relocation.
4061 Then the value is absolute. */
4062 if (valid0 == valid1 && valid0 != 0)
4063 return null_pointer_node;
4065 /* Since GCC guarantees that string constants are unique in the
4066 generated code, a subtraction between two copies of the same
4067 constant string is absolute. */
4068 if (valid0 && TREE_CODE (valid0) == STRING_CST &&
4069 valid1 && TREE_CODE (valid1) == STRING_CST &&
4070 TREE_STRING_POINTER (valid0) == TREE_STRING_POINTER (valid1))
4071 return null_pointer_node;
4074 /* Support differences between labels. */
4075 if (INTEGRAL_TYPE_P (endtype))
4078 op0 = TREE_OPERAND (value, 0);
4079 op1 = TREE_OPERAND (value, 1);
4083 if (TREE_CODE (op0) == ADDR_EXPR
4084 && TREE_CODE (TREE_OPERAND (op0, 0)) == LABEL_DECL
4085 && TREE_CODE (op1) == ADDR_EXPR
4086 && TREE_CODE (TREE_OPERAND (op1, 0)) == LABEL_DECL)
4087 return null_pointer_node;
4098 /* Output assembler code for constant EXP to FILE, with no label.
4099 This includes the pseudo-op such as ".int" or ".byte", and a newline.
4100 Assumes output_addressed_constants has been done on EXP already.
4102 Generate exactly SIZE bytes of assembler data, padding at the end
4103 with zeros if necessary. SIZE must always be specified.
4105 SIZE is important for structure constructors,
4106 since trailing members may have been omitted from the constructor.
4107 It is also important for initialization of arrays from string constants
4108 since the full length of the string constant might not be wanted.
4109 It is also needed for initialization of unions, where the initializer's
4110 type is just one member, and that may not be as long as the union.
4112 There a case in which we would fail to output exactly SIZE bytes:
4113 for a structure constructor that wants to produce more than SIZE bytes.
4114 But such constructors will never be generated for any possible input. */
4117 output_constant (exp, size)
4121 register enum tree_code code = TREE_CODE (TREE_TYPE (exp));
4123 /* Some front-ends use constants other than the standard
4124 language-indepdent varieties, but which may still be output
4125 directly. Give the front-end a chance to convert EXP to a
4126 language-independent representation. */
4127 if (lang_expand_constant)
4129 exp = (*lang_expand_constant) (exp);
4130 code = TREE_CODE (TREE_TYPE (exp));
4133 if (size == 0 || flag_syntax_only)
4136 /* Eliminate the NON_LVALUE_EXPR_EXPR that makes a cast not be an lvalue.
4137 That way we get the constant (we hope) inside it. Also, strip off any
4138 NOP_EXPR that converts between two record, union, array, or set types
4139 or a CONVERT_EXPR that converts to a union TYPE. */
4140 while ((TREE_CODE (exp) == NOP_EXPR
4141 && (TREE_TYPE (exp) == TREE_TYPE (TREE_OPERAND (exp, 0))
4142 || AGGREGATE_TYPE_P (TREE_TYPE (exp))))
4143 || (TREE_CODE (exp) == CONVERT_EXPR
4144 && code == UNION_TYPE)
4145 || TREE_CODE (exp) == NON_LVALUE_EXPR)
4147 exp = TREE_OPERAND (exp, 0);
4148 code = TREE_CODE (TREE_TYPE (exp));
4151 /* Allow a constructor with no elements for any data type.
4152 This means to fill the space with zeros. */
4153 if (TREE_CODE (exp) == CONSTRUCTOR && CONSTRUCTOR_ELTS (exp) == 0)
4155 assemble_zeros (size);
4166 case REFERENCE_TYPE:
4167 /* ??? What about (int)((float)(int)&foo + 4) */
4168 while (TREE_CODE (exp) == NOP_EXPR || TREE_CODE (exp) == CONVERT_EXPR
4169 || TREE_CODE (exp) == NON_LVALUE_EXPR)
4170 exp = TREE_OPERAND (exp, 0);
4172 if (! assemble_integer (expand_expr (exp, NULL_RTX, VOIDmode,
4173 EXPAND_INITIALIZER),
4175 error ("initializer for integer value is too complicated");
4180 if (TREE_CODE (exp) != REAL_CST)
4181 error ("initializer for floating value is not a floating constant");
4183 assemble_real (TREE_REAL_CST (exp),
4184 mode_for_size (size * BITS_PER_UNIT, MODE_FLOAT, 0));
4189 output_constant (TREE_REALPART (exp), size / 2);
4190 output_constant (TREE_IMAGPART (exp), size / 2);
4191 size -= (size / 2) * 2;
4195 if (TREE_CODE (exp) == CONSTRUCTOR)
4197 output_constructor (exp, size);
4200 else if (TREE_CODE (exp) == STRING_CST)
4204 if (size > TREE_STRING_LENGTH (exp))
4206 excess = size - TREE_STRING_LENGTH (exp);
4207 size = TREE_STRING_LENGTH (exp);
4210 assemble_string (TREE_STRING_POINTER (exp), size);
4219 if (TREE_CODE (exp) == CONSTRUCTOR)
4220 output_constructor (exp, size);
4226 if (TREE_CODE (exp) == INTEGER_CST)
4227 assemble_integer (expand_expr (exp, NULL_RTX,
4228 VOIDmode, EXPAND_INITIALIZER),
4230 else if (TREE_CODE (exp) == CONSTRUCTOR)
4232 unsigned char *buffer = (unsigned char *) alloca (size);
4233 if (get_set_constructor_bytes (exp, buffer, size))
4235 assemble_string ((char *) buffer, size);
4238 error ("unknown set constructor type");
4246 assemble_zeros (size);
4250 /* Subroutine of output_constructor, used for computing the size of
4251 arrays of unspecified length. VAL must be a CONSTRUCTOR of an array
4252 type with an unspecified upper bound. */
4254 static unsigned HOST_WIDE_INT
4255 array_size_for_constructor (val)
4260 max_index = NULL_TREE;
4261 for (i = CONSTRUCTOR_ELTS (val); i ; i = TREE_CHAIN (i))
4263 tree index = TREE_PURPOSE (i);
4265 if (TREE_CODE (index) == RANGE_EXPR)
4266 index = TREE_OPERAND (index, 1);
4267 if (max_index == NULL_TREE || tree_int_cst_lt (max_index, index))
4271 if (max_index == NULL_TREE)
4274 /* Compute the total number of array elements. */
4275 i = size_binop (MINUS_EXPR, convert (sizetype, max_index),
4277 TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (val)))));
4278 i = size_binop (PLUS_EXPR, i, convert (sizetype, integer_one_node));
4280 /* Multiply by the array element unit size to find number of bytes. */
4281 i = size_binop (MULT_EXPR, i, TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (val))));
4283 return tree_low_cst (i, 1);
4286 /* Subroutine of output_constant, used for CONSTRUCTORs (aggregate constants).
4287 Generate at least SIZE bytes, padding if necessary. */
4290 output_constructor (exp, size)
4294 tree type = TREE_TYPE (exp);
4295 register tree link, field = 0;
4297 /* Number of bytes output or skipped so far.
4298 In other words, current position within the constructor. */
4299 HOST_WIDE_INT total_bytes = 0;
4300 /* Non-zero means BYTE contains part of a byte, to be output. */
4301 int byte_buffer_in_use = 0;
4302 register int byte = 0;
4304 if (HOST_BITS_PER_WIDE_INT < BITS_PER_UNIT)
4307 if (TREE_CODE (type) == RECORD_TYPE)
4308 field = TYPE_FIELDS (type);
4310 if (TREE_CODE (type) == ARRAY_TYPE
4311 && TYPE_DOMAIN (type) != 0)
4312 min_index = TYPE_MIN_VALUE (TYPE_DOMAIN (type));
4314 /* As LINK goes through the elements of the constant,
4315 FIELD goes through the structure fields, if the constant is a structure.
4316 if the constant is a union, then we override this,
4317 by getting the field from the TREE_LIST element.
4318 But the constant could also be an array. Then FIELD is zero.
4320 There is always a maximum of one element in the chain LINK for unions
4321 (even if the initializer in a source program incorrectly contains
4323 for (link = CONSTRUCTOR_ELTS (exp);
4325 link = TREE_CHAIN (link),
4326 field = field ? TREE_CHAIN (field) : 0)
4328 tree val = TREE_VALUE (link);
4331 /* The element in a union constructor specifies the proper field
4333 if ((TREE_CODE (type) == RECORD_TYPE || TREE_CODE (type) == UNION_TYPE
4334 || TREE_CODE (type) == QUAL_UNION_TYPE)
4335 && TREE_PURPOSE (link) != 0)
4336 field = TREE_PURPOSE (link);
4338 else if (TREE_CODE (type) == ARRAY_TYPE)
4339 index = TREE_PURPOSE (link);
4341 /* Eliminate the marker that makes a cast not be an lvalue. */
4345 if (index && TREE_CODE (index) == RANGE_EXPR)
4347 unsigned HOST_WIDE_INT fieldsize
4348 = int_size_in_bytes (TREE_TYPE (type));
4349 HOST_WIDE_INT lo_index = tree_low_cst (TREE_OPERAND (index, 0), 0);
4350 HOST_WIDE_INT hi_index = tree_low_cst (TREE_OPERAND (index, 1), 0);
4351 HOST_WIDE_INT index;
4353 for (index = lo_index; index <= hi_index; index++)
4355 /* Output the element's initial value. */
4357 assemble_zeros (fieldsize);
4359 output_constant (val, fieldsize);
4361 /* Count its size. */
4362 total_bytes += fieldsize;
4365 else if (field == 0 || !DECL_BIT_FIELD (field))
4367 /* An element that is not a bit-field. */
4369 unsigned HOST_WIDE_INT fieldsize;
4370 /* Since this structure is static,
4371 we know the positions are constant. */
4372 HOST_WIDE_INT pos = field ? int_byte_position (field) : 0;
4375 pos = (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (val)), 1)
4376 * (tree_low_cst (index, 0) - tree_low_cst (min_index, 0)));
4378 /* Output any buffered-up bit-fields preceding this element. */
4379 if (byte_buffer_in_use)
4381 ASM_OUTPUT_BYTE (asm_out_file, byte);
4383 byte_buffer_in_use = 0;
4386 /* Advance to offset of this element.
4387 Note no alignment needed in an array, since that is guaranteed
4388 if each element has the proper size. */
4389 if ((field != 0 || index != 0) && pos != total_bytes)
4391 assemble_zeros (pos - total_bytes);
4395 else if (field != 0 && DECL_PACKED (field))
4396 /* Some assemblers automaticallly align a datum according to its
4397 size if no align directive is specified. The datum, however,
4398 may be declared with 'packed' attribute, so we have to disable
4400 ASM_OUTPUT_ALIGN (asm_out_file, 0);
4402 /* Determine size this element should occupy. */
4407 /* If this is an array with an unspecified upper bound,
4408 the initializer determines the size. */
4409 /* ??? This ought to only checked if DECL_SIZE_UNIT is NULL,
4410 but we cannot do this until the deprecated support for
4411 initializing zero-length array members is removed. */
4412 if (TREE_CODE (TREE_TYPE (field)) == ARRAY_TYPE
4413 && TYPE_DOMAIN (TREE_TYPE (field))
4414 && ! TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (field))))
4416 fieldsize = array_size_for_constructor (val);
4417 /* Given a non-empty initialization, this field had
4419 if (fieldsize != 0 && TREE_CHAIN (field) != NULL_TREE)
4422 else if (DECL_SIZE_UNIT (field))
4424 /* ??? This can't be right. If the decl size overflows
4425 a host integer we will silently emit no data. */
4426 if (host_integerp (DECL_SIZE_UNIT (field), 1))
4427 fieldsize = tree_low_cst (DECL_SIZE_UNIT (field), 1);
4431 fieldsize = int_size_in_bytes (TREE_TYPE (type));
4433 /* Output the element's initial value. */
4435 assemble_zeros (fieldsize);
4437 output_constant (val, fieldsize);
4439 /* Count its size. */
4440 total_bytes += fieldsize;
4442 else if (val != 0 && TREE_CODE (val) != INTEGER_CST)
4443 error ("invalid initial value for member `%s'",
4444 IDENTIFIER_POINTER (DECL_NAME (field)));
4447 /* Element that is a bit-field. */
4449 HOST_WIDE_INT next_offset = int_bit_position (field);
4450 HOST_WIDE_INT end_offset
4451 = (next_offset + tree_low_cst (DECL_SIZE (field), 1));
4454 val = integer_zero_node;
4456 /* If this field does not start in this (or, next) byte,
4458 if (next_offset / BITS_PER_UNIT != total_bytes)
4460 /* Output remnant of any bit field in previous bytes. */
4461 if (byte_buffer_in_use)
4463 ASM_OUTPUT_BYTE (asm_out_file, byte);
4465 byte_buffer_in_use = 0;
4468 /* If still not at proper byte, advance to there. */
4469 if (next_offset / BITS_PER_UNIT != total_bytes)
4471 assemble_zeros (next_offset / BITS_PER_UNIT - total_bytes);
4472 total_bytes = next_offset / BITS_PER_UNIT;
4476 if (! byte_buffer_in_use)
4479 /* We must split the element into pieces that fall within
4480 separate bytes, and combine each byte with previous or
4481 following bit-fields. */
4483 /* next_offset is the offset n fbits from the beginning of
4484 the structure to the next bit of this element to be processed.
4485 end_offset is the offset of the first bit past the end of
4487 while (next_offset < end_offset)
4491 HOST_WIDE_INT value;
4492 HOST_WIDE_INT next_byte = next_offset / BITS_PER_UNIT;
4493 HOST_WIDE_INT next_bit = next_offset % BITS_PER_UNIT;
4495 /* Advance from byte to byte
4496 within this element when necessary. */
4497 while (next_byte != total_bytes)
4499 ASM_OUTPUT_BYTE (asm_out_file, byte);
4504 /* Number of bits we can process at once
4505 (all part of the same byte). */
4506 this_time = MIN (end_offset - next_offset,
4507 BITS_PER_UNIT - next_bit);
4508 if (BYTES_BIG_ENDIAN)
4510 /* On big-endian machine, take the most significant bits
4511 first (of the bits that are significant)
4512 and put them into bytes from the most significant end. */
4513 shift = end_offset - next_offset - this_time;
4515 /* Don't try to take a bunch of bits that cross
4516 the word boundary in the INTEGER_CST. We can
4517 only select bits from the LOW or HIGH part
4519 if (shift < HOST_BITS_PER_WIDE_INT
4520 && shift + this_time > HOST_BITS_PER_WIDE_INT)
4522 this_time = shift + this_time - HOST_BITS_PER_WIDE_INT;
4523 shift = HOST_BITS_PER_WIDE_INT;
4526 /* Now get the bits from the appropriate constant word. */
4527 if (shift < HOST_BITS_PER_WIDE_INT)
4528 value = TREE_INT_CST_LOW (val);
4529 else if (shift < 2 * HOST_BITS_PER_WIDE_INT)
4531 value = TREE_INT_CST_HIGH (val);
4532 shift -= HOST_BITS_PER_WIDE_INT;
4537 /* Get the result. This works only when:
4538 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4539 byte |= (((value >> shift)
4540 & (((HOST_WIDE_INT) 2 << (this_time - 1)) - 1))
4541 << (BITS_PER_UNIT - this_time - next_bit));
4545 /* On little-endian machines,
4546 take first the least significant bits of the value
4547 and pack them starting at the least significant
4548 bits of the bytes. */
4549 shift = next_offset - int_bit_position (field);
4551 /* Don't try to take a bunch of bits that cross
4552 the word boundary in the INTEGER_CST. We can
4553 only select bits from the LOW or HIGH part
4555 if (shift < HOST_BITS_PER_WIDE_INT
4556 && shift + this_time > HOST_BITS_PER_WIDE_INT)
4557 this_time = (HOST_BITS_PER_WIDE_INT - shift);
4559 /* Now get the bits from the appropriate constant word. */
4560 if (shift < HOST_BITS_PER_WIDE_INT)
4561 value = TREE_INT_CST_LOW (val);
4562 else if (shift < 2 * HOST_BITS_PER_WIDE_INT)
4564 value = TREE_INT_CST_HIGH (val);
4565 shift -= HOST_BITS_PER_WIDE_INT;
4570 /* Get the result. This works only when:
4571 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4572 byte |= (((value >> shift)
4573 & (((HOST_WIDE_INT) 2 << (this_time - 1)) - 1))
4577 next_offset += this_time;
4578 byte_buffer_in_use = 1;
4583 if (byte_buffer_in_use)
4585 ASM_OUTPUT_BYTE (asm_out_file, byte);
4589 if (total_bytes < size)
4590 assemble_zeros (size - total_bytes);
4593 #ifdef HANDLE_PRAGMA_WEAK
4594 /* Add function NAME to the weak symbols list. VALUE is a weak alias
4595 associatd with NAME. */
4598 add_weak (name, value)
4602 struct weak_syms *weak;
4604 weak = (struct weak_syms *) permalloc (sizeof (struct weak_syms));
4609 weak->next = weak_decls;
4611 weak->value = value;
4616 #endif /* HANDLE_PRAGMA_WEAK */
4618 /* Declare DECL to be a weak symbol. */
4624 if (! TREE_PUBLIC (decl))
4625 error_with_decl (decl, "weak declaration of `%s' must be public");
4626 else if (TREE_ASM_WRITTEN (decl))
4627 error_with_decl (decl, "weak declaration of `%s' must precede definition");
4628 else if (SUPPORTS_WEAK)
4629 DECL_WEAK (decl) = 1;
4630 #ifdef HANDLE_PRAGMA_WEAK
4631 add_weak (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl)), NULL);
4635 /* Emit any pending weak declarations. */
4637 #ifdef HANDLE_PRAGMA_WEAK
4638 struct weak_syms * weak_decls;
4644 #ifdef HANDLE_PRAGMA_WEAK
4645 if (HANDLE_PRAGMA_WEAK)
4647 struct weak_syms *t;
4648 for (t = weak_decls; t; t = t->next)
4651 ASM_OUTPUT_WEAK_ALIAS (asm_out_file, t->name, t->value);
4657 /* Remove NAME from the pending list of weak symbols. This prevents
4658 the compiler from emitting multiple .weak directives which confuses
4660 #ifdef ASM_WEAKEN_LABEL
4662 remove_from_pending_weak_list (name)
4663 const char *name ATTRIBUTE_UNUSED;
4665 #ifdef HANDLE_PRAGMA_WEAK
4666 if (HANDLE_PRAGMA_WEAK)
4668 struct weak_syms *t;
4669 for (t = weak_decls; t; t = t->next)
4671 if (t->name && strcmp (name, t->name) == 0)
4680 assemble_alias (decl, target)
4681 tree decl, target ATTRIBUTE_UNUSED;
4685 /* We must force creation of DECL_RTL for debug info generation, even though
4686 we don't use it here. */
4687 make_decl_rtl (decl, NULL);
4689 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
4691 #ifdef ASM_OUTPUT_DEF
4692 /* Make name accessible from other files, if appropriate. */
4694 if (TREE_PUBLIC (decl))
4696 #ifdef ASM_WEAKEN_LABEL
4697 if (DECL_WEAK (decl))
4699 ASM_WEAKEN_LABEL (asm_out_file, name);
4700 /* Remove this function from the pending weak list so that
4701 we do not emit multiple .weak directives for it. */
4702 remove_from_pending_weak_list
4703 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl)));
4707 ASM_GLOBALIZE_LABEL (asm_out_file, name);
4710 #ifdef ASM_OUTPUT_DEF_FROM_DECLS
4711 ASM_OUTPUT_DEF_FROM_DECLS (asm_out_file, decl, target);
4713 ASM_OUTPUT_DEF (asm_out_file, name, IDENTIFIER_POINTER (target));
4715 TREE_ASM_WRITTEN (decl) = 1;
4717 #ifdef ASM_OUTPUT_WEAK_ALIAS
4718 if (! DECL_WEAK (decl))
4719 warning ("only weak aliases are supported in this configuration");
4721 ASM_OUTPUT_WEAK_ALIAS (asm_out_file, name, IDENTIFIER_POINTER (target));
4722 TREE_ASM_WRITTEN (decl) = 1;
4724 warning ("alias definitions not supported in this configuration; ignored");
4729 /* Returns 1 if the target configuration supports defining public symbols
4730 so that one of them will be chosen at link time instead of generating a
4731 multiply-defined symbol error, whether through the use of weak symbols or
4732 a target-specific mechanism for having duplicates discarded. */
4735 supports_one_only ()
4737 if (SUPPORTS_ONE_ONLY)
4739 return SUPPORTS_WEAK;
4742 /* Set up DECL as a public symbol that can be defined in multiple
4743 translation units without generating a linker error. */
4746 make_decl_one_only (decl)
4749 if (TREE_CODE (decl) != VAR_DECL && TREE_CODE (decl) != FUNCTION_DECL)
4752 TREE_PUBLIC (decl) = 1;
4754 if (TREE_CODE (decl) == VAR_DECL
4755 && (DECL_INITIAL (decl) == 0 || DECL_INITIAL (decl) == error_mark_node))
4756 DECL_COMMON (decl) = 1;
4757 else if (SUPPORTS_ONE_ONLY)
4759 #ifdef MAKE_DECL_ONE_ONLY
4760 MAKE_DECL_ONE_ONLY (decl);
4762 DECL_ONE_ONLY (decl) = 1;
4764 else if (SUPPORTS_WEAK)
4765 DECL_WEAK (decl) = 1;
4773 const_str_htab = htab_create (128, const_str_htab_hash, const_str_htab_eq,
4774 const_str_htab_del);
4775 ggc_add_root (const_hash_table, MAX_HASH_TABLE, sizeof const_hash_table[0],
4776 mark_const_hash_entry);
4777 ggc_add_root (&const_str_htab, 1, sizeof const_str_htab,
4778 mark_const_str_htab);
4781 /* Select a set of attributes for section NAME based on the properties
4782 of DECL and whether or not RELOC indicates that DECL's initializer
4783 might contain runtime relocations.
4785 We make the section read-only and executable for a function decl,
4786 read-only for a const data decl, and writable for a non-const data decl.
4788 If the section has already been defined, to not allow it to have
4789 different attributes, as (1) this is ambiguous since we're not seeing
4790 all the declarations up front and (2) some assemblers (e.g. SVR4)
4791 do not recoginize section redefinitions. */
4794 default_section_type_flags (decl, name, reloc)
4801 unsigned int **slot;
4803 /* The names we put in the hashtable will always be the unique
4804 versions gived to us by the stringtable, so we can just use
4805 their addresses as the keys. */
4807 htab = htab_create (31, htab_hash_pointer, htab_eq_pointer, NULL);
4809 if (decl && TREE_CODE (decl) == FUNCTION_DECL)
4810 flags = SECTION_CODE;
4811 else if (decl && DECL_READONLY_SECTION (decl, reloc))
4814 flags = SECTION_WRITE;
4816 if (decl && DECL_ONE_ONLY (decl))
4817 flags |= SECTION_LINKONCE;
4819 if (strcmp (name, ".bss") == 0
4820 || strncmp (name, ".bss.", 5) == 0
4821 || strncmp (name, ".gnu.linkonce.b.", 16) == 0
4822 || strcmp (name, ".sbss") == 0
4823 || strncmp (name, ".sbss.", 6) == 0
4824 || strncmp (name, ".gnu.linkonce.sb.", 17) == 0)
4825 flags |= SECTION_BSS;
4827 /* See if we already have an entry for this section. */
4828 slot = (unsigned int **) htab_find_slot (htab, name, INSERT);
4831 *slot = (unsigned int *) xmalloc (sizeof (unsigned int));
4836 if (decl && **slot != flags)
4837 error_with_decl (decl, "%s causes a section type conflict");
4843 /* Output assembly to switch to section NAME with attribute FLAGS.
4844 Four variants for common object file formats. */
4847 default_no_named_section (name, flags, align)
4848 const char *name ATTRIBUTE_UNUSED;
4849 unsigned int flags ATTRIBUTE_UNUSED;
4850 unsigned int align ATTRIBUTE_UNUSED;
4852 /* Some object formats don't support named sections at all. The
4853 front-end should already have flagged this as an error. */
4858 default_elf_asm_named_section (name, flags, align)
4861 unsigned int align ATTRIBUTE_UNUSED;
4863 char flagchars[8], *f = flagchars;
4866 if (!(flags & SECTION_DEBUG))
4868 if (flags & SECTION_WRITE)
4870 if (flags & SECTION_CODE)
4872 if (flags & SECTION_SMALL)
4876 if (flags & SECTION_BSS)
4881 fprintf (asm_out_file, "\t.section\t%s,\"%s\",@%s\n",
4882 name, flagchars, type);
4886 default_coff_asm_named_section (name, flags, align)
4889 unsigned int align ATTRIBUTE_UNUSED;
4891 char flagchars[8], *f = flagchars;
4893 if (flags & SECTION_WRITE)
4895 if (flags & SECTION_CODE)
4899 fprintf (asm_out_file, "\t.section\t%s,\"%s\"\n", name, flagchars);
4903 default_pe_asm_named_section (name, flags, align)
4906 unsigned int align ATTRIBUTE_UNUSED;
4908 default_coff_asm_named_section (name, flags, align);
4910 if (flags & SECTION_LINKONCE)
4912 /* Functions may have been compiled at various levels of
4913 optimization so we can't use `same_size' here.
4914 Instead, have the linker pick one. */
4915 fprintf (asm_out_file, "\t.linkonce %s\n",
4916 (flags & SECTION_CODE ? "discard" : "same_size"));