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 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
55 #ifndef TRAMPOLINE_ALIGNMENT
56 #define TRAMPOLINE_ALIGNMENT FUNCTION_BOUNDARY
60 #define ASM_STABS_OP ".stabs"
63 /* Define the prefix to use when check_memory_usage_flag is enable. */
64 #ifdef NO_DOLLAR_IN_LABEL
65 #ifdef NO_DOT_IN_LABEL
66 #define CHKR_PREFIX "chkr_prefix_"
67 #else /* !NO_DOT_IN_LABEL */
68 #define CHKR_PREFIX "chkr."
70 #else /* !NO_DOLLAR_IN_LABEL */
71 #define CHKR_PREFIX "chkr$"
73 #define CHKR_PREFIX_SIZE (sizeof (CHKR_PREFIX) - 1)
75 /* File in which assembler code is being written. */
77 extern FILE *asm_out_file
;
79 /* The (assembler) name of the first globally-visible object output. */
80 const char *first_global_object_name
;
81 const char *weak_global_object_name
;
83 extern struct obstack
*current_obstack
;
84 extern struct obstack
*saveable_obstack
;
85 extern struct obstack
*rtl_obstack
;
86 extern struct obstack permanent_obstack
;
87 #define obstack_chunk_alloc xmalloc
90 struct constant_descriptor
;
94 #define MAX_RTX_HASH_TABLE 61
98 /* Hash facility for making memory-constants
99 from constant rtl-expressions. It is used on RISC machines
100 where immediate integer arguments and constant addresses are restricted
101 so that such constants must be stored in memory.
103 This pool of constants is reinitialized for each function
104 so each function gets its own constants-pool that comes right before
106 struct constant_descriptor
**x_const_rtx_hash_table
;
107 struct pool_sym
**x_const_rtx_sym_hash_table
;
109 /* Pointers to first and last constant in pool. */
110 struct pool_constant
*x_first_pool
, *x_last_pool
;
112 /* Current offset in constant pool (does not include any machine-specific
116 /* Chain of all CONST_DOUBLE rtx's constructed for the current function.
117 They are chained through the CONST_DOUBLE_CHAIN.
118 A CONST_DOUBLE rtx has CONST_DOUBLE_MEM != cc0_rtx iff it is on this chain.
119 In that case, CONST_DOUBLE_MEM is either a MEM,
120 or const0_rtx if no MEM has been made for this CONST_DOUBLE yet. */
121 rtx x_const_double_chain
;
124 #define const_rtx_hash_table (cfun->varasm->x_const_rtx_hash_table)
125 #define const_rtx_sym_hash_table (cfun->varasm->x_const_rtx_sym_hash_table)
126 #define first_pool (cfun->varasm->x_first_pool)
127 #define last_pool (cfun->varasm->x_last_pool)
128 #define pool_offset (cfun->varasm->x_pool_offset)
129 #define const_double_chain (cfun->varasm->x_const_double_chain)
131 /* Number for making the label on the next
132 constant that is stored in memory. */
136 /* Number for making the label on the next
137 static variable internal to a function. */
141 /* Carry information from ASM_DECLARE_OBJECT_NAME
142 to ASM_FINISH_DECLARE_OBJECT. */
144 int size_directive_output
;
146 /* The last decl for which assemble_variable was called,
147 if it did ASM_DECLARE_OBJECT_NAME.
148 If the last call to assemble_variable didn't do that,
151 tree last_assemble_variable_decl
;
153 static const char *strip_reg_name
PARAMS ((const char *));
154 static int contains_pointers_p
PARAMS ((tree
));
155 static void decode_addr_const
PARAMS ((tree
, struct addr_const
*));
156 static int const_hash
PARAMS ((tree
));
157 static int compare_constant
PARAMS ((tree
,
158 struct constant_descriptor
*));
159 static char *compare_constant_1
PARAMS ((tree
, char *));
160 static struct constant_descriptor
*record_constant
PARAMS ((tree
));
161 static void record_constant_1
PARAMS ((tree
));
162 static tree copy_constant
PARAMS ((tree
));
163 static void output_constant_def_contents
PARAMS ((tree
, int, int));
164 static void decode_rtx_const
PARAMS ((enum machine_mode
, rtx
,
165 struct rtx_const
*));
166 static int const_hash_rtx
PARAMS ((enum machine_mode
, rtx
));
167 static int compare_constant_rtx
PARAMS ((enum machine_mode
, rtx
,
168 struct constant_descriptor
*));
169 static struct constant_descriptor
*record_constant_rtx
PARAMS ((enum machine_mode
,
171 static struct pool_constant
*find_pool_constant
PARAMS ((struct function
*, rtx
));
172 static void mark_constant_pool
PARAMS ((void));
173 static void mark_constants
PARAMS ((rtx
));
174 static int output_addressed_constants
PARAMS ((tree
));
175 static void output_after_function_constants
PARAMS ((void));
176 static void output_constructor
PARAMS ((tree
, int));
177 #ifdef ASM_WEAKEN_LABEL
178 static void remove_from_pending_weak_list
PARAMS ((char *));
180 #ifdef ASM_OUTPUT_BSS
181 static void asm_output_bss
PARAMS ((FILE *, tree
, const char *, int, int));
183 #ifdef BSS_SECTION_ASM_OP
184 #ifdef ASM_OUTPUT_ALIGNED_BSS
185 static void asm_output_aligned_bss
PARAMS ((FILE *, tree
, const char *,
188 #endif /* BSS_SECTION_ASM_OP */
189 static void mark_pool_constant
PARAMS ((struct pool_constant
*));
190 static void mark_pool_sym_hash_table
PARAMS ((struct pool_sym
**));
191 static void mark_const_hash_entry
PARAMS ((void *));
192 static void asm_emit_uninitialised
PARAMS ((tree
, const char*, int, int));
194 static enum in_section
{ no_section
, in_text
, in_data
, in_named
195 #ifdef BSS_SECTION_ASM_OP
198 #ifdef EH_FRAME_SECTION_ASM_OP
201 #ifdef EXTRA_SECTIONS
204 } in_section
= no_section
;
206 /* Return a non-zero value if DECL has a section attribute. */
207 #ifndef IN_NAMED_SECTION
208 #define IN_NAMED_SECTION(DECL) \
209 ((TREE_CODE (DECL) == FUNCTION_DECL || TREE_CODE (DECL) == VAR_DECL) \
210 && DECL_SECTION_NAME (DECL) != NULL_TREE)
213 /* Text of section name when in_section == in_named. */
214 static char *in_named_name
;
216 /* Define functions like text_section for any extra sections. */
217 #ifdef EXTRA_SECTION_FUNCTIONS
218 EXTRA_SECTION_FUNCTIONS
221 /* Tell assembler to switch to text section. */
226 if (in_section
!= in_text
)
228 fprintf (asm_out_file
, "%s\n", TEXT_SECTION_ASM_OP
);
229 in_section
= in_text
;
233 /* Tell assembler to switch to data section. */
238 if (in_section
!= in_data
)
240 if (flag_shared_data
)
242 #ifdef SHARED_SECTION_ASM_OP
243 fprintf (asm_out_file
, "%s\n", SHARED_SECTION_ASM_OP
);
245 fprintf (asm_out_file
, "%s\n", DATA_SECTION_ASM_OP
);
249 fprintf (asm_out_file
, "%s\n", DATA_SECTION_ASM_OP
);
251 in_section
= in_data
;
254 /* Tell assembler to ALWAYS switch to data section, in case
255 it's not sure where it it. */
258 force_data_section ()
260 in_section
= no_section
;
264 /* Tell assembler to switch to read-only data section. This is normally
268 readonly_data_section ()
270 #ifdef READONLY_DATA_SECTION
271 READONLY_DATA_SECTION (); /* Note this can call data_section. */
277 /* Determine if we're in the text section. */
282 return in_section
== in_text
;
285 /* Determine if we're in the data section. */
290 return in_section
== in_data
;
293 /* Tell assembler to change to section NAME for DECL.
294 If DECL is NULL, just switch to section NAME.
295 If NAME is NULL, get the name from DECL.
296 If RELOC is 1, the initializer for DECL contains relocs. */
299 named_section (decl
, name
, reloc
)
302 int reloc ATTRIBUTE_UNUSED
;
304 if (decl
!= NULL_TREE
&& !DECL_P (decl
))
307 name
= TREE_STRING_POINTER (DECL_SECTION_NAME (decl
));
309 if (in_section
!= in_named
|| strcmp (name
, in_named_name
))
311 #ifdef ASM_OUTPUT_SECTION_NAME
312 ASM_OUTPUT_SECTION_NAME (asm_out_file
, decl
, name
, reloc
);
314 /* Section attributes are not supported if this macro isn't provided -
315 some host formats don't support them at all. The front-end should
316 already have flagged this as an error. */
320 in_named_name
= ggc_alloc_string (name
, -1);
321 in_section
= in_named
;
325 #ifdef ASM_OUTPUT_SECTION_NAME
326 #ifndef UNIQUE_SECTION
327 #define UNIQUE_SECTION(DECL,RELOC) \
333 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (DECL)); \
334 /* Strip off any encoding in name. */ \
335 STRIP_NAME_ENCODING (name, name); \
337 len = strlen (name) + 1; \
338 string = alloca (len + 1); \
339 sprintf (string, ".%s", name); \
341 DECL_SECTION_NAME (DECL) = build_string (len, string); \
344 #ifndef UNIQUE_SECTION_P
345 #define UNIQUE_SECTION_P(DECL) 0
349 #ifdef BSS_SECTION_ASM_OP
351 /* Tell the assembler to switch to the bss section. */
356 if (in_section
!= in_bss
)
358 #ifdef SHARED_BSS_SECTION_ASM_OP
359 if (flag_shared_data
)
360 fprintf (asm_out_file
, "%s\n", SHARED_BSS_SECTION_ASM_OP
);
363 fprintf (asm_out_file
, "%s\n", BSS_SECTION_ASM_OP
);
369 #ifdef ASM_OUTPUT_BSS
371 /* Utility function for ASM_OUTPUT_BSS for targets to use if
372 they don't support alignments in .bss.
373 ??? It is believed that this function will work in most cases so such
374 support is localized here. */
377 asm_output_bss (file
, decl
, name
, size
, rounded
)
379 tree decl ATTRIBUTE_UNUSED
;
381 int size ATTRIBUTE_UNUSED
, rounded
;
383 ASM_GLOBALIZE_LABEL (file
, name
);
385 #ifdef ASM_DECLARE_OBJECT_NAME
386 last_assemble_variable_decl
= decl
;
387 ASM_DECLARE_OBJECT_NAME (file
, name
, decl
);
389 /* Standard thing is just output label for the object. */
390 ASM_OUTPUT_LABEL (file
, name
);
391 #endif /* ASM_DECLARE_OBJECT_NAME */
392 ASM_OUTPUT_SKIP (file
, rounded
);
397 #ifdef ASM_OUTPUT_ALIGNED_BSS
399 /* Utility function for targets to use in implementing
400 ASM_OUTPUT_ALIGNED_BSS.
401 ??? It is believed that this function will work in most cases so such
402 support is localized here. */
405 asm_output_aligned_bss (file
, decl
, name
, size
, align
)
411 ASM_GLOBALIZE_LABEL (file
, name
);
413 ASM_OUTPUT_ALIGN (file
, floor_log2 (align
/ BITS_PER_UNIT
));
414 #ifdef ASM_DECLARE_OBJECT_NAME
415 last_assemble_variable_decl
= decl
;
416 ASM_DECLARE_OBJECT_NAME (file
, name
, decl
);
418 /* Standard thing is just output label for the object. */
419 ASM_OUTPUT_LABEL (file
, name
);
420 #endif /* ASM_DECLARE_OBJECT_NAME */
421 ASM_OUTPUT_SKIP (file
, size
? size
: 1);
426 #endif /* BSS_SECTION_ASM_OP */
428 #ifdef EH_FRAME_SECTION_ASM_OP
432 if (in_section
!= in_eh_frame
)
434 fprintf (asm_out_file
, "%s\n", EH_FRAME_SECTION_ASM_OP
);
435 in_section
= in_eh_frame
;
440 /* Switch to the section for function DECL.
442 If DECL is NULL_TREE, switch to the text section.
443 ??? It's not clear that we will ever be passed NULL_TREE, but it's
444 safer to handle it. */
447 function_section (decl
)
450 if (decl
!= NULL_TREE
451 && DECL_SECTION_NAME (decl
) != NULL_TREE
)
452 named_section (decl
, (char *) 0, 0);
457 /* Switch to section for variable DECL.
459 RELOC is the `reloc' argument to SELECT_SECTION. */
462 variable_section (decl
, reloc
)
466 if (IN_NAMED_SECTION (decl
))
467 named_section (decl
, NULL
, reloc
);
470 /* C++ can have const variables that get initialized from constructors,
471 and thus can not be in a readonly section. We prevent this by
472 verifying that the initial value is constant for objects put in a
475 error_mark_node is used by the C front end to indicate that the
476 initializer has not been seen yet. In this case, we assume that
477 the initializer must be constant.
479 C++ uses error_mark_node for variables that have complicated
480 initializers, but these variables go in BSS so we won't be called
483 #ifdef SELECT_SECTION
484 SELECT_SECTION (decl
, reloc
);
486 if (DECL_READONLY_SECTION (decl
, reloc
))
487 readonly_data_section ();
494 /* Tell assembler to switch to the section for the exception handling
500 #if defined (EXCEPTION_SECTION)
501 EXCEPTION_SECTION ();
503 #ifdef ASM_OUTPUT_SECTION_NAME
504 named_section (NULL_TREE
, ".gcc_except_table", 0);
509 readonly_data_section ();
514 /* Create the rtl to represent a function, for a function definition.
515 DECL is a FUNCTION_DECL node which describes which function.
516 The rtl is stored into DECL. */
519 make_function_rtl (decl
)
522 char *name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
523 char *new_name
= name
;
525 /* Rename a nested function to avoid conflicts, unless it's a member of
526 a local class, in which case the class name is already unique. */
527 if (decl_function_context (decl
) != 0
528 && ! TYPE_P (DECL_CONTEXT (decl
))
529 && DECL_INITIAL (decl
) != 0
530 && DECL_RTL (decl
) == 0)
534 name
= IDENTIFIER_POINTER (DECL_NAME (decl
));
535 ASM_FORMAT_PRIVATE_NAME (label
, name
, var_labelno
);
536 name
= ggc_alloc_string (label
, -1);
541 /* When -fprefix-function-name is used, every function name is
542 prefixed. Even static functions are prefixed because they
543 could be declared latter. Note that a nested function name
545 if (flag_prefix_function_name
)
547 size_t name_len
= strlen (name
);
549 new_name
= ggc_alloc_string (NULL
, name_len
+ CHKR_PREFIX_SIZE
);
550 memcpy (new_name
, CHKR_PREFIX
, CHKR_PREFIX_SIZE
);
551 memcpy (new_name
+ CHKR_PREFIX_SIZE
, name
, name_len
+ 1);
556 if (DECL_RTL (decl
) == 0)
558 DECL_ASSEMBLER_NAME (decl
) = get_identifier (name
);
560 = gen_rtx_MEM (DECL_MODE (decl
),
561 gen_rtx_SYMBOL_REF (Pmode
, name
));
563 /* Optionally set flags or add text to the name to record information
564 such as that it is a function name. If the name is changed, the macro
565 ASM_OUTPUT_LABELREF will have to know how to strip this information. */
566 #ifdef ENCODE_SECTION_INFO
567 ENCODE_SECTION_INFO (decl
);
572 /* ??? Another way to do this would be to do what halfpic.c does
573 and maintain a hashed table of such critters. */
574 /* ??? Another way to do this would be to pass a flag bit to
575 ENCODE_SECTION_INFO saying whether this is a new decl or not. */
576 /* Let the target reassign the RTL if it wants.
577 This is necessary, for example, when one machine specific
578 decl attribute overrides another. */
579 #ifdef REDO_SECTION_INFO_P
580 if (REDO_SECTION_INFO_P (decl
))
581 ENCODE_SECTION_INFO (decl
);
586 /* Given NAME, a putative register name, discard any customary prefixes. */
589 strip_reg_name (name
)
592 #ifdef REGISTER_PREFIX
593 if (!strncmp (name
, REGISTER_PREFIX
, strlen (REGISTER_PREFIX
)))
594 name
+= strlen (REGISTER_PREFIX
);
596 if (name
[0] == '%' || name
[0] == '#')
601 /* Decode an `asm' spec for a declaration as a register name.
602 Return the register number, or -1 if nothing specified,
603 or -2 if the ASMSPEC is not `cc' or `memory' and is not recognized,
604 or -3 if ASMSPEC is `cc' and is not recognized,
605 or -4 if ASMSPEC is `memory' and is not recognized.
606 Accept an exact spelling or a decimal number.
607 Prefixes such as % are optional. */
610 decode_reg_name (asmspec
)
617 /* Get rid of confusing prefixes. */
618 asmspec
= strip_reg_name (asmspec
);
620 /* Allow a decimal number as a "register name". */
621 for (i
= strlen (asmspec
) - 1; i
>= 0; i
--)
622 if (! (asmspec
[i
] >= '0' && asmspec
[i
] <= '9'))
624 if (asmspec
[0] != 0 && i
< 0)
627 if (i
< FIRST_PSEUDO_REGISTER
&& i
>= 0)
633 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
635 && ! strcmp (asmspec
, strip_reg_name (reg_names
[i
])))
638 #ifdef ADDITIONAL_REGISTER_NAMES
640 static struct { const char *name
; int number
; } table
[]
641 = ADDITIONAL_REGISTER_NAMES
;
643 for (i
= 0; i
< (int)(sizeof (table
) / sizeof (table
[0])); i
++)
644 if (! strcmp (asmspec
, table
[i
].name
))
645 return table
[i
].number
;
647 #endif /* ADDITIONAL_REGISTER_NAMES */
649 if (!strcmp (asmspec
, "memory"))
652 if (!strcmp (asmspec
, "cc"))
661 /* Create the DECL_RTL for a declaration for a static or external variable
662 or static or external function.
663 ASMSPEC, if not 0, is the string which the user specified
664 as the assembler symbol name.
665 TOP_LEVEL is nonzero if this is a file-scope variable.
667 This is never called for PARM_DECL nodes. */
670 make_decl_rtl (decl
, asmspec
, top_level
)
675 register char *name
= 0;
678 reg_number
= decode_reg_name (asmspec
);
680 if (DECL_ASSEMBLER_NAME (decl
) != NULL_TREE
)
681 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
683 if (reg_number
== -2)
685 /* ASMSPEC is given, and not the name of a register. */
686 size_t len
= strlen (asmspec
);
688 name
= ggc_alloc_string (NULL
, len
+ 1);
690 memcpy (&name
[1], asmspec
, len
+ 1);
693 /* For a duplicate declaration, we can be called twice on the
694 same DECL node. Don't discard the RTL already made. */
695 if (DECL_RTL (decl
) == 0)
697 /* First detect errors in declaring global registers. */
698 if (TREE_CODE (decl
) != FUNCTION_DECL
699 && DECL_REGISTER (decl
) && reg_number
== -1)
700 error_with_decl (decl
,
701 "register name not specified for `%s'");
702 else if (TREE_CODE (decl
) != FUNCTION_DECL
703 && DECL_REGISTER (decl
) && reg_number
< 0)
704 error_with_decl (decl
,
705 "invalid register name for `%s'");
706 else if ((reg_number
>= 0 || reg_number
== -3)
707 && (TREE_CODE (decl
) == FUNCTION_DECL
708 && ! DECL_REGISTER (decl
)))
709 error_with_decl (decl
,
710 "register name given for non-register variable `%s'");
711 else if (TREE_CODE (decl
) != FUNCTION_DECL
712 && DECL_REGISTER (decl
)
713 && TYPE_MODE (TREE_TYPE (decl
)) == BLKmode
)
714 error_with_decl (decl
,
715 "data type of `%s' isn't suitable for a register");
716 else if (TREE_CODE (decl
) != FUNCTION_DECL
&& DECL_REGISTER (decl
)
717 && ! HARD_REGNO_MODE_OK (reg_number
,
718 TYPE_MODE (TREE_TYPE (decl
))))
719 error_with_decl (decl
,
720 "register number for `%s' isn't suitable for data type");
721 /* Now handle properly declared static register variables. */
722 else if (TREE_CODE (decl
) != FUNCTION_DECL
&& DECL_REGISTER (decl
))
726 if (DECL_INITIAL (decl
) != 0 && top_level
)
728 DECL_INITIAL (decl
) = 0;
729 error ("global register variable has initial value");
731 if (TREE_THIS_VOLATILE (decl
))
732 warning ("volatile register variables don't work as you might wish");
734 /* If the user specified one of the eliminables registers here,
735 e.g., FRAME_POINTER_REGNUM, we don't want to get this variable
736 confused with that register and be eliminated. Although this
737 usage is somewhat suspect, we nevertheless use the following
738 kludge to avoid setting DECL_RTL to frame_pointer_rtx. */
741 = gen_rtx_REG (DECL_MODE (decl
), FIRST_PSEUDO_REGISTER
);
742 REGNO (DECL_RTL (decl
)) = reg_number
;
743 REG_USERVAR_P (DECL_RTL (decl
)) = 1;
747 /* Make this register global, so not usable for anything
749 #ifdef ASM_DECLARE_REGISTER_GLOBAL
750 ASM_DECLARE_REGISTER_GLOBAL (asm_out_file
, decl
, reg_number
, name
);
752 nregs
= HARD_REGNO_NREGS (reg_number
, DECL_MODE (decl
));
754 globalize_reg (reg_number
+ --nregs
);
757 /* Specifying a section attribute on a variable forces it into a
758 non-.bss section, and thus it cannot be common. */
759 else if (TREE_CODE (decl
) == VAR_DECL
760 && DECL_SECTION_NAME (decl
) != NULL_TREE
761 && DECL_INITIAL (decl
) == NULL_TREE
762 && DECL_COMMON (decl
))
763 DECL_COMMON (decl
) = 0;
765 /* Now handle ordinary static variables and functions (in memory).
766 Also handle vars declared register invalidly. */
767 if (DECL_RTL (decl
) == 0)
769 /* Can't use just the variable's own name for a variable
770 whose scope is less than the whole file, unless it's a member
771 of a local class (which will already be unambiguous).
772 Concatenate a distinguishing number. */
773 if (!top_level
&& !TREE_PUBLIC (decl
)
774 && ! (DECL_CONTEXT (decl
) && TYPE_P (DECL_CONTEXT (decl
)))
779 ASM_FORMAT_PRIVATE_NAME (label
, name
, var_labelno
);
780 name
= ggc_alloc_string (label
, -1);
787 /* When -fprefix-function-name is used, the functions
788 names are prefixed. Only nested function names are not
790 if (flag_prefix_function_name
&& TREE_CODE (decl
) == FUNCTION_DECL
)
792 size_t name_len
= strlen (name
);
795 new_name
= ggc_alloc_string (NULL
, name_len
+ CHKR_PREFIX_SIZE
);
796 memcpy (new_name
, CHKR_PREFIX
, CHKR_PREFIX_SIZE
);
797 memcpy (new_name
+ CHKR_PREFIX_SIZE
, name
, name_len
+ 1);
801 DECL_ASSEMBLER_NAME (decl
)
802 = get_identifier (name
[0] == '*' ? name
+ 1 : name
);
803 DECL_RTL (decl
) = gen_rtx_MEM (DECL_MODE (decl
),
804 gen_rtx_SYMBOL_REF (Pmode
, name
));
805 MEM_ALIAS_SET (DECL_RTL (decl
)) = get_alias_set (decl
);
807 /* If this variable is to be treated as volatile, show its
808 tree node has side effects. If it has side effects, either
809 because of this test or from TREE_THIS_VOLATILE also
810 being set, show the MEM is volatile. */
811 if (flag_volatile_global
&& TREE_CODE (decl
) == VAR_DECL
812 && TREE_PUBLIC (decl
))
813 TREE_SIDE_EFFECTS (decl
) = 1;
814 else if (flag_volatile_static
&& TREE_CODE (decl
) == VAR_DECL
815 && (TREE_PUBLIC (decl
) || TREE_STATIC (decl
)))
816 TREE_SIDE_EFFECTS (decl
) = 1;
818 if (TREE_SIDE_EFFECTS (decl
))
819 MEM_VOLATILE_P (DECL_RTL (decl
)) = 1;
821 if (TREE_READONLY (decl
))
822 RTX_UNCHANGING_P (DECL_RTL (decl
)) = 1;
823 MEM_SET_IN_STRUCT_P (DECL_RTL (decl
),
824 AGGREGATE_TYPE_P (TREE_TYPE (decl
)));
826 /* Optionally set flags or add text to the name to record information
827 such as that it is a function name.
828 If the name is changed, the macro ASM_OUTPUT_LABELREF
829 will have to know how to strip this information. */
830 #ifdef ENCODE_SECTION_INFO
831 ENCODE_SECTION_INFO (decl
);
837 /* If the old RTL had the wrong mode, fix the mode. */
838 if (GET_MODE (DECL_RTL (decl
)) != DECL_MODE (decl
))
840 rtx rtl
= DECL_RTL (decl
);
841 PUT_MODE (rtl
, DECL_MODE (decl
));
844 /* ??? Another way to do this would be to do what halfpic.c does
845 and maintain a hashed table of such critters. */
846 /* ??? Another way to do this would be to pass a flag bit to
847 ENCODE_SECTION_INFO saying whether this is a new decl or not. */
848 /* Let the target reassign the RTL if it wants.
849 This is necessary, for example, when one machine specific
850 decl attribute overrides another. */
851 #ifdef REDO_SECTION_INFO_P
852 if (REDO_SECTION_INFO_P (decl
))
853 ENCODE_SECTION_INFO (decl
);
858 /* Make the rtl for variable VAR be volatile.
859 Use this only for static variables. */
862 make_var_volatile (var
)
865 if (GET_CODE (DECL_RTL (var
)) != MEM
)
868 MEM_VOLATILE_P (DECL_RTL (var
)) = 1;
871 /* Output alignment directive to align for constant expression EXP. */
874 assemble_constant_align (exp
)
879 /* Align the location counter as required by EXP's data type. */
880 align
= TYPE_ALIGN (TREE_TYPE (exp
));
881 #ifdef CONSTANT_ALIGNMENT
882 align
= CONSTANT_ALIGNMENT (exp
, align
);
885 if (align
> BITS_PER_UNIT
)
886 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
889 /* Output a string of literal assembler code
890 for an `asm' keyword used between functions. */
893 assemble_asm (string
)
898 if (TREE_CODE (string
) == ADDR_EXPR
)
899 string
= TREE_OPERAND (string
, 0);
901 fprintf (asm_out_file
, "\t%s\n", TREE_STRING_POINTER (string
));
904 #if 0 /* This should no longer be needed, because
905 flag_gnu_linker should be 0 on these systems,
906 which should prevent any output
907 if ASM_OUTPUT_CONSTRUCTOR and ASM_OUTPUT_DESTRUCTOR are absent. */
908 #if !(defined(DBX_DEBUGGING_INFO) && !defined(FASCIST_ASSEMBLER))
909 #ifndef ASM_OUTPUT_CONSTRUCTOR
910 #define ASM_OUTPUT_CONSTRUCTOR(file, name)
912 #ifndef ASM_OUTPUT_DESTRUCTOR
913 #define ASM_OUTPUT_DESTRUCTOR(file, name)
918 /* Record an element in the table of global destructors.
919 How this is done depends on what sort of assembler and linker
922 NAME should be the name of a global function to be called
923 at exit time. This name is output using assemble_name. */
926 assemble_destructor (name
)
929 #ifdef ASM_OUTPUT_DESTRUCTOR
930 ASM_OUTPUT_DESTRUCTOR (asm_out_file
, name
);
934 /* Now tell GNU LD that this is part of the static destructor set. */
935 /* This code works for any machine provided you use GNU as/ld. */
936 fprintf (asm_out_file
, "%s \"___DTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
937 assemble_name (asm_out_file
, name
);
938 fputc ('\n', asm_out_file
);
943 /* Likewise for global constructors. */
946 assemble_constructor (name
)
949 #ifdef ASM_OUTPUT_CONSTRUCTOR
950 ASM_OUTPUT_CONSTRUCTOR (asm_out_file
, name
);
954 /* Now tell GNU LD that this is part of the static constructor set. */
955 /* This code works for any machine provided you use GNU as/ld. */
956 fprintf (asm_out_file
, "%s \"___CTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
957 assemble_name (asm_out_file
, name
);
958 fputc ('\n', asm_out_file
);
963 /* Likewise for entries we want to record for garbage collection.
964 Garbage collection is still under development. */
967 assemble_gc_entry (name
)
970 #ifdef ASM_OUTPUT_GC_ENTRY
971 ASM_OUTPUT_GC_ENTRY (asm_out_file
, name
);
975 /* Now tell GNU LD that this is part of the static constructor set. */
976 fprintf (asm_out_file
, "%s \"___PTR_LIST__\",22,0,0,", ASM_STABS_OP
);
977 assemble_name (asm_out_file
, name
);
978 fputc ('\n', asm_out_file
);
983 /* CONSTANT_POOL_BEFORE_FUNCTION may be defined as an expression with
984 a non-zero value if the constant pool should be output before the
985 start of the function, or a zero value if the pool should output
986 after the end of the function. The default is to put it before the
989 #ifndef CONSTANT_POOL_BEFORE_FUNCTION
990 #define CONSTANT_POOL_BEFORE_FUNCTION 1
993 /* Output assembler code for the constant pool of a function and associated
994 with defining the name of the function. DECL describes the function.
995 NAME is the function's name. For the constant pool, we use the current
996 constant pool data. */
999 assemble_start_function (decl
, fnname
)
1005 /* The following code does not need preprocessing in the assembler. */
1009 if (CONSTANT_POOL_BEFORE_FUNCTION
)
1010 output_constant_pool (fnname
, decl
);
1012 #ifdef ASM_OUTPUT_SECTION_NAME
1013 /* If the function is to be put in its own section and it's not in a section
1014 already, indicate so. */
1015 if ((flag_function_sections
1016 && DECL_SECTION_NAME (decl
) == NULL_TREE
)
1017 || UNIQUE_SECTION_P (decl
))
1018 UNIQUE_SECTION (decl
, 0);
1021 function_section (decl
);
1023 /* Tell assembler to move to target machine's alignment for functions. */
1024 align
= floor_log2 (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
1026 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1028 /* Handle a user-specified function alignment.
1029 Note that we still need to align to FUNCTION_BOUNDARY, as above,
1030 because ASM_OUTPUT_MAX_SKIP_ALIGN might not do any alignment at all. */
1031 if (align_functions_log
> align
)
1033 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
1034 ASM_OUTPUT_MAX_SKIP_ALIGN (asm_out_file
,
1035 align_functions_log
, align_functions
-1);
1037 ASM_OUTPUT_ALIGN (asm_out_file
, align_functions_log
);
1041 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
1042 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file
, fnname
);
1045 #ifdef SDB_DEBUGGING_INFO
1046 /* Output SDB definition of the function. */
1047 if (write_symbols
== SDB_DEBUG
)
1048 sdbout_mark_begin_function ();
1051 #ifdef DBX_DEBUGGING_INFO
1052 /* Output DBX definition of the function. */
1053 if (write_symbols
== DBX_DEBUG
)
1054 dbxout_begin_function (decl
);
1057 /* Make function name accessible from other files, if appropriate. */
1059 if (TREE_PUBLIC (decl
))
1061 if (! first_global_object_name
)
1066 STRIP_NAME_ENCODING (p
, fnname
);
1067 name
= permalloc (strlen (p
) + 1);
1070 if (! DECL_WEAK (decl
) && ! DECL_ONE_ONLY (decl
))
1071 first_global_object_name
= name
;
1073 weak_global_object_name
= name
;
1076 #ifdef ASM_WEAKEN_LABEL
1077 if (DECL_WEAK (decl
))
1079 ASM_WEAKEN_LABEL (asm_out_file
, fnname
);
1080 /* Remove this function from the pending weak list so that
1081 we do not emit multiple .weak directives for it. */
1082 remove_from_pending_weak_list
1083 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
1087 ASM_GLOBALIZE_LABEL (asm_out_file
, fnname
);
1090 /* Do any machine/system dependent processing of the function name */
1091 #ifdef ASM_DECLARE_FUNCTION_NAME
1092 ASM_DECLARE_FUNCTION_NAME (asm_out_file
, fnname
, current_function_decl
);
1094 /* Standard thing is just output label for the function. */
1095 ASM_OUTPUT_LABEL (asm_out_file
, fnname
);
1096 #endif /* ASM_DECLARE_FUNCTION_NAME */
1099 /* Output assembler code associated with defining the size of the
1100 function. DECL describes the function. NAME is the function's name. */
1103 assemble_end_function (decl
, fnname
)
1107 #ifdef ASM_DECLARE_FUNCTION_SIZE
1108 ASM_DECLARE_FUNCTION_SIZE (asm_out_file
, fnname
, decl
);
1110 if (! CONSTANT_POOL_BEFORE_FUNCTION
)
1112 output_constant_pool (fnname
, decl
);
1113 function_section (decl
); /* need to switch back */
1116 /* Output any constants which should appear after the function. */
1117 output_after_function_constants ();
1120 /* Assemble code to leave SIZE bytes of zeros. */
1123 assemble_zeros (size
)
1126 /* Do no output if -fsyntax-only. */
1127 if (flag_syntax_only
)
1130 #ifdef ASM_NO_SKIP_IN_TEXT
1131 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
1132 so we must output 0s explicitly in the text section. */
1133 if (ASM_NO_SKIP_IN_TEXT
&& in_text_section ())
1137 for (i
= 0; i
< size
- 20; i
+= 20)
1140 fprintf (asm_out_file
,
1141 "%s 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n", ASM_BYTE_OP
);
1143 fprintf (asm_out_file
,
1144 "\tbyte 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n");
1150 fprintf (asm_out_file
, "%s 0", ASM_BYTE_OP
);
1152 fprintf (asm_out_file
, "\tbyte 0");
1155 for (; i
< size
; i
++)
1156 fprintf (asm_out_file
, ",0");
1157 fprintf (asm_out_file
, "\n");
1163 ASM_OUTPUT_SKIP (asm_out_file
, size
);
1166 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
1169 assemble_align (align
)
1172 if (align
> BITS_PER_UNIT
)
1173 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
1176 /* Assemble a string constant with the specified C string as contents. */
1179 assemble_string (p
, size
)
1186 /* If the string is very long, split it up. */
1190 int thissize
= size
- pos
;
1191 if (thissize
> maximum
)
1194 ASM_OUTPUT_ASCII (asm_out_file
, p
, thissize
);
1202 #if defined ASM_OUTPUT_ALIGNED_DECL_LOCAL
1203 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1204 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1206 #if defined ASM_OUTPUT_ALIGNED_LOCAL
1207 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1208 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, DECL_ALIGN (decl))
1210 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1211 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded)
1215 #if defined ASM_OUTPUT_ALIGNED_BSS
1216 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1217 ASM_OUTPUT_ALIGNED_BSS (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1219 #if defined ASM_OUTPUT_BSS
1220 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1221 ASM_OUTPUT_BSS (asm_out_file, decl, name, size, rounded)
1227 #if defined ASM_OUTPUT_ALIGNED_DECL_COMMON
1228 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1229 ASM_OUTPUT_ALIGNED_DECL_COMMON (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1231 #if defined ASM_OUTPUT_ALIGNED_COMMON
1232 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1233 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file, name, size, DECL_ALIGN (decl))
1235 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1236 ASM_OUTPUT_COMMON (asm_out_file, name, size, rounded)
1241 asm_emit_uninitialised (decl
, name
, size
, rounded
)
1244 int size ATTRIBUTE_UNUSED
;
1245 int rounded ATTRIBUTE_UNUSED
;
1253 destination
= asm_dest_local
;
1255 if (TREE_PUBLIC (decl
))
1257 #if defined ASM_EMIT_BSS
1258 if (! DECL_COMMON (decl
))
1259 destination
= asm_dest_bss
;
1262 destination
= asm_dest_common
;
1265 if (flag_shared_data
)
1267 switch (destination
)
1269 #ifdef ASM_OUTPUT_SHARED_BSS
1271 ASM_OUTPUT_SHARED_BSS (asm_out_file
, decl
, name
, size
, rounded
);
1274 #ifdef ASM_OUTPUT_SHARED_COMMON
1275 case asm_dest_common
:
1276 ASM_OUTPUT_SHARED_COMMON (asm_out_file
, name
, size
, rounded
);
1279 #ifdef ASM_OUTPUT_SHARED_LOCAL
1280 case asm_dest_local
:
1281 ASM_OUTPUT_SHARED_LOCAL (asm_out_file
, name
, size
, rounded
);
1289 #ifdef ASM_OUTPUT_SECTION_NAME
1290 /* We already know that DECL_SECTION_NAME() == NULL. */
1291 if (flag_data_sections
!= 0 || UNIQUE_SECTION_P (decl
))
1292 UNIQUE_SECTION (decl
, 0);
1295 switch (destination
)
1299 ASM_EMIT_BSS (decl
, name
, size
, rounded
);
1302 case asm_dest_common
:
1303 ASM_EMIT_COMMON (decl
, name
, size
, rounded
);
1305 case asm_dest_local
:
1306 ASM_EMIT_LOCAL (decl
, name
, size
, rounded
);
1315 /* Assemble everything that is needed for a variable or function declaration.
1316 Not used for automatic variables, and not used for function definitions.
1317 Should not be called for variables of incomplete structure type.
1319 TOP_LEVEL is nonzero if this variable has file scope.
1320 AT_END is nonzero if this is the special handling, at end of compilation,
1321 to define things that have had only tentative definitions.
1322 DONT_OUTPUT_DATA if nonzero means don't actually output the
1323 initial value (that will be done by the caller). */
1326 assemble_variable (decl
, top_level
, at_end
, dont_output_data
)
1328 int top_level ATTRIBUTE_UNUSED
;
1329 int at_end ATTRIBUTE_UNUSED
;
1330 int dont_output_data
;
1332 register const char *name
;
1335 enum in_section saved_in_section
;
1337 last_assemble_variable_decl
= 0;
1339 if (GET_CODE (DECL_RTL (decl
)) == REG
)
1341 /* Do output symbol info for global register variables, but do nothing
1344 if (TREE_ASM_WRITTEN (decl
))
1346 TREE_ASM_WRITTEN (decl
) = 1;
1348 /* Do no output if -fsyntax-only. */
1349 if (flag_syntax_only
)
1352 #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
1353 /* File-scope global variables are output here. */
1354 if ((write_symbols
== DBX_DEBUG
|| write_symbols
== XCOFF_DEBUG
)
1356 dbxout_symbol (decl
, 0);
1358 #ifdef SDB_DEBUGGING_INFO
1359 if (write_symbols
== SDB_DEBUG
&& top_level
1360 /* Leave initialized global vars for end of compilation;
1361 see comment in compile_file. */
1362 && (TREE_PUBLIC (decl
) == 0 || DECL_INITIAL (decl
) == 0))
1363 sdbout_symbol (decl
, 0);
1366 /* Don't output any DWARF debugging information for variables here.
1367 In the case of local variables, the information for them is output
1368 when we do our recursive traversal of the tree representation for
1369 the entire containing function. In the case of file-scope variables,
1370 we output information for all of them at the very end of compilation
1371 while we are doing our final traversal of the chain of file-scope
1377 /* Normally no need to say anything here for external references,
1378 since assemble_external is called by the language-specific code
1379 when a declaration is first seen. */
1381 if (DECL_EXTERNAL (decl
))
1384 /* Output no assembler code for a function declaration.
1385 Only definitions of functions output anything. */
1387 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1390 /* If type was incomplete when the variable was declared,
1391 see if it is complete now. */
1393 if (DECL_SIZE (decl
) == 0)
1394 layout_decl (decl
, 0);
1396 /* Still incomplete => don't allocate it; treat the tentative defn
1397 (which is what it must have been) as an `extern' reference. */
1399 if (!dont_output_data
&& DECL_SIZE (decl
) == 0)
1401 error_with_file_and_line (DECL_SOURCE_FILE (decl
),
1402 DECL_SOURCE_LINE (decl
),
1403 "storage size of `%s' isn't known",
1404 IDENTIFIER_POINTER (DECL_NAME (decl
)));
1405 TREE_ASM_WRITTEN (decl
) = 1;
1409 /* The first declaration of a variable that comes through this function
1410 decides whether it is global (in C, has external linkage)
1411 or local (in C, has internal linkage). So do nothing more
1412 if this function has already run. */
1414 if (TREE_ASM_WRITTEN (decl
))
1417 TREE_ASM_WRITTEN (decl
) = 1;
1419 /* Do no output if -fsyntax-only. */
1420 if (flag_syntax_only
)
1425 if (! dont_output_data
1426 && ! host_integerp (DECL_SIZE_UNIT (decl
), 1))
1428 error_with_decl (decl
, "size of variable `%s' is too large");
1432 name
= XSTR (XEXP (DECL_RTL (decl
), 0), 0);
1433 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
)
1434 && ! first_global_object_name
1435 && ! (DECL_COMMON (decl
) && (DECL_INITIAL (decl
) == 0
1436 || DECL_INITIAL (decl
) == error_mark_node
))
1437 && ! DECL_WEAK (decl
)
1438 && ! DECL_ONE_ONLY (decl
))
1443 STRIP_NAME_ENCODING (p
, name
);
1444 xname
= permalloc (strlen (p
) + 1);
1446 first_global_object_name
= xname
;
1449 /* Compute the alignment of this data. */
1451 align
= DECL_ALIGN (decl
);
1453 /* In the case for initialing an array whose length isn't specified,
1454 where we have not yet been able to do the layout,
1455 figure out the proper alignment now. */
1456 if (dont_output_data
&& DECL_SIZE (decl
) == 0
1457 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
)
1458 align
= MAX (align
, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl
))));
1460 /* Some object file formats have a maximum alignment which they support.
1461 In particular, a.out format supports a maximum alignment of 4. */
1462 #ifndef MAX_OFILE_ALIGNMENT
1463 #define MAX_OFILE_ALIGNMENT BIGGEST_ALIGNMENT
1465 if (align
> MAX_OFILE_ALIGNMENT
)
1467 warning_with_decl (decl
,
1468 "alignment of `%s' is greater than maximum object file alignment. Using %d.",
1469 MAX_OFILE_ALIGNMENT
/BITS_PER_UNIT
);
1470 align
= MAX_OFILE_ALIGNMENT
;
1473 /* On some machines, it is good to increase alignment sometimes. */
1474 #ifdef DATA_ALIGNMENT
1475 align
= DATA_ALIGNMENT (TREE_TYPE (decl
), align
);
1477 #ifdef CONSTANT_ALIGNMENT
1478 if (DECL_INITIAL (decl
) != 0 && DECL_INITIAL (decl
) != error_mark_node
)
1479 align
= CONSTANT_ALIGNMENT (DECL_INITIAL (decl
), align
);
1482 /* Reset the alignment in case we have made it tighter, so we can benefit
1483 from it in get_pointer_alignment. */
1484 DECL_ALIGN (decl
) = align
;
1486 /* Handle uninitialized definitions. */
1488 if ((DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
)
1489 /* If the target can't output uninitialized but not common global data
1490 in .bss, then we have to use .data. */
1491 #if ! defined ASM_EMIT_BSS
1492 && DECL_COMMON (decl
)
1494 && DECL_SECTION_NAME (decl
) == NULL_TREE
1495 && ! dont_output_data
)
1497 unsigned HOST_WIDE_INT size
= tree_low_cst (DECL_SIZE_UNIT (decl
), 1);
1498 unsigned HOST_WIDE_INT rounded
= size
;
1500 /* Don't allocate zero bytes of common,
1501 since that means "undefined external" in the linker. */
1505 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1506 so that each uninitialized object starts on such a boundary. */
1507 rounded
+= (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1;
1508 rounded
= (rounded
/ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1509 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1511 #if !defined(ASM_OUTPUT_ALIGNED_COMMON) && !defined(ASM_OUTPUT_ALIGNED_BSS)
1512 if ((unsigned HOST_WIDE_INT
) DECL_ALIGN (decl
) / BITS_PER_UNIT
> rounded
)
1514 (decl
, "requested alignment for %s is greater than implemented alignment of %d.",rounded
);
1517 #ifdef DBX_DEBUGGING_INFO
1518 /* File-scope global variables are output here. */
1519 if (write_symbols
== DBX_DEBUG
&& top_level
)
1520 dbxout_symbol (decl
, 0);
1522 #ifdef SDB_DEBUGGING_INFO
1523 if (write_symbols
== SDB_DEBUG
&& top_level
1524 /* Leave initialized global vars for end of compilation;
1525 see comment in compile_file. */
1526 && (TREE_PUBLIC (decl
) == 0 || DECL_INITIAL (decl
) == 0))
1527 sdbout_symbol (decl
, 0);
1530 /* Don't output any DWARF debugging information for variables here.
1531 In the case of local variables, the information for them is output
1532 when we do our recursive traversal of the tree representation for
1533 the entire containing function. In the case of file-scope variables,
1534 we output information for all of them at the very end of compilation
1535 while we are doing our final traversal of the chain of file-scope
1538 #if 0 /* ??? We should either delete this or add a comment describing what
1539 it was intended to do and why we shouldn't delete it. */
1540 if (flag_shared_data
)
1543 asm_emit_uninitialised (decl
, name
, size
, rounded
);
1548 /* Handle initialized definitions.
1549 Also handle uninitialized global definitions if -fno-common and the
1550 target doesn't support ASM_OUTPUT_BSS. */
1552 /* First make the assembler name(s) global if appropriate. */
1553 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
))
1555 #ifdef ASM_WEAKEN_LABEL
1556 if (DECL_WEAK (decl
))
1558 ASM_WEAKEN_LABEL (asm_out_file
, name
);
1559 /* Remove this variable from the pending weak list so that
1560 we do not emit multiple .weak directives for it. */
1561 remove_from_pending_weak_list
1562 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
1566 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
1569 for (d
= equivalents
; d
; d
= TREE_CHAIN (d
))
1571 tree e
= TREE_VALUE (d
);
1572 if (TREE_PUBLIC (e
) && DECL_NAME (e
))
1573 ASM_GLOBALIZE_LABEL (asm_out_file
,
1574 XSTR (XEXP (DECL_RTL (e
), 0), 0));
1578 /* Output any data that we will need to use the address of. */
1579 if (DECL_INITIAL (decl
) == error_mark_node
)
1580 reloc
= contains_pointers_p (TREE_TYPE (decl
));
1581 else if (DECL_INITIAL (decl
))
1582 reloc
= output_addressed_constants (DECL_INITIAL (decl
));
1584 #ifdef ASM_OUTPUT_SECTION_NAME
1585 if ((flag_data_sections
!= 0 && DECL_SECTION_NAME (decl
) == NULL_TREE
)
1586 || UNIQUE_SECTION_P (decl
))
1587 UNIQUE_SECTION (decl
, reloc
);
1590 /* Switch to the appropriate section. */
1591 variable_section (decl
, reloc
);
1593 /* dbxout.c needs to know this. */
1594 if (in_text_section ())
1595 DECL_IN_TEXT_SECTION (decl
) = 1;
1597 /* Record current section so we can restore it if dbxout.c clobbers it. */
1598 saved_in_section
= in_section
;
1600 /* Output the dbx info now that we have chosen the section. */
1602 #ifdef DBX_DEBUGGING_INFO
1603 /* File-scope global variables are output here. */
1604 if (write_symbols
== DBX_DEBUG
&& top_level
)
1605 dbxout_symbol (decl
, 0);
1607 #ifdef SDB_DEBUGGING_INFO
1608 if (write_symbols
== SDB_DEBUG
&& top_level
1609 /* Leave initialized global vars for end of compilation;
1610 see comment in compile_file. */
1611 && (TREE_PUBLIC (decl
) == 0 || DECL_INITIAL (decl
) == 0))
1612 sdbout_symbol (decl
, 0);
1615 /* Don't output any DWARF debugging information for variables here.
1616 In the case of local variables, the information for them is output
1617 when we do our recursive traversal of the tree representation for
1618 the entire containing function. In the case of file-scope variables,
1619 we output information for all of them at the very end of compilation
1620 while we are doing our final traversal of the chain of file-scope
1623 /* If the debugging output changed sections, reselect the section
1624 that's supposed to be selected. */
1625 if (in_section
!= saved_in_section
)
1626 variable_section (decl
, reloc
);
1628 /* Output the alignment of this data. */
1629 if (align
> BITS_PER_UNIT
)
1630 ASM_OUTPUT_ALIGN (asm_out_file
,
1631 floor_log2 (DECL_ALIGN (decl
) / BITS_PER_UNIT
));
1633 /* Do any machine/system dependent processing of the object. */
1634 #ifdef ASM_DECLARE_OBJECT_NAME
1635 last_assemble_variable_decl
= decl
;
1636 ASM_DECLARE_OBJECT_NAME (asm_out_file
, name
, decl
);
1638 /* Standard thing is just output label for the object. */
1639 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1640 #endif /* ASM_DECLARE_OBJECT_NAME */
1642 if (!dont_output_data
)
1644 if (DECL_INITIAL (decl
))
1645 /* Output the actual data. */
1646 output_constant (DECL_INITIAL (decl
),
1647 tree_low_cst (DECL_SIZE_UNIT (decl
), 1));
1649 /* Leave space for it. */
1650 assemble_zeros (tree_low_cst (DECL_SIZE_UNIT (decl
), 1));
1654 #ifdef XCOFF_DEBUGGING_INFO
1655 /* Unfortunately, the IBM assembler cannot handle stabx before the actual
1656 declaration. When something like ".stabx "aa:S-2",aa,133,0" is emitted
1657 and `aa' hasn't been output yet, the assembler generates a stab entry with
1658 a value of zero, in addition to creating an unnecessary external entry
1659 for `aa'. Hence, we must postpone dbxout_symbol to here at the end. */
1661 /* File-scope global variables are output here. */
1662 if (write_symbols
== XCOFF_DEBUG
&& top_level
)
1664 saved_in_section
= in_section
;
1666 dbxout_symbol (decl
, 0);
1668 if (in_section
!= saved_in_section
)
1669 variable_section (decl
, reloc
);
1672 /* There must be a statement after a label. */
1677 /* Return 1 if type TYPE contains any pointers. */
1680 contains_pointers_p (type
)
1683 switch (TREE_CODE (type
))
1686 case REFERENCE_TYPE
:
1687 /* I'm not sure whether OFFSET_TYPE needs this treatment,
1688 so I'll play safe and return 1. */
1694 case QUAL_UNION_TYPE
:
1697 /* For a type that has fields, see if the fields have pointers. */
1698 for (fields
= TYPE_FIELDS (type
); fields
; fields
= TREE_CHAIN (fields
))
1699 if (TREE_CODE (fields
) == FIELD_DECL
1700 && contains_pointers_p (TREE_TYPE (fields
)))
1706 /* An array type contains pointers if its element type does. */
1707 return contains_pointers_p (TREE_TYPE (type
));
1714 /* Output something to declare an external symbol to the assembler.
1715 (Most assemblers don't need this, so we normally output nothing.)
1716 Do nothing if DECL is not external. */
1719 assemble_external (decl
)
1720 tree decl ATTRIBUTE_UNUSED
;
1722 #ifdef ASM_OUTPUT_EXTERNAL
1723 if (DECL_P (decl
) && DECL_EXTERNAL (decl
) && TREE_PUBLIC (decl
))
1725 rtx rtl
= DECL_RTL (decl
);
1727 if (GET_CODE (rtl
) == MEM
&& GET_CODE (XEXP (rtl
, 0)) == SYMBOL_REF
1728 && ! SYMBOL_REF_USED (XEXP (rtl
, 0)))
1730 /* Some systems do require some output. */
1731 SYMBOL_REF_USED (XEXP (rtl
, 0)) = 1;
1732 ASM_OUTPUT_EXTERNAL (asm_out_file
, decl
, XSTR (XEXP (rtl
, 0), 0));
1738 /* Similar, for calling a library function FUN. */
1741 assemble_external_libcall (fun
)
1742 rtx fun ATTRIBUTE_UNUSED
;
1744 #ifdef ASM_OUTPUT_EXTERNAL_LIBCALL
1745 /* Declare library function name external when first used, if nec. */
1746 if (! SYMBOL_REF_USED (fun
))
1748 SYMBOL_REF_USED (fun
) = 1;
1749 ASM_OUTPUT_EXTERNAL_LIBCALL (asm_out_file
, fun
);
1754 /* Declare the label NAME global. */
1757 assemble_global (name
)
1760 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
1763 /* Assemble a label named NAME. */
1766 assemble_label (name
)
1769 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1772 /* Output to FILE a reference to the assembler name of a C-level name NAME.
1773 If NAME starts with a *, the rest of NAME is output verbatim.
1774 Otherwise NAME is transformed in an implementation-defined way
1775 (usually by the addition of an underscore).
1776 Many macros in the tm file are defined to call this function. */
1779 assemble_name (file
, name
)
1783 const char *real_name
;
1786 STRIP_NAME_ENCODING (real_name
, name
);
1787 if (flag_prefix_function_name
1788 && ! bcmp (real_name
, CHKR_PREFIX
, CHKR_PREFIX_SIZE
))
1789 real_name
= real_name
+ CHKR_PREFIX_SIZE
;
1791 id
= maybe_get_identifier (real_name
);
1793 TREE_SYMBOL_REFERENCED (id
) = 1;
1796 fputs (&name
[1], file
);
1798 ASM_OUTPUT_LABELREF (file
, name
);
1801 /* Allocate SIZE bytes writable static space with a gensym name
1802 and return an RTX to refer to its address. */
1805 assemble_static_space (size
)
1813 if (flag_shared_data
)
1817 ASM_GENERATE_INTERNAL_LABEL (name
, "LF", const_labelno
);
1819 namestring
= ggc_alloc_string (name
, -1);
1821 x
= gen_rtx_SYMBOL_REF (Pmode
, namestring
);
1823 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
1824 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file
, NULL_TREE
, name
, size
,
1827 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1828 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file
, name
, size
, BIGGEST_ALIGNMENT
);
1831 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1832 so that each uninitialized object starts on such a boundary. */
1833 /* Variable `rounded' might or might not be used in ASM_OUTPUT_LOCAL. */
1834 int rounded ATTRIBUTE_UNUSED
1835 = ((size
+ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1)
1836 / (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1837 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1838 ASM_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
1845 /* Assemble the static constant template for function entry trampolines.
1846 This is done at most once per compilation.
1847 Returns an RTX for the address of the template. */
1849 #ifdef TRAMPOLINE_TEMPLATE
1851 assemble_trampoline_template ()
1857 /* By default, put trampoline templates in read-only data section. */
1859 #ifdef TRAMPOLINE_SECTION
1860 TRAMPOLINE_SECTION ();
1862 readonly_data_section ();
1865 /* Write the assembler code to define one. */
1866 align
= floor_log2 (TRAMPOLINE_ALIGNMENT
/ BITS_PER_UNIT
);
1868 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1870 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LTRAMP", 0);
1871 TRAMPOLINE_TEMPLATE (asm_out_file
);
1873 /* Record the rtl to refer to it. */
1874 ASM_GENERATE_INTERNAL_LABEL (label
, "LTRAMP", 0);
1875 name
= ggc_alloc_string (label
, -1);
1876 return gen_rtx_SYMBOL_REF (Pmode
, name
);
1880 /* Assemble the integer constant X into an object of SIZE bytes.
1881 X must be either a CONST_INT or CONST_DOUBLE.
1883 Return 1 if we were able to output the constant, otherwise 0. If FORCE is
1884 non-zero, abort if we can't output the constant. */
1887 assemble_integer (x
, size
, force
)
1892 /* First try to use the standard 1, 2, 4, 8, and 16 byte
1893 ASM_OUTPUT... macros. */
1897 #ifdef ASM_OUTPUT_CHAR
1899 ASM_OUTPUT_CHAR (asm_out_file
, x
);
1903 #ifdef ASM_OUTPUT_SHORT
1905 ASM_OUTPUT_SHORT (asm_out_file
, x
);
1909 #ifdef ASM_OUTPUT_INT
1911 ASM_OUTPUT_INT (asm_out_file
, x
);
1915 #ifdef ASM_OUTPUT_DOUBLE_INT
1917 ASM_OUTPUT_DOUBLE_INT (asm_out_file
, x
);
1921 #ifdef ASM_OUTPUT_QUADRUPLE_INT
1923 ASM_OUTPUT_QUADRUPLE_INT (asm_out_file
, x
);
1928 /* If we couldn't do it that way, there are two other possibilities: First,
1929 if the machine can output an explicit byte and this is a 1 byte constant,
1930 we can use ASM_OUTPUT_BYTE. */
1932 #ifdef ASM_OUTPUT_BYTE
1933 if (size
== 1 && GET_CODE (x
) == CONST_INT
)
1935 ASM_OUTPUT_BYTE (asm_out_file
, INTVAL (x
));
1940 /* Finally, if SIZE is larger than a single word, try to output the constant
1941 one word at a time. */
1943 if (size
> UNITS_PER_WORD
)
1946 enum machine_mode mode
1947 = mode_for_size (size
* BITS_PER_UNIT
, MODE_INT
, 0);
1950 for (i
= 0; i
< size
/ UNITS_PER_WORD
; i
++)
1952 word
= operand_subword (x
, i
, 0, mode
);
1957 if (! assemble_integer (word
, UNITS_PER_WORD
, 0))
1961 if (i
== size
/ UNITS_PER_WORD
)
1963 /* If we output at least one word and then could not finish,
1964 there is no valid way to continue. */
1975 /* Assemble the floating-point constant D into an object of size MODE. */
1978 assemble_real (d
, mode
)
1980 enum machine_mode mode
;
1982 jmp_buf output_constant_handler
;
1984 if (setjmp (output_constant_handler
))
1986 error ("floating point trap outputting a constant");
1987 #ifdef REAL_IS_NOT_DOUBLE
1988 bzero ((char *) &d
, sizeof d
);
1995 set_float_handler (output_constant_handler
);
1999 #ifdef ASM_OUTPUT_BYTE_FLOAT
2001 ASM_OUTPUT_BYTE_FLOAT (asm_out_file
, d
);
2004 #ifdef ASM_OUTPUT_SHORT_FLOAT
2006 ASM_OUTPUT_SHORT_FLOAT (asm_out_file
, d
);
2009 #ifdef ASM_OUTPUT_THREE_QUARTER_FLOAT
2011 ASM_OUTPUT_THREE_QUARTER_FLOAT (asm_out_file
, d
);
2014 #ifdef ASM_OUTPUT_FLOAT
2016 ASM_OUTPUT_FLOAT (asm_out_file
, d
);
2020 #ifdef ASM_OUTPUT_DOUBLE
2022 ASM_OUTPUT_DOUBLE (asm_out_file
, d
);
2026 #ifdef ASM_OUTPUT_LONG_DOUBLE
2029 ASM_OUTPUT_LONG_DOUBLE (asm_out_file
, d
);
2037 set_float_handler (NULL_PTR
);
2040 /* Here we combine duplicate floating constants to make
2041 CONST_DOUBLE rtx's, and force those out to memory when necessary. */
2043 /* Return a CONST_DOUBLE or CONST_INT for a value specified as a pair of ints.
2044 For an integer, I0 is the low-order word and I1 is the high-order word.
2045 For a real number, I0 is the word with the low address
2046 and I1 is the word with the high address. */
2049 immed_double_const (i0
, i1
, mode
)
2050 HOST_WIDE_INT i0
, i1
;
2051 enum machine_mode mode
;
2055 if (GET_MODE_CLASS (mode
) == MODE_INT
2056 || GET_MODE_CLASS (mode
) == MODE_PARTIAL_INT
)
2058 /* We clear out all bits that don't belong in MODE, unless they and our
2059 sign bit are all one. So we get either a reasonable negative value
2060 or a reasonable unsigned value for this mode. */
2061 int width
= GET_MODE_BITSIZE (mode
);
2062 if (width
< HOST_BITS_PER_WIDE_INT
2063 && ((i0
& ((HOST_WIDE_INT
) (-1) << (width
- 1)))
2064 != ((HOST_WIDE_INT
) (-1) << (width
- 1))))
2065 i0
&= ((HOST_WIDE_INT
) 1 << width
) - 1, i1
= 0;
2066 else if (width
== HOST_BITS_PER_WIDE_INT
2067 && ! (i1
== ~0 && i0
< 0))
2069 else if (width
> 2 * HOST_BITS_PER_WIDE_INT
)
2070 /* We cannot represent this value as a constant. */
2073 /* If this would be an entire word for the target, but is not for
2074 the host, then sign-extend on the host so that the number will look
2075 the same way on the host that it would on the target.
2077 For example, when building a 64 bit alpha hosted 32 bit sparc
2078 targeted compiler, then we want the 32 bit unsigned value -1 to be
2079 represented as a 64 bit value -1, and not as 0x00000000ffffffff.
2080 The later confuses the sparc backend. */
2082 if (BITS_PER_WORD
< HOST_BITS_PER_WIDE_INT
&& BITS_PER_WORD
== width
2083 && (i0
& ((HOST_WIDE_INT
) 1 << (width
- 1))))
2084 i0
|= ((HOST_WIDE_INT
) (-1) << width
);
2086 /* If MODE fits within HOST_BITS_PER_WIDE_INT, always use a CONST_INT.
2088 ??? Strictly speaking, this is wrong if we create a CONST_INT
2089 for a large unsigned constant with the size of MODE being
2090 HOST_BITS_PER_WIDE_INT and later try to interpret that constant in a
2091 wider mode. In that case we will mis-interpret it as a negative
2094 Unfortunately, the only alternative is to make a CONST_DOUBLE
2095 for any constant in any mode if it is an unsigned constant larger
2096 than the maximum signed integer in an int on the host. However,
2097 doing this will break everyone that always expects to see a CONST_INT
2098 for SImode and smaller.
2100 We have always been making CONST_INTs in this case, so nothing new
2103 if (width
<= HOST_BITS_PER_WIDE_INT
)
2104 i1
= (i0
< 0) ? ~(HOST_WIDE_INT
) 0 : 0;
2106 /* If this integer fits in one word, return a CONST_INT. */
2107 if ((i1
== 0 && i0
>= 0)
2108 || (i1
== ~0 && i0
< 0))
2109 return GEN_INT (i0
);
2111 /* We use VOIDmode for integers. */
2115 /* Search the chain for an existing CONST_DOUBLE with the right value.
2116 If one is found, return it. */
2118 for (r
= const_double_chain
; r
; r
= CONST_DOUBLE_CHAIN (r
))
2119 if (CONST_DOUBLE_LOW (r
) == i0
&& CONST_DOUBLE_HIGH (r
) == i1
2120 && GET_MODE (r
) == mode
)
2123 /* No; make a new one and add it to the chain.
2125 We may be called by an optimizer which may be discarding any memory
2126 allocated during its processing (such as combine and loop). However,
2127 we will be leaving this constant on the chain, so we cannot tolerate
2128 freed memory. So switch to saveable_obstack for this allocation
2129 and then switch back if we were in current_obstack. */
2131 push_obstacks_nochange ();
2132 rtl_in_saveable_obstack ();
2133 r
= gen_rtx_CONST_DOUBLE (mode
, NULL_RTX
, i0
, i1
);
2136 /* Don't touch const_double_chain if not inside any function. */
2137 if (current_function_decl
!= 0)
2139 CONST_DOUBLE_CHAIN (r
) = const_double_chain
;
2140 const_double_chain
= r
;
2143 /* Store const0_rtx in mem-slot since this CONST_DOUBLE is on the chain.
2144 Actual use of mem-slot is only through force_const_mem. */
2146 CONST_DOUBLE_MEM (r
) = const0_rtx
;
2151 /* Return a CONST_DOUBLE for a specified `double' value
2152 and machine mode. */
2155 immed_real_const_1 (d
, mode
)
2157 enum machine_mode mode
;
2159 union real_extract u
;
2162 /* Get the desired `double' value as a sequence of ints
2163 since that is how they are stored in a CONST_DOUBLE. */
2167 /* Detect special cases. But be careful we don't use a CONST_DOUBLE
2168 that's from a parent function since it may be in its constant pool. */
2169 if (REAL_VALUES_IDENTICAL (dconst0
, d
)
2170 && (cfun
== 0 || decl_function_context (current_function_decl
) == 0))
2171 return CONST0_RTX (mode
);
2173 /* Check for NaN first, because some ports (specifically the i386) do not
2174 emit correct ieee-fp code by default, and thus will generate a core
2175 dump here if we pass a NaN to REAL_VALUES_EQUAL and if REAL_VALUES_EQUAL
2176 does a floating point comparison. */
2177 else if ((! REAL_VALUE_ISNAN (d
) && REAL_VALUES_EQUAL (dconst1
, d
))
2179 || decl_function_context (current_function_decl
) == 0))
2180 return CONST1_RTX (mode
);
2182 if (sizeof u
== sizeof (HOST_WIDE_INT
))
2183 return immed_double_const (u
.i
[0], 0, mode
);
2184 if (sizeof u
== 2 * sizeof (HOST_WIDE_INT
))
2185 return immed_double_const (u
.i
[0], u
.i
[1], mode
);
2187 /* The rest of this function handles the case where
2188 a float value requires more than 2 ints of space.
2189 It will be deleted as dead code on machines that don't need it. */
2191 /* Search the chain for an existing CONST_DOUBLE with the right value.
2192 If one is found, return it. */
2194 for (r
= const_double_chain
; r
; r
= CONST_DOUBLE_CHAIN (r
))
2195 if (! bcmp ((char *) &CONST_DOUBLE_LOW (r
), (char *) &u
, sizeof u
)
2196 && GET_MODE (r
) == mode
)
2199 /* No; make a new one and add it to the chain.
2201 We may be called by an optimizer which may be discarding any memory
2202 allocated during its processing (such as combine and loop). However,
2203 we will be leaving this constant on the chain, so we cannot tolerate
2204 freed memory. So switch to saveable_obstack for this allocation
2205 and then switch back if we were in current_obstack. */
2206 push_obstacks_nochange ();
2207 rtl_in_saveable_obstack ();
2208 r
= rtx_alloc (CONST_DOUBLE
);
2211 bcopy ((char *) &u
, (char *) &CONST_DOUBLE_LOW (r
), sizeof u
);
2213 /* Don't touch const_double_chain if not inside any function. */
2214 if (current_function_decl
!= 0)
2216 CONST_DOUBLE_CHAIN (r
) = const_double_chain
;
2217 const_double_chain
= r
;
2220 /* Store const0_rtx in CONST_DOUBLE_MEM since this CONST_DOUBLE is on the
2221 chain, but has not been allocated memory. Actual use of CONST_DOUBLE_MEM
2222 is only through force_const_mem. */
2224 CONST_DOUBLE_MEM (r
) = const0_rtx
;
2229 /* Return a CONST_DOUBLE rtx for a value specified by EXP,
2230 which must be a REAL_CST tree node. */
2233 immed_real_const (exp
)
2236 return immed_real_const_1 (TREE_REAL_CST (exp
), TYPE_MODE (TREE_TYPE (exp
)));
2239 /* At the end of a function, forget the memory-constants
2240 previously made for CONST_DOUBLEs. Mark them as not on real_constant_chain.
2241 Also clear out real_constant_chain and clear out all the chain-pointers. */
2244 clear_const_double_mem ()
2246 register rtx r
, next
;
2248 for (r
= const_double_chain
; r
; r
= next
)
2250 next
= CONST_DOUBLE_CHAIN (r
);
2251 CONST_DOUBLE_CHAIN (r
) = 0;
2252 CONST_DOUBLE_MEM (r
) = cc0_rtx
;
2254 const_double_chain
= 0;
2257 /* Given an expression EXP with a constant value,
2258 reduce it to the sum of an assembler symbol and an integer.
2259 Store them both in the structure *VALUE.
2260 Abort if EXP does not reduce. */
2265 HOST_WIDE_INT offset
;
2269 decode_addr_const (exp
, value
)
2271 struct addr_const
*value
;
2273 register tree target
= TREE_OPERAND (exp
, 0);
2274 register int offset
= 0;
2279 if (TREE_CODE (target
) == COMPONENT_REF
2280 && host_integerp (byte_position (TREE_OPERAND (target
, 1)), 0))
2283 offset
+= int_byte_position (TREE_OPERAND (target
, 1));
2284 target
= TREE_OPERAND (target
, 0);
2286 else if (TREE_CODE (target
) == ARRAY_REF
)
2288 offset
+= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (target
)), 1)
2289 * tree_low_cst (TREE_OPERAND (target
, 1), 0));
2290 target
= TREE_OPERAND (target
, 0);
2296 switch (TREE_CODE (target
))
2300 x
= DECL_RTL (target
);
2304 x
= gen_rtx_MEM (FUNCTION_MODE
,
2305 gen_rtx_LABEL_REF (VOIDmode
,
2306 label_rtx (TREE_OPERAND (exp
, 0))));
2314 x
= TREE_CST_RTL (target
);
2321 if (GET_CODE (x
) != MEM
)
2326 value
->offset
= offset
;
2329 /* Uniquize all constants that appear in memory.
2330 Each constant in memory thus far output is recorded
2331 in `const_hash_table' with a `struct constant_descriptor'
2332 that contains a polish representation of the value of
2335 We cannot store the trees in the hash table
2336 because the trees may be temporary. */
2338 struct constant_descriptor
2340 struct constant_descriptor
*next
;
2347 #define MAX_HASH_TABLE 1009
2348 static struct constant_descriptor
*const_hash_table
[MAX_HASH_TABLE
];
2350 /* Mark a const_hash_table descriptor for GC. */
2353 mark_const_hash_entry (ptr
)
2356 struct constant_descriptor
*desc
= * (struct constant_descriptor
**) ptr
;
2360 ggc_mark_string (desc
->label
);
2361 ggc_mark_rtx (desc
->rtl
);
2366 /* Compute a hash code for a constant expression. */
2372 register const char *p
;
2373 register int len
, hi
, i
;
2374 register enum tree_code code
= TREE_CODE (exp
);
2376 /* Either set P and LEN to the address and len of something to hash and
2377 exit the switch or return a value. */
2382 p
= (char *) &TREE_INT_CST_LOW (exp
);
2383 len
= 2 * sizeof TREE_INT_CST_LOW (exp
);
2387 p
= (char *) &TREE_REAL_CST (exp
);
2388 len
= sizeof TREE_REAL_CST (exp
);
2392 p
= TREE_STRING_POINTER (exp
);
2393 len
= TREE_STRING_LENGTH (exp
);
2397 return (const_hash (TREE_REALPART (exp
)) * 5
2398 + const_hash (TREE_IMAGPART (exp
)));
2401 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2405 len
= int_size_in_bytes (TREE_TYPE (exp
));
2406 tmp
= (char *) alloca (len
);
2407 get_set_constructor_bytes (exp
, (unsigned char *) tmp
, len
);
2415 /* For record type, include the type in the hashing.
2416 We do not do so for array types
2417 because (1) the sizes of the elements are sufficient
2418 and (2) distinct array types can have the same constructor.
2419 Instead, we include the array size because the constructor could
2421 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2422 hi
= ((unsigned long) TREE_TYPE (exp
) & ((1 << HASHBITS
) - 1))
2425 hi
= ((5 + int_size_in_bytes (TREE_TYPE (exp
)))
2426 & ((1 << HASHBITS
) - 1)) % MAX_HASH_TABLE
;
2428 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2429 if (TREE_VALUE (link
))
2431 = (hi
* 603 + const_hash (TREE_VALUE (link
))) % MAX_HASH_TABLE
;
2438 struct addr_const value
;
2440 decode_addr_const (exp
, &value
);
2441 if (GET_CODE (value
.base
) == SYMBOL_REF
)
2443 /* Don't hash the address of the SYMBOL_REF;
2444 only use the offset and the symbol name. */
2446 p
= XSTR (value
.base
, 0);
2447 for (i
= 0; p
[i
] != 0; i
++)
2448 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2450 else if (GET_CODE (value
.base
) == LABEL_REF
)
2451 hi
= value
.offset
+ CODE_LABEL_NUMBER (XEXP (value
.base
, 0)) * 13;
2455 hi
&= (1 << HASHBITS
) - 1;
2456 hi
%= MAX_HASH_TABLE
;
2462 return (const_hash (TREE_OPERAND (exp
, 0)) * 9
2463 + const_hash (TREE_OPERAND (exp
, 1)));
2467 case NON_LVALUE_EXPR
:
2468 return const_hash (TREE_OPERAND (exp
, 0)) * 7 + 2;
2474 /* Compute hashing function */
2476 for (i
= 0; i
< len
; i
++)
2477 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2479 hi
&= (1 << HASHBITS
) - 1;
2480 hi
%= MAX_HASH_TABLE
;
2484 /* Compare a constant expression EXP with a constant-descriptor DESC.
2485 Return 1 if DESC describes a constant with the same value as EXP. */
2488 compare_constant (exp
, desc
)
2490 struct constant_descriptor
*desc
;
2492 return 0 != compare_constant_1 (exp
, desc
->contents
);
2495 /* Compare constant expression EXP with a substring P of a constant descriptor.
2496 If they match, return a pointer to the end of the substring matched.
2497 If they do not match, return 0.
2499 Since descriptors are written in polish prefix notation,
2500 this function can be used recursively to test one operand of EXP
2501 against a subdescriptor, and if it succeeds it returns the
2502 address of the subdescriptor for the next operand. */
2505 compare_constant_1 (exp
, p
)
2509 register const char *strp
;
2511 register enum tree_code code
= TREE_CODE (exp
);
2513 if (code
!= (enum tree_code
) *p
++)
2516 /* Either set STRP, P and LEN to pointers and length to compare and exit the
2517 switch, or return the result of the comparison. */
2522 /* Integer constants are the same only if the same width of type. */
2523 if (*p
++ != TYPE_PRECISION (TREE_TYPE (exp
)))
2526 strp
= (char *) &TREE_INT_CST_LOW (exp
);
2527 len
= 2 * sizeof TREE_INT_CST_LOW (exp
);
2531 /* Real constants are the same only if the same width of type. */
2532 if (*p
++ != TYPE_PRECISION (TREE_TYPE (exp
)))
2535 strp
= (char *) &TREE_REAL_CST (exp
);
2536 len
= sizeof TREE_REAL_CST (exp
);
2540 if (flag_writable_strings
)
2543 if ((enum machine_mode
) *p
++ != TYPE_MODE (TREE_TYPE (exp
)))
2546 strp
= TREE_STRING_POINTER (exp
);
2547 len
= TREE_STRING_LENGTH (exp
);
2548 if (bcmp ((char *) &TREE_STRING_LENGTH (exp
), p
,
2549 sizeof TREE_STRING_LENGTH (exp
)))
2552 p
+= sizeof TREE_STRING_LENGTH (exp
);
2556 p
= compare_constant_1 (TREE_REALPART (exp
), p
);
2560 return compare_constant_1 (TREE_IMAGPART (exp
), p
);
2563 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2565 int xlen
= len
= int_size_in_bytes (TREE_TYPE (exp
));
2566 unsigned char *tmp
= (unsigned char *) alloca (len
);
2568 get_set_constructor_bytes (exp
, tmp
, len
);
2569 strp
= (char *) tmp
;
2570 if (bcmp ((char *) &xlen
, p
, sizeof xlen
))
2579 int length
= list_length (CONSTRUCTOR_ELTS (exp
));
2581 enum machine_mode mode
= TYPE_MODE (TREE_TYPE (exp
));
2582 int have_purpose
= 0;
2584 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2585 if (TREE_PURPOSE (link
))
2588 if (bcmp ((char *) &length
, p
, sizeof length
))
2593 /* For record constructors, insist that the types match.
2594 For arrays, just verify both constructors are for arrays.
2595 Then insist that either both or none have any TREE_PURPOSE
2597 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2598 type
= TREE_TYPE (exp
);
2602 if (bcmp ((char *) &type
, p
, sizeof type
))
2605 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2607 if (bcmp ((char *) &mode
, p
, sizeof mode
))
2615 if (bcmp ((char *) &have_purpose
, p
, sizeof have_purpose
))
2618 p
+= sizeof have_purpose
;
2620 /* For arrays, insist that the size in bytes match. */
2621 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2623 HOST_WIDE_INT size
= int_size_in_bytes (TREE_TYPE (exp
));
2625 if (bcmp ((char *) &size
, p
, sizeof size
))
2631 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2633 if (TREE_VALUE (link
))
2635 if ((p
= compare_constant_1 (TREE_VALUE (link
), p
)) == 0)
2642 if (bcmp ((char *) &zero
, p
, sizeof zero
))
2648 if (TREE_PURPOSE (link
)
2649 && TREE_CODE (TREE_PURPOSE (link
)) == FIELD_DECL
)
2651 if (bcmp ((char *) &TREE_PURPOSE (link
), p
,
2652 sizeof TREE_PURPOSE (link
)))
2655 p
+= sizeof TREE_PURPOSE (link
);
2657 else if (TREE_PURPOSE (link
))
2659 if ((p
= compare_constant_1 (TREE_PURPOSE (link
), p
)) == 0)
2662 else if (have_purpose
)
2666 if (bcmp ((char *) &zero
, p
, sizeof zero
))
2678 struct addr_const value
;
2680 decode_addr_const (exp
, &value
);
2681 strp
= (char *) &value
.offset
;
2682 len
= sizeof value
.offset
;
2683 /* Compare the offset. */
2685 if (*p
++ != *strp
++)
2688 /* Compare symbol name. */
2689 strp
= XSTR (value
.base
, 0);
2690 len
= strlen (strp
) + 1;
2697 p
= compare_constant_1 (TREE_OPERAND (exp
, 0), p
);
2701 return compare_constant_1 (TREE_OPERAND (exp
, 1), p
);
2705 case NON_LVALUE_EXPR
:
2706 return compare_constant_1 (TREE_OPERAND (exp
, 0), p
);
2712 /* Compare constant contents. */
2714 if (*p
++ != *strp
++)
2720 /* Construct a constant descriptor for the expression EXP.
2721 It is up to the caller to enter the descriptor in the hash table. */
2723 static struct constant_descriptor
*
2724 record_constant (exp
)
2727 struct constant_descriptor
*next
= 0;
2731 /* Make a struct constant_descriptor. The first three pointers will
2732 be filled in later. Here we just leave space for them. */
2734 obstack_grow (&permanent_obstack
, (char *) &next
, sizeof next
);
2735 obstack_grow (&permanent_obstack
, (char *) &label
, sizeof label
);
2736 obstack_grow (&permanent_obstack
, (char *) &rtl
, sizeof rtl
);
2737 record_constant_1 (exp
);
2738 return (struct constant_descriptor
*) obstack_finish (&permanent_obstack
);
2741 /* Add a description of constant expression EXP
2742 to the object growing in `permanent_obstack'.
2743 No need to return its address; the caller will get that
2744 from the obstack when the object is complete. */
2747 record_constant_1 (exp
)
2750 register char *strp
;
2752 register enum tree_code code
= TREE_CODE (exp
);
2754 obstack_1grow (&permanent_obstack
, (unsigned int) code
);
2759 obstack_1grow (&permanent_obstack
, TYPE_PRECISION (TREE_TYPE (exp
)));
2760 strp
= (char *) &TREE_INT_CST_LOW (exp
);
2761 len
= 2 * sizeof TREE_INT_CST_LOW (exp
);
2765 obstack_1grow (&permanent_obstack
, TYPE_PRECISION (TREE_TYPE (exp
)));
2766 strp
= (char *) &TREE_REAL_CST (exp
);
2767 len
= sizeof TREE_REAL_CST (exp
);
2771 if (flag_writable_strings
)
2774 obstack_1grow (&permanent_obstack
, TYPE_MODE (TREE_TYPE (exp
)));
2775 strp
= TREE_STRING_POINTER (exp
);
2776 len
= TREE_STRING_LENGTH (exp
);
2777 obstack_grow (&permanent_obstack
, (char *) &TREE_STRING_LENGTH (exp
),
2778 sizeof TREE_STRING_LENGTH (exp
));
2782 record_constant_1 (TREE_REALPART (exp
));
2783 record_constant_1 (TREE_IMAGPART (exp
));
2787 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2789 int nbytes
= int_size_in_bytes (TREE_TYPE (exp
));
2790 obstack_grow (&permanent_obstack
, &nbytes
, sizeof (nbytes
));
2791 obstack_blank (&permanent_obstack
, nbytes
);
2792 get_set_constructor_bytes
2793 (exp
, (unsigned char *) permanent_obstack
.next_free
-nbytes
,
2800 int length
= list_length (CONSTRUCTOR_ELTS (exp
));
2801 enum machine_mode mode
= TYPE_MODE (TREE_TYPE (exp
));
2803 int have_purpose
= 0;
2805 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2806 if (TREE_PURPOSE (link
))
2809 obstack_grow (&permanent_obstack
, (char *) &length
, sizeof length
);
2811 /* For record constructors, insist that the types match.
2812 For arrays, just verify both constructors are for arrays
2813 of the same mode. Then insist that either both or none
2814 have any TREE_PURPOSE values. */
2815 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2816 type
= TREE_TYPE (exp
);
2820 obstack_grow (&permanent_obstack
, (char *) &type
, sizeof type
);
2821 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2822 obstack_grow (&permanent_obstack
, &mode
, sizeof mode
);
2824 obstack_grow (&permanent_obstack
, (char *) &have_purpose
,
2825 sizeof have_purpose
);
2827 /* For arrays, insist that the size in bytes match. */
2828 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2830 HOST_WIDE_INT size
= int_size_in_bytes (TREE_TYPE (exp
));
2831 obstack_grow (&permanent_obstack
, (char *) &size
, sizeof size
);
2834 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2836 if (TREE_VALUE (link
))
2837 record_constant_1 (TREE_VALUE (link
));
2842 obstack_grow (&permanent_obstack
,
2843 (char *) &zero
, sizeof zero
);
2846 if (TREE_PURPOSE (link
)
2847 && TREE_CODE (TREE_PURPOSE (link
)) == FIELD_DECL
)
2848 obstack_grow (&permanent_obstack
,
2849 (char *) &TREE_PURPOSE (link
),
2850 sizeof TREE_PURPOSE (link
));
2851 else if (TREE_PURPOSE (link
))
2852 record_constant_1 (TREE_PURPOSE (link
));
2853 else if (have_purpose
)
2857 obstack_grow (&permanent_obstack
,
2858 (char *) &zero
, sizeof zero
);
2866 struct addr_const value
;
2868 decode_addr_const (exp
, &value
);
2869 /* Record the offset. */
2870 obstack_grow (&permanent_obstack
,
2871 (char *) &value
.offset
, sizeof value
.offset
);
2873 switch (GET_CODE (value
.base
))
2876 /* Record the symbol name. */
2877 obstack_grow (&permanent_obstack
, XSTR (value
.base
, 0),
2878 strlen (XSTR (value
.base
, 0)) + 1);
2881 /* Record the address of the CODE_LABEL. It may not have
2882 been emitted yet, so it's UID may be zero. But pointer
2883 identity is good enough. */
2884 obstack_grow (&permanent_obstack
, &XEXP (value
.base
, 0),
2896 record_constant_1 (TREE_OPERAND (exp
, 0));
2897 record_constant_1 (TREE_OPERAND (exp
, 1));
2902 case NON_LVALUE_EXPR
:
2903 record_constant_1 (TREE_OPERAND (exp
, 0));
2910 /* Record constant contents. */
2911 obstack_grow (&permanent_obstack
, strp
, len
);
2914 /* Record a list of constant expressions that were passed to
2915 output_constant_def but that could not be output right away. */
2917 struct deferred_constant
2919 struct deferred_constant
*next
;
2925 static struct deferred_constant
*deferred_constants
;
2927 /* Another list of constants which should be output after the
2929 static struct deferred_constant
*after_function_constants
;
2931 /* Nonzero means defer output of addressed subconstants
2932 (i.e., those for which output_constant_def is called.) */
2933 static int defer_addressed_constants_flag
;
2935 /* Start deferring output of subconstants. */
2938 defer_addressed_constants ()
2940 defer_addressed_constants_flag
++;
2943 /* Stop deferring output of subconstants,
2944 and output now all those that have been deferred. */
2947 output_deferred_addressed_constants ()
2949 struct deferred_constant
*p
, *next
;
2951 defer_addressed_constants_flag
--;
2953 if (defer_addressed_constants_flag
> 0)
2956 for (p
= deferred_constants
; p
; p
= next
)
2958 output_constant_def_contents (p
->exp
, p
->reloc
, p
->labelno
);
2963 deferred_constants
= 0;
2966 /* Output any constants which should appear after a function. */
2969 output_after_function_constants ()
2971 struct deferred_constant
*p
, *next
;
2973 for (p
= after_function_constants
; p
; p
= next
)
2975 output_constant_def_contents (p
->exp
, p
->reloc
, p
->labelno
);
2980 after_function_constants
= 0;
2983 /* Make a copy of the whole tree structure for a constant.
2984 This handles the same types of nodes that compare_constant
2985 and record_constant handle. */
2991 switch (TREE_CODE (exp
))
2994 /* For ADDR_EXPR, we do not want to copy the decl whose address
2995 is requested. We do want to copy constants though. */
2996 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, 0))) == 'c')
2997 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2998 copy_constant (TREE_OPERAND (exp
, 0)));
3000 return copy_node (exp
);
3005 return copy_node (exp
);
3008 return build_complex (TREE_TYPE (exp
),
3009 copy_constant (TREE_REALPART (exp
)),
3010 copy_constant (TREE_IMAGPART (exp
)));
3014 return build (TREE_CODE (exp
), TREE_TYPE (exp
),
3015 copy_constant (TREE_OPERAND (exp
, 0)),
3016 copy_constant (TREE_OPERAND (exp
, 1)));
3020 case NON_LVALUE_EXPR
:
3021 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
3022 copy_constant (TREE_OPERAND (exp
, 0)));
3026 tree copy
= copy_node (exp
);
3027 tree list
= copy_list (CONSTRUCTOR_ELTS (exp
));
3030 CONSTRUCTOR_ELTS (copy
) = list
;
3031 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
3032 TREE_VALUE (tail
) = copy_constant (TREE_VALUE (tail
));
3033 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
3034 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
3035 TREE_PURPOSE (tail
) = copy_constant (TREE_PURPOSE (tail
));
3045 /* Return an rtx representing a reference to constant data in memory
3046 for the constant expression EXP.
3048 If assembler code for such a constant has already been output,
3049 return an rtx to refer to it.
3050 Otherwise, output such a constant in memory (or defer it for later)
3051 and generate an rtx for it.
3053 The TREE_CST_RTL of EXP is set up to point to that rtx.
3054 The const_hash_table records which constants already have label strings. */
3057 output_constant_def (exp
)
3061 register struct constant_descriptor
*desc
;
3066 if (TREE_CST_RTL (exp
))
3067 return TREE_CST_RTL (exp
);
3069 /* Make sure any other constants whose addresses appear in EXP
3070 are assigned label numbers. */
3072 reloc
= output_addressed_constants (exp
);
3074 /* Compute hash code of EXP. Search the descriptors for that hash code
3075 to see if any of them describes EXP. If yes, the descriptor records
3076 the label number already assigned. */
3078 hash
= const_hash (exp
) % MAX_HASH_TABLE
;
3080 for (desc
= const_hash_table
[hash
]; desc
; desc
= desc
->next
)
3081 if (compare_constant (exp
, desc
))
3086 /* No constant equal to EXP is known to have been output.
3087 Make a constant descriptor to enter EXP in the hash table.
3088 Assign the label number and record it in the descriptor for
3089 future calls to this function to find. */
3091 /* Create a string containing the label name, in LABEL. */
3092 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
3094 desc
= record_constant (exp
);
3095 desc
->next
= const_hash_table
[hash
];
3096 desc
->label
= ggc_alloc_string (label
, -1);
3097 const_hash_table
[hash
] = desc
;
3099 /* We have a symbol name; construct the SYMBOL_REF and the MEM
3100 in the permanent obstack. We could also construct this in the
3101 obstack of EXP and put it into TREE_CST_RTL, but we have no way
3102 of knowing what obstack it is (e.g., it might be in a function
3103 obstack of a function we are nested inside). */
3105 push_obstacks_nochange ();
3106 end_temporary_allocation ();
3109 = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp
)),
3110 gen_rtx_SYMBOL_REF (Pmode
, desc
->label
));
3112 RTX_UNCHANGING_P (desc
->rtl
) = 1;
3113 if (AGGREGATE_TYPE_P (TREE_TYPE (exp
)))
3114 MEM_SET_IN_STRUCT_P (desc
->rtl
, 1);
3121 TREE_CST_RTL (exp
) = desc
->rtl
;
3123 /* Optionally set flags or add text to the name to record information
3124 such as that it is a function name. If the name is changed, the macro
3125 ASM_OUTPUT_LABELREF will have to know how to strip this information. */
3126 #ifdef ENCODE_SECTION_INFO
3127 ENCODE_SECTION_INFO (exp
);
3130 /* If this is the first time we've seen this particular constant,
3131 output it (or defer its output for later). */
3134 int after_function
= 0;
3136 #ifdef CONSTANT_AFTER_FUNCTION_P
3137 if (current_function_decl
!= 0
3138 && CONSTANT_AFTER_FUNCTION_P (exp
))
3142 if (defer_addressed_constants_flag
|| after_function
)
3144 struct deferred_constant
*p
;
3145 p
= (struct deferred_constant
*) xmalloc (sizeof (struct deferred_constant
));
3147 push_obstacks_nochange ();
3148 suspend_momentary ();
3149 p
->exp
= copy_constant (exp
);
3152 p
->labelno
= const_labelno
++;
3155 p
->next
= after_function_constants
;
3156 after_function_constants
= p
;
3160 p
->next
= deferred_constants
;
3161 deferred_constants
= p
;
3166 /* Do no output if -fsyntax-only. */
3167 if (! flag_syntax_only
)
3168 output_constant_def_contents (exp
, reloc
, const_labelno
);
3173 return TREE_CST_RTL (exp
);
3176 /* Now output assembler code to define the label for EXP,
3177 and follow it with the data of EXP. */
3180 output_constant_def_contents (exp
, reloc
, labelno
)
3187 if (IN_NAMED_SECTION (exp
))
3188 named_section (exp
, NULL
, reloc
);
3191 /* First switch to text section, except for writable strings. */
3192 #ifdef SELECT_SECTION
3193 SELECT_SECTION (exp
, reloc
);
3195 if (((TREE_CODE (exp
) == STRING_CST
) && flag_writable_strings
)
3196 || (flag_pic
&& reloc
))
3199 readonly_data_section ();
3203 /* Align the location counter as required by EXP's data type. */
3204 align
= TYPE_ALIGN (TREE_TYPE (exp
));
3205 #ifdef CONSTANT_ALIGNMENT
3206 align
= CONSTANT_ALIGNMENT (exp
, align
);
3209 if (align
> BITS_PER_UNIT
)
3210 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
3212 /* Output the label itself. */
3213 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LC", labelno
);
3215 /* Output the value of EXP. */
3216 output_constant (exp
,
3217 (TREE_CODE (exp
) == STRING_CST
3218 ? TREE_STRING_LENGTH (exp
)
3219 : int_size_in_bytes (TREE_TYPE (exp
))));
3223 /* Structure to represent sufficient information about a constant so that
3224 it can be output when the constant pool is output, so that function
3225 integration can be done, and to simplify handling on machines that reference
3226 constant pool as base+displacement. */
3228 struct pool_constant
3230 struct constant_descriptor
*desc
;
3231 struct pool_constant
*next
;
3232 enum machine_mode mode
;
3240 /* Structure used to maintain hash table mapping symbols used to their
3241 corresponding constants. */
3246 struct pool_constant
*pool
;
3247 struct pool_sym
*next
;
3250 /* Hash code for a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true.
3251 The argument is XSTR (... , 0) */
3253 #define SYMHASH(LABEL) \
3254 ((((unsigned long) (LABEL)) & ((1 << HASHBITS) - 1)) % MAX_RTX_HASH_TABLE)
3256 /* Initialize constant pool hashing for a new function. */
3259 init_varasm_status (f
)
3262 struct varasm_status
*p
;
3263 p
= (struct varasm_status
*) xmalloc (sizeof (struct varasm_status
));
3265 p
->x_const_rtx_hash_table
3266 = ((struct constant_descriptor
**)
3267 xmalloc (MAX_RTX_HASH_TABLE
* sizeof (struct constant_descriptor
*)));
3268 p
->x_const_rtx_sym_hash_table
3269 = ((struct pool_sym
**)
3270 xmalloc (MAX_RTX_HASH_TABLE
* sizeof (struct pool_sym
*)));
3271 bzero ((char *) p
->x_const_rtx_hash_table
,
3272 MAX_RTX_HASH_TABLE
* sizeof (struct constant_descriptor
*));
3273 bzero ((char *) p
->x_const_rtx_sym_hash_table
,
3274 MAX_RTX_HASH_TABLE
* sizeof (struct pool_sym
*));
3276 p
->x_first_pool
= p
->x_last_pool
= 0;
3277 p
->x_pool_offset
= 0;
3278 p
->x_const_double_chain
= 0;
3281 /* Mark PC for GC. */
3284 mark_pool_constant (pc
)
3285 struct pool_constant
*pc
;
3289 ggc_mark_rtx (pc
->constant
);
3294 /* Mark PPS for GC. */
3297 mark_pool_sym_hash_table (pps
)
3298 struct pool_sym
**pps
;
3300 struct pool_sym
*ps
;
3303 for (i
= 0; i
< MAX_RTX_HASH_TABLE
; ++i
)
3304 for (ps
= pps
[i
]; ps
; ps
= ps
->next
)
3305 ggc_mark_string (ps
->label
);
3308 /* Mark P for GC. */
3311 mark_varasm_status (p
)
3312 struct varasm_status
*p
;
3317 mark_pool_constant (p
->x_first_pool
);
3318 mark_pool_sym_hash_table (p
->x_const_rtx_sym_hash_table
);
3319 ggc_mark_rtx (p
->x_const_double_chain
);
3322 /* Clear out all parts of the state in F that can safely be discarded
3323 after the function has been compiled, to let garbage collection
3324 reclaim the memory. */
3327 free_varasm_status (f
)
3330 struct varasm_status
*p
;
3333 free (p
->x_const_rtx_hash_table
);
3334 free (p
->x_const_rtx_sym_hash_table
);
3339 enum kind
{ RTX_DOUBLE
, RTX_INT
};
3343 #ifdef ONLY_INT_FIELDS
3344 unsigned int kind
: 16;
3345 unsigned int mode
: 16;
3347 enum kind kind
: 16;
3348 enum machine_mode mode
: 16;
3351 union real_extract du
;
3352 struct addr_const addr
;
3353 struct {HOST_WIDE_INT high
, low
;} di
;
3357 /* Express an rtx for a constant integer (perhaps symbolic)
3358 as the sum of a symbol or label plus an explicit integer.
3359 They are stored into VALUE. */
3362 decode_rtx_const (mode
, x
, value
)
3363 enum machine_mode mode
;
3365 struct rtx_const
*value
;
3367 /* Clear the whole structure, including any gaps. */
3370 int *p
= (int *) value
;
3371 int *end
= (int *) (value
+ 1);
3376 value
->kind
= RTX_INT
; /* Most usual kind. */
3379 switch (GET_CODE (x
))
3382 value
->kind
= RTX_DOUBLE
;
3383 if (GET_MODE (x
) != VOIDmode
)
3385 value
->mode
= GET_MODE (x
);
3386 bcopy ((char *) &CONST_DOUBLE_LOW (x
),
3387 (char *) &value
->un
.du
, sizeof value
->un
.du
);
3391 value
->un
.di
.low
= CONST_DOUBLE_LOW (x
);
3392 value
->un
.di
.high
= CONST_DOUBLE_HIGH (x
);
3397 value
->un
.addr
.offset
= INTVAL (x
);
3403 value
->un
.addr
.base
= x
;
3408 if (GET_CODE (x
) == PLUS
)
3410 value
->un
.addr
.base
= XEXP (x
, 0);
3411 if (GET_CODE (XEXP (x
, 1)) != CONST_INT
)
3413 value
->un
.addr
.offset
= INTVAL (XEXP (x
, 1));
3415 else if (GET_CODE (x
) == MINUS
)
3417 value
->un
.addr
.base
= XEXP (x
, 0);
3418 if (GET_CODE (XEXP (x
, 1)) != CONST_INT
)
3420 value
->un
.addr
.offset
= - INTVAL (XEXP (x
, 1));
3430 if (value
->kind
== RTX_INT
&& value
->un
.addr
.base
!= 0)
3431 switch (GET_CODE (value
->un
.addr
.base
))
3434 /* Use the string's address, not the SYMBOL_REF's address,
3435 for the sake of addresses of library routines. */
3436 value
->un
.addr
.base
= (rtx
) XSTR (value
->un
.addr
.base
, 0);
3440 /* For a LABEL_REF, compare labels. */
3441 value
->un
.addr
.base
= XEXP (value
->un
.addr
.base
, 0);
3448 /* Given a MINUS expression, simplify it if both sides
3449 include the same symbol. */
3452 simplify_subtraction (x
)
3455 struct rtx_const val0
, val1
;
3457 decode_rtx_const (GET_MODE (x
), XEXP (x
, 0), &val0
);
3458 decode_rtx_const (GET_MODE (x
), XEXP (x
, 1), &val1
);
3460 if (val0
.un
.addr
.base
== val1
.un
.addr
.base
)
3461 return GEN_INT (val0
.un
.addr
.offset
- val1
.un
.addr
.offset
);
3465 /* Compute a hash code for a constant RTL expression. */
3468 const_hash_rtx (mode
, x
)
3469 enum machine_mode mode
;
3475 struct rtx_const value
;
3476 decode_rtx_const (mode
, x
, &value
);
3478 /* Compute hashing function */
3480 for (i
= 0; i
< sizeof value
/ sizeof (int); i
++)
3481 hi
+= ((int *) &value
)[i
];
3483 hi
&= (1 << HASHBITS
) - 1;
3484 hi
%= MAX_RTX_HASH_TABLE
;
3488 /* Compare a constant rtl object X with a constant-descriptor DESC.
3489 Return 1 if DESC describes a constant with the same value as X. */
3492 compare_constant_rtx (mode
, x
, desc
)
3493 enum machine_mode mode
;
3495 struct constant_descriptor
*desc
;
3497 register int *p
= (int *) desc
->contents
;
3500 struct rtx_const value
;
3502 decode_rtx_const (mode
, x
, &value
);
3503 strp
= (int *) &value
;
3504 len
= sizeof value
/ sizeof (int);
3506 /* Compare constant contents. */
3508 if (*p
++ != *strp
++)
3514 /* Construct a constant descriptor for the rtl-expression X.
3515 It is up to the caller to enter the descriptor in the hash table. */
3517 static struct constant_descriptor
*
3518 record_constant_rtx (mode
, x
)
3519 enum machine_mode mode
;
3522 struct constant_descriptor
*ptr
;
3525 struct rtx_const value
;
3527 decode_rtx_const (mode
, x
, &value
);
3529 /* Put these things in the saveable obstack so we can ensure it won't
3530 be freed if we are called from combine or some other phase that discards
3531 memory allocated from function_obstack (current_obstack). */
3532 obstack_grow (saveable_obstack
, &ptr
, sizeof ptr
);
3533 obstack_grow (saveable_obstack
, &label
, sizeof label
);
3534 obstack_grow (saveable_obstack
, &rtl
, sizeof rtl
);
3536 /* Record constant contents. */
3537 obstack_grow (saveable_obstack
, &value
, sizeof value
);
3539 return (struct constant_descriptor
*) obstack_finish (saveable_obstack
);
3542 /* Given a constant rtx X, make (or find) a memory constant for its value
3543 and return a MEM rtx to refer to it in memory. */
3546 force_const_mem (mode
, x
)
3547 enum machine_mode mode
;
3551 register struct constant_descriptor
*desc
;
3556 /* If we want this CONST_DOUBLE in the same mode as it is in memory
3557 (this will always be true for floating CONST_DOUBLEs that have been
3558 placed in memory, but not for VOIDmode (integer) CONST_DOUBLEs),
3559 use the previous copy. Otherwise, make a new one. Note that in
3560 the unlikely event that this same CONST_DOUBLE is used in two different
3561 modes in an alternating fashion, we will allocate a lot of different
3562 memory locations, but this should be extremely rare. */
3564 if (GET_CODE (x
) == CONST_DOUBLE
3565 && GET_CODE (CONST_DOUBLE_MEM (x
)) == MEM
3566 && GET_MODE (CONST_DOUBLE_MEM (x
)) == mode
)
3567 return CONST_DOUBLE_MEM (x
);
3569 /* Compute hash code of X. Search the descriptors for that hash code
3570 to see if any of them describes X. If yes, the descriptor records
3571 the label number already assigned. */
3573 hash
= const_hash_rtx (mode
, x
);
3575 for (desc
= const_rtx_hash_table
[hash
]; desc
; desc
= desc
->next
)
3576 if (compare_constant_rtx (mode
, x
, desc
))
3578 found
= desc
->label
;
3584 register struct pool_constant
*pool
;
3585 register struct pool_sym
*sym
;
3588 /* No constant equal to X is known to have been output.
3589 Make a constant descriptor to enter X in the hash table.
3590 Assign the label number and record it in the descriptor for
3591 future calls to this function to find. */
3593 desc
= record_constant_rtx (mode
, x
);
3594 desc
->next
= const_rtx_hash_table
[hash
];
3595 const_rtx_hash_table
[hash
] = desc
;
3597 /* Align the location counter as required by EXP's data type. */
3598 align
= (mode
== VOIDmode
) ? UNITS_PER_WORD
: GET_MODE_SIZE (mode
);
3599 if (align
> BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
3600 align
= BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
;
3601 #ifdef CONSTANT_ALIGNMENT
3602 align
= CONSTANT_ALIGNMENT (make_tree (type_for_mode (mode
, 0), x
),
3603 align
* BITS_PER_UNIT
) / BITS_PER_UNIT
;
3606 pool_offset
+= align
- 1;
3607 pool_offset
&= ~ (align
- 1);
3609 /* If RTL is not being placed into the saveable obstack, make a
3610 copy of X that is in the saveable obstack in case we are
3611 being called from combine or some other phase that discards
3612 memory it allocates. We used to only do this if it is a
3613 CONST; however, reload can allocate a CONST_INT when
3614 eliminating registers. */
3615 if (rtl_obstack
!= saveable_obstack
3616 && (GET_CODE (x
) == CONST
|| GET_CODE (x
) == CONST_INT
))
3618 push_obstacks_nochange ();
3619 rtl_in_saveable_obstack ();
3621 if (GET_CODE (x
) == CONST
)
3622 x
= gen_rtx_CONST (GET_MODE (x
),
3623 gen_rtx_PLUS (GET_MODE (x
),
3624 XEXP (XEXP (x
, 0), 0),
3625 XEXP (XEXP (x
, 0), 1)));
3627 x
= GEN_INT (INTVAL (x
));
3632 /* Allocate a pool constant descriptor, fill it in, and chain it in. */
3634 pool
= (struct pool_constant
*) savealloc (sizeof (struct pool_constant
));
3638 pool
->labelno
= const_labelno
;
3639 pool
->align
= align
;
3640 pool
->offset
= pool_offset
;
3647 last_pool
->next
= pool
;
3650 pool_offset
+= GET_MODE_SIZE (mode
);
3652 /* Create a string containing the label name, in LABEL. */
3653 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
3657 desc
->label
= found
= ggc_alloc_string (label
, -1);
3659 /* Add label to symbol hash table. */
3660 hash
= SYMHASH (found
);
3661 sym
= (struct pool_sym
*) savealloc (sizeof (struct pool_sym
));
3664 sym
->next
= const_rtx_sym_hash_table
[hash
];
3665 const_rtx_sym_hash_table
[hash
] = sym
;
3668 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
3670 def
= gen_rtx_MEM (mode
, gen_rtx_SYMBOL_REF (Pmode
, found
));
3672 RTX_UNCHANGING_P (def
) = 1;
3673 /* Mark the symbol_ref as belonging to this constants pool. */
3674 CONSTANT_POOL_ADDRESS_P (XEXP (def
, 0)) = 1;
3675 current_function_uses_const_pool
= 1;
3677 if (GET_CODE (x
) == CONST_DOUBLE
)
3679 if (CONST_DOUBLE_MEM (x
) == cc0_rtx
)
3681 CONST_DOUBLE_CHAIN (x
) = const_double_chain
;
3682 const_double_chain
= x
;
3684 CONST_DOUBLE_MEM (x
) = def
;
3690 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
3691 the corresponding pool_constant structure. */
3693 static struct pool_constant
*
3694 find_pool_constant (f
, addr
)
3698 struct pool_sym
*sym
;
3699 const char *label
= XSTR (addr
, 0);
3701 for (sym
= f
->varasm
->x_const_rtx_sym_hash_table
[SYMHASH (label
)]; sym
;
3703 if (sym
->label
== label
)
3709 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
3712 get_pool_constant (addr
)
3715 return (find_pool_constant (cfun
, addr
))->constant
;
3718 /* Likewise, but for the constant pool of a specific function. */
3721 get_pool_constant_for_function (f
, addr
)
3725 return (find_pool_constant (f
, addr
))->constant
;
3728 /* Similar, return the mode. */
3731 get_pool_mode (addr
)
3734 return (find_pool_constant (cfun
, addr
))->mode
;
3738 get_pool_mode_for_function (f
, addr
)
3742 return (find_pool_constant (f
, addr
))->mode
;
3745 /* Similar, return the offset in the constant pool. */
3748 get_pool_offset (addr
)
3751 return (find_pool_constant (cfun
, addr
))->offset
;
3754 /* Return the size of the constant pool. */
3762 /* Write all the constants in the constant pool. */
3765 output_constant_pool (fnname
, fndecl
)
3766 const char *fnname ATTRIBUTE_UNUSED
;
3767 tree fndecl ATTRIBUTE_UNUSED
;
3769 struct pool_constant
*pool
;
3771 union real_extract u
;
3773 /* It is possible for gcc to call force_const_mem and then to later
3774 discard the instructions which refer to the constant. In such a
3775 case we do not need to output the constant. */
3776 mark_constant_pool ();
3778 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3779 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3782 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3791 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3792 whose CODE_LABEL has been deleted. This can occur if a jump table
3793 is eliminated by optimization. If so, write a constant of zero
3794 instead. Note that this can also happen by turning the
3795 CODE_LABEL into a NOTE. */
3796 /* ??? This seems completely and utterly wrong. Certainly it's
3797 not true for NOTE_INSN_DELETED_LABEL, but I disbelieve proper
3798 functioning even with INSN_DELETED_P and friends. */
3801 switch (GET_CODE (x
))
3804 if (GET_CODE (XEXP (x
, 0)) != PLUS
3805 || GET_CODE (XEXP (XEXP (x
, 0), 0)) != LABEL_REF
)
3807 tmp
= XEXP (XEXP (x
, 0), 0);
3812 if (INSN_DELETED_P (tmp
)
3813 || (GET_CODE (tmp
) == NOTE
3814 && NOTE_LINE_NUMBER (tmp
) == NOTE_INSN_DELETED
))
3825 /* First switch to correct section. */
3826 #ifdef SELECT_RTX_SECTION
3827 SELECT_RTX_SECTION (pool
->mode
, x
);
3829 readonly_data_section ();
3832 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3833 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file
, x
, pool
->mode
,
3834 pool
->align
, pool
->labelno
, done
);
3837 if (pool
->align
> 1)
3838 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (pool
->align
));
3840 /* Output the label. */
3841 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LC", pool
->labelno
);
3843 /* Output the value of the constant itself. */
3844 switch (GET_MODE_CLASS (pool
->mode
))
3847 if (GET_CODE (x
) != CONST_DOUBLE
)
3850 bcopy ((char *) &CONST_DOUBLE_LOW (x
), (char *) &u
, sizeof u
);
3851 assemble_real (u
.d
, pool
->mode
);
3855 case MODE_PARTIAL_INT
:
3856 assemble_integer (x
, GET_MODE_SIZE (pool
->mode
), 1);
3863 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3869 #ifdef ASM_OUTPUT_POOL_EPILOGUE
3870 ASM_OUTPUT_POOL_EPILOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3873 /* Done with this pool. */
3874 first_pool
= last_pool
= 0;
3877 /* Look through the instructions for this function, and mark all the
3878 entries in the constant pool which are actually being used. */
3881 mark_constant_pool ()
3884 struct pool_constant
*pool
;
3886 if (first_pool
== 0)
3889 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3892 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
3893 if (GET_RTX_CLASS (GET_CODE (insn
)) == 'i')
3894 mark_constants (PATTERN (insn
));
3896 for (insn
= current_function_epilogue_delay_list
;
3898 insn
= XEXP (insn
, 1))
3899 if (GET_RTX_CLASS (GET_CODE (insn
)) == 'i')
3900 mark_constants (PATTERN (insn
));
3902 /* It's possible that the only reference to a symbol is in a symbol
3903 that's in the constant pool. This happens in Fortran under some
3904 situations. (When the constant contains the address of another
3905 constant, and only the first is used directly in an insn.)
3906 This is potentially suboptimal if there's ever a possibility of
3907 backwards (in pool order) 2'd level references. However, it's
3908 not clear that 2'd level references can happen. */
3909 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3911 struct pool_sym
*sym
;
3914 /* skip unmarked entries; no insn refers to them. */
3918 /* Skip everything except SYMBOL_REFs. */
3919 if (GET_CODE (pool
->constant
) != SYMBOL_REF
)
3921 label
= XSTR (pool
->constant
, 0);
3923 /* Be sure the symbol's value is marked. */
3924 for (sym
= const_rtx_sym_hash_table
[SYMHASH (label
)]; sym
;
3926 if (sym
->label
== label
)
3927 sym
->pool
->mark
= 1;
3928 /* If we didn't find it, there's something truly wrong here, but it
3929 will be announced by the assembler. */
3938 register const char *format_ptr
;
3943 if (GET_CODE (x
) == SYMBOL_REF
)
3945 if (CONSTANT_POOL_ADDRESS_P (x
))
3946 find_pool_constant (cfun
, x
)->mark
= 1;
3949 /* Never search inside a CONST_DOUBLE, because CONST_DOUBLE_MEM may be
3950 a MEM, but does not constitute a use of that MEM. */
3951 else if (GET_CODE (x
) == CONST_DOUBLE
)
3954 /* Insns may appear inside a SEQUENCE. Only check the patterns of
3955 insns, not any notes that may be attached. We don't want to mark
3956 a constant just because it happens to appear in a REG_EQUIV note. */
3957 if (GET_RTX_CLASS (GET_CODE (x
)) == 'i')
3959 mark_constants (PATTERN (x
));
3963 format_ptr
= GET_RTX_FORMAT (GET_CODE (x
));
3965 for (i
= 0; i
< GET_RTX_LENGTH (GET_CODE (x
)); i
++)
3967 switch (*format_ptr
++)
3970 mark_constants (XEXP (x
, i
));
3974 if (XVEC (x
, i
) != 0)
3978 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
3979 mark_constants (XVECEXP (x
, i
, j
));
3998 /* Find all the constants whose addresses are referenced inside of EXP,
3999 and make sure assembler code with a label has been output for each one.
4000 Indicate whether an ADDR_EXPR has been encountered. */
4003 output_addressed_constants (exp
)
4008 switch (TREE_CODE (exp
))
4012 register tree constant
= TREE_OPERAND (exp
, 0);
4014 while (TREE_CODE (constant
) == COMPONENT_REF
)
4016 constant
= TREE_OPERAND (constant
, 0);
4019 if (TREE_CODE_CLASS (TREE_CODE (constant
)) == 'c'
4020 || TREE_CODE (constant
) == CONSTRUCTOR
)
4021 /* No need to do anything here
4022 for addresses of variables or functions. */
4023 output_constant_def (constant
);
4030 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
4031 reloc
|= output_addressed_constants (TREE_OPERAND (exp
, 1));
4036 case NON_LVALUE_EXPR
:
4037 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
4043 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
4044 if (TREE_VALUE (link
) != 0)
4045 reloc
|= output_addressed_constants (TREE_VALUE (link
));
4055 /* Return nonzero if VALUE is a valid constant-valued expression
4056 for use in initializing a static variable; one that can be an
4057 element of a "constant" initializer.
4059 Return null_pointer_node if the value is absolute;
4060 if it is relocatable, return the variable that determines the relocation.
4061 We assume that VALUE has been folded as much as possible;
4062 therefore, we do not need to check for such things as
4063 arithmetic-combinations of integers. */
4066 initializer_constant_valid_p (value
, endtype
)
4070 /* Give the front-end a chance to convert VALUE to something that
4071 looks more like a constant to the back-end. */
4072 if (lang_expand_constant
)
4073 value
= (*lang_expand_constant
) (value
);
4075 switch (TREE_CODE (value
))
4078 if ((TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
4079 || TREE_CODE (TREE_TYPE (value
)) == RECORD_TYPE
)
4080 && TREE_CONSTANT (value
)
4081 && CONSTRUCTOR_ELTS (value
))
4083 initializer_constant_valid_p (TREE_VALUE (CONSTRUCTOR_ELTS (value
)),
4086 return TREE_STATIC (value
) ? null_pointer_node
: 0;
4092 return null_pointer_node
;
4095 return staticp (TREE_OPERAND (value
, 0)) ? TREE_OPERAND (value
, 0) : 0;
4097 case NON_LVALUE_EXPR
:
4098 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
4102 /* Allow conversions between pointer types. */
4103 if (POINTER_TYPE_P (TREE_TYPE (value
))
4104 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
4105 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
4107 /* Allow conversions between real types. */
4108 if (FLOAT_TYPE_P (TREE_TYPE (value
))
4109 && FLOAT_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
4110 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
4112 /* Allow length-preserving conversions between integer types. */
4113 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
4114 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
4115 && (TYPE_PRECISION (TREE_TYPE (value
))
4116 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
4117 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
4119 /* Allow conversions between other integer types only if
4121 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
4122 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
4124 tree inner
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4126 if (inner
== null_pointer_node
)
4127 return null_pointer_node
;
4131 /* Allow (int) &foo provided int is as wide as a pointer. */
4132 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
4133 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
4134 && (TYPE_PRECISION (TREE_TYPE (value
))
4135 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
4136 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4139 /* Likewise conversions from int to pointers, but also allow
4140 conversions from 0. */
4141 if (POINTER_TYPE_P (TREE_TYPE (value
))
4142 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
4144 if (integer_zerop (TREE_OPERAND (value
, 0)))
4145 return null_pointer_node
;
4146 else if (TYPE_PRECISION (TREE_TYPE (value
))
4147 <= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0))))
4148 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4152 /* Allow conversions to union types if the value inside is okay. */
4153 if (TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
)
4154 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4159 if (! INTEGRAL_TYPE_P (endtype
)
4160 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
4162 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4164 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
4166 /* If either term is absolute, use the other terms relocation. */
4167 if (valid0
== null_pointer_node
)
4169 if (valid1
== null_pointer_node
)
4175 if (! INTEGRAL_TYPE_P (endtype
)
4176 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
4178 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4180 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
4182 /* Win if second argument is absolute. */
4183 if (valid1
== null_pointer_node
)
4185 /* Win if both arguments have the same relocation.
4186 Then the value is absolute. */
4187 if (valid0
== valid1
&& valid0
!= 0)
4188 return null_pointer_node
;
4191 /* Support differences between labels. */
4192 if (INTEGRAL_TYPE_P (endtype
))
4195 op0
= TREE_OPERAND (value
, 0);
4196 op1
= TREE_OPERAND (value
, 1);
4200 if (TREE_CODE (op0
) == ADDR_EXPR
4201 && TREE_CODE (TREE_OPERAND (op0
, 0)) == LABEL_DECL
4202 && TREE_CODE (op1
) == ADDR_EXPR
4203 && TREE_CODE (TREE_OPERAND (op1
, 0)) == LABEL_DECL
)
4204 return null_pointer_node
;
4215 /* Output assembler code for constant EXP to FILE, with no label.
4216 This includes the pseudo-op such as ".int" or ".byte", and a newline.
4217 Assumes output_addressed_constants has been done on EXP already.
4219 Generate exactly SIZE bytes of assembler data, padding at the end
4220 with zeros if necessary. SIZE must always be specified.
4222 SIZE is important for structure constructors,
4223 since trailing members may have been omitted from the constructor.
4224 It is also important for initialization of arrays from string constants
4225 since the full length of the string constant might not be wanted.
4226 It is also needed for initialization of unions, where the initializer's
4227 type is just one member, and that may not be as long as the union.
4229 There a case in which we would fail to output exactly SIZE bytes:
4230 for a structure constructor that wants to produce more than SIZE bytes.
4231 But such constructors will never be generated for any possible input. */
4234 output_constant (exp
, size
)
4238 register enum tree_code code
= TREE_CODE (TREE_TYPE (exp
));
4240 /* Some front-ends use constants other than the standard
4241 language-indepdent varieties, but which may still be output
4242 directly. Give the front-end a chance to convert EXP to a
4243 language-independent representation. */
4244 if (lang_expand_constant
)
4245 exp
= (*lang_expand_constant
) (exp
);
4247 if (size
== 0 || flag_syntax_only
)
4250 /* Eliminate the NON_LVALUE_EXPR_EXPR that makes a cast not be an lvalue.
4251 That way we get the constant (we hope) inside it. Also, strip off any
4252 NOP_EXPR that converts between two record, union, array, or set types
4253 or a CONVERT_EXPR that converts to a union TYPE. */
4254 while ((TREE_CODE (exp
) == NOP_EXPR
4255 && (TREE_TYPE (exp
) == TREE_TYPE (TREE_OPERAND (exp
, 0))
4256 || AGGREGATE_TYPE_P (TREE_TYPE (exp
))))
4257 || (TREE_CODE (exp
) == CONVERT_EXPR
4258 && code
== UNION_TYPE
)
4259 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
4261 exp
= TREE_OPERAND (exp
, 0);
4262 code
= TREE_CODE (TREE_TYPE (exp
));
4265 /* Allow a constructor with no elements for any data type.
4266 This means to fill the space with zeros. */
4267 if (TREE_CODE (exp
) == CONSTRUCTOR
&& CONSTRUCTOR_ELTS (exp
) == 0)
4269 assemble_zeros (size
);
4280 case REFERENCE_TYPE
:
4281 /* ??? What about (int)((float)(int)&foo + 4) */
4282 while (TREE_CODE (exp
) == NOP_EXPR
|| TREE_CODE (exp
) == CONVERT_EXPR
4283 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
4284 exp
= TREE_OPERAND (exp
, 0);
4286 if (! assemble_integer (expand_expr (exp
, NULL_RTX
, VOIDmode
,
4287 EXPAND_INITIALIZER
),
4289 error ("initializer for integer value is too complicated");
4294 if (TREE_CODE (exp
) != REAL_CST
)
4295 error ("initializer for floating value is not a floating constant");
4297 assemble_real (TREE_REAL_CST (exp
),
4298 mode_for_size (size
* BITS_PER_UNIT
, MODE_FLOAT
, 0));
4303 output_constant (TREE_REALPART (exp
), size
/ 2);
4304 output_constant (TREE_IMAGPART (exp
), size
/ 2);
4305 size
-= (size
/ 2) * 2;
4309 if (TREE_CODE (exp
) == CONSTRUCTOR
)
4311 output_constructor (exp
, size
);
4314 else if (TREE_CODE (exp
) == STRING_CST
)
4318 if (size
> TREE_STRING_LENGTH (exp
))
4320 excess
= size
- TREE_STRING_LENGTH (exp
);
4321 size
= TREE_STRING_LENGTH (exp
);
4324 assemble_string (TREE_STRING_POINTER (exp
), size
);
4333 if (TREE_CODE (exp
) == CONSTRUCTOR
)
4334 output_constructor (exp
, size
);
4340 if (TREE_CODE (exp
) == INTEGER_CST
)
4341 assemble_integer (expand_expr (exp
, NULL_RTX
,
4342 VOIDmode
, EXPAND_INITIALIZER
),
4344 else if (TREE_CODE (exp
) == CONSTRUCTOR
)
4346 unsigned char *buffer
= (unsigned char *) alloca (size
);
4347 if (get_set_constructor_bytes (exp
, buffer
, size
))
4349 assemble_string ((char *) buffer
, size
);
4352 error ("unknown set constructor type");
4360 assemble_zeros (size
);
4364 /* Subroutine of output_constant, used for CONSTRUCTORs
4365 (aggregate constants).
4366 Generate at least SIZE bytes, padding if necessary. */
4369 output_constructor (exp
, size
)
4373 register tree link
, field
= 0;
4374 HOST_WIDE_INT min_index
= 0;
4375 /* Number of bytes output or skipped so far.
4376 In other words, current position within the constructor. */
4377 int total_bytes
= 0;
4378 /* Non-zero means BYTE contains part of a byte, to be output. */
4379 int byte_buffer_in_use
= 0;
4380 register int byte
= 0;
4382 if (HOST_BITS_PER_WIDE_INT
< BITS_PER_UNIT
)
4385 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
4386 field
= TYPE_FIELDS (TREE_TYPE (exp
));
4388 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
4389 && TYPE_DOMAIN (TREE_TYPE (exp
)) != 0)
4391 = TREE_INT_CST_LOW (TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (exp
))));
4393 /* As LINK goes through the elements of the constant,
4394 FIELD goes through the structure fields, if the constant is a structure.
4395 if the constant is a union, then we override this,
4396 by getting the field from the TREE_LIST element.
4397 But the constant could also be an array. Then FIELD is zero.
4399 There is always a maximum of one element in the chain LINK for unions
4400 (even if the initializer in a source program incorrectly contains
4402 for (link
= CONSTRUCTOR_ELTS (exp
);
4404 link
= TREE_CHAIN (link
),
4405 field
= field
? TREE_CHAIN (field
) : 0)
4407 tree val
= TREE_VALUE (link
);
4410 /* the element in a union constructor specifies the proper field. */
4412 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
4413 || TREE_CODE (TREE_TYPE (exp
)) == UNION_TYPE
)
4415 /* if available, use the type given by link */
4416 if (TREE_PURPOSE (link
) != 0)
4417 field
= TREE_PURPOSE (link
);
4420 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
4421 index
= TREE_PURPOSE (link
);
4423 /* Eliminate the marker that makes a cast not be an lvalue. */
4427 if (index
&& TREE_CODE (index
) == RANGE_EXPR
)
4429 register int fieldsize
4430 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (exp
)));
4431 HOST_WIDE_INT lo_index
= TREE_INT_CST_LOW (TREE_OPERAND (index
, 0));
4432 HOST_WIDE_INT hi_index
= TREE_INT_CST_LOW (TREE_OPERAND (index
, 1));
4433 HOST_WIDE_INT index
;
4434 for (index
= lo_index
; index
<= hi_index
; index
++)
4436 /* Output the element's initial value. */
4438 assemble_zeros (fieldsize
);
4440 output_constant (val
, fieldsize
);
4442 /* Count its size. */
4443 total_bytes
+= fieldsize
;
4446 else if (field
== 0 || !DECL_BIT_FIELD (field
))
4448 /* An element that is not a bit-field. */
4450 register int fieldsize
;
4451 /* Since this structure is static,
4452 we know the positions are constant. */
4453 HOST_WIDE_INT bitpos
= field
? int_byte_position (field
) : 0;
4457 = (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (val
)), 1)
4458 * (tree_low_cst (index
, 0) - min_index
));
4460 /* Output any buffered-up bit-fields preceding this element. */
4461 if (byte_buffer_in_use
)
4463 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4465 byte_buffer_in_use
= 0;
4468 /* Advance to offset of this element.
4469 Note no alignment needed in an array, since that is guaranteed
4470 if each element has the proper size. */
4471 if ((field
!= 0 || index
!= 0) && bitpos
!= total_bytes
)
4473 assemble_zeros (bitpos
- total_bytes
);
4474 total_bytes
= bitpos
;
4477 /* Determine size this element should occupy. */
4480 if (TREE_CODE (DECL_SIZE_UNIT (field
)) != INTEGER_CST
)
4483 fieldsize
= TREE_INT_CST_LOW (DECL_SIZE_UNIT (field
));
4486 fieldsize
= int_size_in_bytes (TREE_TYPE (TREE_TYPE (exp
)));
4488 /* Output the element's initial value. */
4490 assemble_zeros (fieldsize
);
4492 output_constant (val
, fieldsize
);
4494 /* Count its size. */
4495 total_bytes
+= fieldsize
;
4497 else if (val
!= 0 && TREE_CODE (val
) != INTEGER_CST
)
4498 error ("invalid initial value for member `%s'",
4499 IDENTIFIER_POINTER (DECL_NAME (field
)));
4502 /* Element that is a bit-field. */
4504 HOST_WIDE_INT next_offset
= int_bit_position (field
);
4505 HOST_WIDE_INT end_offset
4506 = (next_offset
+ tree_low_cst (DECL_SIZE (field
), 1));
4509 val
= integer_zero_node
;
4511 /* If this field does not start in this (or, next) byte,
4513 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4515 /* Output remnant of any bit field in previous bytes. */
4516 if (byte_buffer_in_use
)
4518 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4520 byte_buffer_in_use
= 0;
4523 /* If still not at proper byte, advance to there. */
4524 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4526 assemble_zeros (next_offset
/ BITS_PER_UNIT
- total_bytes
);
4527 total_bytes
= next_offset
/ BITS_PER_UNIT
;
4531 if (! byte_buffer_in_use
)
4534 /* We must split the element into pieces that fall within
4535 separate bytes, and combine each byte with previous or
4536 following bit-fields. */
4538 /* next_offset is the offset n fbits from the beginning of
4539 the structure to the next bit of this element to be processed.
4540 end_offset is the offset of the first bit past the end of
4542 while (next_offset
< end_offset
)
4546 HOST_WIDE_INT value
;
4547 int next_byte
= next_offset
/ BITS_PER_UNIT
;
4548 int next_bit
= next_offset
% BITS_PER_UNIT
;
4550 /* Advance from byte to byte
4551 within this element when necessary. */
4552 while (next_byte
!= total_bytes
)
4554 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4559 /* Number of bits we can process at once
4560 (all part of the same byte). */
4561 this_time
= MIN (end_offset
- next_offset
,
4562 BITS_PER_UNIT
- next_bit
);
4563 if (BYTES_BIG_ENDIAN
)
4565 /* On big-endian machine, take the most significant bits
4566 first (of the bits that are significant)
4567 and put them into bytes from the most significant end. */
4568 shift
= end_offset
- next_offset
- this_time
;
4569 /* Don't try to take a bunch of bits that cross
4570 the word boundary in the INTEGER_CST. We can
4571 only select bits from the LOW or HIGH part
4573 if (shift
< HOST_BITS_PER_WIDE_INT
4574 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4576 this_time
= shift
+ this_time
- HOST_BITS_PER_WIDE_INT
;
4577 shift
= HOST_BITS_PER_WIDE_INT
;
4580 /* Now get the bits from the appropriate constant word. */
4581 if (shift
< HOST_BITS_PER_WIDE_INT
)
4583 value
= TREE_INT_CST_LOW (val
);
4585 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4587 value
= TREE_INT_CST_HIGH (val
);
4588 shift
-= HOST_BITS_PER_WIDE_INT
;
4592 /* Get the result. This works only when:
4593 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4594 byte
|= (((value
>> shift
)
4595 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4596 << (BITS_PER_UNIT
- this_time
- next_bit
));
4600 /* On little-endian machines,
4601 take first the least significant bits of the value
4602 and pack them starting at the least significant
4603 bits of the bytes. */
4604 shift
= next_offset
- int_bit_position (field
);
4606 /* Don't try to take a bunch of bits that cross
4607 the word boundary in the INTEGER_CST. We can
4608 only select bits from the LOW or HIGH part
4610 if (shift
< HOST_BITS_PER_WIDE_INT
4611 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4612 this_time
= (HOST_BITS_PER_WIDE_INT
- shift
);
4614 /* Now get the bits from the appropriate constant word. */
4615 if (shift
< HOST_BITS_PER_WIDE_INT
)
4616 value
= TREE_INT_CST_LOW (val
);
4617 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4619 value
= TREE_INT_CST_HIGH (val
);
4620 shift
-= HOST_BITS_PER_WIDE_INT
;
4625 /* Get the result. This works only when:
4626 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4627 byte
|= (((value
>> shift
)
4628 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4631 next_offset
+= this_time
;
4632 byte_buffer_in_use
= 1;
4636 if (byte_buffer_in_use
)
4638 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4641 if (total_bytes
< size
)
4642 assemble_zeros (size
- total_bytes
);
4645 #ifdef HANDLE_PRAGMA_WEAK
4646 /* Add function NAME to the weak symbols list. VALUE is a weak alias
4647 associatd with NAME. */
4650 add_weak (name
, value
)
4654 struct weak_syms
*weak
;
4656 weak
= (struct weak_syms
*) permalloc (sizeof (struct weak_syms
));
4661 weak
->next
= weak_decls
;
4663 weak
->value
= value
;
4668 #endif /* HANDLE_PRAGMA_WEAK */
4670 /* Declare DECL to be a weak symbol. */
4676 if (! TREE_PUBLIC (decl
))
4677 error_with_decl (decl
, "weak declaration of `%s' must be public");
4678 else if (TREE_ASM_WRITTEN (decl
))
4679 error_with_decl (decl
, "weak declaration of `%s' must precede definition");
4680 else if (SUPPORTS_WEAK
)
4681 DECL_WEAK (decl
) = 1;
4682 #ifdef HANDLE_PRAGMA_WEAK
4683 add_weak (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)), NULL
);
4687 /* Emit any pending weak declarations. */
4689 #ifdef HANDLE_PRAGMA_WEAK
4690 struct weak_syms
* weak_decls
;
4696 #ifdef HANDLE_PRAGMA_WEAK
4697 if (HANDLE_PRAGMA_WEAK
)
4699 struct weak_syms
*t
;
4700 for (t
= weak_decls
; t
; t
= t
->next
)
4704 ASM_WEAKEN_LABEL (asm_out_file
, t
->name
);
4706 ASM_OUTPUT_DEF (asm_out_file
, t
->name
, t
->value
);
4713 /* Remove NAME from the pending list of weak symbols. This prevents
4714 the compiler from emitting multiple .weak directives which confuses
4716 #ifdef ASM_WEAKEN_LABEL
4718 remove_from_pending_weak_list (name
)
4719 char *name ATTRIBUTE_UNUSED
;
4721 #ifdef HANDLE_PRAGMA_WEAK
4722 if (HANDLE_PRAGMA_WEAK
)
4724 struct weak_syms
*t
;
4725 for (t
= weak_decls
; t
; t
= t
->next
)
4727 if (t
->name
&& strcmp (name
, t
->name
) == 0)
4736 assemble_alias (decl
, target
)
4737 tree decl
, target ATTRIBUTE_UNUSED
;
4741 make_decl_rtl (decl
, (char *) 0, 1);
4742 name
= XSTR (XEXP (DECL_RTL (decl
), 0), 0);
4744 #ifdef ASM_OUTPUT_DEF
4745 /* Make name accessible from other files, if appropriate. */
4747 if (TREE_PUBLIC (decl
))
4749 #ifdef ASM_WEAKEN_LABEL
4750 if (DECL_WEAK (decl
))
4752 ASM_WEAKEN_LABEL (asm_out_file
, name
);
4753 /* Remove this function from the pending weak list so that
4754 we do not emit multiple .weak directives for it. */
4755 remove_from_pending_weak_list
4756 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
4760 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
4763 #ifdef ASM_OUTPUT_DEF_FROM_DECLS
4764 ASM_OUTPUT_DEF_FROM_DECLS (asm_out_file
, decl
, target
);
4766 ASM_OUTPUT_DEF (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4768 TREE_ASM_WRITTEN (decl
) = 1;
4770 #ifdef ASM_OUTPUT_WEAK_ALIAS
4771 if (! DECL_WEAK (decl
))
4772 warning ("only weak aliases are supported in this configuration");
4774 ASM_OUTPUT_WEAK_ALIAS (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4775 TREE_ASM_WRITTEN (decl
) = 1;
4777 warning ("alias definitions not supported in this configuration; ignored");
4782 /* This determines whether or not we support link-once semantics. */
4783 #ifndef SUPPORTS_ONE_ONLY
4784 #ifdef MAKE_DECL_ONE_ONLY
4785 #define SUPPORTS_ONE_ONLY 1
4787 #define SUPPORTS_ONE_ONLY 0
4791 /* Returns 1 if the target configuration supports defining public symbols
4792 so that one of them will be chosen at link time instead of generating a
4793 multiply-defined symbol error, whether through the use of weak symbols or
4794 a target-specific mechanism for having duplicates discarded. */
4797 supports_one_only ()
4799 if (SUPPORTS_ONE_ONLY
)
4801 return SUPPORTS_WEAK
;
4804 /* Set up DECL as a public symbol that can be defined in multiple
4805 translation units without generating a linker error. */
4808 make_decl_one_only (decl
)
4811 if (TREE_CODE (decl
) != VAR_DECL
&& TREE_CODE (decl
) != FUNCTION_DECL
)
4814 TREE_PUBLIC (decl
) = 1;
4816 if (TREE_CODE (decl
) == VAR_DECL
4817 && (DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
))
4818 DECL_COMMON (decl
) = 1;
4819 else if (SUPPORTS_ONE_ONLY
)
4821 #ifdef MAKE_DECL_ONE_ONLY
4822 MAKE_DECL_ONE_ONLY (decl
);
4824 DECL_ONE_ONLY (decl
) = 1;
4826 else if (SUPPORTS_WEAK
)
4827 DECL_WEAK (decl
) = 1;
4835 ggc_add_root (const_hash_table
, MAX_HASH_TABLE
, sizeof const_hash_table
[0],
4836 mark_const_hash_entry
);
4837 ggc_add_string_root (&in_named_name
, 1);
4840 /* Extra support for EH values. */
4842 assemble_eh_label (name
)
4845 #ifdef ASM_OUTPUT_EH_LABEL
4846 ASM_OUTPUT_EH_LABEL (asm_out_file
, name
);
4848 assemble_label (name
);
4852 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
4855 assemble_eh_align (align
)
4858 #ifdef ASM_OUTPUT_EH_ALIGN
4859 if (align
> BITS_PER_UNIT
)
4860 ASM_OUTPUT_EH_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
4862 assemble_align (align
);
4867 /* On some platforms, we may want to specify a special mechansim to
4868 output EH data when generating with a function.. */
4870 assemble_eh_integer (x
, size
, force
)
4878 #ifdef ASM_OUTPUT_EH_CHAR
4880 ASM_OUTPUT_EH_CHAR (asm_out_file
, x
);
4884 #ifdef ASM_OUTPUT_EH_SHORT
4886 ASM_OUTPUT_EH_SHORT (asm_out_file
, x
);
4890 #ifdef ASM_OUTPUT_EH_INT
4892 ASM_OUTPUT_EH_INT (asm_out_file
, x
);
4896 #ifdef ASM_OUTPUT_EH_DOUBLE_INT
4898 ASM_OUTPUT_EH_DOUBLE_INT (asm_out_file
, x
);
4905 return (assemble_integer (x
, size
, force
));