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 const unsigned char *compare_constant_1
PARAMS ((tree
, const unsigned 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
564 information such as that it is a function name. If the name
565 is changed, the macro ASM_OUTPUT_LABELREF will have to know
566 how to strip this information. */
567 #ifdef ENCODE_SECTION_INFO
568 ENCODE_SECTION_INFO (decl
);
573 /* ??? Another way to do this would be to do what halfpic.c does
574 and maintain a hashed table of such critters. */
575 /* ??? Another way to do this would be to pass a flag bit to
576 ENCODE_SECTION_INFO saying whether this is a new decl or not. */
577 /* Let the target reassign the RTL if it wants.
578 This is necessary, for example, when one machine specific
579 decl attribute overrides another. */
580 #ifdef REDO_SECTION_INFO_P
581 if (REDO_SECTION_INFO_P (decl
))
582 ENCODE_SECTION_INFO (decl
);
587 /* Given NAME, a putative register name, discard any customary prefixes. */
590 strip_reg_name (name
)
593 #ifdef REGISTER_PREFIX
594 if (!strncmp (name
, REGISTER_PREFIX
, strlen (REGISTER_PREFIX
)))
595 name
+= strlen (REGISTER_PREFIX
);
597 if (name
[0] == '%' || name
[0] == '#')
602 /* Decode an `asm' spec for a declaration as a register name.
603 Return the register number, or -1 if nothing specified,
604 or -2 if the ASMSPEC is not `cc' or `memory' and is not recognized,
605 or -3 if ASMSPEC is `cc' and is not recognized,
606 or -4 if ASMSPEC is `memory' and is not recognized.
607 Accept an exact spelling or a decimal number.
608 Prefixes such as % are optional. */
611 decode_reg_name (asmspec
)
618 /* Get rid of confusing prefixes. */
619 asmspec
= strip_reg_name (asmspec
);
621 /* Allow a decimal number as a "register name". */
622 for (i
= strlen (asmspec
) - 1; i
>= 0; i
--)
623 if (! (asmspec
[i
] >= '0' && asmspec
[i
] <= '9'))
625 if (asmspec
[0] != 0 && i
< 0)
628 if (i
< FIRST_PSEUDO_REGISTER
&& i
>= 0)
634 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
636 && ! strcmp (asmspec
, strip_reg_name (reg_names
[i
])))
639 #ifdef ADDITIONAL_REGISTER_NAMES
641 static struct { const char *name
; int number
; } table
[]
642 = ADDITIONAL_REGISTER_NAMES
;
644 for (i
= 0; i
< (int)(sizeof (table
) / sizeof (table
[0])); i
++)
645 if (! strcmp (asmspec
, table
[i
].name
))
646 return table
[i
].number
;
648 #endif /* ADDITIONAL_REGISTER_NAMES */
650 if (!strcmp (asmspec
, "memory"))
653 if (!strcmp (asmspec
, "cc"))
662 /* Create the DECL_RTL for a declaration for a static or external variable
663 or static or external function.
664 ASMSPEC, if not 0, is the string which the user specified
665 as the assembler symbol name.
666 TOP_LEVEL is nonzero if this is a file-scope variable.
668 This is never called for PARM_DECL nodes. */
671 make_decl_rtl (decl
, asmspec
, top_level
)
676 register char *name
= 0;
679 reg_number
= decode_reg_name (asmspec
);
681 if (DECL_ASSEMBLER_NAME (decl
) != NULL_TREE
)
682 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
684 if (reg_number
== -2)
686 /* ASMSPEC is given, and not the name of a register. */
687 size_t len
= strlen (asmspec
);
689 name
= ggc_alloc_string (NULL
, len
+ 1);
691 memcpy (&name
[1], asmspec
, len
+ 1);
694 /* For a duplicate declaration, we can be called twice on the
695 same DECL node. Don't discard the RTL already made. */
696 if (DECL_RTL (decl
) == 0)
698 /* First detect errors in declaring global registers. */
699 if (TREE_CODE (decl
) != FUNCTION_DECL
700 && DECL_REGISTER (decl
) && reg_number
== -1)
701 error_with_decl (decl
,
702 "register name not specified for `%s'");
703 else if (TREE_CODE (decl
) != FUNCTION_DECL
704 && DECL_REGISTER (decl
) && reg_number
< 0)
705 error_with_decl (decl
,
706 "invalid register name for `%s'");
707 else if ((reg_number
>= 0 || reg_number
== -3)
708 && (TREE_CODE (decl
) == FUNCTION_DECL
709 && ! DECL_REGISTER (decl
)))
710 error_with_decl (decl
,
711 "register name given for non-register variable `%s'");
712 else if (TREE_CODE (decl
) != FUNCTION_DECL
713 && DECL_REGISTER (decl
)
714 && TYPE_MODE (TREE_TYPE (decl
)) == BLKmode
)
715 error_with_decl (decl
,
716 "data type of `%s' isn't suitable for a register");
717 else if (TREE_CODE (decl
) != FUNCTION_DECL
&& DECL_REGISTER (decl
)
718 && ! HARD_REGNO_MODE_OK (reg_number
,
719 TYPE_MODE (TREE_TYPE (decl
))))
720 error_with_decl (decl
,
721 "register number for `%s' isn't suitable for data type");
722 /* Now handle properly declared static register variables. */
723 else if (TREE_CODE (decl
) != FUNCTION_DECL
&& DECL_REGISTER (decl
))
727 if (DECL_INITIAL (decl
) != 0 && top_level
)
729 DECL_INITIAL (decl
) = 0;
730 error ("global register variable has initial value");
732 if (TREE_THIS_VOLATILE (decl
))
733 warning ("volatile register variables don't work as you might wish");
735 /* If the user specified one of the eliminables registers here,
736 e.g., FRAME_POINTER_REGNUM, we don't want to get this variable
737 confused with that register and be eliminated. Although this
738 usage is somewhat suspect, we nevertheless use the following
739 kludge to avoid setting DECL_RTL to frame_pointer_rtx. */
742 = gen_rtx_REG (DECL_MODE (decl
), FIRST_PSEUDO_REGISTER
);
743 REGNO (DECL_RTL (decl
)) = reg_number
;
744 REG_USERVAR_P (DECL_RTL (decl
)) = 1;
748 /* Make this register global, so not usable for anything
750 #ifdef ASM_DECLARE_REGISTER_GLOBAL
751 ASM_DECLARE_REGISTER_GLOBAL (asm_out_file
, decl
, reg_number
, name
);
753 nregs
= HARD_REGNO_NREGS (reg_number
, DECL_MODE (decl
));
755 globalize_reg (reg_number
+ --nregs
);
758 /* Specifying a section attribute on a variable forces it into a
759 non-.bss section, and thus it cannot be common. */
760 else if (TREE_CODE (decl
) == VAR_DECL
761 && DECL_SECTION_NAME (decl
) != NULL_TREE
762 && DECL_INITIAL (decl
) == NULL_TREE
763 && DECL_COMMON (decl
))
764 DECL_COMMON (decl
) = 0;
766 /* Now handle ordinary static variables and functions (in memory).
767 Also handle vars declared register invalidly. */
768 if (DECL_RTL (decl
) == 0)
770 /* Can't use just the variable's own name for a variable
771 whose scope is less than the whole file, unless it's a member
772 of a local class (which will already be unambiguous).
773 Concatenate a distinguishing number. */
774 if (!top_level
&& !TREE_PUBLIC (decl
)
775 && ! (DECL_CONTEXT (decl
) && TYPE_P (DECL_CONTEXT (decl
)))
780 ASM_FORMAT_PRIVATE_NAME (label
, name
, var_labelno
);
781 name
= ggc_alloc_string (label
, -1);
788 /* When -fprefix-function-name is used, the functions
789 names are prefixed. Only nested function names are not
791 if (flag_prefix_function_name
&& TREE_CODE (decl
) == FUNCTION_DECL
)
793 size_t name_len
= strlen (name
);
796 new_name
= ggc_alloc_string (NULL
, name_len
+ CHKR_PREFIX_SIZE
);
797 memcpy (new_name
, CHKR_PREFIX
, CHKR_PREFIX_SIZE
);
798 memcpy (new_name
+ CHKR_PREFIX_SIZE
, name
, name_len
+ 1);
802 /* If this variable is to be treated as volatile, show its
803 tree node has side effects. */
804 if ((flag_volatile_global
&& TREE_CODE (decl
) == VAR_DECL
805 && TREE_PUBLIC (decl
))
806 || ((flag_volatile_static
&& TREE_CODE (decl
) == VAR_DECL
807 && (TREE_PUBLIC (decl
) || TREE_STATIC (decl
)))))
808 TREE_SIDE_EFFECTS (decl
) = 1;
810 DECL_ASSEMBLER_NAME (decl
)
811 = get_identifier (name
[0] == '*' ? name
+ 1 : name
);
812 DECL_RTL (decl
) = gen_rtx_MEM (DECL_MODE (decl
),
813 gen_rtx_SYMBOL_REF (Pmode
, name
));
814 if (TREE_CODE (decl
) != FUNCTION_DECL
)
815 set_mem_attributes (DECL_RTL (decl
), decl
, 1);
817 /* Optionally set flags or add text to the name to record information
818 such as that it is a function name.
819 If the name is changed, the macro ASM_OUTPUT_LABELREF
820 will have to know how to strip this information. */
821 #ifdef ENCODE_SECTION_INFO
822 ENCODE_SECTION_INFO (decl
);
828 /* If the old RTL had the wrong mode, fix the mode. */
829 if (GET_MODE (DECL_RTL (decl
)) != DECL_MODE (decl
))
831 rtx rtl
= DECL_RTL (decl
);
832 PUT_MODE (rtl
, DECL_MODE (decl
));
835 /* ??? Another way to do this would be to do what halfpic.c does
836 and maintain a hashed table of such critters. */
837 /* ??? Another way to do this would be to pass a flag bit to
838 ENCODE_SECTION_INFO saying whether this is a new decl or not. */
839 /* Let the target reassign the RTL if it wants.
840 This is necessary, for example, when one machine specific
841 decl attribute overrides another. */
842 #ifdef REDO_SECTION_INFO_P
843 if (REDO_SECTION_INFO_P (decl
))
844 ENCODE_SECTION_INFO (decl
);
849 /* Make the rtl for variable VAR be volatile.
850 Use this only for static variables. */
853 make_var_volatile (var
)
856 if (GET_CODE (DECL_RTL (var
)) != MEM
)
859 MEM_VOLATILE_P (DECL_RTL (var
)) = 1;
862 /* Output alignment directive to align for constant expression EXP. */
865 assemble_constant_align (exp
)
870 /* Align the location counter as required by EXP's data type. */
871 align
= TYPE_ALIGN (TREE_TYPE (exp
));
872 #ifdef CONSTANT_ALIGNMENT
873 align
= CONSTANT_ALIGNMENT (exp
, align
);
876 if (align
> BITS_PER_UNIT
)
877 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
880 /* Output a string of literal assembler code
881 for an `asm' keyword used between functions. */
884 assemble_asm (string
)
889 if (TREE_CODE (string
) == ADDR_EXPR
)
890 string
= TREE_OPERAND (string
, 0);
892 fprintf (asm_out_file
, "\t%s\n", TREE_STRING_POINTER (string
));
895 #if 0 /* This should no longer be needed, because
896 flag_gnu_linker should be 0 on these systems,
897 which should prevent any output
898 if ASM_OUTPUT_CONSTRUCTOR and ASM_OUTPUT_DESTRUCTOR are absent. */
899 #if !(defined(DBX_DEBUGGING_INFO) && !defined(FASCIST_ASSEMBLER))
900 #ifndef ASM_OUTPUT_CONSTRUCTOR
901 #define ASM_OUTPUT_CONSTRUCTOR(file, name)
903 #ifndef ASM_OUTPUT_DESTRUCTOR
904 #define ASM_OUTPUT_DESTRUCTOR(file, name)
909 /* Record an element in the table of global destructors.
910 How this is done depends on what sort of assembler and linker
913 NAME should be the name of a global function to be called
914 at exit time. This name is output using assemble_name. */
917 assemble_destructor (name
)
920 #ifdef ASM_OUTPUT_DESTRUCTOR
921 ASM_OUTPUT_DESTRUCTOR (asm_out_file
, name
);
925 /* Now tell GNU LD that this is part of the static destructor set. */
926 /* This code works for any machine provided you use GNU as/ld. */
927 fprintf (asm_out_file
, "%s \"___DTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
928 assemble_name (asm_out_file
, name
);
929 fputc ('\n', asm_out_file
);
934 /* Likewise for global constructors. */
937 assemble_constructor (name
)
940 #ifdef ASM_OUTPUT_CONSTRUCTOR
941 ASM_OUTPUT_CONSTRUCTOR (asm_out_file
, name
);
945 /* Now tell GNU LD that this is part of the static constructor set. */
946 /* This code works for any machine provided you use GNU as/ld. */
947 fprintf (asm_out_file
, "%s \"___CTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
948 assemble_name (asm_out_file
, name
);
949 fputc ('\n', asm_out_file
);
954 /* Likewise for entries we want to record for garbage collection.
955 Garbage collection is still under development. */
958 assemble_gc_entry (name
)
961 #ifdef ASM_OUTPUT_GC_ENTRY
962 ASM_OUTPUT_GC_ENTRY (asm_out_file
, name
);
966 /* Now tell GNU LD that this is part of the static constructor set. */
967 fprintf (asm_out_file
, "%s \"___PTR_LIST__\",22,0,0,", ASM_STABS_OP
);
968 assemble_name (asm_out_file
, name
);
969 fputc ('\n', asm_out_file
);
974 /* CONSTANT_POOL_BEFORE_FUNCTION may be defined as an expression with
975 a non-zero value if the constant pool should be output before the
976 start of the function, or a zero value if the pool should output
977 after the end of the function. The default is to put it before the
980 #ifndef CONSTANT_POOL_BEFORE_FUNCTION
981 #define CONSTANT_POOL_BEFORE_FUNCTION 1
984 /* Output assembler code for the constant pool of a function and associated
985 with defining the name of the function. DECL describes the function.
986 NAME is the function's name. For the constant pool, we use the current
987 constant pool data. */
990 assemble_start_function (decl
, fnname
)
996 /* The following code does not need preprocessing in the assembler. */
1000 if (CONSTANT_POOL_BEFORE_FUNCTION
)
1001 output_constant_pool (fnname
, decl
);
1003 #ifdef ASM_OUTPUT_SECTION_NAME
1004 /* If the function is to be put in its own section and it's not in a section
1005 already, indicate so. */
1006 if ((flag_function_sections
1007 && DECL_SECTION_NAME (decl
) == NULL_TREE
)
1008 || UNIQUE_SECTION_P (decl
))
1009 UNIQUE_SECTION (decl
, 0);
1012 function_section (decl
);
1014 /* Tell assembler to move to target machine's alignment for functions. */
1015 align
= floor_log2 (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
1017 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1019 /* Handle a user-specified function alignment.
1020 Note that we still need to align to FUNCTION_BOUNDARY, as above,
1021 because ASM_OUTPUT_MAX_SKIP_ALIGN might not do any alignment at all. */
1022 if (align_functions_log
> align
)
1024 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
1025 ASM_OUTPUT_MAX_SKIP_ALIGN (asm_out_file
,
1026 align_functions_log
, align_functions
-1);
1028 ASM_OUTPUT_ALIGN (asm_out_file
, align_functions_log
);
1032 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
1033 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file
, fnname
);
1036 #ifdef SDB_DEBUGGING_INFO
1037 /* Output SDB definition of the function. */
1038 if (write_symbols
== SDB_DEBUG
)
1039 sdbout_mark_begin_function ();
1042 #ifdef DBX_DEBUGGING_INFO
1043 /* Output DBX definition of the function. */
1044 if (write_symbols
== DBX_DEBUG
)
1045 dbxout_begin_function (decl
);
1048 /* Make function name accessible from other files, if appropriate. */
1050 if (TREE_PUBLIC (decl
))
1052 if (! first_global_object_name
)
1057 STRIP_NAME_ENCODING (p
, fnname
);
1058 name
= permalloc (strlen (p
) + 1);
1061 if (! DECL_WEAK (decl
) && ! DECL_ONE_ONLY (decl
))
1062 first_global_object_name
= name
;
1064 weak_global_object_name
= name
;
1067 #ifdef ASM_WEAKEN_LABEL
1068 if (DECL_WEAK (decl
))
1070 ASM_WEAKEN_LABEL (asm_out_file
, fnname
);
1071 /* Remove this function from the pending weak list so that
1072 we do not emit multiple .weak directives for it. */
1073 remove_from_pending_weak_list
1074 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
1078 ASM_GLOBALIZE_LABEL (asm_out_file
, fnname
);
1081 /* Do any machine/system dependent processing of the function name */
1082 #ifdef ASM_DECLARE_FUNCTION_NAME
1083 ASM_DECLARE_FUNCTION_NAME (asm_out_file
, fnname
, current_function_decl
);
1085 /* Standard thing is just output label for the function. */
1086 ASM_OUTPUT_LABEL (asm_out_file
, fnname
);
1087 #endif /* ASM_DECLARE_FUNCTION_NAME */
1090 /* Output assembler code associated with defining the size of the
1091 function. DECL describes the function. NAME is the function's name. */
1094 assemble_end_function (decl
, fnname
)
1098 #ifdef ASM_DECLARE_FUNCTION_SIZE
1099 ASM_DECLARE_FUNCTION_SIZE (asm_out_file
, fnname
, decl
);
1101 if (! CONSTANT_POOL_BEFORE_FUNCTION
)
1103 output_constant_pool (fnname
, decl
);
1104 function_section (decl
); /* need to switch back */
1107 /* Output any constants which should appear after the function. */
1108 output_after_function_constants ();
1111 /* Assemble code to leave SIZE bytes of zeros. */
1114 assemble_zeros (size
)
1117 /* Do no output if -fsyntax-only. */
1118 if (flag_syntax_only
)
1121 #ifdef ASM_NO_SKIP_IN_TEXT
1122 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
1123 so we must output 0s explicitly in the text section. */
1124 if (ASM_NO_SKIP_IN_TEXT
&& in_text_section ())
1128 for (i
= 0; i
< size
- 20; i
+= 20)
1131 fprintf (asm_out_file
,
1132 "%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
);
1134 fprintf (asm_out_file
,
1135 "\tbyte 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n");
1141 fprintf (asm_out_file
, "%s 0", ASM_BYTE_OP
);
1143 fprintf (asm_out_file
, "\tbyte 0");
1146 for (; i
< size
; i
++)
1147 fprintf (asm_out_file
, ",0");
1148 fprintf (asm_out_file
, "\n");
1154 ASM_OUTPUT_SKIP (asm_out_file
, size
);
1157 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
1160 assemble_align (align
)
1163 if (align
> BITS_PER_UNIT
)
1164 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
1167 /* Assemble a string constant with the specified C string as contents. */
1170 assemble_string (p
, size
)
1177 /* If the string is very long, split it up. */
1181 int thissize
= size
- pos
;
1182 if (thissize
> maximum
)
1185 ASM_OUTPUT_ASCII (asm_out_file
, p
, thissize
);
1193 #if defined ASM_OUTPUT_ALIGNED_DECL_LOCAL
1194 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1195 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1197 #if defined ASM_OUTPUT_ALIGNED_LOCAL
1198 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1199 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, DECL_ALIGN (decl))
1201 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1202 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded)
1206 #if defined ASM_OUTPUT_ALIGNED_BSS
1207 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1208 ASM_OUTPUT_ALIGNED_BSS (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1210 #if defined ASM_OUTPUT_BSS
1211 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1212 ASM_OUTPUT_BSS (asm_out_file, decl, name, size, rounded)
1218 #if defined ASM_OUTPUT_ALIGNED_DECL_COMMON
1219 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1220 ASM_OUTPUT_ALIGNED_DECL_COMMON (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1222 #if defined ASM_OUTPUT_ALIGNED_COMMON
1223 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1224 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file, name, size, DECL_ALIGN (decl))
1226 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1227 ASM_OUTPUT_COMMON (asm_out_file, name, size, rounded)
1232 asm_emit_uninitialised (decl
, name
, size
, rounded
)
1235 int size ATTRIBUTE_UNUSED
;
1236 int rounded ATTRIBUTE_UNUSED
;
1244 destination
= asm_dest_local
;
1246 if (TREE_PUBLIC (decl
))
1248 #if defined ASM_EMIT_BSS
1249 if (! DECL_COMMON (decl
))
1250 destination
= asm_dest_bss
;
1253 destination
= asm_dest_common
;
1256 if (flag_shared_data
)
1258 switch (destination
)
1260 #ifdef ASM_OUTPUT_SHARED_BSS
1262 ASM_OUTPUT_SHARED_BSS (asm_out_file
, decl
, name
, size
, rounded
);
1265 #ifdef ASM_OUTPUT_SHARED_COMMON
1266 case asm_dest_common
:
1267 ASM_OUTPUT_SHARED_COMMON (asm_out_file
, name
, size
, rounded
);
1270 #ifdef ASM_OUTPUT_SHARED_LOCAL
1271 case asm_dest_local
:
1272 ASM_OUTPUT_SHARED_LOCAL (asm_out_file
, name
, size
, rounded
);
1280 #ifdef ASM_OUTPUT_SECTION_NAME
1281 /* We already know that DECL_SECTION_NAME() == NULL. */
1282 if (flag_data_sections
!= 0 || UNIQUE_SECTION_P (decl
))
1283 UNIQUE_SECTION (decl
, 0);
1286 switch (destination
)
1290 ASM_EMIT_BSS (decl
, name
, size
, rounded
);
1293 case asm_dest_common
:
1294 ASM_EMIT_COMMON (decl
, name
, size
, rounded
);
1296 case asm_dest_local
:
1297 ASM_EMIT_LOCAL (decl
, name
, size
, rounded
);
1306 /* Assemble everything that is needed for a variable or function declaration.
1307 Not used for automatic variables, and not used for function definitions.
1308 Should not be called for variables of incomplete structure type.
1310 TOP_LEVEL is nonzero if this variable has file scope.
1311 AT_END is nonzero if this is the special handling, at end of compilation,
1312 to define things that have had only tentative definitions.
1313 DONT_OUTPUT_DATA if nonzero means don't actually output the
1314 initial value (that will be done by the caller). */
1317 assemble_variable (decl
, top_level
, at_end
, dont_output_data
)
1319 int top_level ATTRIBUTE_UNUSED
;
1320 int at_end ATTRIBUTE_UNUSED
;
1321 int dont_output_data
;
1323 register const char *name
;
1326 enum in_section saved_in_section
;
1328 last_assemble_variable_decl
= 0;
1330 if (GET_CODE (DECL_RTL (decl
)) == REG
)
1332 /* Do output symbol info for global register variables, but do nothing
1335 if (TREE_ASM_WRITTEN (decl
))
1337 TREE_ASM_WRITTEN (decl
) = 1;
1339 /* Do no output if -fsyntax-only. */
1340 if (flag_syntax_only
)
1343 #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
1344 /* File-scope global variables are output here. */
1345 if ((write_symbols
== DBX_DEBUG
|| write_symbols
== XCOFF_DEBUG
)
1347 dbxout_symbol (decl
, 0);
1349 #ifdef SDB_DEBUGGING_INFO
1350 if (write_symbols
== SDB_DEBUG
&& top_level
1351 /* Leave initialized global vars for end of compilation;
1352 see comment in compile_file. */
1353 && (TREE_PUBLIC (decl
) == 0 || DECL_INITIAL (decl
) == 0))
1354 sdbout_symbol (decl
, 0);
1357 /* Don't output any DWARF debugging information for variables here.
1358 In the case of local variables, the information for them is output
1359 when we do our recursive traversal of the tree representation for
1360 the entire containing function. In the case of file-scope variables,
1361 we output information for all of them at the very end of compilation
1362 while we are doing our final traversal of the chain of file-scope
1368 /* Normally no need to say anything here for external references,
1369 since assemble_external is called by the language-specific code
1370 when a declaration is first seen. */
1372 if (DECL_EXTERNAL (decl
))
1375 /* Output no assembler code for a function declaration.
1376 Only definitions of functions output anything. */
1378 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1381 /* If type was incomplete when the variable was declared,
1382 see if it is complete now. */
1384 if (DECL_SIZE (decl
) == 0)
1385 layout_decl (decl
, 0);
1387 /* Still incomplete => don't allocate it; treat the tentative defn
1388 (which is what it must have been) as an `extern' reference. */
1390 if (!dont_output_data
&& DECL_SIZE (decl
) == 0)
1392 error_with_file_and_line (DECL_SOURCE_FILE (decl
),
1393 DECL_SOURCE_LINE (decl
),
1394 "storage size of `%s' isn't known",
1395 IDENTIFIER_POINTER (DECL_NAME (decl
)));
1396 TREE_ASM_WRITTEN (decl
) = 1;
1400 /* The first declaration of a variable that comes through this function
1401 decides whether it is global (in C, has external linkage)
1402 or local (in C, has internal linkage). So do nothing more
1403 if this function has already run. */
1405 if (TREE_ASM_WRITTEN (decl
))
1408 TREE_ASM_WRITTEN (decl
) = 1;
1410 /* Do no output if -fsyntax-only. */
1411 if (flag_syntax_only
)
1416 if (! dont_output_data
1417 && ! host_integerp (DECL_SIZE_UNIT (decl
), 1))
1419 error_with_decl (decl
, "size of variable `%s' is too large");
1423 name
= XSTR (XEXP (DECL_RTL (decl
), 0), 0);
1424 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
)
1425 && ! first_global_object_name
1426 && ! (DECL_COMMON (decl
) && (DECL_INITIAL (decl
) == 0
1427 || DECL_INITIAL (decl
) == error_mark_node
))
1428 && ! DECL_WEAK (decl
)
1429 && ! DECL_ONE_ONLY (decl
))
1434 STRIP_NAME_ENCODING (p
, name
);
1435 xname
= permalloc (strlen (p
) + 1);
1437 first_global_object_name
= xname
;
1440 /* Compute the alignment of this data. */
1442 align
= DECL_ALIGN (decl
);
1444 /* In the case for initialing an array whose length isn't specified,
1445 where we have not yet been able to do the layout,
1446 figure out the proper alignment now. */
1447 if (dont_output_data
&& DECL_SIZE (decl
) == 0
1448 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
)
1449 align
= MAX (align
, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl
))));
1451 /* Some object file formats have a maximum alignment which they support.
1452 In particular, a.out format supports a maximum alignment of 4. */
1453 #ifndef MAX_OFILE_ALIGNMENT
1454 #define MAX_OFILE_ALIGNMENT BIGGEST_ALIGNMENT
1456 if (align
> MAX_OFILE_ALIGNMENT
)
1458 warning_with_decl (decl
,
1459 "alignment of `%s' is greater than maximum object file alignment. Using %d.",
1460 MAX_OFILE_ALIGNMENT
/BITS_PER_UNIT
);
1461 align
= MAX_OFILE_ALIGNMENT
;
1464 /* On some machines, it is good to increase alignment sometimes. */
1465 #ifdef DATA_ALIGNMENT
1466 align
= DATA_ALIGNMENT (TREE_TYPE (decl
), align
);
1468 #ifdef CONSTANT_ALIGNMENT
1469 if (DECL_INITIAL (decl
) != 0 && DECL_INITIAL (decl
) != error_mark_node
)
1470 align
= CONSTANT_ALIGNMENT (DECL_INITIAL (decl
), align
);
1473 /* Reset the alignment in case we have made it tighter, so we can benefit
1474 from it in get_pointer_alignment. */
1475 DECL_ALIGN (decl
) = align
;
1477 /* Handle uninitialized definitions. */
1479 if ((DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
)
1480 /* If the target can't output uninitialized but not common global data
1481 in .bss, then we have to use .data. */
1482 #if ! defined ASM_EMIT_BSS
1483 && DECL_COMMON (decl
)
1485 && DECL_SECTION_NAME (decl
) == NULL_TREE
1486 && ! dont_output_data
)
1488 unsigned HOST_WIDE_INT size
= tree_low_cst (DECL_SIZE_UNIT (decl
), 1);
1489 unsigned HOST_WIDE_INT rounded
= size
;
1491 /* Don't allocate zero bytes of common,
1492 since that means "undefined external" in the linker. */
1496 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1497 so that each uninitialized object starts on such a boundary. */
1498 rounded
+= (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1;
1499 rounded
= (rounded
/ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1500 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1502 #if !defined(ASM_OUTPUT_ALIGNED_COMMON) && !defined(ASM_OUTPUT_ALIGNED_BSS)
1503 if ((unsigned HOST_WIDE_INT
) DECL_ALIGN (decl
) / BITS_PER_UNIT
> rounded
)
1505 (decl
, "requested alignment for %s is greater than implemented alignment of %d.",rounded
);
1508 #ifdef DBX_DEBUGGING_INFO
1509 /* File-scope global variables are output here. */
1510 if (write_symbols
== DBX_DEBUG
&& top_level
)
1511 dbxout_symbol (decl
, 0);
1513 #ifdef SDB_DEBUGGING_INFO
1514 if (write_symbols
== SDB_DEBUG
&& top_level
1515 /* Leave initialized global vars for end of compilation;
1516 see comment in compile_file. */
1517 && (TREE_PUBLIC (decl
) == 0 || DECL_INITIAL (decl
) == 0))
1518 sdbout_symbol (decl
, 0);
1521 /* Don't output any DWARF debugging information for variables here.
1522 In the case of local variables, the information for them is output
1523 when we do our recursive traversal of the tree representation for
1524 the entire containing function. In the case of file-scope variables,
1525 we output information for all of them at the very end of compilation
1526 while we are doing our final traversal of the chain of file-scope
1529 #if 0 /* ??? We should either delete this or add a comment describing what
1530 it was intended to do and why we shouldn't delete it. */
1531 if (flag_shared_data
)
1534 asm_emit_uninitialised (decl
, name
, size
, rounded
);
1539 /* Handle initialized definitions.
1540 Also handle uninitialized global definitions if -fno-common and the
1541 target doesn't support ASM_OUTPUT_BSS. */
1543 /* First make the assembler name(s) global if appropriate. */
1544 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
))
1546 #ifdef ASM_WEAKEN_LABEL
1547 if (DECL_WEAK (decl
))
1549 ASM_WEAKEN_LABEL (asm_out_file
, name
);
1550 /* Remove this variable from the pending weak list so that
1551 we do not emit multiple .weak directives for it. */
1552 remove_from_pending_weak_list
1553 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
1557 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
1560 for (d
= equivalents
; d
; d
= TREE_CHAIN (d
))
1562 tree e
= TREE_VALUE (d
);
1563 if (TREE_PUBLIC (e
) && DECL_NAME (e
))
1564 ASM_GLOBALIZE_LABEL (asm_out_file
,
1565 XSTR (XEXP (DECL_RTL (e
), 0), 0));
1569 /* Output any data that we will need to use the address of. */
1570 if (DECL_INITIAL (decl
) == error_mark_node
)
1571 reloc
= contains_pointers_p (TREE_TYPE (decl
));
1572 else if (DECL_INITIAL (decl
))
1573 reloc
= output_addressed_constants (DECL_INITIAL (decl
));
1575 #ifdef ASM_OUTPUT_SECTION_NAME
1576 if ((flag_data_sections
!= 0 && DECL_SECTION_NAME (decl
) == NULL_TREE
)
1577 || UNIQUE_SECTION_P (decl
))
1578 UNIQUE_SECTION (decl
, reloc
);
1581 /* Switch to the appropriate section. */
1582 variable_section (decl
, reloc
);
1584 /* dbxout.c needs to know this. */
1585 if (in_text_section ())
1586 DECL_IN_TEXT_SECTION (decl
) = 1;
1588 /* Record current section so we can restore it if dbxout.c clobbers it. */
1589 saved_in_section
= in_section
;
1591 /* Output the dbx info now that we have chosen the section. */
1593 #ifdef DBX_DEBUGGING_INFO
1594 /* File-scope global variables are output here. */
1595 if (write_symbols
== DBX_DEBUG
&& top_level
)
1596 dbxout_symbol (decl
, 0);
1598 #ifdef SDB_DEBUGGING_INFO
1599 if (write_symbols
== SDB_DEBUG
&& top_level
1600 /* Leave initialized global vars for end of compilation;
1601 see comment in compile_file. */
1602 && (TREE_PUBLIC (decl
) == 0 || DECL_INITIAL (decl
) == 0))
1603 sdbout_symbol (decl
, 0);
1606 /* Don't output any DWARF debugging information for variables here.
1607 In the case of local variables, the information for them is output
1608 when we do our recursive traversal of the tree representation for
1609 the entire containing function. In the case of file-scope variables,
1610 we output information for all of them at the very end of compilation
1611 while we are doing our final traversal of the chain of file-scope
1614 /* If the debugging output changed sections, reselect the section
1615 that's supposed to be selected. */
1616 if (in_section
!= saved_in_section
)
1617 variable_section (decl
, reloc
);
1619 /* Output the alignment of this data. */
1620 if (align
> BITS_PER_UNIT
)
1621 ASM_OUTPUT_ALIGN (asm_out_file
,
1622 floor_log2 (DECL_ALIGN (decl
) / BITS_PER_UNIT
));
1624 /* Do any machine/system dependent processing of the object. */
1625 #ifdef ASM_DECLARE_OBJECT_NAME
1626 last_assemble_variable_decl
= decl
;
1627 ASM_DECLARE_OBJECT_NAME (asm_out_file
, name
, decl
);
1629 /* Standard thing is just output label for the object. */
1630 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1631 #endif /* ASM_DECLARE_OBJECT_NAME */
1633 if (!dont_output_data
)
1635 if (DECL_INITIAL (decl
))
1636 /* Output the actual data. */
1637 output_constant (DECL_INITIAL (decl
),
1638 tree_low_cst (DECL_SIZE_UNIT (decl
), 1));
1640 /* Leave space for it. */
1641 assemble_zeros (tree_low_cst (DECL_SIZE_UNIT (decl
), 1));
1645 #ifdef XCOFF_DEBUGGING_INFO
1646 /* Unfortunately, the IBM assembler cannot handle stabx before the actual
1647 declaration. When something like ".stabx "aa:S-2",aa,133,0" is emitted
1648 and `aa' hasn't been output yet, the assembler generates a stab entry with
1649 a value of zero, in addition to creating an unnecessary external entry
1650 for `aa'. Hence, we must postpone dbxout_symbol to here at the end. */
1652 /* File-scope global variables are output here. */
1653 if (write_symbols
== XCOFF_DEBUG
&& top_level
)
1655 saved_in_section
= in_section
;
1657 dbxout_symbol (decl
, 0);
1659 if (in_section
!= saved_in_section
)
1660 variable_section (decl
, reloc
);
1663 /* There must be a statement after a label. */
1668 /* Return 1 if type TYPE contains any pointers. */
1671 contains_pointers_p (type
)
1674 switch (TREE_CODE (type
))
1677 case REFERENCE_TYPE
:
1678 /* I'm not sure whether OFFSET_TYPE needs this treatment,
1679 so I'll play safe and return 1. */
1685 case QUAL_UNION_TYPE
:
1688 /* For a type that has fields, see if the fields have pointers. */
1689 for (fields
= TYPE_FIELDS (type
); fields
; fields
= TREE_CHAIN (fields
))
1690 if (TREE_CODE (fields
) == FIELD_DECL
1691 && contains_pointers_p (TREE_TYPE (fields
)))
1697 /* An array type contains pointers if its element type does. */
1698 return contains_pointers_p (TREE_TYPE (type
));
1705 /* Output something to declare an external symbol to the assembler.
1706 (Most assemblers don't need this, so we normally output nothing.)
1707 Do nothing if DECL is not external. */
1710 assemble_external (decl
)
1711 tree decl ATTRIBUTE_UNUSED
;
1713 #ifdef ASM_OUTPUT_EXTERNAL
1714 if (DECL_P (decl
) && DECL_EXTERNAL (decl
) && TREE_PUBLIC (decl
))
1716 rtx rtl
= DECL_RTL (decl
);
1718 if (GET_CODE (rtl
) == MEM
&& GET_CODE (XEXP (rtl
, 0)) == SYMBOL_REF
1719 && ! SYMBOL_REF_USED (XEXP (rtl
, 0)))
1721 /* Some systems do require some output. */
1722 SYMBOL_REF_USED (XEXP (rtl
, 0)) = 1;
1723 ASM_OUTPUT_EXTERNAL (asm_out_file
, decl
, XSTR (XEXP (rtl
, 0), 0));
1729 /* Similar, for calling a library function FUN. */
1732 assemble_external_libcall (fun
)
1733 rtx fun ATTRIBUTE_UNUSED
;
1735 #ifdef ASM_OUTPUT_EXTERNAL_LIBCALL
1736 /* Declare library function name external when first used, if nec. */
1737 if (! SYMBOL_REF_USED (fun
))
1739 SYMBOL_REF_USED (fun
) = 1;
1740 ASM_OUTPUT_EXTERNAL_LIBCALL (asm_out_file
, fun
);
1745 /* Declare the label NAME global. */
1748 assemble_global (name
)
1751 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
1754 /* Assemble a label named NAME. */
1757 assemble_label (name
)
1760 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1763 /* Output to FILE a reference to the assembler name of a C-level name NAME.
1764 If NAME starts with a *, the rest of NAME is output verbatim.
1765 Otherwise NAME is transformed in an implementation-defined way
1766 (usually by the addition of an underscore).
1767 Many macros in the tm file are defined to call this function. */
1770 assemble_name (file
, name
)
1774 const char *real_name
;
1777 STRIP_NAME_ENCODING (real_name
, name
);
1778 if (flag_prefix_function_name
1779 && ! bcmp (real_name
, CHKR_PREFIX
, CHKR_PREFIX_SIZE
))
1780 real_name
= real_name
+ CHKR_PREFIX_SIZE
;
1782 id
= maybe_get_identifier (real_name
);
1784 TREE_SYMBOL_REFERENCED (id
) = 1;
1787 fputs (&name
[1], file
);
1789 ASM_OUTPUT_LABELREF (file
, name
);
1792 /* Allocate SIZE bytes writable static space with a gensym name
1793 and return an RTX to refer to its address. */
1796 assemble_static_space (size
)
1804 if (flag_shared_data
)
1808 ASM_GENERATE_INTERNAL_LABEL (name
, "LF", const_labelno
);
1810 namestring
= ggc_alloc_string (name
, -1);
1812 x
= gen_rtx_SYMBOL_REF (Pmode
, namestring
);
1814 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
1815 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file
, NULL_TREE
, name
, size
,
1818 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1819 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file
, name
, size
, BIGGEST_ALIGNMENT
);
1822 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1823 so that each uninitialized object starts on such a boundary. */
1824 /* Variable `rounded' might or might not be used in ASM_OUTPUT_LOCAL. */
1825 int rounded ATTRIBUTE_UNUSED
1826 = ((size
+ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1)
1827 / (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1828 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1829 ASM_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
1836 /* Assemble the static constant template for function entry trampolines.
1837 This is done at most once per compilation.
1838 Returns an RTX for the address of the template. */
1840 #ifdef TRAMPOLINE_TEMPLATE
1842 assemble_trampoline_template ()
1848 /* By default, put trampoline templates in read-only data section. */
1850 #ifdef TRAMPOLINE_SECTION
1851 TRAMPOLINE_SECTION ();
1853 readonly_data_section ();
1856 /* Write the assembler code to define one. */
1857 align
= floor_log2 (TRAMPOLINE_ALIGNMENT
/ BITS_PER_UNIT
);
1859 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1861 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LTRAMP", 0);
1862 TRAMPOLINE_TEMPLATE (asm_out_file
);
1864 /* Record the rtl to refer to it. */
1865 ASM_GENERATE_INTERNAL_LABEL (label
, "LTRAMP", 0);
1866 name
= ggc_alloc_string (label
, -1);
1867 return gen_rtx_SYMBOL_REF (Pmode
, name
);
1871 /* Assemble the integer constant X into an object of SIZE bytes.
1872 X must be either a CONST_INT or CONST_DOUBLE.
1874 Return 1 if we were able to output the constant, otherwise 0. If FORCE is
1875 non-zero, abort if we can't output the constant. */
1878 assemble_integer (x
, size
, force
)
1883 /* First try to use the standard 1, 2, 4, 8, and 16 byte
1884 ASM_OUTPUT... macros. */
1888 #ifdef ASM_OUTPUT_CHAR
1890 ASM_OUTPUT_CHAR (asm_out_file
, x
);
1894 #ifdef ASM_OUTPUT_SHORT
1896 ASM_OUTPUT_SHORT (asm_out_file
, x
);
1900 #ifdef ASM_OUTPUT_INT
1902 ASM_OUTPUT_INT (asm_out_file
, x
);
1906 #ifdef ASM_OUTPUT_DOUBLE_INT
1908 ASM_OUTPUT_DOUBLE_INT (asm_out_file
, x
);
1912 #ifdef ASM_OUTPUT_QUADRUPLE_INT
1914 ASM_OUTPUT_QUADRUPLE_INT (asm_out_file
, x
);
1919 /* If we couldn't do it that way, there are two other possibilities: First,
1920 if the machine can output an explicit byte and this is a 1 byte constant,
1921 we can use ASM_OUTPUT_BYTE. */
1923 #ifdef ASM_OUTPUT_BYTE
1924 if (size
== 1 && GET_CODE (x
) == CONST_INT
)
1926 ASM_OUTPUT_BYTE (asm_out_file
, INTVAL (x
));
1931 /* Finally, if SIZE is larger than a single word, try to output the constant
1932 one word at a time. */
1934 if (size
> UNITS_PER_WORD
)
1937 enum machine_mode mode
1938 = mode_for_size (size
* BITS_PER_UNIT
, MODE_INT
, 0);
1941 for (i
= 0; i
< size
/ UNITS_PER_WORD
; i
++)
1943 word
= operand_subword (x
, i
, 0, mode
);
1948 if (! assemble_integer (word
, UNITS_PER_WORD
, 0))
1952 if (i
== size
/ UNITS_PER_WORD
)
1954 /* If we output at least one word and then could not finish,
1955 there is no valid way to continue. */
1966 /* Assemble the floating-point constant D into an object of size MODE. */
1969 assemble_real (d
, mode
)
1971 enum machine_mode mode
;
1973 jmp_buf output_constant_handler
;
1975 if (setjmp (output_constant_handler
))
1977 error ("floating point trap outputting a constant");
1978 #ifdef REAL_IS_NOT_DOUBLE
1979 bzero ((char *) &d
, sizeof d
);
1986 set_float_handler (output_constant_handler
);
1990 #ifdef ASM_OUTPUT_BYTE_FLOAT
1992 ASM_OUTPUT_BYTE_FLOAT (asm_out_file
, d
);
1995 #ifdef ASM_OUTPUT_SHORT_FLOAT
1997 ASM_OUTPUT_SHORT_FLOAT (asm_out_file
, d
);
2000 #ifdef ASM_OUTPUT_THREE_QUARTER_FLOAT
2002 ASM_OUTPUT_THREE_QUARTER_FLOAT (asm_out_file
, d
);
2005 #ifdef ASM_OUTPUT_FLOAT
2007 ASM_OUTPUT_FLOAT (asm_out_file
, d
);
2011 #ifdef ASM_OUTPUT_DOUBLE
2013 ASM_OUTPUT_DOUBLE (asm_out_file
, d
);
2017 #ifdef ASM_OUTPUT_LONG_DOUBLE
2020 ASM_OUTPUT_LONG_DOUBLE (asm_out_file
, d
);
2028 set_float_handler (NULL_PTR
);
2031 /* Here we combine duplicate floating constants to make
2032 CONST_DOUBLE rtx's, and force those out to memory when necessary. */
2034 /* Return a CONST_DOUBLE or CONST_INT for a value specified as a pair of ints.
2035 For an integer, I0 is the low-order word and I1 is the high-order word.
2036 For a real number, I0 is the word with the low address
2037 and I1 is the word with the high address. */
2040 immed_double_const (i0
, i1
, mode
)
2041 HOST_WIDE_INT i0
, i1
;
2042 enum machine_mode mode
;
2046 if (GET_MODE_CLASS (mode
) == MODE_INT
2047 || GET_MODE_CLASS (mode
) == MODE_PARTIAL_INT
)
2049 /* We clear out all bits that don't belong in MODE, unless they and our
2050 sign bit are all one. So we get either a reasonable negative value
2051 or a reasonable unsigned value for this mode. */
2052 int width
= GET_MODE_BITSIZE (mode
);
2053 if (width
< HOST_BITS_PER_WIDE_INT
2054 && ((i0
& ((HOST_WIDE_INT
) (-1) << (width
- 1)))
2055 != ((HOST_WIDE_INT
) (-1) << (width
- 1))))
2056 i0
&= ((HOST_WIDE_INT
) 1 << width
) - 1, i1
= 0;
2057 else if (width
== HOST_BITS_PER_WIDE_INT
2058 && ! (i1
== ~0 && i0
< 0))
2060 else if (width
> 2 * HOST_BITS_PER_WIDE_INT
)
2061 /* We cannot represent this value as a constant. */
2064 /* If this would be an entire word for the target, but is not for
2065 the host, then sign-extend on the host so that the number will look
2066 the same way on the host that it would on the target.
2068 For example, when building a 64 bit alpha hosted 32 bit sparc
2069 targeted compiler, then we want the 32 bit unsigned value -1 to be
2070 represented as a 64 bit value -1, and not as 0x00000000ffffffff.
2071 The later confuses the sparc backend. */
2073 if (BITS_PER_WORD
< HOST_BITS_PER_WIDE_INT
&& BITS_PER_WORD
== width
2074 && (i0
& ((HOST_WIDE_INT
) 1 << (width
- 1))))
2075 i0
|= ((HOST_WIDE_INT
) (-1) << width
);
2077 /* If MODE fits within HOST_BITS_PER_WIDE_INT, always use a CONST_INT.
2079 ??? Strictly speaking, this is wrong if we create a CONST_INT
2080 for a large unsigned constant with the size of MODE being
2081 HOST_BITS_PER_WIDE_INT and later try to interpret that constant in a
2082 wider mode. In that case we will mis-interpret it as a negative
2085 Unfortunately, the only alternative is to make a CONST_DOUBLE
2086 for any constant in any mode if it is an unsigned constant larger
2087 than the maximum signed integer in an int on the host. However,
2088 doing this will break everyone that always expects to see a CONST_INT
2089 for SImode and smaller.
2091 We have always been making CONST_INTs in this case, so nothing new
2094 if (width
<= HOST_BITS_PER_WIDE_INT
)
2095 i1
= (i0
< 0) ? ~(HOST_WIDE_INT
) 0 : 0;
2097 /* If this integer fits in one word, return a CONST_INT. */
2098 if ((i1
== 0 && i0
>= 0)
2099 || (i1
== ~0 && i0
< 0))
2100 return GEN_INT (i0
);
2102 /* We use VOIDmode for integers. */
2106 /* Search the chain for an existing CONST_DOUBLE with the right value.
2107 If one is found, return it. */
2109 for (r
= const_double_chain
; r
; r
= CONST_DOUBLE_CHAIN (r
))
2110 if (CONST_DOUBLE_LOW (r
) == i0
&& CONST_DOUBLE_HIGH (r
) == i1
2111 && GET_MODE (r
) == mode
)
2114 /* No; make a new one and add it to the chain.
2116 We may be called by an optimizer which may be discarding any memory
2117 allocated during its processing (such as combine and loop). However,
2118 we will be leaving this constant on the chain, so we cannot tolerate
2119 freed memory. So switch to saveable_obstack for this allocation
2120 and then switch back if we were in current_obstack. */
2122 push_obstacks_nochange ();
2123 rtl_in_saveable_obstack ();
2124 r
= gen_rtx_CONST_DOUBLE (mode
, const0_rtx
, i0
, i1
);
2127 /* Don't touch const_double_chain if not inside any function. */
2128 if (current_function_decl
!= 0)
2130 CONST_DOUBLE_CHAIN (r
) = const_double_chain
;
2131 const_double_chain
= r
;
2137 /* Return a CONST_DOUBLE for a specified `double' value
2138 and machine mode. */
2141 immed_real_const_1 (d
, mode
)
2143 enum machine_mode mode
;
2145 union real_extract u
;
2148 /* Get the desired `double' value as a sequence of ints
2149 since that is how they are stored in a CONST_DOUBLE. */
2153 /* Detect special cases. But be careful we don't use a CONST_DOUBLE
2154 that's from a parent function since it may be in its constant pool. */
2155 if (REAL_VALUES_IDENTICAL (dconst0
, d
)
2156 && (cfun
== 0 || decl_function_context (current_function_decl
) == 0))
2157 return CONST0_RTX (mode
);
2159 /* Check for NaN first, because some ports (specifically the i386) do not
2160 emit correct ieee-fp code by default, and thus will generate a core
2161 dump here if we pass a NaN to REAL_VALUES_EQUAL and if REAL_VALUES_EQUAL
2162 does a floating point comparison. */
2163 else if ((! REAL_VALUE_ISNAN (d
) && REAL_VALUES_EQUAL (dconst1
, d
))
2165 || decl_function_context (current_function_decl
) == 0))
2166 return CONST1_RTX (mode
);
2168 if (sizeof u
== sizeof (HOST_WIDE_INT
))
2169 return immed_double_const (u
.i
[0], 0, mode
);
2170 if (sizeof u
== 2 * sizeof (HOST_WIDE_INT
))
2171 return immed_double_const (u
.i
[0], u
.i
[1], mode
);
2173 /* The rest of this function handles the case where
2174 a float value requires more than 2 ints of space.
2175 It will be deleted as dead code on machines that don't need it. */
2177 /* Search the chain for an existing CONST_DOUBLE with the right value.
2178 If one is found, return it. */
2180 for (r
= const_double_chain
; r
; r
= CONST_DOUBLE_CHAIN (r
))
2181 if (! bcmp ((char *) &CONST_DOUBLE_LOW (r
), (char *) &u
, sizeof u
)
2182 && GET_MODE (r
) == mode
)
2185 /* No; make a new one and add it to the chain.
2187 We may be called by an optimizer which may be discarding any memory
2188 allocated during its processing (such as combine and loop). However,
2189 we will be leaving this constant on the chain, so we cannot tolerate
2190 freed memory. So switch to saveable_obstack for this allocation
2191 and then switch back if we were in current_obstack. */
2192 push_obstacks_nochange ();
2193 rtl_in_saveable_obstack ();
2194 r
= rtx_alloc (CONST_DOUBLE
);
2197 bcopy ((char *) &u
, (char *) &CONST_DOUBLE_LOW (r
), sizeof u
);
2199 /* If we aren't inside a function, don't put r on the
2200 const_double_chain. */
2201 if (current_function_decl
!= 0)
2203 CONST_DOUBLE_CHAIN (r
) = const_double_chain
;
2204 const_double_chain
= r
;
2207 CONST_DOUBLE_CHAIN (r
) = NULL_RTX
;
2209 /* Store const0_rtx in CONST_DOUBLE_MEM since this CONST_DOUBLE is on the
2210 chain, but has not been allocated memory. Actual use of CONST_DOUBLE_MEM
2211 is only through force_const_mem. */
2213 CONST_DOUBLE_MEM (r
) = const0_rtx
;
2218 /* Return a CONST_DOUBLE rtx for a value specified by EXP,
2219 which must be a REAL_CST tree node. */
2222 immed_real_const (exp
)
2225 return immed_real_const_1 (TREE_REAL_CST (exp
), TYPE_MODE (TREE_TYPE (exp
)));
2228 /* At the end of a function, forget the memory-constants
2229 previously made for CONST_DOUBLEs. Mark them as not on real_constant_chain.
2230 Also clear out real_constant_chain and clear out all the chain-pointers. */
2233 clear_const_double_mem ()
2235 register rtx r
, next
;
2237 for (r
= const_double_chain
; r
; r
= next
)
2239 next
= CONST_DOUBLE_CHAIN (r
);
2240 CONST_DOUBLE_CHAIN (r
) = 0;
2241 CONST_DOUBLE_MEM (r
) = cc0_rtx
;
2243 const_double_chain
= 0;
2246 /* Given an expression EXP with a constant value,
2247 reduce it to the sum of an assembler symbol and an integer.
2248 Store them both in the structure *VALUE.
2249 Abort if EXP does not reduce. */
2254 HOST_WIDE_INT offset
;
2258 decode_addr_const (exp
, value
)
2260 struct addr_const
*value
;
2262 register tree target
= TREE_OPERAND (exp
, 0);
2263 register int offset
= 0;
2268 if (TREE_CODE (target
) == COMPONENT_REF
2269 && host_integerp (byte_position (TREE_OPERAND (target
, 1)), 0))
2272 offset
+= int_byte_position (TREE_OPERAND (target
, 1));
2273 target
= TREE_OPERAND (target
, 0);
2275 else if (TREE_CODE (target
) == ARRAY_REF
)
2277 offset
+= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (target
)), 1)
2278 * tree_low_cst (TREE_OPERAND (target
, 1), 0));
2279 target
= TREE_OPERAND (target
, 0);
2285 switch (TREE_CODE (target
))
2289 x
= DECL_RTL (target
);
2293 x
= gen_rtx_MEM (FUNCTION_MODE
,
2294 gen_rtx_LABEL_REF (VOIDmode
,
2295 label_rtx (TREE_OPERAND (exp
, 0))));
2303 x
= TREE_CST_RTL (target
);
2310 if (GET_CODE (x
) != MEM
)
2315 value
->offset
= offset
;
2318 /* Uniquize all constants that appear in memory.
2319 Each constant in memory thus far output is recorded
2320 in `const_hash_table' with a `struct constant_descriptor'
2321 that contains a polish representation of the value of
2324 We cannot store the trees in the hash table
2325 because the trees may be temporary. */
2327 struct constant_descriptor
2329 struct constant_descriptor
*next
;
2332 unsigned char contents
[1];
2336 #define MAX_HASH_TABLE 1009
2337 static struct constant_descriptor
*const_hash_table
[MAX_HASH_TABLE
];
2339 /* Mark a const_hash_table descriptor for GC. */
2342 mark_const_hash_entry (ptr
)
2345 struct constant_descriptor
*desc
= * (struct constant_descriptor
**) ptr
;
2349 ggc_mark_string ((const char *)desc
->label
);
2350 ggc_mark_rtx (desc
->rtl
);
2355 /* Compute a hash code for a constant expression. */
2361 register const char *p
;
2362 register int len
, hi
, i
;
2363 register enum tree_code code
= TREE_CODE (exp
);
2365 /* Either set P and LEN to the address and len of something to hash and
2366 exit the switch or return a value. */
2371 p
= (char *) &TREE_INT_CST_LOW (exp
);
2372 len
= 2 * sizeof TREE_INT_CST_LOW (exp
);
2376 p
= (char *) &TREE_REAL_CST (exp
);
2377 len
= sizeof TREE_REAL_CST (exp
);
2381 p
= TREE_STRING_POINTER (exp
);
2382 len
= TREE_STRING_LENGTH (exp
);
2386 return (const_hash (TREE_REALPART (exp
)) * 5
2387 + const_hash (TREE_IMAGPART (exp
)));
2390 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2394 len
= int_size_in_bytes (TREE_TYPE (exp
));
2395 tmp
= (char *) alloca (len
);
2396 get_set_constructor_bytes (exp
, (unsigned char *) tmp
, len
);
2404 /* For record type, include the type in the hashing.
2405 We do not do so for array types
2406 because (1) the sizes of the elements are sufficient
2407 and (2) distinct array types can have the same constructor.
2408 Instead, we include the array size because the constructor could
2410 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2411 hi
= ((unsigned long) TREE_TYPE (exp
) & ((1 << HASHBITS
) - 1))
2414 hi
= ((5 + int_size_in_bytes (TREE_TYPE (exp
)))
2415 & ((1 << HASHBITS
) - 1)) % MAX_HASH_TABLE
;
2417 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2418 if (TREE_VALUE (link
))
2420 = (hi
* 603 + const_hash (TREE_VALUE (link
))) % MAX_HASH_TABLE
;
2427 struct addr_const value
;
2429 decode_addr_const (exp
, &value
);
2430 if (GET_CODE (value
.base
) == SYMBOL_REF
)
2432 /* Don't hash the address of the SYMBOL_REF;
2433 only use the offset and the symbol name. */
2435 p
= XSTR (value
.base
, 0);
2436 for (i
= 0; p
[i
] != 0; i
++)
2437 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2439 else if (GET_CODE (value
.base
) == LABEL_REF
)
2440 hi
= value
.offset
+ CODE_LABEL_NUMBER (XEXP (value
.base
, 0)) * 13;
2444 hi
&= (1 << HASHBITS
) - 1;
2445 hi
%= MAX_HASH_TABLE
;
2451 return (const_hash (TREE_OPERAND (exp
, 0)) * 9
2452 + const_hash (TREE_OPERAND (exp
, 1)));
2456 case NON_LVALUE_EXPR
:
2457 return const_hash (TREE_OPERAND (exp
, 0)) * 7 + 2;
2460 /* A language specific constant. Just hash the code. */
2461 return code
% MAX_HASH_TABLE
;
2464 /* Compute hashing function */
2466 for (i
= 0; i
< len
; i
++)
2467 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2469 hi
&= (1 << HASHBITS
) - 1;
2470 hi
%= MAX_HASH_TABLE
;
2474 /* Compare a constant expression EXP with a constant-descriptor DESC.
2475 Return 1 if DESC describes a constant with the same value as EXP. */
2478 compare_constant (exp
, desc
)
2480 struct constant_descriptor
*desc
;
2482 return 0 != compare_constant_1 (exp
, desc
->contents
);
2485 /* Compare constant expression EXP with a substring P of a constant descriptor.
2486 If they match, return a pointer to the end of the substring matched.
2487 If they do not match, return 0.
2489 Since descriptors are written in polish prefix notation,
2490 this function can be used recursively to test one operand of EXP
2491 against a subdescriptor, and if it succeeds it returns the
2492 address of the subdescriptor for the next operand. */
2494 static const unsigned char *
2495 compare_constant_1 (exp
, p
)
2497 const unsigned char *p
;
2499 register const unsigned char *strp
;
2501 register enum tree_code code
= TREE_CODE (exp
);
2503 if (code
!= (enum tree_code
) *p
++)
2506 /* Either set STRP, P and LEN to pointers and length to compare and exit the
2507 switch, or return the result of the comparison. */
2512 /* Integer constants are the same only if the same width of type. */
2513 if (*p
++ != TYPE_PRECISION (TREE_TYPE (exp
)))
2516 strp
= (unsigned char *) &TREE_INT_CST_LOW (exp
);
2517 len
= 2 * sizeof TREE_INT_CST_LOW (exp
);
2521 /* Real constants are the same only if the same width of type. */
2522 if (*p
++ != TYPE_PRECISION (TREE_TYPE (exp
)))
2525 strp
= (unsigned char *) &TREE_REAL_CST (exp
);
2526 len
= sizeof TREE_REAL_CST (exp
);
2530 if (flag_writable_strings
)
2533 if ((enum machine_mode
) *p
++ != TYPE_MODE (TREE_TYPE (exp
)))
2536 strp
= (unsigned char *)TREE_STRING_POINTER (exp
);
2537 len
= TREE_STRING_LENGTH (exp
);
2538 if (bcmp ((char *) &TREE_STRING_LENGTH (exp
), p
,
2539 sizeof TREE_STRING_LENGTH (exp
)))
2542 p
+= sizeof TREE_STRING_LENGTH (exp
);
2546 p
= compare_constant_1 (TREE_REALPART (exp
), p
);
2550 return compare_constant_1 (TREE_IMAGPART (exp
), p
);
2553 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2555 int xlen
= len
= int_size_in_bytes (TREE_TYPE (exp
));
2556 unsigned char *tmp
= (unsigned char *) alloca (len
);
2558 get_set_constructor_bytes (exp
, tmp
, len
);
2559 strp
= (unsigned char *) tmp
;
2560 if (bcmp ((char *) &xlen
, p
, sizeof xlen
))
2569 int length
= list_length (CONSTRUCTOR_ELTS (exp
));
2571 enum machine_mode mode
= TYPE_MODE (TREE_TYPE (exp
));
2572 int have_purpose
= 0;
2574 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2575 if (TREE_PURPOSE (link
))
2578 if (bcmp ((char *) &length
, p
, sizeof length
))
2583 /* For record constructors, insist that the types match.
2584 For arrays, just verify both constructors are for arrays.
2585 Then insist that either both or none have any TREE_PURPOSE
2587 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2588 type
= TREE_TYPE (exp
);
2592 if (bcmp ((char *) &type
, p
, sizeof type
))
2595 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2597 if (bcmp ((char *) &mode
, p
, sizeof mode
))
2605 if (bcmp ((char *) &have_purpose
, p
, sizeof have_purpose
))
2608 p
+= sizeof have_purpose
;
2610 /* For arrays, insist that the size in bytes match. */
2611 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2613 HOST_WIDE_INT size
= int_size_in_bytes (TREE_TYPE (exp
));
2615 if (bcmp ((char *) &size
, p
, sizeof size
))
2621 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2623 if (TREE_VALUE (link
))
2625 if ((p
= compare_constant_1 (TREE_VALUE (link
), p
)) == 0)
2632 if (bcmp ((char *) &zero
, p
, sizeof zero
))
2638 if (TREE_PURPOSE (link
)
2639 && TREE_CODE (TREE_PURPOSE (link
)) == FIELD_DECL
)
2641 if (bcmp ((char *) &TREE_PURPOSE (link
), p
,
2642 sizeof TREE_PURPOSE (link
)))
2645 p
+= sizeof TREE_PURPOSE (link
);
2647 else if (TREE_PURPOSE (link
))
2649 if ((p
= compare_constant_1 (TREE_PURPOSE (link
), p
)) == 0)
2652 else if (have_purpose
)
2656 if (bcmp ((char *) &zero
, p
, sizeof zero
))
2668 struct addr_const value
;
2670 decode_addr_const (exp
, &value
);
2671 strp
= (unsigned char *) &value
.offset
;
2672 len
= sizeof value
.offset
;
2673 /* Compare the offset. */
2675 if (*p
++ != *strp
++)
2678 /* Compare symbol name. */
2679 strp
= (unsigned char *) XSTR (value
.base
, 0);
2680 len
= strlen ((char *) strp
) + 1;
2687 p
= compare_constant_1 (TREE_OPERAND (exp
, 0), p
);
2691 return compare_constant_1 (TREE_OPERAND (exp
, 1), p
);
2695 case NON_LVALUE_EXPR
:
2696 return compare_constant_1 (TREE_OPERAND (exp
, 0), p
);
2699 if (lang_expand_constant
)
2701 exp
= (*lang_expand_constant
) (exp
);
2702 return compare_constant_1 (exp
, p
);
2707 /* Compare constant contents. */
2709 if (*p
++ != *strp
++)
2715 /* Construct a constant descriptor for the expression EXP.
2716 It is up to the caller to enter the descriptor in the hash table. */
2718 static struct constant_descriptor
*
2719 record_constant (exp
)
2722 struct constant_descriptor
*next
= 0;
2726 /* Make a struct constant_descriptor. The first three pointers will
2727 be filled in later. Here we just leave space for them. */
2729 obstack_grow (&permanent_obstack
, (char *) &next
, sizeof next
);
2730 obstack_grow (&permanent_obstack
, (char *) &label
, sizeof label
);
2731 obstack_grow (&permanent_obstack
, (char *) &rtl
, sizeof rtl
);
2732 record_constant_1 (exp
);
2733 return (struct constant_descriptor
*) obstack_finish (&permanent_obstack
);
2736 /* Add a description of constant expression EXP
2737 to the object growing in `permanent_obstack'.
2738 No need to return its address; the caller will get that
2739 from the obstack when the object is complete. */
2742 record_constant_1 (exp
)
2745 register unsigned char *strp
;
2747 register enum tree_code code
= TREE_CODE (exp
);
2749 obstack_1grow (&permanent_obstack
, (unsigned int) code
);
2754 obstack_1grow (&permanent_obstack
, TYPE_PRECISION (TREE_TYPE (exp
)));
2755 strp
= (unsigned char *) &TREE_INT_CST_LOW (exp
);
2756 len
= 2 * sizeof TREE_INT_CST_LOW (exp
);
2760 obstack_1grow (&permanent_obstack
, TYPE_PRECISION (TREE_TYPE (exp
)));
2761 strp
= (unsigned char *) &TREE_REAL_CST (exp
);
2762 len
= sizeof TREE_REAL_CST (exp
);
2766 if (flag_writable_strings
)
2769 obstack_1grow (&permanent_obstack
, TYPE_MODE (TREE_TYPE (exp
)));
2770 strp
= (unsigned char *) TREE_STRING_POINTER (exp
);
2771 len
= TREE_STRING_LENGTH (exp
);
2772 obstack_grow (&permanent_obstack
, (char *) &TREE_STRING_LENGTH (exp
),
2773 sizeof TREE_STRING_LENGTH (exp
));
2777 record_constant_1 (TREE_REALPART (exp
));
2778 record_constant_1 (TREE_IMAGPART (exp
));
2782 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2784 int nbytes
= int_size_in_bytes (TREE_TYPE (exp
));
2785 obstack_grow (&permanent_obstack
, &nbytes
, sizeof (nbytes
));
2786 obstack_blank (&permanent_obstack
, nbytes
);
2787 get_set_constructor_bytes
2788 (exp
, (unsigned char *) permanent_obstack
.next_free
-nbytes
,
2795 int length
= list_length (CONSTRUCTOR_ELTS (exp
));
2796 enum machine_mode mode
= TYPE_MODE (TREE_TYPE (exp
));
2798 int have_purpose
= 0;
2800 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2801 if (TREE_PURPOSE (link
))
2804 obstack_grow (&permanent_obstack
, (char *) &length
, sizeof length
);
2806 /* For record constructors, insist that the types match.
2807 For arrays, just verify both constructors are for arrays
2808 of the same mode. Then insist that either both or none
2809 have any TREE_PURPOSE values. */
2810 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2811 type
= TREE_TYPE (exp
);
2815 obstack_grow (&permanent_obstack
, (char *) &type
, sizeof type
);
2816 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2817 obstack_grow (&permanent_obstack
, &mode
, sizeof mode
);
2819 obstack_grow (&permanent_obstack
, (char *) &have_purpose
,
2820 sizeof have_purpose
);
2822 /* For arrays, insist that the size in bytes match. */
2823 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2825 HOST_WIDE_INT size
= int_size_in_bytes (TREE_TYPE (exp
));
2826 obstack_grow (&permanent_obstack
, (char *) &size
, sizeof size
);
2829 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2831 if (TREE_VALUE (link
))
2832 record_constant_1 (TREE_VALUE (link
));
2837 obstack_grow (&permanent_obstack
,
2838 (char *) &zero
, sizeof zero
);
2841 if (TREE_PURPOSE (link
)
2842 && TREE_CODE (TREE_PURPOSE (link
)) == FIELD_DECL
)
2843 obstack_grow (&permanent_obstack
,
2844 (char *) &TREE_PURPOSE (link
),
2845 sizeof TREE_PURPOSE (link
));
2846 else if (TREE_PURPOSE (link
))
2847 record_constant_1 (TREE_PURPOSE (link
));
2848 else if (have_purpose
)
2852 obstack_grow (&permanent_obstack
,
2853 (char *) &zero
, sizeof zero
);
2861 struct addr_const value
;
2863 decode_addr_const (exp
, &value
);
2864 /* Record the offset. */
2865 obstack_grow (&permanent_obstack
,
2866 (char *) &value
.offset
, sizeof value
.offset
);
2868 switch (GET_CODE (value
.base
))
2871 /* Record the symbol name. */
2872 obstack_grow (&permanent_obstack
, XSTR (value
.base
, 0),
2873 strlen (XSTR (value
.base
, 0)) + 1);
2876 /* Record the address of the CODE_LABEL. It may not have
2877 been emitted yet, so it's UID may be zero. But pointer
2878 identity is good enough. */
2879 obstack_grow (&permanent_obstack
, &XEXP (value
.base
, 0),
2891 record_constant_1 (TREE_OPERAND (exp
, 0));
2892 record_constant_1 (TREE_OPERAND (exp
, 1));
2897 case NON_LVALUE_EXPR
:
2898 record_constant_1 (TREE_OPERAND (exp
, 0));
2902 if (lang_expand_constant
)
2904 exp
= (*lang_expand_constant
) (exp
);
2905 record_constant_1 (exp
);
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 set_mem_attributes (desc
->rtl
, exp
, 1);
3118 TREE_CST_RTL (exp
) = desc
->rtl
;
3120 /* Optionally set flags or add text to the name to record information
3121 such as that it is a function name. If the name is changed, the macro
3122 ASM_OUTPUT_LABELREF will have to know how to strip this information. */
3123 #ifdef ENCODE_SECTION_INFO
3124 ENCODE_SECTION_INFO (exp
);
3127 /* If this is the first time we've seen this particular constant,
3128 output it (or defer its output for later). */
3131 int after_function
= 0;
3133 #ifdef CONSTANT_AFTER_FUNCTION_P
3134 if (current_function_decl
!= 0
3135 && CONSTANT_AFTER_FUNCTION_P (exp
))
3139 if (defer_addressed_constants_flag
|| after_function
)
3141 struct deferred_constant
*p
;
3142 p
= (struct deferred_constant
*) xmalloc (sizeof (struct deferred_constant
));
3144 push_obstacks_nochange ();
3145 suspend_momentary ();
3146 p
->exp
= copy_constant (exp
);
3149 p
->labelno
= const_labelno
++;
3152 p
->next
= after_function_constants
;
3153 after_function_constants
= p
;
3157 p
->next
= deferred_constants
;
3158 deferred_constants
= p
;
3163 /* Do no output if -fsyntax-only. */
3164 if (! flag_syntax_only
)
3165 output_constant_def_contents (exp
, reloc
, const_labelno
);
3170 return TREE_CST_RTL (exp
);
3173 /* Now output assembler code to define the label for EXP,
3174 and follow it with the data of EXP. */
3177 output_constant_def_contents (exp
, reloc
, labelno
)
3184 if (IN_NAMED_SECTION (exp
))
3185 named_section (exp
, NULL
, reloc
);
3188 /* First switch to text section, except for writable strings. */
3189 #ifdef SELECT_SECTION
3190 SELECT_SECTION (exp
, reloc
);
3192 if (((TREE_CODE (exp
) == STRING_CST
) && flag_writable_strings
)
3193 || (flag_pic
&& reloc
))
3196 readonly_data_section ();
3200 /* Align the location counter as required by EXP's data type. */
3201 align
= TYPE_ALIGN (TREE_TYPE (exp
));
3202 #ifdef CONSTANT_ALIGNMENT
3203 align
= CONSTANT_ALIGNMENT (exp
, align
);
3206 if (align
> BITS_PER_UNIT
)
3207 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
3209 /* Output the label itself. */
3210 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LC", labelno
);
3212 /* Output the value of EXP. */
3213 output_constant (exp
,
3214 (TREE_CODE (exp
) == STRING_CST
3215 ? TREE_STRING_LENGTH (exp
)
3216 : int_size_in_bytes (TREE_TYPE (exp
))));
3220 /* Structure to represent sufficient information about a constant so that
3221 it can be output when the constant pool is output, so that function
3222 integration can be done, and to simplify handling on machines that reference
3223 constant pool as base+displacement. */
3225 struct pool_constant
3227 struct constant_descriptor
*desc
;
3228 struct pool_constant
*next
;
3229 enum machine_mode mode
;
3237 /* Structure used to maintain hash table mapping symbols used to their
3238 corresponding constants. */
3243 struct pool_constant
*pool
;
3244 struct pool_sym
*next
;
3247 /* Hash code for a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true.
3248 The argument is XSTR (... , 0) */
3250 #define SYMHASH(LABEL) \
3251 ((((unsigned long) (LABEL)) & ((1 << HASHBITS) - 1)) % MAX_RTX_HASH_TABLE)
3253 /* Initialize constant pool hashing for a new function. */
3256 init_varasm_status (f
)
3259 struct varasm_status
*p
;
3260 p
= (struct varasm_status
*) xmalloc (sizeof (struct varasm_status
));
3262 p
->x_const_rtx_hash_table
3263 = ((struct constant_descriptor
**)
3264 xmalloc (MAX_RTX_HASH_TABLE
* sizeof (struct constant_descriptor
*)));
3265 p
->x_const_rtx_sym_hash_table
3266 = ((struct pool_sym
**)
3267 xmalloc (MAX_RTX_HASH_TABLE
* sizeof (struct pool_sym
*)));
3268 bzero ((char *) p
->x_const_rtx_hash_table
,
3269 MAX_RTX_HASH_TABLE
* sizeof (struct constant_descriptor
*));
3270 bzero ((char *) p
->x_const_rtx_sym_hash_table
,
3271 MAX_RTX_HASH_TABLE
* sizeof (struct pool_sym
*));
3273 p
->x_first_pool
= p
->x_last_pool
= 0;
3274 p
->x_pool_offset
= 0;
3275 p
->x_const_double_chain
= 0;
3278 /* Mark PC for GC. */
3281 mark_pool_constant (pc
)
3282 struct pool_constant
*pc
;
3286 ggc_mark_rtx (pc
->constant
);
3291 /* Mark PPS for GC. */
3294 mark_pool_sym_hash_table (pps
)
3295 struct pool_sym
**pps
;
3297 struct pool_sym
*ps
;
3300 for (i
= 0; i
< MAX_RTX_HASH_TABLE
; ++i
)
3301 for (ps
= pps
[i
]; ps
; ps
= ps
->next
)
3302 ggc_mark_string (ps
->label
);
3305 /* Mark P for GC. */
3308 mark_varasm_status (p
)
3309 struct varasm_status
*p
;
3314 mark_pool_constant (p
->x_first_pool
);
3315 mark_pool_sym_hash_table (p
->x_const_rtx_sym_hash_table
);
3316 ggc_mark_rtx (p
->x_const_double_chain
);
3319 /* Clear out all parts of the state in F that can safely be discarded
3320 after the function has been compiled, to let garbage collection
3321 reclaim the memory. */
3324 free_varasm_status (f
)
3327 struct varasm_status
*p
;
3330 free (p
->x_const_rtx_hash_table
);
3331 free (p
->x_const_rtx_sym_hash_table
);
3336 enum kind
{ RTX_DOUBLE
, RTX_INT
};
3340 #ifdef ONLY_INT_FIELDS
3341 unsigned int kind
: 16;
3342 unsigned int mode
: 16;
3344 enum kind kind
: 16;
3345 enum machine_mode mode
: 16;
3348 union real_extract du
;
3349 struct addr_const addr
;
3350 struct {HOST_WIDE_INT high
, low
;} di
;
3354 /* Express an rtx for a constant integer (perhaps symbolic)
3355 as the sum of a symbol or label plus an explicit integer.
3356 They are stored into VALUE. */
3359 decode_rtx_const (mode
, x
, value
)
3360 enum machine_mode mode
;
3362 struct rtx_const
*value
;
3364 /* Clear the whole structure, including any gaps. */
3367 int *p
= (int *) value
;
3368 int *end
= (int *) (value
+ 1);
3373 value
->kind
= RTX_INT
; /* Most usual kind. */
3376 switch (GET_CODE (x
))
3379 value
->kind
= RTX_DOUBLE
;
3380 if (GET_MODE (x
) != VOIDmode
)
3382 value
->mode
= GET_MODE (x
);
3383 bcopy ((char *) &CONST_DOUBLE_LOW (x
),
3384 (char *) &value
->un
.du
, sizeof value
->un
.du
);
3388 value
->un
.di
.low
= CONST_DOUBLE_LOW (x
);
3389 value
->un
.di
.high
= CONST_DOUBLE_HIGH (x
);
3394 value
->un
.addr
.offset
= INTVAL (x
);
3400 value
->un
.addr
.base
= x
;
3405 if (GET_CODE (x
) == PLUS
)
3407 value
->un
.addr
.base
= XEXP (x
, 0);
3408 if (GET_CODE (XEXP (x
, 1)) != CONST_INT
)
3410 value
->un
.addr
.offset
= INTVAL (XEXP (x
, 1));
3412 else if (GET_CODE (x
) == MINUS
)
3414 value
->un
.addr
.base
= XEXP (x
, 0);
3415 if (GET_CODE (XEXP (x
, 1)) != CONST_INT
)
3417 value
->un
.addr
.offset
= - INTVAL (XEXP (x
, 1));
3427 if (value
->kind
== RTX_INT
&& value
->un
.addr
.base
!= 0)
3428 switch (GET_CODE (value
->un
.addr
.base
))
3431 /* Use the string's address, not the SYMBOL_REF's address,
3432 for the sake of addresses of library routines. */
3433 value
->un
.addr
.base
= (rtx
) XSTR (value
->un
.addr
.base
, 0);
3437 /* For a LABEL_REF, compare labels. */
3438 value
->un
.addr
.base
= XEXP (value
->un
.addr
.base
, 0);
3445 /* Given a MINUS expression, simplify it if both sides
3446 include the same symbol. */
3449 simplify_subtraction (x
)
3452 struct rtx_const val0
, val1
;
3454 decode_rtx_const (GET_MODE (x
), XEXP (x
, 0), &val0
);
3455 decode_rtx_const (GET_MODE (x
), XEXP (x
, 1), &val1
);
3457 if (val0
.un
.addr
.base
== val1
.un
.addr
.base
)
3458 return GEN_INT (val0
.un
.addr
.offset
- val1
.un
.addr
.offset
);
3462 /* Compute a hash code for a constant RTL expression. */
3465 const_hash_rtx (mode
, x
)
3466 enum machine_mode mode
;
3472 struct rtx_const value
;
3473 decode_rtx_const (mode
, x
, &value
);
3475 /* Compute hashing function */
3477 for (i
= 0; i
< sizeof value
/ sizeof (int); i
++)
3478 hi
+= ((int *) &value
)[i
];
3480 hi
&= (1 << HASHBITS
) - 1;
3481 hi
%= MAX_RTX_HASH_TABLE
;
3485 /* Compare a constant rtl object X with a constant-descriptor DESC.
3486 Return 1 if DESC describes a constant with the same value as X. */
3489 compare_constant_rtx (mode
, x
, desc
)
3490 enum machine_mode mode
;
3492 struct constant_descriptor
*desc
;
3494 register int *p
= (int *) desc
->contents
;
3497 struct rtx_const value
;
3499 decode_rtx_const (mode
, x
, &value
);
3500 strp
= (int *) &value
;
3501 len
= sizeof value
/ sizeof (int);
3503 /* Compare constant contents. */
3505 if (*p
++ != *strp
++)
3511 /* Construct a constant descriptor for the rtl-expression X.
3512 It is up to the caller to enter the descriptor in the hash table. */
3514 static struct constant_descriptor
*
3515 record_constant_rtx (mode
, x
)
3516 enum machine_mode mode
;
3519 struct constant_descriptor
*ptr
;
3522 struct rtx_const value
;
3524 decode_rtx_const (mode
, x
, &value
);
3526 /* Put these things in the saveable obstack so we can ensure it won't
3527 be freed if we are called from combine or some other phase that discards
3528 memory allocated from function_obstack (current_obstack). */
3529 obstack_grow (saveable_obstack
, &ptr
, sizeof ptr
);
3530 obstack_grow (saveable_obstack
, &label
, sizeof label
);
3531 obstack_grow (saveable_obstack
, &rtl
, sizeof rtl
);
3533 /* Record constant contents. */
3534 obstack_grow (saveable_obstack
, &value
, sizeof value
);
3536 return (struct constant_descriptor
*) obstack_finish (saveable_obstack
);
3539 /* Given a constant rtx X, make (or find) a memory constant for its value
3540 and return a MEM rtx to refer to it in memory. */
3543 force_const_mem (mode
, x
)
3544 enum machine_mode mode
;
3548 register struct constant_descriptor
*desc
;
3553 /* If we want this CONST_DOUBLE in the same mode as it is in memory
3554 (this will always be true for floating CONST_DOUBLEs that have been
3555 placed in memory, but not for VOIDmode (integer) CONST_DOUBLEs),
3556 use the previous copy. Otherwise, make a new one. Note that in
3557 the unlikely event that this same CONST_DOUBLE is used in two different
3558 modes in an alternating fashion, we will allocate a lot of different
3559 memory locations, but this should be extremely rare. */
3561 if (GET_CODE (x
) == CONST_DOUBLE
3562 && GET_CODE (CONST_DOUBLE_MEM (x
)) == MEM
3563 && GET_MODE (CONST_DOUBLE_MEM (x
)) == mode
)
3564 return CONST_DOUBLE_MEM (x
);
3566 /* Compute hash code of X. Search the descriptors for that hash code
3567 to see if any of them describes X. If yes, the descriptor records
3568 the label number already assigned. */
3570 hash
= const_hash_rtx (mode
, x
);
3572 for (desc
= const_rtx_hash_table
[hash
]; desc
; desc
= desc
->next
)
3573 if (compare_constant_rtx (mode
, x
, desc
))
3575 found
= desc
->label
;
3581 register struct pool_constant
*pool
;
3582 register struct pool_sym
*sym
;
3585 /* No constant equal to X is known to have been output.
3586 Make a constant descriptor to enter X in the hash table.
3587 Assign the label number and record it in the descriptor for
3588 future calls to this function to find. */
3590 desc
= record_constant_rtx (mode
, x
);
3591 desc
->next
= const_rtx_hash_table
[hash
];
3592 const_rtx_hash_table
[hash
] = desc
;
3594 /* Align the location counter as required by EXP's data type. */
3595 align
= (mode
== VOIDmode
) ? UNITS_PER_WORD
: GET_MODE_SIZE (mode
);
3596 if (align
> BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
3597 align
= BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
;
3598 #ifdef CONSTANT_ALIGNMENT
3599 align
= CONSTANT_ALIGNMENT (make_tree (type_for_mode (mode
, 0), x
),
3600 align
* BITS_PER_UNIT
) / BITS_PER_UNIT
;
3603 pool_offset
+= align
- 1;
3604 pool_offset
&= ~ (align
- 1);
3606 /* If RTL is not being placed into the saveable obstack, make a
3607 copy of X that is in the saveable obstack in case we are
3608 being called from combine or some other phase that discards
3609 memory it allocates. We used to only do this if it is a
3610 CONST; however, reload can allocate a CONST_INT when
3611 eliminating registers. */
3612 if (rtl_obstack
!= saveable_obstack
3613 && (GET_CODE (x
) == CONST
|| GET_CODE (x
) == CONST_INT
))
3615 push_obstacks_nochange ();
3616 rtl_in_saveable_obstack ();
3618 if (GET_CODE (x
) == CONST
)
3619 x
= gen_rtx_CONST (GET_MODE (x
),
3620 gen_rtx_PLUS (GET_MODE (x
),
3621 XEXP (XEXP (x
, 0), 0),
3622 XEXP (XEXP (x
, 0), 1)));
3624 x
= GEN_INT (INTVAL (x
));
3629 /* Allocate a pool constant descriptor, fill it in, and chain it in. */
3631 pool
= (struct pool_constant
*) savealloc (sizeof (struct pool_constant
));
3635 pool
->labelno
= const_labelno
;
3636 pool
->align
= align
;
3637 pool
->offset
= pool_offset
;
3644 last_pool
->next
= pool
;
3647 pool_offset
+= GET_MODE_SIZE (mode
);
3649 /* Create a string containing the label name, in LABEL. */
3650 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
3654 desc
->label
= found
= ggc_alloc_string (label
, -1);
3656 /* Add label to symbol hash table. */
3657 hash
= SYMHASH (found
);
3658 sym
= (struct pool_sym
*) savealloc (sizeof (struct pool_sym
));
3661 sym
->next
= const_rtx_sym_hash_table
[hash
];
3662 const_rtx_sym_hash_table
[hash
] = sym
;
3665 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
3667 def
= gen_rtx_MEM (mode
, gen_rtx_SYMBOL_REF (Pmode
, found
));
3668 set_mem_attributes (def
, type_for_mode (mode
, 0), 1);
3669 RTX_UNCHANGING_P (def
) = 1;
3671 /* Mark the symbol_ref as belonging to this constants pool. */
3672 CONSTANT_POOL_ADDRESS_P (XEXP (def
, 0)) = 1;
3673 current_function_uses_const_pool
= 1;
3675 if (GET_CODE (x
) == CONST_DOUBLE
)
3677 if (CONST_DOUBLE_MEM (x
) == cc0_rtx
)
3679 CONST_DOUBLE_CHAIN (x
) = const_double_chain
;
3680 const_double_chain
= x
;
3682 CONST_DOUBLE_MEM (x
) = def
;
3688 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
3689 the corresponding pool_constant structure. */
3691 static struct pool_constant
*
3692 find_pool_constant (f
, addr
)
3696 struct pool_sym
*sym
;
3697 const char *label
= XSTR (addr
, 0);
3699 for (sym
= f
->varasm
->x_const_rtx_sym_hash_table
[SYMHASH (label
)]; sym
;
3701 if (sym
->label
== label
)
3707 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
3710 get_pool_constant (addr
)
3713 return (find_pool_constant (cfun
, addr
))->constant
;
3716 /* Likewise, but for the constant pool of a specific function. */
3719 get_pool_constant_for_function (f
, addr
)
3723 return (find_pool_constant (f
, addr
))->constant
;
3726 /* Similar, return the mode. */
3729 get_pool_mode (addr
)
3732 return (find_pool_constant (cfun
, addr
))->mode
;
3736 get_pool_mode_for_function (f
, addr
)
3740 return (find_pool_constant (f
, addr
))->mode
;
3743 /* Similar, return the offset in the constant pool. */
3746 get_pool_offset (addr
)
3749 return (find_pool_constant (cfun
, addr
))->offset
;
3752 /* Return the size of the constant pool. */
3760 /* Write all the constants in the constant pool. */
3763 output_constant_pool (fnname
, fndecl
)
3764 const char *fnname ATTRIBUTE_UNUSED
;
3765 tree fndecl ATTRIBUTE_UNUSED
;
3767 struct pool_constant
*pool
;
3769 union real_extract u
;
3771 /* It is possible for gcc to call force_const_mem and then to later
3772 discard the instructions which refer to the constant. In such a
3773 case we do not need to output the constant. */
3774 mark_constant_pool ();
3776 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3777 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3780 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3789 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3790 whose CODE_LABEL has been deleted. This can occur if a jump table
3791 is eliminated by optimization. If so, write a constant of zero
3792 instead. Note that this can also happen by turning the
3793 CODE_LABEL into a NOTE. */
3794 /* ??? This seems completely and utterly wrong. Certainly it's
3795 not true for NOTE_INSN_DELETED_LABEL, but I disbelieve proper
3796 functioning even with INSN_DELETED_P and friends. */
3799 switch (GET_CODE (x
))
3802 if (GET_CODE (XEXP (x
, 0)) != PLUS
3803 || GET_CODE (XEXP (XEXP (x
, 0), 0)) != LABEL_REF
)
3805 tmp
= XEXP (XEXP (x
, 0), 0);
3810 if (INSN_DELETED_P (tmp
)
3811 || (GET_CODE (tmp
) == NOTE
3812 && NOTE_LINE_NUMBER (tmp
) == NOTE_INSN_DELETED
))
3823 /* First switch to correct section. */
3824 #ifdef SELECT_RTX_SECTION
3825 SELECT_RTX_SECTION (pool
->mode
, x
);
3827 readonly_data_section ();
3830 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3831 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file
, x
, pool
->mode
,
3832 pool
->align
, pool
->labelno
, done
);
3835 if (pool
->align
> 1)
3836 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (pool
->align
));
3838 /* Output the label. */
3839 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LC", pool
->labelno
);
3841 /* Output the value of the constant itself. */
3842 switch (GET_MODE_CLASS (pool
->mode
))
3845 if (GET_CODE (x
) != CONST_DOUBLE
)
3848 bcopy ((char *) &CONST_DOUBLE_LOW (x
), (char *) &u
, sizeof u
);
3849 assemble_real (u
.d
, pool
->mode
);
3853 case MODE_PARTIAL_INT
:
3854 assemble_integer (x
, GET_MODE_SIZE (pool
->mode
), 1);
3861 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3867 #ifdef ASM_OUTPUT_POOL_EPILOGUE
3868 ASM_OUTPUT_POOL_EPILOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3871 /* Done with this pool. */
3872 first_pool
= last_pool
= 0;
3875 /* Look through the instructions for this function, and mark all the
3876 entries in the constant pool which are actually being used. */
3879 mark_constant_pool ()
3882 struct pool_constant
*pool
;
3884 if (first_pool
== 0)
3887 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3890 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
3891 if (GET_RTX_CLASS (GET_CODE (insn
)) == 'i')
3892 mark_constants (PATTERN (insn
));
3894 for (insn
= current_function_epilogue_delay_list
;
3896 insn
= XEXP (insn
, 1))
3897 if (GET_RTX_CLASS (GET_CODE (insn
)) == 'i')
3898 mark_constants (PATTERN (insn
));
3900 /* It's possible that the only reference to a symbol is in a symbol
3901 that's in the constant pool. This happens in Fortran under some
3902 situations. (When the constant contains the address of another
3903 constant, and only the first is used directly in an insn.)
3904 This is potentially suboptimal if there's ever a possibility of
3905 backwards (in pool order) 2'd level references. However, it's
3906 not clear that 2'd level references can happen. */
3907 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3909 struct pool_sym
*sym
;
3912 /* skip unmarked entries; no insn refers to them. */
3916 /* Skip everything except SYMBOL_REFs. */
3917 if (GET_CODE (pool
->constant
) != SYMBOL_REF
)
3919 label
= XSTR (pool
->constant
, 0);
3921 /* Be sure the symbol's value is marked. */
3922 for (sym
= const_rtx_sym_hash_table
[SYMHASH (label
)]; sym
;
3924 if (sym
->label
== label
)
3925 sym
->pool
->mark
= 1;
3926 /* If we didn't find it, there's something truly wrong here, but it
3927 will be announced by the assembler. */
3936 register const char *format_ptr
;
3941 if (GET_CODE (x
) == SYMBOL_REF
)
3943 if (CONSTANT_POOL_ADDRESS_P (x
))
3944 find_pool_constant (cfun
, x
)->mark
= 1;
3947 /* Never search inside a CONST_DOUBLE, because CONST_DOUBLE_MEM may be
3948 a MEM, but does not constitute a use of that MEM. */
3949 else if (GET_CODE (x
) == CONST_DOUBLE
)
3952 /* Insns may appear inside a SEQUENCE. Only check the patterns of
3953 insns, not any notes that may be attached. We don't want to mark
3954 a constant just because it happens to appear in a REG_EQUIV note. */
3955 if (GET_RTX_CLASS (GET_CODE (x
)) == 'i')
3957 mark_constants (PATTERN (x
));
3961 format_ptr
= GET_RTX_FORMAT (GET_CODE (x
));
3963 for (i
= 0; i
< GET_RTX_LENGTH (GET_CODE (x
)); i
++)
3965 switch (*format_ptr
++)
3968 mark_constants (XEXP (x
, i
));
3972 if (XVEC (x
, i
) != 0)
3976 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
3977 mark_constants (XVECEXP (x
, i
, j
));
3996 /* Find all the constants whose addresses are referenced inside of EXP,
3997 and make sure assembler code with a label has been output for each one.
3998 Indicate whether an ADDR_EXPR has been encountered. */
4001 output_addressed_constants (exp
)
4006 switch (TREE_CODE (exp
))
4010 register tree constant
= TREE_OPERAND (exp
, 0);
4012 while (TREE_CODE (constant
) == COMPONENT_REF
)
4014 constant
= TREE_OPERAND (constant
, 0);
4017 if (TREE_CODE_CLASS (TREE_CODE (constant
)) == 'c'
4018 || TREE_CODE (constant
) == CONSTRUCTOR
)
4019 /* No need to do anything here
4020 for addresses of variables or functions. */
4021 output_constant_def (constant
);
4028 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
4029 reloc
|= output_addressed_constants (TREE_OPERAND (exp
, 1));
4034 case NON_LVALUE_EXPR
:
4035 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
4041 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
4042 if (TREE_VALUE (link
) != 0)
4043 reloc
|= output_addressed_constants (TREE_VALUE (link
));
4053 /* Return nonzero if VALUE is a valid constant-valued expression
4054 for use in initializing a static variable; one that can be an
4055 element of a "constant" initializer.
4057 Return null_pointer_node if the value is absolute;
4058 if it is relocatable, return the variable that determines the relocation.
4059 We assume that VALUE has been folded as much as possible;
4060 therefore, we do not need to check for such things as
4061 arithmetic-combinations of integers. */
4064 initializer_constant_valid_p (value
, endtype
)
4068 /* Give the front-end a chance to convert VALUE to something that
4069 looks more like a constant to the back-end. */
4070 if (lang_expand_constant
)
4071 value
= (*lang_expand_constant
) (value
);
4073 switch (TREE_CODE (value
))
4076 if ((TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
4077 || TREE_CODE (TREE_TYPE (value
)) == RECORD_TYPE
)
4078 && TREE_CONSTANT (value
)
4079 && CONSTRUCTOR_ELTS (value
))
4081 initializer_constant_valid_p (TREE_VALUE (CONSTRUCTOR_ELTS (value
)),
4084 return TREE_STATIC (value
) ? null_pointer_node
: 0;
4090 return null_pointer_node
;
4093 return staticp (TREE_OPERAND (value
, 0)) ? TREE_OPERAND (value
, 0) : 0;
4095 case NON_LVALUE_EXPR
:
4096 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
4100 /* Allow conversions between pointer types. */
4101 if (POINTER_TYPE_P (TREE_TYPE (value
))
4102 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
4103 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
4105 /* Allow conversions between real types. */
4106 if (FLOAT_TYPE_P (TREE_TYPE (value
))
4107 && FLOAT_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
4108 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
4110 /* Allow length-preserving conversions between integer types. */
4111 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
4112 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
4113 && (TYPE_PRECISION (TREE_TYPE (value
))
4114 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
4115 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
4117 /* Allow conversions between other integer types only if
4119 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
4120 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
4122 tree inner
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4124 if (inner
== null_pointer_node
)
4125 return null_pointer_node
;
4129 /* Allow (int) &foo provided int is as wide as a pointer. */
4130 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
4131 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
4132 && (TYPE_PRECISION (TREE_TYPE (value
))
4133 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
4134 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4137 /* Likewise conversions from int to pointers, but also allow
4138 conversions from 0. */
4139 if (POINTER_TYPE_P (TREE_TYPE (value
))
4140 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
4142 if (integer_zerop (TREE_OPERAND (value
, 0)))
4143 return null_pointer_node
;
4144 else if (TYPE_PRECISION (TREE_TYPE (value
))
4145 <= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0))))
4146 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4150 /* Allow conversions to union types if the value inside is okay. */
4151 if (TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
)
4152 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4157 if (! INTEGRAL_TYPE_P (endtype
)
4158 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
4160 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4162 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
4164 /* If either term is absolute, use the other terms relocation. */
4165 if (valid0
== null_pointer_node
)
4167 if (valid1
== null_pointer_node
)
4173 if (! INTEGRAL_TYPE_P (endtype
)
4174 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
4176 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4178 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
4180 /* Win if second argument is absolute. */
4181 if (valid1
== null_pointer_node
)
4183 /* Win if both arguments have the same relocation.
4184 Then the value is absolute. */
4185 if (valid0
== valid1
&& valid0
!= 0)
4186 return null_pointer_node
;
4189 /* Support differences between labels. */
4190 if (INTEGRAL_TYPE_P (endtype
))
4193 op0
= TREE_OPERAND (value
, 0);
4194 op1
= TREE_OPERAND (value
, 1);
4198 if (TREE_CODE (op0
) == ADDR_EXPR
4199 && TREE_CODE (TREE_OPERAND (op0
, 0)) == LABEL_DECL
4200 && TREE_CODE (op1
) == ADDR_EXPR
4201 && TREE_CODE (TREE_OPERAND (op1
, 0)) == LABEL_DECL
)
4202 return null_pointer_node
;
4213 /* Output assembler code for constant EXP to FILE, with no label.
4214 This includes the pseudo-op such as ".int" or ".byte", and a newline.
4215 Assumes output_addressed_constants has been done on EXP already.
4217 Generate exactly SIZE bytes of assembler data, padding at the end
4218 with zeros if necessary. SIZE must always be specified.
4220 SIZE is important for structure constructors,
4221 since trailing members may have been omitted from the constructor.
4222 It is also important for initialization of arrays from string constants
4223 since the full length of the string constant might not be wanted.
4224 It is also needed for initialization of unions, where the initializer's
4225 type is just one member, and that may not be as long as the union.
4227 There a case in which we would fail to output exactly SIZE bytes:
4228 for a structure constructor that wants to produce more than SIZE bytes.
4229 But such constructors will never be generated for any possible input. */
4232 output_constant (exp
, size
)
4236 register enum tree_code code
= TREE_CODE (TREE_TYPE (exp
));
4238 /* Some front-ends use constants other than the standard
4239 language-indepdent varieties, but which may still be output
4240 directly. Give the front-end a chance to convert EXP to a
4241 language-independent representation. */
4242 if (lang_expand_constant
)
4243 exp
= (*lang_expand_constant
) (exp
);
4245 if (size
== 0 || flag_syntax_only
)
4248 /* Eliminate the NON_LVALUE_EXPR_EXPR that makes a cast not be an lvalue.
4249 That way we get the constant (we hope) inside it. Also, strip off any
4250 NOP_EXPR that converts between two record, union, array, or set types
4251 or a CONVERT_EXPR that converts to a union TYPE. */
4252 while ((TREE_CODE (exp
) == NOP_EXPR
4253 && (TREE_TYPE (exp
) == TREE_TYPE (TREE_OPERAND (exp
, 0))
4254 || AGGREGATE_TYPE_P (TREE_TYPE (exp
))))
4255 || (TREE_CODE (exp
) == CONVERT_EXPR
4256 && code
== UNION_TYPE
)
4257 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
4259 exp
= TREE_OPERAND (exp
, 0);
4260 code
= TREE_CODE (TREE_TYPE (exp
));
4263 /* Allow a constructor with no elements for any data type.
4264 This means to fill the space with zeros. */
4265 if (TREE_CODE (exp
) == CONSTRUCTOR
&& CONSTRUCTOR_ELTS (exp
) == 0)
4267 assemble_zeros (size
);
4278 case REFERENCE_TYPE
:
4279 /* ??? What about (int)((float)(int)&foo + 4) */
4280 while (TREE_CODE (exp
) == NOP_EXPR
|| TREE_CODE (exp
) == CONVERT_EXPR
4281 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
4282 exp
= TREE_OPERAND (exp
, 0);
4284 if (! assemble_integer (expand_expr (exp
, NULL_RTX
, VOIDmode
,
4285 EXPAND_INITIALIZER
),
4287 error ("initializer for integer value is too complicated");
4292 if (TREE_CODE (exp
) != REAL_CST
)
4293 error ("initializer for floating value is not a floating constant");
4295 assemble_real (TREE_REAL_CST (exp
),
4296 mode_for_size (size
* BITS_PER_UNIT
, MODE_FLOAT
, 0));
4301 output_constant (TREE_REALPART (exp
), size
/ 2);
4302 output_constant (TREE_IMAGPART (exp
), size
/ 2);
4303 size
-= (size
/ 2) * 2;
4307 if (TREE_CODE (exp
) == CONSTRUCTOR
)
4309 output_constructor (exp
, size
);
4312 else if (TREE_CODE (exp
) == STRING_CST
)
4316 if (size
> TREE_STRING_LENGTH (exp
))
4318 excess
= size
- TREE_STRING_LENGTH (exp
);
4319 size
= TREE_STRING_LENGTH (exp
);
4322 assemble_string (TREE_STRING_POINTER (exp
), size
);
4331 if (TREE_CODE (exp
) == CONSTRUCTOR
)
4332 output_constructor (exp
, size
);
4338 if (TREE_CODE (exp
) == INTEGER_CST
)
4339 assemble_integer (expand_expr (exp
, NULL_RTX
,
4340 VOIDmode
, EXPAND_INITIALIZER
),
4342 else if (TREE_CODE (exp
) == CONSTRUCTOR
)
4344 unsigned char *buffer
= (unsigned char *) alloca (size
);
4345 if (get_set_constructor_bytes (exp
, buffer
, size
))
4347 assemble_string ((char *) buffer
, size
);
4350 error ("unknown set constructor type");
4358 assemble_zeros (size
);
4362 /* Subroutine of output_constant, used for CONSTRUCTORs
4363 (aggregate constants).
4364 Generate at least SIZE bytes, padding if necessary. */
4367 output_constructor (exp
, size
)
4371 register tree link
, field
= 0;
4372 HOST_WIDE_INT min_index
= 0;
4373 /* Number of bytes output or skipped so far.
4374 In other words, current position within the constructor. */
4375 int total_bytes
= 0;
4376 /* Non-zero means BYTE contains part of a byte, to be output. */
4377 int byte_buffer_in_use
= 0;
4378 register int byte
= 0;
4380 if (HOST_BITS_PER_WIDE_INT
< BITS_PER_UNIT
)
4383 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
4384 field
= TYPE_FIELDS (TREE_TYPE (exp
));
4386 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
4387 && TYPE_DOMAIN (TREE_TYPE (exp
)) != 0)
4389 = TREE_INT_CST_LOW (TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (exp
))));
4391 /* As LINK goes through the elements of the constant,
4392 FIELD goes through the structure fields, if the constant is a structure.
4393 if the constant is a union, then we override this,
4394 by getting the field from the TREE_LIST element.
4395 But the constant could also be an array. Then FIELD is zero.
4397 There is always a maximum of one element in the chain LINK for unions
4398 (even if the initializer in a source program incorrectly contains
4400 for (link
= CONSTRUCTOR_ELTS (exp
);
4402 link
= TREE_CHAIN (link
),
4403 field
= field
? TREE_CHAIN (field
) : 0)
4405 tree val
= TREE_VALUE (link
);
4408 /* the element in a union constructor specifies the proper field. */
4410 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
4411 || TREE_CODE (TREE_TYPE (exp
)) == UNION_TYPE
)
4413 /* if available, use the type given by link */
4414 if (TREE_PURPOSE (link
) != 0)
4415 field
= TREE_PURPOSE (link
);
4418 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
4419 index
= TREE_PURPOSE (link
);
4421 /* Eliminate the marker that makes a cast not be an lvalue. */
4425 if (index
&& TREE_CODE (index
) == RANGE_EXPR
)
4427 register int fieldsize
4428 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (exp
)));
4429 HOST_WIDE_INT lo_index
= TREE_INT_CST_LOW (TREE_OPERAND (index
, 0));
4430 HOST_WIDE_INT hi_index
= TREE_INT_CST_LOW (TREE_OPERAND (index
, 1));
4431 HOST_WIDE_INT index
;
4432 for (index
= lo_index
; index
<= hi_index
; index
++)
4434 /* Output the element's initial value. */
4436 assemble_zeros (fieldsize
);
4438 output_constant (val
, fieldsize
);
4440 /* Count its size. */
4441 total_bytes
+= fieldsize
;
4444 else if (field
== 0 || !DECL_BIT_FIELD (field
))
4446 /* An element that is not a bit-field. */
4448 register int fieldsize
;
4449 /* Since this structure is static,
4450 we know the positions are constant. */
4451 HOST_WIDE_INT bitpos
= field
? int_byte_position (field
) : 0;
4455 = (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (val
)), 1)
4456 * (tree_low_cst (index
, 0) - min_index
));
4458 /* Output any buffered-up bit-fields preceding this element. */
4459 if (byte_buffer_in_use
)
4461 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4463 byte_buffer_in_use
= 0;
4466 /* Advance to offset of this element.
4467 Note no alignment needed in an array, since that is guaranteed
4468 if each element has the proper size. */
4469 if ((field
!= 0 || index
!= 0) && bitpos
!= total_bytes
)
4471 assemble_zeros (bitpos
- total_bytes
);
4472 total_bytes
= bitpos
;
4475 /* Determine size this element should occupy. */
4478 if (TREE_CODE (DECL_SIZE_UNIT (field
)) != INTEGER_CST
)
4481 fieldsize
= TREE_INT_CST_LOW (DECL_SIZE_UNIT (field
));
4484 fieldsize
= int_size_in_bytes (TREE_TYPE (TREE_TYPE (exp
)));
4486 /* Output the element's initial value. */
4488 assemble_zeros (fieldsize
);
4490 output_constant (val
, fieldsize
);
4492 /* Count its size. */
4493 total_bytes
+= fieldsize
;
4495 else if (val
!= 0 && TREE_CODE (val
) != INTEGER_CST
)
4496 error ("invalid initial value for member `%s'",
4497 IDENTIFIER_POINTER (DECL_NAME (field
)));
4500 /* Element that is a bit-field. */
4502 HOST_WIDE_INT next_offset
= int_bit_position (field
);
4503 HOST_WIDE_INT end_offset
4504 = (next_offset
+ tree_low_cst (DECL_SIZE (field
), 1));
4507 val
= integer_zero_node
;
4509 /* If this field does not start in this (or, next) byte,
4511 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4513 /* Output remnant of any bit field in previous bytes. */
4514 if (byte_buffer_in_use
)
4516 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4518 byte_buffer_in_use
= 0;
4521 /* If still not at proper byte, advance to there. */
4522 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4524 assemble_zeros (next_offset
/ BITS_PER_UNIT
- total_bytes
);
4525 total_bytes
= next_offset
/ BITS_PER_UNIT
;
4529 if (! byte_buffer_in_use
)
4532 /* We must split the element into pieces that fall within
4533 separate bytes, and combine each byte with previous or
4534 following bit-fields. */
4536 /* next_offset is the offset n fbits from the beginning of
4537 the structure to the next bit of this element to be processed.
4538 end_offset is the offset of the first bit past the end of
4540 while (next_offset
< end_offset
)
4544 HOST_WIDE_INT value
;
4545 int next_byte
= next_offset
/ BITS_PER_UNIT
;
4546 int next_bit
= next_offset
% BITS_PER_UNIT
;
4548 /* Advance from byte to byte
4549 within this element when necessary. */
4550 while (next_byte
!= total_bytes
)
4552 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4557 /* Number of bits we can process at once
4558 (all part of the same byte). */
4559 this_time
= MIN (end_offset
- next_offset
,
4560 BITS_PER_UNIT
- next_bit
);
4561 if (BYTES_BIG_ENDIAN
)
4563 /* On big-endian machine, take the most significant bits
4564 first (of the bits that are significant)
4565 and put them into bytes from the most significant end. */
4566 shift
= end_offset
- next_offset
- this_time
;
4567 /* Don't try to take a bunch of bits that cross
4568 the word boundary in the INTEGER_CST. We can
4569 only select bits from the LOW or HIGH part
4571 if (shift
< HOST_BITS_PER_WIDE_INT
4572 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4574 this_time
= shift
+ this_time
- HOST_BITS_PER_WIDE_INT
;
4575 shift
= HOST_BITS_PER_WIDE_INT
;
4578 /* Now get the bits from the appropriate constant word. */
4579 if (shift
< HOST_BITS_PER_WIDE_INT
)
4581 value
= TREE_INT_CST_LOW (val
);
4583 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4585 value
= TREE_INT_CST_HIGH (val
);
4586 shift
-= HOST_BITS_PER_WIDE_INT
;
4590 /* Get the result. This works only when:
4591 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4592 byte
|= (((value
>> shift
)
4593 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4594 << (BITS_PER_UNIT
- this_time
- next_bit
));
4598 /* On little-endian machines,
4599 take first the least significant bits of the value
4600 and pack them starting at the least significant
4601 bits of the bytes. */
4602 shift
= next_offset
- int_bit_position (field
);
4604 /* Don't try to take a bunch of bits that cross
4605 the word boundary in the INTEGER_CST. We can
4606 only select bits from the LOW or HIGH part
4608 if (shift
< HOST_BITS_PER_WIDE_INT
4609 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4610 this_time
= (HOST_BITS_PER_WIDE_INT
- shift
);
4612 /* Now get the bits from the appropriate constant word. */
4613 if (shift
< HOST_BITS_PER_WIDE_INT
)
4614 value
= TREE_INT_CST_LOW (val
);
4615 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4617 value
= TREE_INT_CST_HIGH (val
);
4618 shift
-= HOST_BITS_PER_WIDE_INT
;
4623 /* Get the result. This works only when:
4624 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4625 byte
|= (((value
>> shift
)
4626 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4629 next_offset
+= this_time
;
4630 byte_buffer_in_use
= 1;
4634 if (byte_buffer_in_use
)
4636 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4639 if (total_bytes
< size
)
4640 assemble_zeros (size
- total_bytes
);
4643 #ifdef HANDLE_PRAGMA_WEAK
4644 /* Add function NAME to the weak symbols list. VALUE is a weak alias
4645 associatd with NAME. */
4648 add_weak (name
, value
)
4652 struct weak_syms
*weak
;
4654 weak
= (struct weak_syms
*) permalloc (sizeof (struct weak_syms
));
4659 weak
->next
= weak_decls
;
4661 weak
->value
= value
;
4666 #endif /* HANDLE_PRAGMA_WEAK */
4668 /* Declare DECL to be a weak symbol. */
4674 if (! TREE_PUBLIC (decl
))
4675 error_with_decl (decl
, "weak declaration of `%s' must be public");
4676 else if (TREE_ASM_WRITTEN (decl
))
4677 error_with_decl (decl
, "weak declaration of `%s' must precede definition");
4678 else if (SUPPORTS_WEAK
)
4679 DECL_WEAK (decl
) = 1;
4680 #ifdef HANDLE_PRAGMA_WEAK
4681 add_weak (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)), NULL
);
4685 /* Emit any pending weak declarations. */
4687 #ifdef HANDLE_PRAGMA_WEAK
4688 struct weak_syms
* weak_decls
;
4694 #ifdef HANDLE_PRAGMA_WEAK
4695 if (HANDLE_PRAGMA_WEAK
)
4697 struct weak_syms
*t
;
4698 for (t
= weak_decls
; t
; t
= t
->next
)
4702 ASM_WEAKEN_LABEL (asm_out_file
, t
->name
);
4704 ASM_OUTPUT_DEF (asm_out_file
, t
->name
, t
->value
);
4711 /* Remove NAME from the pending list of weak symbols. This prevents
4712 the compiler from emitting multiple .weak directives which confuses
4714 #ifdef ASM_WEAKEN_LABEL
4716 remove_from_pending_weak_list (name
)
4717 char *name ATTRIBUTE_UNUSED
;
4719 #ifdef HANDLE_PRAGMA_WEAK
4720 if (HANDLE_PRAGMA_WEAK
)
4722 struct weak_syms
*t
;
4723 for (t
= weak_decls
; t
; t
= t
->next
)
4725 if (t
->name
&& strcmp (name
, t
->name
) == 0)
4734 assemble_alias (decl
, target
)
4735 tree decl
, target ATTRIBUTE_UNUSED
;
4739 make_decl_rtl (decl
, (char *) 0, 1);
4740 name
= XSTR (XEXP (DECL_RTL (decl
), 0), 0);
4742 #ifdef ASM_OUTPUT_DEF
4743 /* Make name accessible from other files, if appropriate. */
4745 if (TREE_PUBLIC (decl
))
4747 #ifdef ASM_WEAKEN_LABEL
4748 if (DECL_WEAK (decl
))
4750 ASM_WEAKEN_LABEL (asm_out_file
, name
);
4751 /* Remove this function from the pending weak list so that
4752 we do not emit multiple .weak directives for it. */
4753 remove_from_pending_weak_list
4754 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
4758 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
4761 #ifdef ASM_OUTPUT_DEF_FROM_DECLS
4762 ASM_OUTPUT_DEF_FROM_DECLS (asm_out_file
, decl
, target
);
4764 ASM_OUTPUT_DEF (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4766 TREE_ASM_WRITTEN (decl
) = 1;
4768 #ifdef ASM_OUTPUT_WEAK_ALIAS
4769 if (! DECL_WEAK (decl
))
4770 warning ("only weak aliases are supported in this configuration");
4772 ASM_OUTPUT_WEAK_ALIAS (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4773 TREE_ASM_WRITTEN (decl
) = 1;
4775 warning ("alias definitions not supported in this configuration; ignored");
4780 /* This determines whether or not we support link-once semantics. */
4781 #ifndef SUPPORTS_ONE_ONLY
4782 #ifdef MAKE_DECL_ONE_ONLY
4783 #define SUPPORTS_ONE_ONLY 1
4785 #define SUPPORTS_ONE_ONLY 0
4789 /* Returns 1 if the target configuration supports defining public symbols
4790 so that one of them will be chosen at link time instead of generating a
4791 multiply-defined symbol error, whether through the use of weak symbols or
4792 a target-specific mechanism for having duplicates discarded. */
4795 supports_one_only ()
4797 if (SUPPORTS_ONE_ONLY
)
4799 return SUPPORTS_WEAK
;
4802 /* Set up DECL as a public symbol that can be defined in multiple
4803 translation units without generating a linker error. */
4806 make_decl_one_only (decl
)
4809 if (TREE_CODE (decl
) != VAR_DECL
&& TREE_CODE (decl
) != FUNCTION_DECL
)
4812 TREE_PUBLIC (decl
) = 1;
4814 if (TREE_CODE (decl
) == VAR_DECL
4815 && (DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
))
4816 DECL_COMMON (decl
) = 1;
4817 else if (SUPPORTS_ONE_ONLY
)
4819 #ifdef MAKE_DECL_ONE_ONLY
4820 MAKE_DECL_ONE_ONLY (decl
);
4822 DECL_ONE_ONLY (decl
) = 1;
4824 else if (SUPPORTS_WEAK
)
4825 DECL_WEAK (decl
) = 1;
4833 ggc_add_root (const_hash_table
, MAX_HASH_TABLE
, sizeof const_hash_table
[0],
4834 mark_const_hash_entry
);
4835 ggc_add_string_root (&in_named_name
, 1);
4838 /* Extra support for EH values. */
4840 assemble_eh_label (name
)
4843 #ifdef ASM_OUTPUT_EH_LABEL
4844 ASM_OUTPUT_EH_LABEL (asm_out_file
, name
);
4846 assemble_label (name
);
4850 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
4853 assemble_eh_align (align
)
4856 #ifdef ASM_OUTPUT_EH_ALIGN
4857 if (align
> BITS_PER_UNIT
)
4858 ASM_OUTPUT_EH_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
4860 assemble_align (align
);
4865 /* On some platforms, we may want to specify a special mechansim to
4866 output EH data when generating with a function.. */
4868 assemble_eh_integer (x
, size
, force
)
4876 #ifdef ASM_OUTPUT_EH_CHAR
4878 ASM_OUTPUT_EH_CHAR (asm_out_file
, x
);
4882 #ifdef ASM_OUTPUT_EH_SHORT
4884 ASM_OUTPUT_EH_SHORT (asm_out_file
, x
);
4888 #ifdef ASM_OUTPUT_EH_INT
4890 ASM_OUTPUT_EH_INT (asm_out_file
, x
);
4894 #ifdef ASM_OUTPUT_EH_DOUBLE_INT
4896 ASM_OUTPUT_EH_DOUBLE_INT (asm_out_file
, x
);
4903 return (assemble_integer (x
, size
, force
));