1 /* Output variables, constants and external declarations, for GNU compiler.
2 Copyright (C) 1987, 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997,
3 1998, 1999, 2000, 2001 Free Software Foundation, Inc.
5 This file is part of GNU CC.
7 GNU CC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GNU CC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU CC; see the file COPYING. If not, write to
19 the Free Software Foundation, 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
23 /* This file handles generation of all the assembler code
24 *except* the instructions of a function.
25 This includes declarations of variables and their initial values.
27 We also output the assembler code for constants stored in memory
28 and are responsible for combining constants with the same value. */
38 #include "hard-reg-set.h"
51 #ifdef XCOFF_DEBUGGING_INFO
55 #ifndef TRAMPOLINE_ALIGNMENT
56 #define TRAMPOLINE_ALIGNMENT FUNCTION_BOUNDARY
60 #define ASM_STABS_OP "\t.stabs\t"
63 /* Define the prefix to use when check_memory_usage_flag is enable. */
64 #define CHKR_PREFIX "_CHKR_"
65 #define CHKR_PREFIX_SIZE (sizeof (CHKR_PREFIX) - 1)
67 /* File in which assembler code is being written. */
69 extern FILE *asm_out_file
;
71 /* The (assembler) name of the first globally-visible object output. */
72 const char *first_global_object_name
;
73 const char *weak_global_object_name
;
75 extern struct obstack permanent_obstack
;
76 #define obstack_chunk_alloc xmalloc
79 struct constant_descriptor
;
83 #define MAX_RTX_HASH_TABLE 61
87 /* Hash facility for making memory-constants
88 from constant rtl-expressions. It is used on RISC machines
89 where immediate integer arguments and constant addresses are restricted
90 so that such constants must be stored in memory.
92 This pool of constants is reinitialized for each function
93 so each function gets its own constants-pool that comes right before
95 struct constant_descriptor
**x_const_rtx_hash_table
;
96 struct pool_constant
**x_const_rtx_sym_hash_table
;
98 /* Pointers to first and last constant in pool. */
99 struct pool_constant
*x_first_pool
, *x_last_pool
;
101 /* Current offset in constant pool (does not include any machine-specific
105 /* Chain of all CONST_DOUBLE rtx's constructed for the current function.
106 They are chained through the CONST_DOUBLE_CHAIN.
107 A CONST_DOUBLE rtx has CONST_DOUBLE_MEM != cc0_rtx iff it is on this chain.
108 In that case, CONST_DOUBLE_MEM is either a MEM,
109 or const0_rtx if no MEM has been made for this CONST_DOUBLE yet. */
110 rtx x_const_double_chain
;
113 #define const_rtx_hash_table (cfun->varasm->x_const_rtx_hash_table)
114 #define const_rtx_sym_hash_table (cfun->varasm->x_const_rtx_sym_hash_table)
115 #define first_pool (cfun->varasm->x_first_pool)
116 #define last_pool (cfun->varasm->x_last_pool)
117 #define pool_offset (cfun->varasm->x_pool_offset)
118 #define const_double_chain (cfun->varasm->x_const_double_chain)
120 /* Number for making the label on the next
121 constant that is stored in memory. */
125 /* Number for making the label on the next
126 static variable internal to a function. */
130 /* Carry information from ASM_DECLARE_OBJECT_NAME
131 to ASM_FINISH_DECLARE_OBJECT. */
133 int size_directive_output
;
135 /* The last decl for which assemble_variable was called,
136 if it did ASM_DECLARE_OBJECT_NAME.
137 If the last call to assemble_variable didn't do that,
140 tree last_assemble_variable_decl
;
142 static const char *strip_reg_name
PARAMS ((const char *));
143 static int contains_pointers_p
PARAMS ((tree
));
144 static void decode_addr_const
PARAMS ((tree
, struct addr_const
*));
145 static int const_hash
PARAMS ((tree
));
146 static int compare_constant
PARAMS ((tree
,
147 struct constant_descriptor
*));
148 static const unsigned char *compare_constant_1
PARAMS ((tree
, const unsigned char *));
149 static struct constant_descriptor
*record_constant
PARAMS ((tree
));
150 static void record_constant_1
PARAMS ((tree
));
151 static tree copy_constant
PARAMS ((tree
));
152 static void output_constant_def_contents
PARAMS ((tree
, int, int));
153 static void decode_rtx_const
PARAMS ((enum machine_mode
, rtx
,
154 struct rtx_const
*));
155 static int const_hash_rtx
PARAMS ((enum machine_mode
, rtx
));
156 static int compare_constant_rtx
PARAMS ((enum machine_mode
, rtx
,
157 struct constant_descriptor
*));
158 static struct constant_descriptor
*record_constant_rtx
PARAMS ((enum machine_mode
,
160 static struct pool_constant
*find_pool_constant
PARAMS ((struct function
*, rtx
));
161 static void mark_constant_pool
PARAMS ((void));
162 static void mark_constants
PARAMS ((rtx
));
163 static int mark_constant
PARAMS ((rtx
*current_rtx
, void *data
));
164 static int output_addressed_constants
PARAMS ((tree
));
165 static void output_after_function_constants
PARAMS ((void));
166 static unsigned HOST_WIDE_INT array_size_for_constructor
PARAMS ((tree
));
167 static void output_constructor
PARAMS ((tree
, int));
168 #ifdef ASM_WEAKEN_LABEL
169 static void remove_from_pending_weak_list
PARAMS ((const char *));
171 #ifdef ASM_OUTPUT_BSS
172 static void asm_output_bss
PARAMS ((FILE *, tree
, const char *, int, int));
174 #ifdef BSS_SECTION_ASM_OP
175 #ifdef ASM_OUTPUT_ALIGNED_BSS
176 static void asm_output_aligned_bss
PARAMS ((FILE *, tree
, const char *,
179 #endif /* BSS_SECTION_ASM_OP */
180 static void mark_pool_constant
PARAMS ((struct pool_constant
*));
181 static void mark_const_hash_entry
PARAMS ((void *));
182 static int mark_const_str_htab_1
PARAMS ((void **, void *));
183 static void mark_const_str_htab
PARAMS ((void *));
184 static hashval_t const_str_htab_hash
PARAMS ((const void *x
));
185 static int const_str_htab_eq
PARAMS ((const void *x
, const void *y
));
186 static void const_str_htab_del
PARAMS ((void *));
187 static void asm_emit_uninitialised
PARAMS ((tree
, const char*, int, int));
189 static enum in_section
{ no_section
, in_text
, in_data
, in_named
190 #ifdef BSS_SECTION_ASM_OP
193 #ifdef EH_FRAME_SECTION_ASM_OP
196 #ifdef EXTRA_SECTIONS
199 } in_section
= no_section
;
201 /* Return a non-zero value if DECL has a section attribute. */
202 #ifndef IN_NAMED_SECTION
203 #define IN_NAMED_SECTION(DECL) \
204 ((TREE_CODE (DECL) == FUNCTION_DECL || TREE_CODE (DECL) == VAR_DECL) \
205 && DECL_SECTION_NAME (DECL) != NULL_TREE)
208 /* Text of section name when in_section == in_named. */
209 static const char *in_named_name
;
211 /* Define functions like text_section for any extra sections. */
212 #ifdef EXTRA_SECTION_FUNCTIONS
213 EXTRA_SECTION_FUNCTIONS
216 /* Tell assembler to switch to text section. */
221 if (in_section
!= in_text
)
223 fprintf (asm_out_file
, "%s\n", TEXT_SECTION_ASM_OP
);
224 in_section
= in_text
;
228 /* Tell assembler to switch to data section. */
233 if (in_section
!= in_data
)
235 if (flag_shared_data
)
237 #ifdef SHARED_SECTION_ASM_OP
238 fprintf (asm_out_file
, "%s\n", SHARED_SECTION_ASM_OP
);
240 fprintf (asm_out_file
, "%s\n", DATA_SECTION_ASM_OP
);
244 fprintf (asm_out_file
, "%s\n", DATA_SECTION_ASM_OP
);
246 in_section
= in_data
;
249 /* Tell assembler to ALWAYS switch to data section, in case
250 it's not sure where it it. */
253 force_data_section ()
255 in_section
= no_section
;
259 /* Tell assembler to switch to read-only data section. This is normally
263 readonly_data_section ()
265 #ifdef READONLY_DATA_SECTION
266 READONLY_DATA_SECTION (); /* Note this can call data_section. */
272 /* Determine if we're in the text section. */
277 return in_section
== in_text
;
280 /* Determine if we're in the data section. */
285 return in_section
== in_data
;
288 /* Tell assembler to change to section NAME for DECL.
289 If DECL is NULL, just switch to section NAME.
290 If NAME is NULL, get the name from DECL.
291 If RELOC is 1, the initializer for DECL contains relocs. */
294 named_section (decl
, name
, reloc
)
297 int reloc ATTRIBUTE_UNUSED
;
299 if (decl
!= NULL_TREE
&& !DECL_P (decl
))
302 name
= TREE_STRING_POINTER (DECL_SECTION_NAME (decl
));
304 if (in_section
!= in_named
|| strcmp (name
, in_named_name
))
306 #ifdef ASM_OUTPUT_SECTION_NAME
307 ASM_OUTPUT_SECTION_NAME (asm_out_file
, decl
, name
, reloc
);
309 /* Section attributes are not supported if this macro isn't provided -
310 some host formats don't support them at all. The front-end should
311 already have flagged this as an error. */
315 in_named_name
= ggc_strdup (name
);
316 in_section
= in_named
;
320 #ifdef BSS_SECTION_ASM_OP
322 /* Tell the assembler to switch to the bss section. */
327 if (in_section
!= in_bss
)
329 #ifdef SHARED_BSS_SECTION_ASM_OP
330 if (flag_shared_data
)
331 fprintf (asm_out_file
, "%s\n", SHARED_BSS_SECTION_ASM_OP
);
334 fprintf (asm_out_file
, "%s\n", BSS_SECTION_ASM_OP
);
340 #ifdef ASM_OUTPUT_BSS
342 /* Utility function for ASM_OUTPUT_BSS for targets to use if
343 they don't support alignments in .bss.
344 ??? It is believed that this function will work in most cases so such
345 support is localized here. */
348 asm_output_bss (file
, decl
, name
, size
, rounded
)
350 tree decl ATTRIBUTE_UNUSED
;
352 int size ATTRIBUTE_UNUSED
, rounded
;
354 ASM_GLOBALIZE_LABEL (file
, name
);
356 #ifdef ASM_DECLARE_OBJECT_NAME
357 last_assemble_variable_decl
= decl
;
358 ASM_DECLARE_OBJECT_NAME (file
, name
, decl
);
360 /* Standard thing is just output label for the object. */
361 ASM_OUTPUT_LABEL (file
, name
);
362 #endif /* ASM_DECLARE_OBJECT_NAME */
363 ASM_OUTPUT_SKIP (file
, rounded
);
368 #ifdef ASM_OUTPUT_ALIGNED_BSS
370 /* Utility function for targets to use in implementing
371 ASM_OUTPUT_ALIGNED_BSS.
372 ??? It is believed that this function will work in most cases so such
373 support is localized here. */
376 asm_output_aligned_bss (file
, decl
, name
, size
, align
)
382 ASM_GLOBALIZE_LABEL (file
, name
);
384 ASM_OUTPUT_ALIGN (file
, floor_log2 (align
/ BITS_PER_UNIT
));
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
, size
? size
: 1);
397 #endif /* BSS_SECTION_ASM_OP */
399 #ifdef EH_FRAME_SECTION_ASM_OP
403 if (in_section
!= in_eh_frame
)
405 fprintf (asm_out_file
, "%s\n", EH_FRAME_SECTION_ASM_OP
);
406 in_section
= in_eh_frame
;
411 /* Switch to the section for function DECL.
413 If DECL is NULL_TREE, switch to the text section.
414 ??? It's not clear that we will ever be passed NULL_TREE, but it's
415 safer to handle it. */
418 function_section (decl
)
421 if (decl
!= NULL_TREE
422 && DECL_SECTION_NAME (decl
) != NULL_TREE
)
423 named_section (decl
, (char *) 0, 0);
428 /* Switch to section for variable DECL.
430 RELOC is the `reloc' argument to SELECT_SECTION. */
433 variable_section (decl
, reloc
)
437 if (IN_NAMED_SECTION (decl
))
438 named_section (decl
, NULL
, reloc
);
441 /* C++ can have const variables that get initialized from constructors,
442 and thus can not be in a readonly section. We prevent this by
443 verifying that the initial value is constant for objects put in a
446 error_mark_node is used by the C front end to indicate that the
447 initializer has not been seen yet. In this case, we assume that
448 the initializer must be constant.
450 C++ uses error_mark_node for variables that have complicated
451 initializers, but these variables go in BSS so we won't be called
454 #ifdef SELECT_SECTION
455 SELECT_SECTION (decl
, reloc
);
457 if (DECL_READONLY_SECTION (decl
, reloc
))
458 readonly_data_section ();
465 /* Tell assembler to switch to the section for the exception handling
471 #if defined (EXCEPTION_SECTION)
472 EXCEPTION_SECTION ();
474 #ifdef ASM_OUTPUT_SECTION_NAME
475 named_section (NULL_TREE
, ".gcc_except_table", 0);
480 readonly_data_section ();
485 /* Given NAME, a putative register name, discard any customary prefixes. */
488 strip_reg_name (name
)
491 #ifdef REGISTER_PREFIX
492 if (!strncmp (name
, REGISTER_PREFIX
, strlen (REGISTER_PREFIX
)))
493 name
+= strlen (REGISTER_PREFIX
);
495 if (name
[0] == '%' || name
[0] == '#')
500 /* Decode an `asm' spec for a declaration as a register name.
501 Return the register number, or -1 if nothing specified,
502 or -2 if the ASMSPEC is not `cc' or `memory' and is not recognized,
503 or -3 if ASMSPEC is `cc' and is not recognized,
504 or -4 if ASMSPEC is `memory' and is not recognized.
505 Accept an exact spelling or a decimal number.
506 Prefixes such as % are optional. */
509 decode_reg_name (asmspec
)
516 /* Get rid of confusing prefixes. */
517 asmspec
= strip_reg_name (asmspec
);
519 /* Allow a decimal number as a "register name". */
520 for (i
= strlen (asmspec
) - 1; i
>= 0; i
--)
521 if (! (asmspec
[i
] >= '0' && asmspec
[i
] <= '9'))
523 if (asmspec
[0] != 0 && i
< 0)
526 if (i
< FIRST_PSEUDO_REGISTER
&& i
>= 0)
532 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
534 && ! strcmp (asmspec
, strip_reg_name (reg_names
[i
])))
537 #ifdef ADDITIONAL_REGISTER_NAMES
539 static struct { const char *name
; int number
; } table
[]
540 = ADDITIONAL_REGISTER_NAMES
;
542 for (i
= 0; i
< (int) ARRAY_SIZE (table
); i
++)
543 if (! strcmp (asmspec
, table
[i
].name
))
544 return table
[i
].number
;
546 #endif /* ADDITIONAL_REGISTER_NAMES */
548 if (!strcmp (asmspec
, "memory"))
551 if (!strcmp (asmspec
, "cc"))
560 /* Create the DECL_RTL for a VAR_DECL or FUNCTION_DECL. DECL should
561 have static storage duration. In other words, it should not be an
562 automatic variable, including PARM_DECLs.
564 There is, however, one exception: this function handles variables
565 explicitly placed in a particular register by the user.
567 ASMSPEC, if not 0, is the string which the user specified as the
568 assembler symbol name.
570 This is never called for PARM_DECL nodes. */
573 make_decl_rtl (decl
, asmspec
)
577 int top_level
= (DECL_CONTEXT (decl
) == NULL_TREE
);
578 const char *name
= 0;
579 const char *new_name
= 0;
582 /* Check that we are not being given an automatic variable. */
583 /* A weak alias has TREE_PUBLIC set but not the other bits. */
584 if (TREE_CODE (decl
) == PARM_DECL
585 || TREE_CODE (decl
) == RESULT_DECL
586 || (TREE_CODE (decl
) == VAR_DECL
587 && !TREE_STATIC (decl
)
588 && !TREE_PUBLIC (decl
)
589 && !DECL_EXTERNAL (decl
)
590 && !DECL_REGISTER (decl
)))
592 /* And that we were not given a type or a label. */
593 else if (TREE_CODE (decl
) == TYPE_DECL
594 || TREE_CODE (decl
) == LABEL_DECL
)
597 /* For a duplicate declaration, we can be called twice on the
598 same DECL node. Don't discard the RTL already made. */
599 if (DECL_RTL_SET_P (decl
))
601 /* If the old RTL had the wrong mode, fix the mode. */
602 if (GET_MODE (DECL_RTL (decl
)) != DECL_MODE (decl
))
604 rtx rtl
= DECL_RTL (decl
);
605 PUT_MODE (rtl
, DECL_MODE (decl
));
608 /* ??? Another way to do this would be to do what halfpic.c does
609 and maintain a hashed table of such critters. */
610 /* ??? Another way to do this would be to pass a flag bit to
611 ENCODE_SECTION_INFO saying whether this is a new decl or not. */
612 /* Let the target reassign the RTL if it wants.
613 This is necessary, for example, when one machine specific
614 decl attribute overrides another. */
615 #ifdef REDO_SECTION_INFO_P
616 if (REDO_SECTION_INFO_P (decl
))
617 ENCODE_SECTION_INFO (decl
);
622 new_name
= name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
624 reg_number
= decode_reg_name (asmspec
);
625 if (reg_number
== -2)
627 /* ASMSPEC is given, and not the name of a register. Mark the
628 name with a star so assemble_name won't munge it. */
629 char *starred
= alloca (strlen (asmspec
) + 2);
631 strcpy (starred
+ 1, asmspec
);
635 if (TREE_CODE (decl
) != FUNCTION_DECL
&& DECL_REGISTER (decl
))
637 /* First detect errors in declaring global registers. */
638 if (reg_number
== -1)
639 error_with_decl (decl
, "register name not specified for `%s'");
640 else if (reg_number
< 0)
641 error_with_decl (decl
, "invalid register name for `%s'");
642 else if (TYPE_MODE (TREE_TYPE (decl
)) == BLKmode
)
643 error_with_decl (decl
,
644 "data type of `%s' isn't suitable for a register");
645 else if (! HARD_REGNO_MODE_OK (reg_number
, TYPE_MODE (TREE_TYPE (decl
))))
646 error_with_decl (decl
,
647 "register specified for `%s' isn't suitable for data type");
648 /* Now handle properly declared static register variables. */
653 if (DECL_INITIAL (decl
) != 0 && TREE_STATIC (decl
))
655 DECL_INITIAL (decl
) = 0;
656 error ("global register variable has initial value");
658 if (TREE_THIS_VOLATILE (decl
))
659 warning ("volatile register variables don't work as you might wish");
661 /* If the user specified one of the eliminables registers here,
662 e.g., FRAME_POINTER_REGNUM, we don't want to get this variable
663 confused with that register and be eliminated. Although this
664 usage is somewhat suspect, we nevertheless use the following
665 kludge to avoid setting DECL_RTL to frame_pointer_rtx. */
668 gen_rtx_REG (DECL_MODE (decl
),
669 FIRST_PSEUDO_REGISTER
));
670 REGNO (DECL_RTL (decl
)) = reg_number
;
671 REG_USERVAR_P (DECL_RTL (decl
)) = 1;
673 if (TREE_STATIC (decl
))
675 /* Make this register global, so not usable for anything
677 #ifdef ASM_DECLARE_REGISTER_GLOBAL
678 ASM_DECLARE_REGISTER_GLOBAL (asm_out_file
, decl
, reg_number
, name
);
680 nregs
= HARD_REGNO_NREGS (reg_number
, DECL_MODE (decl
));
682 globalize_reg (reg_number
+ --nregs
);
685 /* As a register variable, it has no section. */
690 /* Now handle ordinary static variables and functions (in memory).
691 Also handle vars declared register invalidly. */
693 if (reg_number
>= 0 || reg_number
== -3)
694 error_with_decl (decl
,
695 "register name given for non-register variable `%s'");
697 /* Specifying a section attribute on a variable forces it into a
698 non-.bss section, and thus it cannot be common. */
699 if (TREE_CODE (decl
) == VAR_DECL
700 && DECL_SECTION_NAME (decl
) != NULL_TREE
701 && DECL_INITIAL (decl
) == NULL_TREE
702 && DECL_COMMON (decl
))
703 DECL_COMMON (decl
) = 0;
705 /* Can't use just the variable's own name for a variable
706 whose scope is less than the whole file, unless it's a member
707 of a local class (which will already be unambiguous).
708 Concatenate a distinguishing number. */
709 if (!top_level
&& !TREE_PUBLIC (decl
)
710 && ! (DECL_CONTEXT (decl
) && TYPE_P (DECL_CONTEXT (decl
)))
712 && name
== IDENTIFIER_POINTER (DECL_NAME (decl
)))
715 ASM_FORMAT_PRIVATE_NAME (label
, name
, var_labelno
);
720 /* When -fprefix-function-name is used, the functions
721 names are prefixed. Only nested function names are not
723 else if (flag_prefix_function_name
&& TREE_CODE (decl
) == FUNCTION_DECL
)
725 size_t name_len
= IDENTIFIER_LENGTH (DECL_ASSEMBLER_NAME (decl
));
728 pname
= alloca (name_len
+ CHKR_PREFIX_SIZE
+ 1);
729 memcpy (pname
, CHKR_PREFIX
, CHKR_PREFIX_SIZE
);
730 memcpy (pname
+ CHKR_PREFIX_SIZE
, name
, name_len
+ 1);
734 if (name
!= new_name
)
736 SET_DECL_ASSEMBLER_NAME (decl
, get_identifier (new_name
));
737 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
740 /* If this variable is to be treated as volatile, show its
741 tree node has side effects. */
742 if ((flag_volatile_global
&& TREE_CODE (decl
) == VAR_DECL
743 && TREE_PUBLIC (decl
))
744 || ((flag_volatile_static
&& TREE_CODE (decl
) == VAR_DECL
745 && (TREE_PUBLIC (decl
) || TREE_STATIC (decl
)))))
746 TREE_SIDE_EFFECTS (decl
) = 1;
748 SET_DECL_RTL (decl
, gen_rtx_MEM (DECL_MODE (decl
),
749 gen_rtx_SYMBOL_REF (Pmode
, name
)));
750 SYMBOL_REF_WEAK (XEXP (DECL_RTL (decl
), 0)) = DECL_WEAK (decl
);
751 if (TREE_CODE (decl
) != FUNCTION_DECL
)
752 set_mem_attributes (DECL_RTL (decl
), decl
, 1);
754 /* Optionally set flags or add text to the name to record information
755 such as that it is a function name.
756 If the name is changed, the macro ASM_OUTPUT_LABELREF
757 will have to know how to strip this information. */
758 #ifdef ENCODE_SECTION_INFO
759 ENCODE_SECTION_INFO (decl
);
763 /* Make the rtl for variable VAR be volatile.
764 Use this only for static variables. */
767 make_var_volatile (var
)
770 if (GET_CODE (DECL_RTL (var
)) != MEM
)
773 MEM_VOLATILE_P (DECL_RTL (var
)) = 1;
776 /* Output alignment directive to align for constant expression EXP. */
779 assemble_constant_align (exp
)
784 /* Align the location counter as required by EXP's data type. */
785 align
= TYPE_ALIGN (TREE_TYPE (exp
));
786 #ifdef CONSTANT_ALIGNMENT
787 align
= CONSTANT_ALIGNMENT (exp
, align
);
790 if (align
> BITS_PER_UNIT
)
791 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
794 /* Output a string of literal assembler code
795 for an `asm' keyword used between functions. */
798 assemble_asm (string
)
803 if (TREE_CODE (string
) == ADDR_EXPR
)
804 string
= TREE_OPERAND (string
, 0);
806 fprintf (asm_out_file
, "\t%s\n", TREE_STRING_POINTER (string
));
809 #if 0 /* This should no longer be needed, because
810 flag_gnu_linker should be 0 on these systems,
811 which should prevent any output
812 if ASM_OUTPUT_CONSTRUCTOR and ASM_OUTPUT_DESTRUCTOR are absent. */
813 #if !(defined(DBX_DEBUGGING_INFO) && !defined(FASCIST_ASSEMBLER))
814 #ifndef ASM_OUTPUT_CONSTRUCTOR
815 #define ASM_OUTPUT_CONSTRUCTOR(file, name)
817 #ifndef ASM_OUTPUT_DESTRUCTOR
818 #define ASM_OUTPUT_DESTRUCTOR(file, name)
823 /* Record an element in the table of global destructors.
824 How this is done depends on what sort of assembler and linker
827 NAME should be the name of a global function to be called
828 at exit time. This name is output using assemble_name. */
831 assemble_destructor (name
)
834 #ifdef ASM_OUTPUT_DESTRUCTOR
835 ASM_OUTPUT_DESTRUCTOR (asm_out_file
, name
);
839 /* Now tell GNU LD that this is part of the static destructor set. */
840 /* This code works for any machine provided you use GNU as/ld. */
841 fprintf (asm_out_file
, "%s\"___DTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
842 assemble_name (asm_out_file
, name
);
843 fputc ('\n', asm_out_file
);
848 /* Likewise for global constructors. */
851 assemble_constructor (name
)
854 #ifdef ASM_OUTPUT_CONSTRUCTOR
855 ASM_OUTPUT_CONSTRUCTOR (asm_out_file
, name
);
859 /* Now tell GNU LD that this is part of the static constructor set. */
860 /* This code works for any machine provided you use GNU as/ld. */
861 fprintf (asm_out_file
, "%s\"___CTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
862 assemble_name (asm_out_file
, name
);
863 fputc ('\n', asm_out_file
);
868 /* Likewise for entries we want to record for garbage collection.
869 Garbage collection is still under development. */
872 assemble_gc_entry (name
)
875 #ifdef ASM_OUTPUT_GC_ENTRY
876 ASM_OUTPUT_GC_ENTRY (asm_out_file
, name
);
880 /* Now tell GNU LD that this is part of the static constructor set. */
881 fprintf (asm_out_file
, "%s\"___PTR_LIST__\",22,0,0,", ASM_STABS_OP
);
882 assemble_name (asm_out_file
, name
);
883 fputc ('\n', asm_out_file
);
888 /* CONSTANT_POOL_BEFORE_FUNCTION may be defined as an expression with
889 a non-zero value if the constant pool should be output before the
890 start of the function, or a zero value if the pool should output
891 after the end of the function. The default is to put it before the
894 #ifndef CONSTANT_POOL_BEFORE_FUNCTION
895 #define CONSTANT_POOL_BEFORE_FUNCTION 1
898 /* Output assembler code for the constant pool of a function and associated
899 with defining the name of the function. DECL describes the function.
900 NAME is the function's name. For the constant pool, we use the current
901 constant pool data. */
904 assemble_start_function (decl
, fnname
)
910 /* The following code does not need preprocessing in the assembler. */
914 if (CONSTANT_POOL_BEFORE_FUNCTION
)
915 output_constant_pool (fnname
, decl
);
917 #ifdef ASM_OUTPUT_SECTION_NAME
918 /* If the function is to be put in its own section and it's not in a section
919 already, indicate so. */
920 if ((flag_function_sections
921 && DECL_SECTION_NAME (decl
) == NULL_TREE
)
922 || UNIQUE_SECTION_P (decl
))
923 UNIQUE_SECTION (decl
, 0);
926 function_section (decl
);
928 /* Tell assembler to move to target machine's alignment for functions. */
929 align
= floor_log2 (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
931 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
933 /* Handle a user-specified function alignment.
934 Note that we still need to align to FUNCTION_BOUNDARY, as above,
935 because ASM_OUTPUT_MAX_SKIP_ALIGN might not do any alignment at all. */
936 if (align_functions_log
> align
)
938 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
939 ASM_OUTPUT_MAX_SKIP_ALIGN (asm_out_file
,
940 align_functions_log
, align_functions
-1);
942 ASM_OUTPUT_ALIGN (asm_out_file
, align_functions_log
);
946 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
947 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file
, fnname
);
950 #ifdef SDB_DEBUGGING_INFO
951 /* Output SDB definition of the function. */
952 if (write_symbols
== SDB_DEBUG
)
953 sdbout_mark_begin_function ();
956 #ifdef DBX_DEBUGGING_INFO
957 /* Output DBX definition of the function. */
958 if (write_symbols
== DBX_DEBUG
)
959 dbxout_begin_function (decl
);
962 /* Make function name accessible from other files, if appropriate. */
964 if (TREE_PUBLIC (decl
))
966 if (! first_global_object_name
)
971 STRIP_NAME_ENCODING (p
, fnname
);
972 name
= permalloc (strlen (p
) + 1);
975 if (! DECL_WEAK (decl
) && ! DECL_ONE_ONLY (decl
))
976 first_global_object_name
= name
;
978 weak_global_object_name
= name
;
981 #ifdef ASM_WEAKEN_LABEL
982 if (DECL_WEAK (decl
))
984 ASM_WEAKEN_LABEL (asm_out_file
, fnname
);
985 /* Remove this function from the pending weak list so that
986 we do not emit multiple .weak directives for it. */
987 remove_from_pending_weak_list
988 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
992 ASM_GLOBALIZE_LABEL (asm_out_file
, fnname
);
995 /* Do any machine/system dependent processing of the function name */
996 #ifdef ASM_DECLARE_FUNCTION_NAME
997 ASM_DECLARE_FUNCTION_NAME (asm_out_file
, fnname
, current_function_decl
);
999 /* Standard thing is just output label for the function. */
1000 ASM_OUTPUT_LABEL (asm_out_file
, fnname
);
1001 #endif /* ASM_DECLARE_FUNCTION_NAME */
1004 /* Output assembler code associated with defining the size of the
1005 function. DECL describes the function. NAME is the function's name. */
1008 assemble_end_function (decl
, fnname
)
1012 #ifdef ASM_DECLARE_FUNCTION_SIZE
1013 ASM_DECLARE_FUNCTION_SIZE (asm_out_file
, fnname
, decl
);
1015 if (! CONSTANT_POOL_BEFORE_FUNCTION
)
1017 output_constant_pool (fnname
, decl
);
1018 function_section (decl
); /* need to switch back */
1021 /* Output any constants which should appear after the function. */
1022 output_after_function_constants ();
1025 /* Assemble code to leave SIZE bytes of zeros. */
1028 assemble_zeros (size
)
1031 /* Do no output if -fsyntax-only. */
1032 if (flag_syntax_only
)
1035 #ifdef ASM_NO_SKIP_IN_TEXT
1036 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
1037 so we must output 0s explicitly in the text section. */
1038 if (ASM_NO_SKIP_IN_TEXT
&& in_text_section ())
1042 for (i
= 0; i
< size
- 20; i
+= 20)
1045 fprintf (asm_out_file
,
1046 "%s0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n", ASM_BYTE_OP
);
1048 fprintf (asm_out_file
,
1049 "\tbyte 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n");
1055 fprintf (asm_out_file
, "%s0", ASM_BYTE_OP
);
1057 fprintf (asm_out_file
, "\tbyte 0");
1060 for (; i
< size
; i
++)
1061 fprintf (asm_out_file
, ",0");
1062 fprintf (asm_out_file
, "\n");
1068 ASM_OUTPUT_SKIP (asm_out_file
, size
);
1071 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
1074 assemble_align (align
)
1077 if (align
> BITS_PER_UNIT
)
1078 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
1081 /* Assemble a string constant with the specified C string as contents. */
1084 assemble_string (p
, size
)
1091 /* If the string is very long, split it up. */
1095 int thissize
= size
- pos
;
1096 if (thissize
> maximum
)
1099 ASM_OUTPUT_ASCII (asm_out_file
, p
, thissize
);
1107 #if defined ASM_OUTPUT_ALIGNED_DECL_LOCAL
1108 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1109 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1111 #if defined ASM_OUTPUT_ALIGNED_LOCAL
1112 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1113 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, DECL_ALIGN (decl))
1115 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1116 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded)
1120 #if defined ASM_OUTPUT_ALIGNED_BSS
1121 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1122 ASM_OUTPUT_ALIGNED_BSS (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1124 #if defined ASM_OUTPUT_BSS
1125 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1126 ASM_OUTPUT_BSS (asm_out_file, decl, name, size, rounded)
1132 #if defined ASM_OUTPUT_ALIGNED_DECL_COMMON
1133 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1134 ASM_OUTPUT_ALIGNED_DECL_COMMON (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1136 #if defined ASM_OUTPUT_ALIGNED_COMMON
1137 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1138 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file, name, size, DECL_ALIGN (decl))
1140 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1141 ASM_OUTPUT_COMMON (asm_out_file, name, size, rounded)
1146 asm_emit_uninitialised (decl
, name
, size
, rounded
)
1149 int size ATTRIBUTE_UNUSED
;
1150 int rounded ATTRIBUTE_UNUSED
;
1158 destination
= asm_dest_local
;
1160 if (TREE_PUBLIC (decl
))
1162 #if defined ASM_EMIT_BSS
1163 if (! DECL_COMMON (decl
))
1164 destination
= asm_dest_bss
;
1167 destination
= asm_dest_common
;
1170 if (flag_shared_data
)
1172 switch (destination
)
1174 #ifdef ASM_OUTPUT_SHARED_BSS
1176 ASM_OUTPUT_SHARED_BSS (asm_out_file
, decl
, name
, size
, rounded
);
1179 #ifdef ASM_OUTPUT_SHARED_COMMON
1180 case asm_dest_common
:
1181 ASM_OUTPUT_SHARED_COMMON (asm_out_file
, name
, size
, rounded
);
1184 #ifdef ASM_OUTPUT_SHARED_LOCAL
1185 case asm_dest_local
:
1186 ASM_OUTPUT_SHARED_LOCAL (asm_out_file
, name
, size
, rounded
);
1194 #ifdef ASM_OUTPUT_SECTION_NAME
1195 /* We already know that DECL_SECTION_NAME() == NULL. */
1196 if (flag_data_sections
!= 0 || UNIQUE_SECTION_P (decl
))
1197 UNIQUE_SECTION (decl
, 0);
1200 switch (destination
)
1204 ASM_EMIT_BSS (decl
, name
, size
, rounded
);
1207 case asm_dest_common
:
1208 ASM_EMIT_COMMON (decl
, name
, size
, rounded
);
1210 case asm_dest_local
:
1211 ASM_EMIT_LOCAL (decl
, name
, size
, rounded
);
1220 /* Assemble everything that is needed for a variable or function declaration.
1221 Not used for automatic variables, and not used for function definitions.
1222 Should not be called for variables of incomplete structure type.
1224 TOP_LEVEL is nonzero if this variable has file scope.
1225 AT_END is nonzero if this is the special handling, at end of compilation,
1226 to define things that have had only tentative definitions.
1227 DONT_OUTPUT_DATA if nonzero means don't actually output the
1228 initial value (that will be done by the caller). */
1231 assemble_variable (decl
, top_level
, at_end
, dont_output_data
)
1233 int top_level ATTRIBUTE_UNUSED
;
1234 int at_end ATTRIBUTE_UNUSED
;
1235 int dont_output_data
;
1237 register const char *name
;
1240 enum in_section saved_in_section
;
1242 last_assemble_variable_decl
= 0;
1244 if (DECL_RTL_SET_P (decl
) && GET_CODE (DECL_RTL (decl
)) == REG
)
1246 /* Do output symbol info for global register variables, but do nothing
1249 if (TREE_ASM_WRITTEN (decl
))
1251 TREE_ASM_WRITTEN (decl
) = 1;
1253 /* Do no output if -fsyntax-only. */
1254 if (flag_syntax_only
)
1257 #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
1258 /* File-scope global variables are output here. */
1259 if ((write_symbols
== DBX_DEBUG
|| write_symbols
== XCOFF_DEBUG
)
1261 dbxout_symbol (decl
, 0);
1263 #ifdef SDB_DEBUGGING_INFO
1264 if (write_symbols
== SDB_DEBUG
&& top_level
1265 /* Leave initialized global vars for end of compilation;
1266 see comment in compile_file. */
1267 && (TREE_PUBLIC (decl
) == 0 || DECL_INITIAL (decl
) == 0))
1268 sdbout_symbol (decl
, 0);
1271 /* Don't output any DWARF debugging information for variables here.
1272 In the case of local variables, the information for them is output
1273 when we do our recursive traversal of the tree representation for
1274 the entire containing function. In the case of file-scope variables,
1275 we output information for all of them at the very end of compilation
1276 while we are doing our final traversal of the chain of file-scope
1282 /* Normally no need to say anything here for external references,
1283 since assemble_external is called by the language-specific code
1284 when a declaration is first seen. */
1286 if (DECL_EXTERNAL (decl
))
1289 /* Output no assembler code for a function declaration.
1290 Only definitions of functions output anything. */
1292 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1295 /* If type was incomplete when the variable was declared,
1296 see if it is complete now. */
1298 if (DECL_SIZE (decl
) == 0)
1299 layout_decl (decl
, 0);
1301 /* Still incomplete => don't allocate it; treat the tentative defn
1302 (which is what it must have been) as an `extern' reference. */
1304 if (!dont_output_data
&& DECL_SIZE (decl
) == 0)
1306 error_with_file_and_line (DECL_SOURCE_FILE (decl
),
1307 DECL_SOURCE_LINE (decl
),
1308 "storage size of `%s' isn't known",
1309 IDENTIFIER_POINTER (DECL_NAME (decl
)));
1310 TREE_ASM_WRITTEN (decl
) = 1;
1314 /* The first declaration of a variable that comes through this function
1315 decides whether it is global (in C, has external linkage)
1316 or local (in C, has internal linkage). So do nothing more
1317 if this function has already run. */
1319 if (TREE_ASM_WRITTEN (decl
))
1322 TREE_ASM_WRITTEN (decl
) = 1;
1324 /* Do no output if -fsyntax-only. */
1325 if (flag_syntax_only
)
1330 if (! dont_output_data
1331 && ! host_integerp (DECL_SIZE_UNIT (decl
), 1))
1333 error_with_decl (decl
, "size of variable `%s' is too large");
1337 name
= XSTR (XEXP (DECL_RTL (decl
), 0), 0);
1338 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
)
1339 && ! first_global_object_name
1340 && ! (DECL_COMMON (decl
) && (DECL_INITIAL (decl
) == 0
1341 || DECL_INITIAL (decl
) == error_mark_node
))
1342 && ! DECL_WEAK (decl
)
1343 && ! DECL_ONE_ONLY (decl
))
1348 STRIP_NAME_ENCODING (p
, name
);
1349 xname
= permalloc (strlen (p
) + 1);
1351 first_global_object_name
= xname
;
1354 /* Compute the alignment of this data. */
1356 align
= DECL_ALIGN (decl
);
1358 /* In the case for initialing an array whose length isn't specified,
1359 where we have not yet been able to do the layout,
1360 figure out the proper alignment now. */
1361 if (dont_output_data
&& DECL_SIZE (decl
) == 0
1362 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
)
1363 align
= MAX (align
, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl
))));
1365 /* Some object file formats have a maximum alignment which they support.
1366 In particular, a.out format supports a maximum alignment of 4. */
1367 #ifndef MAX_OFILE_ALIGNMENT
1368 #define MAX_OFILE_ALIGNMENT BIGGEST_ALIGNMENT
1370 if (align
> MAX_OFILE_ALIGNMENT
)
1372 warning_with_decl (decl
,
1373 "alignment of `%s' is greater than maximum object file alignment. Using %d.",
1374 MAX_OFILE_ALIGNMENT
/BITS_PER_UNIT
);
1375 align
= MAX_OFILE_ALIGNMENT
;
1378 /* On some machines, it is good to increase alignment sometimes. */
1379 #ifdef DATA_ALIGNMENT
1380 align
= DATA_ALIGNMENT (TREE_TYPE (decl
), align
);
1382 #ifdef CONSTANT_ALIGNMENT
1383 if (DECL_INITIAL (decl
) != 0 && DECL_INITIAL (decl
) != error_mark_node
)
1384 align
= CONSTANT_ALIGNMENT (DECL_INITIAL (decl
), align
);
1387 /* Reset the alignment in case we have made it tighter, so we can benefit
1388 from it in get_pointer_alignment. */
1389 DECL_ALIGN (decl
) = align
;
1391 /* Handle uninitialized definitions. */
1393 if ((DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
)
1394 /* If the target can't output uninitialized but not common global data
1395 in .bss, then we have to use .data. */
1396 #if ! defined ASM_EMIT_BSS
1397 && DECL_COMMON (decl
)
1399 && DECL_SECTION_NAME (decl
) == NULL_TREE
1400 && ! dont_output_data
)
1402 unsigned HOST_WIDE_INT size
= tree_low_cst (DECL_SIZE_UNIT (decl
), 1);
1403 unsigned HOST_WIDE_INT rounded
= size
;
1405 /* Don't allocate zero bytes of common,
1406 since that means "undefined external" in the linker. */
1410 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1411 so that each uninitialized object starts on such a boundary. */
1412 rounded
+= (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1;
1413 rounded
= (rounded
/ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1414 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1416 /* Don't continue this line--convex cc version 4.1 would lose. */
1417 #if !defined(ASM_OUTPUT_ALIGNED_COMMON) && !defined(ASM_OUTPUT_ALIGNED_DECL_COMMON) && !defined(ASM_OUTPUT_ALIGNED_BSS)
1418 if ((unsigned HOST_WIDE_INT
) DECL_ALIGN (decl
) / BITS_PER_UNIT
> rounded
)
1420 (decl
, "requested alignment for %s is greater than implemented alignment of %d.",rounded
);
1423 #ifdef DBX_DEBUGGING_INFO
1424 /* File-scope global variables are output here. */
1425 if (write_symbols
== DBX_DEBUG
&& top_level
)
1426 dbxout_symbol (decl
, 0);
1428 #ifdef SDB_DEBUGGING_INFO
1429 if (write_symbols
== SDB_DEBUG
&& top_level
1430 /* Leave initialized global vars for end of compilation;
1431 see comment in compile_file. */
1432 && (TREE_PUBLIC (decl
) == 0 || DECL_INITIAL (decl
) == 0))
1433 sdbout_symbol (decl
, 0);
1436 /* Don't output any DWARF debugging information for variables here.
1437 In the case of local variables, the information for them is output
1438 when we do our recursive traversal of the tree representation for
1439 the entire containing function. In the case of file-scope variables,
1440 we output information for all of them at the very end of compilation
1441 while we are doing our final traversal of the chain of file-scope
1444 #if 0 /* ??? We should either delete this or add a comment describing what
1445 it was intended to do and why we shouldn't delete it. */
1446 if (flag_shared_data
)
1449 asm_emit_uninitialised (decl
, name
, size
, rounded
);
1454 /* Handle initialized definitions.
1455 Also handle uninitialized global definitions if -fno-common and the
1456 target doesn't support ASM_OUTPUT_BSS. */
1458 /* First make the assembler name(s) global if appropriate. */
1459 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
))
1461 #ifdef ASM_WEAKEN_LABEL
1462 if (DECL_WEAK (decl
))
1464 ASM_WEAKEN_LABEL (asm_out_file
, name
);
1465 /* Remove this variable from the pending weak list so that
1466 we do not emit multiple .weak directives for it. */
1467 remove_from_pending_weak_list
1468 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
1472 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
1475 for (d
= equivalents
; d
; d
= TREE_CHAIN (d
))
1477 tree e
= TREE_VALUE (d
);
1478 if (TREE_PUBLIC (e
) && DECL_NAME (e
))
1479 ASM_GLOBALIZE_LABEL (asm_out_file
,
1480 XSTR (XEXP (DECL_RTL (e
), 0), 0));
1484 /* Output any data that we will need to use the address of. */
1485 if (DECL_INITIAL (decl
) == error_mark_node
)
1486 reloc
= contains_pointers_p (TREE_TYPE (decl
));
1487 else if (DECL_INITIAL (decl
))
1488 reloc
= output_addressed_constants (DECL_INITIAL (decl
));
1490 #ifdef ASM_OUTPUT_SECTION_NAME
1491 if ((flag_data_sections
!= 0 && DECL_SECTION_NAME (decl
) == NULL_TREE
)
1492 || UNIQUE_SECTION_P (decl
))
1493 UNIQUE_SECTION (decl
, reloc
);
1496 /* Switch to the appropriate section. */
1497 variable_section (decl
, reloc
);
1499 /* dbxout.c needs to know this. */
1500 if (in_text_section ())
1501 DECL_IN_TEXT_SECTION (decl
) = 1;
1503 /* Record current section so we can restore it if dbxout.c clobbers it. */
1504 saved_in_section
= in_section
;
1506 /* Output the dbx info now that we have chosen the section. */
1508 #ifdef DBX_DEBUGGING_INFO
1509 /* File-scope global variables are output here. */
1510 if (write_symbols
== DBX_DEBUG
&& top_level
)
1511 dbxout_symbol (decl
, 0);
1513 #ifdef SDB_DEBUGGING_INFO
1514 if (write_symbols
== SDB_DEBUG
&& top_level
1515 /* Leave initialized global vars for end of compilation;
1516 see comment in compile_file. */
1517 && (TREE_PUBLIC (decl
) == 0 || DECL_INITIAL (decl
) == 0))
1518 sdbout_symbol (decl
, 0);
1521 /* Don't output any DWARF debugging information for variables here.
1522 In the case of local variables, the information for them is output
1523 when we do our recursive traversal of the tree representation for
1524 the entire containing function. In the case of file-scope variables,
1525 we output information for all of them at the very end of compilation
1526 while we are doing our final traversal of the chain of file-scope
1529 /* If the debugging output changed sections, reselect the section
1530 that's supposed to be selected. */
1531 if (in_section
!= saved_in_section
)
1532 variable_section (decl
, reloc
);
1534 /* Output the alignment of this data. */
1535 if (align
> BITS_PER_UNIT
)
1536 ASM_OUTPUT_ALIGN (asm_out_file
,
1537 floor_log2 (DECL_ALIGN (decl
) / BITS_PER_UNIT
));
1539 /* Do any machine/system dependent processing of the object. */
1540 #ifdef ASM_DECLARE_OBJECT_NAME
1541 last_assemble_variable_decl
= decl
;
1542 ASM_DECLARE_OBJECT_NAME (asm_out_file
, name
, decl
);
1544 /* Standard thing is just output label for the object. */
1545 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1546 #endif /* ASM_DECLARE_OBJECT_NAME */
1548 if (!dont_output_data
)
1550 if (DECL_INITIAL (decl
))
1551 /* Output the actual data. */
1552 output_constant (DECL_INITIAL (decl
),
1553 tree_low_cst (DECL_SIZE_UNIT (decl
), 1));
1555 /* Leave space for it. */
1556 assemble_zeros (tree_low_cst (DECL_SIZE_UNIT (decl
), 1));
1560 #ifdef XCOFF_DEBUGGING_INFO
1561 /* Unfortunately, the IBM assembler cannot handle stabx before the actual
1562 declaration. When something like ".stabx "aa:S-2",aa,133,0" is emitted
1563 and `aa' hasn't been output yet, the assembler generates a stab entry with
1564 a value of zero, in addition to creating an unnecessary external entry
1565 for `aa'. Hence, we must postpone dbxout_symbol to here at the end. */
1567 /* File-scope global variables are output here. */
1568 if (write_symbols
== XCOFF_DEBUG
&& top_level
)
1570 saved_in_section
= in_section
;
1572 dbxout_symbol (decl
, 0);
1574 if (in_section
!= saved_in_section
)
1575 variable_section (decl
, reloc
);
1578 /* There must be a statement after a label. */
1583 /* Return 1 if type TYPE contains any pointers. */
1586 contains_pointers_p (type
)
1589 switch (TREE_CODE (type
))
1592 case REFERENCE_TYPE
:
1593 /* I'm not sure whether OFFSET_TYPE needs this treatment,
1594 so I'll play safe and return 1. */
1600 case QUAL_UNION_TYPE
:
1603 /* For a type that has fields, see if the fields have pointers. */
1604 for (fields
= TYPE_FIELDS (type
); fields
; fields
= TREE_CHAIN (fields
))
1605 if (TREE_CODE (fields
) == FIELD_DECL
1606 && contains_pointers_p (TREE_TYPE (fields
)))
1612 /* An array type contains pointers if its element type does. */
1613 return contains_pointers_p (TREE_TYPE (type
));
1620 /* Output something to declare an external symbol to the assembler.
1621 (Most assemblers don't need this, so we normally output nothing.)
1622 Do nothing if DECL is not external. */
1625 assemble_external (decl
)
1626 tree decl ATTRIBUTE_UNUSED
;
1628 /* Because most platforms do not define ASM_OUTPUT_EXTERNAL, the
1629 main body of this code is only rarely exercised. To provide some
1630 testing, on all platforms, we make sure that the ASM_OUT_FILE is
1631 open. If it's not, we should not be calling this function. */
1635 #ifdef ASM_OUTPUT_EXTERNAL
1636 if (DECL_P (decl
) && DECL_EXTERNAL (decl
) && TREE_PUBLIC (decl
))
1638 rtx rtl
= DECL_RTL (decl
);
1640 if (GET_CODE (rtl
) == MEM
&& GET_CODE (XEXP (rtl
, 0)) == SYMBOL_REF
1641 && ! SYMBOL_REF_USED (XEXP (rtl
, 0)))
1643 /* Some systems do require some output. */
1644 SYMBOL_REF_USED (XEXP (rtl
, 0)) = 1;
1645 ASM_OUTPUT_EXTERNAL (asm_out_file
, decl
, XSTR (XEXP (rtl
, 0), 0));
1651 /* Similar, for calling a library function FUN. */
1654 assemble_external_libcall (fun
)
1655 rtx fun ATTRIBUTE_UNUSED
;
1657 #ifdef ASM_OUTPUT_EXTERNAL_LIBCALL
1658 /* Declare library function name external when first used, if nec. */
1659 if (! SYMBOL_REF_USED (fun
))
1661 SYMBOL_REF_USED (fun
) = 1;
1662 ASM_OUTPUT_EXTERNAL_LIBCALL (asm_out_file
, fun
);
1667 /* Declare the label NAME global. */
1670 assemble_global (name
)
1673 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
1676 /* Assemble a label named NAME. */
1679 assemble_label (name
)
1682 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1685 /* Output to FILE a reference to the assembler name of a C-level name NAME.
1686 If NAME starts with a *, the rest of NAME is output verbatim.
1687 Otherwise NAME is transformed in an implementation-defined way
1688 (usually by the addition of an underscore).
1689 Many macros in the tm file are defined to call this function. */
1692 assemble_name (file
, name
)
1696 const char *real_name
;
1699 STRIP_NAME_ENCODING (real_name
, name
);
1700 if (flag_prefix_function_name
1701 && ! memcmp (real_name
, CHKR_PREFIX
, CHKR_PREFIX_SIZE
))
1702 real_name
= real_name
+ CHKR_PREFIX_SIZE
;
1704 id
= maybe_get_identifier (real_name
);
1706 TREE_SYMBOL_REFERENCED (id
) = 1;
1709 fputs (&name
[1], file
);
1711 ASM_OUTPUT_LABELREF (file
, name
);
1714 /* Allocate SIZE bytes writable static space with a gensym name
1715 and return an RTX to refer to its address. */
1718 assemble_static_space (size
)
1722 const char *namestring
;
1726 if (flag_shared_data
)
1730 ASM_GENERATE_INTERNAL_LABEL (name
, "LF", const_labelno
);
1732 namestring
= ggc_strdup (name
);
1734 x
= gen_rtx_SYMBOL_REF (Pmode
, namestring
);
1736 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
1737 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file
, NULL_TREE
, name
, size
,
1740 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1741 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file
, name
, size
, BIGGEST_ALIGNMENT
);
1744 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1745 so that each uninitialized object starts on such a boundary. */
1746 /* Variable `rounded' might or might not be used in ASM_OUTPUT_LOCAL. */
1747 int rounded ATTRIBUTE_UNUSED
1748 = ((size
+ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1)
1749 / (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1750 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1751 ASM_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
1758 /* Assemble the static constant template for function entry trampolines.
1759 This is done at most once per compilation.
1760 Returns an RTX for the address of the template. */
1762 #ifdef TRAMPOLINE_TEMPLATE
1764 assemble_trampoline_template ()
1770 /* By default, put trampoline templates in read-only data section. */
1772 #ifdef TRAMPOLINE_SECTION
1773 TRAMPOLINE_SECTION ();
1775 readonly_data_section ();
1778 /* Write the assembler code to define one. */
1779 align
= floor_log2 (TRAMPOLINE_ALIGNMENT
/ BITS_PER_UNIT
);
1781 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1783 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LTRAMP", 0);
1784 TRAMPOLINE_TEMPLATE (asm_out_file
);
1786 /* Record the rtl to refer to it. */
1787 ASM_GENERATE_INTERNAL_LABEL (label
, "LTRAMP", 0);
1788 name
= ggc_strdup (label
);
1789 return gen_rtx_SYMBOL_REF (Pmode
, name
);
1793 /* Assemble the integer constant X into an object of SIZE bytes.
1794 X must be either a CONST_INT or CONST_DOUBLE.
1796 Return 1 if we were able to output the constant, otherwise 0. If FORCE is
1797 non-zero, abort if we can't output the constant. */
1800 assemble_integer (x
, size
, force
)
1805 /* First try to use the standard 1, 2, 4, 8, and 16 byte
1806 ASM_OUTPUT... macros. */
1810 #ifdef ASM_OUTPUT_CHAR
1812 ASM_OUTPUT_CHAR (asm_out_file
, x
);
1816 #ifdef ASM_OUTPUT_SHORT
1818 ASM_OUTPUT_SHORT (asm_out_file
, x
);
1822 #ifdef ASM_OUTPUT_INT
1824 ASM_OUTPUT_INT (asm_out_file
, x
);
1828 #ifdef ASM_OUTPUT_DOUBLE_INT
1830 ASM_OUTPUT_DOUBLE_INT (asm_out_file
, x
);
1834 #ifdef ASM_OUTPUT_QUADRUPLE_INT
1836 ASM_OUTPUT_QUADRUPLE_INT (asm_out_file
, x
);
1841 /* If we couldn't do it that way, there are two other possibilities: First,
1842 if the machine can output an explicit byte and this is a 1 byte constant,
1843 we can use ASM_OUTPUT_BYTE. */
1845 #ifdef ASM_OUTPUT_BYTE
1846 if (size
== 1 && GET_CODE (x
) == CONST_INT
)
1848 ASM_OUTPUT_BYTE (asm_out_file
, INTVAL (x
));
1853 /* Finally, if SIZE is larger than a single word, try to output the constant
1854 one word at a time. */
1856 if (size
> UNITS_PER_WORD
)
1859 enum machine_mode mode
1860 = mode_for_size (size
* BITS_PER_UNIT
, MODE_INT
, 0);
1863 for (i
= 0; i
< size
/ UNITS_PER_WORD
; i
++)
1865 word
= operand_subword (x
, i
, 0, mode
);
1870 if (! assemble_integer (word
, UNITS_PER_WORD
, 0))
1874 if (i
== size
/ UNITS_PER_WORD
)
1876 /* If we output at least one word and then could not finish,
1877 there is no valid way to continue. */
1888 /* Assemble the floating-point constant D into an object of size MODE. */
1891 assemble_real (d
, mode
)
1893 enum machine_mode mode
;
1895 jmp_buf output_constant_handler
;
1897 if (setjmp (output_constant_handler
))
1899 error ("floating point trap outputting a constant");
1900 #ifdef REAL_IS_NOT_DOUBLE
1901 memset ((char *) &d
, 0, sizeof d
);
1908 set_float_handler (output_constant_handler
);
1912 #ifdef ASM_OUTPUT_BYTE_FLOAT
1914 ASM_OUTPUT_BYTE_FLOAT (asm_out_file
, d
);
1917 #ifdef ASM_OUTPUT_SHORT_FLOAT
1919 ASM_OUTPUT_SHORT_FLOAT (asm_out_file
, d
);
1922 #ifdef ASM_OUTPUT_THREE_QUARTER_FLOAT
1924 ASM_OUTPUT_THREE_QUARTER_FLOAT (asm_out_file
, d
);
1927 #ifdef ASM_OUTPUT_FLOAT
1929 ASM_OUTPUT_FLOAT (asm_out_file
, d
);
1933 #ifdef ASM_OUTPUT_DOUBLE
1935 ASM_OUTPUT_DOUBLE (asm_out_file
, d
);
1939 #ifdef ASM_OUTPUT_LONG_DOUBLE
1942 ASM_OUTPUT_LONG_DOUBLE (asm_out_file
, d
);
1950 set_float_handler (NULL
);
1953 /* Here we combine duplicate floating constants to make
1954 CONST_DOUBLE rtx's, and force those out to memory when necessary. */
1956 /* Return a CONST_DOUBLE or CONST_INT for a value specified as a pair of ints.
1957 For an integer, I0 is the low-order word and I1 is the high-order word.
1958 For a real number, I0 is the word with the low address
1959 and I1 is the word with the high address. */
1962 immed_double_const (i0
, i1
, mode
)
1963 HOST_WIDE_INT i0
, i1
;
1964 enum machine_mode mode
;
1968 if (GET_MODE_CLASS (mode
) == MODE_INT
1969 || GET_MODE_CLASS (mode
) == MODE_PARTIAL_INT
)
1971 /* We clear out all bits that don't belong in MODE, unless they and our
1972 sign bit are all one. So we get either a reasonable negative value
1973 or a reasonable unsigned value for this mode. */
1974 int width
= GET_MODE_BITSIZE (mode
);
1975 if (width
< HOST_BITS_PER_WIDE_INT
1976 && ((i0
& ((HOST_WIDE_INT
) (-1) << (width
- 1)))
1977 != ((HOST_WIDE_INT
) (-1) << (width
- 1))))
1978 i0
&= ((HOST_WIDE_INT
) 1 << width
) - 1, i1
= 0;
1979 else if (width
== HOST_BITS_PER_WIDE_INT
1980 && ! (i1
== ~0 && i0
< 0))
1982 else if (width
> 2 * HOST_BITS_PER_WIDE_INT
)
1983 /* We cannot represent this value as a constant. */
1986 /* If this would be an entire word for the target, but is not for
1987 the host, then sign-extend on the host so that the number will look
1988 the same way on the host that it would on the target.
1990 For example, when building a 64 bit alpha hosted 32 bit sparc
1991 targeted compiler, then we want the 32 bit unsigned value -1 to be
1992 represented as a 64 bit value -1, and not as 0x00000000ffffffff.
1993 The later confuses the sparc backend. */
1995 if (width
< HOST_BITS_PER_WIDE_INT
1996 && (i0
& ((HOST_WIDE_INT
) 1 << (width
- 1))))
1997 i0
|= ((HOST_WIDE_INT
) (-1) << width
);
1999 /* If MODE fits within HOST_BITS_PER_WIDE_INT, always use a CONST_INT.
2001 ??? Strictly speaking, this is wrong if we create a CONST_INT
2002 for a large unsigned constant with the size of MODE being
2003 HOST_BITS_PER_WIDE_INT and later try to interpret that constant in a
2004 wider mode. In that case we will mis-interpret it as a negative
2007 Unfortunately, the only alternative is to make a CONST_DOUBLE
2008 for any constant in any mode if it is an unsigned constant larger
2009 than the maximum signed integer in an int on the host. However,
2010 doing this will break everyone that always expects to see a CONST_INT
2011 for SImode and smaller.
2013 We have always been making CONST_INTs in this case, so nothing new
2016 if (width
<= HOST_BITS_PER_WIDE_INT
)
2017 i1
= (i0
< 0) ? ~(HOST_WIDE_INT
) 0 : 0;
2019 /* If this integer fits in one word, return a CONST_INT. */
2020 if ((i1
== 0 && i0
>= 0)
2021 || (i1
== ~0 && i0
< 0))
2022 return GEN_INT (i0
);
2024 /* We use VOIDmode for integers. */
2028 /* Search the chain for an existing CONST_DOUBLE with the right value.
2029 If one is found, return it. */
2031 for (r
= const_double_chain
; r
; r
= CONST_DOUBLE_CHAIN (r
))
2032 if (CONST_DOUBLE_LOW (r
) == i0
&& CONST_DOUBLE_HIGH (r
) == i1
2033 && GET_MODE (r
) == mode
)
2036 /* No; make a new one and add it to the chain. */
2037 r
= gen_rtx_CONST_DOUBLE (mode
, const0_rtx
, i0
, i1
);
2039 /* Don't touch const_double_chain if not inside any function. */
2040 if (current_function_decl
!= 0)
2042 CONST_DOUBLE_CHAIN (r
) = const_double_chain
;
2043 const_double_chain
= r
;
2049 /* Return a CONST_DOUBLE for a specified `double' value
2050 and machine mode. */
2053 immed_real_const_1 (d
, mode
)
2055 enum machine_mode mode
;
2057 union real_extract u
;
2060 /* Get the desired `double' value as a sequence of ints
2061 since that is how they are stored in a CONST_DOUBLE. */
2065 /* Detect special cases. But be careful we don't use a CONST_DOUBLE
2066 that's from a parent function since it may be in its constant pool. */
2067 if (REAL_VALUES_IDENTICAL (dconst0
, d
)
2068 && (cfun
== 0 || decl_function_context (current_function_decl
) == 0))
2069 return CONST0_RTX (mode
);
2071 /* Check for NaN first, because some ports (specifically the i386) do not
2072 emit correct ieee-fp code by default, and thus will generate a core
2073 dump here if we pass a NaN to REAL_VALUES_EQUAL and if REAL_VALUES_EQUAL
2074 does a floating point comparison. */
2075 else if ((! REAL_VALUE_ISNAN (d
) && REAL_VALUES_EQUAL (dconst1
, d
))
2077 || decl_function_context (current_function_decl
) == 0))
2078 return CONST1_RTX (mode
);
2080 if (sizeof u
== sizeof (HOST_WIDE_INT
))
2081 return immed_double_const (u
.i
[0], 0, mode
);
2082 if (sizeof u
== 2 * sizeof (HOST_WIDE_INT
))
2083 return immed_double_const (u
.i
[0], u
.i
[1], mode
);
2085 /* The rest of this function handles the case where
2086 a float value requires more than 2 ints of space.
2087 It will be deleted as dead code on machines that don't need it. */
2089 /* Search the chain for an existing CONST_DOUBLE with the right value.
2090 If one is found, return it. */
2092 for (r
= const_double_chain
; r
; r
= CONST_DOUBLE_CHAIN (r
))
2093 if (! memcmp ((char *) &CONST_DOUBLE_LOW (r
), (char *) &u
, sizeof u
)
2094 && GET_MODE (r
) == mode
)
2097 /* No; make a new one and add it to the chain.
2099 We may be called by an optimizer which may be discarding any memory
2100 allocated during its processing (such as combine and loop). However,
2101 we will be leaving this constant on the chain, so we cannot tolerate
2103 r
= rtx_alloc (CONST_DOUBLE
);
2105 memcpy ((char *) &CONST_DOUBLE_LOW (r
), (char *) &u
, sizeof u
);
2107 /* If we aren't inside a function, don't put r on the
2108 const_double_chain. */
2109 if (current_function_decl
!= 0)
2111 CONST_DOUBLE_CHAIN (r
) = const_double_chain
;
2112 const_double_chain
= r
;
2115 CONST_DOUBLE_CHAIN (r
) = NULL_RTX
;
2117 /* Store const0_rtx in CONST_DOUBLE_MEM since this CONST_DOUBLE is on the
2118 chain, but has not been allocated memory. Actual use of CONST_DOUBLE_MEM
2119 is only through force_const_mem. */
2121 CONST_DOUBLE_MEM (r
) = const0_rtx
;
2126 /* Return a CONST_DOUBLE rtx for a value specified by EXP,
2127 which must be a REAL_CST tree node. */
2130 immed_real_const (exp
)
2133 return immed_real_const_1 (TREE_REAL_CST (exp
), TYPE_MODE (TREE_TYPE (exp
)));
2136 /* At the end of a function, forget the memory-constants
2137 previously made for CONST_DOUBLEs. Mark them as not on real_constant_chain.
2138 Also clear out real_constant_chain and clear out all the chain-pointers. */
2141 clear_const_double_mem ()
2143 register rtx r
, next
;
2145 for (r
= const_double_chain
; r
; r
= next
)
2147 next
= CONST_DOUBLE_CHAIN (r
);
2148 CONST_DOUBLE_CHAIN (r
) = 0;
2149 CONST_DOUBLE_MEM (r
) = cc0_rtx
;
2151 const_double_chain
= 0;
2154 /* Given an expression EXP with a constant value,
2155 reduce it to the sum of an assembler symbol and an integer.
2156 Store them both in the structure *VALUE.
2157 Abort if EXP does not reduce. */
2162 HOST_WIDE_INT offset
;
2166 decode_addr_const (exp
, value
)
2168 struct addr_const
*value
;
2170 register tree target
= TREE_OPERAND (exp
, 0);
2171 register int offset
= 0;
2176 if (TREE_CODE (target
) == COMPONENT_REF
2177 && host_integerp (byte_position (TREE_OPERAND (target
, 1)), 0))
2180 offset
+= int_byte_position (TREE_OPERAND (target
, 1));
2181 target
= TREE_OPERAND (target
, 0);
2183 else if (TREE_CODE (target
) == ARRAY_REF
)
2185 offset
+= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (target
)), 1)
2186 * tree_low_cst (TREE_OPERAND (target
, 1), 0));
2187 target
= TREE_OPERAND (target
, 0);
2193 switch (TREE_CODE (target
))
2197 x
= DECL_RTL (target
);
2201 x
= gen_rtx_MEM (FUNCTION_MODE
,
2202 gen_rtx_LABEL_REF (VOIDmode
,
2203 label_rtx (TREE_OPERAND (exp
, 0))));
2211 x
= TREE_CST_RTL (target
);
2218 if (GET_CODE (x
) != MEM
)
2223 value
->offset
= offset
;
2226 enum kind
{ RTX_DOUBLE
, RTX_INT
};
2229 ENUM_BITFIELD(kind
) kind
: 16;
2230 ENUM_BITFIELD(machine_mode
) mode
: 16;
2232 union real_extract du
;
2233 struct addr_const addr
;
2234 struct {HOST_WIDE_INT high
, low
;} di
;
2238 /* Uniquize all constants that appear in memory.
2239 Each constant in memory thus far output is recorded
2240 in `const_hash_table' with a `struct constant_descriptor'
2241 that contains a polish representation of the value of
2244 We cannot store the trees in the hash table
2245 because the trees may be temporary. */
2247 struct constant_descriptor
2249 struct constant_descriptor
*next
;
2252 /* Make sure the data is reasonably aligned. */
2255 unsigned char contents
[1];
2256 #ifdef HAVE_LONG_DOUBLE
2265 #define MAX_HASH_TABLE 1009
2266 static struct constant_descriptor
*const_hash_table
[MAX_HASH_TABLE
];
2268 #define STRHASH(x) ((hashval_t)((long)(x) >> 3))
2270 struct deferred_string
2277 static htab_t const_str_htab
;
2279 /* Mark a const_hash_table descriptor for GC. */
2282 mark_const_hash_entry (ptr
)
2285 struct constant_descriptor
*desc
= * (struct constant_descriptor
**) ptr
;
2289 ggc_mark_rtx (desc
->rtl
);
2294 /* Mark the hash-table element X (which is really a pointer to an
2295 struct deferred_string *). */
2298 mark_const_str_htab_1 (x
, data
)
2300 void *data ATTRIBUTE_UNUSED
;
2302 ggc_mark_tree (((struct deferred_string
*) *x
)->exp
);
2306 /* Mark a const_str_htab for GC. */
2309 mark_const_str_htab (htab
)
2312 htab_traverse (*((htab_t
*) htab
), mark_const_str_htab_1
, NULL
);
2315 /* Returns a hash code for X (which is a really a
2316 struct deferred_string *). */
2319 const_str_htab_hash (x
)
2322 return STRHASH (((const struct deferred_string
*) x
)->label
);
2325 /* Returns non-zero if the value represented by X (which is really a
2326 struct deferred_string *) is the same as that given by Y
2327 (which is really a char *). */
2330 const_str_htab_eq (x
, y
)
2334 return (((const struct deferred_string
*) x
)->label
== (const char *) y
);
2337 /* Delete the hash table entry dfsp. */
2340 const_str_htab_del (dfsp
)
2346 /* Compute a hash code for a constant expression. */
2352 register const char *p
;
2353 register int len
, hi
, i
;
2354 register enum tree_code code
= TREE_CODE (exp
);
2356 /* Either set P and LEN to the address and len of something to hash and
2357 exit the switch or return a value. */
2362 p
= (char *) &TREE_INT_CST (exp
);
2363 len
= sizeof TREE_INT_CST (exp
);
2367 p
= (char *) &TREE_REAL_CST (exp
);
2368 len
= sizeof TREE_REAL_CST (exp
);
2372 p
= TREE_STRING_POINTER (exp
);
2373 len
= TREE_STRING_LENGTH (exp
);
2377 return (const_hash (TREE_REALPART (exp
)) * 5
2378 + const_hash (TREE_IMAGPART (exp
)));
2381 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2385 len
= int_size_in_bytes (TREE_TYPE (exp
));
2386 tmp
= (char *) alloca (len
);
2387 get_set_constructor_bytes (exp
, (unsigned char *) tmp
, len
);
2395 /* For record type, include the type in the hashing.
2396 We do not do so for array types
2397 because (1) the sizes of the elements are sufficient
2398 and (2) distinct array types can have the same constructor.
2399 Instead, we include the array size because the constructor could
2401 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2402 hi
= ((unsigned long) TREE_TYPE (exp
) & ((1 << HASHBITS
) - 1))
2405 hi
= ((5 + int_size_in_bytes (TREE_TYPE (exp
)))
2406 & ((1 << HASHBITS
) - 1)) % MAX_HASH_TABLE
;
2408 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2409 if (TREE_VALUE (link
))
2411 = (hi
* 603 + const_hash (TREE_VALUE (link
))) % MAX_HASH_TABLE
;
2418 struct addr_const value
;
2420 decode_addr_const (exp
, &value
);
2421 if (GET_CODE (value
.base
) == SYMBOL_REF
)
2423 /* Don't hash the address of the SYMBOL_REF;
2424 only use the offset and the symbol name. */
2426 p
= XSTR (value
.base
, 0);
2427 for (i
= 0; p
[i
] != 0; i
++)
2428 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2430 else if (GET_CODE (value
.base
) == LABEL_REF
)
2431 hi
= value
.offset
+ CODE_LABEL_NUMBER (XEXP (value
.base
, 0)) * 13;
2435 hi
&= (1 << HASHBITS
) - 1;
2436 hi
%= MAX_HASH_TABLE
;
2442 return (const_hash (TREE_OPERAND (exp
, 0)) * 9
2443 + const_hash (TREE_OPERAND (exp
, 1)));
2447 case NON_LVALUE_EXPR
:
2448 return const_hash (TREE_OPERAND (exp
, 0)) * 7 + 2;
2451 /* A language specific constant. Just hash the code. */
2452 return (int) code
% MAX_HASH_TABLE
;
2455 /* Compute hashing function */
2457 for (i
= 0; i
< len
; i
++)
2458 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2460 hi
&= (1 << HASHBITS
) - 1;
2461 hi
%= MAX_HASH_TABLE
;
2465 /* Compare a constant expression EXP with a constant-descriptor DESC.
2466 Return 1 if DESC describes a constant with the same value as EXP. */
2469 compare_constant (exp
, desc
)
2471 struct constant_descriptor
*desc
;
2473 return 0 != compare_constant_1 (exp
, desc
->u
.contents
);
2476 /* Compare constant expression EXP with a substring P of a constant descriptor.
2477 If they match, return a pointer to the end of the substring matched.
2478 If they do not match, return 0.
2480 Since descriptors are written in polish prefix notation,
2481 this function can be used recursively to test one operand of EXP
2482 against a subdescriptor, and if it succeeds it returns the
2483 address of the subdescriptor for the next operand. */
2485 static const unsigned char *
2486 compare_constant_1 (exp
, p
)
2488 const unsigned char *p
;
2490 register const unsigned char *strp
;
2492 register enum tree_code code
= TREE_CODE (exp
);
2494 if (code
!= (enum tree_code
) *p
++)
2497 /* Either set STRP, P and LEN to pointers and length to compare and exit the
2498 switch, or return the result of the comparison. */
2503 /* Integer constants are the same only if the same width of type. */
2504 if (*p
++ != TYPE_PRECISION (TREE_TYPE (exp
)))
2507 strp
= (unsigned char *) &TREE_INT_CST (exp
);
2508 len
= sizeof TREE_INT_CST (exp
);
2512 /* Real constants are the same only if the same width of type. */
2513 if (*p
++ != TYPE_PRECISION (TREE_TYPE (exp
)))
2516 strp
= (unsigned char *) &TREE_REAL_CST (exp
);
2517 len
= sizeof TREE_REAL_CST (exp
);
2521 if (flag_writable_strings
)
2524 if ((enum machine_mode
) *p
++ != TYPE_MODE (TREE_TYPE (exp
)))
2527 strp
= (const unsigned char *)TREE_STRING_POINTER (exp
);
2528 len
= TREE_STRING_LENGTH (exp
);
2529 if (memcmp ((char *) &TREE_STRING_LENGTH (exp
), p
,
2530 sizeof TREE_STRING_LENGTH (exp
)))
2533 p
+= sizeof TREE_STRING_LENGTH (exp
);
2537 p
= compare_constant_1 (TREE_REALPART (exp
), p
);
2541 return compare_constant_1 (TREE_IMAGPART (exp
), p
);
2544 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2546 int xlen
= len
= int_size_in_bytes (TREE_TYPE (exp
));
2547 unsigned char *tmp
= (unsigned char *) alloca (len
);
2549 get_set_constructor_bytes (exp
, tmp
, len
);
2550 strp
= (unsigned char *) tmp
;
2551 if (memcmp ((char *) &xlen
, p
, sizeof xlen
))
2560 int length
= list_length (CONSTRUCTOR_ELTS (exp
));
2562 enum machine_mode mode
= TYPE_MODE (TREE_TYPE (exp
));
2563 int have_purpose
= 0;
2565 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2566 if (TREE_PURPOSE (link
))
2569 if (memcmp ((char *) &length
, p
, sizeof length
))
2574 /* For record constructors, insist that the types match.
2575 For arrays, just verify both constructors are for arrays.
2576 Then insist that either both or none have any TREE_PURPOSE
2578 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2579 type
= TREE_TYPE (exp
);
2583 if (memcmp ((char *) &type
, p
, sizeof type
))
2586 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2588 if (memcmp ((char *) &mode
, p
, sizeof mode
))
2596 if (memcmp ((char *) &have_purpose
, p
, sizeof have_purpose
))
2599 p
+= sizeof have_purpose
;
2601 /* For arrays, insist that the size in bytes match. */
2602 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2604 HOST_WIDE_INT size
= int_size_in_bytes (TREE_TYPE (exp
));
2606 if (memcmp ((char *) &size
, p
, sizeof size
))
2612 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2614 if (TREE_VALUE (link
))
2616 if ((p
= compare_constant_1 (TREE_VALUE (link
), p
)) == 0)
2623 if (memcmp ((char *) &zero
, p
, sizeof zero
))
2629 if (TREE_PURPOSE (link
)
2630 && TREE_CODE (TREE_PURPOSE (link
)) == FIELD_DECL
)
2632 if (memcmp ((char *) &TREE_PURPOSE (link
), p
,
2633 sizeof TREE_PURPOSE (link
)))
2636 p
+= sizeof TREE_PURPOSE (link
);
2638 else if (TREE_PURPOSE (link
))
2640 if ((p
= compare_constant_1 (TREE_PURPOSE (link
), p
)) == 0)
2643 else if (have_purpose
)
2647 if (memcmp ((char *) &zero
, p
, sizeof zero
))
2659 struct addr_const value
;
2661 decode_addr_const (exp
, &value
);
2662 strp
= (unsigned char *) &value
.offset
;
2663 len
= sizeof value
.offset
;
2664 /* Compare the offset. */
2666 if (*p
++ != *strp
++)
2669 /* Compare symbol name. */
2670 strp
= (const unsigned char *) XSTR (value
.base
, 0);
2671 len
= strlen ((const char *) strp
) + 1;
2678 p
= compare_constant_1 (TREE_OPERAND (exp
, 0), p
);
2682 return compare_constant_1 (TREE_OPERAND (exp
, 1), p
);
2686 case NON_LVALUE_EXPR
:
2687 return compare_constant_1 (TREE_OPERAND (exp
, 0), p
);
2690 if (lang_expand_constant
)
2692 exp
= (*lang_expand_constant
) (exp
);
2693 return compare_constant_1 (exp
, p
);
2698 /* Compare constant contents. */
2700 if (*p
++ != *strp
++)
2706 /* Construct a constant descriptor for the expression EXP.
2707 It is up to the caller to enter the descriptor in the hash table. */
2709 static struct constant_descriptor
*
2710 record_constant (exp
)
2713 struct constant_descriptor
*next
= 0;
2718 /* Make a struct constant_descriptor. The first three pointers will
2719 be filled in later. Here we just leave space for them. */
2721 obstack_grow (&permanent_obstack
, (char *) &next
, sizeof next
);
2722 obstack_grow (&permanent_obstack
, (char *) &label
, sizeof label
);
2723 obstack_grow (&permanent_obstack
, (char *) &rtl
, sizeof rtl
);
2725 /* Align the descriptor for the data payload. */
2726 pad
= (offsetof (struct constant_descriptor
, u
)
2727 - offsetof(struct constant_descriptor
, rtl
)
2728 - sizeof(next
->rtl
));
2730 obstack_blank (&permanent_obstack
, pad
);
2732 record_constant_1 (exp
);
2733 return (struct constant_descriptor
*) obstack_finish (&permanent_obstack
);
2736 /* Add a description of constant expression EXP
2737 to the object growing in `permanent_obstack'.
2738 No need to return its address; the caller will get that
2739 from the obstack when the object is complete. */
2742 record_constant_1 (exp
)
2745 register const unsigned char *strp
;
2747 register enum tree_code code
= TREE_CODE (exp
);
2749 obstack_1grow (&permanent_obstack
, (unsigned int) code
);
2754 obstack_1grow (&permanent_obstack
, TYPE_PRECISION (TREE_TYPE (exp
)));
2755 strp
= (unsigned char *) &TREE_INT_CST (exp
);
2756 len
= sizeof TREE_INT_CST (exp
);
2760 obstack_1grow (&permanent_obstack
, TYPE_PRECISION (TREE_TYPE (exp
)));
2761 strp
= (unsigned char *) &TREE_REAL_CST (exp
);
2762 len
= sizeof TREE_REAL_CST (exp
);
2766 if (flag_writable_strings
)
2769 obstack_1grow (&permanent_obstack
, TYPE_MODE (TREE_TYPE (exp
)));
2770 strp
= (const unsigned char *) TREE_STRING_POINTER (exp
);
2771 len
= TREE_STRING_LENGTH (exp
);
2772 obstack_grow (&permanent_obstack
, (char *) &TREE_STRING_LENGTH (exp
),
2773 sizeof TREE_STRING_LENGTH (exp
));
2777 record_constant_1 (TREE_REALPART (exp
));
2778 record_constant_1 (TREE_IMAGPART (exp
));
2782 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2784 int nbytes
= int_size_in_bytes (TREE_TYPE (exp
));
2785 obstack_grow (&permanent_obstack
, &nbytes
, sizeof (nbytes
));
2786 obstack_blank (&permanent_obstack
, nbytes
);
2787 get_set_constructor_bytes
2788 (exp
, (unsigned char *) permanent_obstack
.next_free
-nbytes
,
2795 int length
= list_length (CONSTRUCTOR_ELTS (exp
));
2796 enum machine_mode mode
= TYPE_MODE (TREE_TYPE (exp
));
2798 int have_purpose
= 0;
2800 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2801 if (TREE_PURPOSE (link
))
2804 obstack_grow (&permanent_obstack
, (char *) &length
, sizeof length
);
2806 /* For record constructors, insist that the types match.
2807 For arrays, just verify both constructors are for arrays
2808 of the same mode. Then insist that either both or none
2809 have any TREE_PURPOSE values. */
2810 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2811 type
= TREE_TYPE (exp
);
2815 obstack_grow (&permanent_obstack
, (char *) &type
, sizeof type
);
2816 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2817 obstack_grow (&permanent_obstack
, &mode
, sizeof mode
);
2819 obstack_grow (&permanent_obstack
, (char *) &have_purpose
,
2820 sizeof have_purpose
);
2822 /* For arrays, insist that the size in bytes match. */
2823 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2825 HOST_WIDE_INT size
= int_size_in_bytes (TREE_TYPE (exp
));
2826 obstack_grow (&permanent_obstack
, (char *) &size
, sizeof size
);
2829 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2831 if (TREE_VALUE (link
))
2832 record_constant_1 (TREE_VALUE (link
));
2837 obstack_grow (&permanent_obstack
,
2838 (char *) &zero
, sizeof zero
);
2841 if (TREE_PURPOSE (link
)
2842 && TREE_CODE (TREE_PURPOSE (link
)) == FIELD_DECL
)
2843 obstack_grow (&permanent_obstack
,
2844 (char *) &TREE_PURPOSE (link
),
2845 sizeof TREE_PURPOSE (link
));
2846 else if (TREE_PURPOSE (link
))
2847 record_constant_1 (TREE_PURPOSE (link
));
2848 else if (have_purpose
)
2852 obstack_grow (&permanent_obstack
,
2853 (char *) &zero
, sizeof zero
);
2861 struct addr_const value
;
2863 decode_addr_const (exp
, &value
);
2864 /* Record the offset. */
2865 obstack_grow (&permanent_obstack
,
2866 (char *) &value
.offset
, sizeof value
.offset
);
2868 switch (GET_CODE (value
.base
))
2871 /* Record the symbol name. */
2872 obstack_grow (&permanent_obstack
, XSTR (value
.base
, 0),
2873 strlen (XSTR (value
.base
, 0)) + 1);
2876 /* Record the address of the CODE_LABEL. It may not have
2877 been emitted yet, so it's UID may be zero. But pointer
2878 identity is good enough. */
2879 obstack_grow (&permanent_obstack
, &XEXP (value
.base
, 0),
2891 record_constant_1 (TREE_OPERAND (exp
, 0));
2892 record_constant_1 (TREE_OPERAND (exp
, 1));
2897 case NON_LVALUE_EXPR
:
2898 record_constant_1 (TREE_OPERAND (exp
, 0));
2902 if (lang_expand_constant
)
2904 exp
= (*lang_expand_constant
) (exp
);
2905 record_constant_1 (exp
);
2910 /* Record constant contents. */
2911 obstack_grow (&permanent_obstack
, strp
, len
);
2914 /* Record a list of constant expressions that were passed to
2915 output_constant_def but that could not be output right away. */
2917 struct deferred_constant
2919 struct deferred_constant
*next
;
2925 static struct deferred_constant
*deferred_constants
;
2927 /* Another list of constants which should be output after the
2929 static struct deferred_constant
*after_function_constants
;
2931 /* Nonzero means defer output of addressed subconstants
2932 (i.e., those for which output_constant_def is called.) */
2933 static int defer_addressed_constants_flag
;
2935 /* Start deferring output of subconstants. */
2938 defer_addressed_constants ()
2940 defer_addressed_constants_flag
++;
2943 /* Stop deferring output of subconstants,
2944 and output now all those that have been deferred. */
2947 output_deferred_addressed_constants ()
2949 struct deferred_constant
*p
, *next
;
2951 defer_addressed_constants_flag
--;
2953 if (defer_addressed_constants_flag
> 0)
2956 for (p
= deferred_constants
; p
; p
= next
)
2958 output_constant_def_contents (p
->exp
, p
->reloc
, p
->labelno
);
2963 deferred_constants
= 0;
2966 /* Output any constants which should appear after a function. */
2969 output_after_function_constants ()
2971 struct deferred_constant
*p
, *next
;
2973 for (p
= after_function_constants
; p
; p
= next
)
2975 output_constant_def_contents (p
->exp
, p
->reloc
, p
->labelno
);
2980 after_function_constants
= 0;
2983 /* Make a copy of the whole tree structure for a constant.
2984 This handles the same types of nodes that compare_constant
2985 and record_constant handle. */
2991 switch (TREE_CODE (exp
))
2994 /* For ADDR_EXPR, we do not want to copy the decl whose address
2995 is requested. We do want to copy constants though. */
2996 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, 0))) == 'c')
2997 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2998 copy_constant (TREE_OPERAND (exp
, 0)));
3000 return copy_node (exp
);
3005 return copy_node (exp
);
3008 return build_complex (TREE_TYPE (exp
),
3009 copy_constant (TREE_REALPART (exp
)),
3010 copy_constant (TREE_IMAGPART (exp
)));
3014 return build (TREE_CODE (exp
), TREE_TYPE (exp
),
3015 copy_constant (TREE_OPERAND (exp
, 0)),
3016 copy_constant (TREE_OPERAND (exp
, 1)));
3020 case NON_LVALUE_EXPR
:
3021 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
3022 copy_constant (TREE_OPERAND (exp
, 0)));
3026 tree copy
= copy_node (exp
);
3027 tree list
= copy_list (CONSTRUCTOR_ELTS (exp
));
3030 CONSTRUCTOR_ELTS (copy
) = list
;
3031 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
3032 TREE_VALUE (tail
) = copy_constant (TREE_VALUE (tail
));
3033 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
3034 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
3035 TREE_PURPOSE (tail
) = copy_constant (TREE_PURPOSE (tail
));
3045 /* Return an rtx representing a reference to constant data in memory
3046 for the constant expression EXP.
3048 If assembler code for such a constant has already been output,
3049 return an rtx to refer to it.
3050 Otherwise, output such a constant in memory (or defer it for later)
3051 and generate an rtx for it.
3053 If DEFER is non-zero, the output of string constants can be deferred
3054 and output only if referenced in the function after all optimizations.
3056 The TREE_CST_RTL of EXP is set up to point to that rtx.
3057 The const_hash_table records which constants already have label strings. */
3060 output_constant_def (exp
, defer
)
3065 register struct constant_descriptor
*desc
;
3066 struct deferred_string
**defstr
;
3070 int after_function
= 0;
3073 if (TREE_CST_RTL (exp
))
3074 return TREE_CST_RTL (exp
);
3076 /* Make sure any other constants whose addresses appear in EXP
3077 are assigned label numbers. */
3079 reloc
= output_addressed_constants (exp
);
3081 /* Compute hash code of EXP. Search the descriptors for that hash code
3082 to see if any of them describes EXP. If yes, the descriptor records
3083 the label number already assigned. */
3085 hash
= const_hash (exp
) % MAX_HASH_TABLE
;
3087 for (desc
= const_hash_table
[hash
]; desc
; desc
= desc
->next
)
3088 if (compare_constant (exp
, desc
))
3093 /* No constant equal to EXP is known to have been output.
3094 Make a constant descriptor to enter EXP in the hash table.
3095 Assign the label number and record it in the descriptor for
3096 future calls to this function to find. */
3098 /* Create a string containing the label name, in LABEL. */
3099 labelno
= const_labelno
++;
3100 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", labelno
);
3102 desc
= record_constant (exp
);
3103 desc
->next
= const_hash_table
[hash
];
3104 desc
->label
= ggc_strdup (label
);
3105 const_hash_table
[hash
] = desc
;
3107 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
3109 = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp
)),
3110 gen_rtx_SYMBOL_REF (Pmode
, desc
->label
));
3112 set_mem_attributes (desc
->rtl
, exp
, 1);
3117 TREE_CST_RTL (exp
) = desc
->rtl
;
3119 /* Optionally set flags or add text to the name to record information
3120 such as that it is a function name. If the name is changed, the macro
3121 ASM_OUTPUT_LABELREF will have to know how to strip this information. */
3122 #ifdef ENCODE_SECTION_INFO
3123 /* A previously-processed constant would already have section info
3127 ENCODE_SECTION_INFO (exp
);
3128 desc
->rtl
= TREE_CST_RTL (exp
);
3129 desc
->label
= XSTR (XEXP (desc
->rtl
, 0), 0);
3133 #ifdef CONSTANT_AFTER_FUNCTION_P
3134 if (current_function_decl
!= 0
3135 && CONSTANT_AFTER_FUNCTION_P (exp
))
3140 && STRING_POOL_ADDRESS_P (XEXP (desc
->rtl
, 0))
3141 && (!defer
|| defer_addressed_constants_flag
|| after_function
))
3143 defstr
= (struct deferred_string
**)
3144 htab_find_slot_with_hash (const_str_htab
, desc
->label
,
3145 STRHASH (desc
->label
), NO_INSERT
);
3148 /* If the string is currently deferred but we need to output it now,
3149 remove it from deferred string hash table. */
3151 labelno
= (*defstr
)->labelno
;
3152 STRING_POOL_ADDRESS_P (XEXP (desc
->rtl
, 0)) = 0;
3153 htab_clear_slot (const_str_htab
, (void **) defstr
);
3157 /* If this is the first time we've seen this particular constant,
3158 output it (or defer its output for later). */
3161 if (defer_addressed_constants_flag
|| after_function
)
3163 struct deferred_constant
*p
;
3164 p
= (struct deferred_constant
*) xmalloc (sizeof (struct deferred_constant
));
3166 p
->exp
= copy_constant (exp
);
3168 p
->labelno
= labelno
;
3171 p
->next
= after_function_constants
;
3172 after_function_constants
= p
;
3176 p
->next
= deferred_constants
;
3177 deferred_constants
= p
;
3182 /* Do no output if -fsyntax-only. */
3183 if (! flag_syntax_only
)
3185 if (TREE_CODE (exp
) != STRING_CST
3187 || flag_writable_strings
3188 || (defstr
= (struct deferred_string
**)
3189 htab_find_slot_with_hash (const_str_htab
,
3191 STRHASH (desc
->label
),
3193 output_constant_def_contents (exp
, reloc
, labelno
);
3196 struct deferred_string
*p
;
3198 p
= (struct deferred_string
*)
3199 xmalloc (sizeof (struct deferred_string
));
3201 p
->exp
= copy_constant (exp
);
3202 p
->label
= desc
->label
;
3203 p
->labelno
= labelno
;
3205 STRING_POOL_ADDRESS_P (XEXP (desc
->rtl
, 0)) = 1;
3211 return TREE_CST_RTL (exp
);
3214 /* Now output assembler code to define the label for EXP,
3215 and follow it with the data of EXP. */
3218 output_constant_def_contents (exp
, reloc
, labelno
)
3225 if (IN_NAMED_SECTION (exp
))
3226 named_section (exp
, NULL
, reloc
);
3229 /* First switch to text section, except for writable strings. */
3230 #ifdef SELECT_SECTION
3231 SELECT_SECTION (exp
, reloc
);
3233 if (((TREE_CODE (exp
) == STRING_CST
) && flag_writable_strings
)
3234 || (flag_pic
&& reloc
))
3237 readonly_data_section ();
3241 /* Align the location counter as required by EXP's data type. */
3242 align
= TYPE_ALIGN (TREE_TYPE (exp
));
3243 #ifdef CONSTANT_ALIGNMENT
3244 align
= CONSTANT_ALIGNMENT (exp
, align
);
3247 if (align
> BITS_PER_UNIT
)
3248 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
3250 /* Output the label itself. */
3251 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LC", labelno
);
3253 /* Output the value of EXP. */
3254 output_constant (exp
,
3255 (TREE_CODE (exp
) == STRING_CST
3256 ? TREE_STRING_LENGTH (exp
)
3257 : int_size_in_bytes (TREE_TYPE (exp
))));
3261 /* Structure to represent sufficient information about a constant so that
3262 it can be output when the constant pool is output, so that function
3263 integration can be done, and to simplify handling on machines that reference
3264 constant pool as base+displacement. */
3266 struct pool_constant
3268 struct constant_descriptor
*desc
;
3269 struct pool_constant
*next
, *next_sym
;
3272 enum machine_mode mode
;
3279 /* Hash code for a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true.
3280 The argument is XSTR (... , 0) */
3282 #define SYMHASH(LABEL) \
3283 ((((unsigned long) (LABEL)) & ((1 << HASHBITS) - 1)) % MAX_RTX_HASH_TABLE)
3285 /* Initialize constant pool hashing for a new function. */
3288 init_varasm_status (f
)
3291 struct varasm_status
*p
;
3292 p
= (struct varasm_status
*) xmalloc (sizeof (struct varasm_status
));
3294 p
->x_const_rtx_hash_table
3295 = ((struct constant_descriptor
**)
3296 xcalloc (MAX_RTX_HASH_TABLE
, sizeof (struct constant_descriptor
*)));
3297 p
->x_const_rtx_sym_hash_table
3298 = ((struct pool_constant
**)
3299 xcalloc (MAX_RTX_HASH_TABLE
, sizeof (struct pool_constant
*)));
3301 p
->x_first_pool
= p
->x_last_pool
= 0;
3302 p
->x_pool_offset
= 0;
3303 p
->x_const_double_chain
= 0;
3306 /* Mark PC for GC. */
3309 mark_pool_constant (pc
)
3310 struct pool_constant
*pc
;
3315 ggc_mark_rtx (pc
->constant
);
3320 /* Mark P for GC. */
3323 mark_varasm_status (p
)
3324 struct varasm_status
*p
;
3329 mark_pool_constant (p
->x_first_pool
);
3330 ggc_mark_rtx (p
->x_const_double_chain
);
3333 /* Clear out all parts of the state in F that can safely be discarded
3334 after the function has been compiled, to let garbage collection
3335 reclaim the memory. */
3338 free_varasm_status (f
)
3341 struct varasm_status
*p
;
3346 /* Clear out the hash tables. */
3347 for (i
= 0; i
< MAX_RTX_HASH_TABLE
; ++i
)
3349 struct constant_descriptor
* cd
;
3351 cd
= p
->x_const_rtx_hash_table
[i
];
3353 struct constant_descriptor
* next
= cd
->next
;
3359 free (p
->x_const_rtx_hash_table
);
3360 free (p
->x_const_rtx_sym_hash_table
);
3366 /* Express an rtx for a constant integer (perhaps symbolic)
3367 as the sum of a symbol or label plus an explicit integer.
3368 They are stored into VALUE. */
3371 decode_rtx_const (mode
, x
, value
)
3372 enum machine_mode mode
;
3374 struct rtx_const
*value
;
3376 /* Clear the whole structure, including any gaps. */
3377 memset (value
, 0, sizeof (struct rtx_const
));
3379 value
->kind
= RTX_INT
; /* Most usual kind. */
3382 switch (GET_CODE (x
))
3385 value
->kind
= RTX_DOUBLE
;
3386 if (GET_MODE (x
) != VOIDmode
)
3388 value
->mode
= GET_MODE (x
);
3389 memcpy ((char *) &value
->un
.du
,
3390 (char *) &CONST_DOUBLE_LOW (x
), sizeof value
->un
.du
);
3394 value
->un
.di
.low
= CONST_DOUBLE_LOW (x
);
3395 value
->un
.di
.high
= CONST_DOUBLE_HIGH (x
);
3400 value
->un
.addr
.offset
= INTVAL (x
);
3406 value
->un
.addr
.base
= x
;
3411 if (GET_CODE (x
) == PLUS
&& GET_CODE (XEXP (x
, 1)) == CONST_INT
)
3413 value
->un
.addr
.base
= XEXP (x
, 0);
3414 value
->un
.addr
.offset
= INTVAL (XEXP (x
, 1));
3416 else if (GET_CODE (x
) == MINUS
&& GET_CODE (XEXP (x
, 1)) == CONST_INT
)
3418 value
->un
.addr
.base
= XEXP (x
, 0);
3419 value
->un
.addr
.offset
= - INTVAL (XEXP (x
, 1));
3423 value
->un
.addr
.base
= x
;
3424 value
->un
.addr
.offset
= 0;
3432 if (value
->kind
== RTX_INT
&& value
->un
.addr
.base
!= 0)
3433 switch (GET_CODE (value
->un
.addr
.base
))
3436 /* Use the string's address, not the SYMBOL_REF's address,
3437 for the sake of addresses of library routines. */
3438 value
->un
.addr
.base
= (rtx
) XSTR (value
->un
.addr
.base
, 0);
3442 /* For a LABEL_REF, compare labels. */
3443 value
->un
.addr
.base
= XEXP (value
->un
.addr
.base
, 0);
3450 /* Given a MINUS expression, simplify it if both sides
3451 include the same symbol. */
3454 simplify_subtraction (x
)
3457 struct rtx_const val0
, val1
;
3459 decode_rtx_const (GET_MODE (x
), XEXP (x
, 0), &val0
);
3460 decode_rtx_const (GET_MODE (x
), XEXP (x
, 1), &val1
);
3462 if (val0
.un
.addr
.base
== val1
.un
.addr
.base
)
3463 return GEN_INT (val0
.un
.addr
.offset
- val1
.un
.addr
.offset
);
3467 /* Compute a hash code for a constant RTL expression. */
3470 const_hash_rtx (mode
, x
)
3471 enum machine_mode mode
;
3477 struct rtx_const value
;
3478 decode_rtx_const (mode
, x
, &value
);
3480 /* Compute hashing function */
3482 for (i
= 0; i
< sizeof value
/ sizeof (int); i
++)
3483 hi
+= ((int *) &value
)[i
];
3485 hi
&= (1 << HASHBITS
) - 1;
3486 hi
%= MAX_RTX_HASH_TABLE
;
3490 /* Compare a constant rtl object X with a constant-descriptor DESC.
3491 Return 1 if DESC describes a constant with the same value as X. */
3494 compare_constant_rtx (mode
, x
, desc
)
3495 enum machine_mode mode
;
3497 struct constant_descriptor
*desc
;
3499 register int *p
= (int *) desc
->u
.contents
;
3502 struct rtx_const value
;
3504 decode_rtx_const (mode
, x
, &value
);
3505 strp
= (int *) &value
;
3506 len
= sizeof value
/ sizeof (int);
3508 /* Compare constant contents. */
3510 if (*p
++ != *strp
++)
3516 /* Construct a constant descriptor for the rtl-expression X.
3517 It is up to the caller to enter the descriptor in the hash table. */
3519 static struct constant_descriptor
*
3520 record_constant_rtx (mode
, x
)
3521 enum machine_mode mode
;
3524 struct constant_descriptor
*ptr
;
3526 ptr
= ((struct constant_descriptor
*)
3527 xcalloc (1, (offsetof (struct constant_descriptor
, u
)
3528 + sizeof (struct rtx_const
))));
3529 decode_rtx_const (mode
, x
, (struct rtx_const
*) ptr
->u
.contents
);
3534 /* Given a constant rtx X, make (or find) a memory constant for its value
3535 and return a MEM rtx to refer to it in memory. */
3538 force_const_mem (mode
, x
)
3539 enum machine_mode mode
;
3543 register struct constant_descriptor
*desc
;
3545 const char *found
= 0;
3548 /* If we want this CONST_DOUBLE in the same mode as it is in memory
3549 (this will always be true for floating CONST_DOUBLEs that have been
3550 placed in memory, but not for VOIDmode (integer) CONST_DOUBLEs),
3551 use the previous copy. Otherwise, make a new one. Note that in
3552 the unlikely event that this same CONST_DOUBLE is used in two different
3553 modes in an alternating fashion, we will allocate a lot of different
3554 memory locations, but this should be extremely rare. */
3556 if (GET_CODE (x
) == CONST_DOUBLE
3557 && GET_CODE (CONST_DOUBLE_MEM (x
)) == MEM
3558 && GET_MODE (CONST_DOUBLE_MEM (x
)) == mode
)
3559 return CONST_DOUBLE_MEM (x
);
3561 /* Compute hash code of X. Search the descriptors for that hash code
3562 to see if any of them describes X. If yes, the descriptor records
3563 the label number already assigned. */
3565 hash
= const_hash_rtx (mode
, x
);
3567 for (desc
= const_rtx_hash_table
[hash
]; desc
; desc
= desc
->next
)
3568 if (compare_constant_rtx (mode
, x
, desc
))
3570 found
= desc
->label
;
3576 register struct pool_constant
*pool
;
3579 /* No constant equal to X is known to have been output.
3580 Make a constant descriptor to enter X in the hash table.
3581 Assign the label number and record it in the descriptor for
3582 future calls to this function to find. */
3584 desc
= record_constant_rtx (mode
, x
);
3585 desc
->next
= const_rtx_hash_table
[hash
];
3586 const_rtx_hash_table
[hash
] = desc
;
3588 /* Align the location counter as required by EXP's data type. */
3589 align
= (mode
== VOIDmode
) ? UNITS_PER_WORD
: GET_MODE_SIZE (mode
);
3590 if (align
> BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
3591 align
= BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
;
3592 #ifdef CONSTANT_ALIGNMENT
3593 align
= CONSTANT_ALIGNMENT (make_tree (type_for_mode (mode
, 0), x
),
3594 align
* BITS_PER_UNIT
) / BITS_PER_UNIT
;
3597 pool_offset
+= align
- 1;
3598 pool_offset
&= ~ (align
- 1);
3600 if (GET_CODE (x
) == LABEL_REF
)
3601 LABEL_PRESERVE_P (XEXP (x
, 0)) = 1;
3603 /* Allocate a pool constant descriptor, fill it in, and chain it in. */
3605 pool
= (struct pool_constant
*) ggc_alloc (sizeof (struct pool_constant
));
3609 pool
->labelno
= const_labelno
;
3610 pool
->align
= align
;
3611 pool
->offset
= pool_offset
;
3618 last_pool
->next
= pool
;
3621 pool_offset
+= GET_MODE_SIZE (mode
);
3623 /* Create a string containing the label name, in LABEL. */
3624 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
3628 desc
->label
= found
= ggc_strdup (label
);
3630 /* Add label to symbol hash table. */
3631 hash
= SYMHASH (found
);
3632 pool
->label
= found
;
3633 pool
->next_sym
= const_rtx_sym_hash_table
[hash
];
3634 const_rtx_sym_hash_table
[hash
] = pool
;
3637 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
3639 def
= gen_rtx_MEM (mode
, gen_rtx_SYMBOL_REF (Pmode
, found
));
3640 set_mem_attributes (def
, type_for_mode (mode
, 0), 1);
3641 RTX_UNCHANGING_P (def
) = 1;
3643 /* Mark the symbol_ref as belonging to this constants pool. */
3644 CONSTANT_POOL_ADDRESS_P (XEXP (def
, 0)) = 1;
3645 current_function_uses_const_pool
= 1;
3647 if (GET_CODE (x
) == CONST_DOUBLE
)
3649 if (CONST_DOUBLE_MEM (x
) == cc0_rtx
)
3651 CONST_DOUBLE_CHAIN (x
) = const_double_chain
;
3652 const_double_chain
= x
;
3654 CONST_DOUBLE_MEM (x
) = def
;
3660 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
3661 the corresponding pool_constant structure. */
3663 static struct pool_constant
*
3664 find_pool_constant (f
, addr
)
3668 struct pool_constant
*pool
;
3669 const char *label
= XSTR (addr
, 0);
3671 for (pool
= f
->varasm
->x_const_rtx_sym_hash_table
[SYMHASH (label
)]; pool
;
3672 pool
= pool
->next_sym
)
3673 if (pool
->label
== label
)
3679 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
3682 get_pool_constant (addr
)
3685 return (find_pool_constant (cfun
, addr
))->constant
;
3688 /* Likewise, but for the constant pool of a specific function. */
3691 get_pool_constant_for_function (f
, addr
)
3695 return (find_pool_constant (f
, addr
))->constant
;
3698 /* Similar, return the mode. */
3701 get_pool_mode (addr
)
3704 return (find_pool_constant (cfun
, addr
))->mode
;
3708 get_pool_mode_for_function (f
, addr
)
3712 return (find_pool_constant (f
, addr
))->mode
;
3715 /* Similar, return the offset in the constant pool. */
3718 get_pool_offset (addr
)
3721 return (find_pool_constant (cfun
, addr
))->offset
;
3724 /* Return the size of the constant pool. */
3732 /* Write all the constants in the constant pool. */
3735 output_constant_pool (fnname
, fndecl
)
3736 const char *fnname ATTRIBUTE_UNUSED
;
3737 tree fndecl ATTRIBUTE_UNUSED
;
3739 struct pool_constant
*pool
;
3741 union real_extract u
;
3743 /* It is possible for gcc to call force_const_mem and then to later
3744 discard the instructions which refer to the constant. In such a
3745 case we do not need to output the constant. */
3746 mark_constant_pool ();
3748 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3749 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3752 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3761 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3762 whose CODE_LABEL has been deleted. This can occur if a jump table
3763 is eliminated by optimization. If so, write a constant of zero
3764 instead. Note that this can also happen by turning the
3765 CODE_LABEL into a NOTE. */
3766 /* ??? This seems completely and utterly wrong. Certainly it's
3767 not true for NOTE_INSN_DELETED_LABEL, but I disbelieve proper
3768 functioning even with INSN_DELETED_P and friends. */
3771 switch (GET_CODE (x
))
3774 if (GET_CODE (XEXP (x
, 0)) != PLUS
3775 || GET_CODE (XEXP (XEXP (x
, 0), 0)) != LABEL_REF
)
3777 tmp
= XEXP (XEXP (x
, 0), 0);
3782 if (INSN_DELETED_P (tmp
)
3783 || (GET_CODE (tmp
) == NOTE
3784 && NOTE_LINE_NUMBER (tmp
) == NOTE_INSN_DELETED
))
3795 /* First switch to correct section. */
3796 #ifdef SELECT_RTX_SECTION
3797 SELECT_RTX_SECTION (pool
->mode
, x
);
3799 readonly_data_section ();
3802 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3803 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file
, x
, pool
->mode
,
3804 pool
->align
, pool
->labelno
, done
);
3807 if (pool
->align
> 1)
3808 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (pool
->align
));
3810 /* Output the label. */
3811 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LC", pool
->labelno
);
3813 /* Output the value of the constant itself. */
3814 switch (GET_MODE_CLASS (pool
->mode
))
3817 if (GET_CODE (x
) != CONST_DOUBLE
)
3820 memcpy ((char *) &u
, (char *) &CONST_DOUBLE_LOW (x
), sizeof u
);
3821 assemble_real (u
.d
, pool
->mode
);
3825 case MODE_PARTIAL_INT
:
3826 assemble_integer (x
, GET_MODE_SIZE (pool
->mode
), 1);
3833 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3839 #ifdef ASM_OUTPUT_POOL_EPILOGUE
3840 ASM_OUTPUT_POOL_EPILOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3843 /* Done with this pool. */
3844 first_pool
= last_pool
= 0;
3847 /* Look through the instructions for this function, and mark all the
3848 entries in the constant pool which are actually being used.
3849 Emit used deferred strings. */
3852 mark_constant_pool ()
3855 struct pool_constant
*pool
;
3857 if (first_pool
== 0 && htab_elements (const_str_htab
) == 0)
3860 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3863 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
3865 mark_constants (PATTERN (insn
));
3867 for (insn
= current_function_epilogue_delay_list
;
3869 insn
= XEXP (insn
, 1))
3871 mark_constants (PATTERN (insn
));
3874 /* Look through appropriate parts of X, marking all entries in the
3875 constant pool which are actually being used. Entries that are only
3876 referenced by other constants are also marked as used. Emit
3877 deferred strings that are used. */
3884 register const char *format_ptr
;
3889 if (GET_CODE (x
) == SYMBOL_REF
)
3891 mark_constant (&x
, NULL
);
3894 /* Never search inside a CONST_DOUBLE, because CONST_DOUBLE_MEM may be
3895 a MEM, but does not constitute a use of that MEM. */
3896 else if (GET_CODE (x
) == CONST_DOUBLE
)
3899 /* Insns may appear inside a SEQUENCE. Only check the patterns of
3900 insns, not any notes that may be attached. We don't want to mark
3901 a constant just because it happens to appear in a REG_EQUIV note. */
3904 mark_constants (PATTERN (x
));
3908 format_ptr
= GET_RTX_FORMAT (GET_CODE (x
));
3910 for (i
= 0; i
< GET_RTX_LENGTH (GET_CODE (x
)); i
++)
3912 switch (*format_ptr
++)
3915 mark_constants (XEXP (x
, i
));
3919 if (XVEC (x
, i
) != 0)
3923 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
3924 mark_constants (XVECEXP (x
, i
, j
));
3943 /* Given a SYMBOL_REF CURRENT_RTX, mark it and all constants it refers
3944 to as used. Emit referenced deferred strings. This function can
3945 be used with for_each_rtx () to mark all SYMBOL_REFs in an rtx. */
3948 mark_constant (current_rtx
, data
)
3950 void *data ATTRIBUTE_UNUSED
;
3952 rtx x
= *current_rtx
;
3956 else if (GET_CODE(x
) == CONST_DOUBLE
)
3957 /* Never search inside a CONST_DOUBLE because CONST_DOUBLE_MEM may
3958 be a MEM but does not constitute a use of that MEM. */
3960 else if (GET_CODE (x
) == SYMBOL_REF
)
3962 if (CONSTANT_POOL_ADDRESS_P (x
))
3964 struct pool_constant
*pool
= find_pool_constant (cfun
, x
);
3965 if (pool
->mark
== 0) {
3967 for_each_rtx (&(pool
->constant
), &mark_constant
, NULL
);
3972 else if (STRING_POOL_ADDRESS_P (x
))
3974 struct deferred_string
**defstr
;
3976 defstr
= (struct deferred_string
**)
3977 htab_find_slot_with_hash (const_str_htab
, XSTR (x
, 0),
3978 STRHASH (XSTR (x
, 0)), NO_INSERT
);
3981 struct deferred_string
*p
= *defstr
;
3983 STRING_POOL_ADDRESS_P (x
) = 0;
3984 output_constant_def_contents (p
->exp
, 0, p
->labelno
);
3985 htab_clear_slot (const_str_htab
, (void **) defstr
);
3992 /* Find all the constants whose addresses are referenced inside of EXP,
3993 and make sure assembler code with a label has been output for each one.
3994 Indicate whether an ADDR_EXPR has been encountered. */
3997 output_addressed_constants (exp
)
4002 /* Give the front-end a chance to convert VALUE to something that
4003 looks more like a constant to the back-end. */
4004 if (lang_expand_constant
)
4005 exp
= (*lang_expand_constant
) (exp
);
4007 switch (TREE_CODE (exp
))
4011 register tree constant
= TREE_OPERAND (exp
, 0);
4013 while (TREE_CODE (constant
) == COMPONENT_REF
)
4015 constant
= TREE_OPERAND (constant
, 0);
4018 if (TREE_CODE_CLASS (TREE_CODE (constant
)) == 'c'
4019 || TREE_CODE (constant
) == CONSTRUCTOR
)
4020 /* No need to do anything here
4021 for addresses of variables or functions. */
4022 output_constant_def (constant
, 0);
4029 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
4030 reloc
|= output_addressed_constants (TREE_OPERAND (exp
, 1));
4035 case NON_LVALUE_EXPR
:
4036 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
4042 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
4043 if (TREE_VALUE (link
) != 0)
4044 reloc
|= output_addressed_constants (TREE_VALUE (link
));
4054 /* Return nonzero if VALUE is a valid constant-valued expression
4055 for use in initializing a static variable; one that can be an
4056 element of a "constant" initializer.
4058 Return null_pointer_node if the value is absolute;
4059 if it is relocatable, return the variable that determines the relocation.
4060 We assume that VALUE has been folded as much as possible;
4061 therefore, we do not need to check for such things as
4062 arithmetic-combinations of integers. */
4065 initializer_constant_valid_p (value
, endtype
)
4069 /* Give the front-end a chance to convert VALUE to something that
4070 looks more like a constant to the back-end. */
4071 if (lang_expand_constant
)
4072 value
= (*lang_expand_constant
) (value
);
4074 switch (TREE_CODE (value
))
4077 if ((TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
4078 || TREE_CODE (TREE_TYPE (value
)) == RECORD_TYPE
)
4079 && TREE_CONSTANT (value
)
4080 && CONSTRUCTOR_ELTS (value
))
4082 initializer_constant_valid_p (TREE_VALUE (CONSTRUCTOR_ELTS (value
)),
4085 return TREE_STATIC (value
) ? null_pointer_node
: 0;
4091 return null_pointer_node
;
4094 return staticp (TREE_OPERAND (value
, 0)) ? TREE_OPERAND (value
, 0) : 0;
4096 case NON_LVALUE_EXPR
:
4097 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
4101 /* Allow conversions between pointer types. */
4102 if (POINTER_TYPE_P (TREE_TYPE (value
))
4103 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
4104 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
4106 /* Allow conversions between real types. */
4107 if (FLOAT_TYPE_P (TREE_TYPE (value
))
4108 && FLOAT_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
4109 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
4111 /* Allow length-preserving conversions between integer types. */
4112 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
4113 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
4114 && (TYPE_PRECISION (TREE_TYPE (value
))
4115 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
4116 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
4118 /* Allow conversions between other integer types only if
4120 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
4121 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
4123 tree inner
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4125 if (inner
== null_pointer_node
)
4126 return null_pointer_node
;
4130 /* Allow (int) &foo provided int is as wide as a pointer. */
4131 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
4132 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
4133 && (TYPE_PRECISION (TREE_TYPE (value
))
4134 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
4135 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4138 /* Likewise conversions from int to pointers, but also allow
4139 conversions from 0. */
4140 if (POINTER_TYPE_P (TREE_TYPE (value
))
4141 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
4143 if (integer_zerop (TREE_OPERAND (value
, 0)))
4144 return null_pointer_node
;
4145 else if (TYPE_PRECISION (TREE_TYPE (value
))
4146 <= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0))))
4147 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4151 /* Allow conversions to union types if the value inside is okay. */
4152 if (TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
)
4153 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4158 if (! INTEGRAL_TYPE_P (endtype
)
4159 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
4161 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4163 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
4165 /* If either term is absolute, use the other terms relocation. */
4166 if (valid0
== null_pointer_node
)
4168 if (valid1
== null_pointer_node
)
4174 if (! INTEGRAL_TYPE_P (endtype
)
4175 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
4177 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4179 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
4181 /* Win if second argument is absolute. */
4182 if (valid1
== null_pointer_node
)
4184 /* Win if both arguments have the same relocation.
4185 Then the value is absolute. */
4186 if (valid0
== valid1
&& valid0
!= 0)
4187 return null_pointer_node
;
4189 /* Since GCC guarantees that string constants are unique in the
4190 generated code, a subtraction between two copies of the same
4191 constant string is absolute. */
4192 if (valid0
&& TREE_CODE (valid0
) == STRING_CST
&&
4193 valid1
&& TREE_CODE (valid1
) == STRING_CST
&&
4194 TREE_STRING_POINTER (valid0
) == TREE_STRING_POINTER (valid1
))
4195 return null_pointer_node
;
4198 /* Support differences between labels. */
4199 if (INTEGRAL_TYPE_P (endtype
))
4202 op0
= TREE_OPERAND (value
, 0);
4203 op1
= TREE_OPERAND (value
, 1);
4207 if (TREE_CODE (op0
) == ADDR_EXPR
4208 && TREE_CODE (TREE_OPERAND (op0
, 0)) == LABEL_DECL
4209 && TREE_CODE (op1
) == ADDR_EXPR
4210 && TREE_CODE (TREE_OPERAND (op1
, 0)) == LABEL_DECL
)
4211 return null_pointer_node
;
4222 /* Output assembler code for constant EXP to FILE, with no label.
4223 This includes the pseudo-op such as ".int" or ".byte", and a newline.
4224 Assumes output_addressed_constants has been done on EXP already.
4226 Generate exactly SIZE bytes of assembler data, padding at the end
4227 with zeros if necessary. SIZE must always be specified.
4229 SIZE is important for structure constructors,
4230 since trailing members may have been omitted from the constructor.
4231 It is also important for initialization of arrays from string constants
4232 since the full length of the string constant might not be wanted.
4233 It is also needed for initialization of unions, where the initializer's
4234 type is just one member, and that may not be as long as the union.
4236 There a case in which we would fail to output exactly SIZE bytes:
4237 for a structure constructor that wants to produce more than SIZE bytes.
4238 But such constructors will never be generated for any possible input. */
4241 output_constant (exp
, size
)
4245 register enum tree_code code
= TREE_CODE (TREE_TYPE (exp
));
4247 /* Some front-ends use constants other than the standard
4248 language-indepdent varieties, but which may still be output
4249 directly. Give the front-end a chance to convert EXP to a
4250 language-independent representation. */
4251 if (lang_expand_constant
)
4253 exp
= (*lang_expand_constant
) (exp
);
4254 code
= TREE_CODE (TREE_TYPE (exp
));
4257 if (size
== 0 || flag_syntax_only
)
4260 /* Eliminate the NON_LVALUE_EXPR_EXPR that makes a cast not be an lvalue.
4261 That way we get the constant (we hope) inside it. Also, strip off any
4262 NOP_EXPR that converts between two record, union, array, or set types
4263 or a CONVERT_EXPR that converts to a union TYPE. */
4264 while ((TREE_CODE (exp
) == NOP_EXPR
4265 && (TREE_TYPE (exp
) == TREE_TYPE (TREE_OPERAND (exp
, 0))
4266 || AGGREGATE_TYPE_P (TREE_TYPE (exp
))))
4267 || (TREE_CODE (exp
) == CONVERT_EXPR
4268 && code
== UNION_TYPE
)
4269 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
4271 exp
= TREE_OPERAND (exp
, 0);
4272 code
= TREE_CODE (TREE_TYPE (exp
));
4275 /* Allow a constructor with no elements for any data type.
4276 This means to fill the space with zeros. */
4277 if (TREE_CODE (exp
) == CONSTRUCTOR
&& CONSTRUCTOR_ELTS (exp
) == 0)
4279 assemble_zeros (size
);
4290 case REFERENCE_TYPE
:
4291 /* ??? What about (int)((float)(int)&foo + 4) */
4292 while (TREE_CODE (exp
) == NOP_EXPR
|| TREE_CODE (exp
) == CONVERT_EXPR
4293 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
4294 exp
= TREE_OPERAND (exp
, 0);
4296 if (! assemble_integer (expand_expr (exp
, NULL_RTX
, VOIDmode
,
4297 EXPAND_INITIALIZER
),
4299 error ("initializer for integer value is too complicated");
4304 if (TREE_CODE (exp
) != REAL_CST
)
4305 error ("initializer for floating value is not a floating constant");
4307 assemble_real (TREE_REAL_CST (exp
),
4308 mode_for_size (size
* BITS_PER_UNIT
, MODE_FLOAT
, 0));
4313 output_constant (TREE_REALPART (exp
), size
/ 2);
4314 output_constant (TREE_IMAGPART (exp
), size
/ 2);
4315 size
-= (size
/ 2) * 2;
4319 if (TREE_CODE (exp
) == CONSTRUCTOR
)
4321 output_constructor (exp
, size
);
4324 else if (TREE_CODE (exp
) == STRING_CST
)
4328 if (size
> TREE_STRING_LENGTH (exp
))
4330 excess
= size
- TREE_STRING_LENGTH (exp
);
4331 size
= TREE_STRING_LENGTH (exp
);
4334 assemble_string (TREE_STRING_POINTER (exp
), size
);
4343 if (TREE_CODE (exp
) == CONSTRUCTOR
)
4344 output_constructor (exp
, size
);
4350 if (TREE_CODE (exp
) == INTEGER_CST
)
4351 assemble_integer (expand_expr (exp
, NULL_RTX
,
4352 VOIDmode
, EXPAND_INITIALIZER
),
4354 else if (TREE_CODE (exp
) == CONSTRUCTOR
)
4356 unsigned char *buffer
= (unsigned char *) alloca (size
);
4357 if (get_set_constructor_bytes (exp
, buffer
, size
))
4359 assemble_string ((char *) buffer
, size
);
4362 error ("unknown set constructor type");
4370 assemble_zeros (size
);
4374 /* Subroutine of output_constructor, used for computing the size of
4375 arrays of unspecified length. VAL must be a CONSTRUCTOR of an array
4376 type with an unspecified upper bound. */
4378 static unsigned HOST_WIDE_INT
4379 array_size_for_constructor (val
)
4384 max_index
= NULL_TREE
;
4385 for (i
= CONSTRUCTOR_ELTS (val
); i
; i
= TREE_CHAIN (i
))
4387 tree index
= TREE_PURPOSE (i
);
4389 if (TREE_CODE (index
) == RANGE_EXPR
)
4390 index
= TREE_OPERAND (index
, 1);
4391 if (max_index
== NULL_TREE
|| tree_int_cst_lt (max_index
, index
))
4395 if (max_index
== NULL_TREE
)
4398 /* Compute the total number of array elements. */
4399 i
= size_binop (MINUS_EXPR
, convert (sizetype
, max_index
),
4401 TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (val
)))));
4402 i
= size_binop (PLUS_EXPR
, i
, convert (sizetype
, integer_one_node
));
4404 /* Multiply by the array element unit size to find number of bytes. */
4405 i
= size_binop (MULT_EXPR
, i
, TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (val
))));
4407 return tree_low_cst (i
, 1);
4410 /* Subroutine of output_constant, used for CONSTRUCTORs (aggregate constants).
4411 Generate at least SIZE bytes, padding if necessary. */
4414 output_constructor (exp
, size
)
4418 tree type
= TREE_TYPE (exp
);
4419 register tree link
, field
= 0;
4421 /* Number of bytes output or skipped so far.
4422 In other words, current position within the constructor. */
4423 HOST_WIDE_INT total_bytes
= 0;
4424 /* Non-zero means BYTE contains part of a byte, to be output. */
4425 int byte_buffer_in_use
= 0;
4426 register int byte
= 0;
4428 if (HOST_BITS_PER_WIDE_INT
< BITS_PER_UNIT
)
4431 if (TREE_CODE (type
) == RECORD_TYPE
)
4432 field
= TYPE_FIELDS (type
);
4434 if (TREE_CODE (type
) == ARRAY_TYPE
4435 && TYPE_DOMAIN (type
) != 0)
4436 min_index
= TYPE_MIN_VALUE (TYPE_DOMAIN (type
));
4438 /* As LINK goes through the elements of the constant,
4439 FIELD goes through the structure fields, if the constant is a structure.
4440 if the constant is a union, then we override this,
4441 by getting the field from the TREE_LIST element.
4442 But the constant could also be an array. Then FIELD is zero.
4444 There is always a maximum of one element in the chain LINK for unions
4445 (even if the initializer in a source program incorrectly contains
4447 for (link
= CONSTRUCTOR_ELTS (exp
);
4449 link
= TREE_CHAIN (link
),
4450 field
= field
? TREE_CHAIN (field
) : 0)
4452 tree val
= TREE_VALUE (link
);
4455 /* The element in a union constructor specifies the proper field
4457 if ((TREE_CODE (type
) == RECORD_TYPE
|| TREE_CODE (type
) == UNION_TYPE
4458 || TREE_CODE (type
) == QUAL_UNION_TYPE
)
4459 && TREE_PURPOSE (link
) != 0)
4460 field
= TREE_PURPOSE (link
);
4462 else if (TREE_CODE (type
) == ARRAY_TYPE
)
4463 index
= TREE_PURPOSE (link
);
4465 /* Eliminate the marker that makes a cast not be an lvalue. */
4469 if (index
&& TREE_CODE (index
) == RANGE_EXPR
)
4471 unsigned HOST_WIDE_INT fieldsize
4472 = int_size_in_bytes (TREE_TYPE (type
));
4473 HOST_WIDE_INT lo_index
= tree_low_cst (TREE_OPERAND (index
, 0), 0);
4474 HOST_WIDE_INT hi_index
= tree_low_cst (TREE_OPERAND (index
, 1), 0);
4475 HOST_WIDE_INT index
;
4477 for (index
= lo_index
; index
<= hi_index
; index
++)
4479 /* Output the element's initial value. */
4481 assemble_zeros (fieldsize
);
4483 output_constant (val
, fieldsize
);
4485 /* Count its size. */
4486 total_bytes
+= fieldsize
;
4489 else if (field
== 0 || !DECL_BIT_FIELD (field
))
4491 /* An element that is not a bit-field. */
4493 unsigned HOST_WIDE_INT fieldsize
;
4494 /* Since this structure is static,
4495 we know the positions are constant. */
4496 HOST_WIDE_INT pos
= field
? int_byte_position (field
) : 0;
4499 pos
= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (val
)), 1)
4500 * (tree_low_cst (index
, 0) - tree_low_cst (min_index
, 0)));
4502 /* Output any buffered-up bit-fields preceding this element. */
4503 if (byte_buffer_in_use
)
4505 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4507 byte_buffer_in_use
= 0;
4510 /* Advance to offset of this element.
4511 Note no alignment needed in an array, since that is guaranteed
4512 if each element has the proper size. */
4513 if ((field
!= 0 || index
!= 0) && pos
!= total_bytes
)
4515 assemble_zeros (pos
- total_bytes
);
4519 else if (field
!= 0 && DECL_PACKED (field
))
4520 /* Some assemblers automaticallly align a datum according to its
4521 size if no align directive is specified. The datum, however,
4522 may be declared with 'packed' attribute, so we have to disable
4524 ASM_OUTPUT_ALIGN (asm_out_file
, 0);
4526 /* Determine size this element should occupy. */
4531 /* If this is an array with an unspecified upper bound,
4532 the initializer determines the size. */
4533 /* ??? This ought to only checked if DECL_SIZE_UNIT is NULL,
4534 but we cannot do this until the deprecated support for
4535 initializing zero-length array members is removed. */
4536 if (TREE_CODE (TREE_TYPE (field
)) == ARRAY_TYPE
4537 && TYPE_DOMAIN (TREE_TYPE (field
))
4538 && ! TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (field
))))
4540 fieldsize
= array_size_for_constructor (val
);
4541 /* Given a non-empty initialization, this field had
4543 if (fieldsize
!= 0 && TREE_CHAIN (field
) != NULL_TREE
)
4546 else if (DECL_SIZE_UNIT (field
))
4548 /* ??? This can't be right. If the decl size overflows
4549 a host integer we will silently emit no data. */
4550 if (host_integerp (DECL_SIZE_UNIT (field
), 1))
4551 fieldsize
= tree_low_cst (DECL_SIZE_UNIT (field
), 1);
4555 fieldsize
= int_size_in_bytes (TREE_TYPE (type
));
4557 /* Output the element's initial value. */
4559 assemble_zeros (fieldsize
);
4561 output_constant (val
, fieldsize
);
4563 /* Count its size. */
4564 total_bytes
+= fieldsize
;
4566 else if (val
!= 0 && TREE_CODE (val
) != INTEGER_CST
)
4567 error ("invalid initial value for member `%s'",
4568 IDENTIFIER_POINTER (DECL_NAME (field
)));
4571 /* Element that is a bit-field. */
4573 HOST_WIDE_INT next_offset
= int_bit_position (field
);
4574 HOST_WIDE_INT end_offset
4575 = (next_offset
+ tree_low_cst (DECL_SIZE (field
), 1));
4578 val
= integer_zero_node
;
4580 /* If this field does not start in this (or, next) byte,
4582 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4584 /* Output remnant of any bit field in previous bytes. */
4585 if (byte_buffer_in_use
)
4587 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4589 byte_buffer_in_use
= 0;
4592 /* If still not at proper byte, advance to there. */
4593 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4595 assemble_zeros (next_offset
/ BITS_PER_UNIT
- total_bytes
);
4596 total_bytes
= next_offset
/ BITS_PER_UNIT
;
4600 if (! byte_buffer_in_use
)
4603 /* We must split the element into pieces that fall within
4604 separate bytes, and combine each byte with previous or
4605 following bit-fields. */
4607 /* next_offset is the offset n fbits from the beginning of
4608 the structure to the next bit of this element to be processed.
4609 end_offset is the offset of the first bit past the end of
4611 while (next_offset
< end_offset
)
4615 HOST_WIDE_INT value
;
4616 HOST_WIDE_INT next_byte
= next_offset
/ BITS_PER_UNIT
;
4617 HOST_WIDE_INT next_bit
= next_offset
% BITS_PER_UNIT
;
4619 /* Advance from byte to byte
4620 within this element when necessary. */
4621 while (next_byte
!= total_bytes
)
4623 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4628 /* Number of bits we can process at once
4629 (all part of the same byte). */
4630 this_time
= MIN (end_offset
- next_offset
,
4631 BITS_PER_UNIT
- next_bit
);
4632 if (BYTES_BIG_ENDIAN
)
4634 /* On big-endian machine, take the most significant bits
4635 first (of the bits that are significant)
4636 and put them into bytes from the most significant end. */
4637 shift
= end_offset
- next_offset
- this_time
;
4639 /* Don't try to take a bunch of bits that cross
4640 the word boundary in the INTEGER_CST. We can
4641 only select bits from the LOW or HIGH part
4643 if (shift
< HOST_BITS_PER_WIDE_INT
4644 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4646 this_time
= shift
+ this_time
- HOST_BITS_PER_WIDE_INT
;
4647 shift
= HOST_BITS_PER_WIDE_INT
;
4650 /* Now get the bits from the appropriate constant word. */
4651 if (shift
< HOST_BITS_PER_WIDE_INT
)
4652 value
= TREE_INT_CST_LOW (val
);
4653 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4655 value
= TREE_INT_CST_HIGH (val
);
4656 shift
-= HOST_BITS_PER_WIDE_INT
;
4661 /* Get the result. This works only when:
4662 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4663 byte
|= (((value
>> shift
)
4664 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4665 << (BITS_PER_UNIT
- this_time
- next_bit
));
4669 /* On little-endian machines,
4670 take first the least significant bits of the value
4671 and pack them starting at the least significant
4672 bits of the bytes. */
4673 shift
= next_offset
- int_bit_position (field
);
4675 /* Don't try to take a bunch of bits that cross
4676 the word boundary in the INTEGER_CST. We can
4677 only select bits from the LOW or HIGH part
4679 if (shift
< HOST_BITS_PER_WIDE_INT
4680 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4681 this_time
= (HOST_BITS_PER_WIDE_INT
- shift
);
4683 /* Now get the bits from the appropriate constant word. */
4684 if (shift
< HOST_BITS_PER_WIDE_INT
)
4685 value
= TREE_INT_CST_LOW (val
);
4686 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4688 value
= TREE_INT_CST_HIGH (val
);
4689 shift
-= HOST_BITS_PER_WIDE_INT
;
4694 /* Get the result. This works only when:
4695 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4696 byte
|= (((value
>> shift
)
4697 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4701 next_offset
+= this_time
;
4702 byte_buffer_in_use
= 1;
4707 if (byte_buffer_in_use
)
4709 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4713 if (total_bytes
< size
)
4714 assemble_zeros (size
- total_bytes
);
4717 #ifdef HANDLE_PRAGMA_WEAK
4718 /* Add function NAME to the weak symbols list. VALUE is a weak alias
4719 associatd with NAME. */
4722 add_weak (name
, value
)
4726 struct weak_syms
*weak
;
4728 weak
= (struct weak_syms
*) permalloc (sizeof (struct weak_syms
));
4733 weak
->next
= weak_decls
;
4735 weak
->value
= value
;
4740 #endif /* HANDLE_PRAGMA_WEAK */
4742 /* Declare DECL to be a weak symbol. */
4748 if (! TREE_PUBLIC (decl
))
4749 error_with_decl (decl
, "weak declaration of `%s' must be public");
4750 else if (TREE_ASM_WRITTEN (decl
))
4751 error_with_decl (decl
, "weak declaration of `%s' must precede definition");
4752 else if (SUPPORTS_WEAK
)
4753 DECL_WEAK (decl
) = 1;
4754 #ifdef HANDLE_PRAGMA_WEAK
4755 add_weak (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)), NULL
);
4759 /* Emit any pending weak declarations. */
4761 #ifdef HANDLE_PRAGMA_WEAK
4762 struct weak_syms
* weak_decls
;
4768 #ifdef HANDLE_PRAGMA_WEAK
4769 if (HANDLE_PRAGMA_WEAK
)
4771 struct weak_syms
*t
;
4772 for (t
= weak_decls
; t
; t
= t
->next
)
4776 ASM_WEAKEN_LABEL (asm_out_file
, t
->name
);
4778 ASM_OUTPUT_DEF (asm_out_file
, t
->name
, t
->value
);
4785 /* Remove NAME from the pending list of weak symbols. This prevents
4786 the compiler from emitting multiple .weak directives which confuses
4788 #ifdef ASM_WEAKEN_LABEL
4790 remove_from_pending_weak_list (name
)
4791 const char *name ATTRIBUTE_UNUSED
;
4793 #ifdef HANDLE_PRAGMA_WEAK
4794 if (HANDLE_PRAGMA_WEAK
)
4796 struct weak_syms
*t
;
4797 for (t
= weak_decls
; t
; t
= t
->next
)
4799 if (t
->name
&& strcmp (name
, t
->name
) == 0)
4808 assemble_alias (decl
, target
)
4809 tree decl
, target ATTRIBUTE_UNUSED
;
4813 /* We must force creation of DECL_RTL for debug info generation, even though
4814 we don't use it here. */
4815 make_decl_rtl (decl
, NULL
);
4817 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
4819 #ifdef ASM_OUTPUT_DEF
4820 /* Make name accessible from other files, if appropriate. */
4822 if (TREE_PUBLIC (decl
))
4824 #ifdef ASM_WEAKEN_LABEL
4825 if (DECL_WEAK (decl
))
4827 ASM_WEAKEN_LABEL (asm_out_file
, name
);
4828 /* Remove this function from the pending weak list so that
4829 we do not emit multiple .weak directives for it. */
4830 remove_from_pending_weak_list
4831 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
4835 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
4838 #ifdef ASM_OUTPUT_DEF_FROM_DECLS
4839 ASM_OUTPUT_DEF_FROM_DECLS (asm_out_file
, decl
, target
);
4841 ASM_OUTPUT_DEF (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4843 TREE_ASM_WRITTEN (decl
) = 1;
4845 #ifdef ASM_OUTPUT_WEAK_ALIAS
4846 if (! DECL_WEAK (decl
))
4847 warning ("only weak aliases are supported in this configuration");
4849 ASM_OUTPUT_WEAK_ALIAS (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4850 TREE_ASM_WRITTEN (decl
) = 1;
4852 warning ("alias definitions not supported in this configuration; ignored");
4857 /* Returns 1 if the target configuration supports defining public symbols
4858 so that one of them will be chosen at link time instead of generating a
4859 multiply-defined symbol error, whether through the use of weak symbols or
4860 a target-specific mechanism for having duplicates discarded. */
4863 supports_one_only ()
4865 if (SUPPORTS_ONE_ONLY
)
4867 return SUPPORTS_WEAK
;
4870 /* Set up DECL as a public symbol that can be defined in multiple
4871 translation units without generating a linker error. */
4874 make_decl_one_only (decl
)
4877 if (TREE_CODE (decl
) != VAR_DECL
&& TREE_CODE (decl
) != FUNCTION_DECL
)
4880 TREE_PUBLIC (decl
) = 1;
4882 if (TREE_CODE (decl
) == VAR_DECL
4883 && (DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
))
4884 DECL_COMMON (decl
) = 1;
4885 else if (SUPPORTS_ONE_ONLY
)
4887 #ifdef MAKE_DECL_ONE_ONLY
4888 MAKE_DECL_ONE_ONLY (decl
);
4890 DECL_ONE_ONLY (decl
) = 1;
4892 else if (SUPPORTS_WEAK
)
4893 DECL_WEAK (decl
) = 1;
4901 const_str_htab
= htab_create (128, const_str_htab_hash
, const_str_htab_eq
,
4902 const_str_htab_del
);
4903 ggc_add_root (const_hash_table
, MAX_HASH_TABLE
, sizeof const_hash_table
[0],
4904 mark_const_hash_entry
);
4905 ggc_add_root (&const_str_htab
, 1, sizeof const_str_htab
,
4906 mark_const_str_htab
);
4909 /* Extra support for EH values. */
4911 assemble_eh_label (name
)
4914 #ifdef ASM_OUTPUT_EH_LABEL
4915 ASM_OUTPUT_EH_LABEL (asm_out_file
, name
);
4917 assemble_label (name
);
4921 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
4924 assemble_eh_align (align
)
4927 #ifdef ASM_OUTPUT_EH_ALIGN
4928 if (align
> BITS_PER_UNIT
)
4929 ASM_OUTPUT_EH_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
4931 assemble_align (align
);
4936 /* On some platforms, we may want to specify a special mechansim to
4937 output EH data when generating with a function.. */
4939 assemble_eh_integer (x
, size
, force
)
4947 #ifdef ASM_OUTPUT_EH_CHAR
4949 ASM_OUTPUT_EH_CHAR (asm_out_file
, x
);
4953 #ifdef ASM_OUTPUT_EH_SHORT
4955 ASM_OUTPUT_EH_SHORT (asm_out_file
, x
);
4959 #ifdef ASM_OUTPUT_EH_INT
4961 ASM_OUTPUT_EH_INT (asm_out_file
, x
);
4965 #ifdef ASM_OUTPUT_EH_DOUBLE_INT
4967 ASM_OUTPUT_EH_DOUBLE_INT (asm_out_file
, x
);
4974 return (assemble_integer (x
, size
, force
));