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 /* A weak alias has TREE_PUBLIC set but not the other bits. */
592 if (TREE_CODE (decl
) == PARM_DECL
593 || TREE_CODE (decl
) == RESULT_DECL
594 || (TREE_CODE (decl
) == VAR_DECL
595 && !TREE_STATIC (decl
)
596 && !TREE_PUBLIC (decl
)
597 && !DECL_EXTERNAL (decl
)
598 && !DECL_REGISTER (decl
)))
600 /* And that we were not given a type or a label. */
601 else if (TREE_CODE (decl
) == TYPE_DECL
602 || TREE_CODE (decl
) == LABEL_DECL
)
605 /* For a duplicate declaration, we can be called twice on the
606 same DECL node. Don't discard the RTL already made. */
607 if (DECL_RTL_SET_P (decl
))
609 /* If the old RTL had the wrong mode, fix the mode. */
610 if (GET_MODE (DECL_RTL (decl
)) != DECL_MODE (decl
))
612 rtx rtl
= DECL_RTL (decl
);
613 PUT_MODE (rtl
, DECL_MODE (decl
));
616 /* ??? Another way to do this would be to do what halfpic.c does
617 and maintain a hashed table of such critters. */
618 /* ??? Another way to do this would be to pass a flag bit to
619 ENCODE_SECTION_INFO saying whether this is a new decl or not. */
620 /* Let the target reassign the RTL if it wants.
621 This is necessary, for example, when one machine specific
622 decl attribute overrides another. */
623 #ifdef REDO_SECTION_INFO_P
624 if (REDO_SECTION_INFO_P (decl
))
625 ENCODE_SECTION_INFO (decl
);
630 new_name
= name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
632 reg_number
= decode_reg_name (asmspec
);
633 if (reg_number
== -2)
635 /* ASMSPEC is given, and not the name of a register. Mark the
636 name with a star so assemble_name won't munge it. */
637 char *starred
= alloca (strlen (asmspec
) + 2);
639 strcpy (starred
+ 1, asmspec
);
643 if (TREE_CODE (decl
) != FUNCTION_DECL
&& DECL_REGISTER (decl
))
645 /* First detect errors in declaring global registers. */
646 if (reg_number
== -1)
647 error_with_decl (decl
, "register name not specified for `%s'");
648 else if (reg_number
< 0)
649 error_with_decl (decl
, "invalid register name for `%s'");
650 else if (TYPE_MODE (TREE_TYPE (decl
)) == BLKmode
)
651 error_with_decl (decl
,
652 "data type of `%s' isn't suitable for a register");
653 else if (! HARD_REGNO_MODE_OK (reg_number
, TYPE_MODE (TREE_TYPE (decl
))))
654 error_with_decl (decl
,
655 "register specified for `%s' isn't suitable for data type");
656 /* Now handle properly declared static register variables. */
661 if (DECL_INITIAL (decl
) != 0 && TREE_STATIC (decl
))
663 DECL_INITIAL (decl
) = 0;
664 error ("global register variable has initial value");
666 if (TREE_THIS_VOLATILE (decl
))
667 warning ("volatile register variables don't work as you might wish");
669 /* If the user specified one of the eliminables registers here,
670 e.g., FRAME_POINTER_REGNUM, we don't want to get this variable
671 confused with that register and be eliminated. Although this
672 usage is somewhat suspect, we nevertheless use the following
673 kludge to avoid setting DECL_RTL to frame_pointer_rtx. */
676 gen_rtx_REG (DECL_MODE (decl
),
677 FIRST_PSEUDO_REGISTER
));
678 REGNO (DECL_RTL (decl
)) = reg_number
;
679 REG_USERVAR_P (DECL_RTL (decl
)) = 1;
681 if (TREE_STATIC (decl
))
683 /* Make this register global, so not usable for anything
685 #ifdef ASM_DECLARE_REGISTER_GLOBAL
686 ASM_DECLARE_REGISTER_GLOBAL (asm_out_file
, decl
, reg_number
, name
);
688 nregs
= HARD_REGNO_NREGS (reg_number
, DECL_MODE (decl
));
690 globalize_reg (reg_number
+ --nregs
);
693 /* As a register variable, it has no section. */
698 /* Now handle ordinary static variables and functions (in memory).
699 Also handle vars declared register invalidly. */
701 if (reg_number
>= 0 || reg_number
== -3)
702 error_with_decl (decl
,
703 "register name given for non-register variable `%s'");
705 /* Specifying a section attribute on a variable forces it into a
706 non-.bss section, and thus it cannot be common. */
707 if (TREE_CODE (decl
) == VAR_DECL
708 && DECL_SECTION_NAME (decl
) != NULL_TREE
709 && DECL_INITIAL (decl
) == NULL_TREE
710 && DECL_COMMON (decl
))
711 DECL_COMMON (decl
) = 0;
713 /* Can't use just the variable's own name for a variable
714 whose scope is less than the whole file, unless it's a member
715 of a local class (which will already be unambiguous).
716 Concatenate a distinguishing number. */
717 if (!top_level
&& !TREE_PUBLIC (decl
)
718 && ! (DECL_CONTEXT (decl
) && TYPE_P (DECL_CONTEXT (decl
)))
720 && name
== IDENTIFIER_POINTER (DECL_NAME (decl
)))
723 ASM_FORMAT_PRIVATE_NAME (label
, name
, var_labelno
);
728 /* When -fprefix-function-name is used, the functions
729 names are prefixed. Only nested function names are not
731 else if (flag_prefix_function_name
&& TREE_CODE (decl
) == FUNCTION_DECL
)
733 size_t name_len
= IDENTIFIER_LENGTH (DECL_ASSEMBLER_NAME (decl
));
736 pname
= alloca (name_len
+ CHKR_PREFIX_SIZE
+ 1);
737 memcpy (pname
, CHKR_PREFIX
, CHKR_PREFIX_SIZE
);
738 memcpy (pname
+ CHKR_PREFIX_SIZE
, name
, name_len
+ 1);
742 if (name
!= new_name
)
744 SET_DECL_ASSEMBLER_NAME (decl
, get_identifier (new_name
));
745 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
748 /* If this variable is to be treated as volatile, show its
749 tree node has side effects. */
750 if ((flag_volatile_global
&& TREE_CODE (decl
) == VAR_DECL
751 && TREE_PUBLIC (decl
))
752 || ((flag_volatile_static
&& TREE_CODE (decl
) == VAR_DECL
753 && (TREE_PUBLIC (decl
) || TREE_STATIC (decl
)))))
754 TREE_SIDE_EFFECTS (decl
) = 1;
756 SET_DECL_RTL (decl
, gen_rtx_MEM (DECL_MODE (decl
),
757 gen_rtx_SYMBOL_REF (Pmode
, name
)));
758 if (TREE_CODE (decl
) != FUNCTION_DECL
)
759 set_mem_attributes (DECL_RTL (decl
), decl
, 1);
761 /* Optionally set flags or add text to the name to record information
762 such as that it is a function name.
763 If the name is changed, the macro ASM_OUTPUT_LABELREF
764 will have to know how to strip this information. */
765 #ifdef ENCODE_SECTION_INFO
766 ENCODE_SECTION_INFO (decl
);
770 /* Make the rtl for variable VAR be volatile.
771 Use this only for static variables. */
774 make_var_volatile (var
)
777 if (GET_CODE (DECL_RTL (var
)) != MEM
)
780 MEM_VOLATILE_P (DECL_RTL (var
)) = 1;
783 /* Output alignment directive to align for constant expression EXP. */
786 assemble_constant_align (exp
)
791 /* Align the location counter as required by EXP's data type. */
792 align
= TYPE_ALIGN (TREE_TYPE (exp
));
793 #ifdef CONSTANT_ALIGNMENT
794 align
= CONSTANT_ALIGNMENT (exp
, align
);
797 if (align
> BITS_PER_UNIT
)
798 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
801 /* Output a string of literal assembler code
802 for an `asm' keyword used between functions. */
805 assemble_asm (string
)
810 if (TREE_CODE (string
) == ADDR_EXPR
)
811 string
= TREE_OPERAND (string
, 0);
813 fprintf (asm_out_file
, "\t%s\n", TREE_STRING_POINTER (string
));
816 #if 0 /* This should no longer be needed, because
817 flag_gnu_linker should be 0 on these systems,
818 which should prevent any output
819 if ASM_OUTPUT_CONSTRUCTOR and ASM_OUTPUT_DESTRUCTOR are absent. */
820 #if !(defined(DBX_DEBUGGING_INFO) && !defined(FASCIST_ASSEMBLER))
821 #ifndef ASM_OUTPUT_CONSTRUCTOR
822 #define ASM_OUTPUT_CONSTRUCTOR(file, name)
824 #ifndef ASM_OUTPUT_DESTRUCTOR
825 #define ASM_OUTPUT_DESTRUCTOR(file, name)
830 /* Record an element in the table of global destructors.
831 How this is done depends on what sort of assembler and linker
834 NAME should be the name of a global function to be called
835 at exit time. This name is output using assemble_name. */
838 assemble_destructor (name
)
841 #ifdef ASM_OUTPUT_DESTRUCTOR
842 ASM_OUTPUT_DESTRUCTOR (asm_out_file
, name
);
846 /* Now tell GNU LD that this is part of the static destructor set. */
847 /* This code works for any machine provided you use GNU as/ld. */
848 fprintf (asm_out_file
, "%s\"___DTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
849 assemble_name (asm_out_file
, name
);
850 fputc ('\n', asm_out_file
);
855 /* Likewise for global constructors. */
858 assemble_constructor (name
)
861 #ifdef ASM_OUTPUT_CONSTRUCTOR
862 ASM_OUTPUT_CONSTRUCTOR (asm_out_file
, name
);
866 /* Now tell GNU LD that this is part of the static constructor set. */
867 /* This code works for any machine provided you use GNU as/ld. */
868 fprintf (asm_out_file
, "%s\"___CTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
869 assemble_name (asm_out_file
, name
);
870 fputc ('\n', asm_out_file
);
875 /* Likewise for entries we want to record for garbage collection.
876 Garbage collection is still under development. */
879 assemble_gc_entry (name
)
882 #ifdef ASM_OUTPUT_GC_ENTRY
883 ASM_OUTPUT_GC_ENTRY (asm_out_file
, name
);
887 /* Now tell GNU LD that this is part of the static constructor set. */
888 fprintf (asm_out_file
, "%s\"___PTR_LIST__\",22,0,0,", ASM_STABS_OP
);
889 assemble_name (asm_out_file
, name
);
890 fputc ('\n', asm_out_file
);
895 /* CONSTANT_POOL_BEFORE_FUNCTION may be defined as an expression with
896 a non-zero value if the constant pool should be output before the
897 start of the function, or a zero value if the pool should output
898 after the end of the function. The default is to put it before the
901 #ifndef CONSTANT_POOL_BEFORE_FUNCTION
902 #define CONSTANT_POOL_BEFORE_FUNCTION 1
905 /* Output assembler code for the constant pool of a function and associated
906 with defining the name of the function. DECL describes the function.
907 NAME is the function's name. For the constant pool, we use the current
908 constant pool data. */
911 assemble_start_function (decl
, fnname
)
917 /* The following code does not need preprocessing in the assembler. */
921 if (CONSTANT_POOL_BEFORE_FUNCTION
)
922 output_constant_pool (fnname
, decl
);
924 #ifdef ASM_OUTPUT_SECTION_NAME
925 /* If the function is to be put in its own section and it's not in a section
926 already, indicate so. */
927 if ((flag_function_sections
928 && DECL_SECTION_NAME (decl
) == NULL_TREE
)
929 || UNIQUE_SECTION_P (decl
))
930 UNIQUE_SECTION (decl
, 0);
933 function_section (decl
);
935 /* Tell assembler to move to target machine's alignment for functions. */
936 align
= floor_log2 (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
938 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
940 /* Handle a user-specified function alignment.
941 Note that we still need to align to FUNCTION_BOUNDARY, as above,
942 because ASM_OUTPUT_MAX_SKIP_ALIGN might not do any alignment at all. */
943 if (align_functions_log
> align
)
945 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
946 ASM_OUTPUT_MAX_SKIP_ALIGN (asm_out_file
,
947 align_functions_log
, align_functions
-1);
949 ASM_OUTPUT_ALIGN (asm_out_file
, align_functions_log
);
953 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
954 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file
, fnname
);
957 #ifdef SDB_DEBUGGING_INFO
958 /* Output SDB definition of the function. */
959 if (write_symbols
== SDB_DEBUG
)
960 sdbout_mark_begin_function ();
963 #ifdef DBX_DEBUGGING_INFO
964 /* Output DBX definition of the function. */
965 if (write_symbols
== DBX_DEBUG
)
966 dbxout_begin_function (decl
);
969 /* Make function name accessible from other files, if appropriate. */
971 if (TREE_PUBLIC (decl
))
973 if (! first_global_object_name
)
978 STRIP_NAME_ENCODING (p
, fnname
);
979 name
= permalloc (strlen (p
) + 1);
982 if (! DECL_WEAK (decl
) && ! DECL_ONE_ONLY (decl
))
983 first_global_object_name
= name
;
985 weak_global_object_name
= name
;
988 #ifdef ASM_WEAKEN_LABEL
989 if (DECL_WEAK (decl
))
991 ASM_WEAKEN_LABEL (asm_out_file
, fnname
);
992 /* Remove this function from the pending weak list so that
993 we do not emit multiple .weak directives for it. */
994 remove_from_pending_weak_list
995 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
999 ASM_GLOBALIZE_LABEL (asm_out_file
, fnname
);
1002 /* Do any machine/system dependent processing of the function name */
1003 #ifdef ASM_DECLARE_FUNCTION_NAME
1004 ASM_DECLARE_FUNCTION_NAME (asm_out_file
, fnname
, current_function_decl
);
1006 /* Standard thing is just output label for the function. */
1007 ASM_OUTPUT_LABEL (asm_out_file
, fnname
);
1008 #endif /* ASM_DECLARE_FUNCTION_NAME */
1011 /* Output assembler code associated with defining the size of the
1012 function. DECL describes the function. NAME is the function's name. */
1015 assemble_end_function (decl
, fnname
)
1019 #ifdef ASM_DECLARE_FUNCTION_SIZE
1020 ASM_DECLARE_FUNCTION_SIZE (asm_out_file
, fnname
, decl
);
1022 if (! CONSTANT_POOL_BEFORE_FUNCTION
)
1024 output_constant_pool (fnname
, decl
);
1025 function_section (decl
); /* need to switch back */
1028 /* Output any constants which should appear after the function. */
1029 output_after_function_constants ();
1032 /* Assemble code to leave SIZE bytes of zeros. */
1035 assemble_zeros (size
)
1038 /* Do no output if -fsyntax-only. */
1039 if (flag_syntax_only
)
1042 #ifdef ASM_NO_SKIP_IN_TEXT
1043 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
1044 so we must output 0s explicitly in the text section. */
1045 if (ASM_NO_SKIP_IN_TEXT
&& in_text_section ())
1049 for (i
= 0; i
< size
- 20; i
+= 20)
1052 fprintf (asm_out_file
,
1053 "%s0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n", ASM_BYTE_OP
);
1055 fprintf (asm_out_file
,
1056 "\tbyte 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n");
1062 fprintf (asm_out_file
, "%s0", ASM_BYTE_OP
);
1064 fprintf (asm_out_file
, "\tbyte 0");
1067 for (; i
< size
; i
++)
1068 fprintf (asm_out_file
, ",0");
1069 fprintf (asm_out_file
, "\n");
1075 ASM_OUTPUT_SKIP (asm_out_file
, size
);
1078 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
1081 assemble_align (align
)
1084 if (align
> BITS_PER_UNIT
)
1085 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
1088 /* Assemble a string constant with the specified C string as contents. */
1091 assemble_string (p
, size
)
1098 /* If the string is very long, split it up. */
1102 int thissize
= size
- pos
;
1103 if (thissize
> maximum
)
1106 ASM_OUTPUT_ASCII (asm_out_file
, p
, thissize
);
1114 #if defined ASM_OUTPUT_ALIGNED_DECL_LOCAL
1115 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1116 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1118 #if defined ASM_OUTPUT_ALIGNED_LOCAL
1119 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1120 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, DECL_ALIGN (decl))
1122 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1123 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded)
1127 #if defined ASM_OUTPUT_ALIGNED_BSS
1128 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1129 ASM_OUTPUT_ALIGNED_BSS (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1131 #if defined ASM_OUTPUT_BSS
1132 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1133 ASM_OUTPUT_BSS (asm_out_file, decl, name, size, rounded)
1139 #if defined ASM_OUTPUT_ALIGNED_DECL_COMMON
1140 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1141 ASM_OUTPUT_ALIGNED_DECL_COMMON (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1143 #if defined ASM_OUTPUT_ALIGNED_COMMON
1144 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1145 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file, name, size, DECL_ALIGN (decl))
1147 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1148 ASM_OUTPUT_COMMON (asm_out_file, name, size, rounded)
1153 asm_emit_uninitialised (decl
, name
, size
, rounded
)
1156 int size ATTRIBUTE_UNUSED
;
1157 int rounded ATTRIBUTE_UNUSED
;
1165 destination
= asm_dest_local
;
1167 if (TREE_PUBLIC (decl
))
1169 #if defined ASM_EMIT_BSS
1170 if (! DECL_COMMON (decl
))
1171 destination
= asm_dest_bss
;
1174 destination
= asm_dest_common
;
1177 if (flag_shared_data
)
1179 switch (destination
)
1181 #ifdef ASM_OUTPUT_SHARED_BSS
1183 ASM_OUTPUT_SHARED_BSS (asm_out_file
, decl
, name
, size
, rounded
);
1186 #ifdef ASM_OUTPUT_SHARED_COMMON
1187 case asm_dest_common
:
1188 ASM_OUTPUT_SHARED_COMMON (asm_out_file
, name
, size
, rounded
);
1191 #ifdef ASM_OUTPUT_SHARED_LOCAL
1192 case asm_dest_local
:
1193 ASM_OUTPUT_SHARED_LOCAL (asm_out_file
, name
, size
, rounded
);
1201 #ifdef ASM_OUTPUT_SECTION_NAME
1202 /* We already know that DECL_SECTION_NAME() == NULL. */
1203 if (flag_data_sections
!= 0 || UNIQUE_SECTION_P (decl
))
1204 UNIQUE_SECTION (decl
, 0);
1207 switch (destination
)
1211 ASM_EMIT_BSS (decl
, name
, size
, rounded
);
1214 case asm_dest_common
:
1215 ASM_EMIT_COMMON (decl
, name
, size
, rounded
);
1217 case asm_dest_local
:
1218 ASM_EMIT_LOCAL (decl
, name
, size
, rounded
);
1227 /* Assemble everything that is needed for a variable or function declaration.
1228 Not used for automatic variables, and not used for function definitions.
1229 Should not be called for variables of incomplete structure type.
1231 TOP_LEVEL is nonzero if this variable has file scope.
1232 AT_END is nonzero if this is the special handling, at end of compilation,
1233 to define things that have had only tentative definitions.
1234 DONT_OUTPUT_DATA if nonzero means don't actually output the
1235 initial value (that will be done by the caller). */
1238 assemble_variable (decl
, top_level
, at_end
, dont_output_data
)
1240 int top_level ATTRIBUTE_UNUSED
;
1241 int at_end ATTRIBUTE_UNUSED
;
1242 int dont_output_data
;
1244 register const char *name
;
1247 enum in_section saved_in_section
;
1249 last_assemble_variable_decl
= 0;
1251 if (DECL_RTL_SET_P (decl
) && GET_CODE (DECL_RTL (decl
)) == REG
)
1253 /* Do output symbol info for global register variables, but do nothing
1256 if (TREE_ASM_WRITTEN (decl
))
1258 TREE_ASM_WRITTEN (decl
) = 1;
1260 /* Do no output if -fsyntax-only. */
1261 if (flag_syntax_only
)
1264 #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
1265 /* File-scope global variables are output here. */
1266 if ((write_symbols
== DBX_DEBUG
|| write_symbols
== XCOFF_DEBUG
)
1268 dbxout_symbol (decl
, 0);
1270 #ifdef SDB_DEBUGGING_INFO
1271 if (write_symbols
== SDB_DEBUG
&& top_level
1272 /* Leave initialized global vars for end of compilation;
1273 see comment in compile_file. */
1274 && (TREE_PUBLIC (decl
) == 0 || DECL_INITIAL (decl
) == 0))
1275 sdbout_symbol (decl
, 0);
1278 /* Don't output any DWARF debugging information for variables here.
1279 In the case of local variables, the information for them is output
1280 when we do our recursive traversal of the tree representation for
1281 the entire containing function. In the case of file-scope variables,
1282 we output information for all of them at the very end of compilation
1283 while we are doing our final traversal of the chain of file-scope
1289 /* Normally no need to say anything here for external references,
1290 since assemble_external is called by the language-specific code
1291 when a declaration is first seen. */
1293 if (DECL_EXTERNAL (decl
))
1296 /* Output no assembler code for a function declaration.
1297 Only definitions of functions output anything. */
1299 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1302 /* If type was incomplete when the variable was declared,
1303 see if it is complete now. */
1305 if (DECL_SIZE (decl
) == 0)
1306 layout_decl (decl
, 0);
1308 /* Still incomplete => don't allocate it; treat the tentative defn
1309 (which is what it must have been) as an `extern' reference. */
1311 if (!dont_output_data
&& DECL_SIZE (decl
) == 0)
1313 error_with_file_and_line (DECL_SOURCE_FILE (decl
),
1314 DECL_SOURCE_LINE (decl
),
1315 "storage size of `%s' isn't known",
1316 IDENTIFIER_POINTER (DECL_NAME (decl
)));
1317 TREE_ASM_WRITTEN (decl
) = 1;
1321 /* The first declaration of a variable that comes through this function
1322 decides whether it is global (in C, has external linkage)
1323 or local (in C, has internal linkage). So do nothing more
1324 if this function has already run. */
1326 if (TREE_ASM_WRITTEN (decl
))
1329 TREE_ASM_WRITTEN (decl
) = 1;
1331 /* Do no output if -fsyntax-only. */
1332 if (flag_syntax_only
)
1337 if (! dont_output_data
1338 && ! host_integerp (DECL_SIZE_UNIT (decl
), 1))
1340 error_with_decl (decl
, "size of variable `%s' is too large");
1344 name
= XSTR (XEXP (DECL_RTL (decl
), 0), 0);
1345 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
)
1346 && ! first_global_object_name
1347 && ! (DECL_COMMON (decl
) && (DECL_INITIAL (decl
) == 0
1348 || DECL_INITIAL (decl
) == error_mark_node
))
1349 && ! DECL_WEAK (decl
)
1350 && ! DECL_ONE_ONLY (decl
))
1355 STRIP_NAME_ENCODING (p
, name
);
1356 xname
= permalloc (strlen (p
) + 1);
1358 first_global_object_name
= xname
;
1361 /* Compute the alignment of this data. */
1363 align
= DECL_ALIGN (decl
);
1365 /* In the case for initialing an array whose length isn't specified,
1366 where we have not yet been able to do the layout,
1367 figure out the proper alignment now. */
1368 if (dont_output_data
&& DECL_SIZE (decl
) == 0
1369 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
)
1370 align
= MAX (align
, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl
))));
1372 /* Some object file formats have a maximum alignment which they support.
1373 In particular, a.out format supports a maximum alignment of 4. */
1374 #ifndef MAX_OFILE_ALIGNMENT
1375 #define MAX_OFILE_ALIGNMENT BIGGEST_ALIGNMENT
1377 if (align
> MAX_OFILE_ALIGNMENT
)
1379 warning_with_decl (decl
,
1380 "alignment of `%s' is greater than maximum object file alignment. Using %d.",
1381 MAX_OFILE_ALIGNMENT
/BITS_PER_UNIT
);
1382 align
= MAX_OFILE_ALIGNMENT
;
1385 /* On some machines, it is good to increase alignment sometimes. */
1386 #ifdef DATA_ALIGNMENT
1387 align
= DATA_ALIGNMENT (TREE_TYPE (decl
), align
);
1389 #ifdef CONSTANT_ALIGNMENT
1390 if (DECL_INITIAL (decl
) != 0 && DECL_INITIAL (decl
) != error_mark_node
)
1391 align
= CONSTANT_ALIGNMENT (DECL_INITIAL (decl
), align
);
1394 /* Reset the alignment in case we have made it tighter, so we can benefit
1395 from it in get_pointer_alignment. */
1396 DECL_ALIGN (decl
) = align
;
1398 /* Handle uninitialized definitions. */
1400 if ((DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
)
1401 /* If the target can't output uninitialized but not common global data
1402 in .bss, then we have to use .data. */
1403 #if ! defined ASM_EMIT_BSS
1404 && DECL_COMMON (decl
)
1406 && DECL_SECTION_NAME (decl
) == NULL_TREE
1407 && ! dont_output_data
)
1409 unsigned HOST_WIDE_INT size
= tree_low_cst (DECL_SIZE_UNIT (decl
), 1);
1410 unsigned HOST_WIDE_INT rounded
= size
;
1412 /* Don't allocate zero bytes of common,
1413 since that means "undefined external" in the linker. */
1417 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1418 so that each uninitialized object starts on such a boundary. */
1419 rounded
+= (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1;
1420 rounded
= (rounded
/ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1421 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1423 /* Don't continue this line--convex cc version 4.1 would lose. */
1424 #if !defined(ASM_OUTPUT_ALIGNED_COMMON) && !defined(ASM_OUTPUT_ALIGNED_DECL_COMMON) && !defined(ASM_OUTPUT_ALIGNED_BSS)
1425 if ((unsigned HOST_WIDE_INT
) DECL_ALIGN (decl
) / BITS_PER_UNIT
> rounded
)
1427 (decl
, "requested alignment for %s is greater than implemented alignment of %d.",rounded
);
1430 #ifdef DBX_DEBUGGING_INFO
1431 /* File-scope global variables are output here. */
1432 if (write_symbols
== DBX_DEBUG
&& top_level
)
1433 dbxout_symbol (decl
, 0);
1435 #ifdef SDB_DEBUGGING_INFO
1436 if (write_symbols
== SDB_DEBUG
&& top_level
1437 /* Leave initialized global vars for end of compilation;
1438 see comment in compile_file. */
1439 && (TREE_PUBLIC (decl
) == 0 || DECL_INITIAL (decl
) == 0))
1440 sdbout_symbol (decl
, 0);
1443 /* Don't output any DWARF debugging information for variables here.
1444 In the case of local variables, the information for them is output
1445 when we do our recursive traversal of the tree representation for
1446 the entire containing function. In the case of file-scope variables,
1447 we output information for all of them at the very end of compilation
1448 while we are doing our final traversal of the chain of file-scope
1451 #if 0 /* ??? We should either delete this or add a comment describing what
1452 it was intended to do and why we shouldn't delete it. */
1453 if (flag_shared_data
)
1456 asm_emit_uninitialised (decl
, name
, size
, rounded
);
1461 /* Handle initialized definitions.
1462 Also handle uninitialized global definitions if -fno-common and the
1463 target doesn't support ASM_OUTPUT_BSS. */
1465 /* First make the assembler name(s) global if appropriate. */
1466 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
))
1468 #ifdef ASM_WEAKEN_LABEL
1469 if (DECL_WEAK (decl
))
1471 ASM_WEAKEN_LABEL (asm_out_file
, name
);
1472 /* Remove this variable from the pending weak list so that
1473 we do not emit multiple .weak directives for it. */
1474 remove_from_pending_weak_list
1475 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
1479 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
1482 for (d
= equivalents
; d
; d
= TREE_CHAIN (d
))
1484 tree e
= TREE_VALUE (d
);
1485 if (TREE_PUBLIC (e
) && DECL_NAME (e
))
1486 ASM_GLOBALIZE_LABEL (asm_out_file
,
1487 XSTR (XEXP (DECL_RTL (e
), 0), 0));
1491 /* Output any data that we will need to use the address of. */
1492 if (DECL_INITIAL (decl
) == error_mark_node
)
1493 reloc
= contains_pointers_p (TREE_TYPE (decl
));
1494 else if (DECL_INITIAL (decl
))
1495 reloc
= output_addressed_constants (DECL_INITIAL (decl
));
1497 #ifdef ASM_OUTPUT_SECTION_NAME
1498 if ((flag_data_sections
!= 0 && DECL_SECTION_NAME (decl
) == NULL_TREE
)
1499 || UNIQUE_SECTION_P (decl
))
1500 UNIQUE_SECTION (decl
, reloc
);
1503 /* Switch to the appropriate section. */
1504 variable_section (decl
, reloc
);
1506 /* dbxout.c needs to know this. */
1507 if (in_text_section ())
1508 DECL_IN_TEXT_SECTION (decl
) = 1;
1510 /* Record current section so we can restore it if dbxout.c clobbers it. */
1511 saved_in_section
= in_section
;
1513 /* Output the dbx info now that we have chosen the section. */
1515 #ifdef DBX_DEBUGGING_INFO
1516 /* File-scope global variables are output here. */
1517 if (write_symbols
== DBX_DEBUG
&& top_level
)
1518 dbxout_symbol (decl
, 0);
1520 #ifdef SDB_DEBUGGING_INFO
1521 if (write_symbols
== SDB_DEBUG
&& top_level
1522 /* Leave initialized global vars for end of compilation;
1523 see comment in compile_file. */
1524 && (TREE_PUBLIC (decl
) == 0 || DECL_INITIAL (decl
) == 0))
1525 sdbout_symbol (decl
, 0);
1528 /* Don't output any DWARF debugging information for variables here.
1529 In the case of local variables, the information for them is output
1530 when we do our recursive traversal of the tree representation for
1531 the entire containing function. In the case of file-scope variables,
1532 we output information for all of them at the very end of compilation
1533 while we are doing our final traversal of the chain of file-scope
1536 /* If the debugging output changed sections, reselect the section
1537 that's supposed to be selected. */
1538 if (in_section
!= saved_in_section
)
1539 variable_section (decl
, reloc
);
1541 /* Output the alignment of this data. */
1542 if (align
> BITS_PER_UNIT
)
1543 ASM_OUTPUT_ALIGN (asm_out_file
,
1544 floor_log2 (DECL_ALIGN (decl
) / BITS_PER_UNIT
));
1546 /* Do any machine/system dependent processing of the object. */
1547 #ifdef ASM_DECLARE_OBJECT_NAME
1548 last_assemble_variable_decl
= decl
;
1549 ASM_DECLARE_OBJECT_NAME (asm_out_file
, name
, decl
);
1551 /* Standard thing is just output label for the object. */
1552 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1553 #endif /* ASM_DECLARE_OBJECT_NAME */
1555 if (!dont_output_data
)
1557 if (DECL_INITIAL (decl
))
1558 /* Output the actual data. */
1559 output_constant (DECL_INITIAL (decl
),
1560 tree_low_cst (DECL_SIZE_UNIT (decl
), 1));
1562 /* Leave space for it. */
1563 assemble_zeros (tree_low_cst (DECL_SIZE_UNIT (decl
), 1));
1567 #ifdef XCOFF_DEBUGGING_INFO
1568 /* Unfortunately, the IBM assembler cannot handle stabx before the actual
1569 declaration. When something like ".stabx "aa:S-2",aa,133,0" is emitted
1570 and `aa' hasn't been output yet, the assembler generates a stab entry with
1571 a value of zero, in addition to creating an unnecessary external entry
1572 for `aa'. Hence, we must postpone dbxout_symbol to here at the end. */
1574 /* File-scope global variables are output here. */
1575 if (write_symbols
== XCOFF_DEBUG
&& top_level
)
1577 saved_in_section
= in_section
;
1579 dbxout_symbol (decl
, 0);
1581 if (in_section
!= saved_in_section
)
1582 variable_section (decl
, reloc
);
1585 /* There must be a statement after a label. */
1590 /* Return 1 if type TYPE contains any pointers. */
1593 contains_pointers_p (type
)
1596 switch (TREE_CODE (type
))
1599 case REFERENCE_TYPE
:
1600 /* I'm not sure whether OFFSET_TYPE needs this treatment,
1601 so I'll play safe and return 1. */
1607 case QUAL_UNION_TYPE
:
1610 /* For a type that has fields, see if the fields have pointers. */
1611 for (fields
= TYPE_FIELDS (type
); fields
; fields
= TREE_CHAIN (fields
))
1612 if (TREE_CODE (fields
) == FIELD_DECL
1613 && contains_pointers_p (TREE_TYPE (fields
)))
1619 /* An array type contains pointers if its element type does. */
1620 return contains_pointers_p (TREE_TYPE (type
));
1627 /* Output something to declare an external symbol to the assembler.
1628 (Most assemblers don't need this, so we normally output nothing.)
1629 Do nothing if DECL is not external. */
1632 assemble_external (decl
)
1633 tree decl ATTRIBUTE_UNUSED
;
1635 #ifdef ASM_OUTPUT_EXTERNAL
1636 if (DECL_P (decl
) && DECL_EXTERNAL (decl
) && TREE_PUBLIC (decl
))
1638 rtx rtl
= DECL_RTL (decl
);
1640 if (GET_CODE (rtl
) == MEM
&& GET_CODE (XEXP (rtl
, 0)) == SYMBOL_REF
1641 && ! SYMBOL_REF_USED (XEXP (rtl
, 0)))
1643 /* Some systems do require some output. */
1644 SYMBOL_REF_USED (XEXP (rtl
, 0)) = 1;
1645 ASM_OUTPUT_EXTERNAL (asm_out_file
, decl
, XSTR (XEXP (rtl
, 0), 0));
1651 /* Similar, for calling a library function FUN. */
1654 assemble_external_libcall (fun
)
1655 rtx fun ATTRIBUTE_UNUSED
;
1657 #ifdef ASM_OUTPUT_EXTERNAL_LIBCALL
1658 /* Declare library function name external when first used, if nec. */
1659 if (! SYMBOL_REF_USED (fun
))
1661 SYMBOL_REF_USED (fun
) = 1;
1662 ASM_OUTPUT_EXTERNAL_LIBCALL (asm_out_file
, fun
);
1667 /* Declare the label NAME global. */
1670 assemble_global (name
)
1673 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
1676 /* Assemble a label named NAME. */
1679 assemble_label (name
)
1682 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1685 /* Output to FILE a reference to the assembler name of a C-level name NAME.
1686 If NAME starts with a *, the rest of NAME is output verbatim.
1687 Otherwise NAME is transformed in an implementation-defined way
1688 (usually by the addition of an underscore).
1689 Many macros in the tm file are defined to call this function. */
1692 assemble_name (file
, name
)
1696 const char *real_name
;
1699 STRIP_NAME_ENCODING (real_name
, name
);
1700 if (flag_prefix_function_name
1701 && ! memcmp (real_name
, CHKR_PREFIX
, CHKR_PREFIX_SIZE
))
1702 real_name
= real_name
+ CHKR_PREFIX_SIZE
;
1704 id
= maybe_get_identifier (real_name
);
1706 TREE_SYMBOL_REFERENCED (id
) = 1;
1709 fputs (&name
[1], file
);
1711 ASM_OUTPUT_LABELREF (file
, name
);
1714 /* Allocate SIZE bytes writable static space with a gensym name
1715 and return an RTX to refer to its address. */
1718 assemble_static_space (size
)
1722 const char *namestring
;
1726 if (flag_shared_data
)
1730 ASM_GENERATE_INTERNAL_LABEL (name
, "LF", const_labelno
);
1732 namestring
= ggc_strdup (name
);
1734 x
= gen_rtx_SYMBOL_REF (Pmode
, namestring
);
1736 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
1737 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file
, NULL_TREE
, name
, size
,
1740 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1741 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file
, name
, size
, BIGGEST_ALIGNMENT
);
1744 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1745 so that each uninitialized object starts on such a boundary. */
1746 /* Variable `rounded' might or might not be used in ASM_OUTPUT_LOCAL. */
1747 int rounded ATTRIBUTE_UNUSED
1748 = ((size
+ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1)
1749 / (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1750 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1751 ASM_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
1758 /* Assemble the static constant template for function entry trampolines.
1759 This is done at most once per compilation.
1760 Returns an RTX for the address of the template. */
1762 #ifdef TRAMPOLINE_TEMPLATE
1764 assemble_trampoline_template ()
1770 /* By default, put trampoline templates in read-only data section. */
1772 #ifdef TRAMPOLINE_SECTION
1773 TRAMPOLINE_SECTION ();
1775 readonly_data_section ();
1778 /* Write the assembler code to define one. */
1779 align
= floor_log2 (TRAMPOLINE_ALIGNMENT
/ BITS_PER_UNIT
);
1781 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1783 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LTRAMP", 0);
1784 TRAMPOLINE_TEMPLATE (asm_out_file
);
1786 /* Record the rtl to refer to it. */
1787 ASM_GENERATE_INTERNAL_LABEL (label
, "LTRAMP", 0);
1788 name
= ggc_strdup (label
);
1789 return gen_rtx_SYMBOL_REF (Pmode
, name
);
1793 /* Assemble the integer constant X into an object of SIZE bytes.
1794 X must be either a CONST_INT or CONST_DOUBLE.
1796 Return 1 if we were able to output the constant, otherwise 0. If FORCE is
1797 non-zero, abort if we can't output the constant. */
1800 assemble_integer (x
, size
, force
)
1805 /* First try to use the standard 1, 2, 4, 8, and 16 byte
1806 ASM_OUTPUT... macros. */
1810 #ifdef ASM_OUTPUT_CHAR
1812 ASM_OUTPUT_CHAR (asm_out_file
, x
);
1816 #ifdef ASM_OUTPUT_SHORT
1818 ASM_OUTPUT_SHORT (asm_out_file
, x
);
1822 #ifdef ASM_OUTPUT_INT
1824 ASM_OUTPUT_INT (asm_out_file
, x
);
1828 #ifdef ASM_OUTPUT_DOUBLE_INT
1830 ASM_OUTPUT_DOUBLE_INT (asm_out_file
, x
);
1834 #ifdef ASM_OUTPUT_QUADRUPLE_INT
1836 ASM_OUTPUT_QUADRUPLE_INT (asm_out_file
, x
);
1841 /* If we couldn't do it that way, there are two other possibilities: First,
1842 if the machine can output an explicit byte and this is a 1 byte constant,
1843 we can use ASM_OUTPUT_BYTE. */
1845 #ifdef ASM_OUTPUT_BYTE
1846 if (size
== 1 && GET_CODE (x
) == CONST_INT
)
1848 ASM_OUTPUT_BYTE (asm_out_file
, INTVAL (x
));
1853 /* Finally, if SIZE is larger than a single word, try to output the constant
1854 one word at a time. */
1856 if (size
> UNITS_PER_WORD
)
1859 enum machine_mode mode
1860 = mode_for_size (size
* BITS_PER_UNIT
, MODE_INT
, 0);
1863 for (i
= 0; i
< size
/ UNITS_PER_WORD
; i
++)
1865 word
= operand_subword (x
, i
, 0, mode
);
1870 if (! assemble_integer (word
, UNITS_PER_WORD
, 0))
1874 if (i
== size
/ UNITS_PER_WORD
)
1876 /* If we output at least one word and then could not finish,
1877 there is no valid way to continue. */
1888 /* Assemble the floating-point constant D into an object of size MODE. */
1891 assemble_real (d
, mode
)
1893 enum machine_mode mode
;
1895 jmp_buf output_constant_handler
;
1897 if (setjmp (output_constant_handler
))
1899 error ("floating point trap outputting a constant");
1900 #ifdef REAL_IS_NOT_DOUBLE
1901 memset ((char *) &d
, 0, sizeof d
);
1908 set_float_handler (output_constant_handler
);
1912 #ifdef ASM_OUTPUT_BYTE_FLOAT
1914 ASM_OUTPUT_BYTE_FLOAT (asm_out_file
, d
);
1917 #ifdef ASM_OUTPUT_SHORT_FLOAT
1919 ASM_OUTPUT_SHORT_FLOAT (asm_out_file
, d
);
1922 #ifdef ASM_OUTPUT_THREE_QUARTER_FLOAT
1924 ASM_OUTPUT_THREE_QUARTER_FLOAT (asm_out_file
, d
);
1927 #ifdef ASM_OUTPUT_FLOAT
1929 ASM_OUTPUT_FLOAT (asm_out_file
, d
);
1933 #ifdef ASM_OUTPUT_DOUBLE
1935 ASM_OUTPUT_DOUBLE (asm_out_file
, d
);
1939 #ifdef ASM_OUTPUT_LONG_DOUBLE
1942 ASM_OUTPUT_LONG_DOUBLE (asm_out_file
, d
);
1950 set_float_handler (NULL_PTR
);
1953 /* Here we combine duplicate floating constants to make
1954 CONST_DOUBLE rtx's, and force those out to memory when necessary. */
1956 /* Return a CONST_DOUBLE or CONST_INT for a value specified as a pair of ints.
1957 For an integer, I0 is the low-order word and I1 is the high-order word.
1958 For a real number, I0 is the word with the low address
1959 and I1 is the word with the high address. */
1962 immed_double_const (i0
, i1
, mode
)
1963 HOST_WIDE_INT i0
, i1
;
1964 enum machine_mode mode
;
1968 if (GET_MODE_CLASS (mode
) == MODE_INT
1969 || GET_MODE_CLASS (mode
) == MODE_PARTIAL_INT
)
1971 /* We clear out all bits that don't belong in MODE, unless they and our
1972 sign bit are all one. So we get either a reasonable negative value
1973 or a reasonable unsigned value for this mode. */
1974 int width
= GET_MODE_BITSIZE (mode
);
1975 if (width
< HOST_BITS_PER_WIDE_INT
1976 && ((i0
& ((HOST_WIDE_INT
) (-1) << (width
- 1)))
1977 != ((HOST_WIDE_INT
) (-1) << (width
- 1))))
1978 i0
&= ((HOST_WIDE_INT
) 1 << width
) - 1, i1
= 0;
1979 else if (width
== HOST_BITS_PER_WIDE_INT
1980 && ! (i1
== ~0 && i0
< 0))
1982 else if (width
> 2 * HOST_BITS_PER_WIDE_INT
)
1983 /* We cannot represent this value as a constant. */
1986 /* If this would be an entire word for the target, but is not for
1987 the host, then sign-extend on the host so that the number will look
1988 the same way on the host that it would on the target.
1990 For example, when building a 64 bit alpha hosted 32 bit sparc
1991 targeted compiler, then we want the 32 bit unsigned value -1 to be
1992 represented as a 64 bit value -1, and not as 0x00000000ffffffff.
1993 The later confuses the sparc backend. */
1995 if (BITS_PER_WORD
< HOST_BITS_PER_WIDE_INT
&& BITS_PER_WORD
== width
1996 && (i0
& ((HOST_WIDE_INT
) 1 << (width
- 1))))
1997 i0
|= ((HOST_WIDE_INT
) (-1) << width
);
1999 /* If MODE fits within HOST_BITS_PER_WIDE_INT, always use a CONST_INT.
2001 ??? Strictly speaking, this is wrong if we create a CONST_INT
2002 for a large unsigned constant with the size of MODE being
2003 HOST_BITS_PER_WIDE_INT and later try to interpret that constant in a
2004 wider mode. In that case we will mis-interpret it as a negative
2007 Unfortunately, the only alternative is to make a CONST_DOUBLE
2008 for any constant in any mode if it is an unsigned constant larger
2009 than the maximum signed integer in an int on the host. However,
2010 doing this will break everyone that always expects to see a CONST_INT
2011 for SImode and smaller.
2013 We have always been making CONST_INTs in this case, so nothing new
2016 if (width
<= HOST_BITS_PER_WIDE_INT
)
2017 i1
= (i0
< 0) ? ~(HOST_WIDE_INT
) 0 : 0;
2019 /* If this integer fits in one word, return a CONST_INT. */
2020 if ((i1
== 0 && i0
>= 0)
2021 || (i1
== ~0 && i0
< 0))
2022 return GEN_INT (i0
);
2024 /* We use VOIDmode for integers. */
2028 /* Search the chain for an existing CONST_DOUBLE with the right value.
2029 If one is found, return it. */
2031 for (r
= const_double_chain
; r
; r
= CONST_DOUBLE_CHAIN (r
))
2032 if (CONST_DOUBLE_LOW (r
) == i0
&& CONST_DOUBLE_HIGH (r
) == i1
2033 && GET_MODE (r
) == mode
)
2036 /* No; make a new one and add it to the chain. */
2037 r
= gen_rtx_CONST_DOUBLE (mode
, const0_rtx
, i0
, i1
);
2039 /* Don't touch const_double_chain if not inside any function. */
2040 if (current_function_decl
!= 0)
2042 CONST_DOUBLE_CHAIN (r
) = const_double_chain
;
2043 const_double_chain
= r
;
2049 /* Return a CONST_DOUBLE for a specified `double' value
2050 and machine mode. */
2053 immed_real_const_1 (d
, mode
)
2055 enum machine_mode mode
;
2057 union real_extract u
;
2060 /* Get the desired `double' value as a sequence of ints
2061 since that is how they are stored in a CONST_DOUBLE. */
2065 /* Detect special cases. But be careful we don't use a CONST_DOUBLE
2066 that's from a parent function since it may be in its constant pool. */
2067 if (REAL_VALUES_IDENTICAL (dconst0
, d
)
2068 && (cfun
== 0 || decl_function_context (current_function_decl
) == 0))
2069 return CONST0_RTX (mode
);
2071 /* Check for NaN first, because some ports (specifically the i386) do not
2072 emit correct ieee-fp code by default, and thus will generate a core
2073 dump here if we pass a NaN to REAL_VALUES_EQUAL and if REAL_VALUES_EQUAL
2074 does a floating point comparison. */
2075 else if ((! REAL_VALUE_ISNAN (d
) && REAL_VALUES_EQUAL (dconst1
, d
))
2077 || decl_function_context (current_function_decl
) == 0))
2078 return CONST1_RTX (mode
);
2080 if (sizeof u
== sizeof (HOST_WIDE_INT
))
2081 return immed_double_const (u
.i
[0], 0, mode
);
2082 if (sizeof u
== 2 * sizeof (HOST_WIDE_INT
))
2083 return immed_double_const (u
.i
[0], u
.i
[1], mode
);
2085 /* The rest of this function handles the case where
2086 a float value requires more than 2 ints of space.
2087 It will be deleted as dead code on machines that don't need it. */
2089 /* Search the chain for an existing CONST_DOUBLE with the right value.
2090 If one is found, return it. */
2092 for (r
= const_double_chain
; r
; r
= CONST_DOUBLE_CHAIN (r
))
2093 if (! memcmp ((char *) &CONST_DOUBLE_LOW (r
), (char *) &u
, sizeof u
)
2094 && GET_MODE (r
) == mode
)
2097 /* No; make a new one and add it to the chain.
2099 We may be called by an optimizer which may be discarding any memory
2100 allocated during its processing (such as combine and loop). However,
2101 we will be leaving this constant on the chain, so we cannot tolerate
2103 r
= rtx_alloc (CONST_DOUBLE
);
2105 memcpy ((char *) &CONST_DOUBLE_LOW (r
), (char *) &u
, sizeof u
);
2107 /* If we aren't inside a function, don't put r on the
2108 const_double_chain. */
2109 if (current_function_decl
!= 0)
2111 CONST_DOUBLE_CHAIN (r
) = const_double_chain
;
2112 const_double_chain
= r
;
2115 CONST_DOUBLE_CHAIN (r
) = NULL_RTX
;
2117 /* Store const0_rtx in CONST_DOUBLE_MEM since this CONST_DOUBLE is on the
2118 chain, but has not been allocated memory. Actual use of CONST_DOUBLE_MEM
2119 is only through force_const_mem. */
2121 CONST_DOUBLE_MEM (r
) = const0_rtx
;
2126 /* Return a CONST_DOUBLE rtx for a value specified by EXP,
2127 which must be a REAL_CST tree node. */
2130 immed_real_const (exp
)
2133 return immed_real_const_1 (TREE_REAL_CST (exp
), TYPE_MODE (TREE_TYPE (exp
)));
2136 /* At the end of a function, forget the memory-constants
2137 previously made for CONST_DOUBLEs. Mark them as not on real_constant_chain.
2138 Also clear out real_constant_chain and clear out all the chain-pointers. */
2141 clear_const_double_mem ()
2143 register rtx r
, next
;
2145 for (r
= const_double_chain
; r
; r
= next
)
2147 next
= CONST_DOUBLE_CHAIN (r
);
2148 CONST_DOUBLE_CHAIN (r
) = 0;
2149 CONST_DOUBLE_MEM (r
) = cc0_rtx
;
2151 const_double_chain
= 0;
2154 /* Given an expression EXP with a constant value,
2155 reduce it to the sum of an assembler symbol and an integer.
2156 Store them both in the structure *VALUE.
2157 Abort if EXP does not reduce. */
2162 HOST_WIDE_INT offset
;
2166 decode_addr_const (exp
, value
)
2168 struct addr_const
*value
;
2170 register tree target
= TREE_OPERAND (exp
, 0);
2171 register int offset
= 0;
2176 if (TREE_CODE (target
) == COMPONENT_REF
2177 && host_integerp (byte_position (TREE_OPERAND (target
, 1)), 0))
2180 offset
+= int_byte_position (TREE_OPERAND (target
, 1));
2181 target
= TREE_OPERAND (target
, 0);
2183 else if (TREE_CODE (target
) == ARRAY_REF
)
2185 offset
+= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (target
)), 1)
2186 * tree_low_cst (TREE_OPERAND (target
, 1), 0));
2187 target
= TREE_OPERAND (target
, 0);
2193 switch (TREE_CODE (target
))
2197 x
= DECL_RTL (target
);
2201 x
= gen_rtx_MEM (FUNCTION_MODE
,
2202 gen_rtx_LABEL_REF (VOIDmode
,
2203 label_rtx (TREE_OPERAND (exp
, 0))));
2211 x
= TREE_CST_RTL (target
);
2218 if (GET_CODE (x
) != MEM
)
2223 value
->offset
= offset
;
2228 #ifdef ONLY_INT_FIELDS
2229 unsigned int kind
: 16;
2230 unsigned int mode
: 16;
2232 enum kind kind
: 16;
2233 enum machine_mode mode
: 16;
2236 union real_extract du
;
2237 struct addr_const addr
;
2238 struct {HOST_WIDE_INT high
, low
;} di
;
2242 /* Uniquize all constants that appear in memory.
2243 Each constant in memory thus far output is recorded
2244 in `const_hash_table' with a `struct constant_descriptor'
2245 that contains a polish representation of the value of
2248 We cannot store the trees in the hash table
2249 because the trees may be temporary. */
2251 struct constant_descriptor
2253 struct constant_descriptor
*next
;
2256 /* Make sure the data is reasonably aligned. */
2259 unsigned char contents
[1];
2260 #ifdef HAVE_LONG_DOUBLE
2269 #define MAX_HASH_TABLE 1009
2270 static struct constant_descriptor
*const_hash_table
[MAX_HASH_TABLE
];
2272 #define STRHASH(x) ((hashval_t)((long)(x) >> 3))
2274 struct deferred_string
2281 static htab_t const_str_htab
;
2283 /* Mark a const_hash_table descriptor for GC. */
2286 mark_const_hash_entry (ptr
)
2289 struct constant_descriptor
*desc
= * (struct constant_descriptor
**) ptr
;
2293 ggc_mark_rtx (desc
->rtl
);
2298 /* Mark the hash-table element X (which is really a pointer to an
2299 struct deferred_string *). */
2302 mark_const_str_htab_1 (x
, data
)
2304 void *data ATTRIBUTE_UNUSED
;
2306 ggc_mark_tree (((struct deferred_string
*) *x
)->exp
);
2310 /* Mark a const_str_htab for GC. */
2313 mark_const_str_htab (htab
)
2316 htab_traverse (*((htab_t
*) htab
), mark_const_str_htab_1
, NULL
);
2319 /* Returns a hash code for X (which is a really a
2320 struct deferred_string *). */
2323 const_str_htab_hash (x
)
2326 return STRHASH (((const struct deferred_string
*) x
)->label
);
2329 /* Returns non-zero if the value represented by X (which is really a
2330 struct deferred_string *) is the same as that given by Y
2331 (which is really a char *). */
2334 const_str_htab_eq (x
, y
)
2338 return (((const struct deferred_string
*) x
)->label
== (const char *) y
);
2341 /* Delete the hash table entry dfsp. */
2344 const_str_htab_del (dfsp
)
2350 /* Compute a hash code for a constant expression. */
2356 register const char *p
;
2357 register int len
, hi
, i
;
2358 register enum tree_code code
= TREE_CODE (exp
);
2360 /* Either set P and LEN to the address and len of something to hash and
2361 exit the switch or return a value. */
2366 p
= (char *) &TREE_INT_CST (exp
);
2367 len
= sizeof TREE_INT_CST (exp
);
2371 p
= (char *) &TREE_REAL_CST (exp
);
2372 len
= sizeof TREE_REAL_CST (exp
);
2376 p
= TREE_STRING_POINTER (exp
);
2377 len
= TREE_STRING_LENGTH (exp
);
2381 return (const_hash (TREE_REALPART (exp
)) * 5
2382 + const_hash (TREE_IMAGPART (exp
)));
2385 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2389 len
= int_size_in_bytes (TREE_TYPE (exp
));
2390 tmp
= (char *) alloca (len
);
2391 get_set_constructor_bytes (exp
, (unsigned char *) tmp
, len
);
2399 /* For record type, include the type in the hashing.
2400 We do not do so for array types
2401 because (1) the sizes of the elements are sufficient
2402 and (2) distinct array types can have the same constructor.
2403 Instead, we include the array size because the constructor could
2405 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2406 hi
= ((unsigned long) TREE_TYPE (exp
) & ((1 << HASHBITS
) - 1))
2409 hi
= ((5 + int_size_in_bytes (TREE_TYPE (exp
)))
2410 & ((1 << HASHBITS
) - 1)) % MAX_HASH_TABLE
;
2412 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2413 if (TREE_VALUE (link
))
2415 = (hi
* 603 + const_hash (TREE_VALUE (link
))) % MAX_HASH_TABLE
;
2422 struct addr_const value
;
2424 decode_addr_const (exp
, &value
);
2425 if (GET_CODE (value
.base
) == SYMBOL_REF
)
2427 /* Don't hash the address of the SYMBOL_REF;
2428 only use the offset and the symbol name. */
2430 p
= XSTR (value
.base
, 0);
2431 for (i
= 0; p
[i
] != 0; i
++)
2432 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2434 else if (GET_CODE (value
.base
) == LABEL_REF
)
2435 hi
= value
.offset
+ CODE_LABEL_NUMBER (XEXP (value
.base
, 0)) * 13;
2439 hi
&= (1 << HASHBITS
) - 1;
2440 hi
%= MAX_HASH_TABLE
;
2446 return (const_hash (TREE_OPERAND (exp
, 0)) * 9
2447 + const_hash (TREE_OPERAND (exp
, 1)));
2451 case NON_LVALUE_EXPR
:
2452 return const_hash (TREE_OPERAND (exp
, 0)) * 7 + 2;
2455 /* A language specific constant. Just hash the code. */
2456 return (int) code
% MAX_HASH_TABLE
;
2459 /* Compute hashing function */
2461 for (i
= 0; i
< len
; i
++)
2462 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2464 hi
&= (1 << HASHBITS
) - 1;
2465 hi
%= MAX_HASH_TABLE
;
2469 /* Compare a constant expression EXP with a constant-descriptor DESC.
2470 Return 1 if DESC describes a constant with the same value as EXP. */
2473 compare_constant (exp
, desc
)
2475 struct constant_descriptor
*desc
;
2477 return 0 != compare_constant_1 (exp
, desc
->u
.contents
);
2480 /* Compare constant expression EXP with a substring P of a constant descriptor.
2481 If they match, return a pointer to the end of the substring matched.
2482 If they do not match, return 0.
2484 Since descriptors are written in polish prefix notation,
2485 this function can be used recursively to test one operand of EXP
2486 against a subdescriptor, and if it succeeds it returns the
2487 address of the subdescriptor for the next operand. */
2489 static const unsigned char *
2490 compare_constant_1 (exp
, p
)
2492 const unsigned char *p
;
2494 register const unsigned char *strp
;
2496 register enum tree_code code
= TREE_CODE (exp
);
2498 if (code
!= (enum tree_code
) *p
++)
2501 /* Either set STRP, P and LEN to pointers and length to compare and exit the
2502 switch, or return the result of the comparison. */
2507 /* Integer constants are the same only if the same width of type. */
2508 if (*p
++ != TYPE_PRECISION (TREE_TYPE (exp
)))
2511 strp
= (unsigned char *) &TREE_INT_CST (exp
);
2512 len
= sizeof TREE_INT_CST (exp
);
2516 /* Real constants are the same only if the same width of type. */
2517 if (*p
++ != TYPE_PRECISION (TREE_TYPE (exp
)))
2520 strp
= (unsigned char *) &TREE_REAL_CST (exp
);
2521 len
= sizeof TREE_REAL_CST (exp
);
2525 if (flag_writable_strings
)
2528 if ((enum machine_mode
) *p
++ != TYPE_MODE (TREE_TYPE (exp
)))
2531 strp
= (const unsigned char *)TREE_STRING_POINTER (exp
);
2532 len
= TREE_STRING_LENGTH (exp
);
2533 if (memcmp ((char *) &TREE_STRING_LENGTH (exp
), p
,
2534 sizeof TREE_STRING_LENGTH (exp
)))
2537 p
+= sizeof TREE_STRING_LENGTH (exp
);
2541 p
= compare_constant_1 (TREE_REALPART (exp
), p
);
2545 return compare_constant_1 (TREE_IMAGPART (exp
), p
);
2548 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2550 int xlen
= len
= int_size_in_bytes (TREE_TYPE (exp
));
2551 unsigned char *tmp
= (unsigned char *) alloca (len
);
2553 get_set_constructor_bytes (exp
, tmp
, len
);
2554 strp
= (unsigned char *) tmp
;
2555 if (memcmp ((char *) &xlen
, p
, sizeof xlen
))
2564 int length
= list_length (CONSTRUCTOR_ELTS (exp
));
2566 enum machine_mode mode
= TYPE_MODE (TREE_TYPE (exp
));
2567 int have_purpose
= 0;
2569 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2570 if (TREE_PURPOSE (link
))
2573 if (memcmp ((char *) &length
, p
, sizeof length
))
2578 /* For record constructors, insist that the types match.
2579 For arrays, just verify both constructors are for arrays.
2580 Then insist that either both or none have any TREE_PURPOSE
2582 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2583 type
= TREE_TYPE (exp
);
2587 if (memcmp ((char *) &type
, p
, sizeof type
))
2590 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2592 if (memcmp ((char *) &mode
, p
, sizeof mode
))
2600 if (memcmp ((char *) &have_purpose
, p
, sizeof have_purpose
))
2603 p
+= sizeof have_purpose
;
2605 /* For arrays, insist that the size in bytes match. */
2606 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2608 HOST_WIDE_INT size
= int_size_in_bytes (TREE_TYPE (exp
));
2610 if (memcmp ((char *) &size
, p
, sizeof size
))
2616 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2618 if (TREE_VALUE (link
))
2620 if ((p
= compare_constant_1 (TREE_VALUE (link
), p
)) == 0)
2627 if (memcmp ((char *) &zero
, p
, sizeof zero
))
2633 if (TREE_PURPOSE (link
)
2634 && TREE_CODE (TREE_PURPOSE (link
)) == FIELD_DECL
)
2636 if (memcmp ((char *) &TREE_PURPOSE (link
), p
,
2637 sizeof TREE_PURPOSE (link
)))
2640 p
+= sizeof TREE_PURPOSE (link
);
2642 else if (TREE_PURPOSE (link
))
2644 if ((p
= compare_constant_1 (TREE_PURPOSE (link
), p
)) == 0)
2647 else if (have_purpose
)
2651 if (memcmp ((char *) &zero
, p
, sizeof zero
))
2663 struct addr_const value
;
2665 decode_addr_const (exp
, &value
);
2666 strp
= (unsigned char *) &value
.offset
;
2667 len
= sizeof value
.offset
;
2668 /* Compare the offset. */
2670 if (*p
++ != *strp
++)
2673 /* Compare symbol name. */
2674 strp
= (const unsigned char *) XSTR (value
.base
, 0);
2675 len
= strlen ((const char *) strp
) + 1;
2682 p
= compare_constant_1 (TREE_OPERAND (exp
, 0), p
);
2686 return compare_constant_1 (TREE_OPERAND (exp
, 1), p
);
2690 case NON_LVALUE_EXPR
:
2691 return compare_constant_1 (TREE_OPERAND (exp
, 0), p
);
2694 if (lang_expand_constant
)
2696 exp
= (*lang_expand_constant
) (exp
);
2697 return compare_constant_1 (exp
, p
);
2702 /* Compare constant contents. */
2704 if (*p
++ != *strp
++)
2710 /* Construct a constant descriptor for the expression EXP.
2711 It is up to the caller to enter the descriptor in the hash table. */
2713 static struct constant_descriptor
*
2714 record_constant (exp
)
2717 struct constant_descriptor
*next
= 0;
2722 /* Make a struct constant_descriptor. The first three pointers will
2723 be filled in later. Here we just leave space for them. */
2725 obstack_grow (&permanent_obstack
, (char *) &next
, sizeof next
);
2726 obstack_grow (&permanent_obstack
, (char *) &label
, sizeof label
);
2727 obstack_grow (&permanent_obstack
, (char *) &rtl
, sizeof rtl
);
2729 /* Align the descriptor for the data payload. */
2730 pad
= (offsetof (struct constant_descriptor
, u
)
2731 - offsetof(struct constant_descriptor
, rtl
)
2732 - sizeof(next
->rtl
));
2734 obstack_blank (&permanent_obstack
, pad
);
2736 record_constant_1 (exp
);
2737 return (struct constant_descriptor
*) obstack_finish (&permanent_obstack
);
2740 /* Add a description of constant expression EXP
2741 to the object growing in `permanent_obstack'.
2742 No need to return its address; the caller will get that
2743 from the obstack when the object is complete. */
2746 record_constant_1 (exp
)
2749 register const unsigned char *strp
;
2751 register enum tree_code code
= TREE_CODE (exp
);
2753 obstack_1grow (&permanent_obstack
, (unsigned int) code
);
2758 obstack_1grow (&permanent_obstack
, TYPE_PRECISION (TREE_TYPE (exp
)));
2759 strp
= (unsigned char *) &TREE_INT_CST (exp
);
2760 len
= sizeof TREE_INT_CST (exp
);
2764 obstack_1grow (&permanent_obstack
, TYPE_PRECISION (TREE_TYPE (exp
)));
2765 strp
= (unsigned char *) &TREE_REAL_CST (exp
);
2766 len
= sizeof TREE_REAL_CST (exp
);
2770 if (flag_writable_strings
)
2773 obstack_1grow (&permanent_obstack
, TYPE_MODE (TREE_TYPE (exp
)));
2774 strp
= (const unsigned char *) TREE_STRING_POINTER (exp
);
2775 len
= TREE_STRING_LENGTH (exp
);
2776 obstack_grow (&permanent_obstack
, (char *) &TREE_STRING_LENGTH (exp
),
2777 sizeof TREE_STRING_LENGTH (exp
));
2781 record_constant_1 (TREE_REALPART (exp
));
2782 record_constant_1 (TREE_IMAGPART (exp
));
2786 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2788 int nbytes
= int_size_in_bytes (TREE_TYPE (exp
));
2789 obstack_grow (&permanent_obstack
, &nbytes
, sizeof (nbytes
));
2790 obstack_blank (&permanent_obstack
, nbytes
);
2791 get_set_constructor_bytes
2792 (exp
, (unsigned char *) permanent_obstack
.next_free
-nbytes
,
2799 int length
= list_length (CONSTRUCTOR_ELTS (exp
));
2800 enum machine_mode mode
= TYPE_MODE (TREE_TYPE (exp
));
2802 int have_purpose
= 0;
2804 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2805 if (TREE_PURPOSE (link
))
2808 obstack_grow (&permanent_obstack
, (char *) &length
, sizeof length
);
2810 /* For record constructors, insist that the types match.
2811 For arrays, just verify both constructors are for arrays
2812 of the same mode. Then insist that either both or none
2813 have any TREE_PURPOSE values. */
2814 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2815 type
= TREE_TYPE (exp
);
2819 obstack_grow (&permanent_obstack
, (char *) &type
, sizeof type
);
2820 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2821 obstack_grow (&permanent_obstack
, &mode
, sizeof mode
);
2823 obstack_grow (&permanent_obstack
, (char *) &have_purpose
,
2824 sizeof have_purpose
);
2826 /* For arrays, insist that the size in bytes match. */
2827 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2829 HOST_WIDE_INT size
= int_size_in_bytes (TREE_TYPE (exp
));
2830 obstack_grow (&permanent_obstack
, (char *) &size
, sizeof size
);
2833 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2835 if (TREE_VALUE (link
))
2836 record_constant_1 (TREE_VALUE (link
));
2841 obstack_grow (&permanent_obstack
,
2842 (char *) &zero
, sizeof zero
);
2845 if (TREE_PURPOSE (link
)
2846 && TREE_CODE (TREE_PURPOSE (link
)) == FIELD_DECL
)
2847 obstack_grow (&permanent_obstack
,
2848 (char *) &TREE_PURPOSE (link
),
2849 sizeof TREE_PURPOSE (link
));
2850 else if (TREE_PURPOSE (link
))
2851 record_constant_1 (TREE_PURPOSE (link
));
2852 else if (have_purpose
)
2856 obstack_grow (&permanent_obstack
,
2857 (char *) &zero
, sizeof zero
);
2865 struct addr_const value
;
2867 decode_addr_const (exp
, &value
);
2868 /* Record the offset. */
2869 obstack_grow (&permanent_obstack
,
2870 (char *) &value
.offset
, sizeof value
.offset
);
2872 switch (GET_CODE (value
.base
))
2875 /* Record the symbol name. */
2876 obstack_grow (&permanent_obstack
, XSTR (value
.base
, 0),
2877 strlen (XSTR (value
.base
, 0)) + 1);
2880 /* Record the address of the CODE_LABEL. It may not have
2881 been emitted yet, so it's UID may be zero. But pointer
2882 identity is good enough. */
2883 obstack_grow (&permanent_obstack
, &XEXP (value
.base
, 0),
2895 record_constant_1 (TREE_OPERAND (exp
, 0));
2896 record_constant_1 (TREE_OPERAND (exp
, 1));
2901 case NON_LVALUE_EXPR
:
2902 record_constant_1 (TREE_OPERAND (exp
, 0));
2906 if (lang_expand_constant
)
2908 exp
= (*lang_expand_constant
) (exp
);
2909 record_constant_1 (exp
);
2914 /* Record constant contents. */
2915 obstack_grow (&permanent_obstack
, strp
, len
);
2918 /* Record a list of constant expressions that were passed to
2919 output_constant_def but that could not be output right away. */
2921 struct deferred_constant
2923 struct deferred_constant
*next
;
2929 static struct deferred_constant
*deferred_constants
;
2931 /* Another list of constants which should be output after the
2933 static struct deferred_constant
*after_function_constants
;
2935 /* Nonzero means defer output of addressed subconstants
2936 (i.e., those for which output_constant_def is called.) */
2937 static int defer_addressed_constants_flag
;
2939 /* Start deferring output of subconstants. */
2942 defer_addressed_constants ()
2944 defer_addressed_constants_flag
++;
2947 /* Stop deferring output of subconstants,
2948 and output now all those that have been deferred. */
2951 output_deferred_addressed_constants ()
2953 struct deferred_constant
*p
, *next
;
2955 defer_addressed_constants_flag
--;
2957 if (defer_addressed_constants_flag
> 0)
2960 for (p
= deferred_constants
; p
; p
= next
)
2962 output_constant_def_contents (p
->exp
, p
->reloc
, p
->labelno
);
2967 deferred_constants
= 0;
2970 /* Output any constants which should appear after a function. */
2973 output_after_function_constants ()
2975 struct deferred_constant
*p
, *next
;
2977 for (p
= after_function_constants
; p
; p
= next
)
2979 output_constant_def_contents (p
->exp
, p
->reloc
, p
->labelno
);
2984 after_function_constants
= 0;
2987 /* Make a copy of the whole tree structure for a constant.
2988 This handles the same types of nodes that compare_constant
2989 and record_constant handle. */
2995 switch (TREE_CODE (exp
))
2998 /* For ADDR_EXPR, we do not want to copy the decl whose address
2999 is requested. We do want to copy constants though. */
3000 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, 0))) == 'c')
3001 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
3002 copy_constant (TREE_OPERAND (exp
, 0)));
3004 return copy_node (exp
);
3009 return copy_node (exp
);
3012 return build_complex (TREE_TYPE (exp
),
3013 copy_constant (TREE_REALPART (exp
)),
3014 copy_constant (TREE_IMAGPART (exp
)));
3018 return build (TREE_CODE (exp
), TREE_TYPE (exp
),
3019 copy_constant (TREE_OPERAND (exp
, 0)),
3020 copy_constant (TREE_OPERAND (exp
, 1)));
3024 case NON_LVALUE_EXPR
:
3025 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
3026 copy_constant (TREE_OPERAND (exp
, 0)));
3030 tree copy
= copy_node (exp
);
3031 tree list
= copy_list (CONSTRUCTOR_ELTS (exp
));
3034 CONSTRUCTOR_ELTS (copy
) = list
;
3035 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
3036 TREE_VALUE (tail
) = copy_constant (TREE_VALUE (tail
));
3037 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
3038 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
3039 TREE_PURPOSE (tail
) = copy_constant (TREE_PURPOSE (tail
));
3049 /* Return an rtx representing a reference to constant data in memory
3050 for the constant expression EXP.
3052 If assembler code for such a constant has already been output,
3053 return an rtx to refer to it.
3054 Otherwise, output such a constant in memory (or defer it for later)
3055 and generate an rtx for it.
3057 If DEFER is non-zero, the output of string constants can be deferred
3058 and output only if referenced in the function after all optimizations.
3060 The TREE_CST_RTL of EXP is set up to point to that rtx.
3061 The const_hash_table records which constants already have label strings. */
3064 output_constant_def (exp
, defer
)
3069 register struct constant_descriptor
*desc
;
3070 struct deferred_string
**defstr
;
3074 int after_function
= 0;
3077 if (TREE_CST_RTL (exp
))
3078 return TREE_CST_RTL (exp
);
3080 /* Make sure any other constants whose addresses appear in EXP
3081 are assigned label numbers. */
3083 reloc
= output_addressed_constants (exp
);
3085 /* Compute hash code of EXP. Search the descriptors for that hash code
3086 to see if any of them describes EXP. If yes, the descriptor records
3087 the label number already assigned. */
3089 hash
= const_hash (exp
) % MAX_HASH_TABLE
;
3091 for (desc
= const_hash_table
[hash
]; desc
; desc
= desc
->next
)
3092 if (compare_constant (exp
, desc
))
3097 /* No constant equal to EXP is known to have been output.
3098 Make a constant descriptor to enter EXP in the hash table.
3099 Assign the label number and record it in the descriptor for
3100 future calls to this function to find. */
3102 /* Create a string containing the label name, in LABEL. */
3103 labelno
= const_labelno
++;
3104 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", labelno
);
3106 desc
= record_constant (exp
);
3107 desc
->next
= const_hash_table
[hash
];
3108 desc
->label
= ggc_strdup (label
);
3109 const_hash_table
[hash
] = desc
;
3111 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
3113 = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp
)),
3114 gen_rtx_SYMBOL_REF (Pmode
, desc
->label
));
3116 set_mem_attributes (desc
->rtl
, exp
, 1);
3121 TREE_CST_RTL (exp
) = desc
->rtl
;
3123 /* Optionally set flags or add text to the name to record information
3124 such as that it is a function name. If the name is changed, the macro
3125 ASM_OUTPUT_LABELREF will have to know how to strip this information. */
3126 #ifdef ENCODE_SECTION_INFO
3127 /* A previously-processed constant would already have section info
3131 ENCODE_SECTION_INFO (exp
);
3132 desc
->rtl
= TREE_CST_RTL (exp
);
3133 desc
->label
= XSTR (XEXP (desc
->rtl
, 0), 0);
3137 #ifdef CONSTANT_AFTER_FUNCTION_P
3138 if (current_function_decl
!= 0
3139 && CONSTANT_AFTER_FUNCTION_P (exp
))
3144 && STRING_POOL_ADDRESS_P (XEXP (desc
->rtl
, 0))
3145 && (!defer
|| defer_addressed_constants_flag
|| after_function
))
3147 defstr
= (struct deferred_string
**)
3148 htab_find_slot_with_hash (const_str_htab
, desc
->label
,
3149 STRHASH (desc
->label
), NO_INSERT
);
3152 /* If the string is currently deferred but we need to output it now,
3153 remove it from deferred string hash table. */
3155 labelno
= (*defstr
)->labelno
;
3156 STRING_POOL_ADDRESS_P (XEXP (desc
->rtl
, 0)) = 0;
3157 htab_clear_slot (const_str_htab
, (void **) defstr
);
3161 /* If this is the first time we've seen this particular constant,
3162 output it (or defer its output for later). */
3165 if (defer_addressed_constants_flag
|| after_function
)
3167 struct deferred_constant
*p
;
3168 p
= (struct deferred_constant
*) xmalloc (sizeof (struct deferred_constant
));
3170 p
->exp
= copy_constant (exp
);
3172 p
->labelno
= labelno
;
3175 p
->next
= after_function_constants
;
3176 after_function_constants
= p
;
3180 p
->next
= deferred_constants
;
3181 deferred_constants
= p
;
3186 /* Do no output if -fsyntax-only. */
3187 if (! flag_syntax_only
)
3189 if (TREE_CODE (exp
) != STRING_CST
3191 || flag_writable_strings
3192 || (defstr
= (struct deferred_string
**)
3193 htab_find_slot_with_hash (const_str_htab
,
3195 STRHASH (desc
->label
),
3197 output_constant_def_contents (exp
, reloc
, labelno
);
3200 struct deferred_string
*p
;
3202 p
= (struct deferred_string
*)
3203 xmalloc (sizeof (struct deferred_string
));
3205 p
->exp
= copy_constant (exp
);
3206 p
->label
= desc
->label
;
3207 p
->labelno
= labelno
;
3209 STRING_POOL_ADDRESS_P (XEXP (desc
->rtl
, 0)) = 1;
3215 return TREE_CST_RTL (exp
);
3218 /* Now output assembler code to define the label for EXP,
3219 and follow it with the data of EXP. */
3222 output_constant_def_contents (exp
, reloc
, labelno
)
3229 if (IN_NAMED_SECTION (exp
))
3230 named_section (exp
, NULL
, reloc
);
3233 /* First switch to text section, except for writable strings. */
3234 #ifdef SELECT_SECTION
3235 SELECT_SECTION (exp
, reloc
);
3237 if (((TREE_CODE (exp
) == STRING_CST
) && flag_writable_strings
)
3238 || (flag_pic
&& reloc
))
3241 readonly_data_section ();
3245 /* Align the location counter as required by EXP's data type. */
3246 align
= TYPE_ALIGN (TREE_TYPE (exp
));
3247 #ifdef CONSTANT_ALIGNMENT
3248 align
= CONSTANT_ALIGNMENT (exp
, align
);
3251 if (align
> BITS_PER_UNIT
)
3252 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
3254 /* Output the label itself. */
3255 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LC", labelno
);
3257 /* Output the value of EXP. */
3258 output_constant (exp
,
3259 (TREE_CODE (exp
) == STRING_CST
3260 ? TREE_STRING_LENGTH (exp
)
3261 : int_size_in_bytes (TREE_TYPE (exp
))));
3265 /* Structure to represent sufficient information about a constant so that
3266 it can be output when the constant pool is output, so that function
3267 integration can be done, and to simplify handling on machines that reference
3268 constant pool as base+displacement. */
3270 struct pool_constant
3272 struct constant_descriptor
*desc
;
3273 struct pool_constant
*next
, *next_sym
;
3276 enum machine_mode mode
;
3283 /* Hash code for a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true.
3284 The argument is XSTR (... , 0) */
3286 #define SYMHASH(LABEL) \
3287 ((((unsigned long) (LABEL)) & ((1 << HASHBITS) - 1)) % MAX_RTX_HASH_TABLE)
3289 /* Initialize constant pool hashing for a new function. */
3292 init_varasm_status (f
)
3295 struct varasm_status
*p
;
3296 p
= (struct varasm_status
*) xmalloc (sizeof (struct varasm_status
));
3298 p
->x_const_rtx_hash_table
3299 = ((struct constant_descriptor
**)
3300 xcalloc (MAX_RTX_HASH_TABLE
, sizeof (struct constant_descriptor
*)));
3301 p
->x_const_rtx_sym_hash_table
3302 = ((struct pool_constant
**)
3303 xcalloc (MAX_RTX_HASH_TABLE
, sizeof (struct pool_constant
*)));
3305 p
->x_first_pool
= p
->x_last_pool
= 0;
3306 p
->x_pool_offset
= 0;
3307 p
->x_const_double_chain
= 0;
3310 /* Mark PC for GC. */
3313 mark_pool_constant (pc
)
3314 struct pool_constant
*pc
;
3319 ggc_mark_rtx (pc
->constant
);
3324 /* Mark P for GC. */
3327 mark_varasm_status (p
)
3328 struct varasm_status
*p
;
3333 mark_pool_constant (p
->x_first_pool
);
3334 ggc_mark_rtx (p
->x_const_double_chain
);
3337 /* Clear out all parts of the state in F that can safely be discarded
3338 after the function has been compiled, to let garbage collection
3339 reclaim the memory. */
3342 free_varasm_status (f
)
3345 struct varasm_status
*p
;
3350 /* Clear out the hash tables. */
3351 for (i
= 0; i
< MAX_RTX_HASH_TABLE
; ++i
)
3353 struct constant_descriptor
* cd
;
3355 cd
= p
->x_const_rtx_hash_table
[i
];
3357 struct constant_descriptor
* next
= cd
->next
;
3363 free (p
->x_const_rtx_hash_table
);
3364 free (p
->x_const_rtx_sym_hash_table
);
3369 enum kind
{ RTX_DOUBLE
, RTX_INT
};
3371 /* Express an rtx for a constant integer (perhaps symbolic)
3372 as the sum of a symbol or label plus an explicit integer.
3373 They are stored into VALUE. */
3376 decode_rtx_const (mode
, x
, value
)
3377 enum machine_mode mode
;
3379 struct rtx_const
*value
;
3381 /* Clear the whole structure, including any gaps. */
3382 memset (value
, 0, sizeof (struct rtx_const
));
3384 value
->kind
= RTX_INT
; /* Most usual kind. */
3387 switch (GET_CODE (x
))
3390 value
->kind
= RTX_DOUBLE
;
3391 if (GET_MODE (x
) != VOIDmode
)
3393 value
->mode
= GET_MODE (x
);
3394 memcpy ((char *) &value
->un
.du
,
3395 (char *) &CONST_DOUBLE_LOW (x
), sizeof value
->un
.du
);
3399 value
->un
.di
.low
= CONST_DOUBLE_LOW (x
);
3400 value
->un
.di
.high
= CONST_DOUBLE_HIGH (x
);
3405 value
->un
.addr
.offset
= INTVAL (x
);
3411 value
->un
.addr
.base
= x
;
3416 if (GET_CODE (x
) == PLUS
&& GET_CODE (XEXP (x
, 1)) == CONST_INT
)
3418 value
->un
.addr
.base
= XEXP (x
, 0);
3419 value
->un
.addr
.offset
= INTVAL (XEXP (x
, 1));
3421 else if (GET_CODE (x
) == MINUS
&& GET_CODE (XEXP (x
, 1)) == CONST_INT
)
3423 value
->un
.addr
.base
= XEXP (x
, 0);
3424 value
->un
.addr
.offset
= - INTVAL (XEXP (x
, 1));
3428 value
->un
.addr
.base
= x
;
3429 value
->un
.addr
.offset
= 0;
3437 if (value
->kind
== RTX_INT
&& value
->un
.addr
.base
!= 0)
3438 switch (GET_CODE (value
->un
.addr
.base
))
3441 /* Use the string's address, not the SYMBOL_REF's address,
3442 for the sake of addresses of library routines. */
3443 value
->un
.addr
.base
= (rtx
) XSTR (value
->un
.addr
.base
, 0);
3447 /* For a LABEL_REF, compare labels. */
3448 value
->un
.addr
.base
= XEXP (value
->un
.addr
.base
, 0);
3455 /* Given a MINUS expression, simplify it if both sides
3456 include the same symbol. */
3459 simplify_subtraction (x
)
3462 struct rtx_const val0
, val1
;
3464 decode_rtx_const (GET_MODE (x
), XEXP (x
, 0), &val0
);
3465 decode_rtx_const (GET_MODE (x
), XEXP (x
, 1), &val1
);
3467 if (val0
.un
.addr
.base
== val1
.un
.addr
.base
)
3468 return GEN_INT (val0
.un
.addr
.offset
- val1
.un
.addr
.offset
);
3472 /* Compute a hash code for a constant RTL expression. */
3475 const_hash_rtx (mode
, x
)
3476 enum machine_mode mode
;
3482 struct rtx_const value
;
3483 decode_rtx_const (mode
, x
, &value
);
3485 /* Compute hashing function */
3487 for (i
= 0; i
< sizeof value
/ sizeof (int); i
++)
3488 hi
+= ((int *) &value
)[i
];
3490 hi
&= (1 << HASHBITS
) - 1;
3491 hi
%= MAX_RTX_HASH_TABLE
;
3495 /* Compare a constant rtl object X with a constant-descriptor DESC.
3496 Return 1 if DESC describes a constant with the same value as X. */
3499 compare_constant_rtx (mode
, x
, desc
)
3500 enum machine_mode mode
;
3502 struct constant_descriptor
*desc
;
3504 register int *p
= (int *) desc
->u
.contents
;
3507 struct rtx_const value
;
3509 decode_rtx_const (mode
, x
, &value
);
3510 strp
= (int *) &value
;
3511 len
= sizeof value
/ sizeof (int);
3513 /* Compare constant contents. */
3515 if (*p
++ != *strp
++)
3521 /* Construct a constant descriptor for the rtl-expression X.
3522 It is up to the caller to enter the descriptor in the hash table. */
3524 static struct constant_descriptor
*
3525 record_constant_rtx (mode
, x
)
3526 enum machine_mode mode
;
3529 struct constant_descriptor
*ptr
;
3531 ptr
= ((struct constant_descriptor
*)
3532 xcalloc (1, (offsetof (struct constant_descriptor
, u
)
3533 + sizeof (struct rtx_const
))));
3534 decode_rtx_const (mode
, x
, (struct rtx_const
*) ptr
->u
.contents
);
3539 /* Given a constant rtx X, make (or find) a memory constant for its value
3540 and return a MEM rtx to refer to it in memory. */
3543 force_const_mem (mode
, x
)
3544 enum machine_mode mode
;
3548 register struct constant_descriptor
*desc
;
3550 const char *found
= 0;
3553 /* If we want this CONST_DOUBLE in the same mode as it is in memory
3554 (this will always be true for floating CONST_DOUBLEs that have been
3555 placed in memory, but not for VOIDmode (integer) CONST_DOUBLEs),
3556 use the previous copy. Otherwise, make a new one. Note that in
3557 the unlikely event that this same CONST_DOUBLE is used in two different
3558 modes in an alternating fashion, we will allocate a lot of different
3559 memory locations, but this should be extremely rare. */
3561 if (GET_CODE (x
) == CONST_DOUBLE
3562 && GET_CODE (CONST_DOUBLE_MEM (x
)) == MEM
3563 && GET_MODE (CONST_DOUBLE_MEM (x
)) == mode
)
3564 return CONST_DOUBLE_MEM (x
);
3566 /* Compute hash code of X. Search the descriptors for that hash code
3567 to see if any of them describes X. If yes, the descriptor records
3568 the label number already assigned. */
3570 hash
= const_hash_rtx (mode
, x
);
3572 for (desc
= const_rtx_hash_table
[hash
]; desc
; desc
= desc
->next
)
3573 if (compare_constant_rtx (mode
, x
, desc
))
3575 found
= desc
->label
;
3581 register struct pool_constant
*pool
;
3584 /* No constant equal to X is known to have been output.
3585 Make a constant descriptor to enter X in the hash table.
3586 Assign the label number and record it in the descriptor for
3587 future calls to this function to find. */
3589 desc
= record_constant_rtx (mode
, x
);
3590 desc
->next
= const_rtx_hash_table
[hash
];
3591 const_rtx_hash_table
[hash
] = desc
;
3593 /* Align the location counter as required by EXP's data type. */
3594 align
= (mode
== VOIDmode
) ? UNITS_PER_WORD
: GET_MODE_SIZE (mode
);
3595 if (align
> BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
3596 align
= BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
;
3597 #ifdef CONSTANT_ALIGNMENT
3598 align
= CONSTANT_ALIGNMENT (make_tree (type_for_mode (mode
, 0), x
),
3599 align
* BITS_PER_UNIT
) / BITS_PER_UNIT
;
3602 pool_offset
+= align
- 1;
3603 pool_offset
&= ~ (align
- 1);
3605 /* Allocate a pool constant descriptor, fill it in, and chain it in. */
3607 pool
= (struct pool_constant
*) ggc_alloc (sizeof (struct pool_constant
));
3611 pool
->labelno
= const_labelno
;
3612 pool
->align
= align
;
3613 pool
->offset
= pool_offset
;
3620 last_pool
->next
= pool
;
3623 pool_offset
+= GET_MODE_SIZE (mode
);
3625 /* Create a string containing the label name, in LABEL. */
3626 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
3630 desc
->label
= found
= ggc_strdup (label
);
3632 /* Add label to symbol hash table. */
3633 hash
= SYMHASH (found
);
3634 pool
->label
= found
;
3635 pool
->next_sym
= const_rtx_sym_hash_table
[hash
];
3636 const_rtx_sym_hash_table
[hash
] = pool
;
3639 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
3641 def
= gen_rtx_MEM (mode
, gen_rtx_SYMBOL_REF (Pmode
, found
));
3642 set_mem_attributes (def
, type_for_mode (mode
, 0), 1);
3643 RTX_UNCHANGING_P (def
) = 1;
3645 /* Mark the symbol_ref as belonging to this constants pool. */
3646 CONSTANT_POOL_ADDRESS_P (XEXP (def
, 0)) = 1;
3647 current_function_uses_const_pool
= 1;
3649 if (GET_CODE (x
) == CONST_DOUBLE
)
3651 if (CONST_DOUBLE_MEM (x
) == cc0_rtx
)
3653 CONST_DOUBLE_CHAIN (x
) = const_double_chain
;
3654 const_double_chain
= x
;
3656 CONST_DOUBLE_MEM (x
) = def
;
3662 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
3663 the corresponding pool_constant structure. */
3665 static struct pool_constant
*
3666 find_pool_constant (f
, addr
)
3670 struct pool_constant
*pool
;
3671 const char *label
= XSTR (addr
, 0);
3673 for (pool
= f
->varasm
->x_const_rtx_sym_hash_table
[SYMHASH (label
)]; pool
;
3674 pool
= pool
->next_sym
)
3675 if (pool
->label
== label
)
3681 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
3684 get_pool_constant (addr
)
3687 return (find_pool_constant (cfun
, addr
))->constant
;
3690 /* Likewise, but for the constant pool of a specific function. */
3693 get_pool_constant_for_function (f
, addr
)
3697 return (find_pool_constant (f
, addr
))->constant
;
3700 /* Similar, return the mode. */
3703 get_pool_mode (addr
)
3706 return (find_pool_constant (cfun
, addr
))->mode
;
3710 get_pool_mode_for_function (f
, addr
)
3714 return (find_pool_constant (f
, addr
))->mode
;
3717 /* Similar, return the offset in the constant pool. */
3720 get_pool_offset (addr
)
3723 return (find_pool_constant (cfun
, addr
))->offset
;
3726 /* Return the size of the constant pool. */
3734 /* Write all the constants in the constant pool. */
3737 output_constant_pool (fnname
, fndecl
)
3738 const char *fnname ATTRIBUTE_UNUSED
;
3739 tree fndecl ATTRIBUTE_UNUSED
;
3741 struct pool_constant
*pool
;
3743 union real_extract u
;
3745 /* It is possible for gcc to call force_const_mem and then to later
3746 discard the instructions which refer to the constant. In such a
3747 case we do not need to output the constant. */
3748 mark_constant_pool ();
3750 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3751 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3754 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3763 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3764 whose CODE_LABEL has been deleted. This can occur if a jump table
3765 is eliminated by optimization. If so, write a constant of zero
3766 instead. Note that this can also happen by turning the
3767 CODE_LABEL into a NOTE. */
3768 /* ??? This seems completely and utterly wrong. Certainly it's
3769 not true for NOTE_INSN_DELETED_LABEL, but I disbelieve proper
3770 functioning even with INSN_DELETED_P and friends. */
3773 switch (GET_CODE (x
))
3776 if (GET_CODE (XEXP (x
, 0)) != PLUS
3777 || GET_CODE (XEXP (XEXP (x
, 0), 0)) != LABEL_REF
)
3779 tmp
= XEXP (XEXP (x
, 0), 0);
3784 if (INSN_DELETED_P (tmp
)
3785 || (GET_CODE (tmp
) == NOTE
3786 && NOTE_LINE_NUMBER (tmp
) == NOTE_INSN_DELETED
))
3797 /* First switch to correct section. */
3798 #ifdef SELECT_RTX_SECTION
3799 SELECT_RTX_SECTION (pool
->mode
, x
);
3801 readonly_data_section ();
3804 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3805 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file
, x
, pool
->mode
,
3806 pool
->align
, pool
->labelno
, done
);
3809 if (pool
->align
> 1)
3810 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (pool
->align
));
3812 /* Output the label. */
3813 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LC", pool
->labelno
);
3815 /* Output the value of the constant itself. */
3816 switch (GET_MODE_CLASS (pool
->mode
))
3819 if (GET_CODE (x
) != CONST_DOUBLE
)
3822 memcpy ((char *) &u
, (char *) &CONST_DOUBLE_LOW (x
), sizeof u
);
3823 assemble_real (u
.d
, pool
->mode
);
3827 case MODE_PARTIAL_INT
:
3828 assemble_integer (x
, GET_MODE_SIZE (pool
->mode
), 1);
3835 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3841 #ifdef ASM_OUTPUT_POOL_EPILOGUE
3842 ASM_OUTPUT_POOL_EPILOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3845 /* Done with this pool. */
3846 first_pool
= last_pool
= 0;
3849 /* Look through the instructions for this function, and mark all the
3850 entries in the constant pool which are actually being used.
3851 Emit used deferred strings. */
3854 mark_constant_pool ()
3857 struct pool_constant
*pool
;
3859 if (first_pool
== 0 && htab_elements (const_str_htab
) == 0)
3862 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3865 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
3867 mark_constants (PATTERN (insn
));
3869 for (insn
= current_function_epilogue_delay_list
;
3871 insn
= XEXP (insn
, 1))
3873 mark_constants (PATTERN (insn
));
3876 /* Look through appropriate parts of X, marking all entries in the
3877 constant pool which are actually being used. Entries that are only
3878 referenced by other constants are also marked as used. Emit
3879 deferred strings that are used. */
3886 register const char *format_ptr
;
3891 if (GET_CODE (x
) == SYMBOL_REF
)
3893 mark_constant (&x
, NULL
);
3896 /* Never search inside a CONST_DOUBLE, because CONST_DOUBLE_MEM may be
3897 a MEM, but does not constitute a use of that MEM. */
3898 else if (GET_CODE (x
) == CONST_DOUBLE
)
3901 /* Insns may appear inside a SEQUENCE. Only check the patterns of
3902 insns, not any notes that may be attached. We don't want to mark
3903 a constant just because it happens to appear in a REG_EQUIV note. */
3906 mark_constants (PATTERN (x
));
3910 format_ptr
= GET_RTX_FORMAT (GET_CODE (x
));
3912 for (i
= 0; i
< GET_RTX_LENGTH (GET_CODE (x
)); i
++)
3914 switch (*format_ptr
++)
3917 mark_constants (XEXP (x
, i
));
3921 if (XVEC (x
, i
) != 0)
3925 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
3926 mark_constants (XVECEXP (x
, i
, j
));
3945 /* Given a SYMBOL_REF CURRENT_RTX, mark it and all constants it refers
3946 to as used. Emit referenced deferred strings. This function can
3947 be used with for_each_rtx () to mark all SYMBOL_REFs in an rtx. */
3950 mark_constant (current_rtx
, data
)
3952 void *data ATTRIBUTE_UNUSED
;
3954 rtx x
= *current_rtx
;
3958 else if (GET_CODE(x
) == CONST_DOUBLE
)
3959 /* Never search inside a CONST_DOUBLE because CONST_DOUBLE_MEM may
3960 be a MEM but does not constitute a use of that MEM. */
3962 else if (GET_CODE (x
) == SYMBOL_REF
)
3964 if (CONSTANT_POOL_ADDRESS_P (x
))
3966 struct pool_constant
*pool
= find_pool_constant (cfun
, x
);
3967 if (pool
->mark
== 0) {
3969 for_each_rtx (&(pool
->constant
), &mark_constant
, NULL
);
3974 else if (STRING_POOL_ADDRESS_P (x
))
3976 struct deferred_string
**defstr
;
3978 defstr
= (struct deferred_string
**)
3979 htab_find_slot_with_hash (const_str_htab
, XSTR (x
, 0),
3980 STRHASH (XSTR (x
, 0)), NO_INSERT
);
3983 struct deferred_string
*p
= *defstr
;
3985 STRING_POOL_ADDRESS_P (x
) = 0;
3986 output_constant_def_contents (p
->exp
, 0, p
->labelno
);
3987 htab_clear_slot (const_str_htab
, (void **) defstr
);
3994 /* Find all the constants whose addresses are referenced inside of EXP,
3995 and make sure assembler code with a label has been output for each one.
3996 Indicate whether an ADDR_EXPR has been encountered. */
3999 output_addressed_constants (exp
)
4004 /* Give the front-end a chance to convert VALUE to something that
4005 looks more like a constant to the back-end. */
4006 if (lang_expand_constant
)
4007 exp
= (*lang_expand_constant
) (exp
);
4009 switch (TREE_CODE (exp
))
4013 register tree constant
= TREE_OPERAND (exp
, 0);
4015 while (TREE_CODE (constant
) == COMPONENT_REF
)
4017 constant
= TREE_OPERAND (constant
, 0);
4020 if (TREE_CODE_CLASS (TREE_CODE (constant
)) == 'c'
4021 || TREE_CODE (constant
) == CONSTRUCTOR
)
4022 /* No need to do anything here
4023 for addresses of variables or functions. */
4024 output_constant_def (constant
, 0);
4031 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
4032 reloc
|= output_addressed_constants (TREE_OPERAND (exp
, 1));
4037 case NON_LVALUE_EXPR
:
4038 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
4044 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
4045 if (TREE_VALUE (link
) != 0)
4046 reloc
|= output_addressed_constants (TREE_VALUE (link
));
4056 /* Return nonzero if VALUE is a valid constant-valued expression
4057 for use in initializing a static variable; one that can be an
4058 element of a "constant" initializer.
4060 Return null_pointer_node if the value is absolute;
4061 if it is relocatable, return the variable that determines the relocation.
4062 We assume that VALUE has been folded as much as possible;
4063 therefore, we do not need to check for such things as
4064 arithmetic-combinations of integers. */
4067 initializer_constant_valid_p (value
, endtype
)
4071 /* Give the front-end a chance to convert VALUE to something that
4072 looks more like a constant to the back-end. */
4073 if (lang_expand_constant
)
4074 value
= (*lang_expand_constant
) (value
);
4076 switch (TREE_CODE (value
))
4079 if ((TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
4080 || TREE_CODE (TREE_TYPE (value
)) == RECORD_TYPE
)
4081 && TREE_CONSTANT (value
)
4082 && CONSTRUCTOR_ELTS (value
))
4084 initializer_constant_valid_p (TREE_VALUE (CONSTRUCTOR_ELTS (value
)),
4087 return TREE_STATIC (value
) ? null_pointer_node
: 0;
4093 return null_pointer_node
;
4096 return staticp (TREE_OPERAND (value
, 0)) ? TREE_OPERAND (value
, 0) : 0;
4098 case NON_LVALUE_EXPR
:
4099 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
4103 /* Allow conversions between pointer types. */
4104 if (POINTER_TYPE_P (TREE_TYPE (value
))
4105 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
4106 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
4108 /* Allow conversions between real types. */
4109 if (FLOAT_TYPE_P (TREE_TYPE (value
))
4110 && FLOAT_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
4111 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
4113 /* Allow length-preserving conversions between integer types. */
4114 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
4115 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
4116 && (TYPE_PRECISION (TREE_TYPE (value
))
4117 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
4118 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
4120 /* Allow conversions between other integer types only if
4122 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
4123 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
4125 tree inner
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4127 if (inner
== null_pointer_node
)
4128 return null_pointer_node
;
4132 /* Allow (int) &foo provided int is as wide as a pointer. */
4133 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
4134 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
4135 && (TYPE_PRECISION (TREE_TYPE (value
))
4136 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
4137 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4140 /* Likewise conversions from int to pointers, but also allow
4141 conversions from 0. */
4142 if (POINTER_TYPE_P (TREE_TYPE (value
))
4143 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
4145 if (integer_zerop (TREE_OPERAND (value
, 0)))
4146 return null_pointer_node
;
4147 else if (TYPE_PRECISION (TREE_TYPE (value
))
4148 <= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0))))
4149 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4153 /* Allow conversions to union types if the value inside is okay. */
4154 if (TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
)
4155 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4160 if (! INTEGRAL_TYPE_P (endtype
)
4161 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
4163 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4165 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
4167 /* If either term is absolute, use the other terms relocation. */
4168 if (valid0
== null_pointer_node
)
4170 if (valid1
== null_pointer_node
)
4176 if (! INTEGRAL_TYPE_P (endtype
)
4177 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
4179 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4181 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
4183 /* Win if second argument is absolute. */
4184 if (valid1
== null_pointer_node
)
4186 /* Win if both arguments have the same relocation.
4187 Then the value is absolute. */
4188 if (valid0
== valid1
&& valid0
!= 0)
4189 return null_pointer_node
;
4191 /* Since GCC guarantees that string constants are unique in the
4192 generated code, a subtraction between two copies of the same
4193 constant string is absolute. */
4194 if (valid0
&& TREE_CODE (valid0
) == STRING_CST
&&
4195 valid1
&& TREE_CODE (valid1
) == STRING_CST
&&
4196 TREE_STRING_POINTER (valid0
) == TREE_STRING_POINTER (valid1
))
4197 return null_pointer_node
;
4200 /* Support differences between labels. */
4201 if (INTEGRAL_TYPE_P (endtype
))
4204 op0
= TREE_OPERAND (value
, 0);
4205 op1
= TREE_OPERAND (value
, 1);
4209 if (TREE_CODE (op0
) == ADDR_EXPR
4210 && TREE_CODE (TREE_OPERAND (op0
, 0)) == LABEL_DECL
4211 && TREE_CODE (op1
) == ADDR_EXPR
4212 && TREE_CODE (TREE_OPERAND (op1
, 0)) == LABEL_DECL
)
4213 return null_pointer_node
;
4224 /* Output assembler code for constant EXP to FILE, with no label.
4225 This includes the pseudo-op such as ".int" or ".byte", and a newline.
4226 Assumes output_addressed_constants has been done on EXP already.
4228 Generate exactly SIZE bytes of assembler data, padding at the end
4229 with zeros if necessary. SIZE must always be specified.
4231 SIZE is important for structure constructors,
4232 since trailing members may have been omitted from the constructor.
4233 It is also important for initialization of arrays from string constants
4234 since the full length of the string constant might not be wanted.
4235 It is also needed for initialization of unions, where the initializer's
4236 type is just one member, and that may not be as long as the union.
4238 There a case in which we would fail to output exactly SIZE bytes:
4239 for a structure constructor that wants to produce more than SIZE bytes.
4240 But such constructors will never be generated for any possible input. */
4243 output_constant (exp
, size
)
4247 register enum tree_code code
= TREE_CODE (TREE_TYPE (exp
));
4249 /* Some front-ends use constants other than the standard
4250 language-indepdent varieties, but which may still be output
4251 directly. Give the front-end a chance to convert EXP to a
4252 language-independent representation. */
4253 if (lang_expand_constant
)
4255 exp
= (*lang_expand_constant
) (exp
);
4256 code
= TREE_CODE (TREE_TYPE (exp
));
4259 if (size
== 0 || flag_syntax_only
)
4262 /* Eliminate the NON_LVALUE_EXPR_EXPR that makes a cast not be an lvalue.
4263 That way we get the constant (we hope) inside it. Also, strip off any
4264 NOP_EXPR that converts between two record, union, array, or set types
4265 or a CONVERT_EXPR that converts to a union TYPE. */
4266 while ((TREE_CODE (exp
) == NOP_EXPR
4267 && (TREE_TYPE (exp
) == TREE_TYPE (TREE_OPERAND (exp
, 0))
4268 || AGGREGATE_TYPE_P (TREE_TYPE (exp
))))
4269 || (TREE_CODE (exp
) == CONVERT_EXPR
4270 && code
== UNION_TYPE
)
4271 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
4273 exp
= TREE_OPERAND (exp
, 0);
4274 code
= TREE_CODE (TREE_TYPE (exp
));
4277 /* Allow a constructor with no elements for any data type.
4278 This means to fill the space with zeros. */
4279 if (TREE_CODE (exp
) == CONSTRUCTOR
&& CONSTRUCTOR_ELTS (exp
) == 0)
4281 assemble_zeros (size
);
4292 case REFERENCE_TYPE
:
4293 /* ??? What about (int)((float)(int)&foo + 4) */
4294 while (TREE_CODE (exp
) == NOP_EXPR
|| TREE_CODE (exp
) == CONVERT_EXPR
4295 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
4296 exp
= TREE_OPERAND (exp
, 0);
4298 if (! assemble_integer (expand_expr (exp
, NULL_RTX
, VOIDmode
,
4299 EXPAND_INITIALIZER
),
4301 error ("initializer for integer value is too complicated");
4306 if (TREE_CODE (exp
) != REAL_CST
)
4307 error ("initializer for floating value is not a floating constant");
4309 assemble_real (TREE_REAL_CST (exp
),
4310 mode_for_size (size
* BITS_PER_UNIT
, MODE_FLOAT
, 0));
4315 output_constant (TREE_REALPART (exp
), size
/ 2);
4316 output_constant (TREE_IMAGPART (exp
), size
/ 2);
4317 size
-= (size
/ 2) * 2;
4321 if (TREE_CODE (exp
) == CONSTRUCTOR
)
4323 output_constructor (exp
, size
);
4326 else if (TREE_CODE (exp
) == STRING_CST
)
4330 if (size
> TREE_STRING_LENGTH (exp
))
4332 excess
= size
- TREE_STRING_LENGTH (exp
);
4333 size
= TREE_STRING_LENGTH (exp
);
4336 assemble_string (TREE_STRING_POINTER (exp
), size
);
4345 if (TREE_CODE (exp
) == CONSTRUCTOR
)
4346 output_constructor (exp
, size
);
4352 if (TREE_CODE (exp
) == INTEGER_CST
)
4353 assemble_integer (expand_expr (exp
, NULL_RTX
,
4354 VOIDmode
, EXPAND_INITIALIZER
),
4356 else if (TREE_CODE (exp
) == CONSTRUCTOR
)
4358 unsigned char *buffer
= (unsigned char *) alloca (size
);
4359 if (get_set_constructor_bytes (exp
, buffer
, size
))
4361 assemble_string ((char *) buffer
, size
);
4364 error ("unknown set constructor type");
4372 assemble_zeros (size
);
4376 /* Subroutine of output_constructor, used for computing the size of
4377 arrays of unspecified length. VAL must be a CONSTRUCTOR of an array
4378 type with an unspecified upper bound. */
4380 static unsigned HOST_WIDE_INT
4381 array_size_for_constructor (val
)
4386 max_index
= NULL_TREE
;
4387 for (i
= CONSTRUCTOR_ELTS (val
); i
; i
= TREE_CHAIN (i
))
4389 tree index
= TREE_PURPOSE (i
);
4391 if (TREE_CODE (index
) == RANGE_EXPR
)
4392 index
= TREE_OPERAND (index
, 1);
4393 if (max_index
== NULL_TREE
|| tree_int_cst_lt (max_index
, index
))
4397 if (max_index
== NULL_TREE
)
4400 /* Compute the total number of array elements. */
4401 i
= size_binop (MINUS_EXPR
, convert (sizetype
, max_index
),
4403 TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (val
)))));
4404 i
= size_binop (PLUS_EXPR
, i
, convert (sizetype
, integer_one_node
));
4406 /* Multiply by the array element unit size to find number of bytes. */
4407 i
= size_binop (MULT_EXPR
, i
, TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (val
))));
4409 return tree_low_cst (i
, 1);
4412 /* Subroutine of output_constant, used for CONSTRUCTORs (aggregate constants).
4413 Generate at least SIZE bytes, padding if necessary. */
4416 output_constructor (exp
, size
)
4420 tree type
= TREE_TYPE (exp
);
4421 register tree link
, field
= 0;
4423 /* Number of bytes output or skipped so far.
4424 In other words, current position within the constructor. */
4425 HOST_WIDE_INT total_bytes
= 0;
4426 /* Non-zero means BYTE contains part of a byte, to be output. */
4427 int byte_buffer_in_use
= 0;
4428 register int byte
= 0;
4430 if (HOST_BITS_PER_WIDE_INT
< BITS_PER_UNIT
)
4433 if (TREE_CODE (type
) == RECORD_TYPE
)
4434 field
= TYPE_FIELDS (type
);
4436 if (TREE_CODE (type
) == ARRAY_TYPE
4437 && TYPE_DOMAIN (type
) != 0)
4438 min_index
= TYPE_MIN_VALUE (TYPE_DOMAIN (type
));
4440 /* As LINK goes through the elements of the constant,
4441 FIELD goes through the structure fields, if the constant is a structure.
4442 if the constant is a union, then we override this,
4443 by getting the field from the TREE_LIST element.
4444 But the constant could also be an array. Then FIELD is zero.
4446 There is always a maximum of one element in the chain LINK for unions
4447 (even if the initializer in a source program incorrectly contains
4449 for (link
= CONSTRUCTOR_ELTS (exp
);
4451 link
= TREE_CHAIN (link
),
4452 field
= field
? TREE_CHAIN (field
) : 0)
4454 tree val
= TREE_VALUE (link
);
4457 /* The element in a union constructor specifies the proper field
4459 if ((TREE_CODE (type
) == RECORD_TYPE
|| TREE_CODE (type
) == UNION_TYPE
4460 || TREE_CODE (type
) == QUAL_UNION_TYPE
)
4461 && TREE_PURPOSE (link
) != 0)
4462 field
= TREE_PURPOSE (link
);
4464 else if (TREE_CODE (type
) == ARRAY_TYPE
)
4465 index
= TREE_PURPOSE (link
);
4467 /* Eliminate the marker that makes a cast not be an lvalue. */
4471 if (index
&& TREE_CODE (index
) == RANGE_EXPR
)
4473 unsigned HOST_WIDE_INT fieldsize
4474 = int_size_in_bytes (TREE_TYPE (type
));
4475 HOST_WIDE_INT lo_index
= tree_low_cst (TREE_OPERAND (index
, 0), 0);
4476 HOST_WIDE_INT hi_index
= tree_low_cst (TREE_OPERAND (index
, 1), 0);
4477 HOST_WIDE_INT index
;
4479 for (index
= lo_index
; index
<= hi_index
; index
++)
4481 /* Output the element's initial value. */
4483 assemble_zeros (fieldsize
);
4485 output_constant (val
, fieldsize
);
4487 /* Count its size. */
4488 total_bytes
+= fieldsize
;
4491 else if (field
== 0 || !DECL_BIT_FIELD (field
))
4493 /* An element that is not a bit-field. */
4495 unsigned HOST_WIDE_INT fieldsize
;
4496 /* Since this structure is static,
4497 we know the positions are constant. */
4498 HOST_WIDE_INT pos
= field
? int_byte_position (field
) : 0;
4501 pos
= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (val
)), 1)
4502 * (tree_low_cst (index
, 0) - tree_low_cst (min_index
, 0)));
4504 /* Output any buffered-up bit-fields preceding this element. */
4505 if (byte_buffer_in_use
)
4507 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4509 byte_buffer_in_use
= 0;
4512 /* Advance to offset of this element.
4513 Note no alignment needed in an array, since that is guaranteed
4514 if each element has the proper size. */
4515 if ((field
!= 0 || index
!= 0) && pos
!= total_bytes
)
4517 assemble_zeros (pos
- total_bytes
);
4521 else if (field
!= 0 && DECL_PACKED (field
))
4522 /* Some assemblers automaticallly align a datum according to its
4523 size if no align directive is specified. The datum, however,
4524 may be declared with 'packed' attribute, so we have to disable
4526 ASM_OUTPUT_ALIGN (asm_out_file
, 0);
4528 /* Determine size this element should occupy. */
4533 /* If this is an array with an unspecified upper bound,
4534 the initializer determines the size. */
4535 /* ??? This ought to only checked if DECL_SIZE_UNIT is NULL,
4536 but we cannot do this until the deprecated support for
4537 initializing zero-length array members is removed. */
4538 if (TREE_CODE (TREE_TYPE (field
)) == ARRAY_TYPE
4539 && TYPE_DOMAIN (TREE_TYPE (field
))
4540 && ! TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (field
))))
4542 fieldsize
= array_size_for_constructor (val
);
4543 /* Given a non-empty initialization, this field had
4545 if (fieldsize
!= 0 && TREE_CHAIN (field
) != NULL_TREE
)
4548 else if (DECL_SIZE_UNIT (field
))
4550 /* ??? This can't be right. If the decl size overflows
4551 a host integer we will silently emit no data. */
4552 if (host_integerp (DECL_SIZE_UNIT (field
), 1))
4553 fieldsize
= tree_low_cst (DECL_SIZE_UNIT (field
), 1);
4557 fieldsize
= int_size_in_bytes (TREE_TYPE (type
));
4559 /* Output the element's initial value. */
4561 assemble_zeros (fieldsize
);
4563 output_constant (val
, fieldsize
);
4565 /* Count its size. */
4566 total_bytes
+= fieldsize
;
4568 else if (val
!= 0 && TREE_CODE (val
) != INTEGER_CST
)
4569 error ("invalid initial value for member `%s'",
4570 IDENTIFIER_POINTER (DECL_NAME (field
)));
4573 /* Element that is a bit-field. */
4575 HOST_WIDE_INT next_offset
= int_bit_position (field
);
4576 HOST_WIDE_INT end_offset
4577 = (next_offset
+ tree_low_cst (DECL_SIZE (field
), 1));
4580 val
= integer_zero_node
;
4582 /* If this field does not start in this (or, next) byte,
4584 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4586 /* Output remnant of any bit field in previous bytes. */
4587 if (byte_buffer_in_use
)
4589 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4591 byte_buffer_in_use
= 0;
4594 /* If still not at proper byte, advance to there. */
4595 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4597 assemble_zeros (next_offset
/ BITS_PER_UNIT
- total_bytes
);
4598 total_bytes
= next_offset
/ BITS_PER_UNIT
;
4602 if (! byte_buffer_in_use
)
4605 /* We must split the element into pieces that fall within
4606 separate bytes, and combine each byte with previous or
4607 following bit-fields. */
4609 /* next_offset is the offset n fbits from the beginning of
4610 the structure to the next bit of this element to be processed.
4611 end_offset is the offset of the first bit past the end of
4613 while (next_offset
< end_offset
)
4617 HOST_WIDE_INT value
;
4618 HOST_WIDE_INT next_byte
= next_offset
/ BITS_PER_UNIT
;
4619 HOST_WIDE_INT next_bit
= next_offset
% BITS_PER_UNIT
;
4621 /* Advance from byte to byte
4622 within this element when necessary. */
4623 while (next_byte
!= total_bytes
)
4625 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4630 /* Number of bits we can process at once
4631 (all part of the same byte). */
4632 this_time
= MIN (end_offset
- next_offset
,
4633 BITS_PER_UNIT
- next_bit
);
4634 if (BYTES_BIG_ENDIAN
)
4636 /* On big-endian machine, take the most significant bits
4637 first (of the bits that are significant)
4638 and put them into bytes from the most significant end. */
4639 shift
= end_offset
- next_offset
- this_time
;
4641 /* Don't try to take a bunch of bits that cross
4642 the word boundary in the INTEGER_CST. We can
4643 only select bits from the LOW or HIGH part
4645 if (shift
< HOST_BITS_PER_WIDE_INT
4646 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4648 this_time
= shift
+ this_time
- HOST_BITS_PER_WIDE_INT
;
4649 shift
= HOST_BITS_PER_WIDE_INT
;
4652 /* Now get the bits from the appropriate constant word. */
4653 if (shift
< HOST_BITS_PER_WIDE_INT
)
4654 value
= TREE_INT_CST_LOW (val
);
4655 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4657 value
= TREE_INT_CST_HIGH (val
);
4658 shift
-= HOST_BITS_PER_WIDE_INT
;
4663 /* Get the result. This works only when:
4664 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4665 byte
|= (((value
>> shift
)
4666 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4667 << (BITS_PER_UNIT
- this_time
- next_bit
));
4671 /* On little-endian machines,
4672 take first the least significant bits of the value
4673 and pack them starting at the least significant
4674 bits of the bytes. */
4675 shift
= next_offset
- int_bit_position (field
);
4677 /* Don't try to take a bunch of bits that cross
4678 the word boundary in the INTEGER_CST. We can
4679 only select bits from the LOW or HIGH part
4681 if (shift
< HOST_BITS_PER_WIDE_INT
4682 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4683 this_time
= (HOST_BITS_PER_WIDE_INT
- shift
);
4685 /* Now get the bits from the appropriate constant word. */
4686 if (shift
< HOST_BITS_PER_WIDE_INT
)
4687 value
= TREE_INT_CST_LOW (val
);
4688 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4690 value
= TREE_INT_CST_HIGH (val
);
4691 shift
-= HOST_BITS_PER_WIDE_INT
;
4696 /* Get the result. This works only when:
4697 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4698 byte
|= (((value
>> shift
)
4699 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4703 next_offset
+= this_time
;
4704 byte_buffer_in_use
= 1;
4709 if (byte_buffer_in_use
)
4711 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4715 if (total_bytes
< size
)
4716 assemble_zeros (size
- total_bytes
);
4719 #ifdef HANDLE_PRAGMA_WEAK
4720 /* Add function NAME to the weak symbols list. VALUE is a weak alias
4721 associatd with NAME. */
4724 add_weak (name
, value
)
4728 struct weak_syms
*weak
;
4730 weak
= (struct weak_syms
*) permalloc (sizeof (struct weak_syms
));
4735 weak
->next
= weak_decls
;
4737 weak
->value
= value
;
4742 #endif /* HANDLE_PRAGMA_WEAK */
4744 /* Declare DECL to be a weak symbol. */
4750 if (! TREE_PUBLIC (decl
))
4751 error_with_decl (decl
, "weak declaration of `%s' must be public");
4752 else if (TREE_ASM_WRITTEN (decl
))
4753 error_with_decl (decl
, "weak declaration of `%s' must precede definition");
4754 else if (SUPPORTS_WEAK
)
4755 DECL_WEAK (decl
) = 1;
4756 #ifdef HANDLE_PRAGMA_WEAK
4757 add_weak (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)), NULL
);
4761 /* Emit any pending weak declarations. */
4763 #ifdef HANDLE_PRAGMA_WEAK
4764 struct weak_syms
* weak_decls
;
4770 #ifdef HANDLE_PRAGMA_WEAK
4771 if (HANDLE_PRAGMA_WEAK
)
4773 struct weak_syms
*t
;
4774 for (t
= weak_decls
; t
; t
= t
->next
)
4778 ASM_WEAKEN_LABEL (asm_out_file
, t
->name
);
4780 ASM_OUTPUT_DEF (asm_out_file
, t
->name
, t
->value
);
4787 /* Remove NAME from the pending list of weak symbols. This prevents
4788 the compiler from emitting multiple .weak directives which confuses
4790 #ifdef ASM_WEAKEN_LABEL
4792 remove_from_pending_weak_list (name
)
4793 const char *name ATTRIBUTE_UNUSED
;
4795 #ifdef HANDLE_PRAGMA_WEAK
4796 if (HANDLE_PRAGMA_WEAK
)
4798 struct weak_syms
*t
;
4799 for (t
= weak_decls
; t
; t
= t
->next
)
4801 if (t
->name
&& strcmp (name
, t
->name
) == 0)
4810 assemble_alias (decl
, target
)
4811 tree decl
, target ATTRIBUTE_UNUSED
;
4815 /* We must force creation of DECL_RTL for debug info generation, even though
4816 we don't use it here. */
4817 make_decl_rtl (decl
, NULL_PTR
);
4819 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
4821 #ifdef ASM_OUTPUT_DEF
4822 /* Make name accessible from other files, if appropriate. */
4824 if (TREE_PUBLIC (decl
))
4826 #ifdef ASM_WEAKEN_LABEL
4827 if (DECL_WEAK (decl
))
4829 ASM_WEAKEN_LABEL (asm_out_file
, name
);
4830 /* Remove this function from the pending weak list so that
4831 we do not emit multiple .weak directives for it. */
4832 remove_from_pending_weak_list
4833 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
4837 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
4840 #ifdef ASM_OUTPUT_DEF_FROM_DECLS
4841 ASM_OUTPUT_DEF_FROM_DECLS (asm_out_file
, decl
, target
);
4843 ASM_OUTPUT_DEF (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4845 TREE_ASM_WRITTEN (decl
) = 1;
4847 #ifdef ASM_OUTPUT_WEAK_ALIAS
4848 if (! DECL_WEAK (decl
))
4849 warning ("only weak aliases are supported in this configuration");
4851 ASM_OUTPUT_WEAK_ALIAS (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4852 TREE_ASM_WRITTEN (decl
) = 1;
4854 warning ("alias definitions not supported in this configuration; ignored");
4859 /* Returns 1 if the target configuration supports defining public symbols
4860 so that one of them will be chosen at link time instead of generating a
4861 multiply-defined symbol error, whether through the use of weak symbols or
4862 a target-specific mechanism for having duplicates discarded. */
4865 supports_one_only ()
4867 if (SUPPORTS_ONE_ONLY
)
4869 return SUPPORTS_WEAK
;
4872 /* Set up DECL as a public symbol that can be defined in multiple
4873 translation units without generating a linker error. */
4876 make_decl_one_only (decl
)
4879 if (TREE_CODE (decl
) != VAR_DECL
&& TREE_CODE (decl
) != FUNCTION_DECL
)
4882 TREE_PUBLIC (decl
) = 1;
4884 if (TREE_CODE (decl
) == VAR_DECL
4885 && (DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
))
4886 DECL_COMMON (decl
) = 1;
4887 else if (SUPPORTS_ONE_ONLY
)
4889 #ifdef MAKE_DECL_ONE_ONLY
4890 MAKE_DECL_ONE_ONLY (decl
);
4892 DECL_ONE_ONLY (decl
) = 1;
4894 else if (SUPPORTS_WEAK
)
4895 DECL_WEAK (decl
) = 1;
4903 const_str_htab
= htab_create (128, const_str_htab_hash
, const_str_htab_eq
,
4904 const_str_htab_del
);
4905 ggc_add_root (const_hash_table
, MAX_HASH_TABLE
, sizeof const_hash_table
[0],
4906 mark_const_hash_entry
);
4907 ggc_add_root (&const_str_htab
, 1, sizeof const_str_htab
,
4908 mark_const_str_htab
);
4911 /* Extra support for EH values. */
4913 assemble_eh_label (name
)
4916 #ifdef ASM_OUTPUT_EH_LABEL
4917 ASM_OUTPUT_EH_LABEL (asm_out_file
, name
);
4919 assemble_label (name
);
4923 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
4926 assemble_eh_align (align
)
4929 #ifdef ASM_OUTPUT_EH_ALIGN
4930 if (align
> BITS_PER_UNIT
)
4931 ASM_OUTPUT_EH_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
4933 assemble_align (align
);
4938 /* On some platforms, we may want to specify a special mechansim to
4939 output EH data when generating with a function.. */
4941 assemble_eh_integer (x
, size
, force
)
4949 #ifdef ASM_OUTPUT_EH_CHAR
4951 ASM_OUTPUT_EH_CHAR (asm_out_file
, x
);
4955 #ifdef ASM_OUTPUT_EH_SHORT
4957 ASM_OUTPUT_EH_SHORT (asm_out_file
, x
);
4961 #ifdef ASM_OUTPUT_EH_INT
4963 ASM_OUTPUT_EH_INT (asm_out_file
, x
);
4967 #ifdef ASM_OUTPUT_EH_DOUBLE_INT
4969 ASM_OUTPUT_EH_DOUBLE_INT (asm_out_file
, x
);
4976 return (assemble_integer (x
, size
, force
));