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 GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
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. */
37 #include "hard-reg-set.h"
50 #ifdef XCOFF_DEBUGGING_INFO
51 #include "xcoffout.h" /* Needed for external data
52 declarations for e.g. AIX 4.x. */
55 #ifndef TRAMPOLINE_ALIGNMENT
56 #define TRAMPOLINE_ALIGNMENT FUNCTION_BOUNDARY
60 #define ASM_STABS_OP "\t.stabs\t"
63 /* Define the prefix to use when check_memory_usage_flag is enable. */
64 #define CHKR_PREFIX "_CHKR_"
65 #define CHKR_PREFIX_SIZE (sizeof (CHKR_PREFIX) - 1)
67 /* The (assembler) name of the first globally-visible object output. */
68 const char *first_global_object_name
;
69 const char *weak_global_object_name
;
71 extern struct obstack permanent_obstack
;
72 #define obstack_chunk_alloc xmalloc
75 struct constant_descriptor
;
79 #define MAX_RTX_HASH_TABLE 61
83 /* Hash facility for making memory-constants
84 from constant rtl-expressions. It is used on RISC machines
85 where immediate integer arguments and constant addresses are restricted
86 so that such constants must be stored in memory.
88 This pool of constants is reinitialized for each function
89 so each function gets its own constants-pool that comes right before
91 struct constant_descriptor
**x_const_rtx_hash_table
;
92 struct pool_constant
**x_const_rtx_sym_hash_table
;
94 /* Pointers to first and last constant in pool. */
95 struct pool_constant
*x_first_pool
, *x_last_pool
;
97 /* Current offset in constant pool (does not include any machine-specific
101 /* Chain of all CONST_DOUBLE rtx's constructed for the current function.
102 They are chained through the CONST_DOUBLE_CHAIN.
103 A CONST_DOUBLE rtx has CONST_DOUBLE_MEM != cc0_rtx iff it is on this chain.
104 In that case, CONST_DOUBLE_MEM is either a MEM,
105 or const0_rtx if no MEM has been made for this CONST_DOUBLE yet. */
106 rtx x_const_double_chain
;
109 #define const_rtx_hash_table (cfun->varasm->x_const_rtx_hash_table)
110 #define const_rtx_sym_hash_table (cfun->varasm->x_const_rtx_sym_hash_table)
111 #define first_pool (cfun->varasm->x_first_pool)
112 #define last_pool (cfun->varasm->x_last_pool)
113 #define pool_offset (cfun->varasm->x_pool_offset)
114 #define const_double_chain (cfun->varasm->x_const_double_chain)
116 /* Number for making the label on the next
117 constant that is stored in memory. */
121 /* Number for making the label on the next
122 static variable internal to a function. */
126 /* Carry information from ASM_DECLARE_OBJECT_NAME
127 to ASM_FINISH_DECLARE_OBJECT. */
129 int size_directive_output
;
131 /* The last decl for which assemble_variable was called,
132 if it did ASM_DECLARE_OBJECT_NAME.
133 If the last call to assemble_variable didn't do that,
136 tree last_assemble_variable_decl
;
138 static const char *strip_reg_name
PARAMS ((const char *));
139 static int contains_pointers_p
PARAMS ((tree
));
140 static void assemble_real_1
PARAMS ((PTR
));
141 static void decode_addr_const
PARAMS ((tree
, struct addr_const
*));
142 static int const_hash
PARAMS ((tree
));
143 static int compare_constant
PARAMS ((tree
,
144 struct constant_descriptor
*));
145 static const unsigned char *compare_constant_1
PARAMS ((tree
, const unsigned char *));
146 static struct constant_descriptor
*record_constant
PARAMS ((tree
));
147 static void record_constant_1
PARAMS ((tree
));
148 static tree copy_constant
PARAMS ((tree
));
149 static void output_constant_def_contents
PARAMS ((tree
, int, int));
150 static void decode_rtx_const
PARAMS ((enum machine_mode
, rtx
,
151 struct rtx_const
*));
152 static int const_hash_rtx
PARAMS ((enum machine_mode
, rtx
));
153 static int compare_constant_rtx
PARAMS ((enum machine_mode
, rtx
,
154 struct constant_descriptor
*));
155 static struct constant_descriptor
*record_constant_rtx
PARAMS ((enum machine_mode
,
157 static struct pool_constant
*find_pool_constant
PARAMS ((struct function
*, rtx
));
158 static void mark_constant_pool
PARAMS ((void));
159 static void mark_constants
PARAMS ((rtx
));
160 static int mark_constant
PARAMS ((rtx
*current_rtx
, void *data
));
161 static int output_addressed_constants
PARAMS ((tree
));
162 static void output_after_function_constants
PARAMS ((void));
163 static unsigned HOST_WIDE_INT array_size_for_constructor
PARAMS ((tree
));
164 static unsigned min_align
PARAMS ((unsigned, unsigned));
165 static void output_constructor
PARAMS ((tree
, int, unsigned));
166 #ifdef ASM_WEAKEN_LABEL
167 static void remove_from_pending_weak_list
PARAMS ((const char *));
169 static int in_named_entry_eq
PARAMS ((const PTR
, const PTR
));
170 static hashval_t in_named_entry_hash
PARAMS ((const PTR
));
171 #ifdef ASM_OUTPUT_BSS
172 static void asm_output_bss
PARAMS ((FILE *, tree
, const char *, int, int));
174 #ifdef BSS_SECTION_ASM_OP
175 #ifdef ASM_OUTPUT_ALIGNED_BSS
176 static void asm_output_aligned_bss
PARAMS ((FILE *, tree
, const char *,
179 #endif /* BSS_SECTION_ASM_OP */
180 static void mark_pool_constant
PARAMS ((struct pool_constant
*));
181 static void mark_const_hash_entry
PARAMS ((void *));
182 static int mark_const_str_htab_1
PARAMS ((void **, void *));
183 static void mark_const_str_htab
PARAMS ((void *));
184 static hashval_t const_str_htab_hash
PARAMS ((const void *x
));
185 static int const_str_htab_eq
PARAMS ((const void *x
, const void *y
));
186 static void const_str_htab_del
PARAMS ((void *));
187 static void asm_emit_uninitialised
PARAMS ((tree
, const char*, int, int));
188 static void resolve_unique_section
PARAMS ((tree
, int));
190 static enum in_section
{ no_section
, in_text
, in_data
, in_named
191 #ifdef BSS_SECTION_ASM_OP
194 #ifdef CTORS_SECTION_ASM_OP
197 #ifdef DTORS_SECTION_ASM_OP
200 #ifdef EXTRA_SECTIONS
203 } in_section
= no_section
;
205 /* Return a non-zero value if DECL has a section attribute. */
206 #ifndef IN_NAMED_SECTION
207 #define IN_NAMED_SECTION(DECL) \
208 ((TREE_CODE (DECL) == FUNCTION_DECL || TREE_CODE (DECL) == VAR_DECL) \
209 && DECL_SECTION_NAME (DECL) != NULL_TREE)
212 /* Text of section name when in_section == in_named. */
213 static const char *in_named_name
;
215 /* Hash table of flags that have been used for a particular named section. */
217 struct in_named_entry
223 static htab_t in_named_htab
;
225 /* Define functions like text_section for any extra sections. */
226 #ifdef EXTRA_SECTION_FUNCTIONS
227 EXTRA_SECTION_FUNCTIONS
230 /* Tell assembler to switch to text section. */
235 if (in_section
!= in_text
)
240 fprintf (asm_out_file
, "%s\n", TEXT_SECTION_ASM_OP
);
242 in_section
= in_text
;
246 /* Tell assembler to switch to data section. */
251 if (in_section
!= in_data
)
253 if (flag_shared_data
)
255 #ifdef SHARED_SECTION_ASM_OP
256 fprintf (asm_out_file
, "%s\n", SHARED_SECTION_ASM_OP
);
258 fprintf (asm_out_file
, "%s\n", DATA_SECTION_ASM_OP
);
262 fprintf (asm_out_file
, "%s\n", DATA_SECTION_ASM_OP
);
264 in_section
= in_data
;
267 /* Tell assembler to ALWAYS switch to data section, in case
268 it's not sure where it is. */
271 force_data_section ()
273 in_section
= no_section
;
277 /* Tell assembler to switch to read-only data section. This is normally
281 readonly_data_section ()
283 #ifdef READONLY_DATA_SECTION
284 READONLY_DATA_SECTION (); /* Note this can call data_section. */
290 /* Determine if we're in the text section. */
295 return in_section
== in_text
;
298 /* Determine if we're in the data section. */
303 return in_section
== in_data
;
306 /* Helper routines for maintaining in_named_htab. */
309 in_named_entry_eq (p1
, p2
)
313 const struct in_named_entry
*old
= p1
;
314 const char *new = p2
;
316 return strcmp (old
->name
, new) == 0;
320 in_named_entry_hash (p
)
323 const struct in_named_entry
*old
= p
;
324 return htab_hash_string (old
->name
);
327 /* If SECTION has been seen before as a named section, return the flags
328 that were used. Otherwise, return 0. Note, that 0 is a perfectly valid
329 set of flags for a section to have, so 0 does not mean that the section
330 has not been seen. */
333 get_named_section_flags (section
)
336 struct in_named_entry
**slot
;
338 slot
= (struct in_named_entry
**)
339 htab_find_slot_with_hash (in_named_htab
, section
,
340 htab_hash_string (section
), NO_INSERT
);
342 return slot
? (*slot
)->flags
: 0;
345 /* Record FLAGS for SECTION. If SECTION was previously recorded with a
346 different set of flags, return false. */
349 set_named_section_flags (section
, flags
)
353 struct in_named_entry
**slot
, *entry
;
355 slot
= (struct in_named_entry
**)
356 htab_find_slot_with_hash (in_named_htab
, section
,
357 htab_hash_string (section
), INSERT
);
362 entry
= (struct in_named_entry
*) xmalloc (sizeof (*entry
));
364 entry
->name
= ggc_strdup (section
);
365 entry
->flags
= flags
;
367 else if (entry
->flags
!= flags
)
373 /* Tell assembler to change to section NAME with attributes FLAGS. */
376 named_section_flags (name
, flags
)
380 if (in_section
!= in_named
|| strcmp (name
, in_named_name
) != 0)
382 if (! set_named_section_flags (name
, flags
))
385 (* targetm
.asm_out
.named_section
) (name
, flags
);
387 if (flags
& SECTION_FORGET
)
388 in_section
= no_section
;
391 in_named_name
= ggc_strdup (name
);
392 in_section
= in_named
;
397 /* Tell assembler to change to section NAME for DECL.
398 If DECL is NULL, just switch to section NAME.
399 If NAME is NULL, get the name from DECL.
400 If RELOC is 1, the initializer for DECL contains relocs. */
403 named_section (decl
, name
, reloc
)
410 if (decl
!= NULL_TREE
&& !DECL_P (decl
))
413 name
= TREE_STRING_POINTER (DECL_SECTION_NAME (decl
));
415 flags
= (* targetm
.section_type_flags
) (decl
, name
, reloc
);
417 /* Sanity check user variables for flag changes. Non-user
418 section flag changes will abort in named_section_flags. */
419 if (decl
&& ! set_named_section_flags (name
, flags
))
421 error_with_decl (decl
, "%s causes a section type conflict");
422 flags
= get_named_section_flags (name
);
425 named_section_flags (name
, flags
);
428 /* If required, set DECL_SECTION_NAME to a unique name. */
431 resolve_unique_section (decl
, reloc
)
433 int reloc ATTRIBUTE_UNUSED
;
435 if (DECL_SECTION_NAME (decl
) == NULL_TREE
436 && (flag_function_sections
437 || (targetm
.have_named_sections
438 && DECL_ONE_ONLY (decl
))))
439 UNIQUE_SECTION (decl
, reloc
);
442 #ifdef BSS_SECTION_ASM_OP
444 /* Tell the assembler to switch to the bss section. */
449 if (in_section
!= in_bss
)
451 #ifdef SHARED_BSS_SECTION_ASM_OP
452 if (flag_shared_data
)
453 fprintf (asm_out_file
, "%s\n", SHARED_BSS_SECTION_ASM_OP
);
456 fprintf (asm_out_file
, "%s\n", BSS_SECTION_ASM_OP
);
462 #ifdef ASM_OUTPUT_BSS
464 /* Utility function for ASM_OUTPUT_BSS for targets to use if
465 they don't support alignments in .bss.
466 ??? It is believed that this function will work in most cases so such
467 support is localized here. */
470 asm_output_bss (file
, decl
, name
, size
, rounded
)
472 tree decl ATTRIBUTE_UNUSED
;
474 int size ATTRIBUTE_UNUSED
, rounded
;
476 ASM_GLOBALIZE_LABEL (file
, name
);
478 #ifdef ASM_DECLARE_OBJECT_NAME
479 last_assemble_variable_decl
= decl
;
480 ASM_DECLARE_OBJECT_NAME (file
, name
, decl
);
482 /* Standard thing is just output label for the object. */
483 ASM_OUTPUT_LABEL (file
, name
);
484 #endif /* ASM_DECLARE_OBJECT_NAME */
485 ASM_OUTPUT_SKIP (file
, rounded
);
490 #ifdef ASM_OUTPUT_ALIGNED_BSS
492 /* Utility function for targets to use in implementing
493 ASM_OUTPUT_ALIGNED_BSS.
494 ??? It is believed that this function will work in most cases so such
495 support is localized here. */
498 asm_output_aligned_bss (file
, decl
, name
, size
, align
)
504 ASM_GLOBALIZE_LABEL (file
, name
);
506 ASM_OUTPUT_ALIGN (file
, floor_log2 (align
/ BITS_PER_UNIT
));
507 #ifdef ASM_DECLARE_OBJECT_NAME
508 last_assemble_variable_decl
= decl
;
509 ASM_DECLARE_OBJECT_NAME (file
, name
, decl
);
511 /* Standard thing is just output label for the object. */
512 ASM_OUTPUT_LABEL (file
, name
);
513 #endif /* ASM_DECLARE_OBJECT_NAME */
514 ASM_OUTPUT_SKIP (file
, size
? size
: 1);
519 #endif /* BSS_SECTION_ASM_OP */
521 /* Switch to the section for function DECL.
523 If DECL is NULL_TREE, switch to the text section.
524 ??? It's not clear that we will ever be passed NULL_TREE, but it's
525 safer to handle it. */
528 function_section (decl
)
531 if (decl
!= NULL_TREE
532 && DECL_SECTION_NAME (decl
) != NULL_TREE
)
533 named_section (decl
, (char *) 0, 0);
538 /* Switch to section for variable DECL.
540 RELOC is the `reloc' argument to SELECT_SECTION. */
543 variable_section (decl
, reloc
)
547 if (IN_NAMED_SECTION (decl
))
548 named_section (decl
, NULL
, reloc
);
551 /* C++ can have const variables that get initialized from constructors,
552 and thus can not be in a readonly section. We prevent this by
553 verifying that the initial value is constant for objects put in a
556 error_mark_node is used by the C front end to indicate that the
557 initializer has not been seen yet. In this case, we assume that
558 the initializer must be constant.
560 C++ uses error_mark_node for variables that have complicated
561 initializers, but these variables go in BSS so we won't be called
564 #ifdef SELECT_SECTION
565 SELECT_SECTION (decl
, reloc
);
567 if (DECL_READONLY_SECTION (decl
, reloc
))
568 readonly_data_section ();
575 /* Tell assembler to switch to the section for the exception handling
581 #if defined (EXCEPTION_SECTION)
582 EXCEPTION_SECTION ();
584 if (targetm
.have_named_sections
)
585 named_section (NULL_TREE
, ".gcc_except_table", 0);
589 readonly_data_section ();
593 /* Given NAME, a putative register name, discard any customary prefixes. */
596 strip_reg_name (name
)
599 #ifdef REGISTER_PREFIX
600 if (!strncmp (name
, REGISTER_PREFIX
, strlen (REGISTER_PREFIX
)))
601 name
+= strlen (REGISTER_PREFIX
);
603 if (name
[0] == '%' || name
[0] == '#')
608 /* Decode an `asm' spec for a declaration as a register name.
609 Return the register number, or -1 if nothing specified,
610 or -2 if the ASMSPEC is not `cc' or `memory' and is not recognized,
611 or -3 if ASMSPEC is `cc' and is not recognized,
612 or -4 if ASMSPEC is `memory' and is not recognized.
613 Accept an exact spelling or a decimal number.
614 Prefixes such as % are optional. */
617 decode_reg_name (asmspec
)
624 /* Get rid of confusing prefixes. */
625 asmspec
= strip_reg_name (asmspec
);
627 /* Allow a decimal number as a "register name". */
628 for (i
= strlen (asmspec
) - 1; i
>= 0; i
--)
629 if (! (asmspec
[i
] >= '0' && asmspec
[i
] <= '9'))
631 if (asmspec
[0] != 0 && i
< 0)
634 if (i
< FIRST_PSEUDO_REGISTER
&& i
>= 0)
640 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
642 && ! strcmp (asmspec
, strip_reg_name (reg_names
[i
])))
645 #ifdef ADDITIONAL_REGISTER_NAMES
647 static struct { const char *name
; int number
; } table
[]
648 = ADDITIONAL_REGISTER_NAMES
;
650 for (i
= 0; i
< (int) ARRAY_SIZE (table
); i
++)
651 if (! strcmp (asmspec
, table
[i
].name
))
652 return table
[i
].number
;
654 #endif /* ADDITIONAL_REGISTER_NAMES */
656 if (!strcmp (asmspec
, "memory"))
659 if (!strcmp (asmspec
, "cc"))
668 /* Create the DECL_RTL for a VAR_DECL or FUNCTION_DECL. DECL should
669 have static storage duration. In other words, it should not be an
670 automatic variable, including PARM_DECLs.
672 There is, however, one exception: this function handles variables
673 explicitly placed in a particular register by the user.
675 ASMSPEC, if not 0, is the string which the user specified as the
676 assembler symbol name.
678 This is never called for PARM_DECL nodes. */
681 make_decl_rtl (decl
, asmspec
)
685 int top_level
= (DECL_CONTEXT (decl
) == NULL_TREE
);
686 const char *name
= 0;
687 const char *new_name
= 0;
691 /* Check that we are not being given an automatic variable. */
692 /* A weak alias has TREE_PUBLIC set but not the other bits. */
693 if (TREE_CODE (decl
) == PARM_DECL
694 || TREE_CODE (decl
) == RESULT_DECL
695 || (TREE_CODE (decl
) == VAR_DECL
696 && !TREE_STATIC (decl
)
697 && !TREE_PUBLIC (decl
)
698 && !DECL_EXTERNAL (decl
)
699 && !DECL_REGISTER (decl
)))
701 /* And that we were not given a type or a label. */
702 else if (TREE_CODE (decl
) == TYPE_DECL
703 || TREE_CODE (decl
) == LABEL_DECL
)
706 /* For a duplicate declaration, we can be called twice on the
707 same DECL node. Don't discard the RTL already made. */
708 if (DECL_RTL_SET_P (decl
))
710 /* If the old RTL had the wrong mode, fix the mode. */
711 if (GET_MODE (DECL_RTL (decl
)) != DECL_MODE (decl
))
713 rtx rtl
= DECL_RTL (decl
);
714 PUT_MODE (rtl
, DECL_MODE (decl
));
717 /* ??? Another way to do this would be to do what halfpic.c does
718 and maintain a hashed table of such critters. */
719 /* ??? Another way to do this would be to pass a flag bit to
720 ENCODE_SECTION_INFO saying whether this is a new decl or not. */
721 /* Let the target reassign the RTL if it wants.
722 This is necessary, for example, when one machine specific
723 decl attribute overrides another. */
724 #ifdef REDO_SECTION_INFO_P
725 if (REDO_SECTION_INFO_P (decl
))
726 ENCODE_SECTION_INFO (decl
);
731 new_name
= name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
733 reg_number
= decode_reg_name (asmspec
);
734 if (reg_number
== -2)
736 /* ASMSPEC is given, and not the name of a register. Mark the
737 name with a star so assemble_name won't munge it. */
738 char *starred
= alloca (strlen (asmspec
) + 2);
740 strcpy (starred
+ 1, asmspec
);
744 if (TREE_CODE (decl
) != FUNCTION_DECL
&& DECL_REGISTER (decl
))
746 /* First detect errors in declaring global registers. */
747 if (reg_number
== -1)
748 error_with_decl (decl
, "register name not specified for `%s'");
749 else if (reg_number
< 0)
750 error_with_decl (decl
, "invalid register name for `%s'");
751 else if (TYPE_MODE (TREE_TYPE (decl
)) == BLKmode
)
752 error_with_decl (decl
,
753 "data type of `%s' isn't suitable for a register");
754 else if (! HARD_REGNO_MODE_OK (reg_number
, TYPE_MODE (TREE_TYPE (decl
))))
755 error_with_decl (decl
,
756 "register specified for `%s' isn't suitable for data type");
757 /* Now handle properly declared static register variables. */
762 if (DECL_INITIAL (decl
) != 0 && TREE_STATIC (decl
))
764 DECL_INITIAL (decl
) = 0;
765 error ("global register variable has initial value");
767 if (TREE_THIS_VOLATILE (decl
))
768 warning ("volatile register variables don't work as you might wish");
770 /* If the user specified one of the eliminables registers here,
771 e.g., FRAME_POINTER_REGNUM, we don't want to get this variable
772 confused with that register and be eliminated. Although this
773 usage is somewhat suspect, we nevertheless use the following
774 kludge to avoid setting DECL_RTL to frame_pointer_rtx. */
777 gen_rtx_REG (DECL_MODE (decl
),
778 FIRST_PSEUDO_REGISTER
));
779 REGNO (DECL_RTL (decl
)) = reg_number
;
780 REG_USERVAR_P (DECL_RTL (decl
)) = 1;
782 if (TREE_STATIC (decl
))
784 /* Make this register global, so not usable for anything
786 #ifdef ASM_DECLARE_REGISTER_GLOBAL
787 ASM_DECLARE_REGISTER_GLOBAL (asm_out_file
, decl
, reg_number
, name
);
789 nregs
= HARD_REGNO_NREGS (reg_number
, DECL_MODE (decl
));
791 globalize_reg (reg_number
+ --nregs
);
794 /* As a register variable, it has no section. */
799 /* Now handle ordinary static variables and functions (in memory).
800 Also handle vars declared register invalidly. */
802 if (reg_number
>= 0 || reg_number
== -3)
803 error_with_decl (decl
,
804 "register name given for non-register variable `%s'");
806 /* Specifying a section attribute on a variable forces it into a
807 non-.bss section, and thus it cannot be common. */
808 if (TREE_CODE (decl
) == VAR_DECL
809 && DECL_SECTION_NAME (decl
) != NULL_TREE
810 && DECL_INITIAL (decl
) == NULL_TREE
811 && DECL_COMMON (decl
))
812 DECL_COMMON (decl
) = 0;
814 /* Can't use just the variable's own name for a variable
815 whose scope is less than the whole file, unless it's a member
816 of a local class (which will already be unambiguous).
817 Concatenate a distinguishing number. */
818 if (!top_level
&& !TREE_PUBLIC (decl
)
819 && ! (DECL_CONTEXT (decl
) && TYPE_P (DECL_CONTEXT (decl
)))
821 && name
== IDENTIFIER_POINTER (DECL_NAME (decl
)))
824 ASM_FORMAT_PRIVATE_NAME (label
, name
, var_labelno
);
829 /* When -fprefix-function-name is used, the functions
830 names are prefixed. Only nested function names are not
832 else if (flag_prefix_function_name
&& TREE_CODE (decl
) == FUNCTION_DECL
)
834 size_t name_len
= IDENTIFIER_LENGTH (DECL_ASSEMBLER_NAME (decl
));
837 pname
= alloca (name_len
+ CHKR_PREFIX_SIZE
+ 1);
838 memcpy (pname
, CHKR_PREFIX
, CHKR_PREFIX_SIZE
);
839 memcpy (pname
+ CHKR_PREFIX_SIZE
, name
, name_len
+ 1);
843 if (name
!= new_name
)
845 SET_DECL_ASSEMBLER_NAME (decl
, get_identifier (new_name
));
846 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
849 /* If this variable is to be treated as volatile, show its
850 tree node has side effects. */
851 if ((flag_volatile_global
&& TREE_CODE (decl
) == VAR_DECL
852 && TREE_PUBLIC (decl
))
853 || ((flag_volatile_static
&& TREE_CODE (decl
) == VAR_DECL
854 && (TREE_PUBLIC (decl
) || TREE_STATIC (decl
)))))
855 TREE_SIDE_EFFECTS (decl
) = 1;
857 x
= gen_rtx_MEM (DECL_MODE (decl
), gen_rtx_SYMBOL_REF (Pmode
, name
));
858 SYMBOL_REF_WEAK (XEXP (x
, 0)) = DECL_WEAK (decl
);
859 if (TREE_CODE (decl
) != FUNCTION_DECL
)
860 set_mem_attributes (x
, decl
, 1);
861 SET_DECL_RTL (decl
, x
);
863 /* Optionally set flags or add text to the name to record information
864 such as that it is a function name.
865 If the name is changed, the macro ASM_OUTPUT_LABELREF
866 will have to know how to strip this information. */
867 #ifdef ENCODE_SECTION_INFO
868 ENCODE_SECTION_INFO (decl
);
872 /* Make the rtl for variable VAR be volatile.
873 Use this only for static variables. */
876 make_var_volatile (var
)
879 if (GET_CODE (DECL_RTL (var
)) != MEM
)
882 MEM_VOLATILE_P (DECL_RTL (var
)) = 1;
885 /* Output alignment directive to align for constant expression EXP. */
888 assemble_constant_align (exp
)
893 /* Align the location counter as required by EXP's data type. */
894 align
= TYPE_ALIGN (TREE_TYPE (exp
));
895 #ifdef CONSTANT_ALIGNMENT
896 align
= CONSTANT_ALIGNMENT (exp
, align
);
899 if (align
> BITS_PER_UNIT
)
900 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
903 /* Output a string of literal assembler code
904 for an `asm' keyword used between functions. */
907 assemble_asm (string
)
912 if (TREE_CODE (string
) == ADDR_EXPR
)
913 string
= TREE_OPERAND (string
, 0);
915 fprintf (asm_out_file
, "\t%s\n", TREE_STRING_POINTER (string
));
918 /* Record an element in the table of global destructors. SYMBOL is
919 a SYMBOL_REF of the function to be called; PRIORITY is a number
920 between 0 and MAX_INIT_PRIORITY. */
923 default_stabs_asm_out_destructor (symbol
, priority
)
925 int priority ATTRIBUTE_UNUSED
;
927 /* Tell GNU LD that this is part of the static destructor set.
928 This will work for any system that uses stabs, most usefully
930 fprintf (asm_out_file
, "%s\"___DTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
931 assemble_name (asm_out_file
, XSTR (symbol
, 0));
932 fputc ('\n', asm_out_file
);
936 default_named_section_asm_out_destructor (symbol
, priority
)
940 const char *section
= ".dtors";
943 /* ??? This only works reliably with the GNU linker. */
944 if (priority
!= DEFAULT_INIT_PRIORITY
)
946 sprintf (buf
, ".dtors.%.5u",
947 /* Invert the numbering so the linker puts us in the proper
948 order; constructors are run from right to left, and the
949 linker sorts in increasing order. */
950 MAX_INIT_PRIORITY
- priority
);
954 named_section_flags (section
, SECTION_WRITE
);
955 assemble_align (POINTER_SIZE
);
956 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
959 #ifdef DTORS_SECTION_ASM_OP
963 if (in_section
!= in_dtors
)
965 in_section
= in_dtors
;
966 fputs (DTORS_SECTION_ASM_OP
, asm_out_file
);
967 fputc ('\n', asm_out_file
);
972 default_dtor_section_asm_out_destructor (symbol
, priority
)
974 int priority ATTRIBUTE_UNUSED
;
977 assemble_align (POINTER_SIZE
);
978 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
982 /* Likewise for global constructors. */
985 default_stabs_asm_out_constructor (symbol
, priority
)
987 int priority ATTRIBUTE_UNUSED
;
989 /* Tell GNU LD that this is part of the static destructor set.
990 This will work for any system that uses stabs, most usefully
992 fprintf (asm_out_file
, "%s\"___CTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
993 assemble_name (asm_out_file
, XSTR (symbol
, 0));
994 fputc ('\n', asm_out_file
);
998 default_named_section_asm_out_constructor (symbol
, priority
)
1002 const char *section
= ".ctors";
1005 /* ??? This only works reliably with the GNU linker. */
1006 if (priority
!= DEFAULT_INIT_PRIORITY
)
1008 sprintf (buf
, ".ctors.%.5u",
1009 /* Invert the numbering so the linker puts us in the proper
1010 order; constructors are run from right to left, and the
1011 linker sorts in increasing order. */
1012 MAX_INIT_PRIORITY
- priority
);
1016 named_section_flags (section
, SECTION_WRITE
);
1017 assemble_align (POINTER_SIZE
);
1018 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1021 #ifdef CTORS_SECTION_ASM_OP
1025 if (in_section
!= in_ctors
)
1027 in_section
= in_ctors
;
1028 fputs (CTORS_SECTION_ASM_OP
, asm_out_file
);
1029 fputc ('\n', asm_out_file
);
1034 default_ctor_section_asm_out_constructor (symbol
, priority
)
1036 int priority ATTRIBUTE_UNUSED
;
1039 assemble_align (POINTER_SIZE
);
1040 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1044 /* CONSTANT_POOL_BEFORE_FUNCTION may be defined as an expression with
1045 a non-zero value if the constant pool should be output before the
1046 start of the function, or a zero value if the pool should output
1047 after the end of the function. The default is to put it before the
1050 #ifndef CONSTANT_POOL_BEFORE_FUNCTION
1051 #define CONSTANT_POOL_BEFORE_FUNCTION 1
1054 /* Output assembler code for the constant pool of a function and associated
1055 with defining the name of the function. DECL describes the function.
1056 NAME is the function's name. For the constant pool, we use the current
1057 constant pool data. */
1060 assemble_start_function (decl
, fnname
)
1066 /* The following code does not need preprocessing in the assembler. */
1070 if (CONSTANT_POOL_BEFORE_FUNCTION
)
1071 output_constant_pool (fnname
, decl
);
1073 resolve_unique_section (decl
, 0);
1074 function_section (decl
);
1076 /* Tell assembler to move to target machine's alignment for functions. */
1077 align
= floor_log2 (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
1079 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1081 /* Handle a user-specified function alignment.
1082 Note that we still need to align to FUNCTION_BOUNDARY, as above,
1083 because ASM_OUTPUT_MAX_SKIP_ALIGN might not do any alignment at all. */
1084 if (align_functions_log
> align
)
1086 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
1087 ASM_OUTPUT_MAX_SKIP_ALIGN (asm_out_file
,
1088 align_functions_log
, align_functions
-1);
1090 ASM_OUTPUT_ALIGN (asm_out_file
, align_functions_log
);
1094 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
1095 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file
, fnname
);
1098 (*debug_hooks
->begin_function
) (decl
);
1100 /* Make function name accessible from other files, if appropriate. */
1102 if (TREE_PUBLIC (decl
))
1104 if (! first_global_object_name
)
1109 STRIP_NAME_ENCODING (p
, fnname
);
1110 name
= permalloc (strlen (p
) + 1);
1113 if (! DECL_WEAK (decl
) && ! DECL_ONE_ONLY (decl
))
1114 first_global_object_name
= name
;
1116 weak_global_object_name
= name
;
1119 #ifdef ASM_WEAKEN_LABEL
1120 if (DECL_WEAK (decl
))
1122 ASM_WEAKEN_LABEL (asm_out_file
, fnname
);
1123 /* Remove this function from the pending weak list so that
1124 we do not emit multiple .weak directives for it. */
1125 remove_from_pending_weak_list
1126 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
1130 ASM_GLOBALIZE_LABEL (asm_out_file
, fnname
);
1133 /* Do any machine/system dependent processing of the function name */
1134 #ifdef ASM_DECLARE_FUNCTION_NAME
1135 ASM_DECLARE_FUNCTION_NAME (asm_out_file
, fnname
, current_function_decl
);
1137 /* Standard thing is just output label for the function. */
1138 ASM_OUTPUT_LABEL (asm_out_file
, fnname
);
1139 #endif /* ASM_DECLARE_FUNCTION_NAME */
1142 /* Output assembler code associated with defining the size of the
1143 function. DECL describes the function. NAME is the function's name. */
1146 assemble_end_function (decl
, fnname
)
1150 #ifdef ASM_DECLARE_FUNCTION_SIZE
1151 ASM_DECLARE_FUNCTION_SIZE (asm_out_file
, fnname
, decl
);
1153 if (! CONSTANT_POOL_BEFORE_FUNCTION
)
1155 output_constant_pool (fnname
, decl
);
1156 function_section (decl
); /* need to switch back */
1159 /* Output any constants which should appear after the function. */
1160 output_after_function_constants ();
1163 /* Assemble code to leave SIZE bytes of zeros. */
1166 assemble_zeros (size
)
1169 /* Do no output if -fsyntax-only. */
1170 if (flag_syntax_only
)
1173 #ifdef ASM_NO_SKIP_IN_TEXT
1174 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
1175 so we must output 0s explicitly in the text section. */
1176 if (ASM_NO_SKIP_IN_TEXT
&& in_text_section ())
1179 for (i
= 0; i
< size
; i
++)
1180 assemble_integer (const0_rtx
, 1, BITS_PER_UNIT
, 1);
1185 ASM_OUTPUT_SKIP (asm_out_file
, size
);
1188 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
1191 assemble_align (align
)
1194 if (align
> BITS_PER_UNIT
)
1195 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
1198 /* Assemble a string constant with the specified C string as contents. */
1201 assemble_string (p
, size
)
1208 /* If the string is very long, split it up. */
1212 int thissize
= size
- pos
;
1213 if (thissize
> maximum
)
1216 ASM_OUTPUT_ASCII (asm_out_file
, p
, thissize
);
1224 #if defined ASM_OUTPUT_ALIGNED_DECL_LOCAL
1225 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1226 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1228 #if defined ASM_OUTPUT_ALIGNED_LOCAL
1229 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1230 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, DECL_ALIGN (decl))
1232 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1233 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded)
1237 #if defined ASM_OUTPUT_ALIGNED_BSS
1238 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1239 ASM_OUTPUT_ALIGNED_BSS (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1241 #if defined ASM_OUTPUT_BSS
1242 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1243 ASM_OUTPUT_BSS (asm_out_file, decl, name, size, rounded)
1249 #if defined ASM_OUTPUT_ALIGNED_DECL_COMMON
1250 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1251 ASM_OUTPUT_ALIGNED_DECL_COMMON (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1253 #if defined ASM_OUTPUT_ALIGNED_COMMON
1254 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1255 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file, name, size, DECL_ALIGN (decl))
1257 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1258 ASM_OUTPUT_COMMON (asm_out_file, name, size, rounded)
1263 asm_emit_uninitialised (decl
, name
, size
, rounded
)
1266 int size ATTRIBUTE_UNUSED
;
1267 int rounded ATTRIBUTE_UNUSED
;
1275 destination
= asm_dest_local
;
1277 if (TREE_PUBLIC (decl
))
1279 #if defined ASM_EMIT_BSS
1280 if (! DECL_COMMON (decl
))
1281 destination
= asm_dest_bss
;
1284 destination
= asm_dest_common
;
1287 if (flag_shared_data
)
1289 switch (destination
)
1291 #ifdef ASM_OUTPUT_SHARED_BSS
1293 ASM_OUTPUT_SHARED_BSS (asm_out_file
, decl
, name
, size
, rounded
);
1296 #ifdef ASM_OUTPUT_SHARED_COMMON
1297 case asm_dest_common
:
1298 ASM_OUTPUT_SHARED_COMMON (asm_out_file
, name
, size
, rounded
);
1301 #ifdef ASM_OUTPUT_SHARED_LOCAL
1302 case asm_dest_local
:
1303 ASM_OUTPUT_SHARED_LOCAL (asm_out_file
, name
, size
, rounded
);
1311 resolve_unique_section (decl
, 0);
1313 switch (destination
)
1317 ASM_EMIT_BSS (decl
, name
, size
, rounded
);
1320 case asm_dest_common
:
1321 ASM_EMIT_COMMON (decl
, name
, size
, rounded
);
1323 case asm_dest_local
:
1324 ASM_EMIT_LOCAL (decl
, name
, size
, rounded
);
1333 /* Assemble everything that is needed for a variable or function declaration.
1334 Not used for automatic variables, and not used for function definitions.
1335 Should not be called for variables of incomplete structure type.
1337 TOP_LEVEL is nonzero if this variable has file scope.
1338 AT_END is nonzero if this is the special handling, at end of compilation,
1339 to define things that have had only tentative definitions.
1340 DONT_OUTPUT_DATA if nonzero means don't actually output the
1341 initial value (that will be done by the caller). */
1344 assemble_variable (decl
, top_level
, at_end
, dont_output_data
)
1346 int top_level ATTRIBUTE_UNUSED
;
1347 int at_end ATTRIBUTE_UNUSED
;
1348 int dont_output_data
;
1350 register const char *name
;
1355 last_assemble_variable_decl
= 0;
1357 /* Normally no need to say anything here for external references,
1358 since assemble_external is called by the language-specific code
1359 when a declaration is first seen. */
1361 if (DECL_EXTERNAL (decl
))
1364 /* Output no assembler code for a function declaration.
1365 Only definitions of functions output anything. */
1367 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1370 /* Do nothing for global register variables. */
1371 if (DECL_RTL_SET_P (decl
) && GET_CODE (DECL_RTL (decl
)) == REG
)
1373 TREE_ASM_WRITTEN (decl
) = 1;
1377 /* If type was incomplete when the variable was declared,
1378 see if it is complete now. */
1380 if (DECL_SIZE (decl
) == 0)
1381 layout_decl (decl
, 0);
1383 /* Still incomplete => don't allocate it; treat the tentative defn
1384 (which is what it must have been) as an `extern' reference. */
1386 if (!dont_output_data
&& DECL_SIZE (decl
) == 0)
1388 error_with_file_and_line (DECL_SOURCE_FILE (decl
),
1389 DECL_SOURCE_LINE (decl
),
1390 "storage size of `%s' isn't known",
1391 IDENTIFIER_POINTER (DECL_NAME (decl
)));
1392 TREE_ASM_WRITTEN (decl
) = 1;
1396 /* The first declaration of a variable that comes through this function
1397 decides whether it is global (in C, has external linkage)
1398 or local (in C, has internal linkage). So do nothing more
1399 if this function has already run. */
1401 if (TREE_ASM_WRITTEN (decl
))
1404 /* Make sure ENCODE_SECTION_INFO is invoked before we set ASM_WRITTEN. */
1405 decl_rtl
= DECL_RTL (decl
);
1407 TREE_ASM_WRITTEN (decl
) = 1;
1409 /* Do no output if -fsyntax-only. */
1410 if (flag_syntax_only
)
1415 if (! dont_output_data
1416 && ! host_integerp (DECL_SIZE_UNIT (decl
), 1))
1418 error_with_decl (decl
, "size of variable `%s' is too large");
1422 name
= XSTR (XEXP (decl_rtl
, 0), 0);
1423 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
)
1424 && ! first_global_object_name
1425 && ! (DECL_COMMON (decl
) && (DECL_INITIAL (decl
) == 0
1426 || DECL_INITIAL (decl
) == error_mark_node
))
1427 && ! DECL_WEAK (decl
)
1428 && ! DECL_ONE_ONLY (decl
))
1433 STRIP_NAME_ENCODING (p
, name
);
1434 xname
= permalloc (strlen (p
) + 1);
1436 first_global_object_name
= xname
;
1439 /* Compute the alignment of this data. */
1441 align
= DECL_ALIGN (decl
);
1443 /* In the case for initialing an array whose length isn't specified,
1444 where we have not yet been able to do the layout,
1445 figure out the proper alignment now. */
1446 if (dont_output_data
&& DECL_SIZE (decl
) == 0
1447 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
)
1448 align
= MAX (align
, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl
))));
1450 /* Some object file formats have a maximum alignment which they support.
1451 In particular, a.out format supports a maximum alignment of 4. */
1452 #ifndef MAX_OFILE_ALIGNMENT
1453 #define MAX_OFILE_ALIGNMENT BIGGEST_ALIGNMENT
1455 if (align
> MAX_OFILE_ALIGNMENT
)
1457 warning_with_decl (decl
,
1458 "alignment of `%s' is greater than maximum object file alignment. Using %d.",
1459 MAX_OFILE_ALIGNMENT
/BITS_PER_UNIT
);
1460 align
= MAX_OFILE_ALIGNMENT
;
1463 /* On some machines, it is good to increase alignment sometimes. */
1464 if (! DECL_USER_ALIGN (decl
))
1466 #ifdef DATA_ALIGNMENT
1467 align
= DATA_ALIGNMENT (TREE_TYPE (decl
), align
);
1469 #ifdef CONSTANT_ALIGNMENT
1470 if (DECL_INITIAL (decl
) != 0 && DECL_INITIAL (decl
) != error_mark_node
)
1471 align
= CONSTANT_ALIGNMENT (DECL_INITIAL (decl
), align
);
1475 /* Reset the alignment in case we have made it tighter, so we can benefit
1476 from it in get_pointer_alignment. */
1477 DECL_ALIGN (decl
) = align
;
1479 /* Handle uninitialized definitions. */
1481 if ((DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
)
1482 /* If the target can't output uninitialized but not common global data
1483 in .bss, then we have to use .data. */
1484 #if ! defined ASM_EMIT_BSS
1485 && DECL_COMMON (decl
)
1487 && DECL_SECTION_NAME (decl
) == NULL_TREE
1488 && ! dont_output_data
)
1490 unsigned HOST_WIDE_INT size
= tree_low_cst (DECL_SIZE_UNIT (decl
), 1);
1491 unsigned HOST_WIDE_INT rounded
= size
;
1493 /* Don't allocate zero bytes of common,
1494 since that means "undefined external" in the linker. */
1498 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1499 so that each uninitialized object starts on such a boundary. */
1500 rounded
+= (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1;
1501 rounded
= (rounded
/ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1502 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1504 /* Don't continue this line--convex cc version 4.1 would lose. */
1505 #if !defined(ASM_OUTPUT_ALIGNED_COMMON) && !defined(ASM_OUTPUT_ALIGNED_DECL_COMMON) && !defined(ASM_OUTPUT_ALIGNED_BSS)
1506 if ((unsigned HOST_WIDE_INT
) DECL_ALIGN (decl
) / BITS_PER_UNIT
> rounded
)
1508 (decl
, "requested alignment for %s is greater than implemented alignment of %d.",rounded
);
1511 asm_emit_uninitialised (decl
, name
, size
, rounded
);
1516 /* Handle initialized definitions.
1517 Also handle uninitialized global definitions if -fno-common and the
1518 target doesn't support ASM_OUTPUT_BSS. */
1520 /* First make the assembler name(s) global if appropriate. */
1521 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
))
1523 #ifdef ASM_WEAKEN_LABEL
1524 if (DECL_WEAK (decl
))
1526 ASM_WEAKEN_LABEL (asm_out_file
, name
);
1527 /* Remove this variable from the pending weak list so that
1528 we do not emit multiple .weak directives for it. */
1529 remove_from_pending_weak_list
1530 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
1534 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
1537 /* Output any data that we will need to use the address of. */
1538 if (DECL_INITIAL (decl
) == error_mark_node
)
1539 reloc
= contains_pointers_p (TREE_TYPE (decl
));
1540 else if (DECL_INITIAL (decl
))
1541 reloc
= output_addressed_constants (DECL_INITIAL (decl
));
1543 /* Switch to the appropriate section. */
1544 resolve_unique_section (decl
, reloc
);
1545 variable_section (decl
, reloc
);
1547 /* dbxout.c needs to know this. */
1548 if (in_text_section ())
1549 DECL_IN_TEXT_SECTION (decl
) = 1;
1551 /* Output the alignment of this data. */
1552 if (align
> BITS_PER_UNIT
)
1553 ASM_OUTPUT_ALIGN (asm_out_file
,
1554 floor_log2 (DECL_ALIGN (decl
) / BITS_PER_UNIT
));
1556 /* Do any machine/system dependent processing of the object. */
1557 #ifdef ASM_DECLARE_OBJECT_NAME
1558 last_assemble_variable_decl
= decl
;
1559 ASM_DECLARE_OBJECT_NAME (asm_out_file
, name
, decl
);
1561 /* Standard thing is just output label for the object. */
1562 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1563 #endif /* ASM_DECLARE_OBJECT_NAME */
1565 if (!dont_output_data
)
1567 if (DECL_INITIAL (decl
))
1568 /* Output the actual data. */
1569 output_constant (DECL_INITIAL (decl
),
1570 tree_low_cst (DECL_SIZE_UNIT (decl
), 1),
1573 /* Leave space for it. */
1574 assemble_zeros (tree_low_cst (DECL_SIZE_UNIT (decl
), 1));
1578 /* Return 1 if type TYPE contains any pointers. */
1581 contains_pointers_p (type
)
1584 switch (TREE_CODE (type
))
1587 case REFERENCE_TYPE
:
1588 /* I'm not sure whether OFFSET_TYPE needs this treatment,
1589 so I'll play safe and return 1. */
1595 case QUAL_UNION_TYPE
:
1598 /* For a type that has fields, see if the fields have pointers. */
1599 for (fields
= TYPE_FIELDS (type
); fields
; fields
= TREE_CHAIN (fields
))
1600 if (TREE_CODE (fields
) == FIELD_DECL
1601 && contains_pointers_p (TREE_TYPE (fields
)))
1607 /* An array type contains pointers if its element type does. */
1608 return contains_pointers_p (TREE_TYPE (type
));
1615 /* Output something to declare an external symbol to the assembler.
1616 (Most assemblers don't need this, so we normally output nothing.)
1617 Do nothing if DECL is not external. */
1620 assemble_external (decl
)
1621 tree decl ATTRIBUTE_UNUSED
;
1623 /* Because most platforms do not define ASM_OUTPUT_EXTERNAL, the
1624 main body of this code is only rarely exercised. To provide some
1625 testing, on all platforms, we make sure that the ASM_OUT_FILE is
1626 open. If it's not, we should not be calling this function. */
1630 #ifdef ASM_OUTPUT_EXTERNAL
1631 if (DECL_P (decl
) && DECL_EXTERNAL (decl
) && TREE_PUBLIC (decl
))
1633 rtx rtl
= DECL_RTL (decl
);
1635 if (GET_CODE (rtl
) == MEM
&& GET_CODE (XEXP (rtl
, 0)) == SYMBOL_REF
1636 && ! SYMBOL_REF_USED (XEXP (rtl
, 0)))
1638 /* Some systems do require some output. */
1639 SYMBOL_REF_USED (XEXP (rtl
, 0)) = 1;
1640 ASM_OUTPUT_EXTERNAL (asm_out_file
, decl
, XSTR (XEXP (rtl
, 0), 0));
1646 /* Similar, for calling a library function FUN. */
1649 assemble_external_libcall (fun
)
1650 rtx fun ATTRIBUTE_UNUSED
;
1652 #ifdef ASM_OUTPUT_EXTERNAL_LIBCALL
1653 /* Declare library function name external when first used, if nec. */
1654 if (! SYMBOL_REF_USED (fun
))
1656 SYMBOL_REF_USED (fun
) = 1;
1657 ASM_OUTPUT_EXTERNAL_LIBCALL (asm_out_file
, fun
);
1662 /* Declare the label NAME global. */
1665 assemble_global (name
)
1668 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
1671 /* Assemble a label named NAME. */
1674 assemble_label (name
)
1677 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1680 /* Output to FILE a reference to the assembler name of a C-level name NAME.
1681 If NAME starts with a *, the rest of NAME is output verbatim.
1682 Otherwise NAME is transformed in an implementation-defined way
1683 (usually by the addition of an underscore).
1684 Many macros in the tm file are defined to call this function. */
1687 assemble_name (file
, name
)
1691 const char *real_name
;
1694 STRIP_NAME_ENCODING (real_name
, name
);
1695 if (flag_prefix_function_name
1696 && ! memcmp (real_name
, CHKR_PREFIX
, CHKR_PREFIX_SIZE
))
1697 real_name
= real_name
+ CHKR_PREFIX_SIZE
;
1699 id
= maybe_get_identifier (real_name
);
1701 TREE_SYMBOL_REFERENCED (id
) = 1;
1704 fputs (&name
[1], file
);
1706 ASM_OUTPUT_LABELREF (file
, name
);
1709 /* Allocate SIZE bytes writable static space with a gensym name
1710 and return an RTX to refer to its address. */
1713 assemble_static_space (size
)
1717 const char *namestring
;
1721 if (flag_shared_data
)
1725 ASM_GENERATE_INTERNAL_LABEL (name
, "LF", const_labelno
);
1727 namestring
= ggc_strdup (name
);
1729 x
= gen_rtx_SYMBOL_REF (Pmode
, namestring
);
1731 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
1732 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file
, NULL_TREE
, name
, size
,
1735 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1736 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file
, name
, size
, BIGGEST_ALIGNMENT
);
1739 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1740 so that each uninitialized object starts on such a boundary. */
1741 /* Variable `rounded' might or might not be used in ASM_OUTPUT_LOCAL. */
1742 int rounded ATTRIBUTE_UNUSED
1743 = ((size
+ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1)
1744 / (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1745 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1746 ASM_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
1753 /* Assemble the static constant template for function entry trampolines.
1754 This is done at most once per compilation.
1755 Returns an RTX for the address of the template. */
1757 #ifdef TRAMPOLINE_TEMPLATE
1759 assemble_trampoline_template ()
1765 /* By default, put trampoline templates in read-only data section. */
1767 #ifdef TRAMPOLINE_SECTION
1768 TRAMPOLINE_SECTION ();
1770 readonly_data_section ();
1773 /* Write the assembler code to define one. */
1774 align
= floor_log2 (TRAMPOLINE_ALIGNMENT
/ BITS_PER_UNIT
);
1776 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1778 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LTRAMP", 0);
1779 TRAMPOLINE_TEMPLATE (asm_out_file
);
1781 /* Record the rtl to refer to it. */
1782 ASM_GENERATE_INTERNAL_LABEL (label
, "LTRAMP", 0);
1783 name
= ggc_strdup (label
);
1784 return gen_rtx_SYMBOL_REF (Pmode
, name
);
1788 /* A and B are either alignments or offsets. Return the minimum alignment
1789 that may be assumed after adding the two together. */
1791 static inline unsigned
1795 return (a
| b
) & -(a
| b
);
1798 /* Assemble the integer constant X into an object of SIZE bytes. ALIGN is
1799 the alignment of the integer in bits. Return 1 if we were able to output
1800 the constant, otherwise 0. If FORCE is non-zero, abort if we can't output
1804 assemble_integer (x
, size
, align
, force
)
1810 /* First try to use the standard 1, 2, 4, 8, and 16 byte
1811 ASM_OUTPUT... macros. */
1813 if (align
>= size
* BITS_PER_UNIT
)
1816 #ifdef ASM_OUTPUT_CHAR
1818 ASM_OUTPUT_CHAR (asm_out_file
, x
);
1821 #ifdef ASM_OUTPUT_SHORT
1823 ASM_OUTPUT_SHORT (asm_out_file
, x
);
1826 #ifdef ASM_OUTPUT_INT
1828 ASM_OUTPUT_INT (asm_out_file
, x
);
1831 #ifdef ASM_OUTPUT_DOUBLE_INT
1833 ASM_OUTPUT_DOUBLE_INT (asm_out_file
, x
);
1836 #ifdef ASM_OUTPUT_QUADRUPLE_INT
1838 ASM_OUTPUT_QUADRUPLE_INT (asm_out_file
, x
);
1844 const char *asm_op
= NULL
;
1846 /* ??? This isn't quite as flexible as the ASM_OUTPUT_INT type hooks.
1847 At present powerpc-eabi can't jump -mrelocatable hoops, so you can
1848 get assembler errors from symbolic references in packed structs. */
1851 #ifdef UNALIGNED_SHORT_ASM_OP
1853 asm_op
= UNALIGNED_SHORT_ASM_OP
;
1856 #ifdef UNALIGNED_INT_ASM_OP
1858 asm_op
= UNALIGNED_INT_ASM_OP
;
1861 #ifdef UNALIGNED_DOUBLE_INT_ASM_OP
1863 asm_op
= UNALIGNED_DOUBLE_INT_ASM_OP
;
1870 fputs (asm_op
, asm_out_file
);
1871 output_addr_const (asm_out_file
, x
);
1872 fputc ('\n', asm_out_file
);
1877 /* If we couldn't do it that way, there are two other possibilities: First,
1878 if the machine can output an explicit byte and this is a 1 byte constant,
1879 we can use ASM_OUTPUT_BYTE. */
1881 #ifdef ASM_OUTPUT_BYTE
1882 if (size
== 1 && GET_CODE (x
) == CONST_INT
)
1884 ASM_OUTPUT_BYTE (asm_out_file
, INTVAL (x
));
1889 /* If SIZE is larger than a single word, try to output the constant
1890 one word at a time. */
1892 if (size
> UNITS_PER_WORD
)
1894 enum machine_mode mode
1895 = mode_for_size (size
* BITS_PER_UNIT
, MODE_INT
, 0);
1896 unsigned align2
= min_align (align
, BITS_PER_WORD
);
1899 for (i
= 0; i
< size
/ UNITS_PER_WORD
; i
++)
1901 rtx word
= operand_subword (x
, i
, 0, mode
);
1904 if (! assemble_integer (word
, UNITS_PER_WORD
, align2
, 0))
1908 if (i
== size
/ UNITS_PER_WORD
)
1910 /* If we output at least one word and then could not finish,
1911 there is no valid way to continue. */
1916 /* If unaligned, and this is a constant, emit it one byte at a time. */
1917 if (align
< size
* BITS_PER_UNIT
)
1919 enum machine_mode omode
, imode
;
1922 omode
= mode_for_size (BITS_PER_UNIT
, MODE_INT
, 0);
1923 imode
= mode_for_size (size
* BITS_PER_UNIT
, MODE_INT
, 0);
1925 for (i
= 0; i
< size
; i
++)
1927 rtx byte
= simplify_subreg (omode
, x
, imode
, i
);
1930 if (! assemble_integer (byte
, 1, BITS_PER_UNIT
, 0))
1936 /* If we output at least one byte and then could not finish,
1937 there is no valid way to continue. */
1948 /* Assemble the floating-point constant D into an object of size MODE. */
1949 struct assemble_real_args
1952 enum machine_mode mode
;
1959 struct assemble_real_args
*args
= (struct assemble_real_args
*) p
;
1960 REAL_VALUE_TYPE
*d
= args
->d
;
1961 enum machine_mode mode
= args
->mode
;
1965 #ifdef ASM_OUTPUT_BYTE_FLOAT
1967 ASM_OUTPUT_BYTE_FLOAT (asm_out_file
, *d
);
1970 #ifdef ASM_OUTPUT_SHORT_FLOAT
1972 ASM_OUTPUT_SHORT_FLOAT (asm_out_file
, *d
);
1975 #ifdef ASM_OUTPUT_THREE_QUARTER_FLOAT
1977 ASM_OUTPUT_THREE_QUARTER_FLOAT (asm_out_file
, *d
);
1980 #ifdef ASM_OUTPUT_FLOAT
1982 ASM_OUTPUT_FLOAT (asm_out_file
, *d
);
1986 #ifdef ASM_OUTPUT_DOUBLE
1988 ASM_OUTPUT_DOUBLE (asm_out_file
, *d
);
1992 #ifdef ASM_OUTPUT_LONG_DOUBLE
1995 ASM_OUTPUT_LONG_DOUBLE (asm_out_file
, *d
);
2005 assemble_real (d
, mode
, align
)
2007 enum machine_mode mode
;
2010 struct assemble_real_args args
;
2014 /* We cannot emit unaligned floating point constants. This is slightly
2015 complicated in that we don't know what "unaligned" means exactly. */
2016 #ifdef BIGGEST_FIELD_ALIGNMENT
2017 if (align
>= BIGGEST_FIELD_ALIGNMENT
)
2021 if (align
< GET_MODE_ALIGNMENT (mode
))
2024 if (do_float_handler (assemble_real_1
, (PTR
) &args
))
2027 internal_error ("floating point trap outputting a constant");
2030 /* Here we combine duplicate floating constants to make
2031 CONST_DOUBLE rtx's, and force those out to memory when necessary. */
2033 /* Return a CONST_DOUBLE or CONST_INT for a value specified as a pair of ints.
2034 For an integer, I0 is the low-order word and I1 is the high-order word.
2035 For a real number, I0 is the word with the low address
2036 and I1 is the word with the high address. */
2039 immed_double_const (i0
, i1
, mode
)
2040 HOST_WIDE_INT i0
, i1
;
2041 enum machine_mode mode
;
2045 if (GET_MODE_CLASS (mode
) == MODE_INT
2046 || GET_MODE_CLASS (mode
) == MODE_PARTIAL_INT
)
2048 /* We clear out all bits that don't belong in MODE, unless they and our
2049 sign bit are all one. So we get either a reasonable negative value
2050 or a reasonable unsigned value for this mode. */
2051 int width
= GET_MODE_BITSIZE (mode
);
2052 if (width
< HOST_BITS_PER_WIDE_INT
2053 && ((i0
& ((HOST_WIDE_INT
) (-1) << (width
- 1)))
2054 != ((HOST_WIDE_INT
) (-1) << (width
- 1))))
2055 i0
&= ((HOST_WIDE_INT
) 1 << width
) - 1, i1
= 0;
2056 else if (width
== HOST_BITS_PER_WIDE_INT
2057 && ! (i1
== ~0 && i0
< 0))
2059 else if (width
> 2 * HOST_BITS_PER_WIDE_INT
)
2060 /* We cannot represent this value as a constant. */
2063 /* If this would be an entire word for the target, but is not for
2064 the host, then sign-extend on the host so that the number will look
2065 the same way on the host that it would on the target.
2067 For example, when building a 64 bit alpha hosted 32 bit sparc
2068 targeted compiler, then we want the 32 bit unsigned value -1 to be
2069 represented as a 64 bit value -1, and not as 0x00000000ffffffff.
2070 The later confuses the sparc backend. */
2072 if (width
< HOST_BITS_PER_WIDE_INT
2073 && (i0
& ((HOST_WIDE_INT
) 1 << (width
- 1))))
2074 i0
|= ((HOST_WIDE_INT
) (-1) << width
);
2076 /* If MODE fits within HOST_BITS_PER_WIDE_INT, always use a CONST_INT.
2078 ??? Strictly speaking, this is wrong if we create a CONST_INT
2079 for a large unsigned constant with the size of MODE being
2080 HOST_BITS_PER_WIDE_INT and later try to interpret that constant in a
2081 wider mode. In that case we will mis-interpret it as a negative
2084 Unfortunately, the only alternative is to make a CONST_DOUBLE
2085 for any constant in any mode if it is an unsigned constant larger
2086 than the maximum signed integer in an int on the host. However,
2087 doing this will break everyone that always expects to see a CONST_INT
2088 for SImode and smaller.
2090 We have always been making CONST_INTs in this case, so nothing new
2093 if (width
<= HOST_BITS_PER_WIDE_INT
)
2094 i1
= (i0
< 0) ? ~(HOST_WIDE_INT
) 0 : 0;
2096 /* If this integer fits in one word, return a CONST_INT. */
2097 if ((i1
== 0 && i0
>= 0)
2098 || (i1
== ~0 && i0
< 0))
2099 return GEN_INT (i0
);
2101 /* We use VOIDmode for integers. */
2105 /* Search the chain for an existing CONST_DOUBLE with the right value.
2106 If one is found, return it. */
2108 for (r
= const_double_chain
; r
; r
= CONST_DOUBLE_CHAIN (r
))
2109 if (CONST_DOUBLE_LOW (r
) == i0
&& CONST_DOUBLE_HIGH (r
) == i1
2110 && GET_MODE (r
) == mode
)
2113 /* No; make a new one and add it to the chain. */
2114 r
= gen_rtx_CONST_DOUBLE (mode
, const0_rtx
, i0
, i1
);
2116 /* Don't touch const_double_chain if not inside any function. */
2117 if (current_function_decl
!= 0)
2119 CONST_DOUBLE_CHAIN (r
) = const_double_chain
;
2120 const_double_chain
= r
;
2126 /* Return a CONST_DOUBLE for a specified `double' value
2127 and machine mode. */
2130 immed_real_const_1 (d
, mode
)
2132 enum machine_mode mode
;
2134 union real_extract u
;
2137 /* Get the desired `double' value as a sequence of ints
2138 since that is how they are stored in a CONST_DOUBLE. */
2142 /* Detect special cases. */
2143 if (REAL_VALUES_IDENTICAL (dconst0
, d
))
2144 return CONST0_RTX (mode
);
2146 /* Check for NaN first, because some ports (specifically the i386) do not
2147 emit correct ieee-fp code by default, and thus will generate a core
2148 dump here if we pass a NaN to REAL_VALUES_EQUAL and if REAL_VALUES_EQUAL
2149 does a floating point comparison. */
2150 else if (! REAL_VALUE_ISNAN (d
) && REAL_VALUES_EQUAL (dconst1
, d
))
2151 return CONST1_RTX (mode
);
2153 if (sizeof u
== sizeof (HOST_WIDE_INT
))
2154 return immed_double_const (u
.i
[0], 0, mode
);
2155 if (sizeof u
== 2 * sizeof (HOST_WIDE_INT
))
2156 return immed_double_const (u
.i
[0], u
.i
[1], mode
);
2158 /* The rest of this function handles the case where
2159 a float value requires more than 2 ints of space.
2160 It will be deleted as dead code on machines that don't need it. */
2162 /* Search the chain for an existing CONST_DOUBLE with the right value.
2163 If one is found, return it. */
2165 for (r
= const_double_chain
; r
; r
= CONST_DOUBLE_CHAIN (r
))
2166 if (! memcmp ((char *) &CONST_DOUBLE_LOW (r
), (char *) &u
, sizeof u
)
2167 && GET_MODE (r
) == mode
)
2170 /* No; make a new one and add it to the chain.
2172 We may be called by an optimizer which may be discarding any memory
2173 allocated during its processing (such as combine and loop). However,
2174 we will be leaving this constant on the chain, so we cannot tolerate
2176 r
= rtx_alloc (CONST_DOUBLE
);
2178 memcpy ((char *) &CONST_DOUBLE_LOW (r
), (char *) &u
, sizeof u
);
2180 /* If we aren't inside a function, don't put r on the
2181 const_double_chain. */
2182 if (current_function_decl
!= 0)
2184 CONST_DOUBLE_CHAIN (r
) = const_double_chain
;
2185 const_double_chain
= r
;
2188 CONST_DOUBLE_CHAIN (r
) = NULL_RTX
;
2190 /* Store const0_rtx in CONST_DOUBLE_MEM since this CONST_DOUBLE is on the
2191 chain, but has not been allocated memory. Actual use of CONST_DOUBLE_MEM
2192 is only through force_const_mem. */
2194 CONST_DOUBLE_MEM (r
) = const0_rtx
;
2199 /* Return a CONST_DOUBLE rtx for a value specified by EXP,
2200 which must be a REAL_CST tree node. */
2203 immed_real_const (exp
)
2206 return immed_real_const_1 (TREE_REAL_CST (exp
), TYPE_MODE (TREE_TYPE (exp
)));
2209 /* At the end of a function, forget the memory-constants
2210 previously made for CONST_DOUBLEs. Mark them as not on real_constant_chain.
2211 Also clear out real_constant_chain and clear out all the chain-pointers. */
2214 clear_const_double_mem ()
2216 register rtx r
, next
;
2217 enum machine_mode mode
;
2220 for (r
= const_double_chain
; r
; r
= next
)
2222 next
= CONST_DOUBLE_CHAIN (r
);
2223 CONST_DOUBLE_CHAIN (r
) = 0;
2224 CONST_DOUBLE_MEM (r
) = cc0_rtx
;
2226 const_double_chain
= 0;
2228 for (i
= 0; i
<= 2; i
++)
2229 for (mode
= GET_CLASS_NARROWEST_MODE (MODE_FLOAT
); mode
!= VOIDmode
;
2230 mode
= GET_MODE_WIDER_MODE (mode
))
2232 r
= const_tiny_rtx
[i
][(int) mode
];
2233 CONST_DOUBLE_CHAIN (r
) = 0;
2234 CONST_DOUBLE_MEM (r
) = cc0_rtx
;
2238 /* Given an expression EXP with a constant value,
2239 reduce it to the sum of an assembler symbol and an integer.
2240 Store them both in the structure *VALUE.
2241 Abort if EXP does not reduce. */
2246 HOST_WIDE_INT offset
;
2250 decode_addr_const (exp
, value
)
2252 struct addr_const
*value
;
2254 register tree target
= TREE_OPERAND (exp
, 0);
2255 register int offset
= 0;
2260 if (TREE_CODE (target
) == COMPONENT_REF
2261 && host_integerp (byte_position (TREE_OPERAND (target
, 1)), 0))
2264 offset
+= int_byte_position (TREE_OPERAND (target
, 1));
2265 target
= TREE_OPERAND (target
, 0);
2267 else if (TREE_CODE (target
) == ARRAY_REF
2268 || TREE_CODE (target
) == ARRAY_RANGE_REF
)
2270 offset
+= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (target
)), 1)
2271 * tree_low_cst (TREE_OPERAND (target
, 1), 0));
2272 target
= TREE_OPERAND (target
, 0);
2278 switch (TREE_CODE (target
))
2282 x
= DECL_RTL (target
);
2286 x
= gen_rtx_MEM (FUNCTION_MODE
,
2287 gen_rtx_LABEL_REF (VOIDmode
,
2288 label_rtx (TREE_OPERAND (exp
, 0))));
2296 x
= TREE_CST_RTL (target
);
2303 if (GET_CODE (x
) != MEM
)
2308 value
->offset
= offset
;
2311 enum kind
{ RTX_DOUBLE
, RTX_INT
};
2314 ENUM_BITFIELD(kind
) kind
: 16;
2315 ENUM_BITFIELD(machine_mode
) mode
: 16;
2317 union real_extract du
;
2318 struct addr_const addr
;
2319 struct {HOST_WIDE_INT high
, low
;} di
;
2323 /* Uniquize all constants that appear in memory.
2324 Each constant in memory thus far output is recorded
2325 in `const_hash_table' with a `struct constant_descriptor'
2326 that contains a polish representation of the value of
2329 We cannot store the trees in the hash table
2330 because the trees may be temporary. */
2332 struct constant_descriptor
2334 struct constant_descriptor
*next
;
2337 /* Make sure the data is reasonably aligned. */
2340 unsigned char contents
[1];
2341 #ifdef HAVE_LONG_DOUBLE
2350 #define MAX_HASH_TABLE 1009
2351 static struct constant_descriptor
*const_hash_table
[MAX_HASH_TABLE
];
2353 #define STRHASH(x) ((hashval_t)((long)(x) >> 3))
2355 struct deferred_string
2362 static htab_t const_str_htab
;
2364 /* Mark a const_hash_table descriptor for GC. */
2367 mark_const_hash_entry (ptr
)
2370 struct constant_descriptor
*desc
= * (struct constant_descriptor
**) ptr
;
2374 ggc_mark_rtx (desc
->rtl
);
2379 /* Mark the hash-table element X (which is really a pointer to an
2380 struct deferred_string *). */
2383 mark_const_str_htab_1 (x
, data
)
2385 void *data ATTRIBUTE_UNUSED
;
2387 ggc_mark_tree (((struct deferred_string
*) *x
)->exp
);
2391 /* Mark a const_str_htab for GC. */
2394 mark_const_str_htab (htab
)
2397 htab_traverse (*((htab_t
*) htab
), mark_const_str_htab_1
, NULL
);
2400 /* Returns a hash code for X (which is a really a
2401 struct deferred_string *). */
2404 const_str_htab_hash (x
)
2407 return STRHASH (((const struct deferred_string
*) x
)->label
);
2410 /* Returns non-zero if the value represented by X (which is really a
2411 struct deferred_string *) is the same as that given by Y
2412 (which is really a char *). */
2415 const_str_htab_eq (x
, y
)
2419 return (((const struct deferred_string
*) x
)->label
== (const char *) y
);
2422 /* Delete the hash table entry dfsp. */
2425 const_str_htab_del (dfsp
)
2431 /* Compute a hash code for a constant expression. */
2437 register const char *p
;
2438 register int len
, hi
, i
;
2439 register enum tree_code code
= TREE_CODE (exp
);
2441 /* Either set P and LEN to the address and len of something to hash and
2442 exit the switch or return a value. */
2447 p
= (char *) &TREE_INT_CST (exp
);
2448 len
= sizeof TREE_INT_CST (exp
);
2452 p
= (char *) &TREE_REAL_CST (exp
);
2453 len
= sizeof TREE_REAL_CST (exp
);
2457 p
= TREE_STRING_POINTER (exp
);
2458 len
= TREE_STRING_LENGTH (exp
);
2462 return (const_hash (TREE_REALPART (exp
)) * 5
2463 + const_hash (TREE_IMAGPART (exp
)));
2466 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2470 len
= int_size_in_bytes (TREE_TYPE (exp
));
2471 tmp
= (char *) alloca (len
);
2472 get_set_constructor_bytes (exp
, (unsigned char *) tmp
, len
);
2480 /* For record type, include the type in the hashing.
2481 We do not do so for array types
2482 because (1) the sizes of the elements are sufficient
2483 and (2) distinct array types can have the same constructor.
2484 Instead, we include the array size because the constructor could
2486 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2487 hi
= ((unsigned long) TREE_TYPE (exp
) & ((1 << HASHBITS
) - 1))
2490 hi
= ((5 + int_size_in_bytes (TREE_TYPE (exp
)))
2491 & ((1 << HASHBITS
) - 1)) % MAX_HASH_TABLE
;
2493 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2494 if (TREE_VALUE (link
))
2496 = (hi
* 603 + const_hash (TREE_VALUE (link
))) % MAX_HASH_TABLE
;
2503 struct addr_const value
;
2505 decode_addr_const (exp
, &value
);
2506 if (GET_CODE (value
.base
) == SYMBOL_REF
)
2508 /* Don't hash the address of the SYMBOL_REF;
2509 only use the offset and the symbol name. */
2511 p
= XSTR (value
.base
, 0);
2512 for (i
= 0; p
[i
] != 0; i
++)
2513 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2515 else if (GET_CODE (value
.base
) == LABEL_REF
)
2516 hi
= value
.offset
+ CODE_LABEL_NUMBER (XEXP (value
.base
, 0)) * 13;
2520 hi
&= (1 << HASHBITS
) - 1;
2521 hi
%= MAX_HASH_TABLE
;
2527 return (const_hash (TREE_OPERAND (exp
, 0)) * 9
2528 + const_hash (TREE_OPERAND (exp
, 1)));
2532 case NON_LVALUE_EXPR
:
2533 return const_hash (TREE_OPERAND (exp
, 0)) * 7 + 2;
2536 /* A language specific constant. Just hash the code. */
2537 return (int) code
% MAX_HASH_TABLE
;
2540 /* Compute hashing function */
2542 for (i
= 0; i
< len
; i
++)
2543 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2545 hi
&= (1 << HASHBITS
) - 1;
2546 hi
%= MAX_HASH_TABLE
;
2550 /* Compare a constant expression EXP with a constant-descriptor DESC.
2551 Return 1 if DESC describes a constant with the same value as EXP. */
2554 compare_constant (exp
, desc
)
2556 struct constant_descriptor
*desc
;
2558 return 0 != compare_constant_1 (exp
, desc
->u
.contents
);
2561 /* Compare constant expression EXP with a substring P of a constant descriptor.
2562 If they match, return a pointer to the end of the substring matched.
2563 If they do not match, return 0.
2565 Since descriptors are written in polish prefix notation,
2566 this function can be used recursively to test one operand of EXP
2567 against a subdescriptor, and if it succeeds it returns the
2568 address of the subdescriptor for the next operand. */
2570 static const unsigned char *
2571 compare_constant_1 (exp
, p
)
2573 const unsigned char *p
;
2575 register const unsigned char *strp
;
2577 register enum tree_code code
= TREE_CODE (exp
);
2579 if (code
!= (enum tree_code
) *p
++)
2582 /* Either set STRP, P and LEN to pointers and length to compare and exit the
2583 switch, or return the result of the comparison. */
2588 /* Integer constants are the same only if the same width of type. */
2589 if (*p
++ != TYPE_PRECISION (TREE_TYPE (exp
)))
2592 strp
= (unsigned char *) &TREE_INT_CST (exp
);
2593 len
= sizeof TREE_INT_CST (exp
);
2597 /* Real constants are the same only if the same width of type. */
2598 if (*p
++ != TYPE_PRECISION (TREE_TYPE (exp
)))
2601 strp
= (unsigned char *) &TREE_REAL_CST (exp
);
2602 len
= sizeof TREE_REAL_CST (exp
);
2606 if (flag_writable_strings
)
2609 if ((enum machine_mode
) *p
++ != TYPE_MODE (TREE_TYPE (exp
)))
2612 strp
= (const unsigned char *)TREE_STRING_POINTER (exp
);
2613 len
= TREE_STRING_LENGTH (exp
);
2614 if (memcmp ((char *) &TREE_STRING_LENGTH (exp
), p
,
2615 sizeof TREE_STRING_LENGTH (exp
)))
2618 p
+= sizeof TREE_STRING_LENGTH (exp
);
2622 p
= compare_constant_1 (TREE_REALPART (exp
), p
);
2626 return compare_constant_1 (TREE_IMAGPART (exp
), p
);
2629 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2631 int xlen
= len
= int_size_in_bytes (TREE_TYPE (exp
));
2632 unsigned char *tmp
= (unsigned char *) alloca (len
);
2634 get_set_constructor_bytes (exp
, tmp
, len
);
2635 strp
= (unsigned char *) tmp
;
2636 if (memcmp ((char *) &xlen
, p
, sizeof xlen
))
2645 int length
= list_length (CONSTRUCTOR_ELTS (exp
));
2647 enum machine_mode mode
= TYPE_MODE (TREE_TYPE (exp
));
2648 int have_purpose
= 0;
2650 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2651 if (TREE_PURPOSE (link
))
2654 if (memcmp ((char *) &length
, p
, sizeof length
))
2659 /* For record constructors, insist that the types match.
2660 For arrays, just verify both constructors are for arrays.
2661 Then insist that either both or none have any TREE_PURPOSE
2663 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2664 type
= TREE_TYPE (exp
);
2668 if (memcmp ((char *) &type
, p
, sizeof type
))
2671 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2673 if (memcmp ((char *) &mode
, p
, sizeof mode
))
2681 if (memcmp ((char *) &have_purpose
, p
, sizeof have_purpose
))
2684 p
+= sizeof have_purpose
;
2686 /* For arrays, insist that the size in bytes match. */
2687 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2689 HOST_WIDE_INT size
= int_size_in_bytes (TREE_TYPE (exp
));
2691 if (memcmp ((char *) &size
, p
, sizeof size
))
2697 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2699 if (TREE_VALUE (link
))
2701 if ((p
= compare_constant_1 (TREE_VALUE (link
), p
)) == 0)
2708 if (memcmp ((char *) &zero
, p
, sizeof zero
))
2714 if (TREE_PURPOSE (link
)
2715 && TREE_CODE (TREE_PURPOSE (link
)) == FIELD_DECL
)
2717 if (memcmp ((char *) &TREE_PURPOSE (link
), p
,
2718 sizeof TREE_PURPOSE (link
)))
2721 p
+= sizeof TREE_PURPOSE (link
);
2723 else if (TREE_PURPOSE (link
))
2725 if ((p
= compare_constant_1 (TREE_PURPOSE (link
), p
)) == 0)
2728 else if (have_purpose
)
2732 if (memcmp ((char *) &zero
, p
, sizeof zero
))
2744 struct addr_const value
;
2746 decode_addr_const (exp
, &value
);
2747 strp
= (unsigned char *) &value
.offset
;
2748 len
= sizeof value
.offset
;
2749 /* Compare the offset. */
2751 if (*p
++ != *strp
++)
2754 /* Compare symbol name. */
2755 strp
= (const unsigned char *) XSTR (value
.base
, 0);
2756 len
= strlen ((const char *) strp
) + 1;
2763 p
= compare_constant_1 (TREE_OPERAND (exp
, 0), p
);
2767 return compare_constant_1 (TREE_OPERAND (exp
, 1), p
);
2771 case NON_LVALUE_EXPR
:
2772 return compare_constant_1 (TREE_OPERAND (exp
, 0), p
);
2775 if (lang_expand_constant
)
2777 exp
= (*lang_expand_constant
) (exp
);
2778 return compare_constant_1 (exp
, p
);
2783 /* Compare constant contents. */
2785 if (*p
++ != *strp
++)
2791 /* Construct a constant descriptor for the expression EXP.
2792 It is up to the caller to enter the descriptor in the hash table. */
2794 static struct constant_descriptor
*
2795 record_constant (exp
)
2798 struct constant_descriptor
*next
= 0;
2803 /* Make a struct constant_descriptor. The first three pointers will
2804 be filled in later. Here we just leave space for them. */
2806 obstack_grow (&permanent_obstack
, (char *) &next
, sizeof next
);
2807 obstack_grow (&permanent_obstack
, (char *) &label
, sizeof label
);
2808 obstack_grow (&permanent_obstack
, (char *) &rtl
, sizeof rtl
);
2810 /* Align the descriptor for the data payload. */
2811 pad
= (offsetof (struct constant_descriptor
, u
)
2812 - offsetof(struct constant_descriptor
, rtl
)
2813 - sizeof(next
->rtl
));
2815 obstack_blank (&permanent_obstack
, pad
);
2817 record_constant_1 (exp
);
2818 return (struct constant_descriptor
*) obstack_finish (&permanent_obstack
);
2821 /* Add a description of constant expression EXP
2822 to the object growing in `permanent_obstack'.
2823 No need to return its address; the caller will get that
2824 from the obstack when the object is complete. */
2827 record_constant_1 (exp
)
2830 register const unsigned char *strp
;
2832 register enum tree_code code
= TREE_CODE (exp
);
2834 obstack_1grow (&permanent_obstack
, (unsigned int) code
);
2839 obstack_1grow (&permanent_obstack
, TYPE_PRECISION (TREE_TYPE (exp
)));
2840 strp
= (unsigned char *) &TREE_INT_CST (exp
);
2841 len
= sizeof TREE_INT_CST (exp
);
2845 obstack_1grow (&permanent_obstack
, TYPE_PRECISION (TREE_TYPE (exp
)));
2846 strp
= (unsigned char *) &TREE_REAL_CST (exp
);
2847 len
= sizeof TREE_REAL_CST (exp
);
2851 if (flag_writable_strings
)
2854 obstack_1grow (&permanent_obstack
, TYPE_MODE (TREE_TYPE (exp
)));
2855 strp
= (const unsigned char *) TREE_STRING_POINTER (exp
);
2856 len
= TREE_STRING_LENGTH (exp
);
2857 obstack_grow (&permanent_obstack
, (char *) &TREE_STRING_LENGTH (exp
),
2858 sizeof TREE_STRING_LENGTH (exp
));
2862 record_constant_1 (TREE_REALPART (exp
));
2863 record_constant_1 (TREE_IMAGPART (exp
));
2867 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2869 int nbytes
= int_size_in_bytes (TREE_TYPE (exp
));
2870 obstack_grow (&permanent_obstack
, &nbytes
, sizeof (nbytes
));
2871 obstack_blank (&permanent_obstack
, nbytes
);
2872 get_set_constructor_bytes
2873 (exp
, (unsigned char *) permanent_obstack
.next_free
-nbytes
,
2880 int length
= list_length (CONSTRUCTOR_ELTS (exp
));
2881 enum machine_mode mode
= TYPE_MODE (TREE_TYPE (exp
));
2883 int have_purpose
= 0;
2885 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2886 if (TREE_PURPOSE (link
))
2889 obstack_grow (&permanent_obstack
, (char *) &length
, sizeof length
);
2891 /* For record constructors, insist that the types match.
2892 For arrays, just verify both constructors are for arrays
2893 of the same mode. Then insist that either both or none
2894 have any TREE_PURPOSE values. */
2895 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2896 type
= TREE_TYPE (exp
);
2900 obstack_grow (&permanent_obstack
, (char *) &type
, sizeof type
);
2901 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2902 obstack_grow (&permanent_obstack
, &mode
, sizeof mode
);
2904 obstack_grow (&permanent_obstack
, (char *) &have_purpose
,
2905 sizeof have_purpose
);
2907 /* For arrays, insist that the size in bytes match. */
2908 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2910 HOST_WIDE_INT size
= int_size_in_bytes (TREE_TYPE (exp
));
2911 obstack_grow (&permanent_obstack
, (char *) &size
, sizeof size
);
2914 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2916 if (TREE_VALUE (link
))
2917 record_constant_1 (TREE_VALUE (link
));
2922 obstack_grow (&permanent_obstack
,
2923 (char *) &zero
, sizeof zero
);
2926 if (TREE_PURPOSE (link
)
2927 && TREE_CODE (TREE_PURPOSE (link
)) == FIELD_DECL
)
2928 obstack_grow (&permanent_obstack
,
2929 (char *) &TREE_PURPOSE (link
),
2930 sizeof TREE_PURPOSE (link
));
2931 else if (TREE_PURPOSE (link
))
2932 record_constant_1 (TREE_PURPOSE (link
));
2933 else if (have_purpose
)
2937 obstack_grow (&permanent_obstack
,
2938 (char *) &zero
, sizeof zero
);
2946 struct addr_const value
;
2948 decode_addr_const (exp
, &value
);
2949 /* Record the offset. */
2950 obstack_grow (&permanent_obstack
,
2951 (char *) &value
.offset
, sizeof value
.offset
);
2953 switch (GET_CODE (value
.base
))
2956 /* Record the symbol name. */
2957 obstack_grow (&permanent_obstack
, XSTR (value
.base
, 0),
2958 strlen (XSTR (value
.base
, 0)) + 1);
2961 /* Record the address of the CODE_LABEL. It may not have
2962 been emitted yet, so it's UID may be zero. But pointer
2963 identity is good enough. */
2964 obstack_grow (&permanent_obstack
, &XEXP (value
.base
, 0),
2976 record_constant_1 (TREE_OPERAND (exp
, 0));
2977 record_constant_1 (TREE_OPERAND (exp
, 1));
2982 case NON_LVALUE_EXPR
:
2983 record_constant_1 (TREE_OPERAND (exp
, 0));
2987 if (lang_expand_constant
)
2989 exp
= (*lang_expand_constant
) (exp
);
2990 record_constant_1 (exp
);
2995 /* Record constant contents. */
2996 obstack_grow (&permanent_obstack
, strp
, len
);
2999 /* Record a list of constant expressions that were passed to
3000 output_constant_def but that could not be output right away. */
3002 struct deferred_constant
3004 struct deferred_constant
*next
;
3010 static struct deferred_constant
*deferred_constants
;
3012 /* Another list of constants which should be output after the
3014 static struct deferred_constant
*after_function_constants
;
3016 /* Nonzero means defer output of addressed subconstants
3017 (i.e., those for which output_constant_def is called.) */
3018 static int defer_addressed_constants_flag
;
3020 /* Start deferring output of subconstants. */
3023 defer_addressed_constants ()
3025 defer_addressed_constants_flag
++;
3028 /* Stop deferring output of subconstants,
3029 and output now all those that have been deferred. */
3032 output_deferred_addressed_constants ()
3034 struct deferred_constant
*p
, *next
;
3036 defer_addressed_constants_flag
--;
3038 if (defer_addressed_constants_flag
> 0)
3041 for (p
= deferred_constants
; p
; p
= next
)
3043 output_constant_def_contents (p
->exp
, p
->reloc
, p
->labelno
);
3048 deferred_constants
= 0;
3051 /* Output any constants which should appear after a function. */
3054 output_after_function_constants ()
3056 struct deferred_constant
*p
, *next
;
3058 for (p
= after_function_constants
; p
; p
= next
)
3060 output_constant_def_contents (p
->exp
, p
->reloc
, p
->labelno
);
3065 after_function_constants
= 0;
3068 /* Make a copy of the whole tree structure for a constant.
3069 This handles the same types of nodes that compare_constant
3070 and record_constant handle. */
3076 switch (TREE_CODE (exp
))
3079 /* For ADDR_EXPR, we do not want to copy the decl whose address
3080 is requested. We do want to copy constants though. */
3081 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, 0))) == 'c')
3082 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
3083 copy_constant (TREE_OPERAND (exp
, 0)));
3085 return copy_node (exp
);
3090 return copy_node (exp
);
3093 return build_complex (TREE_TYPE (exp
),
3094 copy_constant (TREE_REALPART (exp
)),
3095 copy_constant (TREE_IMAGPART (exp
)));
3099 return build (TREE_CODE (exp
), TREE_TYPE (exp
),
3100 copy_constant (TREE_OPERAND (exp
, 0)),
3101 copy_constant (TREE_OPERAND (exp
, 1)));
3105 case NON_LVALUE_EXPR
:
3106 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
3107 copy_constant (TREE_OPERAND (exp
, 0)));
3111 tree copy
= copy_node (exp
);
3112 tree list
= copy_list (CONSTRUCTOR_ELTS (exp
));
3115 CONSTRUCTOR_ELTS (copy
) = list
;
3116 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
3117 TREE_VALUE (tail
) = copy_constant (TREE_VALUE (tail
));
3118 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
3119 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
3120 TREE_PURPOSE (tail
) = copy_constant (TREE_PURPOSE (tail
));
3130 /* Return an rtx representing a reference to constant data in memory
3131 for the constant expression EXP.
3133 If assembler code for such a constant has already been output,
3134 return an rtx to refer to it.
3135 Otherwise, output such a constant in memory (or defer it for later)
3136 and generate an rtx for it.
3138 If DEFER is non-zero, the output of string constants can be deferred
3139 and output only if referenced in the function after all optimizations.
3141 The TREE_CST_RTL of EXP is set up to point to that rtx.
3142 The const_hash_table records which constants already have label strings. */
3145 output_constant_def (exp
, defer
)
3150 register struct constant_descriptor
*desc
;
3151 struct deferred_string
**defstr
;
3155 int after_function
= 0;
3158 if (TREE_CST_RTL (exp
))
3159 return TREE_CST_RTL (exp
);
3161 /* Make sure any other constants whose addresses appear in EXP
3162 are assigned label numbers. */
3164 reloc
= output_addressed_constants (exp
);
3166 /* Compute hash code of EXP. Search the descriptors for that hash code
3167 to see if any of them describes EXP. If yes, the descriptor records
3168 the label number already assigned. */
3170 hash
= const_hash (exp
) % MAX_HASH_TABLE
;
3172 for (desc
= const_hash_table
[hash
]; desc
; desc
= desc
->next
)
3173 if (compare_constant (exp
, desc
))
3178 /* No constant equal to EXP is known to have been output.
3179 Make a constant descriptor to enter EXP in the hash table.
3180 Assign the label number and record it in the descriptor for
3181 future calls to this function to find. */
3183 /* Create a string containing the label name, in LABEL. */
3184 labelno
= const_labelno
++;
3185 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", labelno
);
3187 desc
= record_constant (exp
);
3188 desc
->next
= const_hash_table
[hash
];
3189 desc
->label
= ggc_strdup (label
);
3190 const_hash_table
[hash
] = desc
;
3192 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
3194 = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp
)),
3195 gen_rtx_SYMBOL_REF (Pmode
, desc
->label
));
3197 set_mem_attributes (desc
->rtl
, exp
, 1);
3202 TREE_CST_RTL (exp
) = desc
->rtl
;
3204 /* Optionally set flags or add text to the name to record information
3205 such as that it is a function name. If the name is changed, the macro
3206 ASM_OUTPUT_LABELREF will have to know how to strip this information. */
3207 #ifdef ENCODE_SECTION_INFO
3208 /* A previously-processed constant would already have section info
3212 ENCODE_SECTION_INFO (exp
);
3213 desc
->rtl
= TREE_CST_RTL (exp
);
3214 desc
->label
= XSTR (XEXP (desc
->rtl
, 0), 0);
3218 #ifdef CONSTANT_AFTER_FUNCTION_P
3219 if (current_function_decl
!= 0
3220 && CONSTANT_AFTER_FUNCTION_P (exp
))
3225 && STRING_POOL_ADDRESS_P (XEXP (desc
->rtl
, 0))
3226 && (!defer
|| defer_addressed_constants_flag
|| after_function
))
3228 defstr
= (struct deferred_string
**)
3229 htab_find_slot_with_hash (const_str_htab
, desc
->label
,
3230 STRHASH (desc
->label
), NO_INSERT
);
3233 /* If the string is currently deferred but we need to output it now,
3234 remove it from deferred string hash table. */
3236 labelno
= (*defstr
)->labelno
;
3237 STRING_POOL_ADDRESS_P (XEXP (desc
->rtl
, 0)) = 0;
3238 htab_clear_slot (const_str_htab
, (void **) defstr
);
3242 /* If this is the first time we've seen this particular constant,
3243 output it (or defer its output for later). */
3246 if (defer_addressed_constants_flag
|| after_function
)
3248 struct deferred_constant
*p
;
3249 p
= (struct deferred_constant
*) xmalloc (sizeof (struct deferred_constant
));
3251 p
->exp
= copy_constant (exp
);
3253 p
->labelno
= labelno
;
3256 p
->next
= after_function_constants
;
3257 after_function_constants
= p
;
3261 p
->next
= deferred_constants
;
3262 deferred_constants
= p
;
3267 /* Do no output if -fsyntax-only. */
3268 if (! flag_syntax_only
)
3270 if (TREE_CODE (exp
) != STRING_CST
3272 || flag_writable_strings
3273 || (defstr
= (struct deferred_string
**)
3274 htab_find_slot_with_hash (const_str_htab
,
3276 STRHASH (desc
->label
),
3278 output_constant_def_contents (exp
, reloc
, labelno
);
3281 struct deferred_string
*p
;
3283 p
= (struct deferred_string
*)
3284 xmalloc (sizeof (struct deferred_string
));
3286 p
->exp
= copy_constant (exp
);
3287 p
->label
= desc
->label
;
3288 p
->labelno
= labelno
;
3290 STRING_POOL_ADDRESS_P (XEXP (desc
->rtl
, 0)) = 1;
3296 return TREE_CST_RTL (exp
);
3299 /* Now output assembler code to define the label for EXP,
3300 and follow it with the data of EXP. */
3303 output_constant_def_contents (exp
, reloc
, labelno
)
3310 if (IN_NAMED_SECTION (exp
))
3311 named_section (exp
, NULL
, reloc
);
3314 /* First switch to text section, except for writable strings. */
3315 #ifdef SELECT_SECTION
3316 SELECT_SECTION (exp
, reloc
);
3318 if (((TREE_CODE (exp
) == STRING_CST
) && flag_writable_strings
)
3319 || (flag_pic
&& reloc
))
3322 readonly_data_section ();
3326 /* Align the location counter as required by EXP's data type. */
3327 align
= TYPE_ALIGN (TREE_TYPE (exp
));
3328 #ifdef CONSTANT_ALIGNMENT
3329 align
= CONSTANT_ALIGNMENT (exp
, align
);
3332 if (align
> BITS_PER_UNIT
)
3333 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
3335 /* Output the label itself. */
3336 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LC", labelno
);
3338 /* Output the value of EXP. */
3339 output_constant (exp
,
3340 (TREE_CODE (exp
) == STRING_CST
3341 ? MAX (TREE_STRING_LENGTH (exp
),
3342 int_size_in_bytes (TREE_TYPE (exp
)))
3343 : int_size_in_bytes (TREE_TYPE (exp
))),
3348 /* Structure to represent sufficient information about a constant so that
3349 it can be output when the constant pool is output, so that function
3350 integration can be done, and to simplify handling on machines that reference
3351 constant pool as base+displacement. */
3353 struct pool_constant
3355 struct constant_descriptor
*desc
;
3356 struct pool_constant
*next
, *next_sym
;
3359 enum machine_mode mode
;
3366 /* Hash code for a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true.
3367 The argument is XSTR (... , 0) */
3369 #define SYMHASH(LABEL) \
3370 ((((unsigned long) (LABEL)) & ((1 << HASHBITS) - 1)) % MAX_RTX_HASH_TABLE)
3372 /* Initialize constant pool hashing for a new function. */
3375 init_varasm_status (f
)
3378 struct varasm_status
*p
;
3379 p
= (struct varasm_status
*) xmalloc (sizeof (struct varasm_status
));
3381 p
->x_const_rtx_hash_table
3382 = ((struct constant_descriptor
**)
3383 xcalloc (MAX_RTX_HASH_TABLE
, sizeof (struct constant_descriptor
*)));
3384 p
->x_const_rtx_sym_hash_table
3385 = ((struct pool_constant
**)
3386 xcalloc (MAX_RTX_HASH_TABLE
, sizeof (struct pool_constant
*)));
3388 p
->x_first_pool
= p
->x_last_pool
= 0;
3389 p
->x_pool_offset
= 0;
3390 p
->x_const_double_chain
= 0;
3393 /* Mark PC for GC. */
3396 mark_pool_constant (pc
)
3397 struct pool_constant
*pc
;
3402 ggc_mark_rtx (pc
->constant
);
3407 /* Mark P for GC. */
3410 mark_varasm_status (p
)
3411 struct varasm_status
*p
;
3416 mark_pool_constant (p
->x_first_pool
);
3417 ggc_mark_rtx (p
->x_const_double_chain
);
3420 /* Clear out all parts of the state in F that can safely be discarded
3421 after the function has been compiled, to let garbage collection
3422 reclaim the memory. */
3425 free_varasm_status (f
)
3428 struct varasm_status
*p
;
3433 /* Clear out the hash tables. */
3434 for (i
= 0; i
< MAX_RTX_HASH_TABLE
; ++i
)
3436 struct constant_descriptor
* cd
;
3438 cd
= p
->x_const_rtx_hash_table
[i
];
3440 struct constant_descriptor
* next
= cd
->next
;
3446 free (p
->x_const_rtx_hash_table
);
3447 free (p
->x_const_rtx_sym_hash_table
);
3453 /* Express an rtx for a constant integer (perhaps symbolic)
3454 as the sum of a symbol or label plus an explicit integer.
3455 They are stored into VALUE. */
3458 decode_rtx_const (mode
, x
, value
)
3459 enum machine_mode mode
;
3461 struct rtx_const
*value
;
3463 /* Clear the whole structure, including any gaps. */
3464 memset (value
, 0, sizeof (struct rtx_const
));
3466 value
->kind
= RTX_INT
; /* Most usual kind. */
3469 switch (GET_CODE (x
))
3472 value
->kind
= RTX_DOUBLE
;
3473 if (GET_MODE (x
) != VOIDmode
)
3475 value
->mode
= GET_MODE (x
);
3476 memcpy ((char *) &value
->un
.du
,
3477 (char *) &CONST_DOUBLE_LOW (x
), sizeof value
->un
.du
);
3481 value
->un
.di
.low
= CONST_DOUBLE_LOW (x
);
3482 value
->un
.di
.high
= CONST_DOUBLE_HIGH (x
);
3487 value
->un
.addr
.offset
= INTVAL (x
);
3493 value
->un
.addr
.base
= x
;
3498 if (GET_CODE (x
) == PLUS
&& GET_CODE (XEXP (x
, 1)) == CONST_INT
)
3500 value
->un
.addr
.base
= XEXP (x
, 0);
3501 value
->un
.addr
.offset
= INTVAL (XEXP (x
, 1));
3503 else if (GET_CODE (x
) == MINUS
&& GET_CODE (XEXP (x
, 1)) == CONST_INT
)
3505 value
->un
.addr
.base
= XEXP (x
, 0);
3506 value
->un
.addr
.offset
= - INTVAL (XEXP (x
, 1));
3510 value
->un
.addr
.base
= x
;
3511 value
->un
.addr
.offset
= 0;
3519 if (value
->kind
== RTX_INT
&& value
->un
.addr
.base
!= 0)
3520 switch (GET_CODE (value
->un
.addr
.base
))
3523 /* Use the string's address, not the SYMBOL_REF's address,
3524 for the sake of addresses of library routines. */
3525 value
->un
.addr
.base
= (rtx
) XSTR (value
->un
.addr
.base
, 0);
3529 /* For a LABEL_REF, compare labels. */
3530 value
->un
.addr
.base
= XEXP (value
->un
.addr
.base
, 0);
3537 /* Given a MINUS expression, simplify it if both sides
3538 include the same symbol. */
3541 simplify_subtraction (x
)
3544 struct rtx_const val0
, val1
;
3546 decode_rtx_const (GET_MODE (x
), XEXP (x
, 0), &val0
);
3547 decode_rtx_const (GET_MODE (x
), XEXP (x
, 1), &val1
);
3549 if (val0
.un
.addr
.base
== val1
.un
.addr
.base
)
3550 return GEN_INT (val0
.un
.addr
.offset
- val1
.un
.addr
.offset
);
3554 /* Compute a hash code for a constant RTL expression. */
3557 const_hash_rtx (mode
, x
)
3558 enum machine_mode mode
;
3564 struct rtx_const value
;
3565 decode_rtx_const (mode
, x
, &value
);
3567 /* Compute hashing function */
3569 for (i
= 0; i
< sizeof value
/ sizeof (int); i
++)
3570 hi
+= ((int *) &value
)[i
];
3572 hi
&= (1 << HASHBITS
) - 1;
3573 hi
%= MAX_RTX_HASH_TABLE
;
3577 /* Compare a constant rtl object X with a constant-descriptor DESC.
3578 Return 1 if DESC describes a constant with the same value as X. */
3581 compare_constant_rtx (mode
, x
, desc
)
3582 enum machine_mode mode
;
3584 struct constant_descriptor
*desc
;
3586 register int *p
= (int *) desc
->u
.contents
;
3589 struct rtx_const value
;
3591 decode_rtx_const (mode
, x
, &value
);
3592 strp
= (int *) &value
;
3593 len
= sizeof value
/ sizeof (int);
3595 /* Compare constant contents. */
3597 if (*p
++ != *strp
++)
3603 /* Construct a constant descriptor for the rtl-expression X.
3604 It is up to the caller to enter the descriptor in the hash table. */
3606 static struct constant_descriptor
*
3607 record_constant_rtx (mode
, x
)
3608 enum machine_mode mode
;
3611 struct constant_descriptor
*ptr
;
3613 ptr
= ((struct constant_descriptor
*)
3614 xcalloc (1, (offsetof (struct constant_descriptor
, u
)
3615 + sizeof (struct rtx_const
))));
3616 decode_rtx_const (mode
, x
, (struct rtx_const
*) ptr
->u
.contents
);
3621 /* Given a constant rtx X, make (or find) a memory constant for its value
3622 and return a MEM rtx to refer to it in memory. */
3625 force_const_mem (mode
, x
)
3626 enum machine_mode mode
;
3630 register struct constant_descriptor
*desc
;
3632 const char *found
= 0;
3635 /* If we want this CONST_DOUBLE in the same mode as it is in memory
3636 (this will always be true for floating CONST_DOUBLEs that have been
3637 placed in memory, but not for VOIDmode (integer) CONST_DOUBLEs),
3638 use the previous copy. Otherwise, make a new one. Note that in
3639 the unlikely event that this same CONST_DOUBLE is used in two different
3640 modes in an alternating fashion, we will allocate a lot of different
3641 memory locations, but this should be extremely rare. */
3643 if (GET_CODE (x
) == CONST_DOUBLE
3644 && GET_CODE (CONST_DOUBLE_MEM (x
)) == MEM
3645 && GET_MODE (CONST_DOUBLE_MEM (x
)) == mode
)
3646 return CONST_DOUBLE_MEM (x
);
3648 /* Compute hash code of X. Search the descriptors for that hash code
3649 to see if any of them describes X. If yes, the descriptor records
3650 the label number already assigned. */
3652 hash
= const_hash_rtx (mode
, x
);
3654 for (desc
= const_rtx_hash_table
[hash
]; desc
; desc
= desc
->next
)
3655 if (compare_constant_rtx (mode
, x
, desc
))
3657 found
= desc
->label
;
3663 register struct pool_constant
*pool
;
3666 /* No constant equal to X is known to have been output.
3667 Make a constant descriptor to enter X in the hash table.
3668 Assign the label number and record it in the descriptor for
3669 future calls to this function to find. */
3671 desc
= record_constant_rtx (mode
, x
);
3672 desc
->next
= const_rtx_hash_table
[hash
];
3673 const_rtx_hash_table
[hash
] = desc
;
3675 /* Align the location counter as required by EXP's data type. */
3676 align
= GET_MODE_ALIGNMENT (mode
== VOIDmode
? word_mode
: mode
);
3677 #ifdef CONSTANT_ALIGNMENT
3678 align
= CONSTANT_ALIGNMENT (make_tree (type_for_mode (mode
, 0), x
),
3682 pool_offset
+= (align
/ BITS_PER_UNIT
) - 1;
3683 pool_offset
&= ~ ((align
/ BITS_PER_UNIT
) - 1);
3685 if (GET_CODE (x
) == LABEL_REF
)
3686 LABEL_PRESERVE_P (XEXP (x
, 0)) = 1;
3688 /* Allocate a pool constant descriptor, fill it in, and chain it in. */
3690 pool
= (struct pool_constant
*) ggc_alloc (sizeof (struct pool_constant
));
3694 pool
->labelno
= const_labelno
;
3695 pool
->align
= align
;
3696 pool
->offset
= pool_offset
;
3703 last_pool
->next
= pool
;
3706 pool_offset
+= GET_MODE_SIZE (mode
);
3708 /* Create a string containing the label name, in LABEL. */
3709 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
3713 desc
->label
= found
= ggc_strdup (label
);
3715 /* Add label to symbol hash table. */
3716 hash
= SYMHASH (found
);
3717 pool
->label
= found
;
3718 pool
->next_sym
= const_rtx_sym_hash_table
[hash
];
3719 const_rtx_sym_hash_table
[hash
] = pool
;
3722 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
3724 def
= gen_rtx_MEM (mode
, gen_rtx_SYMBOL_REF (Pmode
, found
));
3725 set_mem_attributes (def
, type_for_mode (mode
, 0), 1);
3726 RTX_UNCHANGING_P (def
) = 1;
3728 /* Mark the symbol_ref as belonging to this constants pool. */
3729 CONSTANT_POOL_ADDRESS_P (XEXP (def
, 0)) = 1;
3730 current_function_uses_const_pool
= 1;
3732 if (GET_CODE (x
) == CONST_DOUBLE
)
3734 if (CONST_DOUBLE_MEM (x
) == cc0_rtx
)
3736 CONST_DOUBLE_CHAIN (x
) = const_double_chain
;
3737 const_double_chain
= x
;
3739 CONST_DOUBLE_MEM (x
) = def
;
3745 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
3746 the corresponding pool_constant structure. */
3748 static struct pool_constant
*
3749 find_pool_constant (f
, addr
)
3753 struct pool_constant
*pool
;
3754 const char *label
= XSTR (addr
, 0);
3756 for (pool
= f
->varasm
->x_const_rtx_sym_hash_table
[SYMHASH (label
)]; pool
;
3757 pool
= pool
->next_sym
)
3758 if (pool
->label
== label
)
3764 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
3767 get_pool_constant (addr
)
3770 return (find_pool_constant (cfun
, addr
))->constant
;
3773 /* Likewise, but for the constant pool of a specific function. */
3776 get_pool_constant_for_function (f
, addr
)
3780 return (find_pool_constant (f
, addr
))->constant
;
3783 /* Similar, return the mode. */
3786 get_pool_mode (addr
)
3789 return (find_pool_constant (cfun
, addr
))->mode
;
3793 get_pool_mode_for_function (f
, addr
)
3797 return (find_pool_constant (f
, addr
))->mode
;
3800 /* Similar, return the offset in the constant pool. */
3803 get_pool_offset (addr
)
3806 return (find_pool_constant (cfun
, addr
))->offset
;
3809 /* Return the size of the constant pool. */
3817 /* Write all the constants in the constant pool. */
3820 output_constant_pool (fnname
, fndecl
)
3821 const char *fnname ATTRIBUTE_UNUSED
;
3822 tree fndecl ATTRIBUTE_UNUSED
;
3824 struct pool_constant
*pool
;
3826 union real_extract u
;
3828 /* It is possible for gcc to call force_const_mem and then to later
3829 discard the instructions which refer to the constant. In such a
3830 case we do not need to output the constant. */
3831 mark_constant_pool ();
3833 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3834 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3837 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3846 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3847 whose CODE_LABEL has been deleted. This can occur if a jump table
3848 is eliminated by optimization. If so, write a constant of zero
3849 instead. Note that this can also happen by turning the
3850 CODE_LABEL into a NOTE. */
3851 /* ??? This seems completely and utterly wrong. Certainly it's
3852 not true for NOTE_INSN_DELETED_LABEL, but I disbelieve proper
3853 functioning even with INSN_DELETED_P and friends. */
3856 switch (GET_CODE (x
))
3859 if (GET_CODE (XEXP (x
, 0)) != PLUS
3860 || GET_CODE (XEXP (XEXP (x
, 0), 0)) != LABEL_REF
)
3862 tmp
= XEXP (XEXP (x
, 0), 0);
3867 if (INSN_DELETED_P (tmp
)
3868 || (GET_CODE (tmp
) == NOTE
3869 && NOTE_LINE_NUMBER (tmp
) == NOTE_INSN_DELETED
))
3880 /* First switch to correct section. */
3881 #ifdef SELECT_RTX_SECTION
3882 SELECT_RTX_SECTION (pool
->mode
, x
);
3884 readonly_data_section ();
3887 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3888 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file
, x
, pool
->mode
,
3889 pool
->align
, pool
->labelno
, done
);
3892 assemble_align (pool
->align
);
3894 /* Output the label. */
3895 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LC", pool
->labelno
);
3897 /* Output the value of the constant itself. */
3898 switch (GET_MODE_CLASS (pool
->mode
))
3901 if (GET_CODE (x
) != CONST_DOUBLE
)
3904 memcpy ((char *) &u
, (char *) &CONST_DOUBLE_LOW (x
), sizeof u
);
3905 assemble_real (u
.d
, pool
->mode
, pool
->align
);
3909 case MODE_PARTIAL_INT
:
3910 assemble_integer (x
, GET_MODE_SIZE (pool
->mode
), pool
->align
, 1);
3917 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3922 #ifdef ASM_OUTPUT_POOL_EPILOGUE
3923 ASM_OUTPUT_POOL_EPILOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3926 /* Done with this pool. */
3927 first_pool
= last_pool
= 0;
3930 /* Look through the instructions for this function, and mark all the
3931 entries in the constant pool which are actually being used.
3932 Emit used deferred strings. */
3935 mark_constant_pool ()
3938 struct pool_constant
*pool
;
3940 if (first_pool
== 0 && htab_elements (const_str_htab
) == 0)
3943 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3946 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
3948 mark_constants (PATTERN (insn
));
3950 for (insn
= current_function_epilogue_delay_list
;
3952 insn
= XEXP (insn
, 1))
3954 mark_constants (PATTERN (insn
));
3957 /* Look through appropriate parts of X, marking all entries in the
3958 constant pool which are actually being used. Entries that are only
3959 referenced by other constants are also marked as used. Emit
3960 deferred strings that are used. */
3967 register const char *format_ptr
;
3972 if (GET_CODE (x
) == SYMBOL_REF
)
3974 mark_constant (&x
, NULL
);
3977 /* Never search inside a CONST_DOUBLE, because CONST_DOUBLE_MEM may be
3978 a MEM, but does not constitute a use of that MEM. */
3979 else if (GET_CODE (x
) == CONST_DOUBLE
)
3982 /* Insns may appear inside a SEQUENCE. Only check the patterns of
3983 insns, not any notes that may be attached. We don't want to mark
3984 a constant just because it happens to appear in a REG_EQUIV note. */
3987 mark_constants (PATTERN (x
));
3991 format_ptr
= GET_RTX_FORMAT (GET_CODE (x
));
3993 for (i
= 0; i
< GET_RTX_LENGTH (GET_CODE (x
)); i
++)
3995 switch (*format_ptr
++)
3998 mark_constants (XEXP (x
, i
));
4002 if (XVEC (x
, i
) != 0)
4006 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
4007 mark_constants (XVECEXP (x
, i
, j
));
4026 /* Given a SYMBOL_REF CURRENT_RTX, mark it and all constants it refers
4027 to as used. Emit referenced deferred strings. This function can
4028 be used with for_each_rtx () to mark all SYMBOL_REFs in an rtx. */
4031 mark_constant (current_rtx
, data
)
4033 void *data ATTRIBUTE_UNUSED
;
4035 rtx x
= *current_rtx
;
4039 else if (GET_CODE(x
) == CONST_DOUBLE
)
4040 /* Never search inside a CONST_DOUBLE because CONST_DOUBLE_MEM may
4041 be a MEM but does not constitute a use of that MEM. */
4043 else if (GET_CODE (x
) == SYMBOL_REF
)
4045 if (CONSTANT_POOL_ADDRESS_P (x
))
4047 struct pool_constant
*pool
= find_pool_constant (cfun
, x
);
4048 if (pool
->mark
== 0) {
4050 for_each_rtx (&(pool
->constant
), &mark_constant
, NULL
);
4055 else if (STRING_POOL_ADDRESS_P (x
))
4057 struct deferred_string
**defstr
;
4059 defstr
= (struct deferred_string
**)
4060 htab_find_slot_with_hash (const_str_htab
, XSTR (x
, 0),
4061 STRHASH (XSTR (x
, 0)), NO_INSERT
);
4064 struct deferred_string
*p
= *defstr
;
4066 STRING_POOL_ADDRESS_P (x
) = 0;
4067 output_constant_def_contents (p
->exp
, 0, p
->labelno
);
4068 htab_clear_slot (const_str_htab
, (void **) defstr
);
4075 /* Find all the constants whose addresses are referenced inside of EXP,
4076 and make sure assembler code with a label has been output for each one.
4077 Indicate whether an ADDR_EXPR has been encountered. */
4080 output_addressed_constants (exp
)
4085 /* Give the front-end a chance to convert VALUE to something that
4086 looks more like a constant to the back-end. */
4087 if (lang_expand_constant
)
4088 exp
= (*lang_expand_constant
) (exp
);
4090 switch (TREE_CODE (exp
))
4094 register tree constant
= TREE_OPERAND (exp
, 0);
4096 while (TREE_CODE (constant
) == COMPONENT_REF
)
4098 constant
= TREE_OPERAND (constant
, 0);
4101 if (TREE_CODE_CLASS (TREE_CODE (constant
)) == 'c'
4102 || TREE_CODE (constant
) == CONSTRUCTOR
)
4103 /* No need to do anything here
4104 for addresses of variables or functions. */
4105 output_constant_def (constant
, 0);
4112 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
4113 reloc
|= output_addressed_constants (TREE_OPERAND (exp
, 1));
4118 case NON_LVALUE_EXPR
:
4119 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
4125 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
4126 if (TREE_VALUE (link
) != 0)
4127 reloc
|= output_addressed_constants (TREE_VALUE (link
));
4137 /* Return nonzero if VALUE is a valid constant-valued expression
4138 for use in initializing a static variable; one that can be an
4139 element of a "constant" initializer.
4141 Return null_pointer_node if the value is absolute;
4142 if it is relocatable, return the variable that determines the relocation.
4143 We assume that VALUE has been folded as much as possible;
4144 therefore, we do not need to check for such things as
4145 arithmetic-combinations of integers. */
4148 initializer_constant_valid_p (value
, endtype
)
4152 /* Give the front-end a chance to convert VALUE to something that
4153 looks more like a constant to the back-end. */
4154 if (lang_expand_constant
)
4155 value
= (*lang_expand_constant
) (value
);
4157 switch (TREE_CODE (value
))
4160 if ((TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
4161 || TREE_CODE (TREE_TYPE (value
)) == RECORD_TYPE
)
4162 && TREE_CONSTANT (value
)
4163 && CONSTRUCTOR_ELTS (value
))
4165 initializer_constant_valid_p (TREE_VALUE (CONSTRUCTOR_ELTS (value
)),
4168 return TREE_STATIC (value
) ? null_pointer_node
: 0;
4174 return null_pointer_node
;
4177 return staticp (TREE_OPERAND (value
, 0)) ? TREE_OPERAND (value
, 0) : 0;
4179 case NON_LVALUE_EXPR
:
4180 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
4184 /* Allow conversions between pointer types. */
4185 if (POINTER_TYPE_P (TREE_TYPE (value
))
4186 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
4187 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
4189 /* Allow conversions between real types. */
4190 if (FLOAT_TYPE_P (TREE_TYPE (value
))
4191 && FLOAT_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
4192 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
4194 /* Allow length-preserving conversions between integer types. */
4195 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
4196 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
4197 && (TYPE_PRECISION (TREE_TYPE (value
))
4198 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
4199 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
4201 /* Allow conversions between other integer types only if
4203 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
4204 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
4206 tree inner
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4208 if (inner
== null_pointer_node
)
4209 return null_pointer_node
;
4213 /* Allow (int) &foo provided int is as wide as a pointer. */
4214 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
4215 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
4216 && (TYPE_PRECISION (TREE_TYPE (value
))
4217 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
4218 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4221 /* Likewise conversions from int to pointers, but also allow
4222 conversions from 0. */
4223 if (POINTER_TYPE_P (TREE_TYPE (value
))
4224 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
4226 if (integer_zerop (TREE_OPERAND (value
, 0)))
4227 return null_pointer_node
;
4228 else if (TYPE_PRECISION (TREE_TYPE (value
))
4229 <= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0))))
4230 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4234 /* Allow conversions to union types if the value inside is okay. */
4235 if (TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
)
4236 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4241 if (! INTEGRAL_TYPE_P (endtype
)
4242 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
4244 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4246 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
4248 /* If either term is absolute, use the other terms relocation. */
4249 if (valid0
== null_pointer_node
)
4251 if (valid1
== null_pointer_node
)
4257 if (! INTEGRAL_TYPE_P (endtype
)
4258 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
4260 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4262 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
4264 /* Win if second argument is absolute. */
4265 if (valid1
== null_pointer_node
)
4267 /* Win if both arguments have the same relocation.
4268 Then the value is absolute. */
4269 if (valid0
== valid1
&& valid0
!= 0)
4270 return null_pointer_node
;
4272 /* Since GCC guarantees that string constants are unique in the
4273 generated code, a subtraction between two copies of the same
4274 constant string is absolute. */
4275 if (valid0
&& TREE_CODE (valid0
) == STRING_CST
&&
4276 valid1
&& TREE_CODE (valid1
) == STRING_CST
&&
4277 TREE_STRING_POINTER (valid0
) == TREE_STRING_POINTER (valid1
))
4278 return null_pointer_node
;
4281 /* Support differences between labels. */
4282 if (INTEGRAL_TYPE_P (endtype
))
4285 op0
= TREE_OPERAND (value
, 0);
4286 op1
= TREE_OPERAND (value
, 1);
4290 if (TREE_CODE (op0
) == ADDR_EXPR
4291 && TREE_CODE (TREE_OPERAND (op0
, 0)) == LABEL_DECL
4292 && TREE_CODE (op1
) == ADDR_EXPR
4293 && TREE_CODE (TREE_OPERAND (op1
, 0)) == LABEL_DECL
)
4294 return null_pointer_node
;
4305 /* Output assembler code for constant EXP to FILE, with no label.
4306 This includes the pseudo-op such as ".int" or ".byte", and a newline.
4307 Assumes output_addressed_constants has been done on EXP already.
4309 Generate exactly SIZE bytes of assembler data, padding at the end
4310 with zeros if necessary. SIZE must always be specified.
4312 SIZE is important for structure constructors,
4313 since trailing members may have been omitted from the constructor.
4314 It is also important for initialization of arrays from string constants
4315 since the full length of the string constant might not be wanted.
4316 It is also needed for initialization of unions, where the initializer's
4317 type is just one member, and that may not be as long as the union.
4319 There a case in which we would fail to output exactly SIZE bytes:
4320 for a structure constructor that wants to produce more than SIZE bytes.
4321 But such constructors will never be generated for any possible input.
4323 ALIGN is the alignment of the data in bits. */
4326 output_constant (exp
, size
, align
)
4331 register enum tree_code code
= TREE_CODE (TREE_TYPE (exp
));
4333 /* Some front-ends use constants other than the standard
4334 language-indepdent varieties, but which may still be output
4335 directly. Give the front-end a chance to convert EXP to a
4336 language-independent representation. */
4337 if (lang_expand_constant
)
4339 exp
= (*lang_expand_constant
) (exp
);
4340 code
= TREE_CODE (TREE_TYPE (exp
));
4343 if (size
== 0 || flag_syntax_only
)
4346 /* Eliminate the NON_LVALUE_EXPR_EXPR that makes a cast not be an lvalue.
4347 That way we get the constant (we hope) inside it. Also, strip off any
4348 NOP_EXPR that converts between two record, union, array, or set types
4349 or a CONVERT_EXPR that converts to a union TYPE. */
4350 while ((TREE_CODE (exp
) == NOP_EXPR
4351 && (TREE_TYPE (exp
) == TREE_TYPE (TREE_OPERAND (exp
, 0))
4352 || AGGREGATE_TYPE_P (TREE_TYPE (exp
))))
4353 || (TREE_CODE (exp
) == CONVERT_EXPR
4354 && code
== UNION_TYPE
)
4355 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
4357 exp
= TREE_OPERAND (exp
, 0);
4358 code
= TREE_CODE (TREE_TYPE (exp
));
4361 /* Allow a constructor with no elements for any data type.
4362 This means to fill the space with zeros. */
4363 if (TREE_CODE (exp
) == CONSTRUCTOR
&& CONSTRUCTOR_ELTS (exp
) == 0)
4365 assemble_zeros (size
);
4376 case REFERENCE_TYPE
:
4377 /* ??? What about (int)((float)(int)&foo + 4) */
4378 while (TREE_CODE (exp
) == NOP_EXPR
|| TREE_CODE (exp
) == CONVERT_EXPR
4379 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
4380 exp
= TREE_OPERAND (exp
, 0);
4382 if (! assemble_integer (expand_expr (exp
, NULL_RTX
, VOIDmode
,
4383 EXPAND_INITIALIZER
),
4385 error ("initializer for integer value is too complicated");
4390 if (TREE_CODE (exp
) != REAL_CST
)
4391 error ("initializer for floating value is not a floating constant");
4393 assemble_real (TREE_REAL_CST (exp
),
4394 mode_for_size (size
* BITS_PER_UNIT
, MODE_FLOAT
, 0),
4400 output_constant (TREE_REALPART (exp
), size
/ 2, align
);
4401 output_constant (TREE_IMAGPART (exp
), size
/ 2,
4402 min_align (align
, BITS_PER_UNIT
* (size
/ 2)));
4403 size
-= (size
/ 2) * 2;
4407 if (TREE_CODE (exp
) == CONSTRUCTOR
)
4409 output_constructor (exp
, size
, align
);
4412 else if (TREE_CODE (exp
) == STRING_CST
)
4416 if (size
> TREE_STRING_LENGTH (exp
))
4418 excess
= size
- TREE_STRING_LENGTH (exp
);
4419 size
= TREE_STRING_LENGTH (exp
);
4422 assemble_string (TREE_STRING_POINTER (exp
), size
);
4431 if (TREE_CODE (exp
) == CONSTRUCTOR
)
4432 output_constructor (exp
, size
, align
);
4438 if (TREE_CODE (exp
) == INTEGER_CST
)
4439 assemble_integer (expand_expr (exp
, NULL_RTX
,
4440 VOIDmode
, EXPAND_INITIALIZER
),
4442 else if (TREE_CODE (exp
) == CONSTRUCTOR
)
4444 unsigned char *buffer
= (unsigned char *) alloca (size
);
4445 if (get_set_constructor_bytes (exp
, buffer
, size
))
4447 assemble_string ((char *) buffer
, size
);
4450 error ("unknown set constructor type");
4458 assemble_zeros (size
);
4462 /* Subroutine of output_constructor, used for computing the size of
4463 arrays of unspecified length. VAL must be a CONSTRUCTOR of an array
4464 type with an unspecified upper bound. */
4466 static unsigned HOST_WIDE_INT
4467 array_size_for_constructor (val
)
4472 max_index
= NULL_TREE
;
4473 for (i
= CONSTRUCTOR_ELTS (val
); i
; i
= TREE_CHAIN (i
))
4475 tree index
= TREE_PURPOSE (i
);
4477 if (TREE_CODE (index
) == RANGE_EXPR
)
4478 index
= TREE_OPERAND (index
, 1);
4479 if (max_index
== NULL_TREE
|| tree_int_cst_lt (max_index
, index
))
4483 if (max_index
== NULL_TREE
)
4486 /* Compute the total number of array elements. */
4487 i
= size_binop (MINUS_EXPR
, convert (sizetype
, max_index
),
4489 TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (val
)))));
4490 i
= size_binop (PLUS_EXPR
, i
, convert (sizetype
, integer_one_node
));
4492 /* Multiply by the array element unit size to find number of bytes. */
4493 i
= size_binop (MULT_EXPR
, i
, TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (val
))));
4495 return tree_low_cst (i
, 1);
4498 /* Subroutine of output_constant, used for CONSTRUCTORs (aggregate constants).
4499 Generate at least SIZE bytes, padding if necessary. */
4502 output_constructor (exp
, size
, align
)
4507 tree type
= TREE_TYPE (exp
);
4508 register tree link
, field
= 0;
4510 /* Number of bytes output or skipped so far.
4511 In other words, current position within the constructor. */
4512 HOST_WIDE_INT total_bytes
= 0;
4513 /* Non-zero means BYTE contains part of a byte, to be output. */
4514 int byte_buffer_in_use
= 0;
4515 register int byte
= 0;
4517 if (HOST_BITS_PER_WIDE_INT
< BITS_PER_UNIT
)
4520 if (TREE_CODE (type
) == RECORD_TYPE
)
4521 field
= TYPE_FIELDS (type
);
4523 if (TREE_CODE (type
) == ARRAY_TYPE
4524 && TYPE_DOMAIN (type
) != 0)
4525 min_index
= TYPE_MIN_VALUE (TYPE_DOMAIN (type
));
4527 /* As LINK goes through the elements of the constant,
4528 FIELD goes through the structure fields, if the constant is a structure.
4529 if the constant is a union, then we override this,
4530 by getting the field from the TREE_LIST element.
4531 But the constant could also be an array. Then FIELD is zero.
4533 There is always a maximum of one element in the chain LINK for unions
4534 (even if the initializer in a source program incorrectly contains
4536 for (link
= CONSTRUCTOR_ELTS (exp
);
4538 link
= TREE_CHAIN (link
),
4539 field
= field
? TREE_CHAIN (field
) : 0)
4541 tree val
= TREE_VALUE (link
);
4544 /* The element in a union constructor specifies the proper field
4546 if ((TREE_CODE (type
) == RECORD_TYPE
|| TREE_CODE (type
) == UNION_TYPE
4547 || TREE_CODE (type
) == QUAL_UNION_TYPE
)
4548 && TREE_PURPOSE (link
) != 0)
4549 field
= TREE_PURPOSE (link
);
4551 else if (TREE_CODE (type
) == ARRAY_TYPE
)
4552 index
= TREE_PURPOSE (link
);
4554 /* Eliminate the marker that makes a cast not be an lvalue. */
4558 if (index
&& TREE_CODE (index
) == RANGE_EXPR
)
4560 unsigned HOST_WIDE_INT fieldsize
4561 = int_size_in_bytes (TREE_TYPE (type
));
4562 HOST_WIDE_INT lo_index
= tree_low_cst (TREE_OPERAND (index
, 0), 0);
4563 HOST_WIDE_INT hi_index
= tree_low_cst (TREE_OPERAND (index
, 1), 0);
4564 HOST_WIDE_INT index
;
4565 unsigned int align2
= min_align (align
, fieldsize
* BITS_PER_UNIT
);
4567 for (index
= lo_index
; index
<= hi_index
; index
++)
4569 /* Output the element's initial value. */
4571 assemble_zeros (fieldsize
);
4573 output_constant (val
, fieldsize
, align2
);
4575 /* Count its size. */
4576 total_bytes
+= fieldsize
;
4579 else if (field
== 0 || !DECL_BIT_FIELD (field
))
4581 /* An element that is not a bit-field. */
4583 unsigned HOST_WIDE_INT fieldsize
;
4584 /* Since this structure is static,
4585 we know the positions are constant. */
4586 HOST_WIDE_INT pos
= field
? int_byte_position (field
) : 0;
4587 unsigned int align2
;
4590 pos
= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (val
)), 1)
4591 * (tree_low_cst (index
, 0) - tree_low_cst (min_index
, 0)));
4593 /* Output any buffered-up bit-fields preceding this element. */
4594 if (byte_buffer_in_use
)
4596 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4598 byte_buffer_in_use
= 0;
4601 /* Advance to offset of this element.
4602 Note no alignment needed in an array, since that is guaranteed
4603 if each element has the proper size. */
4604 if ((field
!= 0 || index
!= 0) && pos
!= total_bytes
)
4606 assemble_zeros (pos
- total_bytes
);
4610 /* Find the alignment of this element. */
4611 align2
= min_align (align
, BITS_PER_UNIT
* pos
);
4613 /* Determine size this element should occupy. */
4618 /* If this is an array with an unspecified upper bound,
4619 the initializer determines the size. */
4620 /* ??? This ought to only checked if DECL_SIZE_UNIT is NULL,
4621 but we cannot do this until the deprecated support for
4622 initializing zero-length array members is removed. */
4623 if (TREE_CODE (TREE_TYPE (field
)) == ARRAY_TYPE
4624 && TYPE_DOMAIN (TREE_TYPE (field
))
4625 && ! TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (field
))))
4627 fieldsize
= array_size_for_constructor (val
);
4628 /* Given a non-empty initialization, this field had
4630 if (fieldsize
!= 0 && TREE_CHAIN (field
) != NULL_TREE
)
4633 else if (DECL_SIZE_UNIT (field
))
4635 /* ??? This can't be right. If the decl size overflows
4636 a host integer we will silently emit no data. */
4637 if (host_integerp (DECL_SIZE_UNIT (field
), 1))
4638 fieldsize
= tree_low_cst (DECL_SIZE_UNIT (field
), 1);
4642 fieldsize
= int_size_in_bytes (TREE_TYPE (type
));
4644 /* Output the element's initial value. */
4646 assemble_zeros (fieldsize
);
4648 output_constant (val
, fieldsize
, align2
);
4650 /* Count its size. */
4651 total_bytes
+= fieldsize
;
4653 else if (val
!= 0 && TREE_CODE (val
) != INTEGER_CST
)
4654 error ("invalid initial value for member `%s'",
4655 IDENTIFIER_POINTER (DECL_NAME (field
)));
4658 /* Element that is a bit-field. */
4660 HOST_WIDE_INT next_offset
= int_bit_position (field
);
4661 HOST_WIDE_INT end_offset
4662 = (next_offset
+ tree_low_cst (DECL_SIZE (field
), 1));
4665 val
= integer_zero_node
;
4667 /* If this field does not start in this (or, next) byte,
4669 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4671 /* Output remnant of any bit field in previous bytes. */
4672 if (byte_buffer_in_use
)
4674 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4676 byte_buffer_in_use
= 0;
4679 /* If still not at proper byte, advance to there. */
4680 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4682 assemble_zeros (next_offset
/ BITS_PER_UNIT
- total_bytes
);
4683 total_bytes
= next_offset
/ BITS_PER_UNIT
;
4687 if (! byte_buffer_in_use
)
4690 /* We must split the element into pieces that fall within
4691 separate bytes, and combine each byte with previous or
4692 following bit-fields. */
4694 /* next_offset is the offset n fbits from the beginning of
4695 the structure to the next bit of this element to be processed.
4696 end_offset is the offset of the first bit past the end of
4698 while (next_offset
< end_offset
)
4702 HOST_WIDE_INT value
;
4703 HOST_WIDE_INT next_byte
= next_offset
/ BITS_PER_UNIT
;
4704 HOST_WIDE_INT next_bit
= next_offset
% BITS_PER_UNIT
;
4706 /* Advance from byte to byte
4707 within this element when necessary. */
4708 while (next_byte
!= total_bytes
)
4710 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4715 /* Number of bits we can process at once
4716 (all part of the same byte). */
4717 this_time
= MIN (end_offset
- next_offset
,
4718 BITS_PER_UNIT
- next_bit
);
4719 if (BYTES_BIG_ENDIAN
)
4721 /* On big-endian machine, take the most significant bits
4722 first (of the bits that are significant)
4723 and put them into bytes from the most significant end. */
4724 shift
= end_offset
- next_offset
- this_time
;
4726 /* Don't try to take a bunch of bits that cross
4727 the word boundary in the INTEGER_CST. We can
4728 only select bits from the LOW or HIGH part
4730 if (shift
< HOST_BITS_PER_WIDE_INT
4731 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4733 this_time
= shift
+ this_time
- HOST_BITS_PER_WIDE_INT
;
4734 shift
= HOST_BITS_PER_WIDE_INT
;
4737 /* Now get the bits from the appropriate constant word. */
4738 if (shift
< HOST_BITS_PER_WIDE_INT
)
4739 value
= TREE_INT_CST_LOW (val
);
4740 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4742 value
= TREE_INT_CST_HIGH (val
);
4743 shift
-= HOST_BITS_PER_WIDE_INT
;
4748 /* Get the result. This works only when:
4749 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4750 byte
|= (((value
>> shift
)
4751 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4752 << (BITS_PER_UNIT
- this_time
- next_bit
));
4756 /* On little-endian machines,
4757 take first the least significant bits of the value
4758 and pack them starting at the least significant
4759 bits of the bytes. */
4760 shift
= next_offset
- int_bit_position (field
);
4762 /* Don't try to take a bunch of bits that cross
4763 the word boundary in the INTEGER_CST. We can
4764 only select bits from the LOW or HIGH part
4766 if (shift
< HOST_BITS_PER_WIDE_INT
4767 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4768 this_time
= (HOST_BITS_PER_WIDE_INT
- shift
);
4770 /* Now get the bits from the appropriate constant word. */
4771 if (shift
< HOST_BITS_PER_WIDE_INT
)
4772 value
= TREE_INT_CST_LOW (val
);
4773 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4775 value
= TREE_INT_CST_HIGH (val
);
4776 shift
-= HOST_BITS_PER_WIDE_INT
;
4781 /* Get the result. This works only when:
4782 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4783 byte
|= (((value
>> shift
)
4784 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4788 next_offset
+= this_time
;
4789 byte_buffer_in_use
= 1;
4794 if (byte_buffer_in_use
)
4796 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4800 if (total_bytes
< size
)
4801 assemble_zeros (size
- total_bytes
);
4804 #ifdef HANDLE_PRAGMA_WEAK
4805 /* Add function NAME to the weak symbols list. VALUE is a weak alias
4806 associatd with NAME. */
4809 add_weak (name
, value
)
4813 struct weak_syms
*weak
;
4815 weak
= (struct weak_syms
*) permalloc (sizeof (struct weak_syms
));
4820 weak
->next
= weak_decls
;
4822 weak
->value
= value
;
4827 #endif /* HANDLE_PRAGMA_WEAK */
4829 /* Declare DECL to be a weak symbol. */
4835 if (! TREE_PUBLIC (decl
))
4836 error_with_decl (decl
, "weak declaration of `%s' must be public");
4837 else if (TREE_ASM_WRITTEN (decl
))
4838 error_with_decl (decl
, "weak declaration of `%s' must precede definition");
4839 else if (SUPPORTS_WEAK
)
4840 DECL_WEAK (decl
) = 1;
4841 #ifdef HANDLE_PRAGMA_WEAK
4842 add_weak (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)), NULL
);
4846 /* Emit any pending weak declarations. */
4848 #ifdef HANDLE_PRAGMA_WEAK
4849 struct weak_syms
* weak_decls
;
4855 #ifdef HANDLE_PRAGMA_WEAK
4856 if (HANDLE_PRAGMA_WEAK
)
4858 struct weak_syms
*t
;
4859 for (t
= weak_decls
; t
; t
= t
->next
)
4862 ASM_OUTPUT_WEAK_ALIAS (asm_out_file
, t
->name
, t
->value
);
4868 /* Remove NAME from the pending list of weak symbols. This prevents
4869 the compiler from emitting multiple .weak directives which confuses
4871 #ifdef ASM_WEAKEN_LABEL
4873 remove_from_pending_weak_list (name
)
4874 const char *name ATTRIBUTE_UNUSED
;
4876 #ifdef HANDLE_PRAGMA_WEAK
4877 if (HANDLE_PRAGMA_WEAK
)
4879 struct weak_syms
*t
;
4880 for (t
= weak_decls
; t
; t
= t
->next
)
4882 if (t
->name
&& strcmp (name
, t
->name
) == 0)
4891 assemble_alias (decl
, target
)
4892 tree decl
, target ATTRIBUTE_UNUSED
;
4896 /* We must force creation of DECL_RTL for debug info generation, even though
4897 we don't use it here. */
4898 make_decl_rtl (decl
, NULL
);
4900 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
4902 #ifdef ASM_OUTPUT_DEF
4903 /* Make name accessible from other files, if appropriate. */
4905 if (TREE_PUBLIC (decl
))
4907 #ifdef ASM_WEAKEN_LABEL
4908 if (DECL_WEAK (decl
))
4910 ASM_WEAKEN_LABEL (asm_out_file
, name
);
4911 /* Remove this function from the pending weak list so that
4912 we do not emit multiple .weak directives for it. */
4913 remove_from_pending_weak_list
4914 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
4918 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
4921 #ifdef ASM_OUTPUT_DEF_FROM_DECLS
4922 ASM_OUTPUT_DEF_FROM_DECLS (asm_out_file
, decl
, target
);
4924 ASM_OUTPUT_DEF (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4926 TREE_ASM_WRITTEN (decl
) = 1;
4928 #ifdef ASM_OUTPUT_WEAK_ALIAS
4929 if (! DECL_WEAK (decl
))
4930 warning ("only weak aliases are supported in this configuration");
4932 ASM_OUTPUT_WEAK_ALIAS (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4933 TREE_ASM_WRITTEN (decl
) = 1;
4935 warning ("alias definitions not supported in this configuration; ignored");
4940 /* Returns 1 if the target configuration supports defining public symbols
4941 so that one of them will be chosen at link time instead of generating a
4942 multiply-defined symbol error, whether through the use of weak symbols or
4943 a target-specific mechanism for having duplicates discarded. */
4946 supports_one_only ()
4948 if (SUPPORTS_ONE_ONLY
)
4950 return SUPPORTS_WEAK
;
4953 /* Set up DECL as a public symbol that can be defined in multiple
4954 translation units without generating a linker error. */
4957 make_decl_one_only (decl
)
4960 if (TREE_CODE (decl
) != VAR_DECL
&& TREE_CODE (decl
) != FUNCTION_DECL
)
4963 TREE_PUBLIC (decl
) = 1;
4965 if (TREE_CODE (decl
) == VAR_DECL
4966 && (DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
))
4967 DECL_COMMON (decl
) = 1;
4968 else if (SUPPORTS_ONE_ONLY
)
4970 #ifdef MAKE_DECL_ONE_ONLY
4971 MAKE_DECL_ONE_ONLY (decl
);
4973 DECL_ONE_ONLY (decl
) = 1;
4975 else if (SUPPORTS_WEAK
)
4976 DECL_WEAK (decl
) = 1;
4984 const_str_htab
= htab_create (128, const_str_htab_hash
, const_str_htab_eq
,
4985 const_str_htab_del
);
4986 in_named_htab
= htab_create (31, in_named_entry_hash
,
4987 in_named_entry_eq
, NULL
);
4989 ggc_add_root (const_hash_table
, MAX_HASH_TABLE
, sizeof const_hash_table
[0],
4990 mark_const_hash_entry
);
4991 ggc_add_root (&const_str_htab
, 1, sizeof const_str_htab
,
4992 mark_const_str_htab
);
4995 /* Select a set of attributes for section NAME based on the properties
4996 of DECL and whether or not RELOC indicates that DECL's initializer
4997 might contain runtime relocations.
4999 We make the section read-only and executable for a function decl,
5000 read-only for a const data decl, and writable for a non-const data decl. */
5003 default_section_type_flags (decl
, name
, reloc
)
5010 if (decl
&& TREE_CODE (decl
) == FUNCTION_DECL
)
5011 flags
= SECTION_CODE
;
5012 else if (decl
&& DECL_READONLY_SECTION (decl
, reloc
))
5015 flags
= SECTION_WRITE
;
5017 if (decl
&& DECL_ONE_ONLY (decl
))
5018 flags
|= SECTION_LINKONCE
;
5020 if (strcmp (name
, ".bss") == 0
5021 || strncmp (name
, ".bss.", 5) == 0
5022 || strncmp (name
, ".gnu.linkonce.b.", 16) == 0
5023 || strcmp (name
, ".sbss") == 0
5024 || strncmp (name
, ".sbss.", 6) == 0
5025 || strncmp (name
, ".gnu.linkonce.sb.", 17) == 0)
5026 flags
|= SECTION_BSS
;
5031 /* Output assembly to switch to section NAME with attribute FLAGS.
5032 Four variants for common object file formats. */
5035 default_no_named_section (name
, flags
)
5036 const char *name ATTRIBUTE_UNUSED
;
5037 unsigned int flags ATTRIBUTE_UNUSED
;
5039 /* Some object formats don't support named sections at all. The
5040 front-end should already have flagged this as an error. */
5045 default_elf_asm_named_section (name
, flags
)
5049 char flagchars
[8], *f
= flagchars
;
5052 if (!(flags
& SECTION_DEBUG
))
5054 if (flags
& SECTION_WRITE
)
5056 if (flags
& SECTION_CODE
)
5058 if (flags
& SECTION_SMALL
)
5062 if (flags
& SECTION_BSS
)
5067 fprintf (asm_out_file
, "\t.section\t%s,\"%s\",@%s\n",
5068 name
, flagchars
, type
);
5072 default_coff_asm_named_section (name
, flags
)
5076 char flagchars
[8], *f
= flagchars
;
5078 if (flags
& SECTION_WRITE
)
5080 if (flags
& SECTION_CODE
)
5084 fprintf (asm_out_file
, "\t.section\t%s,\"%s\"\n", name
, flagchars
);
5088 default_pe_asm_named_section (name
, flags
)
5092 default_coff_asm_named_section (name
, flags
);
5094 if (flags
& SECTION_LINKONCE
)
5096 /* Functions may have been compiled at various levels of
5097 optimization so we can't use `same_size' here.
5098 Instead, have the linker pick one. */
5099 fprintf (asm_out_file
, "\t.linkonce %s\n",
5100 (flags
& SECTION_CODE
? "discard" : "same_size"));