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. */
39 #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 char *first_global_object_name
;
81 char *weak_global_object_name
;
83 extern struct obstack
*current_obstack
;
84 extern struct obstack
*saveable_obstack
;
85 extern struct obstack
*rtl_obstack
;
86 extern struct obstack permanent_obstack
;
87 #define obstack_chunk_alloc xmalloc
90 struct constant_descriptor
;
94 #define MAX_RTX_HASH_TABLE 61
98 /* Hash facility for making memory-constants
99 from constant rtl-expressions. It is used on RISC machines
100 where immediate integer arguments and constant addresses are restricted
101 so that such constants must be stored in memory.
103 This pool of constants is reinitialized for each function
104 so each function gets its own constants-pool that comes right before
106 struct constant_descriptor
**x_const_rtx_hash_table
;
107 struct pool_sym
**x_const_rtx_sym_hash_table
;
109 /* Pointers to first and last constant in pool. */
110 struct pool_constant
*x_first_pool
, *x_last_pool
;
112 /* Current offset in constant pool (does not include any machine-specific
116 /* Chain of all CONST_DOUBLE rtx's constructed for the current function.
117 They are chained through the CONST_DOUBLE_CHAIN.
118 A CONST_DOUBLE rtx has CONST_DOUBLE_MEM != cc0_rtx iff it is on this chain.
119 In that case, CONST_DOUBLE_MEM is either a MEM,
120 or const0_rtx if no MEM has been made for this CONST_DOUBLE yet. */
121 rtx x_const_double_chain
;
124 #define const_rtx_hash_table (cfun->varasm->x_const_rtx_hash_table)
125 #define const_rtx_sym_hash_table (cfun->varasm->x_const_rtx_sym_hash_table)
126 #define first_pool (cfun->varasm->x_first_pool)
127 #define last_pool (cfun->varasm->x_last_pool)
128 #define pool_offset (cfun->varasm->x_pool_offset)
129 #define const_double_chain (cfun->varasm->x_const_double_chain)
131 /* Number for making the label on the next
132 constant that is stored in memory. */
136 /* Number for making the label on the next
137 static variable internal to a function. */
141 /* Carry information from ASM_DECLARE_OBJECT_NAME
142 to ASM_FINISH_DECLARE_OBJECT. */
144 int size_directive_output
;
146 /* The last decl for which assemble_variable was called,
147 if it did ASM_DECLARE_OBJECT_NAME.
148 If the last call to assemble_variable didn't do that,
151 tree last_assemble_variable_decl
;
153 static const char *strip_reg_name
PARAMS ((const char *));
154 static int contains_pointers_p
PARAMS ((tree
));
155 static void decode_addr_const
PARAMS ((tree
, struct addr_const
*));
156 static int const_hash
PARAMS ((tree
));
157 static int compare_constant
PARAMS ((tree
,
158 struct constant_descriptor
*));
159 static char *compare_constant_1
PARAMS ((tree
, char *));
160 static struct constant_descriptor
*record_constant
PARAMS ((tree
));
161 static void record_constant_1
PARAMS ((tree
));
162 static tree copy_constant
PARAMS ((tree
));
163 static void output_constant_def_contents
PARAMS ((tree
, int, int));
164 static void decode_rtx_const
PARAMS ((enum machine_mode
, rtx
,
165 struct rtx_const
*));
166 static int const_hash_rtx
PARAMS ((enum machine_mode
, rtx
));
167 static int compare_constant_rtx
PARAMS ((enum machine_mode
, rtx
,
168 struct constant_descriptor
*));
169 static struct constant_descriptor
*record_constant_rtx
PARAMS ((enum machine_mode
,
171 static struct pool_constant
*find_pool_constant
PARAMS ((struct function
*, rtx
));
172 static void mark_constant_pool
PARAMS ((void));
173 static void mark_constants
PARAMS ((rtx
));
174 static int output_addressed_constants
PARAMS ((tree
));
175 static void output_after_function_constants
PARAMS ((void));
176 static void output_constructor
PARAMS ((tree
, int));
177 #ifdef ASM_WEAKEN_LABEL
178 static void remove_from_pending_weak_list
PARAMS ((char *));
180 #ifdef ASM_OUTPUT_BSS
181 static void asm_output_bss
PARAMS ((FILE *, tree
, 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
, char *, int, int));
187 #endif /* BSS_SECTION_ASM_OP */
188 static void mark_pool_constant
PARAMS ((struct pool_constant
*));
189 static void mark_pool_sym_hash_table
PARAMS ((struct pool_sym
**));
190 static void mark_const_hash_entry
PARAMS ((void *));
191 static void asm_emit_uninitialised
PARAMS ((tree
, char *, int, int));
193 static enum in_section
{ no_section
, in_text
, in_data
, in_named
194 #ifdef BSS_SECTION_ASM_OP
197 #ifdef EH_FRAME_SECTION_ASM_OP
200 #ifdef EXTRA_SECTIONS
203 } in_section
= no_section
;
205 /* Return a non-zero value if DECL has a section attribute. */
206 #ifndef IN_NAMED_SECTION
207 #define IN_NAMED_SECTION(DECL) \
208 ((TREE_CODE (DECL) == FUNCTION_DECL || TREE_CODE (DECL) == VAR_DECL) \
209 && DECL_SECTION_NAME (DECL) != NULL_TREE)
212 /* Text of section name when in_section == in_named. */
213 static char *in_named_name
;
215 /* Define functions like text_section for any extra sections. */
216 #ifdef EXTRA_SECTION_FUNCTIONS
217 EXTRA_SECTION_FUNCTIONS
220 /* Tell assembler to switch to text section. */
225 if (in_section
!= in_text
)
227 fprintf (asm_out_file
, "%s\n", TEXT_SECTION_ASM_OP
);
228 in_section
= in_text
;
232 /* Tell assembler to switch to data section. */
237 if (in_section
!= in_data
)
239 if (flag_shared_data
)
241 #ifdef SHARED_SECTION_ASM_OP
242 fprintf (asm_out_file
, "%s\n", SHARED_SECTION_ASM_OP
);
244 fprintf (asm_out_file
, "%s\n", DATA_SECTION_ASM_OP
);
248 fprintf (asm_out_file
, "%s\n", DATA_SECTION_ASM_OP
);
250 in_section
= in_data
;
253 /* Tell assembler to ALWAYS switch to data section, in case
254 it's not sure where it it. */
257 force_data_section ()
259 in_section
= no_section
;
263 /* Tell assembler to switch to read-only data section. This is normally
267 readonly_data_section ()
269 #ifdef READONLY_DATA_SECTION
270 READONLY_DATA_SECTION (); /* Note this can call data_section. */
276 /* Determine if we're in the text section. */
281 return in_section
== in_text
;
284 /* Determine if we're in the data section. */
289 return in_section
== in_data
;
292 /* Tell assembler to change to section NAME for DECL.
293 If DECL is NULL, just switch to section NAME.
294 If NAME is NULL, get the name from DECL.
295 If RELOC is 1, the initializer for DECL contains relocs. */
298 named_section (decl
, name
, reloc
)
301 int reloc ATTRIBUTE_UNUSED
;
303 if (decl
!= NULL_TREE
304 && TREE_CODE_CLASS (TREE_CODE (decl
)) != 'd')
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. */
526 if (decl_function_context (decl
) != 0
527 && DECL_INITIAL (decl
) != 0
528 && DECL_RTL (decl
) == 0)
532 name
= IDENTIFIER_POINTER (DECL_NAME (decl
));
533 ASM_FORMAT_PRIVATE_NAME (label
, name
, var_labelno
);
534 name
= ggc_alloc_string (label
, -1);
539 /* When -fprefix-function-name is used, every function name is
540 prefixed. Even static functions are prefixed because they
541 could be declared latter. Note that a nested function name
543 if (flag_prefix_function_name
)
545 size_t name_len
= strlen (name
);
547 new_name
= ggc_alloc_string (NULL
, name_len
+ CHKR_PREFIX_SIZE
);
548 memcpy (new_name
, CHKR_PREFIX
, CHKR_PREFIX_SIZE
);
549 memcpy (new_name
+ CHKR_PREFIX_SIZE
, name
, name_len
+ 1);
554 if (DECL_RTL (decl
) == 0)
557 = gen_rtx_MEM (DECL_MODE (decl
),
558 gen_rtx_SYMBOL_REF (Pmode
, name
));
560 /* Optionally set flags or add text to the name to record information
561 such as that it is a function name. If the name is changed, the macro
562 ASM_OUTPUT_LABELREF will have to know how to strip this information. */
563 #ifdef ENCODE_SECTION_INFO
564 ENCODE_SECTION_INFO (decl
);
569 /* ??? Another way to do this would be to do what halfpic.c does
570 and maintain a hashed table of such critters. */
571 /* ??? Another way to do this would be to pass a flag bit to
572 ENCODE_SECTION_INFO saying whether this is a new decl or not. */
573 /* Let the target reassign the RTL if it wants.
574 This is necessary, for example, when one machine specific
575 decl attribute overrides another. */
576 #ifdef REDO_SECTION_INFO_P
577 if (REDO_SECTION_INFO_P (decl
))
578 ENCODE_SECTION_INFO (decl
);
583 /* Given NAME, a putative register name, discard any customary prefixes. */
586 strip_reg_name (name
)
589 #ifdef REGISTER_PREFIX
590 if (!strncmp (name
, REGISTER_PREFIX
, strlen (REGISTER_PREFIX
)))
591 name
+= strlen (REGISTER_PREFIX
);
593 if (name
[0] == '%' || name
[0] == '#')
598 /* Decode an `asm' spec for a declaration as a register name.
599 Return the register number, or -1 if nothing specified,
600 or -2 if the ASMSPEC is not `cc' or `memory' and is not recognized,
601 or -3 if ASMSPEC is `cc' and is not recognized,
602 or -4 if ASMSPEC is `memory' and is not recognized.
603 Accept an exact spelling or a decimal number.
604 Prefixes such as % are optional. */
607 decode_reg_name (asmspec
)
614 /* Get rid of confusing prefixes. */
615 asmspec
= strip_reg_name (asmspec
);
617 /* Allow a decimal number as a "register name". */
618 for (i
= strlen (asmspec
) - 1; i
>= 0; i
--)
619 if (! (asmspec
[i
] >= '0' && asmspec
[i
] <= '9'))
621 if (asmspec
[0] != 0 && i
< 0)
624 if (i
< FIRST_PSEUDO_REGISTER
&& i
>= 0)
630 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
632 && ! strcmp (asmspec
, strip_reg_name (reg_names
[i
])))
635 #ifdef ADDITIONAL_REGISTER_NAMES
637 static struct { const char *name
; int number
; } table
[]
638 = ADDITIONAL_REGISTER_NAMES
;
640 for (i
= 0; i
< (int)(sizeof (table
) / sizeof (table
[0])); i
++)
641 if (! strcmp (asmspec
, table
[i
].name
))
642 return table
[i
].number
;
644 #endif /* ADDITIONAL_REGISTER_NAMES */
646 if (!strcmp (asmspec
, "memory"))
649 if (!strcmp (asmspec
, "cc"))
658 /* Create the DECL_RTL for a declaration for a static or external variable
659 or static or external function.
660 ASMSPEC, if not 0, is the string which the user specified
661 as the assembler symbol name.
662 TOP_LEVEL is nonzero if this is a file-scope variable.
664 This is never called for PARM_DECL nodes. */
667 make_decl_rtl (decl
, asmspec
, top_level
)
672 register char *name
= 0;
675 reg_number
= decode_reg_name (asmspec
);
677 if (DECL_ASSEMBLER_NAME (decl
) != NULL_TREE
)
678 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
680 if (reg_number
== -2)
682 /* ASMSPEC is given, and not the name of a register. */
683 size_t len
= strlen (asmspec
);
685 name
= ggc_alloc_string (NULL
, len
+ 1);
687 memcpy (&name
[1], asmspec
, len
+ 1);
690 /* For a duplicate declaration, we can be called twice on the
691 same DECL node. Don't discard the RTL already made. */
692 if (DECL_RTL (decl
) == 0)
694 /* First detect errors in declaring global registers. */
695 if (TREE_CODE (decl
) != FUNCTION_DECL
696 && DECL_REGISTER (decl
) && reg_number
== -1)
697 error_with_decl (decl
,
698 "register name not specified for `%s'");
699 else if (TREE_CODE (decl
) != FUNCTION_DECL
700 && DECL_REGISTER (decl
) && reg_number
< 0)
701 error_with_decl (decl
,
702 "invalid register name for `%s'");
703 else if ((reg_number
>= 0 || reg_number
== -3)
704 && (TREE_CODE (decl
) == FUNCTION_DECL
705 && ! DECL_REGISTER (decl
)))
706 error_with_decl (decl
,
707 "register name given for non-register variable `%s'");
708 else if (TREE_CODE (decl
) != FUNCTION_DECL
709 && DECL_REGISTER (decl
)
710 && TYPE_MODE (TREE_TYPE (decl
)) == BLKmode
)
711 error_with_decl (decl
,
712 "data type of `%s' isn't suitable for a register");
713 else if (TREE_CODE (decl
) != FUNCTION_DECL
&& DECL_REGISTER (decl
)
714 && ! HARD_REGNO_MODE_OK (reg_number
,
715 TYPE_MODE (TREE_TYPE (decl
))))
716 error_with_decl (decl
,
717 "register number for `%s' isn't suitable for data type");
718 /* Now handle properly declared static register variables. */
719 else if (TREE_CODE (decl
) != FUNCTION_DECL
&& DECL_REGISTER (decl
))
723 if (DECL_INITIAL (decl
) != 0 && top_level
)
725 DECL_INITIAL (decl
) = 0;
726 error ("global register variable has initial value");
728 if (TREE_THIS_VOLATILE (decl
))
729 warning ("volatile register variables don't work as you might wish");
731 /* If the user specified one of the eliminables registers here,
732 e.g., FRAME_POINTER_REGNUM, we don't want to get this variable
733 confused with that register and be eliminated. Although this
734 usage is somewhat suspect, we nevertheless use the following
735 kludge to avoid setting DECL_RTL to frame_pointer_rtx. */
738 = gen_rtx_REG (DECL_MODE (decl
), FIRST_PSEUDO_REGISTER
);
739 REGNO (DECL_RTL (decl
)) = reg_number
;
740 REG_USERVAR_P (DECL_RTL (decl
)) = 1;
744 /* Make this register global, so not usable for anything
746 #ifdef ASM_DECLARE_REGISTER_GLOBAL
747 ASM_DECLARE_REGISTER_GLOBAL (asm_out_file
, decl
, reg_number
, name
);
749 nregs
= HARD_REGNO_NREGS (reg_number
, DECL_MODE (decl
));
751 globalize_reg (reg_number
+ --nregs
);
754 /* Specifying a section attribute on a variable forces it into a
755 non-.bss section, and thus it cannot be common. */
756 else if (TREE_CODE (decl
) == VAR_DECL
757 && DECL_SECTION_NAME (decl
) != NULL_TREE
758 && DECL_INITIAL (decl
) == NULL_TREE
759 && DECL_COMMON (decl
))
760 DECL_COMMON (decl
) = 0;
762 /* Now handle ordinary static variables and functions (in memory).
763 Also handle vars declared register invalidly. */
764 if (DECL_RTL (decl
) == 0)
766 /* Can't use just the variable's own name for a variable
767 whose scope is less than the whole file.
768 Concatenate a distinguishing number. */
769 if (!top_level
&& !TREE_PUBLIC (decl
) && asmspec
== 0)
773 ASM_FORMAT_PRIVATE_NAME (label
, name
, var_labelno
);
774 name
= ggc_alloc_string (label
, -1);
781 /* When -fprefix-function-name is used, the functions
782 names are prefixed. Only nested function names are not
784 if (flag_prefix_function_name
&& TREE_CODE (decl
) == FUNCTION_DECL
)
786 size_t name_len
= strlen (name
);
789 new_name
= ggc_alloc_string (NULL
, name_len
+ CHKR_PREFIX_SIZE
);
790 memcpy (new_name
, CHKR_PREFIX
, CHKR_PREFIX_SIZE
);
791 memcpy (new_name
+ CHKR_PREFIX_SIZE
, name
, name_len
+ 1);
795 DECL_RTL (decl
) = gen_rtx_MEM (DECL_MODE (decl
),
796 gen_rtx_SYMBOL_REF (Pmode
, name
));
797 MEM_ALIAS_SET (DECL_RTL (decl
)) = get_alias_set (decl
);
799 /* If this variable is to be treated as volatile, show its
800 tree node has side effects. If it has side effects, either
801 because of this test or from TREE_THIS_VOLATILE also
802 being set, show the MEM is volatile. */
803 if (flag_volatile_global
&& TREE_CODE (decl
) == VAR_DECL
804 && TREE_PUBLIC (decl
))
805 TREE_SIDE_EFFECTS (decl
) = 1;
806 else if (flag_volatile_static
&& TREE_CODE (decl
) == VAR_DECL
807 && (TREE_PUBLIC (decl
) || TREE_STATIC (decl
)))
808 TREE_SIDE_EFFECTS (decl
) = 1;
810 if (TREE_SIDE_EFFECTS (decl
))
811 MEM_VOLATILE_P (DECL_RTL (decl
)) = 1;
813 if (TREE_READONLY (decl
))
814 RTX_UNCHANGING_P (DECL_RTL (decl
)) = 1;
815 MEM_SET_IN_STRUCT_P (DECL_RTL (decl
),
816 AGGREGATE_TYPE_P (TREE_TYPE (decl
)));
818 /* Optionally set flags or add text to the name to record information
819 such as that it is a function name.
820 If the name is changed, the macro ASM_OUTPUT_LABELREF
821 will have to know how to strip this information. */
822 #ifdef ENCODE_SECTION_INFO
823 ENCODE_SECTION_INFO (decl
);
829 /* If the old RTL had the wrong mode, fix the mode. */
830 if (GET_MODE (DECL_RTL (decl
)) != DECL_MODE (decl
))
832 rtx rtl
= DECL_RTL (decl
);
833 PUT_MODE (rtl
, DECL_MODE (decl
));
836 /* ??? Another way to do this would be to do what halfpic.c does
837 and maintain a hashed table of such critters. */
838 /* ??? Another way to do this would be to pass a flag bit to
839 ENCODE_SECTION_INFO saying whether this is a new decl or not. */
840 /* Let the target reassign the RTL if it wants.
841 This is necessary, for example, when one machine specific
842 decl attribute overrides another. */
843 #ifdef REDO_SECTION_INFO_P
844 if (REDO_SECTION_INFO_P (decl
))
845 ENCODE_SECTION_INFO (decl
);
850 /* Make the rtl for variable VAR be volatile.
851 Use this only for static variables. */
854 make_var_volatile (var
)
857 if (GET_CODE (DECL_RTL (var
)) != MEM
)
860 MEM_VOLATILE_P (DECL_RTL (var
)) = 1;
863 /* Output alignment directive to align for constant expression EXP. */
866 assemble_constant_align (exp
)
871 /* Align the location counter as required by EXP's data type. */
872 align
= TYPE_ALIGN (TREE_TYPE (exp
));
873 #ifdef CONSTANT_ALIGNMENT
874 align
= CONSTANT_ALIGNMENT (exp
, align
);
877 if (align
> BITS_PER_UNIT
)
878 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
881 /* Output a string of literal assembler code
882 for an `asm' keyword used between functions. */
885 assemble_asm (string
)
890 if (TREE_CODE (string
) == ADDR_EXPR
)
891 string
= TREE_OPERAND (string
, 0);
893 fprintf (asm_out_file
, "\t%s\n", TREE_STRING_POINTER (string
));
896 #if 0 /* This should no longer be needed, because
897 flag_gnu_linker should be 0 on these systems,
898 which should prevent any output
899 if ASM_OUTPUT_CONSTRUCTOR and ASM_OUTPUT_DESTRUCTOR are absent. */
900 #if !(defined(DBX_DEBUGGING_INFO) && !defined(FASCIST_ASSEMBLER))
901 #ifndef ASM_OUTPUT_CONSTRUCTOR
902 #define ASM_OUTPUT_CONSTRUCTOR(file, name)
904 #ifndef ASM_OUTPUT_DESTRUCTOR
905 #define ASM_OUTPUT_DESTRUCTOR(file, name)
910 /* Record an element in the table of global destructors.
911 How this is done depends on what sort of assembler and linker
914 NAME should be the name of a global function to be called
915 at exit time. This name is output using assemble_name. */
918 assemble_destructor (name
)
921 #ifdef ASM_OUTPUT_DESTRUCTOR
922 ASM_OUTPUT_DESTRUCTOR (asm_out_file
, name
);
926 /* Now tell GNU LD that this is part of the static destructor set. */
927 /* This code works for any machine provided you use GNU as/ld. */
928 fprintf (asm_out_file
, "%s \"___DTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
929 assemble_name (asm_out_file
, name
);
930 fputc ('\n', asm_out_file
);
935 /* Likewise for global constructors. */
938 assemble_constructor (name
)
941 #ifdef ASM_OUTPUT_CONSTRUCTOR
942 ASM_OUTPUT_CONSTRUCTOR (asm_out_file
, name
);
946 /* Now tell GNU LD that this is part of the static constructor set. */
947 /* This code works for any machine provided you use GNU as/ld. */
948 fprintf (asm_out_file
, "%s \"___CTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
949 assemble_name (asm_out_file
, name
);
950 fputc ('\n', asm_out_file
);
955 /* Likewise for entries we want to record for garbage collection.
956 Garbage collection is still under development. */
959 assemble_gc_entry (name
)
962 #ifdef ASM_OUTPUT_GC_ENTRY
963 ASM_OUTPUT_GC_ENTRY (asm_out_file
, name
);
967 /* Now tell GNU LD that this is part of the static constructor set. */
968 fprintf (asm_out_file
, "%s \"___PTR_LIST__\",22,0,0,", ASM_STABS_OP
);
969 assemble_name (asm_out_file
, name
);
970 fputc ('\n', asm_out_file
);
975 /* CONSTANT_POOL_BEFORE_FUNCTION may be defined as an expression with
976 a non-zero value if the constant pool should be output before the
977 start of the function, or a zero value if the pool should output
978 after the end of the function. The default is to put it before the
981 #ifndef CONSTANT_POOL_BEFORE_FUNCTION
982 #define CONSTANT_POOL_BEFORE_FUNCTION 1
985 /* Output assembler code for the constant pool of a function and associated
986 with defining the name of the function. DECL describes the function.
987 NAME is the function's name. For the constant pool, we use the current
988 constant pool data. */
991 assemble_start_function (decl
, fnname
)
997 /* The following code does not need preprocessing in the assembler. */
1001 if (CONSTANT_POOL_BEFORE_FUNCTION
)
1002 output_constant_pool (fnname
, decl
);
1004 #ifdef ASM_OUTPUT_SECTION_NAME
1005 /* If the function is to be put in its own section and it's not in a section
1006 already, indicate so. */
1007 if ((flag_function_sections
1008 && DECL_SECTION_NAME (decl
) == NULL_TREE
)
1009 || UNIQUE_SECTION_P (decl
))
1010 UNIQUE_SECTION (decl
, 0);
1013 function_section (decl
);
1015 /* Tell assembler to move to target machine's alignment for functions. */
1016 align
= floor_log2 (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
1018 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1020 /* Handle a user-specified function alignment.
1021 Note that we still need to align to FUNCTION_BOUNDARY, as above,
1022 because ASM_OUTPUT_MAX_SKIP_ALIGN might not do any alignment at all. */
1023 if (align_functions_log
> align
)
1025 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
1026 ASM_OUTPUT_MAX_SKIP_ALIGN (asm_out_file
,
1027 align_functions_log
, align_functions
-1);
1029 ASM_OUTPUT_ALIGN (asm_out_file
, align_functions_log
);
1033 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
1034 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file
, fnname
);
1037 #ifdef SDB_DEBUGGING_INFO
1038 /* Output SDB definition of the function. */
1039 if (write_symbols
== SDB_DEBUG
)
1040 sdbout_mark_begin_function ();
1043 #ifdef DBX_DEBUGGING_INFO
1044 /* Output DBX definition of the function. */
1045 if (write_symbols
== DBX_DEBUG
)
1046 dbxout_begin_function (decl
);
1049 /* Make function name accessible from other files, if appropriate. */
1051 if (TREE_PUBLIC (decl
))
1053 if (! first_global_object_name
)
1058 if (! DECL_WEAK (decl
) && ! DECL_ONE_ONLY (decl
))
1059 name
= &first_global_object_name
;
1061 name
= &weak_global_object_name
;
1063 STRIP_NAME_ENCODING (p
, fnname
);
1064 *name
= permalloc (strlen (p
) + 1);
1068 #ifdef ASM_WEAKEN_LABEL
1069 if (DECL_WEAK (decl
))
1071 ASM_WEAKEN_LABEL (asm_out_file
, fnname
);
1072 /* Remove this function from the pending weak list so that
1073 we do not emit multiple .weak directives for it. */
1074 remove_from_pending_weak_list
1075 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
1079 ASM_GLOBALIZE_LABEL (asm_out_file
, fnname
);
1082 /* Do any machine/system dependent processing of the function name */
1083 #ifdef ASM_DECLARE_FUNCTION_NAME
1084 ASM_DECLARE_FUNCTION_NAME (asm_out_file
, fnname
, current_function_decl
);
1086 /* Standard thing is just output label for the function. */
1087 ASM_OUTPUT_LABEL (asm_out_file
, fnname
);
1088 #endif /* ASM_DECLARE_FUNCTION_NAME */
1091 /* Output assembler code associated with defining the size of the
1092 function. DECL describes the function. NAME is the function's name. */
1095 assemble_end_function (decl
, fnname
)
1099 #ifdef ASM_DECLARE_FUNCTION_SIZE
1100 ASM_DECLARE_FUNCTION_SIZE (asm_out_file
, fnname
, decl
);
1102 if (! CONSTANT_POOL_BEFORE_FUNCTION
)
1104 output_constant_pool (fnname
, decl
);
1105 function_section (decl
); /* need to switch back */
1108 /* Output any constants which should appear after the function. */
1109 output_after_function_constants ();
1112 /* Assemble code to leave SIZE bytes of zeros. */
1115 assemble_zeros (size
)
1118 /* Do no output if -fsyntax-only. */
1119 if (flag_syntax_only
)
1122 #ifdef ASM_NO_SKIP_IN_TEXT
1123 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
1124 so we must output 0s explicitly in the text section. */
1125 if (ASM_NO_SKIP_IN_TEXT
&& in_text_section ())
1129 for (i
= 0; i
< size
- 20; i
+= 20)
1132 fprintf (asm_out_file
,
1133 "%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
);
1135 fprintf (asm_out_file
,
1136 "\tbyte 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n");
1142 fprintf (asm_out_file
, "%s 0", ASM_BYTE_OP
);
1144 fprintf (asm_out_file
, "\tbyte 0");
1147 for (; i
< size
; i
++)
1148 fprintf (asm_out_file
, ",0");
1149 fprintf (asm_out_file
, "\n");
1155 ASM_OUTPUT_SKIP (asm_out_file
, size
);
1158 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
1161 assemble_align (align
)
1164 if (align
> BITS_PER_UNIT
)
1165 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
1168 /* Assemble a string constant with the specified C string as contents. */
1171 assemble_string (p
, size
)
1178 /* If the string is very long, split it up. */
1182 int thissize
= size
- pos
;
1183 if (thissize
> maximum
)
1186 ASM_OUTPUT_ASCII (asm_out_file
, p
, thissize
);
1194 #if defined ASM_OUTPUT_ALIGNED_DECL_LOCAL
1195 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1196 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1198 #if defined ASM_OUTPUT_ALIGNED_LOCAL
1199 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1200 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, DECL_ALIGN (decl))
1202 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1203 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded)
1207 #if defined ASM_OUTPUT_ALIGNED_BSS
1208 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1209 ASM_OUTPUT_ALIGNED_BSS (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1211 #if defined ASM_OUTPUT_BSS
1212 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1213 ASM_OUTPUT_BSS (asm_out_file, decl, name, size, rounded)
1219 #if defined ASM_OUTPUT_ALIGNED_DECL_COMMON
1220 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1221 ASM_OUTPUT_ALIGNED_DECL_COMMON (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1223 #if defined ASM_OUTPUT_ALIGNED_COMMON
1224 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1225 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file, name, size, DECL_ALIGN (decl))
1227 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1228 ASM_OUTPUT_COMMON (asm_out_file, name, size, rounded)
1233 asm_emit_uninitialised (decl
, name
, size
, rounded
)
1236 int size ATTRIBUTE_UNUSED
;
1237 int rounded ATTRIBUTE_UNUSED
;
1245 destination
= asm_dest_local
;
1247 if (TREE_PUBLIC (decl
))
1249 #if defined ASM_EMIT_BSS
1250 if (! DECL_COMMON (decl
))
1251 destination
= asm_dest_bss
;
1254 destination
= asm_dest_common
;
1257 if (flag_shared_data
)
1259 switch (destination
)
1261 #ifdef ASM_OUTPUT_SHARED_BSS
1263 ASM_OUTPUT_SHARED_BSS (asm_out_file
, decl
, name
, size
, rounded
);
1266 #ifdef ASM_OUTPUT_SHARED_COMMON
1267 case asm_dest_common
:
1268 ASM_OUTPUT_SHARED_COMMON (asm_out_file
, name
, size
, rounded
);
1271 #ifdef ASM_OUTPUT_SHARED_LOCAL
1272 case asm_dest_local
:
1273 ASM_OUTPUT_SHARED_LOCAL (asm_out_file
, name
, size
, rounded
);
1281 #ifdef ASM_OUTPUT_SECTION_NAME
1282 /* We already know that DECL_SECTION_NAME() == NULL. */
1283 if (flag_data_sections
!= 0 || UNIQUE_SECTION_P (decl
))
1284 UNIQUE_SECTION (decl
, NULL
);
1287 switch (destination
)
1291 ASM_EMIT_BSS (decl
, name
, size
, rounded
);
1294 case asm_dest_common
:
1295 ASM_EMIT_COMMON (decl
, name
, size
, rounded
);
1297 case asm_dest_local
:
1298 ASM_EMIT_LOCAL (decl
, name
, size
, rounded
);
1307 /* Assemble everything that is needed for a variable or function declaration.
1308 Not used for automatic variables, and not used for function definitions.
1309 Should not be called for variables of incomplete structure type.
1311 TOP_LEVEL is nonzero if this variable has file scope.
1312 AT_END is nonzero if this is the special handling, at end of compilation,
1313 to define things that have had only tentative definitions.
1314 DONT_OUTPUT_DATA if nonzero means don't actually output the
1315 initial value (that will be done by the caller). */
1318 assemble_variable (decl
, top_level
, at_end
, dont_output_data
)
1320 int top_level ATTRIBUTE_UNUSED
;
1321 int at_end ATTRIBUTE_UNUSED
;
1322 int dont_output_data
;
1324 register char *name
;
1326 tree size_tree
= NULL_TREE
;
1328 enum in_section saved_in_section
;
1330 last_assemble_variable_decl
= 0;
1332 if (GET_CODE (DECL_RTL (decl
)) == REG
)
1334 /* Do output symbol info for global register variables, but do nothing
1337 if (TREE_ASM_WRITTEN (decl
))
1339 TREE_ASM_WRITTEN (decl
) = 1;
1341 /* Do no output if -fsyntax-only. */
1342 if (flag_syntax_only
)
1345 #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
1346 /* File-scope global variables are output here. */
1347 if ((write_symbols
== DBX_DEBUG
|| write_symbols
== XCOFF_DEBUG
)
1349 dbxout_symbol (decl
, 0);
1351 #ifdef SDB_DEBUGGING_INFO
1352 if (write_symbols
== SDB_DEBUG
&& top_level
1353 /* Leave initialized global vars for end of compilation;
1354 see comment in compile_file. */
1355 && (TREE_PUBLIC (decl
) == 0 || DECL_INITIAL (decl
) == 0))
1356 sdbout_symbol (decl
, 0);
1359 /* Don't output any DWARF debugging information for variables here.
1360 In the case of local variables, the information for them is output
1361 when we do our recursive traversal of the tree representation for
1362 the entire containing function. In the case of file-scope variables,
1363 we output information for all of them at the very end of compilation
1364 while we are doing our final traversal of the chain of file-scope
1370 /* Normally no need to say anything here for external references,
1371 since assemble_external is called by the language-specific code
1372 when a declaration is first seen. */
1374 if (DECL_EXTERNAL (decl
))
1377 /* Output no assembler code for a function declaration.
1378 Only definitions of functions output anything. */
1380 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1383 /* If type was incomplete when the variable was declared,
1384 see if it is complete now. */
1386 if (DECL_SIZE (decl
) == 0)
1387 layout_decl (decl
, 0);
1389 /* Still incomplete => don't allocate it; treat the tentative defn
1390 (which is what it must have been) as an `extern' reference. */
1392 if (!dont_output_data
&& DECL_SIZE (decl
) == 0)
1394 error_with_file_and_line (DECL_SOURCE_FILE (decl
),
1395 DECL_SOURCE_LINE (decl
),
1396 "storage size of `%s' isn't known",
1397 IDENTIFIER_POINTER (DECL_NAME (decl
)));
1398 TREE_ASM_WRITTEN (decl
) = 1;
1402 /* The first declaration of a variable that comes through this function
1403 decides whether it is global (in C, has external linkage)
1404 or local (in C, has internal linkage). So do nothing more
1405 if this function has already run. */
1407 if (TREE_ASM_WRITTEN (decl
))
1410 TREE_ASM_WRITTEN (decl
) = 1;
1412 /* Do no output if -fsyntax-only. */
1413 if (flag_syntax_only
)
1418 if (! dont_output_data
)
1422 if (TREE_CODE (DECL_SIZE_UNIT (decl
)) != INTEGER_CST
)
1425 size_tree
= DECL_SIZE_UNIT (decl
);
1426 size
= TREE_INT_CST_LOW (size_tree
);
1428 if (TREE_INT_CST_HIGH (size_tree
) != 0
1429 || size
!= TREE_INT_CST_LOW (size_tree
))
1431 error_with_decl (decl
, "size of variable `%s' is too large");
1436 name
= XSTR (XEXP (DECL_RTL (decl
), 0), 0);
1437 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
)
1438 && ! first_global_object_name
1439 && ! (DECL_COMMON (decl
) && (DECL_INITIAL (decl
) == 0
1440 || DECL_INITIAL (decl
) == error_mark_node
))
1441 && ! DECL_WEAK (decl
)
1442 && ! DECL_ONE_ONLY (decl
))
1446 STRIP_NAME_ENCODING (p
, name
);
1447 first_global_object_name
= permalloc (strlen (p
) + 1);
1448 strcpy (first_global_object_name
, p
);
1451 /* Compute the alignment of this data. */
1453 align
= DECL_ALIGN (decl
);
1455 /* In the case for initialing an array whose length isn't specified,
1456 where we have not yet been able to do the layout,
1457 figure out the proper alignment now. */
1458 if (dont_output_data
&& DECL_SIZE (decl
) == 0
1459 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
)
1460 align
= MAX (align
, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl
))));
1462 /* Some object file formats have a maximum alignment which they support.
1463 In particular, a.out format supports a maximum alignment of 4. */
1464 #ifndef MAX_OFILE_ALIGNMENT
1465 #define MAX_OFILE_ALIGNMENT BIGGEST_ALIGNMENT
1467 if (align
> MAX_OFILE_ALIGNMENT
)
1469 warning_with_decl (decl
,
1470 "alignment of `%s' is greater than maximum object file alignment. Using %d.",
1471 MAX_OFILE_ALIGNMENT
/BITS_PER_UNIT
);
1472 align
= MAX_OFILE_ALIGNMENT
;
1475 /* On some machines, it is good to increase alignment sometimes. */
1476 #ifdef DATA_ALIGNMENT
1477 align
= DATA_ALIGNMENT (TREE_TYPE (decl
), align
);
1479 #ifdef CONSTANT_ALIGNMENT
1480 if (DECL_INITIAL (decl
) != 0 && DECL_INITIAL (decl
) != error_mark_node
)
1481 align
= CONSTANT_ALIGNMENT (DECL_INITIAL (decl
), align
);
1484 /* Reset the alignment in case we have made it tighter, so we can benefit
1485 from it in get_pointer_alignment. */
1486 DECL_ALIGN (decl
) = align
;
1488 /* Handle uninitialized definitions. */
1490 if ((DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
)
1491 /* If the target can't output uninitialized but not common global data
1492 in .bss, then we have to use .data. */
1493 #if ! defined ASM_EMIT_BSS
1494 && DECL_COMMON (decl
)
1496 && DECL_SECTION_NAME (decl
) == NULL_TREE
1497 && ! dont_output_data
)
1499 int size
= TREE_INT_CST_LOW (size_tree
);
1502 /* Don't allocate zero bytes of common,
1503 since that means "undefined external" in the linker. */
1504 if (size
== 0) rounded
= 1;
1505 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1506 so that each uninitialized object starts on such a boundary. */
1507 rounded
+= (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1;
1508 rounded
= (rounded
/ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1509 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1511 #if !defined(ASM_OUTPUT_ALIGNED_COMMON) && !defined(ASM_OUTPUT_ALIGNED_BSS)
1512 if ((DECL_ALIGN (decl
) / BITS_PER_UNIT
) > (unsigned int) rounded
)
1514 (decl
, "requested alignment for %s is greater than implemented alignment of %d.",rounded
);
1517 #ifdef DBX_DEBUGGING_INFO
1518 /* File-scope global variables are output here. */
1519 if (write_symbols
== DBX_DEBUG
&& top_level
)
1520 dbxout_symbol (decl
, 0);
1522 #ifdef SDB_DEBUGGING_INFO
1523 if (write_symbols
== SDB_DEBUG
&& top_level
1524 /* Leave initialized global vars for end of compilation;
1525 see comment in compile_file. */
1526 && (TREE_PUBLIC (decl
) == 0 || DECL_INITIAL (decl
) == 0))
1527 sdbout_symbol (decl
, 0);
1530 /* Don't output any DWARF debugging information for variables here.
1531 In the case of local variables, the information for them is output
1532 when we do our recursive traversal of the tree representation for
1533 the entire containing function. In the case of file-scope variables,
1534 we output information for all of them at the very end of compilation
1535 while we are doing our final traversal of the chain of file-scope
1538 #if 0 /* ??? We should either delete this or add a comment describing what
1539 it was intended to do and why we shouldn't delete it. */
1540 if (flag_shared_data
)
1543 asm_emit_uninitialised (decl
, name
, size
, rounded
);
1548 /* Handle initialized definitions.
1549 Also handle uninitialized global definitions if -fno-common and the
1550 target doesn't support ASM_OUTPUT_BSS. */
1552 /* First make the assembler name(s) global if appropriate. */
1553 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
))
1555 #ifdef ASM_WEAKEN_LABEL
1556 if (DECL_WEAK (decl
))
1558 ASM_WEAKEN_LABEL (asm_out_file
, name
);
1559 /* Remove this variable from the pending weak list so that
1560 we do not emit multiple .weak directives for it. */
1561 remove_from_pending_weak_list
1562 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
1566 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
1569 for (d
= equivalents
; d
; d
= TREE_CHAIN (d
))
1571 tree e
= TREE_VALUE (d
);
1572 if (TREE_PUBLIC (e
) && DECL_NAME (e
))
1573 ASM_GLOBALIZE_LABEL (asm_out_file
,
1574 XSTR (XEXP (DECL_RTL (e
), 0), 0));
1578 /* Output any data that we will need to use the address of. */
1579 if (DECL_INITIAL (decl
) == error_mark_node
)
1580 reloc
= contains_pointers_p (TREE_TYPE (decl
));
1581 else if (DECL_INITIAL (decl
))
1582 reloc
= output_addressed_constants (DECL_INITIAL (decl
));
1584 #ifdef ASM_OUTPUT_SECTION_NAME
1585 if ((flag_data_sections
!= 0 && DECL_SECTION_NAME (decl
) == NULL_TREE
)
1586 || UNIQUE_SECTION_P (decl
))
1587 UNIQUE_SECTION (decl
, reloc
);
1590 /* Switch to the appropriate section. */
1591 variable_section (decl
, reloc
);
1593 /* dbxout.c needs to know this. */
1594 if (in_text_section ())
1595 DECL_IN_TEXT_SECTION (decl
) = 1;
1597 /* Record current section so we can restore it if dbxout.c clobbers it. */
1598 saved_in_section
= in_section
;
1600 /* Output the dbx info now that we have chosen the section. */
1602 #ifdef DBX_DEBUGGING_INFO
1603 /* File-scope global variables are output here. */
1604 if (write_symbols
== DBX_DEBUG
&& top_level
)
1605 dbxout_symbol (decl
, 0);
1607 #ifdef SDB_DEBUGGING_INFO
1608 if (write_symbols
== SDB_DEBUG
&& top_level
1609 /* Leave initialized global vars for end of compilation;
1610 see comment in compile_file. */
1611 && (TREE_PUBLIC (decl
) == 0 || DECL_INITIAL (decl
) == 0))
1612 sdbout_symbol (decl
, 0);
1615 /* Don't output any DWARF debugging information for variables here.
1616 In the case of local variables, the information for them is output
1617 when we do our recursive traversal of the tree representation for
1618 the entire containing function. In the case of file-scope variables,
1619 we output information for all of them at the very end of compilation
1620 while we are doing our final traversal of the chain of file-scope
1623 /* If the debugging output changed sections, reselect the section
1624 that's supposed to be selected. */
1625 if (in_section
!= saved_in_section
)
1626 variable_section (decl
, reloc
);
1628 /* Output the alignment of this data. */
1629 if (align
> BITS_PER_UNIT
)
1630 ASM_OUTPUT_ALIGN (asm_out_file
,
1631 floor_log2 (DECL_ALIGN (decl
) / BITS_PER_UNIT
));
1633 /* Do any machine/system dependent processing of the object. */
1634 #ifdef ASM_DECLARE_OBJECT_NAME
1635 last_assemble_variable_decl
= decl
;
1636 ASM_DECLARE_OBJECT_NAME (asm_out_file
, name
, decl
);
1638 /* Standard thing is just output label for the object. */
1639 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1640 #endif /* ASM_DECLARE_OBJECT_NAME */
1642 if (!dont_output_data
)
1644 if (DECL_INITIAL (decl
))
1645 /* Output the actual data. */
1646 output_constant (DECL_INITIAL (decl
), TREE_INT_CST_LOW (size_tree
));
1648 /* Leave space for it. */
1649 assemble_zeros (TREE_INT_CST_LOW (size_tree
));
1653 #ifdef XCOFF_DEBUGGING_INFO
1654 /* Unfortunately, the IBM assembler cannot handle stabx before the actual
1655 declaration. When something like ".stabx "aa:S-2",aa,133,0" is emitted
1656 and `aa' hasn't been output yet, the assembler generates a stab entry with
1657 a value of zero, in addition to creating an unnecessary external entry
1658 for `aa'. Hence, we must postpone dbxout_symbol to here at the end. */
1660 /* File-scope global variables are output here. */
1661 if (write_symbols
== XCOFF_DEBUG
&& top_level
)
1663 saved_in_section
= in_section
;
1665 dbxout_symbol (decl
, 0);
1667 if (in_section
!= saved_in_section
)
1668 variable_section (decl
, reloc
);
1671 /* There must be a statement after a label. */
1676 /* Return 1 if type TYPE contains any pointers. */
1679 contains_pointers_p (type
)
1682 switch (TREE_CODE (type
))
1685 case REFERENCE_TYPE
:
1686 /* I'm not sure whether OFFSET_TYPE needs this treatment,
1687 so I'll play safe and return 1. */
1693 case QUAL_UNION_TYPE
:
1696 /* For a type that has fields, see if the fields have pointers. */
1697 for (fields
= TYPE_FIELDS (type
); fields
; fields
= TREE_CHAIN (fields
))
1698 if (TREE_CODE (fields
) == FIELD_DECL
1699 && contains_pointers_p (TREE_TYPE (fields
)))
1705 /* An array type contains pointers if its element type does. */
1706 return contains_pointers_p (TREE_TYPE (type
));
1713 /* Output something to declare an external symbol to the assembler.
1714 (Most assemblers don't need this, so we normally output nothing.)
1715 Do nothing if DECL is not external. */
1718 assemble_external (decl
)
1719 tree decl ATTRIBUTE_UNUSED
;
1721 #ifdef ASM_OUTPUT_EXTERNAL
1722 if (TREE_CODE_CLASS (TREE_CODE (decl
)) == 'd'
1723 && DECL_EXTERNAL (decl
) && TREE_PUBLIC (decl
))
1725 rtx rtl
= DECL_RTL (decl
);
1727 if (GET_CODE (rtl
) == MEM
&& GET_CODE (XEXP (rtl
, 0)) == SYMBOL_REF
1728 && ! SYMBOL_REF_USED (XEXP (rtl
, 0)))
1730 /* Some systems do require some output. */
1731 SYMBOL_REF_USED (XEXP (rtl
, 0)) = 1;
1732 ASM_OUTPUT_EXTERNAL (asm_out_file
, decl
, XSTR (XEXP (rtl
, 0), 0));
1738 /* Similar, for calling a library function FUN. */
1741 assemble_external_libcall (fun
)
1742 rtx fun ATTRIBUTE_UNUSED
;
1744 #ifdef ASM_OUTPUT_EXTERNAL_LIBCALL
1745 /* Declare library function name external when first used, if nec. */
1746 if (! SYMBOL_REF_USED (fun
))
1748 SYMBOL_REF_USED (fun
) = 1;
1749 ASM_OUTPUT_EXTERNAL_LIBCALL (asm_out_file
, fun
);
1754 /* Declare the label NAME global. */
1757 assemble_global (name
)
1760 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
1763 /* Assemble a label named NAME. */
1766 assemble_label (name
)
1769 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1772 /* Output to FILE a reference to the assembler name of a C-level name NAME.
1773 If NAME starts with a *, the rest of NAME is output verbatim.
1774 Otherwise NAME is transformed in an implementation-defined way
1775 (usually by the addition of an underscore).
1776 Many macros in the tm file are defined to call this function. */
1779 assemble_name (file
, name
)
1783 const char *real_name
;
1786 STRIP_NAME_ENCODING (real_name
, name
);
1787 if (flag_prefix_function_name
1788 && ! bcmp (real_name
, CHKR_PREFIX
, CHKR_PREFIX_SIZE
))
1789 real_name
= real_name
+ CHKR_PREFIX_SIZE
;
1791 id
= maybe_get_identifier (real_name
);
1793 TREE_SYMBOL_REFERENCED (id
) = 1;
1796 fputs (&name
[1], file
);
1798 ASM_OUTPUT_LABELREF (file
, name
);
1801 /* Allocate SIZE bytes writable static space with a gensym name
1802 and return an RTX to refer to its address. */
1805 assemble_static_space (size
)
1813 if (flag_shared_data
)
1817 ASM_GENERATE_INTERNAL_LABEL (name
, "LF", const_labelno
);
1819 namestring
= ggc_alloc_string (name
, -1);
1821 x
= gen_rtx_SYMBOL_REF (Pmode
, namestring
);
1823 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
1824 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file
, NULL_TREE
, name
, size
,
1827 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1828 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file
, name
, size
, BIGGEST_ALIGNMENT
);
1831 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1832 so that each uninitialized object starts on such a boundary. */
1833 /* Variable `rounded' might or might not be used in ASM_OUTPUT_LOCAL. */
1834 int rounded ATTRIBUTE_UNUSED
1835 = ((size
+ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1)
1836 / (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1837 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1838 ASM_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
1845 /* Assemble the static constant template for function entry trampolines.
1846 This is done at most once per compilation.
1847 Returns an RTX for the address of the template. */
1849 #ifdef TRAMPOLINE_TEMPLATE
1851 assemble_trampoline_template ()
1857 /* By default, put trampoline templates in read-only data section. */
1859 #ifdef TRAMPOLINE_SECTION
1860 TRAMPOLINE_SECTION ();
1862 readonly_data_section ();
1865 /* Write the assembler code to define one. */
1866 align
= floor_log2 (TRAMPOLINE_ALIGNMENT
/ BITS_PER_UNIT
);
1868 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1870 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LTRAMP", 0);
1871 TRAMPOLINE_TEMPLATE (asm_out_file
);
1873 /* Record the rtl to refer to it. */
1874 ASM_GENERATE_INTERNAL_LABEL (label
, "LTRAMP", 0);
1875 name
= ggc_alloc_string (label
, -1);
1876 return gen_rtx_SYMBOL_REF (Pmode
, name
);
1880 /* Assemble the integer constant X into an object of SIZE bytes.
1881 X must be either a CONST_INT or CONST_DOUBLE.
1883 Return 1 if we were able to output the constant, otherwise 0. If FORCE is
1884 non-zero, abort if we can't output the constant. */
1887 assemble_integer (x
, size
, force
)
1892 /* First try to use the standard 1, 2, 4, 8, and 16 byte
1893 ASM_OUTPUT... macros. */
1897 #ifdef ASM_OUTPUT_CHAR
1899 ASM_OUTPUT_CHAR (asm_out_file
, x
);
1903 #ifdef ASM_OUTPUT_SHORT
1905 ASM_OUTPUT_SHORT (asm_out_file
, x
);
1909 #ifdef ASM_OUTPUT_INT
1911 ASM_OUTPUT_INT (asm_out_file
, x
);
1915 #ifdef ASM_OUTPUT_DOUBLE_INT
1917 ASM_OUTPUT_DOUBLE_INT (asm_out_file
, x
);
1921 #ifdef ASM_OUTPUT_QUADRUPLE_INT
1923 ASM_OUTPUT_QUADRUPLE_INT (asm_out_file
, x
);
1928 /* If we couldn't do it that way, there are two other possibilities: First,
1929 if the machine can output an explicit byte and this is a 1 byte constant,
1930 we can use ASM_OUTPUT_BYTE. */
1932 #ifdef ASM_OUTPUT_BYTE
1933 if (size
== 1 && GET_CODE (x
) == CONST_INT
)
1935 ASM_OUTPUT_BYTE (asm_out_file
, INTVAL (x
));
1940 /* Finally, if SIZE is larger than a single word, try to output the constant
1941 one word at a time. */
1943 if (size
> UNITS_PER_WORD
)
1946 enum machine_mode mode
1947 = mode_for_size (size
* BITS_PER_UNIT
, MODE_INT
, 0);
1950 for (i
= 0; i
< size
/ UNITS_PER_WORD
; i
++)
1952 word
= operand_subword (x
, i
, 0, mode
);
1957 if (! assemble_integer (word
, UNITS_PER_WORD
, 0))
1961 if (i
== size
/ UNITS_PER_WORD
)
1963 /* If we output at least one word and then could not finish,
1964 there is no valid way to continue. */
1975 /* Assemble the floating-point constant D into an object of size MODE. */
1978 assemble_real (d
, mode
)
1980 enum machine_mode mode
;
1982 jmp_buf output_constant_handler
;
1984 if (setjmp (output_constant_handler
))
1986 error ("floating point trap outputting a constant");
1987 #ifdef REAL_IS_NOT_DOUBLE
1988 bzero ((char *) &d
, sizeof d
);
1995 set_float_handler (output_constant_handler
);
1999 #ifdef ASM_OUTPUT_BYTE_FLOAT
2001 ASM_OUTPUT_BYTE_FLOAT (asm_out_file
, d
);
2004 #ifdef ASM_OUTPUT_SHORT_FLOAT
2006 ASM_OUTPUT_SHORT_FLOAT (asm_out_file
, d
);
2009 #ifdef ASM_OUTPUT_THREE_QUARTER_FLOAT
2011 ASM_OUTPUT_THREE_QUARTER_FLOAT (asm_out_file
, d
);
2014 #ifdef ASM_OUTPUT_FLOAT
2016 ASM_OUTPUT_FLOAT (asm_out_file
, d
);
2020 #ifdef ASM_OUTPUT_DOUBLE
2022 ASM_OUTPUT_DOUBLE (asm_out_file
, d
);
2026 #ifdef ASM_OUTPUT_LONG_DOUBLE
2029 ASM_OUTPUT_LONG_DOUBLE (asm_out_file
, d
);
2037 set_float_handler (NULL_PTR
);
2040 /* Here we combine duplicate floating constants to make
2041 CONST_DOUBLE rtx's, and force those out to memory when necessary. */
2043 /* Return a CONST_DOUBLE or CONST_INT for a value specified as a pair of ints.
2044 For an integer, I0 is the low-order word and I1 is the high-order word.
2045 For a real number, I0 is the word with the low address
2046 and I1 is the word with the high address. */
2049 immed_double_const (i0
, i1
, mode
)
2050 HOST_WIDE_INT i0
, i1
;
2051 enum machine_mode mode
;
2055 if (GET_MODE_CLASS (mode
) == MODE_INT
2056 || GET_MODE_CLASS (mode
) == MODE_PARTIAL_INT
)
2058 /* We clear out all bits that don't belong in MODE, unless they and our
2059 sign bit are all one. So we get either a reasonable negative value
2060 or a reasonable unsigned value for this mode. */
2061 int width
= GET_MODE_BITSIZE (mode
);
2062 if (width
< HOST_BITS_PER_WIDE_INT
2063 && ((i0
& ((HOST_WIDE_INT
) (-1) << (width
- 1)))
2064 != ((HOST_WIDE_INT
) (-1) << (width
- 1))))
2065 i0
&= ((HOST_WIDE_INT
) 1 << width
) - 1, i1
= 0;
2066 else if (width
== HOST_BITS_PER_WIDE_INT
2067 && ! (i1
== ~0 && i0
< 0))
2069 else if (width
> 2 * HOST_BITS_PER_WIDE_INT
)
2070 /* We cannot represent this value as a constant. */
2073 /* If this would be an entire word for the target, but is not for
2074 the host, then sign-extend on the host so that the number will look
2075 the same way on the host that it would on the target.
2077 For example, when building a 64 bit alpha hosted 32 bit sparc
2078 targeted compiler, then we want the 32 bit unsigned value -1 to be
2079 represented as a 64 bit value -1, and not as 0x00000000ffffffff.
2080 The later confuses the sparc backend. */
2082 if (BITS_PER_WORD
< HOST_BITS_PER_WIDE_INT
&& BITS_PER_WORD
== width
2083 && (i0
& ((HOST_WIDE_INT
) 1 << (width
- 1))))
2084 i0
|= ((HOST_WIDE_INT
) (-1) << width
);
2086 /* If MODE fits within HOST_BITS_PER_WIDE_INT, always use a CONST_INT.
2088 ??? Strictly speaking, this is wrong if we create a CONST_INT
2089 for a large unsigned constant with the size of MODE being
2090 HOST_BITS_PER_WIDE_INT and later try to interpret that constant in a
2091 wider mode. In that case we will mis-interpret it as a negative
2094 Unfortunately, the only alternative is to make a CONST_DOUBLE
2095 for any constant in any mode if it is an unsigned constant larger
2096 than the maximum signed integer in an int on the host. However,
2097 doing this will break everyone that always expects to see a CONST_INT
2098 for SImode and smaller.
2100 We have always been making CONST_INTs in this case, so nothing new
2103 if (width
<= HOST_BITS_PER_WIDE_INT
)
2104 i1
= (i0
< 0) ? ~(HOST_WIDE_INT
) 0 : 0;
2106 /* If this integer fits in one word, return a CONST_INT. */
2107 if ((i1
== 0 && i0
>= 0)
2108 || (i1
== ~0 && i0
< 0))
2109 return GEN_INT (i0
);
2111 /* We use VOIDmode for integers. */
2115 /* Search the chain for an existing CONST_DOUBLE with the right value.
2116 If one is found, return it. */
2118 for (r
= const_double_chain
; r
; r
= CONST_DOUBLE_CHAIN (r
))
2119 if (CONST_DOUBLE_LOW (r
) == i0
&& CONST_DOUBLE_HIGH (r
) == i1
2120 && GET_MODE (r
) == mode
)
2123 /* No; make a new one and add it to the chain.
2125 We may be called by an optimizer which may be discarding any memory
2126 allocated during its processing (such as combine and loop). However,
2127 we will be leaving this constant on the chain, so we cannot tolerate
2128 freed memory. So switch to saveable_obstack for this allocation
2129 and then switch back if we were in current_obstack. */
2131 push_obstacks_nochange ();
2132 rtl_in_saveable_obstack ();
2133 r
= gen_rtx_CONST_DOUBLE (mode
, NULL_RTX
, i0
, i1
);
2136 /* Don't touch const_double_chain if not inside any function. */
2137 if (current_function_decl
!= 0)
2139 CONST_DOUBLE_CHAIN (r
) = const_double_chain
;
2140 const_double_chain
= r
;
2143 /* Store const0_rtx in mem-slot since this CONST_DOUBLE is on the chain.
2144 Actual use of mem-slot is only through force_const_mem. */
2146 CONST_DOUBLE_MEM (r
) = const0_rtx
;
2151 /* Return a CONST_DOUBLE for a specified `double' value
2152 and machine mode. */
2155 immed_real_const_1 (d
, mode
)
2157 enum machine_mode mode
;
2159 union real_extract u
;
2162 /* Get the desired `double' value as a sequence of ints
2163 since that is how they are stored in a CONST_DOUBLE. */
2167 /* Detect special cases. */
2169 if (REAL_VALUES_IDENTICAL (dconst0
, d
))
2170 return CONST0_RTX (mode
);
2171 /* Check for NaN first, because some ports (specifically the i386) do not
2172 emit correct ieee-fp code by default, and thus will generate a core
2173 dump here if we pass a NaN to REAL_VALUES_EQUAL and if REAL_VALUES_EQUAL
2174 does a floating point comparison. */
2175 else if (! REAL_VALUE_ISNAN (d
) && REAL_VALUES_EQUAL (dconst1
, d
))
2176 return CONST1_RTX (mode
);
2178 if (sizeof u
== sizeof (HOST_WIDE_INT
))
2179 return immed_double_const (u
.i
[0], 0, mode
);
2180 if (sizeof u
== 2 * sizeof (HOST_WIDE_INT
))
2181 return immed_double_const (u
.i
[0], u
.i
[1], mode
);
2183 /* The rest of this function handles the case where
2184 a float value requires more than 2 ints of space.
2185 It will be deleted as dead code on machines that don't need it. */
2187 /* Search the chain for an existing CONST_DOUBLE with the right value.
2188 If one is found, return it. */
2190 for (r
= const_double_chain
; r
; r
= CONST_DOUBLE_CHAIN (r
))
2191 if (! bcmp ((char *) &CONST_DOUBLE_LOW (r
), (char *) &u
, sizeof u
)
2192 && GET_MODE (r
) == mode
)
2195 /* No; make a new one and add it to the chain.
2197 We may be called by an optimizer which may be discarding any memory
2198 allocated during its processing (such as combine and loop). However,
2199 we will be leaving this constant on the chain, so we cannot tolerate
2200 freed memory. So switch to saveable_obstack for this allocation
2201 and then switch back if we were in current_obstack. */
2202 push_obstacks_nochange ();
2203 rtl_in_saveable_obstack ();
2204 r
= rtx_alloc (CONST_DOUBLE
);
2207 bcopy ((char *) &u
, (char *) &CONST_DOUBLE_LOW (r
), sizeof u
);
2209 /* Don't touch const_double_chain if not inside any function. */
2210 if (current_function_decl
!= 0)
2212 CONST_DOUBLE_CHAIN (r
) = const_double_chain
;
2213 const_double_chain
= r
;
2216 /* Store const0_rtx in CONST_DOUBLE_MEM since this CONST_DOUBLE is on the
2217 chain, but has not been allocated memory. Actual use of CONST_DOUBLE_MEM
2218 is only through force_const_mem. */
2220 CONST_DOUBLE_MEM (r
) = const0_rtx
;
2225 /* Return a CONST_DOUBLE rtx for a value specified by EXP,
2226 which must be a REAL_CST tree node. */
2229 immed_real_const (exp
)
2232 return immed_real_const_1 (TREE_REAL_CST (exp
), TYPE_MODE (TREE_TYPE (exp
)));
2235 /* At the end of a function, forget the memory-constants
2236 previously made for CONST_DOUBLEs. Mark them as not on real_constant_chain.
2237 Also clear out real_constant_chain and clear out all the chain-pointers. */
2240 clear_const_double_mem ()
2242 register rtx r
, next
;
2244 for (r
= const_double_chain
; r
; r
= next
)
2246 next
= CONST_DOUBLE_CHAIN (r
);
2247 CONST_DOUBLE_CHAIN (r
) = 0;
2248 CONST_DOUBLE_MEM (r
) = cc0_rtx
;
2250 const_double_chain
= 0;
2253 /* Given an expression EXP with a constant value,
2254 reduce it to the sum of an assembler symbol and an integer.
2255 Store them both in the structure *VALUE.
2256 Abort if EXP does not reduce. */
2261 HOST_WIDE_INT offset
;
2265 decode_addr_const (exp
, value
)
2267 struct addr_const
*value
;
2269 register tree target
= TREE_OPERAND (exp
, 0);
2270 register int offset
= 0;
2275 if (TREE_CODE (target
) == COMPONENT_REF
2276 && (TREE_CODE (DECL_FIELD_BITPOS (TREE_OPERAND (target
, 1)))
2279 offset
+= TREE_INT_CST_LOW (DECL_FIELD_BITPOS (TREE_OPERAND (target
, 1))) / BITS_PER_UNIT
;
2280 target
= TREE_OPERAND (target
, 0);
2282 else if (TREE_CODE (target
) == ARRAY_REF
)
2284 if (TREE_CODE (TREE_OPERAND (target
, 1)) != INTEGER_CST
2285 || TREE_CODE (TYPE_SIZE (TREE_TYPE (target
))) != INTEGER_CST
)
2287 offset
+= ((TREE_INT_CST_LOW (TYPE_SIZE (TREE_TYPE (target
)))
2288 * TREE_INT_CST_LOW (TREE_OPERAND (target
, 1)))
2290 target
= TREE_OPERAND (target
, 0);
2296 switch (TREE_CODE (target
))
2300 x
= DECL_RTL (target
);
2304 x
= gen_rtx_MEM (FUNCTION_MODE
,
2305 gen_rtx_LABEL_REF (VOIDmode
,
2306 label_rtx (TREE_OPERAND (exp
, 0))));
2314 x
= TREE_CST_RTL (target
);
2321 if (GET_CODE (x
) != MEM
)
2326 value
->offset
= offset
;
2329 /* Uniquize all constants that appear in memory.
2330 Each constant in memory thus far output is recorded
2331 in `const_hash_table' with a `struct constant_descriptor'
2332 that contains a polish representation of the value of
2335 We cannot store the trees in the hash table
2336 because the trees may be temporary. */
2338 struct constant_descriptor
2340 struct constant_descriptor
*next
;
2347 #define MAX_HASH_TABLE 1009
2348 static struct constant_descriptor
*const_hash_table
[MAX_HASH_TABLE
];
2350 /* Mark a const_hash_table descriptor for GC. */
2353 mark_const_hash_entry (ptr
)
2356 struct constant_descriptor
*desc
= * (struct constant_descriptor
**) ptr
;
2360 ggc_mark_string (desc
->label
);
2361 ggc_mark_rtx (desc
->rtl
);
2366 /* Compute a hash code for a constant expression. */
2373 register int len
, hi
, i
;
2374 register enum tree_code code
= TREE_CODE (exp
);
2376 /* Either set P and LEN to the address and len of something to hash and
2377 exit the switch or return a value. */
2382 p
= (char *) &TREE_INT_CST_LOW (exp
);
2383 len
= 2 * sizeof TREE_INT_CST_LOW (exp
);
2387 p
= (char *) &TREE_REAL_CST (exp
);
2388 len
= sizeof TREE_REAL_CST (exp
);
2392 p
= TREE_STRING_POINTER (exp
);
2393 len
= TREE_STRING_LENGTH (exp
);
2397 return (const_hash (TREE_REALPART (exp
)) * 5
2398 + const_hash (TREE_IMAGPART (exp
)));
2401 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2403 len
= int_size_in_bytes (TREE_TYPE (exp
));
2404 p
= (char *) alloca (len
);
2405 get_set_constructor_bytes (exp
, (unsigned char *) p
, len
);
2412 /* For record type, include the type in the hashing.
2413 We do not do so for array types
2414 because (1) the sizes of the elements are sufficient
2415 and (2) distinct array types can have the same constructor.
2416 Instead, we include the array size because the constructor could
2418 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2419 hi
= ((unsigned long) TREE_TYPE (exp
) & ((1 << HASHBITS
) - 1))
2422 hi
= ((5 + int_size_in_bytes (TREE_TYPE (exp
)))
2423 & ((1 << HASHBITS
) - 1)) % MAX_HASH_TABLE
;
2425 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2426 if (TREE_VALUE (link
))
2428 = (hi
* 603 + const_hash (TREE_VALUE (link
))) % MAX_HASH_TABLE
;
2435 struct addr_const value
;
2437 decode_addr_const (exp
, &value
);
2438 if (GET_CODE (value
.base
) == SYMBOL_REF
)
2440 /* Don't hash the address of the SYMBOL_REF;
2441 only use the offset and the symbol name. */
2443 p
= XSTR (value
.base
, 0);
2444 for (i
= 0; p
[i
] != 0; i
++)
2445 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2447 else if (GET_CODE (value
.base
) == LABEL_REF
)
2448 hi
= value
.offset
+ CODE_LABEL_NUMBER (XEXP (value
.base
, 0)) * 13;
2452 hi
&= (1 << HASHBITS
) - 1;
2453 hi
%= MAX_HASH_TABLE
;
2459 return (const_hash (TREE_OPERAND (exp
, 0)) * 9
2460 + const_hash (TREE_OPERAND (exp
, 1)));
2464 case NON_LVALUE_EXPR
:
2465 return const_hash (TREE_OPERAND (exp
, 0)) * 7 + 2;
2471 /* Compute hashing function */
2473 for (i
= 0; i
< len
; i
++)
2474 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2476 hi
&= (1 << HASHBITS
) - 1;
2477 hi
%= MAX_HASH_TABLE
;
2481 /* Compare a constant expression EXP with a constant-descriptor DESC.
2482 Return 1 if DESC describes a constant with the same value as EXP. */
2485 compare_constant (exp
, desc
)
2487 struct constant_descriptor
*desc
;
2489 return 0 != compare_constant_1 (exp
, desc
->contents
);
2492 /* Compare constant expression EXP with a substring P of a constant descriptor.
2493 If they match, return a pointer to the end of the substring matched.
2494 If they do not match, return 0.
2496 Since descriptors are written in polish prefix notation,
2497 this function can be used recursively to test one operand of EXP
2498 against a subdescriptor, and if it succeeds it returns the
2499 address of the subdescriptor for the next operand. */
2502 compare_constant_1 (exp
, p
)
2506 register char *strp
;
2508 register enum tree_code code
= TREE_CODE (exp
);
2510 if (code
!= (enum tree_code
) *p
++)
2513 /* Either set STRP, P and LEN to pointers and length to compare and exit the
2514 switch, or return the result of the comparison. */
2519 /* Integer constants are the same only if the same width of type. */
2520 if (*p
++ != TYPE_PRECISION (TREE_TYPE (exp
)))
2523 strp
= (char *) &TREE_INT_CST_LOW (exp
);
2524 len
= 2 * sizeof TREE_INT_CST_LOW (exp
);
2528 /* Real constants are the same only if the same width of type. */
2529 if (*p
++ != TYPE_PRECISION (TREE_TYPE (exp
)))
2532 strp
= (char *) &TREE_REAL_CST (exp
);
2533 len
= sizeof TREE_REAL_CST (exp
);
2537 if (flag_writable_strings
)
2540 if ((enum machine_mode
) *p
++ != TYPE_MODE (TREE_TYPE (exp
)))
2543 strp
= TREE_STRING_POINTER (exp
);
2544 len
= TREE_STRING_LENGTH (exp
);
2545 if (bcmp ((char *) &TREE_STRING_LENGTH (exp
), p
,
2546 sizeof TREE_STRING_LENGTH (exp
)))
2549 p
+= sizeof TREE_STRING_LENGTH (exp
);
2553 p
= compare_constant_1 (TREE_REALPART (exp
), p
);
2557 return compare_constant_1 (TREE_IMAGPART (exp
), p
);
2560 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2562 int xlen
= len
= int_size_in_bytes (TREE_TYPE (exp
));
2564 strp
= (char *) alloca (len
);
2565 get_set_constructor_bytes (exp
, (unsigned char *) strp
, len
);
2566 if (bcmp ((char *) &xlen
, p
, sizeof xlen
))
2575 int length
= list_length (CONSTRUCTOR_ELTS (exp
));
2577 enum machine_mode mode
= TYPE_MODE (TREE_TYPE (exp
));
2578 int have_purpose
= 0;
2580 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2581 if (TREE_PURPOSE (link
))
2584 if (bcmp ((char *) &length
, p
, sizeof length
))
2589 /* For record constructors, insist that the types match.
2590 For arrays, just verify both constructors are for arrays.
2591 Then insist that either both or none have any TREE_PURPOSE
2593 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2594 type
= TREE_TYPE (exp
);
2598 if (bcmp ((char *) &type
, p
, sizeof type
))
2601 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2603 if (bcmp ((char *) &mode
, p
, sizeof mode
))
2611 if (bcmp ((char *) &have_purpose
, p
, sizeof have_purpose
))
2614 p
+= sizeof have_purpose
;
2616 /* For arrays, insist that the size in bytes match. */
2617 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2619 HOST_WIDE_INT size
= int_size_in_bytes (TREE_TYPE (exp
));
2621 if (bcmp ((char *) &size
, p
, sizeof size
))
2627 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2629 if (TREE_VALUE (link
))
2631 if ((p
= compare_constant_1 (TREE_VALUE (link
), p
)) == 0)
2638 if (bcmp ((char *) &zero
, p
, sizeof zero
))
2644 if (TREE_PURPOSE (link
)
2645 && TREE_CODE (TREE_PURPOSE (link
)) == FIELD_DECL
)
2647 if (bcmp ((char *) &TREE_PURPOSE (link
), p
,
2648 sizeof TREE_PURPOSE (link
)))
2651 p
+= sizeof TREE_PURPOSE (link
);
2653 else if (TREE_PURPOSE (link
))
2655 if ((p
= compare_constant_1 (TREE_PURPOSE (link
), p
)) == 0)
2658 else if (have_purpose
)
2662 if (bcmp ((char *) &zero
, p
, sizeof zero
))
2674 struct addr_const value
;
2676 decode_addr_const (exp
, &value
);
2677 strp
= (char *) &value
.offset
;
2678 len
= sizeof value
.offset
;
2679 /* Compare the offset. */
2681 if (*p
++ != *strp
++)
2684 /* Compare symbol name. */
2685 strp
= XSTR (value
.base
, 0);
2686 len
= strlen (strp
) + 1;
2693 p
= compare_constant_1 (TREE_OPERAND (exp
, 0), p
);
2697 return compare_constant_1 (TREE_OPERAND (exp
, 1), p
);
2701 case NON_LVALUE_EXPR
:
2702 return compare_constant_1 (TREE_OPERAND (exp
, 0), p
);
2708 /* Compare constant contents. */
2710 if (*p
++ != *strp
++)
2716 /* Construct a constant descriptor for the expression EXP.
2717 It is up to the caller to enter the descriptor in the hash table. */
2719 static struct constant_descriptor
*
2720 record_constant (exp
)
2723 struct constant_descriptor
*next
= 0;
2727 /* Make a struct constant_descriptor. The first three pointers will
2728 be filled in later. Here we just leave space for them. */
2730 obstack_grow (&permanent_obstack
, (char *) &next
, sizeof next
);
2731 obstack_grow (&permanent_obstack
, (char *) &label
, sizeof label
);
2732 obstack_grow (&permanent_obstack
, (char *) &rtl
, sizeof rtl
);
2733 record_constant_1 (exp
);
2734 return (struct constant_descriptor
*) obstack_finish (&permanent_obstack
);
2737 /* Add a description of constant expression EXP
2738 to the object growing in `permanent_obstack'.
2739 No need to return its address; the caller will get that
2740 from the obstack when the object is complete. */
2743 record_constant_1 (exp
)
2746 register char *strp
;
2748 register enum tree_code code
= TREE_CODE (exp
);
2750 obstack_1grow (&permanent_obstack
, (unsigned int) code
);
2755 obstack_1grow (&permanent_obstack
, TYPE_PRECISION (TREE_TYPE (exp
)));
2756 strp
= (char *) &TREE_INT_CST_LOW (exp
);
2757 len
= 2 * sizeof TREE_INT_CST_LOW (exp
);
2761 obstack_1grow (&permanent_obstack
, TYPE_PRECISION (TREE_TYPE (exp
)));
2762 strp
= (char *) &TREE_REAL_CST (exp
);
2763 len
= sizeof TREE_REAL_CST (exp
);
2767 if (flag_writable_strings
)
2770 obstack_1grow (&permanent_obstack
, TYPE_MODE (TREE_TYPE (exp
)));
2771 strp
= TREE_STRING_POINTER (exp
);
2772 len
= TREE_STRING_LENGTH (exp
);
2773 obstack_grow (&permanent_obstack
, (char *) &TREE_STRING_LENGTH (exp
),
2774 sizeof TREE_STRING_LENGTH (exp
));
2778 record_constant_1 (TREE_REALPART (exp
));
2779 record_constant_1 (TREE_IMAGPART (exp
));
2783 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2785 int nbytes
= int_size_in_bytes (TREE_TYPE (exp
));
2786 obstack_grow (&permanent_obstack
, &nbytes
, sizeof (nbytes
));
2787 obstack_blank (&permanent_obstack
, nbytes
);
2788 get_set_constructor_bytes
2789 (exp
, (unsigned char *) permanent_obstack
.next_free
-nbytes
,
2796 int length
= list_length (CONSTRUCTOR_ELTS (exp
));
2797 enum machine_mode mode
= TYPE_MODE (TREE_TYPE (exp
));
2799 int have_purpose
= 0;
2801 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2802 if (TREE_PURPOSE (link
))
2805 obstack_grow (&permanent_obstack
, (char *) &length
, sizeof length
);
2807 /* For record constructors, insist that the types match.
2808 For arrays, just verify both constructors are for arrays
2809 of the same mode. Then insist that either both or none
2810 have any TREE_PURPOSE values. */
2811 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2812 type
= TREE_TYPE (exp
);
2816 obstack_grow (&permanent_obstack
, (char *) &type
, sizeof type
);
2817 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2818 obstack_grow (&permanent_obstack
, &mode
, sizeof mode
);
2820 obstack_grow (&permanent_obstack
, (char *) &have_purpose
,
2821 sizeof have_purpose
);
2823 /* For arrays, insist that the size in bytes match. */
2824 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2826 HOST_WIDE_INT size
= int_size_in_bytes (TREE_TYPE (exp
));
2827 obstack_grow (&permanent_obstack
, (char *) &size
, sizeof size
);
2830 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2832 if (TREE_VALUE (link
))
2833 record_constant_1 (TREE_VALUE (link
));
2838 obstack_grow (&permanent_obstack
,
2839 (char *) &zero
, sizeof zero
);
2842 if (TREE_PURPOSE (link
)
2843 && TREE_CODE (TREE_PURPOSE (link
)) == FIELD_DECL
)
2844 obstack_grow (&permanent_obstack
,
2845 (char *) &TREE_PURPOSE (link
),
2846 sizeof TREE_PURPOSE (link
));
2847 else if (TREE_PURPOSE (link
))
2848 record_constant_1 (TREE_PURPOSE (link
));
2849 else if (have_purpose
)
2853 obstack_grow (&permanent_obstack
,
2854 (char *) &zero
, sizeof zero
);
2862 struct addr_const value
;
2864 decode_addr_const (exp
, &value
);
2865 /* Record the offset. */
2866 obstack_grow (&permanent_obstack
,
2867 (char *) &value
.offset
, sizeof value
.offset
);
2868 /* Record the symbol name. */
2869 obstack_grow (&permanent_obstack
, XSTR (value
.base
, 0),
2870 strlen (XSTR (value
.base
, 0)) + 1);
2877 record_constant_1 (TREE_OPERAND (exp
, 0));
2878 record_constant_1 (TREE_OPERAND (exp
, 1));
2883 case NON_LVALUE_EXPR
:
2884 record_constant_1 (TREE_OPERAND (exp
, 0));
2891 /* Record constant contents. */
2892 obstack_grow (&permanent_obstack
, strp
, len
);
2895 /* Record a list of constant expressions that were passed to
2896 output_constant_def but that could not be output right away. */
2898 struct deferred_constant
2900 struct deferred_constant
*next
;
2906 static struct deferred_constant
*deferred_constants
;
2908 /* Another list of constants which should be output after the
2910 static struct deferred_constant
*after_function_constants
;
2912 /* Nonzero means defer output of addressed subconstants
2913 (i.e., those for which output_constant_def is called.) */
2914 static int defer_addressed_constants_flag
;
2916 /* Start deferring output of subconstants. */
2919 defer_addressed_constants ()
2921 defer_addressed_constants_flag
++;
2924 /* Stop deferring output of subconstants,
2925 and output now all those that have been deferred. */
2928 output_deferred_addressed_constants ()
2930 struct deferred_constant
*p
, *next
;
2932 defer_addressed_constants_flag
--;
2934 if (defer_addressed_constants_flag
> 0)
2937 for (p
= deferred_constants
; p
; p
= next
)
2939 output_constant_def_contents (p
->exp
, p
->reloc
, p
->labelno
);
2944 deferred_constants
= 0;
2947 /* Output any constants which should appear after a function. */
2950 output_after_function_constants ()
2952 struct deferred_constant
*p
, *next
;
2954 for (p
= after_function_constants
; p
; p
= next
)
2956 output_constant_def_contents (p
->exp
, p
->reloc
, p
->labelno
);
2961 after_function_constants
= 0;
2964 /* Make a copy of the whole tree structure for a constant.
2965 This handles the same types of nodes that compare_constant
2966 and record_constant handle. */
2972 switch (TREE_CODE (exp
))
2975 /* For ADDR_EXPR, we do not want to copy the decl whose address
2976 is requested. We do want to copy constants though. */
2977 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, 0))) == 'c')
2978 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2979 copy_constant (TREE_OPERAND (exp
, 0)));
2981 return copy_node (exp
);
2986 return copy_node (exp
);
2989 return build_complex (TREE_TYPE (exp
),
2990 copy_constant (TREE_REALPART (exp
)),
2991 copy_constant (TREE_IMAGPART (exp
)));
2995 return build (TREE_CODE (exp
), TREE_TYPE (exp
),
2996 copy_constant (TREE_OPERAND (exp
, 0)),
2997 copy_constant (TREE_OPERAND (exp
, 1)));
3001 case NON_LVALUE_EXPR
:
3002 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
3003 copy_constant (TREE_OPERAND (exp
, 0)));
3007 tree copy
= copy_node (exp
);
3008 tree list
= copy_list (CONSTRUCTOR_ELTS (exp
));
3011 CONSTRUCTOR_ELTS (copy
) = list
;
3012 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
3013 TREE_VALUE (tail
) = copy_constant (TREE_VALUE (tail
));
3014 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
3015 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
3016 TREE_PURPOSE (tail
) = copy_constant (TREE_PURPOSE (tail
));
3026 /* Return an rtx representing a reference to constant data in memory
3027 for the constant expression EXP.
3029 If assembler code for such a constant has already been output,
3030 return an rtx to refer to it.
3031 Otherwise, output such a constant in memory (or defer it for later)
3032 and generate an rtx for it.
3034 The TREE_CST_RTL of EXP is set up to point to that rtx.
3035 The const_hash_table records which constants already have label strings. */
3038 output_constant_def (exp
)
3042 register struct constant_descriptor
*desc
;
3047 if (TREE_CST_RTL (exp
))
3048 return TREE_CST_RTL (exp
);
3050 /* Make sure any other constants whose addresses appear in EXP
3051 are assigned label numbers. */
3053 reloc
= output_addressed_constants (exp
);
3055 /* Compute hash code of EXP. Search the descriptors for that hash code
3056 to see if any of them describes EXP. If yes, the descriptor records
3057 the label number already assigned. */
3059 hash
= const_hash (exp
) % MAX_HASH_TABLE
;
3061 for (desc
= const_hash_table
[hash
]; desc
; desc
= desc
->next
)
3062 if (compare_constant (exp
, desc
))
3067 /* No constant equal to EXP is known to have been output.
3068 Make a constant descriptor to enter EXP in the hash table.
3069 Assign the label number and record it in the descriptor for
3070 future calls to this function to find. */
3072 /* Create a string containing the label name, in LABEL. */
3073 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
3075 desc
= record_constant (exp
);
3076 desc
->next
= const_hash_table
[hash
];
3077 desc
->label
= ggc_alloc_string (label
, -1);
3078 const_hash_table
[hash
] = desc
;
3080 /* We have a symbol name; construct the SYMBOL_REF and the MEM
3081 in the permanent obstack. We could also construct this in the
3082 obstack of EXP and put it into TREE_CST_RTL, but we have no way
3083 of knowing what obstack it is (e.g., it might be in a function
3084 obstack of a function we are nested inside). */
3086 push_obstacks_nochange ();
3087 end_temporary_allocation ();
3090 = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp
)),
3091 gen_rtx_SYMBOL_REF (Pmode
, desc
->label
));
3093 RTX_UNCHANGING_P (desc
->rtl
) = 1;
3094 if (AGGREGATE_TYPE_P (TREE_TYPE (exp
)))
3095 MEM_SET_IN_STRUCT_P (desc
->rtl
, 1);
3102 TREE_CST_RTL (exp
) = desc
->rtl
;
3104 /* Optionally set flags or add text to the name to record information
3105 such as that it is a function name. If the name is changed, the macro
3106 ASM_OUTPUT_LABELREF will have to know how to strip this information. */
3107 #ifdef ENCODE_SECTION_INFO
3108 ENCODE_SECTION_INFO (exp
);
3111 /* If this is the first time we've seen this particular constant,
3112 output it (or defer its output for later). */
3115 int after_function
= 0;
3117 #ifdef CONSTANT_AFTER_FUNCTION_P
3118 if (current_function_decl
!= 0
3119 && CONSTANT_AFTER_FUNCTION_P (exp
))
3123 if (defer_addressed_constants_flag
|| after_function
)
3125 struct deferred_constant
*p
;
3126 p
= (struct deferred_constant
*) xmalloc (sizeof (struct deferred_constant
));
3128 push_obstacks_nochange ();
3129 suspend_momentary ();
3130 p
->exp
= copy_constant (exp
);
3133 p
->labelno
= const_labelno
++;
3136 p
->next
= after_function_constants
;
3137 after_function_constants
= p
;
3141 p
->next
= deferred_constants
;
3142 deferred_constants
= p
;
3147 /* Do no output if -fsyntax-only. */
3148 if (! flag_syntax_only
)
3149 output_constant_def_contents (exp
, reloc
, const_labelno
);
3154 return TREE_CST_RTL (exp
);
3157 /* Now output assembler code to define the label for EXP,
3158 and follow it with the data of EXP. */
3161 output_constant_def_contents (exp
, reloc
, labelno
)
3168 if (IN_NAMED_SECTION (exp
))
3169 named_section (exp
, NULL
, reloc
);
3172 /* First switch to text section, except for writable strings. */
3173 #ifdef SELECT_SECTION
3174 SELECT_SECTION (exp
, reloc
);
3176 if (((TREE_CODE (exp
) == STRING_CST
) && flag_writable_strings
)
3177 || (flag_pic
&& reloc
))
3180 readonly_data_section ();
3184 /* Align the location counter as required by EXP's data type. */
3185 align
= TYPE_ALIGN (TREE_TYPE (exp
));
3186 #ifdef CONSTANT_ALIGNMENT
3187 align
= CONSTANT_ALIGNMENT (exp
, align
);
3190 if (align
> BITS_PER_UNIT
)
3191 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
3193 /* Output the label itself. */
3194 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LC", labelno
);
3196 /* Output the value of EXP. */
3197 output_constant (exp
,
3198 (TREE_CODE (exp
) == STRING_CST
3199 ? TREE_STRING_LENGTH (exp
)
3200 : int_size_in_bytes (TREE_TYPE (exp
))));
3204 /* Structure to represent sufficient information about a constant so that
3205 it can be output when the constant pool is output, so that function
3206 integration can be done, and to simplify handling on machines that reference
3207 constant pool as base+displacement. */
3209 struct pool_constant
3211 struct constant_descriptor
*desc
;
3212 struct pool_constant
*next
;
3213 enum machine_mode mode
;
3221 /* Structure used to maintain hash table mapping symbols used to their
3222 corresponding constants. */
3227 struct pool_constant
*pool
;
3228 struct pool_sym
*next
;
3231 /* Hash code for a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true.
3232 The argument is XSTR (... , 0) */
3234 #define SYMHASH(LABEL) \
3235 ((((unsigned long) (LABEL)) & ((1 << HASHBITS) - 1)) % MAX_RTX_HASH_TABLE)
3237 /* Initialize constant pool hashing for a new function. */
3240 init_varasm_status (f
)
3243 struct varasm_status
*p
;
3244 p
= (struct varasm_status
*) xmalloc (sizeof (struct varasm_status
));
3246 p
->x_const_rtx_hash_table
3247 = ((struct constant_descriptor
**)
3248 xmalloc (MAX_RTX_HASH_TABLE
* sizeof (struct constant_descriptor
*)));
3249 p
->x_const_rtx_sym_hash_table
3250 = ((struct pool_sym
**)
3251 xmalloc (MAX_RTX_HASH_TABLE
* sizeof (struct pool_sym
*)));
3252 bzero ((char *) p
->x_const_rtx_hash_table
,
3253 MAX_RTX_HASH_TABLE
* sizeof (struct constant_descriptor
*));
3254 bzero ((char *) p
->x_const_rtx_sym_hash_table
,
3255 MAX_RTX_HASH_TABLE
* sizeof (struct pool_sym
*));
3257 p
->x_first_pool
= p
->x_last_pool
= 0;
3258 p
->x_pool_offset
= 0;
3259 p
->x_const_double_chain
= 0;
3262 /* Mark PC for GC. */
3265 mark_pool_constant (pc
)
3266 struct pool_constant
*pc
;
3270 ggc_mark_rtx (pc
->constant
);
3275 /* Mark PPS for GC. */
3278 mark_pool_sym_hash_table (pps
)
3279 struct pool_sym
**pps
;
3281 struct pool_sym
*ps
;
3284 for (i
= 0; i
< MAX_RTX_HASH_TABLE
; ++i
)
3285 for (ps
= pps
[i
]; ps
; ps
= ps
->next
)
3286 ggc_mark_string (ps
->label
);
3289 /* Mark P for GC. */
3292 mark_varasm_status (p
)
3293 struct varasm_status
*p
;
3298 mark_pool_constant (p
->x_first_pool
);
3299 mark_pool_sym_hash_table (p
->x_const_rtx_sym_hash_table
);
3300 ggc_mark_rtx (p
->x_const_double_chain
);
3303 /* Clear out all parts of the state in F that can safely be discarded
3304 after the function has been compiled, to let garbage collection
3305 reclaim the memory. */
3308 free_varasm_status (f
)
3311 struct varasm_status
*p
;
3314 free (p
->x_const_rtx_hash_table
);
3315 free (p
->x_const_rtx_sym_hash_table
);
3320 enum kind
{ RTX_DOUBLE
, RTX_INT
};
3324 #ifdef ONLY_INT_FIELDS
3325 unsigned int kind
: 16;
3326 unsigned int mode
: 16;
3328 enum kind kind
: 16;
3329 enum machine_mode mode
: 16;
3332 union real_extract du
;
3333 struct addr_const addr
;
3334 struct {HOST_WIDE_INT high
, low
;} di
;
3338 /* Express an rtx for a constant integer (perhaps symbolic)
3339 as the sum of a symbol or label plus an explicit integer.
3340 They are stored into VALUE. */
3343 decode_rtx_const (mode
, x
, value
)
3344 enum machine_mode mode
;
3346 struct rtx_const
*value
;
3348 /* Clear the whole structure, including any gaps. */
3351 int *p
= (int *) value
;
3352 int *end
= (int *) (value
+ 1);
3357 value
->kind
= RTX_INT
; /* Most usual kind. */
3360 switch (GET_CODE (x
))
3363 value
->kind
= RTX_DOUBLE
;
3364 if (GET_MODE (x
) != VOIDmode
)
3366 value
->mode
= GET_MODE (x
);
3367 bcopy ((char *) &CONST_DOUBLE_LOW (x
),
3368 (char *) &value
->un
.du
, sizeof value
->un
.du
);
3372 value
->un
.di
.low
= CONST_DOUBLE_LOW (x
);
3373 value
->un
.di
.high
= CONST_DOUBLE_HIGH (x
);
3378 value
->un
.addr
.offset
= INTVAL (x
);
3384 value
->un
.addr
.base
= x
;
3389 if (GET_CODE (x
) == PLUS
)
3391 value
->un
.addr
.base
= XEXP (x
, 0);
3392 if (GET_CODE (XEXP (x
, 1)) != CONST_INT
)
3394 value
->un
.addr
.offset
= INTVAL (XEXP (x
, 1));
3396 else if (GET_CODE (x
) == MINUS
)
3398 value
->un
.addr
.base
= XEXP (x
, 0);
3399 if (GET_CODE (XEXP (x
, 1)) != CONST_INT
)
3401 value
->un
.addr
.offset
= - INTVAL (XEXP (x
, 1));
3411 if (value
->kind
== RTX_INT
&& value
->un
.addr
.base
!= 0)
3412 switch (GET_CODE (value
->un
.addr
.base
))
3415 /* Use the string's address, not the SYMBOL_REF's address,
3416 for the sake of addresses of library routines. */
3417 value
->un
.addr
.base
= (rtx
) XSTR (value
->un
.addr
.base
, 0);
3421 /* For a LABEL_REF, compare labels. */
3422 value
->un
.addr
.base
= XEXP (value
->un
.addr
.base
, 0);
3429 /* Given a MINUS expression, simplify it if both sides
3430 include the same symbol. */
3433 simplify_subtraction (x
)
3436 struct rtx_const val0
, val1
;
3438 decode_rtx_const (GET_MODE (x
), XEXP (x
, 0), &val0
);
3439 decode_rtx_const (GET_MODE (x
), XEXP (x
, 1), &val1
);
3441 if (val0
.un
.addr
.base
== val1
.un
.addr
.base
)
3442 return GEN_INT (val0
.un
.addr
.offset
- val1
.un
.addr
.offset
);
3446 /* Compute a hash code for a constant RTL expression. */
3449 const_hash_rtx (mode
, x
)
3450 enum machine_mode mode
;
3456 struct rtx_const value
;
3457 decode_rtx_const (mode
, x
, &value
);
3459 /* Compute hashing function */
3461 for (i
= 0; i
< sizeof value
/ sizeof (int); i
++)
3462 hi
+= ((int *) &value
)[i
];
3464 hi
&= (1 << HASHBITS
) - 1;
3465 hi
%= MAX_RTX_HASH_TABLE
;
3469 /* Compare a constant rtl object X with a constant-descriptor DESC.
3470 Return 1 if DESC describes a constant with the same value as X. */
3473 compare_constant_rtx (mode
, x
, desc
)
3474 enum machine_mode mode
;
3476 struct constant_descriptor
*desc
;
3478 register int *p
= (int *) desc
->contents
;
3481 struct rtx_const value
;
3483 decode_rtx_const (mode
, x
, &value
);
3484 strp
= (int *) &value
;
3485 len
= sizeof value
/ sizeof (int);
3487 /* Compare constant contents. */
3489 if (*p
++ != *strp
++)
3495 /* Construct a constant descriptor for the rtl-expression X.
3496 It is up to the caller to enter the descriptor in the hash table. */
3498 static struct constant_descriptor
*
3499 record_constant_rtx (mode
, x
)
3500 enum machine_mode mode
;
3503 struct constant_descriptor
*ptr
;
3506 struct rtx_const value
;
3508 decode_rtx_const (mode
, x
, &value
);
3510 /* Put these things in the saveable obstack so we can ensure it won't
3511 be freed if we are called from combine or some other phase that discards
3512 memory allocated from function_obstack (current_obstack). */
3513 obstack_grow (saveable_obstack
, &ptr
, sizeof ptr
);
3514 obstack_grow (saveable_obstack
, &label
, sizeof label
);
3515 obstack_grow (saveable_obstack
, &rtl
, sizeof rtl
);
3517 /* Record constant contents. */
3518 obstack_grow (saveable_obstack
, &value
, sizeof value
);
3520 return (struct constant_descriptor
*) obstack_finish (saveable_obstack
);
3523 /* Given a constant rtx X, make (or find) a memory constant for its value
3524 and return a MEM rtx to refer to it in memory. */
3527 force_const_mem (mode
, x
)
3528 enum machine_mode mode
;
3532 register struct constant_descriptor
*desc
;
3537 /* If we want this CONST_DOUBLE in the same mode as it is in memory
3538 (this will always be true for floating CONST_DOUBLEs that have been
3539 placed in memory, but not for VOIDmode (integer) CONST_DOUBLEs),
3540 use the previous copy. Otherwise, make a new one. Note that in
3541 the unlikely event that this same CONST_DOUBLE is used in two different
3542 modes in an alternating fashion, we will allocate a lot of different
3543 memory locations, but this should be extremely rare. */
3545 if (GET_CODE (x
) == CONST_DOUBLE
3546 && GET_CODE (CONST_DOUBLE_MEM (x
)) == MEM
3547 && GET_MODE (CONST_DOUBLE_MEM (x
)) == mode
)
3548 return CONST_DOUBLE_MEM (x
);
3550 /* Compute hash code of X. Search the descriptors for that hash code
3551 to see if any of them describes X. If yes, the descriptor records
3552 the label number already assigned. */
3554 hash
= const_hash_rtx (mode
, x
);
3556 for (desc
= const_rtx_hash_table
[hash
]; desc
; desc
= desc
->next
)
3557 if (compare_constant_rtx (mode
, x
, desc
))
3559 found
= desc
->label
;
3565 register struct pool_constant
*pool
;
3566 register struct pool_sym
*sym
;
3569 /* No constant equal to X is known to have been output.
3570 Make a constant descriptor to enter X in the hash table.
3571 Assign the label number and record it in the descriptor for
3572 future calls to this function to find. */
3574 desc
= record_constant_rtx (mode
, x
);
3575 desc
->next
= const_rtx_hash_table
[hash
];
3576 const_rtx_hash_table
[hash
] = desc
;
3578 /* Align the location counter as required by EXP's data type. */
3579 align
= (mode
== VOIDmode
) ? UNITS_PER_WORD
: GET_MODE_SIZE (mode
);
3580 if (align
> BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
3581 align
= BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
;
3582 #ifdef CONSTANT_ALIGNMENT
3583 align
= CONSTANT_ALIGNMENT (make_tree (type_for_mode (mode
, 0), x
),
3584 align
* BITS_PER_UNIT
) / BITS_PER_UNIT
;
3587 pool_offset
+= align
- 1;
3588 pool_offset
&= ~ (align
- 1);
3590 /* If RTL is not being placed into the saveable obstack, make a
3591 copy of X that is in the saveable obstack in case we are
3592 being called from combine or some other phase that discards
3593 memory it allocates. We used to only do this if it is a
3594 CONST; however, reload can allocate a CONST_INT when
3595 eliminating registers. */
3596 if (rtl_obstack
!= saveable_obstack
3597 && (GET_CODE (x
) == CONST
|| GET_CODE (x
) == CONST_INT
))
3599 push_obstacks_nochange ();
3600 rtl_in_saveable_obstack ();
3602 if (GET_CODE (x
) == CONST
)
3603 x
= gen_rtx_CONST (GET_MODE (x
),
3604 gen_rtx_PLUS (GET_MODE (x
),
3605 XEXP (XEXP (x
, 0), 0),
3606 XEXP (XEXP (x
, 0), 1)));
3608 x
= GEN_INT (INTVAL (x
));
3613 /* Allocate a pool constant descriptor, fill it in, and chain it in. */
3615 pool
= (struct pool_constant
*) savealloc (sizeof (struct pool_constant
));
3619 pool
->labelno
= const_labelno
;
3620 pool
->align
= align
;
3621 pool
->offset
= pool_offset
;
3628 last_pool
->next
= pool
;
3631 pool_offset
+= GET_MODE_SIZE (mode
);
3633 /* Create a string containing the label name, in LABEL. */
3634 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
3638 desc
->label
= found
= ggc_alloc_string (label
, -1);
3640 /* Add label to symbol hash table. */
3641 hash
= SYMHASH (found
);
3642 sym
= (struct pool_sym
*) savealloc (sizeof (struct pool_sym
));
3645 sym
->next
= const_rtx_sym_hash_table
[hash
];
3646 const_rtx_sym_hash_table
[hash
] = sym
;
3649 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
3651 def
= gen_rtx_MEM (mode
, gen_rtx_SYMBOL_REF (Pmode
, found
));
3653 RTX_UNCHANGING_P (def
) = 1;
3654 /* Mark the symbol_ref as belonging to this constants pool. */
3655 CONSTANT_POOL_ADDRESS_P (XEXP (def
, 0)) = 1;
3656 current_function_uses_const_pool
= 1;
3658 if (GET_CODE (x
) == CONST_DOUBLE
)
3660 if (CONST_DOUBLE_MEM (x
) == cc0_rtx
)
3662 CONST_DOUBLE_CHAIN (x
) = const_double_chain
;
3663 const_double_chain
= x
;
3665 CONST_DOUBLE_MEM (x
) = def
;
3671 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
3672 the corresponding pool_constant structure. */
3674 static struct pool_constant
*
3675 find_pool_constant (f
, addr
)
3679 struct pool_sym
*sym
;
3680 char *label
= XSTR (addr
, 0);
3682 for (sym
= f
->varasm
->x_const_rtx_sym_hash_table
[SYMHASH (label
)]; sym
; sym
= sym
->next
)
3683 if (sym
->label
== label
)
3689 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
3692 get_pool_constant (addr
)
3695 return (find_pool_constant (cfun
, addr
))->constant
;
3698 /* Likewise, but for the constant pool of a specific function. */
3701 get_pool_constant_for_function (f
, addr
)
3705 return (find_pool_constant (f
, addr
))->constant
;
3708 /* Similar, return the mode. */
3711 get_pool_mode (addr
)
3714 return (find_pool_constant (cfun
, addr
))->mode
;
3718 get_pool_mode_for_function (f
, addr
)
3722 return (find_pool_constant (f
, addr
))->mode
;
3725 /* Similar, return the offset in the constant pool. */
3728 get_pool_offset (addr
)
3731 return (find_pool_constant (cfun
, addr
))->offset
;
3734 /* Return the size of the constant pool. */
3742 /* Write all the constants in the constant pool. */
3745 output_constant_pool (fnname
, fndecl
)
3746 const char *fnname ATTRIBUTE_UNUSED
;
3747 tree fndecl ATTRIBUTE_UNUSED
;
3749 struct pool_constant
*pool
;
3751 union real_extract u
;
3753 /* It is possible for gcc to call force_const_mem and then to later
3754 discard the instructions which refer to the constant. In such a
3755 case we do not need to output the constant. */
3756 mark_constant_pool ();
3758 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3759 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3762 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3769 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3770 whose CODE_LABEL has been deleted. This can occur if a jump table
3771 is eliminated by optimization. If so, write a constant of zero
3772 instead. Note that this can also happen by turning the
3773 CODE_LABEL into a NOTE. */
3774 if (((GET_CODE (x
) == LABEL_REF
3775 && (INSN_DELETED_P (XEXP (x
, 0))
3776 || GET_CODE (XEXP (x
, 0)) == NOTE
)))
3777 || (GET_CODE (x
) == CONST
&& GET_CODE (XEXP (x
, 0)) == PLUS
3778 && GET_CODE (XEXP (XEXP (x
, 0), 0)) == LABEL_REF
3779 && (INSN_DELETED_P (XEXP (XEXP (XEXP (x
, 0), 0), 0))
3780 || GET_CODE (XEXP (XEXP (XEXP (x
, 0), 0), 0)) == NOTE
)))
3783 /* First switch to correct section. */
3784 #ifdef SELECT_RTX_SECTION
3785 SELECT_RTX_SECTION (pool
->mode
, x
);
3787 readonly_data_section ();
3790 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3791 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file
, x
, pool
->mode
,
3792 pool
->align
, pool
->labelno
, done
);
3795 if (pool
->align
> 1)
3796 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (pool
->align
));
3798 /* Output the label. */
3799 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LC", pool
->labelno
);
3801 /* Output the value of the constant itself. */
3802 switch (GET_MODE_CLASS (pool
->mode
))
3805 if (GET_CODE (x
) != CONST_DOUBLE
)
3808 bcopy ((char *) &CONST_DOUBLE_LOW (x
), (char *) &u
, sizeof u
);
3809 assemble_real (u
.d
, pool
->mode
);
3813 case MODE_PARTIAL_INT
:
3814 assemble_integer (x
, GET_MODE_SIZE (pool
->mode
), 1);
3821 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3827 #ifdef ASM_OUTPUT_POOL_EPILOGUE
3828 ASM_OUTPUT_POOL_EPILOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3831 /* Done with this pool. */
3832 first_pool
= last_pool
= 0;
3835 /* Look through the instructions for this function, and mark all the
3836 entries in the constant pool which are actually being used. */
3839 mark_constant_pool ()
3842 struct pool_constant
*pool
;
3844 if (first_pool
== 0)
3847 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3850 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
3851 if (GET_RTX_CLASS (GET_CODE (insn
)) == 'i')
3852 mark_constants (PATTERN (insn
));
3854 for (insn
= current_function_epilogue_delay_list
;
3856 insn
= XEXP (insn
, 1))
3857 if (GET_RTX_CLASS (GET_CODE (insn
)) == 'i')
3858 mark_constants (PATTERN (insn
));
3860 /* It's possible that the only reference to a symbol is in a symbol
3861 that's in the constant pool. This happens in Fortran under some
3862 situations. (When the constant contains the address of another
3863 constant, and only the first is used directly in an insn.)
3864 This is potentially suboptimal if there's ever a possibility of
3865 backwards (in pool order) 2'd level references. However, it's
3866 not clear that 2'd level references can happen. */
3867 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3869 struct pool_sym
*sym
;
3872 /* skip unmarked entries; no insn refers to them. */
3876 /* Skip everything except SYMBOL_REFs. */
3877 if (GET_CODE (pool
->constant
) != SYMBOL_REF
)
3879 label
= XSTR (pool
->constant
, 0);
3881 /* Be sure the symbol's value is marked. */
3882 for (sym
= const_rtx_sym_hash_table
[SYMHASH (label
)]; sym
;
3884 if (sym
->label
== label
)
3885 sym
->pool
->mark
= 1;
3886 /* If we didn't find it, there's something truly wrong here, but it
3887 will be announced by the assembler. */
3896 register const char *format_ptr
;
3901 if (GET_CODE (x
) == SYMBOL_REF
)
3903 if (CONSTANT_POOL_ADDRESS_P (x
))
3904 find_pool_constant (cfun
, x
)->mark
= 1;
3907 /* Never search inside a CONST_DOUBLE, because CONST_DOUBLE_MEM may be
3908 a MEM, but does not constitute a use of that MEM. */
3909 else if (GET_CODE (x
) == CONST_DOUBLE
)
3912 /* Insns may appear inside a SEQUENCE. Only check the patterns of
3913 insns, not any notes that may be attached. We don't want to mark
3914 a constant just because it happens to appear in a REG_EQUIV note. */
3915 if (GET_RTX_CLASS (GET_CODE (x
)) == 'i')
3917 mark_constants (PATTERN (x
));
3921 format_ptr
= GET_RTX_FORMAT (GET_CODE (x
));
3923 for (i
= 0; i
< GET_RTX_LENGTH (GET_CODE (x
)); i
++)
3925 switch (*format_ptr
++)
3928 mark_constants (XEXP (x
, i
));
3932 if (XVEC (x
, i
) != 0)
3936 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
3937 mark_constants (XVECEXP (x
, i
, j
));
3956 /* Find all the constants whose addresses are referenced inside of EXP,
3957 and make sure assembler code with a label has been output for each one.
3958 Indicate whether an ADDR_EXPR has been encountered. */
3961 output_addressed_constants (exp
)
3966 switch (TREE_CODE (exp
))
3970 register tree constant
= TREE_OPERAND (exp
, 0);
3972 while (TREE_CODE (constant
) == COMPONENT_REF
)
3974 constant
= TREE_OPERAND (constant
, 0);
3977 if (TREE_CODE_CLASS (TREE_CODE (constant
)) == 'c'
3978 || TREE_CODE (constant
) == CONSTRUCTOR
)
3979 /* No need to do anything here
3980 for addresses of variables or functions. */
3981 output_constant_def (constant
);
3988 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
3989 reloc
|= output_addressed_constants (TREE_OPERAND (exp
, 1));
3994 case NON_LVALUE_EXPR
:
3995 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
4001 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
4002 if (TREE_VALUE (link
) != 0)
4003 reloc
|= output_addressed_constants (TREE_VALUE (link
));
4013 /* Return nonzero if VALUE is a valid constant-valued expression
4014 for use in initializing a static variable; one that can be an
4015 element of a "constant" initializer.
4017 Return null_pointer_node if the value is absolute;
4018 if it is relocatable, return the variable that determines the relocation.
4019 We assume that VALUE has been folded as much as possible;
4020 therefore, we do not need to check for such things as
4021 arithmetic-combinations of integers. */
4024 initializer_constant_valid_p (value
, endtype
)
4028 switch (TREE_CODE (value
))
4031 if ((TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
4032 || TREE_CODE (TREE_TYPE (value
)) == RECORD_TYPE
)
4033 && TREE_CONSTANT (value
)
4034 && CONSTRUCTOR_ELTS (value
))
4036 initializer_constant_valid_p (TREE_VALUE (CONSTRUCTOR_ELTS (value
)),
4039 return TREE_STATIC (value
) ? null_pointer_node
: 0;
4045 return null_pointer_node
;
4048 return TREE_OPERAND (value
, 0);
4050 case NON_LVALUE_EXPR
:
4051 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
4055 /* Allow conversions between pointer types. */
4056 if (POINTER_TYPE_P (TREE_TYPE (value
))
4057 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
4058 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
4060 /* Allow conversions between real types. */
4061 if (FLOAT_TYPE_P (TREE_TYPE (value
))
4062 && FLOAT_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
4063 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
4065 /* Allow length-preserving conversions between integer types. */
4066 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
4067 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
4068 && (TYPE_PRECISION (TREE_TYPE (value
))
4069 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
4070 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
4072 /* Allow conversions between other integer types only if
4074 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
4075 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
4077 tree inner
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4079 if (inner
== null_pointer_node
)
4080 return null_pointer_node
;
4084 /* Allow (int) &foo provided int is as wide as a pointer. */
4085 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
4086 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
4087 && (TYPE_PRECISION (TREE_TYPE (value
))
4088 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
4089 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4092 /* Likewise conversions from int to pointers, but also allow
4093 conversions from 0. */
4094 if (POINTER_TYPE_P (TREE_TYPE (value
))
4095 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
4097 if (integer_zerop (TREE_OPERAND (value
, 0)))
4098 return null_pointer_node
;
4099 else if (TYPE_PRECISION (TREE_TYPE (value
))
4100 <= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0))))
4101 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4105 /* Allow conversions to union types if the value inside is okay. */
4106 if (TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
)
4107 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4112 if (! INTEGRAL_TYPE_P (endtype
)
4113 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
4115 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4117 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
4119 /* If either term is absolute, use the other terms relocation. */
4120 if (valid0
== null_pointer_node
)
4122 if (valid1
== null_pointer_node
)
4128 if (! INTEGRAL_TYPE_P (endtype
)
4129 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
4131 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4133 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
4135 /* Win if second argument is absolute. */
4136 if (valid1
== null_pointer_node
)
4138 /* Win if both arguments have the same relocation.
4139 Then the value is absolute. */
4140 if (valid0
== valid1
&& valid0
!= 0)
4141 return null_pointer_node
;
4144 /* Support differences between labels. */
4145 if (INTEGRAL_TYPE_P (endtype
))
4148 op0
= TREE_OPERAND (value
, 0);
4149 op1
= TREE_OPERAND (value
, 1);
4153 if (TREE_CODE (op0
) == ADDR_EXPR
4154 && TREE_CODE (TREE_OPERAND (op0
, 0)) == LABEL_DECL
4155 && TREE_CODE (op1
) == ADDR_EXPR
4156 && TREE_CODE (TREE_OPERAND (op1
, 0)) == LABEL_DECL
)
4157 return null_pointer_node
;
4168 /* Output assembler code for constant EXP to FILE, with no label.
4169 This includes the pseudo-op such as ".int" or ".byte", and a newline.
4170 Assumes output_addressed_constants has been done on EXP already.
4172 Generate exactly SIZE bytes of assembler data, padding at the end
4173 with zeros if necessary. SIZE must always be specified.
4175 SIZE is important for structure constructors,
4176 since trailing members may have been omitted from the constructor.
4177 It is also important for initialization of arrays from string constants
4178 since the full length of the string constant might not be wanted.
4179 It is also needed for initialization of unions, where the initializer's
4180 type is just one member, and that may not be as long as the union.
4182 There a case in which we would fail to output exactly SIZE bytes:
4183 for a structure constructor that wants to produce more than SIZE bytes.
4184 But such constructors will never be generated for any possible input. */
4187 output_constant (exp
, size
)
4191 register enum tree_code code
= TREE_CODE (TREE_TYPE (exp
));
4193 /* Some front-ends use constants other than the standard
4194 language-indepdent varieties, but which may still be output
4195 directly. Give the front-end a chance to convert EXP to a
4196 language-independent representation. */
4197 if (lang_expand_constant
)
4198 exp
= (*lang_expand_constant
) (exp
);
4200 if (size
== 0 || flag_syntax_only
)
4203 /* Eliminate the NON_LVALUE_EXPR_EXPR that makes a cast not be an lvalue.
4204 That way we get the constant (we hope) inside it. Also, strip off any
4205 NOP_EXPR that converts between two record, union, array, or set types. */
4206 while ((TREE_CODE (exp
) == NOP_EXPR
4207 && (TREE_TYPE (exp
) == TREE_TYPE (TREE_OPERAND (exp
, 0))
4208 || AGGREGATE_TYPE_P (TREE_TYPE (exp
))))
4209 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
4210 exp
= TREE_OPERAND (exp
, 0);
4212 /* Allow a constructor with no elements for any data type.
4213 This means to fill the space with zeros. */
4214 if (TREE_CODE (exp
) == CONSTRUCTOR
&& CONSTRUCTOR_ELTS (exp
) == 0)
4216 assemble_zeros (size
);
4227 case REFERENCE_TYPE
:
4228 /* ??? What about (int)((float)(int)&foo + 4) */
4229 while (TREE_CODE (exp
) == NOP_EXPR
|| TREE_CODE (exp
) == CONVERT_EXPR
4230 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
4231 exp
= TREE_OPERAND (exp
, 0);
4233 if (! assemble_integer (expand_expr (exp
, NULL_RTX
, VOIDmode
,
4234 EXPAND_INITIALIZER
),
4236 error ("initializer for integer value is too complicated");
4241 if (TREE_CODE (exp
) != REAL_CST
)
4242 error ("initializer for floating value is not a floating constant");
4244 assemble_real (TREE_REAL_CST (exp
),
4245 mode_for_size (size
* BITS_PER_UNIT
, MODE_FLOAT
, 0));
4250 output_constant (TREE_REALPART (exp
), size
/ 2);
4251 output_constant (TREE_IMAGPART (exp
), size
/ 2);
4252 size
-= (size
/ 2) * 2;
4256 if (TREE_CODE (exp
) == CONSTRUCTOR
)
4258 output_constructor (exp
, size
);
4261 else if (TREE_CODE (exp
) == STRING_CST
)
4265 if (size
> TREE_STRING_LENGTH (exp
))
4267 excess
= size
- TREE_STRING_LENGTH (exp
);
4268 size
= TREE_STRING_LENGTH (exp
);
4271 assemble_string (TREE_STRING_POINTER (exp
), size
);
4280 if (TREE_CODE (exp
) == CONSTRUCTOR
)
4281 output_constructor (exp
, size
);
4287 if (TREE_CODE (exp
) == INTEGER_CST
)
4288 assemble_integer (expand_expr (exp
, NULL_RTX
,
4289 VOIDmode
, EXPAND_INITIALIZER
),
4291 else if (TREE_CODE (exp
) == CONSTRUCTOR
)
4293 unsigned char *buffer
= (unsigned char *) alloca (size
);
4294 if (get_set_constructor_bytes (exp
, buffer
, size
))
4296 assemble_string ((char *) buffer
, size
);
4299 error ("unknown set constructor type");
4307 assemble_zeros (size
);
4311 /* Subroutine of output_constant, used for CONSTRUCTORs
4312 (aggregate constants).
4313 Generate at least SIZE bytes, padding if necessary. */
4316 output_constructor (exp
, size
)
4320 register tree link
, field
= 0;
4321 HOST_WIDE_INT min_index
= 0;
4322 /* Number of bytes output or skipped so far.
4323 In other words, current position within the constructor. */
4324 int total_bytes
= 0;
4325 /* Non-zero means BYTE contains part of a byte, to be output. */
4326 int byte_buffer_in_use
= 0;
4327 register int byte
= 0;
4329 if (HOST_BITS_PER_WIDE_INT
< BITS_PER_UNIT
)
4332 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
4333 field
= TYPE_FIELDS (TREE_TYPE (exp
));
4335 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
4336 && TYPE_DOMAIN (TREE_TYPE (exp
)) != 0)
4338 = TREE_INT_CST_LOW (TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (exp
))));
4340 /* As LINK goes through the elements of the constant,
4341 FIELD goes through the structure fields, if the constant is a structure.
4342 if the constant is a union, then we override this,
4343 by getting the field from the TREE_LIST element.
4344 But the constant could also be an array. Then FIELD is zero.
4346 There is always a maximum of one element in the chain LINK for unions
4347 (even if the initializer in a source program incorrectly contains
4349 for (link
= CONSTRUCTOR_ELTS (exp
);
4351 link
= TREE_CHAIN (link
),
4352 field
= field
? TREE_CHAIN (field
) : 0)
4354 tree val
= TREE_VALUE (link
);
4357 /* the element in a union constructor specifies the proper field. */
4359 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
4360 || TREE_CODE (TREE_TYPE (exp
)) == UNION_TYPE
)
4362 /* if available, use the type given by link */
4363 if (TREE_PURPOSE (link
) != 0)
4364 field
= TREE_PURPOSE (link
);
4367 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
4368 index
= TREE_PURPOSE (link
);
4370 /* Eliminate the marker that makes a cast not be an lvalue. */
4374 if (index
&& TREE_CODE (index
) == RANGE_EXPR
)
4376 register int fieldsize
4377 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (exp
)));
4378 HOST_WIDE_INT lo_index
= TREE_INT_CST_LOW (TREE_OPERAND (index
, 0));
4379 HOST_WIDE_INT hi_index
= TREE_INT_CST_LOW (TREE_OPERAND (index
, 1));
4380 HOST_WIDE_INT index
;
4381 for (index
= lo_index
; index
<= hi_index
; index
++)
4383 /* Output the element's initial value. */
4385 assemble_zeros (fieldsize
);
4387 output_constant (val
, fieldsize
);
4389 /* Count its size. */
4390 total_bytes
+= fieldsize
;
4393 else if (field
== 0 || !DECL_BIT_FIELD (field
))
4395 /* An element that is not a bit-field. */
4397 register int fieldsize
;
4398 /* Since this structure is static,
4399 we know the positions are constant. */
4400 int bitpos
= (field
? (TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field
))
4404 bitpos
= (TREE_INT_CST_LOW (TYPE_SIZE (TREE_TYPE (val
)))
4406 * (TREE_INT_CST_LOW (index
) - min_index
));
4408 /* Output any buffered-up bit-fields preceding this element. */
4409 if (byte_buffer_in_use
)
4411 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4413 byte_buffer_in_use
= 0;
4416 /* Advance to offset of this element.
4417 Note no alignment needed in an array, since that is guaranteed
4418 if each element has the proper size. */
4419 if ((field
!= 0 || index
!= 0) && bitpos
!= total_bytes
)
4421 assemble_zeros (bitpos
- total_bytes
);
4422 total_bytes
= bitpos
;
4425 /* Determine size this element should occupy. */
4428 if (TREE_CODE (DECL_SIZE_UNIT (field
)) != INTEGER_CST
)
4431 fieldsize
= TREE_INT_CST_LOW (DECL_SIZE_UNIT (field
));
4434 fieldsize
= int_size_in_bytes (TREE_TYPE (TREE_TYPE (exp
)));
4436 /* Output the element's initial value. */
4438 assemble_zeros (fieldsize
);
4440 output_constant (val
, fieldsize
);
4442 /* Count its size. */
4443 total_bytes
+= fieldsize
;
4445 else if (val
!= 0 && TREE_CODE (val
) != INTEGER_CST
)
4446 error ("invalid initial value for member `%s'",
4447 IDENTIFIER_POINTER (DECL_NAME (field
)));
4450 /* Element that is a bit-field. */
4452 int next_offset
= TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field
));
4454 = (next_offset
+ TREE_INT_CST_LOW (DECL_SIZE (field
)));
4457 val
= integer_zero_node
;
4459 /* If this field does not start in this (or, next) byte,
4461 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4463 /* Output remnant of any bit field in previous bytes. */
4464 if (byte_buffer_in_use
)
4466 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4468 byte_buffer_in_use
= 0;
4471 /* If still not at proper byte, advance to there. */
4472 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4474 assemble_zeros (next_offset
/ BITS_PER_UNIT
- total_bytes
);
4475 total_bytes
= next_offset
/ BITS_PER_UNIT
;
4479 if (! byte_buffer_in_use
)
4482 /* We must split the element into pieces that fall within
4483 separate bytes, and combine each byte with previous or
4484 following bit-fields. */
4486 /* next_offset is the offset n fbits from the beginning of
4487 the structure to the next bit of this element to be processed.
4488 end_offset is the offset of the first bit past the end of
4490 while (next_offset
< end_offset
)
4494 HOST_WIDE_INT value
;
4495 int next_byte
= next_offset
/ BITS_PER_UNIT
;
4496 int next_bit
= next_offset
% BITS_PER_UNIT
;
4498 /* Advance from byte to byte
4499 within this element when necessary. */
4500 while (next_byte
!= total_bytes
)
4502 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4507 /* Number of bits we can process at once
4508 (all part of the same byte). */
4509 this_time
= MIN (end_offset
- next_offset
,
4510 BITS_PER_UNIT
- next_bit
);
4511 if (BYTES_BIG_ENDIAN
)
4513 /* On big-endian machine, take the most significant bits
4514 first (of the bits that are significant)
4515 and put them into bytes from the most significant end. */
4516 shift
= end_offset
- next_offset
- this_time
;
4517 /* Don't try to take a bunch of bits that cross
4518 the word boundary in the INTEGER_CST. We can
4519 only select bits from the LOW or HIGH part
4521 if (shift
< HOST_BITS_PER_WIDE_INT
4522 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4524 this_time
= shift
+ this_time
- HOST_BITS_PER_WIDE_INT
;
4525 shift
= HOST_BITS_PER_WIDE_INT
;
4528 /* Now get the bits from the appropriate constant word. */
4529 if (shift
< HOST_BITS_PER_WIDE_INT
)
4531 value
= TREE_INT_CST_LOW (val
);
4533 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4535 value
= TREE_INT_CST_HIGH (val
);
4536 shift
-= HOST_BITS_PER_WIDE_INT
;
4540 /* Get the result. This works only when:
4541 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4542 byte
|= (((value
>> shift
)
4543 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4544 << (BITS_PER_UNIT
- this_time
- next_bit
));
4548 /* On little-endian machines,
4549 take first the least significant bits of the value
4550 and pack them starting at the least significant
4551 bits of the bytes. */
4552 shift
= (next_offset
4553 - TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field
)));
4554 /* Don't try to take a bunch of bits that cross
4555 the word boundary in the INTEGER_CST. We can
4556 only select bits from the LOW or HIGH part
4558 if (shift
< HOST_BITS_PER_WIDE_INT
4559 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4561 this_time
= (HOST_BITS_PER_WIDE_INT
- shift
);
4564 /* Now get the bits from the appropriate constant word. */
4565 if (shift
< HOST_BITS_PER_WIDE_INT
)
4566 value
= TREE_INT_CST_LOW (val
);
4567 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4569 value
= TREE_INT_CST_HIGH (val
);
4570 shift
-= HOST_BITS_PER_WIDE_INT
;
4574 /* Get the result. This works only when:
4575 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4576 byte
|= (((value
>> shift
)
4577 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4580 next_offset
+= this_time
;
4581 byte_buffer_in_use
= 1;
4585 if (byte_buffer_in_use
)
4587 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4590 if (total_bytes
< size
)
4591 assemble_zeros (size
- total_bytes
);
4594 #ifdef HANDLE_PRAGMA_WEAK
4595 /* Add function NAME to the weak symbols list. VALUE is a weak alias
4596 associatd with NAME. */
4599 add_weak (name
, value
)
4603 struct weak_syms
*weak
;
4605 weak
= (struct weak_syms
*) permalloc (sizeof (struct weak_syms
));
4610 weak
->next
= weak_decls
;
4612 weak
->value
= value
;
4617 #endif /* HANDLE_PRAGMA_WEAK */
4619 /* Declare DECL to be a weak symbol. */
4625 if (! TREE_PUBLIC (decl
))
4626 error_with_decl (decl
, "weak declaration of `%s' must be public");
4627 else if (TREE_ASM_WRITTEN (decl
))
4628 error_with_decl (decl
, "weak declaration of `%s' must precede definition");
4629 else if (SUPPORTS_WEAK
)
4630 DECL_WEAK (decl
) = 1;
4631 #ifdef HANDLE_PRAGMA_WEAK
4632 add_weak (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)), NULL
);
4636 /* Emit any pending weak declarations. */
4638 #ifdef HANDLE_PRAGMA_WEAK
4639 struct weak_syms
* weak_decls
;
4645 #ifdef HANDLE_PRAGMA_WEAK
4646 if (HANDLE_PRAGMA_WEAK
)
4648 struct weak_syms
*t
;
4649 for (t
= weak_decls
; t
; t
= t
->next
)
4653 ASM_WEAKEN_LABEL (asm_out_file
, t
->name
);
4655 ASM_OUTPUT_DEF (asm_out_file
, t
->name
, t
->value
);
4662 /* Remove NAME from the pending list of weak symbols. This prevents
4663 the compiler from emitting multiple .weak directives which confuses
4665 #ifdef ASM_WEAKEN_LABEL
4667 remove_from_pending_weak_list (name
)
4668 char *name ATTRIBUTE_UNUSED
;
4670 #ifdef HANDLE_PRAGMA_WEAK
4671 if (HANDLE_PRAGMA_WEAK
)
4673 struct weak_syms
*t
;
4674 for (t
= weak_decls
; t
; t
= t
->next
)
4676 if (t
->name
&& strcmp (name
, t
->name
) == 0)
4685 assemble_alias (decl
, target
)
4686 tree decl
, target ATTRIBUTE_UNUSED
;
4690 make_decl_rtl (decl
, (char *) 0, 1);
4691 name
= XSTR (XEXP (DECL_RTL (decl
), 0), 0);
4693 #ifdef ASM_OUTPUT_DEF
4694 /* Make name accessible from other files, if appropriate. */
4696 if (TREE_PUBLIC (decl
))
4698 #ifdef ASM_WEAKEN_LABEL
4699 if (DECL_WEAK (decl
))
4701 ASM_WEAKEN_LABEL (asm_out_file
, name
);
4702 /* Remove this function from the pending weak list so that
4703 we do not emit multiple .weak directives for it. */
4704 remove_from_pending_weak_list
4705 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
4709 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
4712 #ifdef ASM_OUTPUT_DEF_FROM_DECLS
4713 ASM_OUTPUT_DEF_FROM_DECLS (asm_out_file
, decl
, target
);
4715 ASM_OUTPUT_DEF (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4717 TREE_ASM_WRITTEN (decl
) = 1;
4719 #ifdef ASM_OUTPUT_WEAK_ALIAS
4720 if (! DECL_WEAK (decl
))
4721 warning ("only weak aliases are supported in this configuration");
4723 ASM_OUTPUT_WEAK_ALIAS (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4724 TREE_ASM_WRITTEN (decl
) = 1;
4726 warning ("alias definitions not supported in this configuration; ignored");
4731 /* This determines whether or not we support link-once semantics. */
4732 #ifndef SUPPORTS_ONE_ONLY
4733 #ifdef MAKE_DECL_ONE_ONLY
4734 #define SUPPORTS_ONE_ONLY 1
4736 #define SUPPORTS_ONE_ONLY 0
4740 /* Returns 1 if the target configuration supports defining public symbols
4741 so that one of them will be chosen at link time instead of generating a
4742 multiply-defined symbol error, whether through the use of weak symbols or
4743 a target-specific mechanism for having duplicates discarded. */
4746 supports_one_only ()
4748 if (SUPPORTS_ONE_ONLY
)
4750 return SUPPORTS_WEAK
;
4753 /* Set up DECL as a public symbol that can be defined in multiple
4754 translation units without generating a linker error. */
4757 make_decl_one_only (decl
)
4760 if (TREE_CODE (decl
) != VAR_DECL
&& TREE_CODE (decl
) != FUNCTION_DECL
)
4763 TREE_PUBLIC (decl
) = 1;
4765 if (TREE_CODE (decl
) == VAR_DECL
4766 && (DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
))
4767 DECL_COMMON (decl
) = 1;
4768 else if (SUPPORTS_ONE_ONLY
)
4770 #ifdef MAKE_DECL_ONE_ONLY
4771 MAKE_DECL_ONE_ONLY (decl
);
4773 DECL_ONE_ONLY (decl
) = 1;
4775 else if (SUPPORTS_WEAK
)
4776 DECL_WEAK (decl
) = 1;
4784 ggc_add_root (const_hash_table
, MAX_HASH_TABLE
, sizeof const_hash_table
[0],
4785 mark_const_hash_entry
);
4786 ggc_add_string_root (&in_named_name
, 1);