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 #ifdef NO_DOLLAR_IN_LABEL
65 #ifdef NO_DOT_IN_LABEL
66 #define CHKR_PREFIX "chkr_prefix_"
67 #else /* !NO_DOT_IN_LABEL */
68 #define CHKR_PREFIX "chkr."
70 #else /* !NO_DOLLAR_IN_LABEL */
71 #define CHKR_PREFIX "chkr$"
73 #define CHKR_PREFIX_SIZE (sizeof (CHKR_PREFIX) - 1)
75 /* File in which assembler code is being written. */
77 extern FILE *asm_out_file
;
79 /* The (assembler) name of the first globally-visible object output. */
80 const char *first_global_object_name
;
81 const char *weak_global_object_name
;
83 extern struct obstack permanent_obstack
;
84 #define obstack_chunk_alloc xmalloc
87 struct constant_descriptor
;
91 #define MAX_RTX_HASH_TABLE 61
95 /* Hash facility for making memory-constants
96 from constant rtl-expressions. It is used on RISC machines
97 where immediate integer arguments and constant addresses are restricted
98 so that such constants must be stored in memory.
100 This pool of constants is reinitialized for each function
101 so each function gets its own constants-pool that comes right before
103 struct constant_descriptor
**x_const_rtx_hash_table
;
104 struct pool_constant
**x_const_rtx_sym_hash_table
;
106 /* Pointers to first and last constant in pool. */
107 struct pool_constant
*x_first_pool
, *x_last_pool
;
109 /* Current offset in constant pool (does not include any machine-specific
113 /* Chain of all CONST_DOUBLE rtx's constructed for the current function.
114 They are chained through the CONST_DOUBLE_CHAIN.
115 A CONST_DOUBLE rtx has CONST_DOUBLE_MEM != cc0_rtx iff it is on this chain.
116 In that case, CONST_DOUBLE_MEM is either a MEM,
117 or const0_rtx if no MEM has been made for this CONST_DOUBLE yet. */
118 rtx x_const_double_chain
;
121 #define const_rtx_hash_table (cfun->varasm->x_const_rtx_hash_table)
122 #define const_rtx_sym_hash_table (cfun->varasm->x_const_rtx_sym_hash_table)
123 #define first_pool (cfun->varasm->x_first_pool)
124 #define last_pool (cfun->varasm->x_last_pool)
125 #define pool_offset (cfun->varasm->x_pool_offset)
126 #define const_double_chain (cfun->varasm->x_const_double_chain)
128 /* Number for making the label on the next
129 constant that is stored in memory. */
133 /* Number for making the label on the next
134 static variable internal to a function. */
138 /* Carry information from ASM_DECLARE_OBJECT_NAME
139 to ASM_FINISH_DECLARE_OBJECT. */
141 int size_directive_output
;
143 /* The last decl for which assemble_variable was called,
144 if it did ASM_DECLARE_OBJECT_NAME.
145 If the last call to assemble_variable didn't do that,
148 tree last_assemble_variable_decl
;
150 static const char *strip_reg_name
PARAMS ((const char *));
151 static int contains_pointers_p
PARAMS ((tree
));
152 static void decode_addr_const
PARAMS ((tree
, struct addr_const
*));
153 static int const_hash
PARAMS ((tree
));
154 static int compare_constant
PARAMS ((tree
,
155 struct constant_descriptor
*));
156 static const unsigned char *compare_constant_1
PARAMS ((tree
, const unsigned char *));
157 static struct constant_descriptor
*record_constant
PARAMS ((tree
));
158 static void record_constant_1
PARAMS ((tree
));
159 static tree copy_constant
PARAMS ((tree
));
160 static void output_constant_def_contents
PARAMS ((tree
, int, int));
161 static void decode_rtx_const
PARAMS ((enum machine_mode
, rtx
,
162 struct rtx_const
*));
163 static int const_hash_rtx
PARAMS ((enum machine_mode
, rtx
));
164 static int compare_constant_rtx
PARAMS ((enum machine_mode
, rtx
,
165 struct constant_descriptor
*));
166 static struct constant_descriptor
*record_constant_rtx
PARAMS ((enum machine_mode
,
168 static struct pool_constant
*find_pool_constant
PARAMS ((struct function
*, rtx
));
169 static void mark_constant_pool
PARAMS ((void));
170 static void mark_constants
PARAMS ((rtx
));
171 static int mark_constant
PARAMS ((rtx
*current_rtx
, void *data
));
172 static int output_addressed_constants
PARAMS ((tree
));
173 static void output_after_function_constants
PARAMS ((void));
174 static unsigned HOST_WIDE_INT array_size_for_constructor
PARAMS ((tree
));
175 static void output_constructor
PARAMS ((tree
, int));
176 #ifdef ASM_WEAKEN_LABEL
177 static void remove_from_pending_weak_list
PARAMS ((const char *));
179 #ifdef ASM_OUTPUT_BSS
180 static void asm_output_bss
PARAMS ((FILE *, tree
, const char *, int, int));
182 #ifdef BSS_SECTION_ASM_OP
183 #ifdef ASM_OUTPUT_ALIGNED_BSS
184 static void asm_output_aligned_bss
PARAMS ((FILE *, tree
, const char *,
187 #endif /* BSS_SECTION_ASM_OP */
188 static void mark_pool_constant
PARAMS ((struct pool_constant
*));
189 static void mark_const_hash_entry
PARAMS ((void *));
190 static int mark_const_str_htab_1
PARAMS ((void **, void *));
191 static void mark_const_str_htab
PARAMS ((void *));
192 static hashval_t const_str_htab_hash
PARAMS ((const void *x
));
193 static int const_str_htab_eq
PARAMS ((const void *x
, const void *y
));
194 static void const_str_htab_del
PARAMS ((void *));
195 static void asm_emit_uninitialised
PARAMS ((tree
, const char*, int, int));
197 static enum in_section
{ no_section
, in_text
, in_data
, in_named
198 #ifdef BSS_SECTION_ASM_OP
201 #ifdef EH_FRAME_SECTION_ASM_OP
204 #ifdef EXTRA_SECTIONS
207 } in_section
= no_section
;
209 /* Return a non-zero value if DECL has a section attribute. */
210 #ifndef IN_NAMED_SECTION
211 #define IN_NAMED_SECTION(DECL) \
212 ((TREE_CODE (DECL) == FUNCTION_DECL || TREE_CODE (DECL) == VAR_DECL) \
213 && DECL_SECTION_NAME (DECL) != NULL_TREE)
216 /* Text of section name when in_section == in_named. */
217 static const char *in_named_name
;
219 /* Define functions like text_section for any extra sections. */
220 #ifdef EXTRA_SECTION_FUNCTIONS
221 EXTRA_SECTION_FUNCTIONS
224 /* Tell assembler to switch to text section. */
229 if (in_section
!= in_text
)
231 fprintf (asm_out_file
, "%s\n", TEXT_SECTION_ASM_OP
);
232 in_section
= in_text
;
236 /* Tell assembler to switch to data section. */
241 if (in_section
!= in_data
)
243 if (flag_shared_data
)
245 #ifdef SHARED_SECTION_ASM_OP
246 fprintf (asm_out_file
, "%s\n", SHARED_SECTION_ASM_OP
);
248 fprintf (asm_out_file
, "%s\n", DATA_SECTION_ASM_OP
);
252 fprintf (asm_out_file
, "%s\n", DATA_SECTION_ASM_OP
);
254 in_section
= in_data
;
257 /* Tell assembler to ALWAYS switch to data section, in case
258 it's not sure where it it. */
261 force_data_section ()
263 in_section
= no_section
;
267 /* Tell assembler to switch to read-only data section. This is normally
271 readonly_data_section ()
273 #ifdef READONLY_DATA_SECTION
274 READONLY_DATA_SECTION (); /* Note this can call data_section. */
280 /* Determine if we're in the text section. */
285 return in_section
== in_text
;
288 /* Determine if we're in the data section. */
293 return in_section
== in_data
;
296 /* Tell assembler to change to section NAME for DECL.
297 If DECL is NULL, just switch to section NAME.
298 If NAME is NULL, get the name from DECL.
299 If RELOC is 1, the initializer for DECL contains relocs. */
302 named_section (decl
, name
, reloc
)
305 int reloc ATTRIBUTE_UNUSED
;
307 if (decl
!= NULL_TREE
&& !DECL_P (decl
))
310 name
= TREE_STRING_POINTER (DECL_SECTION_NAME (decl
));
312 if (in_section
!= in_named
|| strcmp (name
, in_named_name
))
314 #ifdef ASM_OUTPUT_SECTION_NAME
315 ASM_OUTPUT_SECTION_NAME (asm_out_file
, decl
, name
, reloc
);
317 /* Section attributes are not supported if this macro isn't provided -
318 some host formats don't support them at all. The front-end should
319 already have flagged this as an error. */
323 in_named_name
= ggc_strdup (name
);
324 in_section
= in_named
;
328 #ifdef BSS_SECTION_ASM_OP
330 /* Tell the assembler to switch to the bss section. */
335 if (in_section
!= in_bss
)
337 #ifdef SHARED_BSS_SECTION_ASM_OP
338 if (flag_shared_data
)
339 fprintf (asm_out_file
, "%s\n", SHARED_BSS_SECTION_ASM_OP
);
342 fprintf (asm_out_file
, "%s\n", BSS_SECTION_ASM_OP
);
348 #ifdef ASM_OUTPUT_BSS
350 /* Utility function for ASM_OUTPUT_BSS for targets to use if
351 they don't support alignments in .bss.
352 ??? It is believed that this function will work in most cases so such
353 support is localized here. */
356 asm_output_bss (file
, decl
, name
, size
, rounded
)
358 tree decl ATTRIBUTE_UNUSED
;
360 int size ATTRIBUTE_UNUSED
, rounded
;
362 ASM_GLOBALIZE_LABEL (file
, name
);
364 #ifdef ASM_DECLARE_OBJECT_NAME
365 last_assemble_variable_decl
= decl
;
366 ASM_DECLARE_OBJECT_NAME (file
, name
, decl
);
368 /* Standard thing is just output label for the object. */
369 ASM_OUTPUT_LABEL (file
, name
);
370 #endif /* ASM_DECLARE_OBJECT_NAME */
371 ASM_OUTPUT_SKIP (file
, rounded
);
376 #ifdef ASM_OUTPUT_ALIGNED_BSS
378 /* Utility function for targets to use in implementing
379 ASM_OUTPUT_ALIGNED_BSS.
380 ??? It is believed that this function will work in most cases so such
381 support is localized here. */
384 asm_output_aligned_bss (file
, decl
, name
, size
, align
)
390 ASM_GLOBALIZE_LABEL (file
, name
);
392 ASM_OUTPUT_ALIGN (file
, floor_log2 (align
/ BITS_PER_UNIT
));
393 #ifdef ASM_DECLARE_OBJECT_NAME
394 last_assemble_variable_decl
= decl
;
395 ASM_DECLARE_OBJECT_NAME (file
, name
, decl
);
397 /* Standard thing is just output label for the object. */
398 ASM_OUTPUT_LABEL (file
, name
);
399 #endif /* ASM_DECLARE_OBJECT_NAME */
400 ASM_OUTPUT_SKIP (file
, size
? size
: 1);
405 #endif /* BSS_SECTION_ASM_OP */
407 #ifdef EH_FRAME_SECTION_ASM_OP
411 if (in_section
!= in_eh_frame
)
413 fprintf (asm_out_file
, "%s\n", EH_FRAME_SECTION_ASM_OP
);
414 in_section
= in_eh_frame
;
419 /* Switch to the section for function DECL.
421 If DECL is NULL_TREE, switch to the text section.
422 ??? It's not clear that we will ever be passed NULL_TREE, but it's
423 safer to handle it. */
426 function_section (decl
)
429 if (decl
!= NULL_TREE
430 && DECL_SECTION_NAME (decl
) != NULL_TREE
)
431 named_section (decl
, (char *) 0, 0);
436 /* Switch to section for variable DECL.
438 RELOC is the `reloc' argument to SELECT_SECTION. */
441 variable_section (decl
, reloc
)
445 if (IN_NAMED_SECTION (decl
))
446 named_section (decl
, NULL
, reloc
);
449 /* C++ can have const variables that get initialized from constructors,
450 and thus can not be in a readonly section. We prevent this by
451 verifying that the initial value is constant for objects put in a
454 error_mark_node is used by the C front end to indicate that the
455 initializer has not been seen yet. In this case, we assume that
456 the initializer must be constant.
458 C++ uses error_mark_node for variables that have complicated
459 initializers, but these variables go in BSS so we won't be called
462 #ifdef SELECT_SECTION
463 SELECT_SECTION (decl
, reloc
);
465 if (DECL_READONLY_SECTION (decl
, reloc
))
466 readonly_data_section ();
473 /* Tell assembler to switch to the section for the exception handling
479 #if defined (EXCEPTION_SECTION)
480 EXCEPTION_SECTION ();
482 #ifdef ASM_OUTPUT_SECTION_NAME
483 named_section (NULL_TREE
, ".gcc_except_table", 0);
488 readonly_data_section ();
493 /* Given NAME, a putative register name, discard any customary prefixes. */
496 strip_reg_name (name
)
499 #ifdef REGISTER_PREFIX
500 if (!strncmp (name
, REGISTER_PREFIX
, strlen (REGISTER_PREFIX
)))
501 name
+= strlen (REGISTER_PREFIX
);
503 if (name
[0] == '%' || name
[0] == '#')
508 /* Decode an `asm' spec for a declaration as a register name.
509 Return the register number, or -1 if nothing specified,
510 or -2 if the ASMSPEC is not `cc' or `memory' and is not recognized,
511 or -3 if ASMSPEC is `cc' and is not recognized,
512 or -4 if ASMSPEC is `memory' and is not recognized.
513 Accept an exact spelling or a decimal number.
514 Prefixes such as % are optional. */
517 decode_reg_name (asmspec
)
524 /* Get rid of confusing prefixes. */
525 asmspec
= strip_reg_name (asmspec
);
527 /* Allow a decimal number as a "register name". */
528 for (i
= strlen (asmspec
) - 1; i
>= 0; i
--)
529 if (! (asmspec
[i
] >= '0' && asmspec
[i
] <= '9'))
531 if (asmspec
[0] != 0 && i
< 0)
534 if (i
< FIRST_PSEUDO_REGISTER
&& i
>= 0)
540 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
542 && ! strcmp (asmspec
, strip_reg_name (reg_names
[i
])))
545 #ifdef ADDITIONAL_REGISTER_NAMES
547 static struct { const char *name
; int number
; } table
[]
548 = ADDITIONAL_REGISTER_NAMES
;
550 for (i
= 0; i
< (int) ARRAY_SIZE (table
); i
++)
551 if (! strcmp (asmspec
, table
[i
].name
))
552 return table
[i
].number
;
554 #endif /* ADDITIONAL_REGISTER_NAMES */
556 if (!strcmp (asmspec
, "memory"))
559 if (!strcmp (asmspec
, "cc"))
568 /* Create the DECL_RTL for a VAR_DECL or FUNCTION_DECL. DECL should
569 have static storage duration. In other words, it should not be an
570 automatic variable, including PARM_DECLs.
572 There is, however, one exception: this function handles variables
573 explicitly placed in a particular register by the user.
575 ASMSPEC, if not 0, is the string which the user specified as the
576 assembler symbol name.
578 This is never called for PARM_DECL nodes. */
581 make_decl_rtl (decl
, asmspec
)
585 int top_level
= (DECL_CONTEXT (decl
) == NULL_TREE
);
586 const char *name
= 0;
587 const char *new_name
= 0;
590 /* Check that we are not being given an automatic variable. */
591 if (TREE_CODE (decl
) == PARM_DECL
592 || TREE_CODE (decl
) == RESULT_DECL
593 || (TREE_CODE (decl
) == VAR_DECL
594 && !TREE_STATIC (decl
)
595 && !DECL_EXTERNAL (decl
)
596 && !DECL_REGISTER (decl
)))
598 /* And that we were not given a type or a label. */
599 else if (TREE_CODE (decl
) == TYPE_DECL
600 || TREE_CODE (decl
) == LABEL_DECL
)
603 /* For a duplicate declaration, we can be called twice on the
604 same DECL node. Don't discard the RTL already made. */
605 if (DECL_RTL_SET_P (decl
))
607 /* If the old RTL had the wrong mode, fix the mode. */
608 if (GET_MODE (DECL_RTL (decl
)) != DECL_MODE (decl
))
610 rtx rtl
= DECL_RTL (decl
);
611 PUT_MODE (rtl
, DECL_MODE (decl
));
614 /* ??? Another way to do this would be to do what halfpic.c does
615 and maintain a hashed table of such critters. */
616 /* ??? Another way to do this would be to pass a flag bit to
617 ENCODE_SECTION_INFO saying whether this is a new decl or not. */
618 /* Let the target reassign the RTL if it wants.
619 This is necessary, for example, when one machine specific
620 decl attribute overrides another. */
621 #ifdef REDO_SECTION_INFO_P
622 if (REDO_SECTION_INFO_P (decl
))
623 ENCODE_SECTION_INFO (decl
);
628 new_name
= name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
630 reg_number
= decode_reg_name (asmspec
);
631 if (reg_number
== -2)
633 /* ASMSPEC is given, and not the name of a register. Mark the
634 name with a star so assemble_name won't munge it. */
635 char *starred
= alloca (strlen (asmspec
) + 2);
637 strcpy (starred
+ 1, asmspec
);
641 if (TREE_CODE (decl
) != FUNCTION_DECL
&& DECL_REGISTER (decl
))
643 /* First detect errors in declaring global registers. */
644 if (reg_number
== -1)
645 error_with_decl (decl
, "register name not specified for `%s'");
646 else if (reg_number
< 0)
647 error_with_decl (decl
, "invalid register name for `%s'");
648 else if (TYPE_MODE (TREE_TYPE (decl
)) == BLKmode
)
649 error_with_decl (decl
,
650 "data type of `%s' isn't suitable for a register");
651 else if (! HARD_REGNO_MODE_OK (reg_number
, TYPE_MODE (TREE_TYPE (decl
))))
652 error_with_decl (decl
,
653 "register specified for `%s' isn't suitable for data type");
654 /* Now handle properly declared static register variables. */
659 if (DECL_INITIAL (decl
) != 0 && TREE_STATIC (decl
))
661 DECL_INITIAL (decl
) = 0;
662 error ("global register variable has initial value");
664 if (TREE_THIS_VOLATILE (decl
))
665 warning ("volatile register variables don't work as you might wish");
667 /* If the user specified one of the eliminables registers here,
668 e.g., FRAME_POINTER_REGNUM, we don't want to get this variable
669 confused with that register and be eliminated. Although this
670 usage is somewhat suspect, we nevertheless use the following
671 kludge to avoid setting DECL_RTL to frame_pointer_rtx. */
674 gen_rtx_REG (DECL_MODE (decl
),
675 FIRST_PSEUDO_REGISTER
));
676 REGNO (DECL_RTL (decl
)) = reg_number
;
677 REG_USERVAR_P (DECL_RTL (decl
)) = 1;
679 if (TREE_STATIC (decl
))
681 /* Make this register global, so not usable for anything
683 #ifdef ASM_DECLARE_REGISTER_GLOBAL
684 ASM_DECLARE_REGISTER_GLOBAL (asm_out_file
, decl
, reg_number
, name
);
686 nregs
= HARD_REGNO_NREGS (reg_number
, DECL_MODE (decl
));
688 globalize_reg (reg_number
+ --nregs
);
691 /* As a register variable, it has no section. */
696 /* Now handle ordinary static variables and functions (in memory).
697 Also handle vars declared register invalidly. */
699 if (reg_number
>= 0 || reg_number
== -3)
700 error_with_decl (decl
,
701 "register name given for non-register variable `%s'");
703 /* Specifying a section attribute on a variable forces it into a
704 non-.bss section, and thus it cannot be common. */
705 if (TREE_CODE (decl
) == VAR_DECL
706 && DECL_SECTION_NAME (decl
) != NULL_TREE
707 && DECL_INITIAL (decl
) == NULL_TREE
708 && DECL_COMMON (decl
))
709 DECL_COMMON (decl
) = 0;
711 /* Can't use just the variable's own name for a variable
712 whose scope is less than the whole file, unless it's a member
713 of a local class (which will already be unambiguous).
714 Concatenate a distinguishing number. */
715 if (!top_level
&& !TREE_PUBLIC (decl
)
716 && ! (DECL_CONTEXT (decl
) && TYPE_P (DECL_CONTEXT (decl
)))
720 ASM_FORMAT_PRIVATE_NAME (label
, name
, var_labelno
);
725 /* When -fprefix-function-name is used, the functions
726 names are prefixed. Only nested function names are not
728 else if (flag_prefix_function_name
&& TREE_CODE (decl
) == FUNCTION_DECL
)
730 size_t name_len
= IDENTIFIER_LENGTH (DECL_ASSEMBLER_NAME (decl
));
733 pname
= alloca (name_len
+ CHKR_PREFIX_SIZE
+ 1);
734 memcpy (pname
, CHKR_PREFIX
, CHKR_PREFIX_SIZE
);
735 memcpy (pname
+ CHKR_PREFIX_SIZE
, name
, name_len
+ 1);
739 if (name
!= new_name
)
741 DECL_ASSEMBLER_NAME (decl
) = get_identifier (new_name
);
742 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
745 /* If this variable is to be treated as volatile, show its
746 tree node has side effects. */
747 if ((flag_volatile_global
&& TREE_CODE (decl
) == VAR_DECL
748 && TREE_PUBLIC (decl
))
749 || ((flag_volatile_static
&& TREE_CODE (decl
) == VAR_DECL
750 && (TREE_PUBLIC (decl
) || TREE_STATIC (decl
)))))
751 TREE_SIDE_EFFECTS (decl
) = 1;
753 SET_DECL_RTL (decl
, gen_rtx_MEM (DECL_MODE (decl
),
754 gen_rtx_SYMBOL_REF (Pmode
, name
)));
755 if (TREE_CODE (decl
) != FUNCTION_DECL
)
756 set_mem_attributes (DECL_RTL (decl
), decl
, 1);
758 /* Optionally set flags or add text to the name to record information
759 such as that it is a function name.
760 If the name is changed, the macro ASM_OUTPUT_LABELREF
761 will have to know how to strip this information. */
762 #ifdef ENCODE_SECTION_INFO
763 ENCODE_SECTION_INFO (decl
);
767 /* Make the rtl for variable VAR be volatile.
768 Use this only for static variables. */
771 make_var_volatile (var
)
774 if (GET_CODE (DECL_RTL (var
)) != MEM
)
777 MEM_VOLATILE_P (DECL_RTL (var
)) = 1;
780 /* Output alignment directive to align for constant expression EXP. */
783 assemble_constant_align (exp
)
788 /* Align the location counter as required by EXP's data type. */
789 align
= TYPE_ALIGN (TREE_TYPE (exp
));
790 #ifdef CONSTANT_ALIGNMENT
791 align
= CONSTANT_ALIGNMENT (exp
, align
);
794 if (align
> BITS_PER_UNIT
)
795 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
798 /* Output a string of literal assembler code
799 for an `asm' keyword used between functions. */
802 assemble_asm (string
)
807 if (TREE_CODE (string
) == ADDR_EXPR
)
808 string
= TREE_OPERAND (string
, 0);
810 fprintf (asm_out_file
, "\t%s\n", TREE_STRING_POINTER (string
));
813 #if 0 /* This should no longer be needed, because
814 flag_gnu_linker should be 0 on these systems,
815 which should prevent any output
816 if ASM_OUTPUT_CONSTRUCTOR and ASM_OUTPUT_DESTRUCTOR are absent. */
817 #if !(defined(DBX_DEBUGGING_INFO) && !defined(FASCIST_ASSEMBLER))
818 #ifndef ASM_OUTPUT_CONSTRUCTOR
819 #define ASM_OUTPUT_CONSTRUCTOR(file, name)
821 #ifndef ASM_OUTPUT_DESTRUCTOR
822 #define ASM_OUTPUT_DESTRUCTOR(file, name)
827 /* Record an element in the table of global destructors.
828 How this is done depends on what sort of assembler and linker
831 NAME should be the name of a global function to be called
832 at exit time. This name is output using assemble_name. */
835 assemble_destructor (name
)
838 #ifdef ASM_OUTPUT_DESTRUCTOR
839 ASM_OUTPUT_DESTRUCTOR (asm_out_file
, name
);
843 /* Now tell GNU LD that this is part of the static destructor set. */
844 /* This code works for any machine provided you use GNU as/ld. */
845 fprintf (asm_out_file
, "%s\"___DTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
846 assemble_name (asm_out_file
, name
);
847 fputc ('\n', asm_out_file
);
852 /* Likewise for global constructors. */
855 assemble_constructor (name
)
858 #ifdef ASM_OUTPUT_CONSTRUCTOR
859 ASM_OUTPUT_CONSTRUCTOR (asm_out_file
, name
);
863 /* Now tell GNU LD that this is part of the static constructor set. */
864 /* This code works for any machine provided you use GNU as/ld. */
865 fprintf (asm_out_file
, "%s\"___CTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
866 assemble_name (asm_out_file
, name
);
867 fputc ('\n', asm_out_file
);
872 /* Likewise for entries we want to record for garbage collection.
873 Garbage collection is still under development. */
876 assemble_gc_entry (name
)
879 #ifdef ASM_OUTPUT_GC_ENTRY
880 ASM_OUTPUT_GC_ENTRY (asm_out_file
, name
);
884 /* Now tell GNU LD that this is part of the static constructor set. */
885 fprintf (asm_out_file
, "%s\"___PTR_LIST__\",22,0,0,", ASM_STABS_OP
);
886 assemble_name (asm_out_file
, name
);
887 fputc ('\n', asm_out_file
);
892 /* CONSTANT_POOL_BEFORE_FUNCTION may be defined as an expression with
893 a non-zero value if the constant pool should be output before the
894 start of the function, or a zero value if the pool should output
895 after the end of the function. The default is to put it before the
898 #ifndef CONSTANT_POOL_BEFORE_FUNCTION
899 #define CONSTANT_POOL_BEFORE_FUNCTION 1
902 /* Output assembler code for the constant pool of a function and associated
903 with defining the name of the function. DECL describes the function.
904 NAME is the function's name. For the constant pool, we use the current
905 constant pool data. */
908 assemble_start_function (decl
, fnname
)
914 /* The following code does not need preprocessing in the assembler. */
918 if (CONSTANT_POOL_BEFORE_FUNCTION
)
919 output_constant_pool (fnname
, decl
);
921 #ifdef ASM_OUTPUT_SECTION_NAME
922 /* If the function is to be put in its own section and it's not in a section
923 already, indicate so. */
924 if ((flag_function_sections
925 && DECL_SECTION_NAME (decl
) == NULL_TREE
)
926 || UNIQUE_SECTION_P (decl
))
927 UNIQUE_SECTION (decl
, 0);
930 function_section (decl
);
932 /* Tell assembler to move to target machine's alignment for functions. */
933 align
= floor_log2 (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
935 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
937 /* Handle a user-specified function alignment.
938 Note that we still need to align to FUNCTION_BOUNDARY, as above,
939 because ASM_OUTPUT_MAX_SKIP_ALIGN might not do any alignment at all. */
940 if (align_functions_log
> align
)
942 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
943 ASM_OUTPUT_MAX_SKIP_ALIGN (asm_out_file
,
944 align_functions_log
, align_functions
-1);
946 ASM_OUTPUT_ALIGN (asm_out_file
, align_functions_log
);
950 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
951 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file
, fnname
);
954 #ifdef SDB_DEBUGGING_INFO
955 /* Output SDB definition of the function. */
956 if (write_symbols
== SDB_DEBUG
)
957 sdbout_mark_begin_function ();
960 #ifdef DBX_DEBUGGING_INFO
961 /* Output DBX definition of the function. */
962 if (write_symbols
== DBX_DEBUG
)
963 dbxout_begin_function (decl
);
966 /* Make function name accessible from other files, if appropriate. */
968 if (TREE_PUBLIC (decl
))
970 if (! first_global_object_name
)
975 STRIP_NAME_ENCODING (p
, fnname
);
976 name
= permalloc (strlen (p
) + 1);
979 if (! DECL_WEAK (decl
) && ! DECL_ONE_ONLY (decl
))
980 first_global_object_name
= name
;
982 weak_global_object_name
= name
;
985 #ifdef ASM_WEAKEN_LABEL
986 if (DECL_WEAK (decl
))
988 ASM_WEAKEN_LABEL (asm_out_file
, fnname
);
989 /* Remove this function from the pending weak list so that
990 we do not emit multiple .weak directives for it. */
991 remove_from_pending_weak_list
992 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
996 ASM_GLOBALIZE_LABEL (asm_out_file
, fnname
);
999 /* Do any machine/system dependent processing of the function name */
1000 #ifdef ASM_DECLARE_FUNCTION_NAME
1001 ASM_DECLARE_FUNCTION_NAME (asm_out_file
, fnname
, current_function_decl
);
1003 /* Standard thing is just output label for the function. */
1004 ASM_OUTPUT_LABEL (asm_out_file
, fnname
);
1005 #endif /* ASM_DECLARE_FUNCTION_NAME */
1008 /* Output assembler code associated with defining the size of the
1009 function. DECL describes the function. NAME is the function's name. */
1012 assemble_end_function (decl
, fnname
)
1016 #ifdef ASM_DECLARE_FUNCTION_SIZE
1017 ASM_DECLARE_FUNCTION_SIZE (asm_out_file
, fnname
, decl
);
1019 if (! CONSTANT_POOL_BEFORE_FUNCTION
)
1021 output_constant_pool (fnname
, decl
);
1022 function_section (decl
); /* need to switch back */
1025 /* Output any constants which should appear after the function. */
1026 output_after_function_constants ();
1029 /* Assemble code to leave SIZE bytes of zeros. */
1032 assemble_zeros (size
)
1035 /* Do no output if -fsyntax-only. */
1036 if (flag_syntax_only
)
1039 #ifdef ASM_NO_SKIP_IN_TEXT
1040 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
1041 so we must output 0s explicitly in the text section. */
1042 if (ASM_NO_SKIP_IN_TEXT
&& in_text_section ())
1046 for (i
= 0; i
< size
- 20; i
+= 20)
1049 fprintf (asm_out_file
,
1050 "%s0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n", ASM_BYTE_OP
);
1052 fprintf (asm_out_file
,
1053 "\tbyte 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n");
1059 fprintf (asm_out_file
, "%s0", ASM_BYTE_OP
);
1061 fprintf (asm_out_file
, "\tbyte 0");
1064 for (; i
< size
; i
++)
1065 fprintf (asm_out_file
, ",0");
1066 fprintf (asm_out_file
, "\n");
1072 ASM_OUTPUT_SKIP (asm_out_file
, size
);
1075 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
1078 assemble_align (align
)
1081 if (align
> BITS_PER_UNIT
)
1082 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
1085 /* Assemble a string constant with the specified C string as contents. */
1088 assemble_string (p
, size
)
1095 /* If the string is very long, split it up. */
1099 int thissize
= size
- pos
;
1100 if (thissize
> maximum
)
1103 ASM_OUTPUT_ASCII (asm_out_file
, p
, thissize
);
1111 #if defined ASM_OUTPUT_ALIGNED_DECL_LOCAL
1112 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1113 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1115 #if defined ASM_OUTPUT_ALIGNED_LOCAL
1116 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1117 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, DECL_ALIGN (decl))
1119 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1120 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded)
1124 #if defined ASM_OUTPUT_ALIGNED_BSS
1125 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1126 ASM_OUTPUT_ALIGNED_BSS (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1128 #if defined ASM_OUTPUT_BSS
1129 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1130 ASM_OUTPUT_BSS (asm_out_file, decl, name, size, rounded)
1136 #if defined ASM_OUTPUT_ALIGNED_DECL_COMMON
1137 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1138 ASM_OUTPUT_ALIGNED_DECL_COMMON (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1140 #if defined ASM_OUTPUT_ALIGNED_COMMON
1141 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1142 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file, name, size, DECL_ALIGN (decl))
1144 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1145 ASM_OUTPUT_COMMON (asm_out_file, name, size, rounded)
1150 asm_emit_uninitialised (decl
, name
, size
, rounded
)
1153 int size ATTRIBUTE_UNUSED
;
1154 int rounded ATTRIBUTE_UNUSED
;
1162 destination
= asm_dest_local
;
1164 if (TREE_PUBLIC (decl
))
1166 #if defined ASM_EMIT_BSS
1167 if (! DECL_COMMON (decl
))
1168 destination
= asm_dest_bss
;
1171 destination
= asm_dest_common
;
1174 if (flag_shared_data
)
1176 switch (destination
)
1178 #ifdef ASM_OUTPUT_SHARED_BSS
1180 ASM_OUTPUT_SHARED_BSS (asm_out_file
, decl
, name
, size
, rounded
);
1183 #ifdef ASM_OUTPUT_SHARED_COMMON
1184 case asm_dest_common
:
1185 ASM_OUTPUT_SHARED_COMMON (asm_out_file
, name
, size
, rounded
);
1188 #ifdef ASM_OUTPUT_SHARED_LOCAL
1189 case asm_dest_local
:
1190 ASM_OUTPUT_SHARED_LOCAL (asm_out_file
, name
, size
, rounded
);
1198 #ifdef ASM_OUTPUT_SECTION_NAME
1199 /* We already know that DECL_SECTION_NAME() == NULL. */
1200 if (flag_data_sections
!= 0 || UNIQUE_SECTION_P (decl
))
1201 UNIQUE_SECTION (decl
, 0);
1204 switch (destination
)
1208 ASM_EMIT_BSS (decl
, name
, size
, rounded
);
1211 case asm_dest_common
:
1212 ASM_EMIT_COMMON (decl
, name
, size
, rounded
);
1214 case asm_dest_local
:
1215 ASM_EMIT_LOCAL (decl
, name
, size
, rounded
);
1224 /* Assemble everything that is needed for a variable or function declaration.
1225 Not used for automatic variables, and not used for function definitions.
1226 Should not be called for variables of incomplete structure type.
1228 TOP_LEVEL is nonzero if this variable has file scope.
1229 AT_END is nonzero if this is the special handling, at end of compilation,
1230 to define things that have had only tentative definitions.
1231 DONT_OUTPUT_DATA if nonzero means don't actually output the
1232 initial value (that will be done by the caller). */
1235 assemble_variable (decl
, top_level
, at_end
, dont_output_data
)
1237 int top_level ATTRIBUTE_UNUSED
;
1238 int at_end ATTRIBUTE_UNUSED
;
1239 int dont_output_data
;
1241 register const char *name
;
1244 enum in_section saved_in_section
;
1246 last_assemble_variable_decl
= 0;
1248 if (DECL_RTL_SET_P (decl
) && GET_CODE (DECL_RTL (decl
)) == REG
)
1250 /* Do output symbol info for global register variables, but do nothing
1253 if (TREE_ASM_WRITTEN (decl
))
1255 TREE_ASM_WRITTEN (decl
) = 1;
1257 /* Do no output if -fsyntax-only. */
1258 if (flag_syntax_only
)
1261 #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
1262 /* File-scope global variables are output here. */
1263 if ((write_symbols
== DBX_DEBUG
|| write_symbols
== XCOFF_DEBUG
)
1265 dbxout_symbol (decl
, 0);
1267 #ifdef SDB_DEBUGGING_INFO
1268 if (write_symbols
== SDB_DEBUG
&& top_level
1269 /* Leave initialized global vars for end of compilation;
1270 see comment in compile_file. */
1271 && (TREE_PUBLIC (decl
) == 0 || DECL_INITIAL (decl
) == 0))
1272 sdbout_symbol (decl
, 0);
1275 /* Don't output any DWARF debugging information for variables here.
1276 In the case of local variables, the information for them is output
1277 when we do our recursive traversal of the tree representation for
1278 the entire containing function. In the case of file-scope variables,
1279 we output information for all of them at the very end of compilation
1280 while we are doing our final traversal of the chain of file-scope
1286 /* Normally no need to say anything here for external references,
1287 since assemble_external is called by the language-specific code
1288 when a declaration is first seen. */
1290 if (DECL_EXTERNAL (decl
))
1293 /* Output no assembler code for a function declaration.
1294 Only definitions of functions output anything. */
1296 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1299 /* If type was incomplete when the variable was declared,
1300 see if it is complete now. */
1302 if (DECL_SIZE (decl
) == 0)
1303 layout_decl (decl
, 0);
1305 /* Still incomplete => don't allocate it; treat the tentative defn
1306 (which is what it must have been) as an `extern' reference. */
1308 if (!dont_output_data
&& DECL_SIZE (decl
) == 0)
1310 error_with_file_and_line (DECL_SOURCE_FILE (decl
),
1311 DECL_SOURCE_LINE (decl
),
1312 "storage size of `%s' isn't known",
1313 IDENTIFIER_POINTER (DECL_NAME (decl
)));
1314 TREE_ASM_WRITTEN (decl
) = 1;
1318 /* The first declaration of a variable that comes through this function
1319 decides whether it is global (in C, has external linkage)
1320 or local (in C, has internal linkage). So do nothing more
1321 if this function has already run. */
1323 if (TREE_ASM_WRITTEN (decl
))
1326 TREE_ASM_WRITTEN (decl
) = 1;
1328 /* Do no output if -fsyntax-only. */
1329 if (flag_syntax_only
)
1334 if (! dont_output_data
1335 && ! host_integerp (DECL_SIZE_UNIT (decl
), 1))
1337 error_with_decl (decl
, "size of variable `%s' is too large");
1341 name
= XSTR (XEXP (DECL_RTL (decl
), 0), 0);
1342 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
)
1343 && ! first_global_object_name
1344 && ! (DECL_COMMON (decl
) && (DECL_INITIAL (decl
) == 0
1345 || DECL_INITIAL (decl
) == error_mark_node
))
1346 && ! DECL_WEAK (decl
)
1347 && ! DECL_ONE_ONLY (decl
))
1352 STRIP_NAME_ENCODING (p
, name
);
1353 xname
= permalloc (strlen (p
) + 1);
1355 first_global_object_name
= xname
;
1358 /* Compute the alignment of this data. */
1360 align
= DECL_ALIGN (decl
);
1362 /* In the case for initialing an array whose length isn't specified,
1363 where we have not yet been able to do the layout,
1364 figure out the proper alignment now. */
1365 if (dont_output_data
&& DECL_SIZE (decl
) == 0
1366 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
)
1367 align
= MAX (align
, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl
))));
1369 /* Some object file formats have a maximum alignment which they support.
1370 In particular, a.out format supports a maximum alignment of 4. */
1371 #ifndef MAX_OFILE_ALIGNMENT
1372 #define MAX_OFILE_ALIGNMENT BIGGEST_ALIGNMENT
1374 if (align
> MAX_OFILE_ALIGNMENT
)
1376 warning_with_decl (decl
,
1377 "alignment of `%s' is greater than maximum object file alignment. Using %d.",
1378 MAX_OFILE_ALIGNMENT
/BITS_PER_UNIT
);
1379 align
= MAX_OFILE_ALIGNMENT
;
1382 /* On some machines, it is good to increase alignment sometimes. */
1383 #ifdef DATA_ALIGNMENT
1384 align
= DATA_ALIGNMENT (TREE_TYPE (decl
), align
);
1386 #ifdef CONSTANT_ALIGNMENT
1387 if (DECL_INITIAL (decl
) != 0 && DECL_INITIAL (decl
) != error_mark_node
)
1388 align
= CONSTANT_ALIGNMENT (DECL_INITIAL (decl
), align
);
1391 /* Reset the alignment in case we have made it tighter, so we can benefit
1392 from it in get_pointer_alignment. */
1393 DECL_ALIGN (decl
) = align
;
1395 /* Handle uninitialized definitions. */
1397 if ((DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
)
1398 /* If the target can't output uninitialized but not common global data
1399 in .bss, then we have to use .data. */
1400 #if ! defined ASM_EMIT_BSS
1401 && DECL_COMMON (decl
)
1403 && DECL_SECTION_NAME (decl
) == NULL_TREE
1404 && ! dont_output_data
)
1406 unsigned HOST_WIDE_INT size
= tree_low_cst (DECL_SIZE_UNIT (decl
), 1);
1407 unsigned HOST_WIDE_INT rounded
= size
;
1409 /* Don't allocate zero bytes of common,
1410 since that means "undefined external" in the linker. */
1414 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1415 so that each uninitialized object starts on such a boundary. */
1416 rounded
+= (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1;
1417 rounded
= (rounded
/ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1418 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1420 /* Don't continue this line--convex cc version 4.1 would lose. */
1421 #if !defined(ASM_OUTPUT_ALIGNED_COMMON) && !defined(ASM_OUTPUT_ALIGNED_DECL_COMMON) && !defined(ASM_OUTPUT_ALIGNED_BSS)
1422 if ((unsigned HOST_WIDE_INT
) DECL_ALIGN (decl
) / BITS_PER_UNIT
> rounded
)
1424 (decl
, "requested alignment for %s is greater than implemented alignment of %d.",rounded
);
1427 #ifdef DBX_DEBUGGING_INFO
1428 /* File-scope global variables are output here. */
1429 if (write_symbols
== DBX_DEBUG
&& top_level
)
1430 dbxout_symbol (decl
, 0);
1432 #ifdef SDB_DEBUGGING_INFO
1433 if (write_symbols
== SDB_DEBUG
&& top_level
1434 /* Leave initialized global vars for end of compilation;
1435 see comment in compile_file. */
1436 && (TREE_PUBLIC (decl
) == 0 || DECL_INITIAL (decl
) == 0))
1437 sdbout_symbol (decl
, 0);
1440 /* Don't output any DWARF debugging information for variables here.
1441 In the case of local variables, the information for them is output
1442 when we do our recursive traversal of the tree representation for
1443 the entire containing function. In the case of file-scope variables,
1444 we output information for all of them at the very end of compilation
1445 while we are doing our final traversal of the chain of file-scope
1448 #if 0 /* ??? We should either delete this or add a comment describing what
1449 it was intended to do and why we shouldn't delete it. */
1450 if (flag_shared_data
)
1453 asm_emit_uninitialised (decl
, name
, size
, rounded
);
1458 /* Handle initialized definitions.
1459 Also handle uninitialized global definitions if -fno-common and the
1460 target doesn't support ASM_OUTPUT_BSS. */
1462 /* First make the assembler name(s) global if appropriate. */
1463 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
))
1465 #ifdef ASM_WEAKEN_LABEL
1466 if (DECL_WEAK (decl
))
1468 ASM_WEAKEN_LABEL (asm_out_file
, name
);
1469 /* Remove this variable from the pending weak list so that
1470 we do not emit multiple .weak directives for it. */
1471 remove_from_pending_weak_list
1472 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
1476 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
1479 for (d
= equivalents
; d
; d
= TREE_CHAIN (d
))
1481 tree e
= TREE_VALUE (d
);
1482 if (TREE_PUBLIC (e
) && DECL_NAME (e
))
1483 ASM_GLOBALIZE_LABEL (asm_out_file
,
1484 XSTR (XEXP (DECL_RTL (e
), 0), 0));
1488 /* Output any data that we will need to use the address of. */
1489 if (DECL_INITIAL (decl
) == error_mark_node
)
1490 reloc
= contains_pointers_p (TREE_TYPE (decl
));
1491 else if (DECL_INITIAL (decl
))
1492 reloc
= output_addressed_constants (DECL_INITIAL (decl
));
1494 #ifdef ASM_OUTPUT_SECTION_NAME
1495 if ((flag_data_sections
!= 0 && DECL_SECTION_NAME (decl
) == NULL_TREE
)
1496 || UNIQUE_SECTION_P (decl
))
1497 UNIQUE_SECTION (decl
, reloc
);
1500 /* Switch to the appropriate section. */
1501 variable_section (decl
, reloc
);
1503 /* dbxout.c needs to know this. */
1504 if (in_text_section ())
1505 DECL_IN_TEXT_SECTION (decl
) = 1;
1507 /* Record current section so we can restore it if dbxout.c clobbers it. */
1508 saved_in_section
= in_section
;
1510 /* Output the dbx info now that we have chosen the section. */
1512 #ifdef DBX_DEBUGGING_INFO
1513 /* File-scope global variables are output here. */
1514 if (write_symbols
== DBX_DEBUG
&& top_level
)
1515 dbxout_symbol (decl
, 0);
1517 #ifdef SDB_DEBUGGING_INFO
1518 if (write_symbols
== SDB_DEBUG
&& top_level
1519 /* Leave initialized global vars for end of compilation;
1520 see comment in compile_file. */
1521 && (TREE_PUBLIC (decl
) == 0 || DECL_INITIAL (decl
) == 0))
1522 sdbout_symbol (decl
, 0);
1525 /* Don't output any DWARF debugging information for variables here.
1526 In the case of local variables, the information for them is output
1527 when we do our recursive traversal of the tree representation for
1528 the entire containing function. In the case of file-scope variables,
1529 we output information for all of them at the very end of compilation
1530 while we are doing our final traversal of the chain of file-scope
1533 /* If the debugging output changed sections, reselect the section
1534 that's supposed to be selected. */
1535 if (in_section
!= saved_in_section
)
1536 variable_section (decl
, reloc
);
1538 /* Output the alignment of this data. */
1539 if (align
> BITS_PER_UNIT
)
1540 ASM_OUTPUT_ALIGN (asm_out_file
,
1541 floor_log2 (DECL_ALIGN (decl
) / BITS_PER_UNIT
));
1543 /* Do any machine/system dependent processing of the object. */
1544 #ifdef ASM_DECLARE_OBJECT_NAME
1545 last_assemble_variable_decl
= decl
;
1546 ASM_DECLARE_OBJECT_NAME (asm_out_file
, name
, decl
);
1548 /* Standard thing is just output label for the object. */
1549 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1550 #endif /* ASM_DECLARE_OBJECT_NAME */
1552 if (!dont_output_data
)
1554 if (DECL_INITIAL (decl
))
1555 /* Output the actual data. */
1556 output_constant (DECL_INITIAL (decl
),
1557 tree_low_cst (DECL_SIZE_UNIT (decl
), 1));
1559 /* Leave space for it. */
1560 assemble_zeros (tree_low_cst (DECL_SIZE_UNIT (decl
), 1));
1564 #ifdef XCOFF_DEBUGGING_INFO
1565 /* Unfortunately, the IBM assembler cannot handle stabx before the actual
1566 declaration. When something like ".stabx "aa:S-2",aa,133,0" is emitted
1567 and `aa' hasn't been output yet, the assembler generates a stab entry with
1568 a value of zero, in addition to creating an unnecessary external entry
1569 for `aa'. Hence, we must postpone dbxout_symbol to here at the end. */
1571 /* File-scope global variables are output here. */
1572 if (write_symbols
== XCOFF_DEBUG
&& top_level
)
1574 saved_in_section
= in_section
;
1576 dbxout_symbol (decl
, 0);
1578 if (in_section
!= saved_in_section
)
1579 variable_section (decl
, reloc
);
1582 /* There must be a statement after a label. */
1587 /* Return 1 if type TYPE contains any pointers. */
1590 contains_pointers_p (type
)
1593 switch (TREE_CODE (type
))
1596 case REFERENCE_TYPE
:
1597 /* I'm not sure whether OFFSET_TYPE needs this treatment,
1598 so I'll play safe and return 1. */
1604 case QUAL_UNION_TYPE
:
1607 /* For a type that has fields, see if the fields have pointers. */
1608 for (fields
= TYPE_FIELDS (type
); fields
; fields
= TREE_CHAIN (fields
))
1609 if (TREE_CODE (fields
) == FIELD_DECL
1610 && contains_pointers_p (TREE_TYPE (fields
)))
1616 /* An array type contains pointers if its element type does. */
1617 return contains_pointers_p (TREE_TYPE (type
));
1624 /* Output something to declare an external symbol to the assembler.
1625 (Most assemblers don't need this, so we normally output nothing.)
1626 Do nothing if DECL is not external. */
1629 assemble_external (decl
)
1630 tree decl ATTRIBUTE_UNUSED
;
1632 #ifdef ASM_OUTPUT_EXTERNAL
1633 if (DECL_P (decl
) && DECL_EXTERNAL (decl
) && TREE_PUBLIC (decl
))
1635 rtx rtl
= DECL_RTL (decl
);
1637 if (GET_CODE (rtl
) == MEM
&& GET_CODE (XEXP (rtl
, 0)) == SYMBOL_REF
1638 && ! SYMBOL_REF_USED (XEXP (rtl
, 0)))
1640 /* Some systems do require some output. */
1641 SYMBOL_REF_USED (XEXP (rtl
, 0)) = 1;
1642 ASM_OUTPUT_EXTERNAL (asm_out_file
, decl
, XSTR (XEXP (rtl
, 0), 0));
1648 /* Similar, for calling a library function FUN. */
1651 assemble_external_libcall (fun
)
1652 rtx fun ATTRIBUTE_UNUSED
;
1654 #ifdef ASM_OUTPUT_EXTERNAL_LIBCALL
1655 /* Declare library function name external when first used, if nec. */
1656 if (! SYMBOL_REF_USED (fun
))
1658 SYMBOL_REF_USED (fun
) = 1;
1659 ASM_OUTPUT_EXTERNAL_LIBCALL (asm_out_file
, fun
);
1664 /* Declare the label NAME global. */
1667 assemble_global (name
)
1670 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
1673 /* Assemble a label named NAME. */
1676 assemble_label (name
)
1679 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1682 /* Output to FILE a reference to the assembler name of a C-level name NAME.
1683 If NAME starts with a *, the rest of NAME is output verbatim.
1684 Otherwise NAME is transformed in an implementation-defined way
1685 (usually by the addition of an underscore).
1686 Many macros in the tm file are defined to call this function. */
1689 assemble_name (file
, name
)
1693 const char *real_name
;
1696 STRIP_NAME_ENCODING (real_name
, name
);
1697 if (flag_prefix_function_name
1698 && ! memcmp (real_name
, CHKR_PREFIX
, CHKR_PREFIX_SIZE
))
1699 real_name
= real_name
+ CHKR_PREFIX_SIZE
;
1701 id
= maybe_get_identifier (real_name
);
1703 TREE_SYMBOL_REFERENCED (id
) = 1;
1706 fputs (&name
[1], file
);
1708 ASM_OUTPUT_LABELREF (file
, name
);
1711 /* Allocate SIZE bytes writable static space with a gensym name
1712 and return an RTX to refer to its address. */
1715 assemble_static_space (size
)
1719 const char *namestring
;
1723 if (flag_shared_data
)
1727 ASM_GENERATE_INTERNAL_LABEL (name
, "LF", const_labelno
);
1729 namestring
= ggc_strdup (name
);
1731 x
= gen_rtx_SYMBOL_REF (Pmode
, namestring
);
1733 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
1734 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file
, NULL_TREE
, name
, size
,
1737 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1738 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file
, name
, size
, BIGGEST_ALIGNMENT
);
1741 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1742 so that each uninitialized object starts on such a boundary. */
1743 /* Variable `rounded' might or might not be used in ASM_OUTPUT_LOCAL. */
1744 int rounded ATTRIBUTE_UNUSED
1745 = ((size
+ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1)
1746 / (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1747 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1748 ASM_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
1755 /* Assemble the static constant template for function entry trampolines.
1756 This is done at most once per compilation.
1757 Returns an RTX for the address of the template. */
1759 #ifdef TRAMPOLINE_TEMPLATE
1761 assemble_trampoline_template ()
1767 /* By default, put trampoline templates in read-only data section. */
1769 #ifdef TRAMPOLINE_SECTION
1770 TRAMPOLINE_SECTION ();
1772 readonly_data_section ();
1775 /* Write the assembler code to define one. */
1776 align
= floor_log2 (TRAMPOLINE_ALIGNMENT
/ BITS_PER_UNIT
);
1778 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1780 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LTRAMP", 0);
1781 TRAMPOLINE_TEMPLATE (asm_out_file
);
1783 /* Record the rtl to refer to it. */
1784 ASM_GENERATE_INTERNAL_LABEL (label
, "LTRAMP", 0);
1785 name
= ggc_strdup (label
);
1786 return gen_rtx_SYMBOL_REF (Pmode
, name
);
1790 /* Assemble the integer constant X into an object of SIZE bytes.
1791 X must be either a CONST_INT or CONST_DOUBLE.
1793 Return 1 if we were able to output the constant, otherwise 0. If FORCE is
1794 non-zero, abort if we can't output the constant. */
1797 assemble_integer (x
, size
, force
)
1802 /* First try to use the standard 1, 2, 4, 8, and 16 byte
1803 ASM_OUTPUT... macros. */
1807 #ifdef ASM_OUTPUT_CHAR
1809 ASM_OUTPUT_CHAR (asm_out_file
, x
);
1813 #ifdef ASM_OUTPUT_SHORT
1815 ASM_OUTPUT_SHORT (asm_out_file
, x
);
1819 #ifdef ASM_OUTPUT_INT
1821 ASM_OUTPUT_INT (asm_out_file
, x
);
1825 #ifdef ASM_OUTPUT_DOUBLE_INT
1827 ASM_OUTPUT_DOUBLE_INT (asm_out_file
, x
);
1831 #ifdef ASM_OUTPUT_QUADRUPLE_INT
1833 ASM_OUTPUT_QUADRUPLE_INT (asm_out_file
, x
);
1838 /* If we couldn't do it that way, there are two other possibilities: First,
1839 if the machine can output an explicit byte and this is a 1 byte constant,
1840 we can use ASM_OUTPUT_BYTE. */
1842 #ifdef ASM_OUTPUT_BYTE
1843 if (size
== 1 && GET_CODE (x
) == CONST_INT
)
1845 ASM_OUTPUT_BYTE (asm_out_file
, INTVAL (x
));
1850 /* Finally, if SIZE is larger than a single word, try to output the constant
1851 one word at a time. */
1853 if (size
> UNITS_PER_WORD
)
1856 enum machine_mode mode
1857 = mode_for_size (size
* BITS_PER_UNIT
, MODE_INT
, 0);
1860 for (i
= 0; i
< size
/ UNITS_PER_WORD
; i
++)
1862 word
= operand_subword (x
, i
, 0, mode
);
1867 if (! assemble_integer (word
, UNITS_PER_WORD
, 0))
1871 if (i
== size
/ UNITS_PER_WORD
)
1873 /* If we output at least one word and then could not finish,
1874 there is no valid way to continue. */
1885 /* Assemble the floating-point constant D into an object of size MODE. */
1888 assemble_real (d
, mode
)
1890 enum machine_mode mode
;
1892 jmp_buf output_constant_handler
;
1894 if (setjmp (output_constant_handler
))
1896 error ("floating point trap outputting a constant");
1897 #ifdef REAL_IS_NOT_DOUBLE
1898 memset ((char *) &d
, 0, sizeof d
);
1905 set_float_handler (output_constant_handler
);
1909 #ifdef ASM_OUTPUT_BYTE_FLOAT
1911 ASM_OUTPUT_BYTE_FLOAT (asm_out_file
, d
);
1914 #ifdef ASM_OUTPUT_SHORT_FLOAT
1916 ASM_OUTPUT_SHORT_FLOAT (asm_out_file
, d
);
1919 #ifdef ASM_OUTPUT_THREE_QUARTER_FLOAT
1921 ASM_OUTPUT_THREE_QUARTER_FLOAT (asm_out_file
, d
);
1924 #ifdef ASM_OUTPUT_FLOAT
1926 ASM_OUTPUT_FLOAT (asm_out_file
, d
);
1930 #ifdef ASM_OUTPUT_DOUBLE
1932 ASM_OUTPUT_DOUBLE (asm_out_file
, d
);
1936 #ifdef ASM_OUTPUT_LONG_DOUBLE
1939 ASM_OUTPUT_LONG_DOUBLE (asm_out_file
, d
);
1947 set_float_handler (NULL_PTR
);
1950 /* Here we combine duplicate floating constants to make
1951 CONST_DOUBLE rtx's, and force those out to memory when necessary. */
1953 /* Return a CONST_DOUBLE or CONST_INT for a value specified as a pair of ints.
1954 For an integer, I0 is the low-order word and I1 is the high-order word.
1955 For a real number, I0 is the word with the low address
1956 and I1 is the word with the high address. */
1959 immed_double_const (i0
, i1
, mode
)
1960 HOST_WIDE_INT i0
, i1
;
1961 enum machine_mode mode
;
1965 if (GET_MODE_CLASS (mode
) == MODE_INT
1966 || GET_MODE_CLASS (mode
) == MODE_PARTIAL_INT
)
1968 /* We clear out all bits that don't belong in MODE, unless they and our
1969 sign bit are all one. So we get either a reasonable negative value
1970 or a reasonable unsigned value for this mode. */
1971 int width
= GET_MODE_BITSIZE (mode
);
1972 if (width
< HOST_BITS_PER_WIDE_INT
1973 && ((i0
& ((HOST_WIDE_INT
) (-1) << (width
- 1)))
1974 != ((HOST_WIDE_INT
) (-1) << (width
- 1))))
1975 i0
&= ((HOST_WIDE_INT
) 1 << width
) - 1, i1
= 0;
1976 else if (width
== HOST_BITS_PER_WIDE_INT
1977 && ! (i1
== ~0 && i0
< 0))
1979 else if (width
> 2 * HOST_BITS_PER_WIDE_INT
)
1980 /* We cannot represent this value as a constant. */
1983 /* If this would be an entire word for the target, but is not for
1984 the host, then sign-extend on the host so that the number will look
1985 the same way on the host that it would on the target.
1987 For example, when building a 64 bit alpha hosted 32 bit sparc
1988 targeted compiler, then we want the 32 bit unsigned value -1 to be
1989 represented as a 64 bit value -1, and not as 0x00000000ffffffff.
1990 The later confuses the sparc backend. */
1992 if (BITS_PER_WORD
< HOST_BITS_PER_WIDE_INT
&& BITS_PER_WORD
== width
1993 && (i0
& ((HOST_WIDE_INT
) 1 << (width
- 1))))
1994 i0
|= ((HOST_WIDE_INT
) (-1) << width
);
1996 /* If MODE fits within HOST_BITS_PER_WIDE_INT, always use a CONST_INT.
1998 ??? Strictly speaking, this is wrong if we create a CONST_INT
1999 for a large unsigned constant with the size of MODE being
2000 HOST_BITS_PER_WIDE_INT and later try to interpret that constant in a
2001 wider mode. In that case we will mis-interpret it as a negative
2004 Unfortunately, the only alternative is to make a CONST_DOUBLE
2005 for any constant in any mode if it is an unsigned constant larger
2006 than the maximum signed integer in an int on the host. However,
2007 doing this will break everyone that always expects to see a CONST_INT
2008 for SImode and smaller.
2010 We have always been making CONST_INTs in this case, so nothing new
2013 if (width
<= HOST_BITS_PER_WIDE_INT
)
2014 i1
= (i0
< 0) ? ~(HOST_WIDE_INT
) 0 : 0;
2016 /* If this integer fits in one word, return a CONST_INT. */
2017 if ((i1
== 0 && i0
>= 0)
2018 || (i1
== ~0 && i0
< 0))
2019 return GEN_INT (i0
);
2021 /* We use VOIDmode for integers. */
2025 /* Search the chain for an existing CONST_DOUBLE with the right value.
2026 If one is found, return it. */
2028 for (r
= const_double_chain
; r
; r
= CONST_DOUBLE_CHAIN (r
))
2029 if (CONST_DOUBLE_LOW (r
) == i0
&& CONST_DOUBLE_HIGH (r
) == i1
2030 && GET_MODE (r
) == mode
)
2033 /* No; make a new one and add it to the chain. */
2034 r
= gen_rtx_CONST_DOUBLE (mode
, const0_rtx
, i0
, i1
);
2036 /* Don't touch const_double_chain if not inside any function. */
2037 if (current_function_decl
!= 0)
2039 CONST_DOUBLE_CHAIN (r
) = const_double_chain
;
2040 const_double_chain
= r
;
2046 /* Return a CONST_DOUBLE for a specified `double' value
2047 and machine mode. */
2050 immed_real_const_1 (d
, mode
)
2052 enum machine_mode mode
;
2054 union real_extract u
;
2057 /* Get the desired `double' value as a sequence of ints
2058 since that is how they are stored in a CONST_DOUBLE. */
2062 /* Detect special cases. But be careful we don't use a CONST_DOUBLE
2063 that's from a parent function since it may be in its constant pool. */
2064 if (REAL_VALUES_IDENTICAL (dconst0
, d
)
2065 && (cfun
== 0 || decl_function_context (current_function_decl
) == 0))
2066 return CONST0_RTX (mode
);
2068 /* Check for NaN first, because some ports (specifically the i386) do not
2069 emit correct ieee-fp code by default, and thus will generate a core
2070 dump here if we pass a NaN to REAL_VALUES_EQUAL and if REAL_VALUES_EQUAL
2071 does a floating point comparison. */
2072 else if ((! REAL_VALUE_ISNAN (d
) && REAL_VALUES_EQUAL (dconst1
, d
))
2074 || decl_function_context (current_function_decl
) == 0))
2075 return CONST1_RTX (mode
);
2077 if (sizeof u
== sizeof (HOST_WIDE_INT
))
2078 return immed_double_const (u
.i
[0], 0, mode
);
2079 if (sizeof u
== 2 * sizeof (HOST_WIDE_INT
))
2080 return immed_double_const (u
.i
[0], u
.i
[1], mode
);
2082 /* The rest of this function handles the case where
2083 a float value requires more than 2 ints of space.
2084 It will be deleted as dead code on machines that don't need it. */
2086 /* Search the chain for an existing CONST_DOUBLE with the right value.
2087 If one is found, return it. */
2089 for (r
= const_double_chain
; r
; r
= CONST_DOUBLE_CHAIN (r
))
2090 if (! memcmp ((char *) &CONST_DOUBLE_LOW (r
), (char *) &u
, sizeof u
)
2091 && GET_MODE (r
) == mode
)
2094 /* No; make a new one and add it to the chain.
2096 We may be called by an optimizer which may be discarding any memory
2097 allocated during its processing (such as combine and loop). However,
2098 we will be leaving this constant on the chain, so we cannot tolerate
2100 r
= rtx_alloc (CONST_DOUBLE
);
2102 memcpy ((char *) &CONST_DOUBLE_LOW (r
), (char *) &u
, sizeof u
);
2104 /* If we aren't inside a function, don't put r on the
2105 const_double_chain. */
2106 if (current_function_decl
!= 0)
2108 CONST_DOUBLE_CHAIN (r
) = const_double_chain
;
2109 const_double_chain
= r
;
2112 CONST_DOUBLE_CHAIN (r
) = NULL_RTX
;
2114 /* Store const0_rtx in CONST_DOUBLE_MEM since this CONST_DOUBLE is on the
2115 chain, but has not been allocated memory. Actual use of CONST_DOUBLE_MEM
2116 is only through force_const_mem. */
2118 CONST_DOUBLE_MEM (r
) = const0_rtx
;
2123 /* Return a CONST_DOUBLE rtx for a value specified by EXP,
2124 which must be a REAL_CST tree node. */
2127 immed_real_const (exp
)
2130 return immed_real_const_1 (TREE_REAL_CST (exp
), TYPE_MODE (TREE_TYPE (exp
)));
2133 /* At the end of a function, forget the memory-constants
2134 previously made for CONST_DOUBLEs. Mark them as not on real_constant_chain.
2135 Also clear out real_constant_chain and clear out all the chain-pointers. */
2138 clear_const_double_mem ()
2140 register rtx r
, next
;
2142 for (r
= const_double_chain
; r
; r
= next
)
2144 next
= CONST_DOUBLE_CHAIN (r
);
2145 CONST_DOUBLE_CHAIN (r
) = 0;
2146 CONST_DOUBLE_MEM (r
) = cc0_rtx
;
2148 const_double_chain
= 0;
2151 /* Given an expression EXP with a constant value,
2152 reduce it to the sum of an assembler symbol and an integer.
2153 Store them both in the structure *VALUE.
2154 Abort if EXP does not reduce. */
2159 HOST_WIDE_INT offset
;
2163 decode_addr_const (exp
, value
)
2165 struct addr_const
*value
;
2167 register tree target
= TREE_OPERAND (exp
, 0);
2168 register int offset
= 0;
2173 if (TREE_CODE (target
) == COMPONENT_REF
2174 && host_integerp (byte_position (TREE_OPERAND (target
, 1)), 0))
2177 offset
+= int_byte_position (TREE_OPERAND (target
, 1));
2178 target
= TREE_OPERAND (target
, 0);
2180 else if (TREE_CODE (target
) == ARRAY_REF
)
2182 offset
+= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (target
)), 1)
2183 * tree_low_cst (TREE_OPERAND (target
, 1), 0));
2184 target
= TREE_OPERAND (target
, 0);
2190 switch (TREE_CODE (target
))
2194 x
= DECL_RTL (target
);
2198 x
= gen_rtx_MEM (FUNCTION_MODE
,
2199 gen_rtx_LABEL_REF (VOIDmode
,
2200 label_rtx (TREE_OPERAND (exp
, 0))));
2208 x
= TREE_CST_RTL (target
);
2215 if (GET_CODE (x
) != MEM
)
2220 value
->offset
= offset
;
2223 enum kind
{ RTX_DOUBLE
, RTX_INT
};
2226 ENUM_BITFIELD(kind
) kind
: 16;
2227 ENUM_BITFIELD(machine_mode
) mode
: 16;
2229 union real_extract du
;
2230 struct addr_const addr
;
2231 struct {HOST_WIDE_INT high
, low
;} di
;
2235 /* Uniquize all constants that appear in memory.
2236 Each constant in memory thus far output is recorded
2237 in `const_hash_table' with a `struct constant_descriptor'
2238 that contains a polish representation of the value of
2241 We cannot store the trees in the hash table
2242 because the trees may be temporary. */
2244 struct constant_descriptor
2246 struct constant_descriptor
*next
;
2249 /* Make sure the data is reasonably aligned. */
2252 unsigned char contents
[1];
2253 #ifdef HAVE_LONG_DOUBLE
2262 #define MAX_HASH_TABLE 1009
2263 static struct constant_descriptor
*const_hash_table
[MAX_HASH_TABLE
];
2265 #define STRHASH(x) ((hashval_t)((long)(x) >> 3))
2267 struct deferred_string
2274 static htab_t const_str_htab
;
2276 /* Mark a const_hash_table descriptor for GC. */
2279 mark_const_hash_entry (ptr
)
2282 struct constant_descriptor
*desc
= * (struct constant_descriptor
**) ptr
;
2286 ggc_mark_rtx (desc
->rtl
);
2291 /* Mark the hash-table element X (which is really a pointer to an
2292 struct deferred_string *). */
2295 mark_const_str_htab_1 (x
, data
)
2297 void *data ATTRIBUTE_UNUSED
;
2299 ggc_mark_tree (((struct deferred_string
*) *x
)->exp
);
2303 /* Mark a const_str_htab for GC. */
2306 mark_const_str_htab (htab
)
2309 htab_traverse (*((htab_t
*) htab
), mark_const_str_htab_1
, NULL
);
2312 /* Returns a hash code for X (which is a really a
2313 struct deferred_string *). */
2316 const_str_htab_hash (x
)
2319 return STRHASH (((const struct deferred_string
*) x
)->label
);
2322 /* Returns non-zero if the value represented by X (which is really a
2323 struct deferred_string *) is the same as that given by Y
2324 (which is really a char *). */
2327 const_str_htab_eq (x
, y
)
2331 return (((const struct deferred_string
*) x
)->label
== (const char *) y
);
2334 /* Delete the hash table entry dfsp. */
2337 const_str_htab_del (dfsp
)
2343 /* Compute a hash code for a constant expression. */
2349 register const char *p
;
2350 register int len
, hi
, i
;
2351 register enum tree_code code
= TREE_CODE (exp
);
2353 /* Either set P and LEN to the address and len of something to hash and
2354 exit the switch or return a value. */
2359 p
= (char *) &TREE_INT_CST (exp
);
2360 len
= sizeof TREE_INT_CST (exp
);
2364 p
= (char *) &TREE_REAL_CST (exp
);
2365 len
= sizeof TREE_REAL_CST (exp
);
2369 p
= TREE_STRING_POINTER (exp
);
2370 len
= TREE_STRING_LENGTH (exp
);
2374 return (const_hash (TREE_REALPART (exp
)) * 5
2375 + const_hash (TREE_IMAGPART (exp
)));
2378 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2382 len
= int_size_in_bytes (TREE_TYPE (exp
));
2383 tmp
= (char *) alloca (len
);
2384 get_set_constructor_bytes (exp
, (unsigned char *) tmp
, len
);
2392 /* For record type, include the type in the hashing.
2393 We do not do so for array types
2394 because (1) the sizes of the elements are sufficient
2395 and (2) distinct array types can have the same constructor.
2396 Instead, we include the array size because the constructor could
2398 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2399 hi
= ((unsigned long) TREE_TYPE (exp
) & ((1 << HASHBITS
) - 1))
2402 hi
= ((5 + int_size_in_bytes (TREE_TYPE (exp
)))
2403 & ((1 << HASHBITS
) - 1)) % MAX_HASH_TABLE
;
2405 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2406 if (TREE_VALUE (link
))
2408 = (hi
* 603 + const_hash (TREE_VALUE (link
))) % MAX_HASH_TABLE
;
2415 struct addr_const value
;
2417 decode_addr_const (exp
, &value
);
2418 if (GET_CODE (value
.base
) == SYMBOL_REF
)
2420 /* Don't hash the address of the SYMBOL_REF;
2421 only use the offset and the symbol name. */
2423 p
= XSTR (value
.base
, 0);
2424 for (i
= 0; p
[i
] != 0; i
++)
2425 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2427 else if (GET_CODE (value
.base
) == LABEL_REF
)
2428 hi
= value
.offset
+ CODE_LABEL_NUMBER (XEXP (value
.base
, 0)) * 13;
2432 hi
&= (1 << HASHBITS
) - 1;
2433 hi
%= MAX_HASH_TABLE
;
2439 return (const_hash (TREE_OPERAND (exp
, 0)) * 9
2440 + const_hash (TREE_OPERAND (exp
, 1)));
2444 case NON_LVALUE_EXPR
:
2445 return const_hash (TREE_OPERAND (exp
, 0)) * 7 + 2;
2448 /* A language specific constant. Just hash the code. */
2449 return (int) code
% MAX_HASH_TABLE
;
2452 /* Compute hashing function */
2454 for (i
= 0; i
< len
; i
++)
2455 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2457 hi
&= (1 << HASHBITS
) - 1;
2458 hi
%= MAX_HASH_TABLE
;
2462 /* Compare a constant expression EXP with a constant-descriptor DESC.
2463 Return 1 if DESC describes a constant with the same value as EXP. */
2466 compare_constant (exp
, desc
)
2468 struct constant_descriptor
*desc
;
2470 return 0 != compare_constant_1 (exp
, desc
->u
.contents
);
2473 /* Compare constant expression EXP with a substring P of a constant descriptor.
2474 If they match, return a pointer to the end of the substring matched.
2475 If they do not match, return 0.
2477 Since descriptors are written in polish prefix notation,
2478 this function can be used recursively to test one operand of EXP
2479 against a subdescriptor, and if it succeeds it returns the
2480 address of the subdescriptor for the next operand. */
2482 static const unsigned char *
2483 compare_constant_1 (exp
, p
)
2485 const unsigned char *p
;
2487 register const unsigned char *strp
;
2489 register enum tree_code code
= TREE_CODE (exp
);
2491 if (code
!= (enum tree_code
) *p
++)
2494 /* Either set STRP, P and LEN to pointers and length to compare and exit the
2495 switch, or return the result of the comparison. */
2500 /* Integer constants are the same only if the same width of type. */
2501 if (*p
++ != TYPE_PRECISION (TREE_TYPE (exp
)))
2504 strp
= (unsigned char *) &TREE_INT_CST (exp
);
2505 len
= sizeof TREE_INT_CST (exp
);
2509 /* Real constants are the same only if the same width of type. */
2510 if (*p
++ != TYPE_PRECISION (TREE_TYPE (exp
)))
2513 strp
= (unsigned char *) &TREE_REAL_CST (exp
);
2514 len
= sizeof TREE_REAL_CST (exp
);
2518 if (flag_writable_strings
)
2521 if ((enum machine_mode
) *p
++ != TYPE_MODE (TREE_TYPE (exp
)))
2524 strp
= (const unsigned char *)TREE_STRING_POINTER (exp
);
2525 len
= TREE_STRING_LENGTH (exp
);
2526 if (memcmp ((char *) &TREE_STRING_LENGTH (exp
), p
,
2527 sizeof TREE_STRING_LENGTH (exp
)))
2530 p
+= sizeof TREE_STRING_LENGTH (exp
);
2534 p
= compare_constant_1 (TREE_REALPART (exp
), p
);
2538 return compare_constant_1 (TREE_IMAGPART (exp
), p
);
2541 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2543 int xlen
= len
= int_size_in_bytes (TREE_TYPE (exp
));
2544 unsigned char *tmp
= (unsigned char *) alloca (len
);
2546 get_set_constructor_bytes (exp
, tmp
, len
);
2547 strp
= (unsigned char *) tmp
;
2548 if (memcmp ((char *) &xlen
, p
, sizeof xlen
))
2557 int length
= list_length (CONSTRUCTOR_ELTS (exp
));
2559 enum machine_mode mode
= TYPE_MODE (TREE_TYPE (exp
));
2560 int have_purpose
= 0;
2562 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2563 if (TREE_PURPOSE (link
))
2566 if (memcmp ((char *) &length
, p
, sizeof length
))
2571 /* For record constructors, insist that the types match.
2572 For arrays, just verify both constructors are for arrays.
2573 Then insist that either both or none have any TREE_PURPOSE
2575 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2576 type
= TREE_TYPE (exp
);
2580 if (memcmp ((char *) &type
, p
, sizeof type
))
2583 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2585 if (memcmp ((char *) &mode
, p
, sizeof mode
))
2593 if (memcmp ((char *) &have_purpose
, p
, sizeof have_purpose
))
2596 p
+= sizeof have_purpose
;
2598 /* For arrays, insist that the size in bytes match. */
2599 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2601 HOST_WIDE_INT size
= int_size_in_bytes (TREE_TYPE (exp
));
2603 if (memcmp ((char *) &size
, p
, sizeof size
))
2609 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2611 if (TREE_VALUE (link
))
2613 if ((p
= compare_constant_1 (TREE_VALUE (link
), p
)) == 0)
2620 if (memcmp ((char *) &zero
, p
, sizeof zero
))
2626 if (TREE_PURPOSE (link
)
2627 && TREE_CODE (TREE_PURPOSE (link
)) == FIELD_DECL
)
2629 if (memcmp ((char *) &TREE_PURPOSE (link
), p
,
2630 sizeof TREE_PURPOSE (link
)))
2633 p
+= sizeof TREE_PURPOSE (link
);
2635 else if (TREE_PURPOSE (link
))
2637 if ((p
= compare_constant_1 (TREE_PURPOSE (link
), p
)) == 0)
2640 else if (have_purpose
)
2644 if (memcmp ((char *) &zero
, p
, sizeof zero
))
2656 struct addr_const value
;
2658 decode_addr_const (exp
, &value
);
2659 strp
= (unsigned char *) &value
.offset
;
2660 len
= sizeof value
.offset
;
2661 /* Compare the offset. */
2663 if (*p
++ != *strp
++)
2666 /* Compare symbol name. */
2667 strp
= (const unsigned char *) XSTR (value
.base
, 0);
2668 len
= strlen ((const char *) strp
) + 1;
2675 p
= compare_constant_1 (TREE_OPERAND (exp
, 0), p
);
2679 return compare_constant_1 (TREE_OPERAND (exp
, 1), p
);
2683 case NON_LVALUE_EXPR
:
2684 return compare_constant_1 (TREE_OPERAND (exp
, 0), p
);
2687 if (lang_expand_constant
)
2689 exp
= (*lang_expand_constant
) (exp
);
2690 return compare_constant_1 (exp
, p
);
2695 /* Compare constant contents. */
2697 if (*p
++ != *strp
++)
2703 /* Construct a constant descriptor for the expression EXP.
2704 It is up to the caller to enter the descriptor in the hash table. */
2706 static struct constant_descriptor
*
2707 record_constant (exp
)
2710 struct constant_descriptor
*next
= 0;
2715 /* Make a struct constant_descriptor. The first three pointers will
2716 be filled in later. Here we just leave space for them. */
2718 obstack_grow (&permanent_obstack
, (char *) &next
, sizeof next
);
2719 obstack_grow (&permanent_obstack
, (char *) &label
, sizeof label
);
2720 obstack_grow (&permanent_obstack
, (char *) &rtl
, sizeof rtl
);
2722 /* Align the descriptor for the data payload. */
2723 pad
= (offsetof (struct constant_descriptor
, u
)
2724 - offsetof(struct constant_descriptor
, rtl
)
2725 - sizeof(next
->rtl
));
2727 obstack_blank (&permanent_obstack
, pad
);
2729 record_constant_1 (exp
);
2730 return (struct constant_descriptor
*) obstack_finish (&permanent_obstack
);
2733 /* Add a description of constant expression EXP
2734 to the object growing in `permanent_obstack'.
2735 No need to return its address; the caller will get that
2736 from the obstack when the object is complete. */
2739 record_constant_1 (exp
)
2742 register const unsigned char *strp
;
2744 register enum tree_code code
= TREE_CODE (exp
);
2746 obstack_1grow (&permanent_obstack
, (unsigned int) code
);
2751 obstack_1grow (&permanent_obstack
, TYPE_PRECISION (TREE_TYPE (exp
)));
2752 strp
= (unsigned char *) &TREE_INT_CST (exp
);
2753 len
= sizeof TREE_INT_CST (exp
);
2757 obstack_1grow (&permanent_obstack
, TYPE_PRECISION (TREE_TYPE (exp
)));
2758 strp
= (unsigned char *) &TREE_REAL_CST (exp
);
2759 len
= sizeof TREE_REAL_CST (exp
);
2763 if (flag_writable_strings
)
2766 obstack_1grow (&permanent_obstack
, TYPE_MODE (TREE_TYPE (exp
)));
2767 strp
= (const unsigned char *) TREE_STRING_POINTER (exp
);
2768 len
= TREE_STRING_LENGTH (exp
);
2769 obstack_grow (&permanent_obstack
, (char *) &TREE_STRING_LENGTH (exp
),
2770 sizeof TREE_STRING_LENGTH (exp
));
2774 record_constant_1 (TREE_REALPART (exp
));
2775 record_constant_1 (TREE_IMAGPART (exp
));
2779 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2781 int nbytes
= int_size_in_bytes (TREE_TYPE (exp
));
2782 obstack_grow (&permanent_obstack
, &nbytes
, sizeof (nbytes
));
2783 obstack_blank (&permanent_obstack
, nbytes
);
2784 get_set_constructor_bytes
2785 (exp
, (unsigned char *) permanent_obstack
.next_free
-nbytes
,
2792 int length
= list_length (CONSTRUCTOR_ELTS (exp
));
2793 enum machine_mode mode
= TYPE_MODE (TREE_TYPE (exp
));
2795 int have_purpose
= 0;
2797 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2798 if (TREE_PURPOSE (link
))
2801 obstack_grow (&permanent_obstack
, (char *) &length
, sizeof length
);
2803 /* For record constructors, insist that the types match.
2804 For arrays, just verify both constructors are for arrays
2805 of the same mode. Then insist that either both or none
2806 have any TREE_PURPOSE values. */
2807 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2808 type
= TREE_TYPE (exp
);
2812 obstack_grow (&permanent_obstack
, (char *) &type
, sizeof type
);
2813 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2814 obstack_grow (&permanent_obstack
, &mode
, sizeof mode
);
2816 obstack_grow (&permanent_obstack
, (char *) &have_purpose
,
2817 sizeof have_purpose
);
2819 /* For arrays, insist that the size in bytes match. */
2820 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2822 HOST_WIDE_INT size
= int_size_in_bytes (TREE_TYPE (exp
));
2823 obstack_grow (&permanent_obstack
, (char *) &size
, sizeof size
);
2826 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2828 if (TREE_VALUE (link
))
2829 record_constant_1 (TREE_VALUE (link
));
2834 obstack_grow (&permanent_obstack
,
2835 (char *) &zero
, sizeof zero
);
2838 if (TREE_PURPOSE (link
)
2839 && TREE_CODE (TREE_PURPOSE (link
)) == FIELD_DECL
)
2840 obstack_grow (&permanent_obstack
,
2841 (char *) &TREE_PURPOSE (link
),
2842 sizeof TREE_PURPOSE (link
));
2843 else if (TREE_PURPOSE (link
))
2844 record_constant_1 (TREE_PURPOSE (link
));
2845 else if (have_purpose
)
2849 obstack_grow (&permanent_obstack
,
2850 (char *) &zero
, sizeof zero
);
2858 struct addr_const value
;
2860 decode_addr_const (exp
, &value
);
2861 /* Record the offset. */
2862 obstack_grow (&permanent_obstack
,
2863 (char *) &value
.offset
, sizeof value
.offset
);
2865 switch (GET_CODE (value
.base
))
2868 /* Record the symbol name. */
2869 obstack_grow (&permanent_obstack
, XSTR (value
.base
, 0),
2870 strlen (XSTR (value
.base
, 0)) + 1);
2873 /* Record the address of the CODE_LABEL. It may not have
2874 been emitted yet, so it's UID may be zero. But pointer
2875 identity is good enough. */
2876 obstack_grow (&permanent_obstack
, &XEXP (value
.base
, 0),
2888 record_constant_1 (TREE_OPERAND (exp
, 0));
2889 record_constant_1 (TREE_OPERAND (exp
, 1));
2894 case NON_LVALUE_EXPR
:
2895 record_constant_1 (TREE_OPERAND (exp
, 0));
2899 if (lang_expand_constant
)
2901 exp
= (*lang_expand_constant
) (exp
);
2902 record_constant_1 (exp
);
2907 /* Record constant contents. */
2908 obstack_grow (&permanent_obstack
, strp
, len
);
2911 /* Record a list of constant expressions that were passed to
2912 output_constant_def but that could not be output right away. */
2914 struct deferred_constant
2916 struct deferred_constant
*next
;
2922 static struct deferred_constant
*deferred_constants
;
2924 /* Another list of constants which should be output after the
2926 static struct deferred_constant
*after_function_constants
;
2928 /* Nonzero means defer output of addressed subconstants
2929 (i.e., those for which output_constant_def is called.) */
2930 static int defer_addressed_constants_flag
;
2932 /* Start deferring output of subconstants. */
2935 defer_addressed_constants ()
2937 defer_addressed_constants_flag
++;
2940 /* Stop deferring output of subconstants,
2941 and output now all those that have been deferred. */
2944 output_deferred_addressed_constants ()
2946 struct deferred_constant
*p
, *next
;
2948 defer_addressed_constants_flag
--;
2950 if (defer_addressed_constants_flag
> 0)
2953 for (p
= deferred_constants
; p
; p
= next
)
2955 output_constant_def_contents (p
->exp
, p
->reloc
, p
->labelno
);
2960 deferred_constants
= 0;
2963 /* Output any constants which should appear after a function. */
2966 output_after_function_constants ()
2968 struct deferred_constant
*p
, *next
;
2970 for (p
= after_function_constants
; p
; p
= next
)
2972 output_constant_def_contents (p
->exp
, p
->reloc
, p
->labelno
);
2977 after_function_constants
= 0;
2980 /* Make a copy of the whole tree structure for a constant.
2981 This handles the same types of nodes that compare_constant
2982 and record_constant handle. */
2988 switch (TREE_CODE (exp
))
2991 /* For ADDR_EXPR, we do not want to copy the decl whose address
2992 is requested. We do want to copy constants though. */
2993 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, 0))) == 'c')
2994 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2995 copy_constant (TREE_OPERAND (exp
, 0)));
2997 return copy_node (exp
);
3002 return copy_node (exp
);
3005 return build_complex (TREE_TYPE (exp
),
3006 copy_constant (TREE_REALPART (exp
)),
3007 copy_constant (TREE_IMAGPART (exp
)));
3011 return build (TREE_CODE (exp
), TREE_TYPE (exp
),
3012 copy_constant (TREE_OPERAND (exp
, 0)),
3013 copy_constant (TREE_OPERAND (exp
, 1)));
3017 case NON_LVALUE_EXPR
:
3018 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
3019 copy_constant (TREE_OPERAND (exp
, 0)));
3023 tree copy
= copy_node (exp
);
3024 tree list
= copy_list (CONSTRUCTOR_ELTS (exp
));
3027 CONSTRUCTOR_ELTS (copy
) = list
;
3028 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
3029 TREE_VALUE (tail
) = copy_constant (TREE_VALUE (tail
));
3030 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
3031 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
3032 TREE_PURPOSE (tail
) = copy_constant (TREE_PURPOSE (tail
));
3042 /* Return an rtx representing a reference to constant data in memory
3043 for the constant expression EXP.
3045 If assembler code for such a constant has already been output,
3046 return an rtx to refer to it.
3047 Otherwise, output such a constant in memory (or defer it for later)
3048 and generate an rtx for it.
3050 If DEFER is non-zero, the output of string constants can be deferred
3051 and output only if referenced in the function after all optimizations.
3053 The TREE_CST_RTL of EXP is set up to point to that rtx.
3054 The const_hash_table records which constants already have label strings. */
3057 output_constant_def (exp
, defer
)
3062 register struct constant_descriptor
*desc
;
3063 struct deferred_string
**defstr
;
3067 int after_function
= 0;
3070 if (TREE_CST_RTL (exp
))
3071 return TREE_CST_RTL (exp
);
3073 /* Make sure any other constants whose addresses appear in EXP
3074 are assigned label numbers. */
3076 reloc
= output_addressed_constants (exp
);
3078 /* Compute hash code of EXP. Search the descriptors for that hash code
3079 to see if any of them describes EXP. If yes, the descriptor records
3080 the label number already assigned. */
3082 hash
= const_hash (exp
) % MAX_HASH_TABLE
;
3084 for (desc
= const_hash_table
[hash
]; desc
; desc
= desc
->next
)
3085 if (compare_constant (exp
, desc
))
3090 /* No constant equal to EXP is known to have been output.
3091 Make a constant descriptor to enter EXP in the hash table.
3092 Assign the label number and record it in the descriptor for
3093 future calls to this function to find. */
3095 /* Create a string containing the label name, in LABEL. */
3096 labelno
= const_labelno
++;
3097 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", labelno
);
3099 desc
= record_constant (exp
);
3100 desc
->next
= const_hash_table
[hash
];
3101 desc
->label
= ggc_strdup (label
);
3102 const_hash_table
[hash
] = desc
;
3104 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
3106 = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp
)),
3107 gen_rtx_SYMBOL_REF (Pmode
, desc
->label
));
3109 set_mem_attributes (desc
->rtl
, exp
, 1);
3114 TREE_CST_RTL (exp
) = desc
->rtl
;
3116 /* Optionally set flags or add text to the name to record information
3117 such as that it is a function name. If the name is changed, the macro
3118 ASM_OUTPUT_LABELREF will have to know how to strip this information. */
3119 #ifdef ENCODE_SECTION_INFO
3120 /* A previously-processed constant would already have section info
3124 ENCODE_SECTION_INFO (exp
);
3125 desc
->rtl
= TREE_CST_RTL (exp
);
3126 desc
->label
= XSTR (XEXP (desc
->rtl
, 0), 0);
3130 #ifdef CONSTANT_AFTER_FUNCTION_P
3131 if (current_function_decl
!= 0
3132 && CONSTANT_AFTER_FUNCTION_P (exp
))
3137 && STRING_POOL_ADDRESS_P (XEXP (desc
->rtl
, 0))
3138 && (!defer
|| defer_addressed_constants_flag
|| after_function
))
3140 defstr
= (struct deferred_string
**)
3141 htab_find_slot_with_hash (const_str_htab
, desc
->label
,
3142 STRHASH (desc
->label
), NO_INSERT
);
3145 /* If the string is currently deferred but we need to output it now,
3146 remove it from deferred string hash table. */
3148 labelno
= (*defstr
)->labelno
;
3149 STRING_POOL_ADDRESS_P (XEXP (desc
->rtl
, 0)) = 0;
3150 htab_clear_slot (const_str_htab
, (void **) defstr
);
3154 /* If this is the first time we've seen this particular constant,
3155 output it (or defer its output for later). */
3158 if (defer_addressed_constants_flag
|| after_function
)
3160 struct deferred_constant
*p
;
3161 p
= (struct deferred_constant
*) xmalloc (sizeof (struct deferred_constant
));
3163 p
->exp
= copy_constant (exp
);
3165 p
->labelno
= labelno
;
3168 p
->next
= after_function_constants
;
3169 after_function_constants
= p
;
3173 p
->next
= deferred_constants
;
3174 deferred_constants
= p
;
3179 /* Do no output if -fsyntax-only. */
3180 if (! flag_syntax_only
)
3182 if (TREE_CODE (exp
) != STRING_CST
3184 || flag_writable_strings
3185 || (defstr
= (struct deferred_string
**)
3186 htab_find_slot_with_hash (const_str_htab
,
3188 STRHASH (desc
->label
),
3190 output_constant_def_contents (exp
, reloc
, labelno
);
3193 struct deferred_string
*p
;
3195 p
= (struct deferred_string
*)
3196 xmalloc (sizeof (struct deferred_string
));
3198 p
->exp
= copy_constant (exp
);
3199 p
->label
= desc
->label
;
3200 p
->labelno
= labelno
;
3202 STRING_POOL_ADDRESS_P (XEXP (desc
->rtl
, 0)) = 1;
3208 return TREE_CST_RTL (exp
);
3211 /* Now output assembler code to define the label for EXP,
3212 and follow it with the data of EXP. */
3215 output_constant_def_contents (exp
, reloc
, labelno
)
3222 if (IN_NAMED_SECTION (exp
))
3223 named_section (exp
, NULL
, reloc
);
3226 /* First switch to text section, except for writable strings. */
3227 #ifdef SELECT_SECTION
3228 SELECT_SECTION (exp
, reloc
);
3230 if (((TREE_CODE (exp
) == STRING_CST
) && flag_writable_strings
)
3231 || (flag_pic
&& reloc
))
3234 readonly_data_section ();
3238 /* Align the location counter as required by EXP's data type. */
3239 align
= TYPE_ALIGN (TREE_TYPE (exp
));
3240 #ifdef CONSTANT_ALIGNMENT
3241 align
= CONSTANT_ALIGNMENT (exp
, align
);
3244 if (align
> BITS_PER_UNIT
)
3245 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
3247 /* Output the label itself. */
3248 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LC", labelno
);
3250 /* Output the value of EXP. */
3251 output_constant (exp
,
3252 (TREE_CODE (exp
) == STRING_CST
3253 ? TREE_STRING_LENGTH (exp
)
3254 : int_size_in_bytes (TREE_TYPE (exp
))));
3258 /* Structure to represent sufficient information about a constant so that
3259 it can be output when the constant pool is output, so that function
3260 integration can be done, and to simplify handling on machines that reference
3261 constant pool as base+displacement. */
3263 struct pool_constant
3265 struct constant_descriptor
*desc
;
3266 struct pool_constant
*next
, *next_sym
;
3269 enum machine_mode mode
;
3276 /* Hash code for a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true.
3277 The argument is XSTR (... , 0) */
3279 #define SYMHASH(LABEL) \
3280 ((((unsigned long) (LABEL)) & ((1 << HASHBITS) - 1)) % MAX_RTX_HASH_TABLE)
3282 /* Initialize constant pool hashing for a new function. */
3285 init_varasm_status (f
)
3288 struct varasm_status
*p
;
3289 p
= (struct varasm_status
*) xmalloc (sizeof (struct varasm_status
));
3291 p
->x_const_rtx_hash_table
3292 = ((struct constant_descriptor
**)
3293 xcalloc (MAX_RTX_HASH_TABLE
, sizeof (struct constant_descriptor
*)));
3294 p
->x_const_rtx_sym_hash_table
3295 = ((struct pool_constant
**)
3296 xcalloc (MAX_RTX_HASH_TABLE
, sizeof (struct pool_constant
*)));
3298 p
->x_first_pool
= p
->x_last_pool
= 0;
3299 p
->x_pool_offset
= 0;
3300 p
->x_const_double_chain
= 0;
3303 /* Mark PC for GC. */
3306 mark_pool_constant (pc
)
3307 struct pool_constant
*pc
;
3312 ggc_mark_rtx (pc
->constant
);
3317 /* Mark P for GC. */
3320 mark_varasm_status (p
)
3321 struct varasm_status
*p
;
3326 mark_pool_constant (p
->x_first_pool
);
3327 ggc_mark_rtx (p
->x_const_double_chain
);
3330 /* Clear out all parts of the state in F that can safely be discarded
3331 after the function has been compiled, to let garbage collection
3332 reclaim the memory. */
3335 free_varasm_status (f
)
3338 struct varasm_status
*p
;
3343 /* Clear out the hash tables. */
3344 for (i
= 0; i
< MAX_RTX_HASH_TABLE
; ++i
)
3346 struct constant_descriptor
* cd
;
3348 cd
= p
->x_const_rtx_hash_table
[i
];
3350 struct constant_descriptor
* next
= cd
->next
;
3356 free (p
->x_const_rtx_hash_table
);
3357 free (p
->x_const_rtx_sym_hash_table
);
3363 /* Express an rtx for a constant integer (perhaps symbolic)
3364 as the sum of a symbol or label plus an explicit integer.
3365 They are stored into VALUE. */
3368 decode_rtx_const (mode
, x
, value
)
3369 enum machine_mode mode
;
3371 struct rtx_const
*value
;
3373 /* Clear the whole structure, including any gaps. */
3374 memset (value
, 0, sizeof (struct rtx_const
));
3376 value
->kind
= RTX_INT
; /* Most usual kind. */
3379 switch (GET_CODE (x
))
3382 value
->kind
= RTX_DOUBLE
;
3383 if (GET_MODE (x
) != VOIDmode
)
3385 value
->mode
= GET_MODE (x
);
3386 memcpy ((char *) &value
->un
.du
,
3387 (char *) &CONST_DOUBLE_LOW (x
), sizeof value
->un
.du
);
3391 value
->un
.di
.low
= CONST_DOUBLE_LOW (x
);
3392 value
->un
.di
.high
= CONST_DOUBLE_HIGH (x
);
3397 value
->un
.addr
.offset
= INTVAL (x
);
3403 value
->un
.addr
.base
= x
;
3408 if (GET_CODE (x
) == PLUS
&& GET_CODE (XEXP (x
, 1)) == CONST_INT
)
3410 value
->un
.addr
.base
= XEXP (x
, 0);
3411 value
->un
.addr
.offset
= INTVAL (XEXP (x
, 1));
3413 else if (GET_CODE (x
) == MINUS
&& GET_CODE (XEXP (x
, 1)) == CONST_INT
)
3415 value
->un
.addr
.base
= XEXP (x
, 0);
3416 value
->un
.addr
.offset
= - INTVAL (XEXP (x
, 1));
3420 value
->un
.addr
.base
= x
;
3421 value
->un
.addr
.offset
= 0;
3429 if (value
->kind
== RTX_INT
&& value
->un
.addr
.base
!= 0)
3430 switch (GET_CODE (value
->un
.addr
.base
))
3433 /* Use the string's address, not the SYMBOL_REF's address,
3434 for the sake of addresses of library routines. */
3435 value
->un
.addr
.base
= (rtx
) XSTR (value
->un
.addr
.base
, 0);
3439 /* For a LABEL_REF, compare labels. */
3440 value
->un
.addr
.base
= XEXP (value
->un
.addr
.base
, 0);
3447 /* Given a MINUS expression, simplify it if both sides
3448 include the same symbol. */
3451 simplify_subtraction (x
)
3454 struct rtx_const val0
, val1
;
3456 decode_rtx_const (GET_MODE (x
), XEXP (x
, 0), &val0
);
3457 decode_rtx_const (GET_MODE (x
), XEXP (x
, 1), &val1
);
3459 if (val0
.un
.addr
.base
== val1
.un
.addr
.base
)
3460 return GEN_INT (val0
.un
.addr
.offset
- val1
.un
.addr
.offset
);
3464 /* Compute a hash code for a constant RTL expression. */
3467 const_hash_rtx (mode
, x
)
3468 enum machine_mode mode
;
3474 struct rtx_const value
;
3475 decode_rtx_const (mode
, x
, &value
);
3477 /* Compute hashing function */
3479 for (i
= 0; i
< sizeof value
/ sizeof (int); i
++)
3480 hi
+= ((int *) &value
)[i
];
3482 hi
&= (1 << HASHBITS
) - 1;
3483 hi
%= MAX_RTX_HASH_TABLE
;
3487 /* Compare a constant rtl object X with a constant-descriptor DESC.
3488 Return 1 if DESC describes a constant with the same value as X. */
3491 compare_constant_rtx (mode
, x
, desc
)
3492 enum machine_mode mode
;
3494 struct constant_descriptor
*desc
;
3496 register int *p
= (int *) desc
->u
.contents
;
3499 struct rtx_const value
;
3501 decode_rtx_const (mode
, x
, &value
);
3502 strp
= (int *) &value
;
3503 len
= sizeof value
/ sizeof (int);
3505 /* Compare constant contents. */
3507 if (*p
++ != *strp
++)
3513 /* Construct a constant descriptor for the rtl-expression X.
3514 It is up to the caller to enter the descriptor in the hash table. */
3516 static struct constant_descriptor
*
3517 record_constant_rtx (mode
, x
)
3518 enum machine_mode mode
;
3521 struct constant_descriptor
*ptr
;
3523 ptr
= ((struct constant_descriptor
*)
3524 xcalloc (1, (offsetof (struct constant_descriptor
, u
)
3525 + sizeof (struct rtx_const
))));
3526 decode_rtx_const (mode
, x
, (struct rtx_const
*) ptr
->u
.contents
);
3531 /* Given a constant rtx X, make (or find) a memory constant for its value
3532 and return a MEM rtx to refer to it in memory. */
3535 force_const_mem (mode
, x
)
3536 enum machine_mode mode
;
3540 register struct constant_descriptor
*desc
;
3542 const char *found
= 0;
3545 /* If we want this CONST_DOUBLE in the same mode as it is in memory
3546 (this will always be true for floating CONST_DOUBLEs that have been
3547 placed in memory, but not for VOIDmode (integer) CONST_DOUBLEs),
3548 use the previous copy. Otherwise, make a new one. Note that in
3549 the unlikely event that this same CONST_DOUBLE is used in two different
3550 modes in an alternating fashion, we will allocate a lot of different
3551 memory locations, but this should be extremely rare. */
3553 if (GET_CODE (x
) == CONST_DOUBLE
3554 && GET_CODE (CONST_DOUBLE_MEM (x
)) == MEM
3555 && GET_MODE (CONST_DOUBLE_MEM (x
)) == mode
)
3556 return CONST_DOUBLE_MEM (x
);
3558 /* Compute hash code of X. Search the descriptors for that hash code
3559 to see if any of them describes X. If yes, the descriptor records
3560 the label number already assigned. */
3562 hash
= const_hash_rtx (mode
, x
);
3564 for (desc
= const_rtx_hash_table
[hash
]; desc
; desc
= desc
->next
)
3565 if (compare_constant_rtx (mode
, x
, desc
))
3567 found
= desc
->label
;
3573 register struct pool_constant
*pool
;
3576 /* No constant equal to X is known to have been output.
3577 Make a constant descriptor to enter X in the hash table.
3578 Assign the label number and record it in the descriptor for
3579 future calls to this function to find. */
3581 desc
= record_constant_rtx (mode
, x
);
3582 desc
->next
= const_rtx_hash_table
[hash
];
3583 const_rtx_hash_table
[hash
] = desc
;
3585 /* Align the location counter as required by EXP's data type. */
3586 align
= (mode
== VOIDmode
) ? UNITS_PER_WORD
: GET_MODE_SIZE (mode
);
3587 if (align
> BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
3588 align
= BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
;
3589 #ifdef CONSTANT_ALIGNMENT
3590 align
= CONSTANT_ALIGNMENT (make_tree (type_for_mode (mode
, 0), x
),
3591 align
* BITS_PER_UNIT
) / BITS_PER_UNIT
;
3594 pool_offset
+= align
- 1;
3595 pool_offset
&= ~ (align
- 1);
3597 /* Allocate a pool constant descriptor, fill it in, and chain it in. */
3599 pool
= (struct pool_constant
*) ggc_alloc (sizeof (struct pool_constant
));
3603 pool
->labelno
= const_labelno
;
3604 pool
->align
= align
;
3605 pool
->offset
= pool_offset
;
3612 last_pool
->next
= pool
;
3615 pool_offset
+= GET_MODE_SIZE (mode
);
3617 /* Create a string containing the label name, in LABEL. */
3618 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
3622 desc
->label
= found
= ggc_strdup (label
);
3624 /* Add label to symbol hash table. */
3625 hash
= SYMHASH (found
);
3626 pool
->label
= found
;
3627 pool
->next_sym
= const_rtx_sym_hash_table
[hash
];
3628 const_rtx_sym_hash_table
[hash
] = pool
;
3631 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
3633 def
= gen_rtx_MEM (mode
, gen_rtx_SYMBOL_REF (Pmode
, found
));
3634 set_mem_attributes (def
, type_for_mode (mode
, 0), 1);
3635 RTX_UNCHANGING_P (def
) = 1;
3637 /* Mark the symbol_ref as belonging to this constants pool. */
3638 CONSTANT_POOL_ADDRESS_P (XEXP (def
, 0)) = 1;
3639 current_function_uses_const_pool
= 1;
3641 if (GET_CODE (x
) == CONST_DOUBLE
)
3643 if (CONST_DOUBLE_MEM (x
) == cc0_rtx
)
3645 CONST_DOUBLE_CHAIN (x
) = const_double_chain
;
3646 const_double_chain
= x
;
3648 CONST_DOUBLE_MEM (x
) = def
;
3654 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
3655 the corresponding pool_constant structure. */
3657 static struct pool_constant
*
3658 find_pool_constant (f
, addr
)
3662 struct pool_constant
*pool
;
3663 const char *label
= XSTR (addr
, 0);
3665 for (pool
= f
->varasm
->x_const_rtx_sym_hash_table
[SYMHASH (label
)]; pool
;
3666 pool
= pool
->next_sym
)
3667 if (pool
->label
== label
)
3673 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
3676 get_pool_constant (addr
)
3679 return (find_pool_constant (cfun
, addr
))->constant
;
3682 /* Likewise, but for the constant pool of a specific function. */
3685 get_pool_constant_for_function (f
, addr
)
3689 return (find_pool_constant (f
, addr
))->constant
;
3692 /* Similar, return the mode. */
3695 get_pool_mode (addr
)
3698 return (find_pool_constant (cfun
, addr
))->mode
;
3702 get_pool_mode_for_function (f
, addr
)
3706 return (find_pool_constant (f
, addr
))->mode
;
3709 /* Similar, return the offset in the constant pool. */
3712 get_pool_offset (addr
)
3715 return (find_pool_constant (cfun
, addr
))->offset
;
3718 /* Return the size of the constant pool. */
3726 /* Write all the constants in the constant pool. */
3729 output_constant_pool (fnname
, fndecl
)
3730 const char *fnname ATTRIBUTE_UNUSED
;
3731 tree fndecl ATTRIBUTE_UNUSED
;
3733 struct pool_constant
*pool
;
3735 union real_extract u
;
3737 /* It is possible for gcc to call force_const_mem and then to later
3738 discard the instructions which refer to the constant. In such a
3739 case we do not need to output the constant. */
3740 mark_constant_pool ();
3742 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3743 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3746 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3755 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3756 whose CODE_LABEL has been deleted. This can occur if a jump table
3757 is eliminated by optimization. If so, write a constant of zero
3758 instead. Note that this can also happen by turning the
3759 CODE_LABEL into a NOTE. */
3760 /* ??? This seems completely and utterly wrong. Certainly it's
3761 not true for NOTE_INSN_DELETED_LABEL, but I disbelieve proper
3762 functioning even with INSN_DELETED_P and friends. */
3765 switch (GET_CODE (x
))
3768 if (GET_CODE (XEXP (x
, 0)) != PLUS
3769 || GET_CODE (XEXP (XEXP (x
, 0), 0)) != LABEL_REF
)
3771 tmp
= XEXP (XEXP (x
, 0), 0);
3776 if (INSN_DELETED_P (tmp
)
3777 || (GET_CODE (tmp
) == NOTE
3778 && NOTE_LINE_NUMBER (tmp
) == NOTE_INSN_DELETED
))
3789 /* First switch to correct section. */
3790 #ifdef SELECT_RTX_SECTION
3791 SELECT_RTX_SECTION (pool
->mode
, x
);
3793 readonly_data_section ();
3796 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3797 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file
, x
, pool
->mode
,
3798 pool
->align
, pool
->labelno
, done
);
3801 if (pool
->align
> 1)
3802 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (pool
->align
));
3804 /* Output the label. */
3805 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LC", pool
->labelno
);
3807 /* Output the value of the constant itself. */
3808 switch (GET_MODE_CLASS (pool
->mode
))
3811 if (GET_CODE (x
) != CONST_DOUBLE
)
3814 memcpy ((char *) &u
, (char *) &CONST_DOUBLE_LOW (x
), sizeof u
);
3815 assemble_real (u
.d
, pool
->mode
);
3819 case MODE_PARTIAL_INT
:
3820 assemble_integer (x
, GET_MODE_SIZE (pool
->mode
), 1);
3827 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3833 #ifdef ASM_OUTPUT_POOL_EPILOGUE
3834 ASM_OUTPUT_POOL_EPILOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3837 /* Done with this pool. */
3838 first_pool
= last_pool
= 0;
3841 /* Look through the instructions for this function, and mark all the
3842 entries in the constant pool which are actually being used.
3843 Emit used deferred strings. */
3846 mark_constant_pool ()
3849 struct pool_constant
*pool
;
3851 if (first_pool
== 0 && htab_elements (const_str_htab
) == 0)
3854 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3857 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
3859 mark_constants (PATTERN (insn
));
3861 for (insn
= current_function_epilogue_delay_list
;
3863 insn
= XEXP (insn
, 1))
3865 mark_constants (PATTERN (insn
));
3868 /* Look through appropriate parts of X, marking all entries in the
3869 constant pool which are actually being used. Entries that are only
3870 referenced by other constants are also marked as used. Emit
3871 deferred strings that are used. */
3878 register const char *format_ptr
;
3883 if (GET_CODE (x
) == SYMBOL_REF
)
3885 mark_constant (&x
, NULL
);
3888 /* Never search inside a CONST_DOUBLE, because CONST_DOUBLE_MEM may be
3889 a MEM, but does not constitute a use of that MEM. */
3890 else if (GET_CODE (x
) == CONST_DOUBLE
)
3893 /* Insns may appear inside a SEQUENCE. Only check the patterns of
3894 insns, not any notes that may be attached. We don't want to mark
3895 a constant just because it happens to appear in a REG_EQUIV note. */
3898 mark_constants (PATTERN (x
));
3902 format_ptr
= GET_RTX_FORMAT (GET_CODE (x
));
3904 for (i
= 0; i
< GET_RTX_LENGTH (GET_CODE (x
)); i
++)
3906 switch (*format_ptr
++)
3909 mark_constants (XEXP (x
, i
));
3913 if (XVEC (x
, i
) != 0)
3917 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
3918 mark_constants (XVECEXP (x
, i
, j
));
3937 /* Given a SYMBOL_REF CURRENT_RTX, mark it and all constants it refers
3938 to as used. Emit referenced deferred strings. This function can
3939 be used with for_each_rtx () to mark all SYMBOL_REFs in an rtx. */
3942 mark_constant (current_rtx
, data
)
3944 void *data ATTRIBUTE_UNUSED
;
3946 rtx x
= *current_rtx
;
3950 else if (GET_CODE(x
) == CONST_DOUBLE
)
3951 /* Never search inside a CONST_DOUBLE because CONST_DOUBLE_MEM may
3952 be a MEM but does not constitute a use of that MEM. */
3954 else if (GET_CODE (x
) == SYMBOL_REF
)
3956 if (CONSTANT_POOL_ADDRESS_P (x
))
3958 struct pool_constant
*pool
= find_pool_constant (cfun
, x
);
3959 if (pool
->mark
== 0) {
3961 for_each_rtx (&(pool
->constant
), &mark_constant
, NULL
);
3966 else if (STRING_POOL_ADDRESS_P (x
))
3968 struct deferred_string
**defstr
;
3970 defstr
= (struct deferred_string
**)
3971 htab_find_slot_with_hash (const_str_htab
, XSTR (x
, 0),
3972 STRHASH (XSTR (x
, 0)), NO_INSERT
);
3975 struct deferred_string
*p
= *defstr
;
3977 STRING_POOL_ADDRESS_P (x
) = 0;
3978 output_constant_def_contents (p
->exp
, 0, p
->labelno
);
3979 htab_clear_slot (const_str_htab
, (void **) defstr
);
3986 /* Find all the constants whose addresses are referenced inside of EXP,
3987 and make sure assembler code with a label has been output for each one.
3988 Indicate whether an ADDR_EXPR has been encountered. */
3991 output_addressed_constants (exp
)
3996 /* Give the front-end a chance to convert VALUE to something that
3997 looks more like a constant to the back-end. */
3998 if (lang_expand_constant
)
3999 exp
= (*lang_expand_constant
) (exp
);
4001 switch (TREE_CODE (exp
))
4005 register tree constant
= TREE_OPERAND (exp
, 0);
4007 while (TREE_CODE (constant
) == COMPONENT_REF
)
4009 constant
= TREE_OPERAND (constant
, 0);
4012 if (TREE_CODE_CLASS (TREE_CODE (constant
)) == 'c'
4013 || TREE_CODE (constant
) == CONSTRUCTOR
)
4014 /* No need to do anything here
4015 for addresses of variables or functions. */
4016 output_constant_def (constant
, 0);
4023 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
4024 reloc
|= output_addressed_constants (TREE_OPERAND (exp
, 1));
4029 case NON_LVALUE_EXPR
:
4030 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
4036 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
4037 if (TREE_VALUE (link
) != 0)
4038 reloc
|= output_addressed_constants (TREE_VALUE (link
));
4048 /* Return nonzero if VALUE is a valid constant-valued expression
4049 for use in initializing a static variable; one that can be an
4050 element of a "constant" initializer.
4052 Return null_pointer_node if the value is absolute;
4053 if it is relocatable, return the variable that determines the relocation.
4054 We assume that VALUE has been folded as much as possible;
4055 therefore, we do not need to check for such things as
4056 arithmetic-combinations of integers. */
4059 initializer_constant_valid_p (value
, endtype
)
4063 /* Give the front-end a chance to convert VALUE to something that
4064 looks more like a constant to the back-end. */
4065 if (lang_expand_constant
)
4066 value
= (*lang_expand_constant
) (value
);
4068 switch (TREE_CODE (value
))
4071 if ((TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
4072 || TREE_CODE (TREE_TYPE (value
)) == RECORD_TYPE
)
4073 && TREE_CONSTANT (value
)
4074 && CONSTRUCTOR_ELTS (value
))
4076 initializer_constant_valid_p (TREE_VALUE (CONSTRUCTOR_ELTS (value
)),
4079 return TREE_STATIC (value
) ? null_pointer_node
: 0;
4085 return null_pointer_node
;
4088 return staticp (TREE_OPERAND (value
, 0)) ? TREE_OPERAND (value
, 0) : 0;
4090 case NON_LVALUE_EXPR
:
4091 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
4095 /* Allow conversions between pointer types. */
4096 if (POINTER_TYPE_P (TREE_TYPE (value
))
4097 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
4098 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
4100 /* Allow conversions between real types. */
4101 if (FLOAT_TYPE_P (TREE_TYPE (value
))
4102 && FLOAT_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
4103 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
4105 /* Allow length-preserving conversions between integer types. */
4106 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
4107 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
4108 && (TYPE_PRECISION (TREE_TYPE (value
))
4109 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
4110 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
4112 /* Allow conversions between other integer types only if
4114 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
4115 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
4117 tree inner
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4119 if (inner
== null_pointer_node
)
4120 return null_pointer_node
;
4124 /* Allow (int) &foo provided int is as wide as a pointer. */
4125 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
4126 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
4127 && (TYPE_PRECISION (TREE_TYPE (value
))
4128 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
4129 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4132 /* Likewise conversions from int to pointers, but also allow
4133 conversions from 0. */
4134 if (POINTER_TYPE_P (TREE_TYPE (value
))
4135 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
4137 if (integer_zerop (TREE_OPERAND (value
, 0)))
4138 return null_pointer_node
;
4139 else if (TYPE_PRECISION (TREE_TYPE (value
))
4140 <= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0))))
4141 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4145 /* Allow conversions to union types if the value inside is okay. */
4146 if (TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
)
4147 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4152 if (! INTEGRAL_TYPE_P (endtype
)
4153 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
4155 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4157 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
4159 /* If either term is absolute, use the other terms relocation. */
4160 if (valid0
== null_pointer_node
)
4162 if (valid1
== null_pointer_node
)
4168 if (! INTEGRAL_TYPE_P (endtype
)
4169 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
4171 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4173 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
4175 /* Win if second argument is absolute. */
4176 if (valid1
== null_pointer_node
)
4178 /* Win if both arguments have the same relocation.
4179 Then the value is absolute. */
4180 if (valid0
== valid1
&& valid0
!= 0)
4181 return null_pointer_node
;
4183 /* Since GCC guarantees that string constants are unique in the
4184 generated code, a subtraction between two copies of the same
4185 constant string is absolute. */
4186 if (valid0
&& TREE_CODE (valid0
) == STRING_CST
&&
4187 valid1
&& TREE_CODE (valid1
) == STRING_CST
&&
4188 TREE_STRING_POINTER (valid0
) == TREE_STRING_POINTER (valid1
))
4189 return null_pointer_node
;
4192 /* Support differences between labels. */
4193 if (INTEGRAL_TYPE_P (endtype
))
4196 op0
= TREE_OPERAND (value
, 0);
4197 op1
= TREE_OPERAND (value
, 1);
4201 if (TREE_CODE (op0
) == ADDR_EXPR
4202 && TREE_CODE (TREE_OPERAND (op0
, 0)) == LABEL_DECL
4203 && TREE_CODE (op1
) == ADDR_EXPR
4204 && TREE_CODE (TREE_OPERAND (op1
, 0)) == LABEL_DECL
)
4205 return null_pointer_node
;
4216 /* Output assembler code for constant EXP to FILE, with no label.
4217 This includes the pseudo-op such as ".int" or ".byte", and a newline.
4218 Assumes output_addressed_constants has been done on EXP already.
4220 Generate exactly SIZE bytes of assembler data, padding at the end
4221 with zeros if necessary. SIZE must always be specified.
4223 SIZE is important for structure constructors,
4224 since trailing members may have been omitted from the constructor.
4225 It is also important for initialization of arrays from string constants
4226 since the full length of the string constant might not be wanted.
4227 It is also needed for initialization of unions, where the initializer's
4228 type is just one member, and that may not be as long as the union.
4230 There a case in which we would fail to output exactly SIZE bytes:
4231 for a structure constructor that wants to produce more than SIZE bytes.
4232 But such constructors will never be generated for any possible input. */
4235 output_constant (exp
, size
)
4239 register enum tree_code code
= TREE_CODE (TREE_TYPE (exp
));
4241 /* Some front-ends use constants other than the standard
4242 language-indepdent varieties, but which may still be output
4243 directly. Give the front-end a chance to convert EXP to a
4244 language-independent representation. */
4245 if (lang_expand_constant
)
4247 exp
= (*lang_expand_constant
) (exp
);
4248 code
= TREE_CODE (TREE_TYPE (exp
));
4251 if (size
== 0 || flag_syntax_only
)
4254 /* Eliminate the NON_LVALUE_EXPR_EXPR that makes a cast not be an lvalue.
4255 That way we get the constant (we hope) inside it. Also, strip off any
4256 NOP_EXPR that converts between two record, union, array, or set types
4257 or a CONVERT_EXPR that converts to a union TYPE. */
4258 while ((TREE_CODE (exp
) == NOP_EXPR
4259 && (TREE_TYPE (exp
) == TREE_TYPE (TREE_OPERAND (exp
, 0))
4260 || AGGREGATE_TYPE_P (TREE_TYPE (exp
))))
4261 || (TREE_CODE (exp
) == CONVERT_EXPR
4262 && code
== UNION_TYPE
)
4263 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
4265 exp
= TREE_OPERAND (exp
, 0);
4266 code
= TREE_CODE (TREE_TYPE (exp
));
4269 /* Allow a constructor with no elements for any data type.
4270 This means to fill the space with zeros. */
4271 if (TREE_CODE (exp
) == CONSTRUCTOR
&& CONSTRUCTOR_ELTS (exp
) == 0)
4273 assemble_zeros (size
);
4284 case REFERENCE_TYPE
:
4285 /* ??? What about (int)((float)(int)&foo + 4) */
4286 while (TREE_CODE (exp
) == NOP_EXPR
|| TREE_CODE (exp
) == CONVERT_EXPR
4287 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
4288 exp
= TREE_OPERAND (exp
, 0);
4290 if (! assemble_integer (expand_expr (exp
, NULL_RTX
, VOIDmode
,
4291 EXPAND_INITIALIZER
),
4293 error ("initializer for integer value is too complicated");
4298 if (TREE_CODE (exp
) != REAL_CST
)
4299 error ("initializer for floating value is not a floating constant");
4301 assemble_real (TREE_REAL_CST (exp
),
4302 mode_for_size (size
* BITS_PER_UNIT
, MODE_FLOAT
, 0));
4307 output_constant (TREE_REALPART (exp
), size
/ 2);
4308 output_constant (TREE_IMAGPART (exp
), size
/ 2);
4309 size
-= (size
/ 2) * 2;
4313 if (TREE_CODE (exp
) == CONSTRUCTOR
)
4315 output_constructor (exp
, size
);
4318 else if (TREE_CODE (exp
) == STRING_CST
)
4322 if (size
> TREE_STRING_LENGTH (exp
))
4324 excess
= size
- TREE_STRING_LENGTH (exp
);
4325 size
= TREE_STRING_LENGTH (exp
);
4328 assemble_string (TREE_STRING_POINTER (exp
), size
);
4337 if (TREE_CODE (exp
) == CONSTRUCTOR
)
4338 output_constructor (exp
, size
);
4344 if (TREE_CODE (exp
) == INTEGER_CST
)
4345 assemble_integer (expand_expr (exp
, NULL_RTX
,
4346 VOIDmode
, EXPAND_INITIALIZER
),
4348 else if (TREE_CODE (exp
) == CONSTRUCTOR
)
4350 unsigned char *buffer
= (unsigned char *) alloca (size
);
4351 if (get_set_constructor_bytes (exp
, buffer
, size
))
4353 assemble_string ((char *) buffer
, size
);
4356 error ("unknown set constructor type");
4364 assemble_zeros (size
);
4368 /* Subroutine of output_constructor, used for computing the size of
4369 arrays of unspecified length. VAL must be a CONSTRUCTOR of an array
4370 type with an unspecified upper bound. */
4372 static unsigned HOST_WIDE_INT
4373 array_size_for_constructor (val
)
4378 max_index
= NULL_TREE
;
4379 for (i
= CONSTRUCTOR_ELTS (val
); i
; i
= TREE_CHAIN (i
))
4381 tree index
= TREE_PURPOSE (i
);
4383 if (TREE_CODE (index
) == RANGE_EXPR
)
4384 index
= TREE_OPERAND (index
, 1);
4385 if (max_index
== NULL_TREE
|| tree_int_cst_lt (max_index
, index
))
4389 if (max_index
== NULL_TREE
)
4392 /* Compute the total number of array elements. */
4393 i
= size_binop (MINUS_EXPR
, convert (sizetype
, max_index
),
4395 TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (val
)))));
4396 i
= size_binop (PLUS_EXPR
, i
, convert (sizetype
, integer_one_node
));
4398 /* Multiply by the array element unit size to find number of bytes. */
4399 i
= size_binop (MULT_EXPR
, i
, TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (val
))));
4401 return tree_low_cst (i
, 1);
4404 /* Subroutine of output_constant, used for CONSTRUCTORs (aggregate constants).
4405 Generate at least SIZE bytes, padding if necessary. */
4408 output_constructor (exp
, size
)
4412 tree type
= TREE_TYPE (exp
);
4413 register tree link
, field
= 0;
4415 /* Number of bytes output or skipped so far.
4416 In other words, current position within the constructor. */
4417 HOST_WIDE_INT total_bytes
= 0;
4418 /* Non-zero means BYTE contains part of a byte, to be output. */
4419 int byte_buffer_in_use
= 0;
4420 register int byte
= 0;
4422 if (HOST_BITS_PER_WIDE_INT
< BITS_PER_UNIT
)
4425 if (TREE_CODE (type
) == RECORD_TYPE
)
4426 field
= TYPE_FIELDS (type
);
4428 if (TREE_CODE (type
) == ARRAY_TYPE
4429 && TYPE_DOMAIN (type
) != 0)
4430 min_index
= TYPE_MIN_VALUE (TYPE_DOMAIN (type
));
4432 /* As LINK goes through the elements of the constant,
4433 FIELD goes through the structure fields, if the constant is a structure.
4434 if the constant is a union, then we override this,
4435 by getting the field from the TREE_LIST element.
4436 But the constant could also be an array. Then FIELD is zero.
4438 There is always a maximum of one element in the chain LINK for unions
4439 (even if the initializer in a source program incorrectly contains
4441 for (link
= CONSTRUCTOR_ELTS (exp
);
4443 link
= TREE_CHAIN (link
),
4444 field
= field
? TREE_CHAIN (field
) : 0)
4446 tree val
= TREE_VALUE (link
);
4449 /* The element in a union constructor specifies the proper field
4451 if ((TREE_CODE (type
) == RECORD_TYPE
|| TREE_CODE (type
) == UNION_TYPE
4452 || TREE_CODE (type
) == QUAL_UNION_TYPE
)
4453 && TREE_PURPOSE (link
) != 0)
4454 field
= TREE_PURPOSE (link
);
4456 else if (TREE_CODE (type
) == ARRAY_TYPE
)
4457 index
= TREE_PURPOSE (link
);
4459 /* Eliminate the marker that makes a cast not be an lvalue. */
4463 if (index
&& TREE_CODE (index
) == RANGE_EXPR
)
4465 unsigned HOST_WIDE_INT fieldsize
4466 = int_size_in_bytes (TREE_TYPE (type
));
4467 HOST_WIDE_INT lo_index
= tree_low_cst (TREE_OPERAND (index
, 0), 0);
4468 HOST_WIDE_INT hi_index
= tree_low_cst (TREE_OPERAND (index
, 1), 0);
4469 HOST_WIDE_INT index
;
4471 for (index
= lo_index
; index
<= hi_index
; index
++)
4473 /* Output the element's initial value. */
4475 assemble_zeros (fieldsize
);
4477 output_constant (val
, fieldsize
);
4479 /* Count its size. */
4480 total_bytes
+= fieldsize
;
4483 else if (field
== 0 || !DECL_BIT_FIELD (field
))
4485 /* An element that is not a bit-field. */
4487 unsigned HOST_WIDE_INT fieldsize
;
4488 /* Since this structure is static,
4489 we know the positions are constant. */
4490 HOST_WIDE_INT pos
= field
? int_byte_position (field
) : 0;
4493 pos
= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (val
)), 1)
4494 * (tree_low_cst (index
, 0) - tree_low_cst (min_index
, 0)));
4496 /* Output any buffered-up bit-fields preceding this element. */
4497 if (byte_buffer_in_use
)
4499 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4501 byte_buffer_in_use
= 0;
4504 /* Advance to offset of this element.
4505 Note no alignment needed in an array, since that is guaranteed
4506 if each element has the proper size. */
4507 if ((field
!= 0 || index
!= 0) && pos
!= total_bytes
)
4509 assemble_zeros (pos
- total_bytes
);
4513 else if (field
!= 0 && DECL_PACKED (field
))
4514 /* Some assemblers automaticallly align a datum according to its
4515 size if no align directive is specified. The datum, however,
4516 may be declared with 'packed' attribute, so we have to disable
4518 ASM_OUTPUT_ALIGN (asm_out_file
, 0);
4520 /* Determine size this element should occupy. */
4525 /* If this is an array with an unspecified upper bound,
4526 the initializer determines the size. */
4527 /* ??? This ought to only checked if DECL_SIZE_UNIT is NULL,
4528 but we cannot do this until the deprecated support for
4529 initializing zero-length array members is removed. */
4530 if (TREE_CODE (TREE_TYPE (field
)) == ARRAY_TYPE
4531 && TYPE_DOMAIN (TREE_TYPE (field
))
4532 && ! TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (field
))))
4534 fieldsize
= array_size_for_constructor (val
);
4535 /* Given a non-empty initialization, this field had
4537 if (fieldsize
!= 0 && TREE_CHAIN (field
) != NULL_TREE
)
4540 else if (DECL_SIZE_UNIT (field
))
4542 /* ??? This can't be right. If the decl size overflows
4543 a host integer we will silently emit no data. */
4544 if (host_integerp (DECL_SIZE_UNIT (field
), 1))
4545 fieldsize
= tree_low_cst (DECL_SIZE_UNIT (field
), 1);
4549 fieldsize
= int_size_in_bytes (TREE_TYPE (type
));
4551 /* Output the element's initial value. */
4553 assemble_zeros (fieldsize
);
4555 output_constant (val
, fieldsize
);
4557 /* Count its size. */
4558 total_bytes
+= fieldsize
;
4560 else if (val
!= 0 && TREE_CODE (val
) != INTEGER_CST
)
4561 error ("invalid initial value for member `%s'",
4562 IDENTIFIER_POINTER (DECL_NAME (field
)));
4565 /* Element that is a bit-field. */
4567 HOST_WIDE_INT next_offset
= int_bit_position (field
);
4568 HOST_WIDE_INT end_offset
4569 = (next_offset
+ tree_low_cst (DECL_SIZE (field
), 1));
4572 val
= integer_zero_node
;
4574 /* If this field does not start in this (or, next) byte,
4576 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4578 /* Output remnant of any bit field in previous bytes. */
4579 if (byte_buffer_in_use
)
4581 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4583 byte_buffer_in_use
= 0;
4586 /* If still not at proper byte, advance to there. */
4587 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4589 assemble_zeros (next_offset
/ BITS_PER_UNIT
- total_bytes
);
4590 total_bytes
= next_offset
/ BITS_PER_UNIT
;
4594 if (! byte_buffer_in_use
)
4597 /* We must split the element into pieces that fall within
4598 separate bytes, and combine each byte with previous or
4599 following bit-fields. */
4601 /* next_offset is the offset n fbits from the beginning of
4602 the structure to the next bit of this element to be processed.
4603 end_offset is the offset of the first bit past the end of
4605 while (next_offset
< end_offset
)
4609 HOST_WIDE_INT value
;
4610 HOST_WIDE_INT next_byte
= next_offset
/ BITS_PER_UNIT
;
4611 HOST_WIDE_INT next_bit
= next_offset
% BITS_PER_UNIT
;
4613 /* Advance from byte to byte
4614 within this element when necessary. */
4615 while (next_byte
!= total_bytes
)
4617 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4622 /* Number of bits we can process at once
4623 (all part of the same byte). */
4624 this_time
= MIN (end_offset
- next_offset
,
4625 BITS_PER_UNIT
- next_bit
);
4626 if (BYTES_BIG_ENDIAN
)
4628 /* On big-endian machine, take the most significant bits
4629 first (of the bits that are significant)
4630 and put them into bytes from the most significant end. */
4631 shift
= end_offset
- next_offset
- this_time
;
4633 /* Don't try to take a bunch of bits that cross
4634 the word boundary in the INTEGER_CST. We can
4635 only select bits from the LOW or HIGH part
4637 if (shift
< HOST_BITS_PER_WIDE_INT
4638 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4640 this_time
= shift
+ this_time
- HOST_BITS_PER_WIDE_INT
;
4641 shift
= HOST_BITS_PER_WIDE_INT
;
4644 /* Now get the bits from the appropriate constant word. */
4645 if (shift
< HOST_BITS_PER_WIDE_INT
)
4646 value
= TREE_INT_CST_LOW (val
);
4647 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4649 value
= TREE_INT_CST_HIGH (val
);
4650 shift
-= HOST_BITS_PER_WIDE_INT
;
4655 /* Get the result. This works only when:
4656 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4657 byte
|= (((value
>> shift
)
4658 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4659 << (BITS_PER_UNIT
- this_time
- next_bit
));
4663 /* On little-endian machines,
4664 take first the least significant bits of the value
4665 and pack them starting at the least significant
4666 bits of the bytes. */
4667 shift
= next_offset
- int_bit_position (field
);
4669 /* Don't try to take a bunch of bits that cross
4670 the word boundary in the INTEGER_CST. We can
4671 only select bits from the LOW or HIGH part
4673 if (shift
< HOST_BITS_PER_WIDE_INT
4674 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4675 this_time
= (HOST_BITS_PER_WIDE_INT
- shift
);
4677 /* Now get the bits from the appropriate constant word. */
4678 if (shift
< HOST_BITS_PER_WIDE_INT
)
4679 value
= TREE_INT_CST_LOW (val
);
4680 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4682 value
= TREE_INT_CST_HIGH (val
);
4683 shift
-= HOST_BITS_PER_WIDE_INT
;
4688 /* Get the result. This works only when:
4689 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4690 byte
|= (((value
>> shift
)
4691 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4695 next_offset
+= this_time
;
4696 byte_buffer_in_use
= 1;
4701 if (byte_buffer_in_use
)
4703 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4707 if (total_bytes
< size
)
4708 assemble_zeros (size
- total_bytes
);
4711 #ifdef HANDLE_PRAGMA_WEAK
4712 /* Add function NAME to the weak symbols list. VALUE is a weak alias
4713 associatd with NAME. */
4716 add_weak (name
, value
)
4720 struct weak_syms
*weak
;
4722 weak
= (struct weak_syms
*) permalloc (sizeof (struct weak_syms
));
4727 weak
->next
= weak_decls
;
4729 weak
->value
= value
;
4734 #endif /* HANDLE_PRAGMA_WEAK */
4736 /* Declare DECL to be a weak symbol. */
4742 if (! TREE_PUBLIC (decl
))
4743 error_with_decl (decl
, "weak declaration of `%s' must be public");
4744 else if (TREE_ASM_WRITTEN (decl
))
4745 error_with_decl (decl
, "weak declaration of `%s' must precede definition");
4746 else if (SUPPORTS_WEAK
)
4747 DECL_WEAK (decl
) = 1;
4748 #ifdef HANDLE_PRAGMA_WEAK
4749 add_weak (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)), NULL
);
4753 /* Emit any pending weak declarations. */
4755 #ifdef HANDLE_PRAGMA_WEAK
4756 struct weak_syms
* weak_decls
;
4762 #ifdef HANDLE_PRAGMA_WEAK
4763 if (HANDLE_PRAGMA_WEAK
)
4765 struct weak_syms
*t
;
4766 for (t
= weak_decls
; t
; t
= t
->next
)
4770 ASM_WEAKEN_LABEL (asm_out_file
, t
->name
);
4772 ASM_OUTPUT_DEF (asm_out_file
, t
->name
, t
->value
);
4779 /* Remove NAME from the pending list of weak symbols. This prevents
4780 the compiler from emitting multiple .weak directives which confuses
4782 #ifdef ASM_WEAKEN_LABEL
4784 remove_from_pending_weak_list (name
)
4785 const char *name ATTRIBUTE_UNUSED
;
4787 #ifdef HANDLE_PRAGMA_WEAK
4788 if (HANDLE_PRAGMA_WEAK
)
4790 struct weak_syms
*t
;
4791 for (t
= weak_decls
; t
; t
= t
->next
)
4793 if (t
->name
&& strcmp (name
, t
->name
) == 0)
4802 assemble_alias (decl
, target
)
4803 tree decl
, target ATTRIBUTE_UNUSED
;
4807 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
4809 #ifdef ASM_OUTPUT_DEF
4810 /* Make name accessible from other files, if appropriate. */
4812 if (TREE_PUBLIC (decl
))
4814 #ifdef ASM_WEAKEN_LABEL
4815 if (DECL_WEAK (decl
))
4817 ASM_WEAKEN_LABEL (asm_out_file
, name
);
4818 /* Remove this function from the pending weak list so that
4819 we do not emit multiple .weak directives for it. */
4820 remove_from_pending_weak_list
4821 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
4825 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
4828 #ifdef ASM_OUTPUT_DEF_FROM_DECLS
4829 ASM_OUTPUT_DEF_FROM_DECLS (asm_out_file
, decl
, target
);
4831 ASM_OUTPUT_DEF (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4833 TREE_ASM_WRITTEN (decl
) = 1;
4835 #ifdef ASM_OUTPUT_WEAK_ALIAS
4836 if (! DECL_WEAK (decl
))
4837 warning ("only weak aliases are supported in this configuration");
4839 ASM_OUTPUT_WEAK_ALIAS (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4840 TREE_ASM_WRITTEN (decl
) = 1;
4842 warning ("alias definitions not supported in this configuration; ignored");
4847 /* Returns 1 if the target configuration supports defining public symbols
4848 so that one of them will be chosen at link time instead of generating a
4849 multiply-defined symbol error, whether through the use of weak symbols or
4850 a target-specific mechanism for having duplicates discarded. */
4853 supports_one_only ()
4855 if (SUPPORTS_ONE_ONLY
)
4857 return SUPPORTS_WEAK
;
4860 /* Set up DECL as a public symbol that can be defined in multiple
4861 translation units without generating a linker error. */
4864 make_decl_one_only (decl
)
4867 if (TREE_CODE (decl
) != VAR_DECL
&& TREE_CODE (decl
) != FUNCTION_DECL
)
4870 TREE_PUBLIC (decl
) = 1;
4872 if (TREE_CODE (decl
) == VAR_DECL
4873 && (DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
))
4874 DECL_COMMON (decl
) = 1;
4875 else if (SUPPORTS_ONE_ONLY
)
4877 #ifdef MAKE_DECL_ONE_ONLY
4878 MAKE_DECL_ONE_ONLY (decl
);
4880 DECL_ONE_ONLY (decl
) = 1;
4882 else if (SUPPORTS_WEAK
)
4883 DECL_WEAK (decl
) = 1;
4891 const_str_htab
= htab_create (128, const_str_htab_hash
, const_str_htab_eq
,
4892 const_str_htab_del
);
4893 ggc_add_root (const_hash_table
, MAX_HASH_TABLE
, sizeof const_hash_table
[0],
4894 mark_const_hash_entry
);
4895 ggc_add_root (&const_str_htab
, 1, sizeof const_str_htab
,
4896 mark_const_str_htab
);
4899 /* Extra support for EH values. */
4901 assemble_eh_label (name
)
4904 #ifdef ASM_OUTPUT_EH_LABEL
4905 ASM_OUTPUT_EH_LABEL (asm_out_file
, name
);
4907 assemble_label (name
);
4911 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
4914 assemble_eh_align (align
)
4917 #ifdef ASM_OUTPUT_EH_ALIGN
4918 if (align
> BITS_PER_UNIT
)
4919 ASM_OUTPUT_EH_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
4921 assemble_align (align
);
4926 /* On some platforms, we may want to specify a special mechansim to
4927 output EH data when generating with a function.. */
4929 assemble_eh_integer (x
, size
, force
)
4937 #ifdef ASM_OUTPUT_EH_CHAR
4939 ASM_OUTPUT_EH_CHAR (asm_out_file
, x
);
4943 #ifdef ASM_OUTPUT_EH_SHORT
4945 ASM_OUTPUT_EH_SHORT (asm_out_file
, x
);
4949 #ifdef ASM_OUTPUT_EH_INT
4951 ASM_OUTPUT_EH_INT (asm_out_file
, x
);
4955 #ifdef ASM_OUTPUT_EH_DOUBLE_INT
4957 ASM_OUTPUT_EH_DOUBLE_INT (asm_out_file
, x
);
4964 return (assemble_integer (x
, size
, force
));