1 /* Output variables, constants and external declarations, for GNU compiler.
2 Copyright (C) 1987, 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997,
3 1998, 1999, 2000, 2001 Free Software Foundation, Inc.
5 This file is part of GNU CC.
7 GNU CC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GNU CC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU CC; see the file COPYING. If not, write to
19 the Free Software Foundation, 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
23 /* This file handles generation of all the assembler code
24 *except* the instructions of a function.
25 This includes declarations of variables and their initial values.
27 We also output the assembler code for constants stored in memory
28 and are responsible for combining constants with the same value. */
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 void output_constructor
PARAMS ((tree
, int));
165 #ifdef ASM_WEAKEN_LABEL
166 static void remove_from_pending_weak_list
PARAMS ((const char *));
168 static int in_named_entry_eq
PARAMS ((const PTR
, const PTR
));
169 static hashval_t in_named_entry_hash
PARAMS ((const PTR
));
170 #ifdef ASM_OUTPUT_BSS
171 static void asm_output_bss
PARAMS ((FILE *, tree
, const char *, int, int));
173 #ifdef BSS_SECTION_ASM_OP
174 #ifdef ASM_OUTPUT_ALIGNED_BSS
175 static void asm_output_aligned_bss
PARAMS ((FILE *, tree
, const char *,
178 #endif /* BSS_SECTION_ASM_OP */
179 static void mark_pool_constant
PARAMS ((struct pool_constant
*));
180 static void mark_const_hash_entry
PARAMS ((void *));
181 static int mark_const_str_htab_1
PARAMS ((void **, void *));
182 static void mark_const_str_htab
PARAMS ((void *));
183 static hashval_t const_str_htab_hash
PARAMS ((const void *x
));
184 static int const_str_htab_eq
PARAMS ((const void *x
, const void *y
));
185 static void const_str_htab_del
PARAMS ((void *));
186 static void asm_emit_uninitialised
PARAMS ((tree
, const char*, int, int));
187 static void resolve_unique_section
PARAMS ((tree
, int));
189 static enum in_section
{ no_section
, in_text
, in_data
, in_named
190 #ifdef BSS_SECTION_ASM_OP
193 #ifdef CTORS_SECTION_ASM_OP
196 #ifdef DTORS_SECTION_ASM_OP
199 #ifdef EXTRA_SECTIONS
202 } in_section
= no_section
;
204 /* Return a non-zero value if DECL has a section attribute. */
205 #ifndef IN_NAMED_SECTION
206 #define IN_NAMED_SECTION(DECL) \
207 ((TREE_CODE (DECL) == FUNCTION_DECL || TREE_CODE (DECL) == VAR_DECL) \
208 && DECL_SECTION_NAME (DECL) != NULL_TREE)
211 /* Text of section name when in_section == in_named. */
212 static const char *in_named_name
;
214 /* Hash table of flags that have been used for a particular named section. */
216 struct in_named_entry
222 static htab_t in_named_htab
;
224 /* Define functions like text_section for any extra sections. */
225 #ifdef EXTRA_SECTION_FUNCTIONS
226 EXTRA_SECTION_FUNCTIONS
229 /* Tell assembler to switch to text section. */
234 if (in_section
!= in_text
)
236 fprintf (asm_out_file
, "%s\n", TEXT_SECTION_ASM_OP
);
237 in_section
= in_text
;
241 /* Tell assembler to switch to data section. */
246 if (in_section
!= in_data
)
248 if (flag_shared_data
)
250 #ifdef SHARED_SECTION_ASM_OP
251 fprintf (asm_out_file
, "%s\n", SHARED_SECTION_ASM_OP
);
253 fprintf (asm_out_file
, "%s\n", DATA_SECTION_ASM_OP
);
257 fprintf (asm_out_file
, "%s\n", DATA_SECTION_ASM_OP
);
259 in_section
= in_data
;
262 /* Tell assembler to ALWAYS switch to data section, in case
263 it's not sure where it is. */
266 force_data_section ()
268 in_section
= no_section
;
272 /* Tell assembler to switch to read-only data section. This is normally
276 readonly_data_section ()
278 #ifdef READONLY_DATA_SECTION
279 READONLY_DATA_SECTION (); /* Note this can call data_section. */
285 /* Determine if we're in the text section. */
290 return in_section
== in_text
;
293 /* Determine if we're in the data section. */
298 return in_section
== in_data
;
301 /* Helper routines for maintaining in_named_htab. */
304 in_named_entry_eq (p1
, p2
)
308 const struct in_named_entry
*old
= p1
;
309 const char *new = p2
;
311 return strcmp (old
->name
, new) == 0;
315 in_named_entry_hash (p
)
318 const struct in_named_entry
*old
= p
;
319 return htab_hash_string (old
->name
);
322 /* If SECTION has been seen before as a named section, return the flags
323 that were used. Otherwise, return 0. Note, that 0 is a perfectly valid
324 set of flags for a section to have, so 0 does not mean that the section
325 has not been seen. */
328 get_named_section_flags (section
)
331 struct in_named_entry
**slot
;
333 slot
= (struct in_named_entry
**)
334 htab_find_slot_with_hash (in_named_htab
, section
,
335 htab_hash_string (section
), NO_INSERT
);
337 return slot
? (*slot
)->flags
: 0;
340 /* Record FLAGS for SECTION. If SECTION was previously recorded with a
341 different set of flags, return false. */
344 set_named_section_flags (section
, flags
)
348 struct in_named_entry
**slot
, *entry
;
350 slot
= (struct in_named_entry
**)
351 htab_find_slot_with_hash (in_named_htab
, section
,
352 htab_hash_string (section
), INSERT
);
357 entry
= (struct in_named_entry
*) xmalloc (sizeof (*entry
));
359 entry
->name
= ggc_strdup (section
);
360 entry
->flags
= flags
;
362 else if (entry
->flags
!= flags
)
368 /* Tell assembler to change to section NAME with attributes FLAGS. */
371 named_section_flags (name
, flags
)
375 if (in_section
!= in_named
|| strcmp (name
, in_named_name
) != 0)
377 if (! set_named_section_flags (name
, flags
))
380 (* targetm
.asm_out
.named_section
) (name
, flags
);
382 if (flags
& SECTION_FORGET
)
383 in_section
= no_section
;
386 in_named_name
= ggc_strdup (name
);
387 in_section
= in_named
;
392 /* Tell assembler to change to section NAME for DECL.
393 If DECL is NULL, just switch to section NAME.
394 If NAME is NULL, get the name from DECL.
395 If RELOC is 1, the initializer for DECL contains relocs. */
398 named_section (decl
, name
, reloc
)
405 if (decl
!= NULL_TREE
&& !DECL_P (decl
))
408 name
= TREE_STRING_POINTER (DECL_SECTION_NAME (decl
));
410 flags
= (* targetm
.section_type_flags
) (decl
, name
, reloc
);
412 /* Sanity check user variables for flag changes. Non-user
413 section flag changes will abort in named_section_flags. */
414 if (decl
&& ! set_named_section_flags (name
, flags
))
416 error_with_decl (decl
, "%s causes a section type conflict");
417 flags
= get_named_section_flags (name
);
420 named_section_flags (name
, flags
);
423 /* If required, set DECL_SECTION_NAME to a unique name. */
426 resolve_unique_section (decl
, reloc
)
428 int reloc ATTRIBUTE_UNUSED
;
430 if (DECL_SECTION_NAME (decl
) == NULL_TREE
431 && (flag_function_sections
432 || (targetm
.have_named_sections
433 && DECL_ONE_ONLY (decl
))))
434 UNIQUE_SECTION (decl
, reloc
);
437 #ifdef BSS_SECTION_ASM_OP
439 /* Tell the assembler to switch to the bss section. */
444 if (in_section
!= in_bss
)
446 #ifdef SHARED_BSS_SECTION_ASM_OP
447 if (flag_shared_data
)
448 fprintf (asm_out_file
, "%s\n", SHARED_BSS_SECTION_ASM_OP
);
451 fprintf (asm_out_file
, "%s\n", BSS_SECTION_ASM_OP
);
457 #ifdef ASM_OUTPUT_BSS
459 /* Utility function for ASM_OUTPUT_BSS for targets to use if
460 they don't support alignments in .bss.
461 ??? It is believed that this function will work in most cases so such
462 support is localized here. */
465 asm_output_bss (file
, decl
, name
, size
, rounded
)
467 tree decl ATTRIBUTE_UNUSED
;
469 int size ATTRIBUTE_UNUSED
, rounded
;
471 ASM_GLOBALIZE_LABEL (file
, name
);
473 #ifdef ASM_DECLARE_OBJECT_NAME
474 last_assemble_variable_decl
= decl
;
475 ASM_DECLARE_OBJECT_NAME (file
, name
, decl
);
477 /* Standard thing is just output label for the object. */
478 ASM_OUTPUT_LABEL (file
, name
);
479 #endif /* ASM_DECLARE_OBJECT_NAME */
480 ASM_OUTPUT_SKIP (file
, rounded
);
485 #ifdef ASM_OUTPUT_ALIGNED_BSS
487 /* Utility function for targets to use in implementing
488 ASM_OUTPUT_ALIGNED_BSS.
489 ??? It is believed that this function will work in most cases so such
490 support is localized here. */
493 asm_output_aligned_bss (file
, decl
, name
, size
, align
)
499 ASM_GLOBALIZE_LABEL (file
, name
);
501 ASM_OUTPUT_ALIGN (file
, floor_log2 (align
/ BITS_PER_UNIT
));
502 #ifdef ASM_DECLARE_OBJECT_NAME
503 last_assemble_variable_decl
= decl
;
504 ASM_DECLARE_OBJECT_NAME (file
, name
, decl
);
506 /* Standard thing is just output label for the object. */
507 ASM_OUTPUT_LABEL (file
, name
);
508 #endif /* ASM_DECLARE_OBJECT_NAME */
509 ASM_OUTPUT_SKIP (file
, size
? size
: 1);
514 #endif /* BSS_SECTION_ASM_OP */
516 /* Switch to the section for function DECL.
518 If DECL is NULL_TREE, switch to the text section.
519 ??? It's not clear that we will ever be passed NULL_TREE, but it's
520 safer to handle it. */
523 function_section (decl
)
526 if (decl
!= NULL_TREE
527 && DECL_SECTION_NAME (decl
) != NULL_TREE
)
528 named_section (decl
, (char *) 0, 0);
533 /* Switch to section for variable DECL.
535 RELOC is the `reloc' argument to SELECT_SECTION. */
538 variable_section (decl
, reloc
)
542 if (IN_NAMED_SECTION (decl
))
543 named_section (decl
, NULL
, reloc
);
546 /* C++ can have const variables that get initialized from constructors,
547 and thus can not be in a readonly section. We prevent this by
548 verifying that the initial value is constant for objects put in a
551 error_mark_node is used by the C front end to indicate that the
552 initializer has not been seen yet. In this case, we assume that
553 the initializer must be constant.
555 C++ uses error_mark_node for variables that have complicated
556 initializers, but these variables go in BSS so we won't be called
559 #ifdef SELECT_SECTION
560 SELECT_SECTION (decl
, reloc
);
562 if (DECL_READONLY_SECTION (decl
, reloc
))
563 readonly_data_section ();
570 /* Tell assembler to switch to the section for the exception handling
576 #if defined (EXCEPTION_SECTION)
577 EXCEPTION_SECTION ();
579 if (targetm
.have_named_sections
)
580 named_section (NULL_TREE
, ".gcc_except_table", 0);
584 readonly_data_section ();
588 /* Given NAME, a putative register name, discard any customary prefixes. */
591 strip_reg_name (name
)
594 #ifdef REGISTER_PREFIX
595 if (!strncmp (name
, REGISTER_PREFIX
, strlen (REGISTER_PREFIX
)))
596 name
+= strlen (REGISTER_PREFIX
);
598 if (name
[0] == '%' || name
[0] == '#')
603 /* Decode an `asm' spec for a declaration as a register name.
604 Return the register number, or -1 if nothing specified,
605 or -2 if the ASMSPEC is not `cc' or `memory' and is not recognized,
606 or -3 if ASMSPEC is `cc' and is not recognized,
607 or -4 if ASMSPEC is `memory' and is not recognized.
608 Accept an exact spelling or a decimal number.
609 Prefixes such as % are optional. */
612 decode_reg_name (asmspec
)
619 /* Get rid of confusing prefixes. */
620 asmspec
= strip_reg_name (asmspec
);
622 /* Allow a decimal number as a "register name". */
623 for (i
= strlen (asmspec
) - 1; i
>= 0; i
--)
624 if (! (asmspec
[i
] >= '0' && asmspec
[i
] <= '9'))
626 if (asmspec
[0] != 0 && i
< 0)
629 if (i
< FIRST_PSEUDO_REGISTER
&& i
>= 0)
635 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
637 && ! strcmp (asmspec
, strip_reg_name (reg_names
[i
])))
640 #ifdef ADDITIONAL_REGISTER_NAMES
642 static struct { const char *name
; int number
; } table
[]
643 = ADDITIONAL_REGISTER_NAMES
;
645 for (i
= 0; i
< (int) ARRAY_SIZE (table
); i
++)
646 if (! strcmp (asmspec
, table
[i
].name
))
647 return table
[i
].number
;
649 #endif /* ADDITIONAL_REGISTER_NAMES */
651 if (!strcmp (asmspec
, "memory"))
654 if (!strcmp (asmspec
, "cc"))
663 /* Create the DECL_RTL for a VAR_DECL or FUNCTION_DECL. DECL should
664 have static storage duration. In other words, it should not be an
665 automatic variable, including PARM_DECLs.
667 There is, however, one exception: this function handles variables
668 explicitly placed in a particular register by the user.
670 ASMSPEC, if not 0, is the string which the user specified as the
671 assembler symbol name.
673 This is never called for PARM_DECL nodes. */
676 make_decl_rtl (decl
, asmspec
)
680 int top_level
= (DECL_CONTEXT (decl
) == NULL_TREE
);
681 const char *name
= 0;
682 const char *new_name
= 0;
685 /* Check that we are not being given an automatic variable. */
686 /* A weak alias has TREE_PUBLIC set but not the other bits. */
687 if (TREE_CODE (decl
) == PARM_DECL
688 || TREE_CODE (decl
) == RESULT_DECL
689 || (TREE_CODE (decl
) == VAR_DECL
690 && !TREE_STATIC (decl
)
691 && !TREE_PUBLIC (decl
)
692 && !DECL_EXTERNAL (decl
)
693 && !DECL_REGISTER (decl
)))
695 /* And that we were not given a type or a label. */
696 else if (TREE_CODE (decl
) == TYPE_DECL
697 || TREE_CODE (decl
) == LABEL_DECL
)
700 /* For a duplicate declaration, we can be called twice on the
701 same DECL node. Don't discard the RTL already made. */
702 if (DECL_RTL_SET_P (decl
))
704 /* If the old RTL had the wrong mode, fix the mode. */
705 if (GET_MODE (DECL_RTL (decl
)) != DECL_MODE (decl
))
707 rtx rtl
= DECL_RTL (decl
);
708 PUT_MODE (rtl
, DECL_MODE (decl
));
711 /* ??? Another way to do this would be to do what halfpic.c does
712 and maintain a hashed table of such critters. */
713 /* ??? Another way to do this would be to pass a flag bit to
714 ENCODE_SECTION_INFO saying whether this is a new decl or not. */
715 /* Let the target reassign the RTL if it wants.
716 This is necessary, for example, when one machine specific
717 decl attribute overrides another. */
718 #ifdef REDO_SECTION_INFO_P
719 if (REDO_SECTION_INFO_P (decl
))
720 ENCODE_SECTION_INFO (decl
);
725 new_name
= name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
727 reg_number
= decode_reg_name (asmspec
);
728 if (reg_number
== -2)
730 /* ASMSPEC is given, and not the name of a register. Mark the
731 name with a star so assemble_name won't munge it. */
732 char *starred
= alloca (strlen (asmspec
) + 2);
734 strcpy (starred
+ 1, asmspec
);
738 if (TREE_CODE (decl
) != FUNCTION_DECL
&& DECL_REGISTER (decl
))
740 /* First detect errors in declaring global registers. */
741 if (reg_number
== -1)
742 error_with_decl (decl
, "register name not specified for `%s'");
743 else if (reg_number
< 0)
744 error_with_decl (decl
, "invalid register name for `%s'");
745 else if (TYPE_MODE (TREE_TYPE (decl
)) == BLKmode
)
746 error_with_decl (decl
,
747 "data type of `%s' isn't suitable for a register");
748 else if (! HARD_REGNO_MODE_OK (reg_number
, TYPE_MODE (TREE_TYPE (decl
))))
749 error_with_decl (decl
,
750 "register specified for `%s' isn't suitable for data type");
751 /* Now handle properly declared static register variables. */
756 if (DECL_INITIAL (decl
) != 0 && TREE_STATIC (decl
))
758 DECL_INITIAL (decl
) = 0;
759 error ("global register variable has initial value");
761 if (TREE_THIS_VOLATILE (decl
))
762 warning ("volatile register variables don't work as you might wish");
764 /* If the user specified one of the eliminables registers here,
765 e.g., FRAME_POINTER_REGNUM, we don't want to get this variable
766 confused with that register and be eliminated. Although this
767 usage is somewhat suspect, we nevertheless use the following
768 kludge to avoid setting DECL_RTL to frame_pointer_rtx. */
771 gen_rtx_REG (DECL_MODE (decl
),
772 FIRST_PSEUDO_REGISTER
));
773 REGNO (DECL_RTL (decl
)) = reg_number
;
774 REG_USERVAR_P (DECL_RTL (decl
)) = 1;
776 if (TREE_STATIC (decl
))
778 /* Make this register global, so not usable for anything
780 #ifdef ASM_DECLARE_REGISTER_GLOBAL
781 ASM_DECLARE_REGISTER_GLOBAL (asm_out_file
, decl
, reg_number
, name
);
783 nregs
= HARD_REGNO_NREGS (reg_number
, DECL_MODE (decl
));
785 globalize_reg (reg_number
+ --nregs
);
788 /* As a register variable, it has no section. */
793 /* Now handle ordinary static variables and functions (in memory).
794 Also handle vars declared register invalidly. */
796 if (reg_number
>= 0 || reg_number
== -3)
797 error_with_decl (decl
,
798 "register name given for non-register variable `%s'");
800 /* Specifying a section attribute on a variable forces it into a
801 non-.bss section, and thus it cannot be common. */
802 if (TREE_CODE (decl
) == VAR_DECL
803 && DECL_SECTION_NAME (decl
) != NULL_TREE
804 && DECL_INITIAL (decl
) == NULL_TREE
805 && DECL_COMMON (decl
))
806 DECL_COMMON (decl
) = 0;
808 /* Can't use just the variable's own name for a variable
809 whose scope is less than the whole file, unless it's a member
810 of a local class (which will already be unambiguous).
811 Concatenate a distinguishing number. */
812 if (!top_level
&& !TREE_PUBLIC (decl
)
813 && ! (DECL_CONTEXT (decl
) && TYPE_P (DECL_CONTEXT (decl
)))
815 && name
== IDENTIFIER_POINTER (DECL_NAME (decl
)))
818 ASM_FORMAT_PRIVATE_NAME (label
, name
, var_labelno
);
823 /* When -fprefix-function-name is used, the functions
824 names are prefixed. Only nested function names are not
826 else if (flag_prefix_function_name
&& TREE_CODE (decl
) == FUNCTION_DECL
)
828 size_t name_len
= IDENTIFIER_LENGTH (DECL_ASSEMBLER_NAME (decl
));
831 pname
= alloca (name_len
+ CHKR_PREFIX_SIZE
+ 1);
832 memcpy (pname
, CHKR_PREFIX
, CHKR_PREFIX_SIZE
);
833 memcpy (pname
+ CHKR_PREFIX_SIZE
, name
, name_len
+ 1);
837 if (name
!= new_name
)
839 SET_DECL_ASSEMBLER_NAME (decl
, get_identifier (new_name
));
840 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
843 /* If this variable is to be treated as volatile, show its
844 tree node has side effects. */
845 if ((flag_volatile_global
&& TREE_CODE (decl
) == VAR_DECL
846 && TREE_PUBLIC (decl
))
847 || ((flag_volatile_static
&& TREE_CODE (decl
) == VAR_DECL
848 && (TREE_PUBLIC (decl
) || TREE_STATIC (decl
)))))
849 TREE_SIDE_EFFECTS (decl
) = 1;
851 SET_DECL_RTL (decl
, gen_rtx_MEM (DECL_MODE (decl
),
852 gen_rtx_SYMBOL_REF (Pmode
, name
)));
853 SYMBOL_REF_WEAK (XEXP (DECL_RTL (decl
), 0)) = DECL_WEAK (decl
);
854 if (TREE_CODE (decl
) != FUNCTION_DECL
)
855 set_mem_attributes (DECL_RTL (decl
), decl
, 1);
857 /* Optionally set flags or add text to the name to record information
858 such as that it is a function name.
859 If the name is changed, the macro ASM_OUTPUT_LABELREF
860 will have to know how to strip this information. */
861 #ifdef ENCODE_SECTION_INFO
862 ENCODE_SECTION_INFO (decl
);
866 /* Make the rtl for variable VAR be volatile.
867 Use this only for static variables. */
870 make_var_volatile (var
)
873 if (GET_CODE (DECL_RTL (var
)) != MEM
)
876 MEM_VOLATILE_P (DECL_RTL (var
)) = 1;
879 /* Output alignment directive to align for constant expression EXP. */
882 assemble_constant_align (exp
)
887 /* Align the location counter as required by EXP's data type. */
888 align
= TYPE_ALIGN (TREE_TYPE (exp
));
889 #ifdef CONSTANT_ALIGNMENT
890 align
= CONSTANT_ALIGNMENT (exp
, align
);
893 if (align
> BITS_PER_UNIT
)
894 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
897 /* Output a string of literal assembler code
898 for an `asm' keyword used between functions. */
901 assemble_asm (string
)
906 if (TREE_CODE (string
) == ADDR_EXPR
)
907 string
= TREE_OPERAND (string
, 0);
909 fprintf (asm_out_file
, "\t%s\n", TREE_STRING_POINTER (string
));
912 /* Record an element in the table of global destructors. SYMBOL is
913 a SYMBOL_REF of the function to be called; PRIORITY is a number
914 between 0 and MAX_INIT_PRIORITY. */
917 default_stabs_asm_out_destructor (symbol
, priority
)
919 int priority ATTRIBUTE_UNUSED
;
921 /* Tell GNU LD that this is part of the static destructor set.
922 This will work for any system that uses stabs, most usefully
924 fprintf (asm_out_file
, "%s\"___DTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
925 assemble_name (asm_out_file
, XSTR (symbol
, 0));
926 fputc ('\n', asm_out_file
);
930 default_named_section_asm_out_destructor (symbol
, priority
)
934 const char *section
= ".dtors";
937 /* ??? This only works reliably with the GNU linker. */
938 if (priority
!= DEFAULT_INIT_PRIORITY
)
940 sprintf (buf
, ".dtors.%.5u",
941 /* Invert the numbering so the linker puts us in the proper
942 order; constructors are run from right to left, and the
943 linker sorts in increasing order. */
944 MAX_INIT_PRIORITY
- priority
);
948 named_section_flags (section
, SECTION_WRITE
);
949 assemble_align (POINTER_SIZE
);
950 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, 1);
953 #ifdef DTORS_SECTION_ASM_OP
957 if (in_section
!= in_dtors
)
959 in_section
= in_dtors
;
960 fputs (DTORS_SECTION_ASM_OP
, asm_out_file
);
961 fputc ('\n', asm_out_file
);
966 default_dtor_section_asm_out_destructor (symbol
, priority
)
968 int priority ATTRIBUTE_UNUSED
;
971 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, 1);
975 /* Likewise for global constructors. */
978 default_stabs_asm_out_constructor (symbol
, priority
)
980 int priority ATTRIBUTE_UNUSED
;
982 /* Tell GNU LD that this is part of the static destructor set.
983 This will work for any system that uses stabs, most usefully
985 fprintf (asm_out_file
, "%s\"___CTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
986 assemble_name (asm_out_file
, XSTR (symbol
, 0));
987 fputc ('\n', asm_out_file
);
991 default_named_section_asm_out_constructor (symbol
, priority
)
995 const char *section
= ".ctors";
998 /* ??? This only works reliably with the GNU linker. */
999 if (priority
!= DEFAULT_INIT_PRIORITY
)
1001 sprintf (buf
, ".ctors.%.5u",
1002 /* Invert the numbering so the linker puts us in the proper
1003 order; constructors are run from right to left, and the
1004 linker sorts in increasing order. */
1005 MAX_INIT_PRIORITY
- priority
);
1009 named_section_flags (section
, SECTION_WRITE
);
1010 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, 1);
1013 #ifdef CTORS_SECTION_ASM_OP
1017 if (in_section
!= in_ctors
)
1019 in_section
= in_ctors
;
1020 fputs (CTORS_SECTION_ASM_OP
, asm_out_file
);
1021 fputc ('\n', asm_out_file
);
1026 default_ctor_section_asm_out_constructor (symbol
, priority
)
1028 int priority ATTRIBUTE_UNUSED
;
1031 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, 1);
1035 /* CONSTANT_POOL_BEFORE_FUNCTION may be defined as an expression with
1036 a non-zero value if the constant pool should be output before the
1037 start of the function, or a zero value if the pool should output
1038 after the end of the function. The default is to put it before the
1041 #ifndef CONSTANT_POOL_BEFORE_FUNCTION
1042 #define CONSTANT_POOL_BEFORE_FUNCTION 1
1045 /* Output assembler code for the constant pool of a function and associated
1046 with defining the name of the function. DECL describes the function.
1047 NAME is the function's name. For the constant pool, we use the current
1048 constant pool data. */
1051 assemble_start_function (decl
, fnname
)
1057 /* The following code does not need preprocessing in the assembler. */
1061 if (CONSTANT_POOL_BEFORE_FUNCTION
)
1062 output_constant_pool (fnname
, decl
);
1064 resolve_unique_section (decl
, 0);
1065 function_section (decl
);
1067 /* Tell assembler to move to target machine's alignment for functions. */
1068 align
= floor_log2 (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
1070 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1072 /* Handle a user-specified function alignment.
1073 Note that we still need to align to FUNCTION_BOUNDARY, as above,
1074 because ASM_OUTPUT_MAX_SKIP_ALIGN might not do any alignment at all. */
1075 if (align_functions_log
> align
)
1077 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
1078 ASM_OUTPUT_MAX_SKIP_ALIGN (asm_out_file
,
1079 align_functions_log
, align_functions
-1);
1081 ASM_OUTPUT_ALIGN (asm_out_file
, align_functions_log
);
1085 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
1086 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file
, fnname
);
1089 (*debug_hooks
->begin_function
) (decl
);
1091 /* Make function name accessible from other files, if appropriate. */
1093 if (TREE_PUBLIC (decl
))
1095 if (! first_global_object_name
)
1100 STRIP_NAME_ENCODING (p
, fnname
);
1101 name
= permalloc (strlen (p
) + 1);
1104 if (! DECL_WEAK (decl
) && ! DECL_ONE_ONLY (decl
))
1105 first_global_object_name
= name
;
1107 weak_global_object_name
= name
;
1110 #ifdef ASM_WEAKEN_LABEL
1111 if (DECL_WEAK (decl
))
1113 ASM_WEAKEN_LABEL (asm_out_file
, fnname
);
1114 /* Remove this function from the pending weak list so that
1115 we do not emit multiple .weak directives for it. */
1116 remove_from_pending_weak_list
1117 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
1121 ASM_GLOBALIZE_LABEL (asm_out_file
, fnname
);
1124 /* Do any machine/system dependent processing of the function name */
1125 #ifdef ASM_DECLARE_FUNCTION_NAME
1126 ASM_DECLARE_FUNCTION_NAME (asm_out_file
, fnname
, current_function_decl
);
1128 /* Standard thing is just output label for the function. */
1129 ASM_OUTPUT_LABEL (asm_out_file
, fnname
);
1130 #endif /* ASM_DECLARE_FUNCTION_NAME */
1133 /* Output assembler code associated with defining the size of the
1134 function. DECL describes the function. NAME is the function's name. */
1137 assemble_end_function (decl
, fnname
)
1141 #ifdef ASM_DECLARE_FUNCTION_SIZE
1142 ASM_DECLARE_FUNCTION_SIZE (asm_out_file
, fnname
, decl
);
1144 if (! CONSTANT_POOL_BEFORE_FUNCTION
)
1146 output_constant_pool (fnname
, decl
);
1147 function_section (decl
); /* need to switch back */
1150 /* Output any constants which should appear after the function. */
1151 output_after_function_constants ();
1154 /* Assemble code to leave SIZE bytes of zeros. */
1157 assemble_zeros (size
)
1160 /* Do no output if -fsyntax-only. */
1161 if (flag_syntax_only
)
1164 #ifdef ASM_NO_SKIP_IN_TEXT
1165 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
1166 so we must output 0s explicitly in the text section. */
1167 if (ASM_NO_SKIP_IN_TEXT
&& in_text_section ())
1171 for (i
= 0; i
< size
- 20; i
+= 20)
1174 fprintf (asm_out_file
,
1175 "%s0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n", ASM_BYTE_OP
);
1177 fprintf (asm_out_file
,
1178 "\tbyte 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n");
1184 fprintf (asm_out_file
, "%s0", ASM_BYTE_OP
);
1186 fprintf (asm_out_file
, "\tbyte 0");
1189 for (; i
< size
; i
++)
1190 fprintf (asm_out_file
, ",0");
1191 fprintf (asm_out_file
, "\n");
1197 ASM_OUTPUT_SKIP (asm_out_file
, size
);
1200 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
1203 assemble_align (align
)
1206 if (align
> BITS_PER_UNIT
)
1207 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
1210 /* Assemble a string constant with the specified C string as contents. */
1213 assemble_string (p
, size
)
1220 /* If the string is very long, split it up. */
1224 int thissize
= size
- pos
;
1225 if (thissize
> maximum
)
1228 ASM_OUTPUT_ASCII (asm_out_file
, p
, thissize
);
1236 #if defined ASM_OUTPUT_ALIGNED_DECL_LOCAL
1237 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1238 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1240 #if defined ASM_OUTPUT_ALIGNED_LOCAL
1241 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1242 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, DECL_ALIGN (decl))
1244 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1245 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded)
1249 #if defined ASM_OUTPUT_ALIGNED_BSS
1250 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1251 ASM_OUTPUT_ALIGNED_BSS (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1253 #if defined ASM_OUTPUT_BSS
1254 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1255 ASM_OUTPUT_BSS (asm_out_file, decl, name, size, rounded)
1261 #if defined ASM_OUTPUT_ALIGNED_DECL_COMMON
1262 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1263 ASM_OUTPUT_ALIGNED_DECL_COMMON (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1265 #if defined ASM_OUTPUT_ALIGNED_COMMON
1266 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1267 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file, name, size, DECL_ALIGN (decl))
1269 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1270 ASM_OUTPUT_COMMON (asm_out_file, name, size, rounded)
1275 asm_emit_uninitialised (decl
, name
, size
, rounded
)
1278 int size ATTRIBUTE_UNUSED
;
1279 int rounded ATTRIBUTE_UNUSED
;
1287 destination
= asm_dest_local
;
1289 if (TREE_PUBLIC (decl
))
1291 #if defined ASM_EMIT_BSS
1292 if (! DECL_COMMON (decl
))
1293 destination
= asm_dest_bss
;
1296 destination
= asm_dest_common
;
1299 if (flag_shared_data
)
1301 switch (destination
)
1303 #ifdef ASM_OUTPUT_SHARED_BSS
1305 ASM_OUTPUT_SHARED_BSS (asm_out_file
, decl
, name
, size
, rounded
);
1308 #ifdef ASM_OUTPUT_SHARED_COMMON
1309 case asm_dest_common
:
1310 ASM_OUTPUT_SHARED_COMMON (asm_out_file
, name
, size
, rounded
);
1313 #ifdef ASM_OUTPUT_SHARED_LOCAL
1314 case asm_dest_local
:
1315 ASM_OUTPUT_SHARED_LOCAL (asm_out_file
, name
, size
, rounded
);
1323 resolve_unique_section (decl
, 0);
1325 switch (destination
)
1329 ASM_EMIT_BSS (decl
, name
, size
, rounded
);
1332 case asm_dest_common
:
1333 ASM_EMIT_COMMON (decl
, name
, size
, rounded
);
1335 case asm_dest_local
:
1336 ASM_EMIT_LOCAL (decl
, name
, size
, rounded
);
1345 /* Assemble everything that is needed for a variable or function declaration.
1346 Not used for automatic variables, and not used for function definitions.
1347 Should not be called for variables of incomplete structure type.
1349 TOP_LEVEL is nonzero if this variable has file scope.
1350 AT_END is nonzero if this is the special handling, at end of compilation,
1351 to define things that have had only tentative definitions.
1352 DONT_OUTPUT_DATA if nonzero means don't actually output the
1353 initial value (that will be done by the caller). */
1356 assemble_variable (decl
, top_level
, at_end
, dont_output_data
)
1358 int top_level ATTRIBUTE_UNUSED
;
1359 int at_end ATTRIBUTE_UNUSED
;
1360 int dont_output_data
;
1362 register const char *name
;
1367 last_assemble_variable_decl
= 0;
1369 /* Normally no need to say anything here for external references,
1370 since assemble_external is called by the language-specific code
1371 when a declaration is first seen. */
1373 if (DECL_EXTERNAL (decl
))
1376 /* Output no assembler code for a function declaration.
1377 Only definitions of functions output anything. */
1379 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1382 /* Do nothing for global register variables. */
1383 if (DECL_RTL_SET_P (decl
) && GET_CODE (DECL_RTL (decl
)) == REG
)
1385 TREE_ASM_WRITTEN (decl
) = 1;
1389 /* If type was incomplete when the variable was declared,
1390 see if it is complete now. */
1392 if (DECL_SIZE (decl
) == 0)
1393 layout_decl (decl
, 0);
1395 /* Still incomplete => don't allocate it; treat the tentative defn
1396 (which is what it must have been) as an `extern' reference. */
1398 if (!dont_output_data
&& DECL_SIZE (decl
) == 0)
1400 error_with_file_and_line (DECL_SOURCE_FILE (decl
),
1401 DECL_SOURCE_LINE (decl
),
1402 "storage size of `%s' isn't known",
1403 IDENTIFIER_POINTER (DECL_NAME (decl
)));
1404 TREE_ASM_WRITTEN (decl
) = 1;
1408 /* The first declaration of a variable that comes through this function
1409 decides whether it is global (in C, has external linkage)
1410 or local (in C, has internal linkage). So do nothing more
1411 if this function has already run. */
1413 if (TREE_ASM_WRITTEN (decl
))
1416 /* Make sure ENCODE_SECTION_INFO is invoked before we set ASM_WRITTEN. */
1417 decl_rtl
= DECL_RTL (decl
);
1419 TREE_ASM_WRITTEN (decl
) = 1;
1421 /* Do no output if -fsyntax-only. */
1422 if (flag_syntax_only
)
1427 if (! dont_output_data
1428 && ! host_integerp (DECL_SIZE_UNIT (decl
), 1))
1430 error_with_decl (decl
, "size of variable `%s' is too large");
1434 name
= XSTR (XEXP (decl_rtl
, 0), 0);
1435 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
)
1436 && ! first_global_object_name
1437 && ! (DECL_COMMON (decl
) && (DECL_INITIAL (decl
) == 0
1438 || DECL_INITIAL (decl
) == error_mark_node
))
1439 && ! DECL_WEAK (decl
)
1440 && ! DECL_ONE_ONLY (decl
))
1445 STRIP_NAME_ENCODING (p
, name
);
1446 xname
= permalloc (strlen (p
) + 1);
1448 first_global_object_name
= xname
;
1451 /* Compute the alignment of this data. */
1453 align
= DECL_ALIGN (decl
);
1455 /* In the case for initialing an array whose length isn't specified,
1456 where we have not yet been able to do the layout,
1457 figure out the proper alignment now. */
1458 if (dont_output_data
&& DECL_SIZE (decl
) == 0
1459 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
)
1460 align
= MAX (align
, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl
))));
1462 /* Some object file formats have a maximum alignment which they support.
1463 In particular, a.out format supports a maximum alignment of 4. */
1464 #ifndef MAX_OFILE_ALIGNMENT
1465 #define MAX_OFILE_ALIGNMENT BIGGEST_ALIGNMENT
1467 if (align
> MAX_OFILE_ALIGNMENT
)
1469 warning_with_decl (decl
,
1470 "alignment of `%s' is greater than maximum object file alignment. Using %d.",
1471 MAX_OFILE_ALIGNMENT
/BITS_PER_UNIT
);
1472 align
= MAX_OFILE_ALIGNMENT
;
1475 /* On some machines, it is good to increase alignment sometimes. */
1476 #ifdef DATA_ALIGNMENT
1477 align
= DATA_ALIGNMENT (TREE_TYPE (decl
), align
);
1479 #ifdef CONSTANT_ALIGNMENT
1480 if (DECL_INITIAL (decl
) != 0 && DECL_INITIAL (decl
) != error_mark_node
)
1481 align
= CONSTANT_ALIGNMENT (DECL_INITIAL (decl
), align
);
1484 /* Reset the alignment in case we have made it tighter, so we can benefit
1485 from it in get_pointer_alignment. */
1486 DECL_ALIGN (decl
) = align
;
1488 /* Handle uninitialized definitions. */
1490 if ((DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
)
1491 /* If the target can't output uninitialized but not common global data
1492 in .bss, then we have to use .data. */
1493 #if ! defined ASM_EMIT_BSS
1494 && DECL_COMMON (decl
)
1496 && DECL_SECTION_NAME (decl
) == NULL_TREE
1497 && ! dont_output_data
)
1499 unsigned HOST_WIDE_INT size
= tree_low_cst (DECL_SIZE_UNIT (decl
), 1);
1500 unsigned HOST_WIDE_INT rounded
= size
;
1502 /* Don't allocate zero bytes of common,
1503 since that means "undefined external" in the linker. */
1507 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1508 so that each uninitialized object starts on such a boundary. */
1509 rounded
+= (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1;
1510 rounded
= (rounded
/ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1511 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1513 /* Don't continue this line--convex cc version 4.1 would lose. */
1514 #if !defined(ASM_OUTPUT_ALIGNED_COMMON) && !defined(ASM_OUTPUT_ALIGNED_DECL_COMMON) && !defined(ASM_OUTPUT_ALIGNED_BSS)
1515 if ((unsigned HOST_WIDE_INT
) DECL_ALIGN (decl
) / BITS_PER_UNIT
> rounded
)
1517 (decl
, "requested alignment for %s is greater than implemented alignment of %d.",rounded
);
1520 asm_emit_uninitialised (decl
, name
, size
, rounded
);
1525 /* Handle initialized definitions.
1526 Also handle uninitialized global definitions if -fno-common and the
1527 target doesn't support ASM_OUTPUT_BSS. */
1529 /* First make the assembler name(s) global if appropriate. */
1530 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
))
1532 #ifdef ASM_WEAKEN_LABEL
1533 if (DECL_WEAK (decl
))
1535 ASM_WEAKEN_LABEL (asm_out_file
, name
);
1536 /* Remove this variable from the pending weak list so that
1537 we do not emit multiple .weak directives for it. */
1538 remove_from_pending_weak_list
1539 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
1543 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
1546 /* Output any data that we will need to use the address of. */
1547 if (DECL_INITIAL (decl
) == error_mark_node
)
1548 reloc
= contains_pointers_p (TREE_TYPE (decl
));
1549 else if (DECL_INITIAL (decl
))
1550 reloc
= output_addressed_constants (DECL_INITIAL (decl
));
1552 /* Switch to the appropriate section. */
1553 resolve_unique_section (decl
, reloc
);
1554 variable_section (decl
, reloc
);
1556 /* dbxout.c needs to know this. */
1557 if (in_text_section ())
1558 DECL_IN_TEXT_SECTION (decl
) = 1;
1560 /* Output the alignment of this data. */
1561 if (align
> BITS_PER_UNIT
)
1562 ASM_OUTPUT_ALIGN (asm_out_file
,
1563 floor_log2 (DECL_ALIGN (decl
) / BITS_PER_UNIT
));
1565 /* Do any machine/system dependent processing of the object. */
1566 #ifdef ASM_DECLARE_OBJECT_NAME
1567 last_assemble_variable_decl
= decl
;
1568 ASM_DECLARE_OBJECT_NAME (asm_out_file
, name
, decl
);
1570 /* Standard thing is just output label for the object. */
1571 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1572 #endif /* ASM_DECLARE_OBJECT_NAME */
1574 if (!dont_output_data
)
1576 if (DECL_INITIAL (decl
))
1577 /* Output the actual data. */
1578 output_constant (DECL_INITIAL (decl
),
1579 tree_low_cst (DECL_SIZE_UNIT (decl
), 1));
1581 /* Leave space for it. */
1582 assemble_zeros (tree_low_cst (DECL_SIZE_UNIT (decl
), 1));
1586 /* Return 1 if type TYPE contains any pointers. */
1589 contains_pointers_p (type
)
1592 switch (TREE_CODE (type
))
1595 case REFERENCE_TYPE
:
1596 /* I'm not sure whether OFFSET_TYPE needs this treatment,
1597 so I'll play safe and return 1. */
1603 case QUAL_UNION_TYPE
:
1606 /* For a type that has fields, see if the fields have pointers. */
1607 for (fields
= TYPE_FIELDS (type
); fields
; fields
= TREE_CHAIN (fields
))
1608 if (TREE_CODE (fields
) == FIELD_DECL
1609 && contains_pointers_p (TREE_TYPE (fields
)))
1615 /* An array type contains pointers if its element type does. */
1616 return contains_pointers_p (TREE_TYPE (type
));
1623 /* Output something to declare an external symbol to the assembler.
1624 (Most assemblers don't need this, so we normally output nothing.)
1625 Do nothing if DECL is not external. */
1628 assemble_external (decl
)
1629 tree decl ATTRIBUTE_UNUSED
;
1631 /* Because most platforms do not define ASM_OUTPUT_EXTERNAL, the
1632 main body of this code is only rarely exercised. To provide some
1633 testing, on all platforms, we make sure that the ASM_OUT_FILE is
1634 open. If it's not, we should not be calling this function. */
1638 #ifdef ASM_OUTPUT_EXTERNAL
1639 if (DECL_P (decl
) && DECL_EXTERNAL (decl
) && TREE_PUBLIC (decl
))
1641 rtx rtl
= DECL_RTL (decl
);
1643 if (GET_CODE (rtl
) == MEM
&& GET_CODE (XEXP (rtl
, 0)) == SYMBOL_REF
1644 && ! SYMBOL_REF_USED (XEXP (rtl
, 0)))
1646 /* Some systems do require some output. */
1647 SYMBOL_REF_USED (XEXP (rtl
, 0)) = 1;
1648 ASM_OUTPUT_EXTERNAL (asm_out_file
, decl
, XSTR (XEXP (rtl
, 0), 0));
1654 /* Similar, for calling a library function FUN. */
1657 assemble_external_libcall (fun
)
1658 rtx fun ATTRIBUTE_UNUSED
;
1660 #ifdef ASM_OUTPUT_EXTERNAL_LIBCALL
1661 /* Declare library function name external when first used, if nec. */
1662 if (! SYMBOL_REF_USED (fun
))
1664 SYMBOL_REF_USED (fun
) = 1;
1665 ASM_OUTPUT_EXTERNAL_LIBCALL (asm_out_file
, fun
);
1670 /* Declare the label NAME global. */
1673 assemble_global (name
)
1676 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
1679 /* Assemble a label named NAME. */
1682 assemble_label (name
)
1685 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1688 /* Output to FILE a reference to the assembler name of a C-level name NAME.
1689 If NAME starts with a *, the rest of NAME is output verbatim.
1690 Otherwise NAME is transformed in an implementation-defined way
1691 (usually by the addition of an underscore).
1692 Many macros in the tm file are defined to call this function. */
1695 assemble_name (file
, name
)
1699 const char *real_name
;
1702 STRIP_NAME_ENCODING (real_name
, name
);
1703 if (flag_prefix_function_name
1704 && ! memcmp (real_name
, CHKR_PREFIX
, CHKR_PREFIX_SIZE
))
1705 real_name
= real_name
+ CHKR_PREFIX_SIZE
;
1707 id
= maybe_get_identifier (real_name
);
1709 TREE_SYMBOL_REFERENCED (id
) = 1;
1712 fputs (&name
[1], file
);
1714 ASM_OUTPUT_LABELREF (file
, name
);
1717 /* Allocate SIZE bytes writable static space with a gensym name
1718 and return an RTX to refer to its address. */
1721 assemble_static_space (size
)
1725 const char *namestring
;
1729 if (flag_shared_data
)
1733 ASM_GENERATE_INTERNAL_LABEL (name
, "LF", const_labelno
);
1735 namestring
= ggc_strdup (name
);
1737 x
= gen_rtx_SYMBOL_REF (Pmode
, namestring
);
1739 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
1740 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file
, NULL_TREE
, name
, size
,
1743 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1744 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file
, name
, size
, BIGGEST_ALIGNMENT
);
1747 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1748 so that each uninitialized object starts on such a boundary. */
1749 /* Variable `rounded' might or might not be used in ASM_OUTPUT_LOCAL. */
1750 int rounded ATTRIBUTE_UNUSED
1751 = ((size
+ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1)
1752 / (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1753 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1754 ASM_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
1761 /* Assemble the static constant template for function entry trampolines.
1762 This is done at most once per compilation.
1763 Returns an RTX for the address of the template. */
1765 #ifdef TRAMPOLINE_TEMPLATE
1767 assemble_trampoline_template ()
1773 /* By default, put trampoline templates in read-only data section. */
1775 #ifdef TRAMPOLINE_SECTION
1776 TRAMPOLINE_SECTION ();
1778 readonly_data_section ();
1781 /* Write the assembler code to define one. */
1782 align
= floor_log2 (TRAMPOLINE_ALIGNMENT
/ BITS_PER_UNIT
);
1784 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1786 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LTRAMP", 0);
1787 TRAMPOLINE_TEMPLATE (asm_out_file
);
1789 /* Record the rtl to refer to it. */
1790 ASM_GENERATE_INTERNAL_LABEL (label
, "LTRAMP", 0);
1791 name
= ggc_strdup (label
);
1792 return gen_rtx_SYMBOL_REF (Pmode
, name
);
1796 /* Assemble the integer constant X into an object of SIZE bytes.
1797 X must be either a CONST_INT or CONST_DOUBLE.
1799 Return 1 if we were able to output the constant, otherwise 0. If FORCE is
1800 non-zero, abort if we can't output the constant. */
1803 assemble_integer (x
, size
, force
)
1808 /* First try to use the standard 1, 2, 4, 8, and 16 byte
1809 ASM_OUTPUT... macros. */
1813 #ifdef ASM_OUTPUT_CHAR
1815 ASM_OUTPUT_CHAR (asm_out_file
, x
);
1819 #ifdef ASM_OUTPUT_SHORT
1821 ASM_OUTPUT_SHORT (asm_out_file
, x
);
1825 #ifdef ASM_OUTPUT_INT
1827 ASM_OUTPUT_INT (asm_out_file
, x
);
1831 #ifdef ASM_OUTPUT_DOUBLE_INT
1833 ASM_OUTPUT_DOUBLE_INT (asm_out_file
, x
);
1837 #ifdef ASM_OUTPUT_QUADRUPLE_INT
1839 ASM_OUTPUT_QUADRUPLE_INT (asm_out_file
, x
);
1844 /* If we couldn't do it that way, there are two other possibilities: First,
1845 if the machine can output an explicit byte and this is a 1 byte constant,
1846 we can use ASM_OUTPUT_BYTE. */
1848 #ifdef ASM_OUTPUT_BYTE
1849 if (size
== 1 && GET_CODE (x
) == CONST_INT
)
1851 ASM_OUTPUT_BYTE (asm_out_file
, INTVAL (x
));
1856 /* Finally, if SIZE is larger than a single word, try to output the constant
1857 one word at a time. */
1859 if (size
> UNITS_PER_WORD
)
1862 enum machine_mode mode
1863 = mode_for_size (size
* BITS_PER_UNIT
, MODE_INT
, 0);
1866 for (i
= 0; i
< size
/ UNITS_PER_WORD
; i
++)
1868 word
= operand_subword (x
, i
, 0, mode
);
1873 if (! assemble_integer (word
, UNITS_PER_WORD
, 0))
1877 if (i
== size
/ UNITS_PER_WORD
)
1879 /* If we output at least one word and then could not finish,
1880 there is no valid way to continue. */
1891 /* Assemble the floating-point constant D into an object of size MODE. */
1892 struct assemble_real_args
1895 enum machine_mode mode
;
1902 struct assemble_real_args
*args
= (struct assemble_real_args
*) p
;
1903 REAL_VALUE_TYPE
*d
= args
->d
;
1904 enum machine_mode mode
= args
->mode
;
1908 #ifdef ASM_OUTPUT_BYTE_FLOAT
1910 ASM_OUTPUT_BYTE_FLOAT (asm_out_file
, *d
);
1913 #ifdef ASM_OUTPUT_SHORT_FLOAT
1915 ASM_OUTPUT_SHORT_FLOAT (asm_out_file
, *d
);
1918 #ifdef ASM_OUTPUT_THREE_QUARTER_FLOAT
1920 ASM_OUTPUT_THREE_QUARTER_FLOAT (asm_out_file
, *d
);
1923 #ifdef ASM_OUTPUT_FLOAT
1925 ASM_OUTPUT_FLOAT (asm_out_file
, *d
);
1929 #ifdef ASM_OUTPUT_DOUBLE
1931 ASM_OUTPUT_DOUBLE (asm_out_file
, *d
);
1935 #ifdef ASM_OUTPUT_LONG_DOUBLE
1938 ASM_OUTPUT_LONG_DOUBLE (asm_out_file
, *d
);
1948 assemble_real (d
, mode
)
1950 enum machine_mode mode
;
1952 struct assemble_real_args args
;
1956 if (do_float_handler (assemble_real_1
, (PTR
) &args
))
1959 internal_error ("floating point trap outputting a constant");
1962 /* Here we combine duplicate floating constants to make
1963 CONST_DOUBLE rtx's, and force those out to memory when necessary. */
1965 /* Return a CONST_DOUBLE or CONST_INT for a value specified as a pair of ints.
1966 For an integer, I0 is the low-order word and I1 is the high-order word.
1967 For a real number, I0 is the word with the low address
1968 and I1 is the word with the high address. */
1971 immed_double_const (i0
, i1
, mode
)
1972 HOST_WIDE_INT i0
, i1
;
1973 enum machine_mode mode
;
1977 if (GET_MODE_CLASS (mode
) == MODE_INT
1978 || GET_MODE_CLASS (mode
) == MODE_PARTIAL_INT
)
1980 /* We clear out all bits that don't belong in MODE, unless they and our
1981 sign bit are all one. So we get either a reasonable negative value
1982 or a reasonable unsigned value for this mode. */
1983 int width
= GET_MODE_BITSIZE (mode
);
1984 if (width
< HOST_BITS_PER_WIDE_INT
1985 && ((i0
& ((HOST_WIDE_INT
) (-1) << (width
- 1)))
1986 != ((HOST_WIDE_INT
) (-1) << (width
- 1))))
1987 i0
&= ((HOST_WIDE_INT
) 1 << width
) - 1, i1
= 0;
1988 else if (width
== HOST_BITS_PER_WIDE_INT
1989 && ! (i1
== ~0 && i0
< 0))
1991 else if (width
> 2 * HOST_BITS_PER_WIDE_INT
)
1992 /* We cannot represent this value as a constant. */
1995 /* If this would be an entire word for the target, but is not for
1996 the host, then sign-extend on the host so that the number will look
1997 the same way on the host that it would on the target.
1999 For example, when building a 64 bit alpha hosted 32 bit sparc
2000 targeted compiler, then we want the 32 bit unsigned value -1 to be
2001 represented as a 64 bit value -1, and not as 0x00000000ffffffff.
2002 The later confuses the sparc backend. */
2004 if (width
< HOST_BITS_PER_WIDE_INT
2005 && (i0
& ((HOST_WIDE_INT
) 1 << (width
- 1))))
2006 i0
|= ((HOST_WIDE_INT
) (-1) << width
);
2008 /* If MODE fits within HOST_BITS_PER_WIDE_INT, always use a CONST_INT.
2010 ??? Strictly speaking, this is wrong if we create a CONST_INT
2011 for a large unsigned constant with the size of MODE being
2012 HOST_BITS_PER_WIDE_INT and later try to interpret that constant in a
2013 wider mode. In that case we will mis-interpret it as a negative
2016 Unfortunately, the only alternative is to make a CONST_DOUBLE
2017 for any constant in any mode if it is an unsigned constant larger
2018 than the maximum signed integer in an int on the host. However,
2019 doing this will break everyone that always expects to see a CONST_INT
2020 for SImode and smaller.
2022 We have always been making CONST_INTs in this case, so nothing new
2025 if (width
<= HOST_BITS_PER_WIDE_INT
)
2026 i1
= (i0
< 0) ? ~(HOST_WIDE_INT
) 0 : 0;
2028 /* If this integer fits in one word, return a CONST_INT. */
2029 if ((i1
== 0 && i0
>= 0)
2030 || (i1
== ~0 && i0
< 0))
2031 return GEN_INT (i0
);
2033 /* We use VOIDmode for integers. */
2037 /* Search the chain for an existing CONST_DOUBLE with the right value.
2038 If one is found, return it. */
2040 for (r
= const_double_chain
; r
; r
= CONST_DOUBLE_CHAIN (r
))
2041 if (CONST_DOUBLE_LOW (r
) == i0
&& CONST_DOUBLE_HIGH (r
) == i1
2042 && GET_MODE (r
) == mode
)
2045 /* No; make a new one and add it to the chain. */
2046 r
= gen_rtx_CONST_DOUBLE (mode
, const0_rtx
, i0
, i1
);
2048 /* Don't touch const_double_chain if not inside any function. */
2049 if (current_function_decl
!= 0)
2051 CONST_DOUBLE_CHAIN (r
) = const_double_chain
;
2052 const_double_chain
= r
;
2058 /* Return a CONST_DOUBLE for a specified `double' value
2059 and machine mode. */
2062 immed_real_const_1 (d
, mode
)
2064 enum machine_mode mode
;
2066 union real_extract u
;
2069 /* Get the desired `double' value as a sequence of ints
2070 since that is how they are stored in a CONST_DOUBLE. */
2074 /* Detect special cases. */
2075 if (REAL_VALUES_IDENTICAL (dconst0
, d
))
2076 return CONST0_RTX (mode
);
2078 /* Check for NaN first, because some ports (specifically the i386) do not
2079 emit correct ieee-fp code by default, and thus will generate a core
2080 dump here if we pass a NaN to REAL_VALUES_EQUAL and if REAL_VALUES_EQUAL
2081 does a floating point comparison. */
2082 else if (! REAL_VALUE_ISNAN (d
) && REAL_VALUES_EQUAL (dconst1
, d
))
2083 return CONST1_RTX (mode
);
2085 if (sizeof u
== sizeof (HOST_WIDE_INT
))
2086 return immed_double_const (u
.i
[0], 0, mode
);
2087 if (sizeof u
== 2 * sizeof (HOST_WIDE_INT
))
2088 return immed_double_const (u
.i
[0], u
.i
[1], mode
);
2090 /* The rest of this function handles the case where
2091 a float value requires more than 2 ints of space.
2092 It will be deleted as dead code on machines that don't need it. */
2094 /* Search the chain for an existing CONST_DOUBLE with the right value.
2095 If one is found, return it. */
2097 for (r
= const_double_chain
; r
; r
= CONST_DOUBLE_CHAIN (r
))
2098 if (! memcmp ((char *) &CONST_DOUBLE_LOW (r
), (char *) &u
, sizeof u
)
2099 && GET_MODE (r
) == mode
)
2102 /* No; make a new one and add it to the chain.
2104 We may be called by an optimizer which may be discarding any memory
2105 allocated during its processing (such as combine and loop). However,
2106 we will be leaving this constant on the chain, so we cannot tolerate
2108 r
= rtx_alloc (CONST_DOUBLE
);
2110 memcpy ((char *) &CONST_DOUBLE_LOW (r
), (char *) &u
, sizeof u
);
2112 /* If we aren't inside a function, don't put r on the
2113 const_double_chain. */
2114 if (current_function_decl
!= 0)
2116 CONST_DOUBLE_CHAIN (r
) = const_double_chain
;
2117 const_double_chain
= r
;
2120 CONST_DOUBLE_CHAIN (r
) = NULL_RTX
;
2122 /* Store const0_rtx in CONST_DOUBLE_MEM since this CONST_DOUBLE is on the
2123 chain, but has not been allocated memory. Actual use of CONST_DOUBLE_MEM
2124 is only through force_const_mem. */
2126 CONST_DOUBLE_MEM (r
) = const0_rtx
;
2131 /* Return a CONST_DOUBLE rtx for a value specified by EXP,
2132 which must be a REAL_CST tree node. */
2135 immed_real_const (exp
)
2138 return immed_real_const_1 (TREE_REAL_CST (exp
), TYPE_MODE (TREE_TYPE (exp
)));
2141 /* At the end of a function, forget the memory-constants
2142 previously made for CONST_DOUBLEs. Mark them as not on real_constant_chain.
2143 Also clear out real_constant_chain and clear out all the chain-pointers. */
2146 clear_const_double_mem ()
2148 register rtx r
, next
;
2149 enum machine_mode mode
;
2152 for (r
= const_double_chain
; r
; r
= next
)
2154 next
= CONST_DOUBLE_CHAIN (r
);
2155 CONST_DOUBLE_CHAIN (r
) = 0;
2156 CONST_DOUBLE_MEM (r
) = cc0_rtx
;
2158 const_double_chain
= 0;
2160 for (i
= 0; i
<= 2; i
++)
2161 for (mode
= GET_CLASS_NARROWEST_MODE (MODE_FLOAT
); mode
!= VOIDmode
;
2162 mode
= GET_MODE_WIDER_MODE (mode
))
2164 r
= const_tiny_rtx
[i
][(int) mode
];
2165 CONST_DOUBLE_CHAIN (r
) = 0;
2166 CONST_DOUBLE_MEM (r
) = cc0_rtx
;
2170 /* Given an expression EXP with a constant value,
2171 reduce it to the sum of an assembler symbol and an integer.
2172 Store them both in the structure *VALUE.
2173 Abort if EXP does not reduce. */
2178 HOST_WIDE_INT offset
;
2182 decode_addr_const (exp
, value
)
2184 struct addr_const
*value
;
2186 register tree target
= TREE_OPERAND (exp
, 0);
2187 register int offset
= 0;
2192 if (TREE_CODE (target
) == COMPONENT_REF
2193 && host_integerp (byte_position (TREE_OPERAND (target
, 1)), 0))
2196 offset
+= int_byte_position (TREE_OPERAND (target
, 1));
2197 target
= TREE_OPERAND (target
, 0);
2199 else if (TREE_CODE (target
) == ARRAY_REF
2200 || TREE_CODE (target
) == ARRAY_RANGE_REF
)
2202 offset
+= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (target
)), 1)
2203 * tree_low_cst (TREE_OPERAND (target
, 1), 0));
2204 target
= TREE_OPERAND (target
, 0);
2210 switch (TREE_CODE (target
))
2214 x
= DECL_RTL (target
);
2218 x
= gen_rtx_MEM (FUNCTION_MODE
,
2219 gen_rtx_LABEL_REF (VOIDmode
,
2220 label_rtx (TREE_OPERAND (exp
, 0))));
2228 x
= TREE_CST_RTL (target
);
2235 if (GET_CODE (x
) != MEM
)
2240 value
->offset
= offset
;
2243 enum kind
{ RTX_DOUBLE
, RTX_INT
};
2246 ENUM_BITFIELD(kind
) kind
: 16;
2247 ENUM_BITFIELD(machine_mode
) mode
: 16;
2249 union real_extract du
;
2250 struct addr_const addr
;
2251 struct {HOST_WIDE_INT high
, low
;} di
;
2255 /* Uniquize all constants that appear in memory.
2256 Each constant in memory thus far output is recorded
2257 in `const_hash_table' with a `struct constant_descriptor'
2258 that contains a polish representation of the value of
2261 We cannot store the trees in the hash table
2262 because the trees may be temporary. */
2264 struct constant_descriptor
2266 struct constant_descriptor
*next
;
2269 /* Make sure the data is reasonably aligned. */
2272 unsigned char contents
[1];
2273 #ifdef HAVE_LONG_DOUBLE
2282 #define MAX_HASH_TABLE 1009
2283 static struct constant_descriptor
*const_hash_table
[MAX_HASH_TABLE
];
2285 #define STRHASH(x) ((hashval_t)((long)(x) >> 3))
2287 struct deferred_string
2294 static htab_t const_str_htab
;
2296 /* Mark a const_hash_table descriptor for GC. */
2299 mark_const_hash_entry (ptr
)
2302 struct constant_descriptor
*desc
= * (struct constant_descriptor
**) ptr
;
2306 ggc_mark_rtx (desc
->rtl
);
2311 /* Mark the hash-table element X (which is really a pointer to an
2312 struct deferred_string *). */
2315 mark_const_str_htab_1 (x
, data
)
2317 void *data ATTRIBUTE_UNUSED
;
2319 ggc_mark_tree (((struct deferred_string
*) *x
)->exp
);
2323 /* Mark a const_str_htab for GC. */
2326 mark_const_str_htab (htab
)
2329 htab_traverse (*((htab_t
*) htab
), mark_const_str_htab_1
, NULL
);
2332 /* Returns a hash code for X (which is a really a
2333 struct deferred_string *). */
2336 const_str_htab_hash (x
)
2339 return STRHASH (((const struct deferred_string
*) x
)->label
);
2342 /* Returns non-zero if the value represented by X (which is really a
2343 struct deferred_string *) is the same as that given by Y
2344 (which is really a char *). */
2347 const_str_htab_eq (x
, y
)
2351 return (((const struct deferred_string
*) x
)->label
== (const char *) y
);
2354 /* Delete the hash table entry dfsp. */
2357 const_str_htab_del (dfsp
)
2363 /* Compute a hash code for a constant expression. */
2369 register const char *p
;
2370 register int len
, hi
, i
;
2371 register enum tree_code code
= TREE_CODE (exp
);
2373 /* Either set P and LEN to the address and len of something to hash and
2374 exit the switch or return a value. */
2379 p
= (char *) &TREE_INT_CST (exp
);
2380 len
= sizeof TREE_INT_CST (exp
);
2384 p
= (char *) &TREE_REAL_CST (exp
);
2385 len
= sizeof TREE_REAL_CST (exp
);
2389 p
= TREE_STRING_POINTER (exp
);
2390 len
= TREE_STRING_LENGTH (exp
);
2394 return (const_hash (TREE_REALPART (exp
)) * 5
2395 + const_hash (TREE_IMAGPART (exp
)));
2398 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2402 len
= int_size_in_bytes (TREE_TYPE (exp
));
2403 tmp
= (char *) alloca (len
);
2404 get_set_constructor_bytes (exp
, (unsigned char *) tmp
, len
);
2412 /* For record type, include the type in the hashing.
2413 We do not do so for array types
2414 because (1) the sizes of the elements are sufficient
2415 and (2) distinct array types can have the same constructor.
2416 Instead, we include the array size because the constructor could
2418 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2419 hi
= ((unsigned long) TREE_TYPE (exp
) & ((1 << HASHBITS
) - 1))
2422 hi
= ((5 + int_size_in_bytes (TREE_TYPE (exp
)))
2423 & ((1 << HASHBITS
) - 1)) % MAX_HASH_TABLE
;
2425 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2426 if (TREE_VALUE (link
))
2428 = (hi
* 603 + const_hash (TREE_VALUE (link
))) % MAX_HASH_TABLE
;
2435 struct addr_const value
;
2437 decode_addr_const (exp
, &value
);
2438 if (GET_CODE (value
.base
) == SYMBOL_REF
)
2440 /* Don't hash the address of the SYMBOL_REF;
2441 only use the offset and the symbol name. */
2443 p
= XSTR (value
.base
, 0);
2444 for (i
= 0; p
[i
] != 0; i
++)
2445 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2447 else if (GET_CODE (value
.base
) == LABEL_REF
)
2448 hi
= value
.offset
+ CODE_LABEL_NUMBER (XEXP (value
.base
, 0)) * 13;
2452 hi
&= (1 << HASHBITS
) - 1;
2453 hi
%= MAX_HASH_TABLE
;
2459 return (const_hash (TREE_OPERAND (exp
, 0)) * 9
2460 + const_hash (TREE_OPERAND (exp
, 1)));
2464 case NON_LVALUE_EXPR
:
2465 return const_hash (TREE_OPERAND (exp
, 0)) * 7 + 2;
2468 /* A language specific constant. Just hash the code. */
2469 return (int) code
% MAX_HASH_TABLE
;
2472 /* Compute hashing function */
2474 for (i
= 0; i
< len
; i
++)
2475 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2477 hi
&= (1 << HASHBITS
) - 1;
2478 hi
%= MAX_HASH_TABLE
;
2482 /* Compare a constant expression EXP with a constant-descriptor DESC.
2483 Return 1 if DESC describes a constant with the same value as EXP. */
2486 compare_constant (exp
, desc
)
2488 struct constant_descriptor
*desc
;
2490 return 0 != compare_constant_1 (exp
, desc
->u
.contents
);
2493 /* Compare constant expression EXP with a substring P of a constant descriptor.
2494 If they match, return a pointer to the end of the substring matched.
2495 If they do not match, return 0.
2497 Since descriptors are written in polish prefix notation,
2498 this function can be used recursively to test one operand of EXP
2499 against a subdescriptor, and if it succeeds it returns the
2500 address of the subdescriptor for the next operand. */
2502 static const unsigned char *
2503 compare_constant_1 (exp
, p
)
2505 const unsigned char *p
;
2507 register const unsigned char *strp
;
2509 register enum tree_code code
= TREE_CODE (exp
);
2511 if (code
!= (enum tree_code
) *p
++)
2514 /* Either set STRP, P and LEN to pointers and length to compare and exit the
2515 switch, or return the result of the comparison. */
2520 /* Integer constants are the same only if the same width of type. */
2521 if (*p
++ != TYPE_PRECISION (TREE_TYPE (exp
)))
2524 strp
= (unsigned char *) &TREE_INT_CST (exp
);
2525 len
= sizeof TREE_INT_CST (exp
);
2529 /* Real constants are the same only if the same width of type. */
2530 if (*p
++ != TYPE_PRECISION (TREE_TYPE (exp
)))
2533 strp
= (unsigned char *) &TREE_REAL_CST (exp
);
2534 len
= sizeof TREE_REAL_CST (exp
);
2538 if (flag_writable_strings
)
2541 if ((enum machine_mode
) *p
++ != TYPE_MODE (TREE_TYPE (exp
)))
2544 strp
= (const unsigned char *)TREE_STRING_POINTER (exp
);
2545 len
= TREE_STRING_LENGTH (exp
);
2546 if (memcmp ((char *) &TREE_STRING_LENGTH (exp
), p
,
2547 sizeof TREE_STRING_LENGTH (exp
)))
2550 p
+= sizeof TREE_STRING_LENGTH (exp
);
2554 p
= compare_constant_1 (TREE_REALPART (exp
), p
);
2558 return compare_constant_1 (TREE_IMAGPART (exp
), p
);
2561 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2563 int xlen
= len
= int_size_in_bytes (TREE_TYPE (exp
));
2564 unsigned char *tmp
= (unsigned char *) alloca (len
);
2566 get_set_constructor_bytes (exp
, tmp
, len
);
2567 strp
= (unsigned char *) tmp
;
2568 if (memcmp ((char *) &xlen
, p
, sizeof xlen
))
2577 int length
= list_length (CONSTRUCTOR_ELTS (exp
));
2579 enum machine_mode mode
= TYPE_MODE (TREE_TYPE (exp
));
2580 int have_purpose
= 0;
2582 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2583 if (TREE_PURPOSE (link
))
2586 if (memcmp ((char *) &length
, p
, sizeof length
))
2591 /* For record constructors, insist that the types match.
2592 For arrays, just verify both constructors are for arrays.
2593 Then insist that either both or none have any TREE_PURPOSE
2595 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2596 type
= TREE_TYPE (exp
);
2600 if (memcmp ((char *) &type
, p
, sizeof type
))
2603 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2605 if (memcmp ((char *) &mode
, p
, sizeof mode
))
2613 if (memcmp ((char *) &have_purpose
, p
, sizeof have_purpose
))
2616 p
+= sizeof have_purpose
;
2618 /* For arrays, insist that the size in bytes match. */
2619 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2621 HOST_WIDE_INT size
= int_size_in_bytes (TREE_TYPE (exp
));
2623 if (memcmp ((char *) &size
, p
, sizeof size
))
2629 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2631 if (TREE_VALUE (link
))
2633 if ((p
= compare_constant_1 (TREE_VALUE (link
), p
)) == 0)
2640 if (memcmp ((char *) &zero
, p
, sizeof zero
))
2646 if (TREE_PURPOSE (link
)
2647 && TREE_CODE (TREE_PURPOSE (link
)) == FIELD_DECL
)
2649 if (memcmp ((char *) &TREE_PURPOSE (link
), p
,
2650 sizeof TREE_PURPOSE (link
)))
2653 p
+= sizeof TREE_PURPOSE (link
);
2655 else if (TREE_PURPOSE (link
))
2657 if ((p
= compare_constant_1 (TREE_PURPOSE (link
), p
)) == 0)
2660 else if (have_purpose
)
2664 if (memcmp ((char *) &zero
, p
, sizeof zero
))
2676 struct addr_const value
;
2678 decode_addr_const (exp
, &value
);
2679 strp
= (unsigned char *) &value
.offset
;
2680 len
= sizeof value
.offset
;
2681 /* Compare the offset. */
2683 if (*p
++ != *strp
++)
2686 /* Compare symbol name. */
2687 strp
= (const unsigned char *) XSTR (value
.base
, 0);
2688 len
= strlen ((const char *) strp
) + 1;
2695 p
= compare_constant_1 (TREE_OPERAND (exp
, 0), p
);
2699 return compare_constant_1 (TREE_OPERAND (exp
, 1), p
);
2703 case NON_LVALUE_EXPR
:
2704 return compare_constant_1 (TREE_OPERAND (exp
, 0), p
);
2707 if (lang_expand_constant
)
2709 exp
= (*lang_expand_constant
) (exp
);
2710 return compare_constant_1 (exp
, p
);
2715 /* Compare constant contents. */
2717 if (*p
++ != *strp
++)
2723 /* Construct a constant descriptor for the expression EXP.
2724 It is up to the caller to enter the descriptor in the hash table. */
2726 static struct constant_descriptor
*
2727 record_constant (exp
)
2730 struct constant_descriptor
*next
= 0;
2735 /* Make a struct constant_descriptor. The first three pointers will
2736 be filled in later. Here we just leave space for them. */
2738 obstack_grow (&permanent_obstack
, (char *) &next
, sizeof next
);
2739 obstack_grow (&permanent_obstack
, (char *) &label
, sizeof label
);
2740 obstack_grow (&permanent_obstack
, (char *) &rtl
, sizeof rtl
);
2742 /* Align the descriptor for the data payload. */
2743 pad
= (offsetof (struct constant_descriptor
, u
)
2744 - offsetof(struct constant_descriptor
, rtl
)
2745 - sizeof(next
->rtl
));
2747 obstack_blank (&permanent_obstack
, pad
);
2749 record_constant_1 (exp
);
2750 return (struct constant_descriptor
*) obstack_finish (&permanent_obstack
);
2753 /* Add a description of constant expression EXP
2754 to the object growing in `permanent_obstack'.
2755 No need to return its address; the caller will get that
2756 from the obstack when the object is complete. */
2759 record_constant_1 (exp
)
2762 register const unsigned char *strp
;
2764 register enum tree_code code
= TREE_CODE (exp
);
2766 obstack_1grow (&permanent_obstack
, (unsigned int) code
);
2771 obstack_1grow (&permanent_obstack
, TYPE_PRECISION (TREE_TYPE (exp
)));
2772 strp
= (unsigned char *) &TREE_INT_CST (exp
);
2773 len
= sizeof TREE_INT_CST (exp
);
2777 obstack_1grow (&permanent_obstack
, TYPE_PRECISION (TREE_TYPE (exp
)));
2778 strp
= (unsigned char *) &TREE_REAL_CST (exp
);
2779 len
= sizeof TREE_REAL_CST (exp
);
2783 if (flag_writable_strings
)
2786 obstack_1grow (&permanent_obstack
, TYPE_MODE (TREE_TYPE (exp
)));
2787 strp
= (const unsigned char *) TREE_STRING_POINTER (exp
);
2788 len
= TREE_STRING_LENGTH (exp
);
2789 obstack_grow (&permanent_obstack
, (char *) &TREE_STRING_LENGTH (exp
),
2790 sizeof TREE_STRING_LENGTH (exp
));
2794 record_constant_1 (TREE_REALPART (exp
));
2795 record_constant_1 (TREE_IMAGPART (exp
));
2799 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2801 int nbytes
= int_size_in_bytes (TREE_TYPE (exp
));
2802 obstack_grow (&permanent_obstack
, &nbytes
, sizeof (nbytes
));
2803 obstack_blank (&permanent_obstack
, nbytes
);
2804 get_set_constructor_bytes
2805 (exp
, (unsigned char *) permanent_obstack
.next_free
-nbytes
,
2812 int length
= list_length (CONSTRUCTOR_ELTS (exp
));
2813 enum machine_mode mode
= TYPE_MODE (TREE_TYPE (exp
));
2815 int have_purpose
= 0;
2817 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2818 if (TREE_PURPOSE (link
))
2821 obstack_grow (&permanent_obstack
, (char *) &length
, sizeof length
);
2823 /* For record constructors, insist that the types match.
2824 For arrays, just verify both constructors are for arrays
2825 of the same mode. Then insist that either both or none
2826 have any TREE_PURPOSE values. */
2827 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2828 type
= TREE_TYPE (exp
);
2832 obstack_grow (&permanent_obstack
, (char *) &type
, sizeof type
);
2833 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2834 obstack_grow (&permanent_obstack
, &mode
, sizeof mode
);
2836 obstack_grow (&permanent_obstack
, (char *) &have_purpose
,
2837 sizeof have_purpose
);
2839 /* For arrays, insist that the size in bytes match. */
2840 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2842 HOST_WIDE_INT size
= int_size_in_bytes (TREE_TYPE (exp
));
2843 obstack_grow (&permanent_obstack
, (char *) &size
, sizeof size
);
2846 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2848 if (TREE_VALUE (link
))
2849 record_constant_1 (TREE_VALUE (link
));
2854 obstack_grow (&permanent_obstack
,
2855 (char *) &zero
, sizeof zero
);
2858 if (TREE_PURPOSE (link
)
2859 && TREE_CODE (TREE_PURPOSE (link
)) == FIELD_DECL
)
2860 obstack_grow (&permanent_obstack
,
2861 (char *) &TREE_PURPOSE (link
),
2862 sizeof TREE_PURPOSE (link
));
2863 else if (TREE_PURPOSE (link
))
2864 record_constant_1 (TREE_PURPOSE (link
));
2865 else if (have_purpose
)
2869 obstack_grow (&permanent_obstack
,
2870 (char *) &zero
, sizeof zero
);
2878 struct addr_const value
;
2880 decode_addr_const (exp
, &value
);
2881 /* Record the offset. */
2882 obstack_grow (&permanent_obstack
,
2883 (char *) &value
.offset
, sizeof value
.offset
);
2885 switch (GET_CODE (value
.base
))
2888 /* Record the symbol name. */
2889 obstack_grow (&permanent_obstack
, XSTR (value
.base
, 0),
2890 strlen (XSTR (value
.base
, 0)) + 1);
2893 /* Record the address of the CODE_LABEL. It may not have
2894 been emitted yet, so it's UID may be zero. But pointer
2895 identity is good enough. */
2896 obstack_grow (&permanent_obstack
, &XEXP (value
.base
, 0),
2908 record_constant_1 (TREE_OPERAND (exp
, 0));
2909 record_constant_1 (TREE_OPERAND (exp
, 1));
2914 case NON_LVALUE_EXPR
:
2915 record_constant_1 (TREE_OPERAND (exp
, 0));
2919 if (lang_expand_constant
)
2921 exp
= (*lang_expand_constant
) (exp
);
2922 record_constant_1 (exp
);
2927 /* Record constant contents. */
2928 obstack_grow (&permanent_obstack
, strp
, len
);
2931 /* Record a list of constant expressions that were passed to
2932 output_constant_def but that could not be output right away. */
2934 struct deferred_constant
2936 struct deferred_constant
*next
;
2942 static struct deferred_constant
*deferred_constants
;
2944 /* Another list of constants which should be output after the
2946 static struct deferred_constant
*after_function_constants
;
2948 /* Nonzero means defer output of addressed subconstants
2949 (i.e., those for which output_constant_def is called.) */
2950 static int defer_addressed_constants_flag
;
2952 /* Start deferring output of subconstants. */
2955 defer_addressed_constants ()
2957 defer_addressed_constants_flag
++;
2960 /* Stop deferring output of subconstants,
2961 and output now all those that have been deferred. */
2964 output_deferred_addressed_constants ()
2966 struct deferred_constant
*p
, *next
;
2968 defer_addressed_constants_flag
--;
2970 if (defer_addressed_constants_flag
> 0)
2973 for (p
= deferred_constants
; p
; p
= next
)
2975 output_constant_def_contents (p
->exp
, p
->reloc
, p
->labelno
);
2980 deferred_constants
= 0;
2983 /* Output any constants which should appear after a function. */
2986 output_after_function_constants ()
2988 struct deferred_constant
*p
, *next
;
2990 for (p
= after_function_constants
; p
; p
= next
)
2992 output_constant_def_contents (p
->exp
, p
->reloc
, p
->labelno
);
2997 after_function_constants
= 0;
3000 /* Make a copy of the whole tree structure for a constant.
3001 This handles the same types of nodes that compare_constant
3002 and record_constant handle. */
3008 switch (TREE_CODE (exp
))
3011 /* For ADDR_EXPR, we do not want to copy the decl whose address
3012 is requested. We do want to copy constants though. */
3013 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, 0))) == 'c')
3014 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
3015 copy_constant (TREE_OPERAND (exp
, 0)));
3017 return copy_node (exp
);
3022 return copy_node (exp
);
3025 return build_complex (TREE_TYPE (exp
),
3026 copy_constant (TREE_REALPART (exp
)),
3027 copy_constant (TREE_IMAGPART (exp
)));
3031 return build (TREE_CODE (exp
), TREE_TYPE (exp
),
3032 copy_constant (TREE_OPERAND (exp
, 0)),
3033 copy_constant (TREE_OPERAND (exp
, 1)));
3037 case NON_LVALUE_EXPR
:
3038 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
3039 copy_constant (TREE_OPERAND (exp
, 0)));
3043 tree copy
= copy_node (exp
);
3044 tree list
= copy_list (CONSTRUCTOR_ELTS (exp
));
3047 CONSTRUCTOR_ELTS (copy
) = list
;
3048 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
3049 TREE_VALUE (tail
) = copy_constant (TREE_VALUE (tail
));
3050 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
3051 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
3052 TREE_PURPOSE (tail
) = copy_constant (TREE_PURPOSE (tail
));
3062 /* Return an rtx representing a reference to constant data in memory
3063 for the constant expression EXP.
3065 If assembler code for such a constant has already been output,
3066 return an rtx to refer to it.
3067 Otherwise, output such a constant in memory (or defer it for later)
3068 and generate an rtx for it.
3070 If DEFER is non-zero, the output of string constants can be deferred
3071 and output only if referenced in the function after all optimizations.
3073 The TREE_CST_RTL of EXP is set up to point to that rtx.
3074 The const_hash_table records which constants already have label strings. */
3077 output_constant_def (exp
, defer
)
3082 register struct constant_descriptor
*desc
;
3083 struct deferred_string
**defstr
;
3087 int after_function
= 0;
3090 if (TREE_CST_RTL (exp
))
3091 return TREE_CST_RTL (exp
);
3093 /* Make sure any other constants whose addresses appear in EXP
3094 are assigned label numbers. */
3096 reloc
= output_addressed_constants (exp
);
3098 /* Compute hash code of EXP. Search the descriptors for that hash code
3099 to see if any of them describes EXP. If yes, the descriptor records
3100 the label number already assigned. */
3102 hash
= const_hash (exp
) % MAX_HASH_TABLE
;
3104 for (desc
= const_hash_table
[hash
]; desc
; desc
= desc
->next
)
3105 if (compare_constant (exp
, desc
))
3110 /* No constant equal to EXP is known to have been output.
3111 Make a constant descriptor to enter EXP in the hash table.
3112 Assign the label number and record it in the descriptor for
3113 future calls to this function to find. */
3115 /* Create a string containing the label name, in LABEL. */
3116 labelno
= const_labelno
++;
3117 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", labelno
);
3119 desc
= record_constant (exp
);
3120 desc
->next
= const_hash_table
[hash
];
3121 desc
->label
= ggc_strdup (label
);
3122 const_hash_table
[hash
] = desc
;
3124 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
3126 = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp
)),
3127 gen_rtx_SYMBOL_REF (Pmode
, desc
->label
));
3129 set_mem_attributes (desc
->rtl
, exp
, 1);
3134 TREE_CST_RTL (exp
) = desc
->rtl
;
3136 /* Optionally set flags or add text to the name to record information
3137 such as that it is a function name. If the name is changed, the macro
3138 ASM_OUTPUT_LABELREF will have to know how to strip this information. */
3139 #ifdef ENCODE_SECTION_INFO
3140 /* A previously-processed constant would already have section info
3144 ENCODE_SECTION_INFO (exp
);
3145 desc
->rtl
= TREE_CST_RTL (exp
);
3146 desc
->label
= XSTR (XEXP (desc
->rtl
, 0), 0);
3150 #ifdef CONSTANT_AFTER_FUNCTION_P
3151 if (current_function_decl
!= 0
3152 && CONSTANT_AFTER_FUNCTION_P (exp
))
3157 && STRING_POOL_ADDRESS_P (XEXP (desc
->rtl
, 0))
3158 && (!defer
|| defer_addressed_constants_flag
|| after_function
))
3160 defstr
= (struct deferred_string
**)
3161 htab_find_slot_with_hash (const_str_htab
, desc
->label
,
3162 STRHASH (desc
->label
), NO_INSERT
);
3165 /* If the string is currently deferred but we need to output it now,
3166 remove it from deferred string hash table. */
3168 labelno
= (*defstr
)->labelno
;
3169 STRING_POOL_ADDRESS_P (XEXP (desc
->rtl
, 0)) = 0;
3170 htab_clear_slot (const_str_htab
, (void **) defstr
);
3174 /* If this is the first time we've seen this particular constant,
3175 output it (or defer its output for later). */
3178 if (defer_addressed_constants_flag
|| after_function
)
3180 struct deferred_constant
*p
;
3181 p
= (struct deferred_constant
*) xmalloc (sizeof (struct deferred_constant
));
3183 p
->exp
= copy_constant (exp
);
3185 p
->labelno
= labelno
;
3188 p
->next
= after_function_constants
;
3189 after_function_constants
= p
;
3193 p
->next
= deferred_constants
;
3194 deferred_constants
= p
;
3199 /* Do no output if -fsyntax-only. */
3200 if (! flag_syntax_only
)
3202 if (TREE_CODE (exp
) != STRING_CST
3204 || flag_writable_strings
3205 || (defstr
= (struct deferred_string
**)
3206 htab_find_slot_with_hash (const_str_htab
,
3208 STRHASH (desc
->label
),
3210 output_constant_def_contents (exp
, reloc
, labelno
);
3213 struct deferred_string
*p
;
3215 p
= (struct deferred_string
*)
3216 xmalloc (sizeof (struct deferred_string
));
3218 p
->exp
= copy_constant (exp
);
3219 p
->label
= desc
->label
;
3220 p
->labelno
= labelno
;
3222 STRING_POOL_ADDRESS_P (XEXP (desc
->rtl
, 0)) = 1;
3228 return TREE_CST_RTL (exp
);
3231 /* Now output assembler code to define the label for EXP,
3232 and follow it with the data of EXP. */
3235 output_constant_def_contents (exp
, reloc
, labelno
)
3242 if (IN_NAMED_SECTION (exp
))
3243 named_section (exp
, NULL
, reloc
);
3246 /* First switch to text section, except for writable strings. */
3247 #ifdef SELECT_SECTION
3248 SELECT_SECTION (exp
, reloc
);
3250 if (((TREE_CODE (exp
) == STRING_CST
) && flag_writable_strings
)
3251 || (flag_pic
&& reloc
))
3254 readonly_data_section ();
3258 /* Align the location counter as required by EXP's data type. */
3259 align
= TYPE_ALIGN (TREE_TYPE (exp
));
3260 #ifdef CONSTANT_ALIGNMENT
3261 align
= CONSTANT_ALIGNMENT (exp
, align
);
3264 if (align
> BITS_PER_UNIT
)
3265 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
3267 /* Output the label itself. */
3268 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LC", labelno
);
3270 /* Output the value of EXP. */
3271 output_constant (exp
,
3272 (TREE_CODE (exp
) == STRING_CST
3273 ? MAX (TREE_STRING_LENGTH (exp
),
3274 int_size_in_bytes (TREE_TYPE (exp
)))
3275 : int_size_in_bytes (TREE_TYPE (exp
))));
3279 /* Structure to represent sufficient information about a constant so that
3280 it can be output when the constant pool is output, so that function
3281 integration can be done, and to simplify handling on machines that reference
3282 constant pool as base+displacement. */
3284 struct pool_constant
3286 struct constant_descriptor
*desc
;
3287 struct pool_constant
*next
, *next_sym
;
3290 enum machine_mode mode
;
3297 /* Hash code for a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true.
3298 The argument is XSTR (... , 0) */
3300 #define SYMHASH(LABEL) \
3301 ((((unsigned long) (LABEL)) & ((1 << HASHBITS) - 1)) % MAX_RTX_HASH_TABLE)
3303 /* Initialize constant pool hashing for a new function. */
3306 init_varasm_status (f
)
3309 struct varasm_status
*p
;
3310 p
= (struct varasm_status
*) xmalloc (sizeof (struct varasm_status
));
3312 p
->x_const_rtx_hash_table
3313 = ((struct constant_descriptor
**)
3314 xcalloc (MAX_RTX_HASH_TABLE
, sizeof (struct constant_descriptor
*)));
3315 p
->x_const_rtx_sym_hash_table
3316 = ((struct pool_constant
**)
3317 xcalloc (MAX_RTX_HASH_TABLE
, sizeof (struct pool_constant
*)));
3319 p
->x_first_pool
= p
->x_last_pool
= 0;
3320 p
->x_pool_offset
= 0;
3321 p
->x_const_double_chain
= 0;
3324 /* Mark PC for GC. */
3327 mark_pool_constant (pc
)
3328 struct pool_constant
*pc
;
3333 ggc_mark_rtx (pc
->constant
);
3338 /* Mark P for GC. */
3341 mark_varasm_status (p
)
3342 struct varasm_status
*p
;
3347 mark_pool_constant (p
->x_first_pool
);
3348 ggc_mark_rtx (p
->x_const_double_chain
);
3351 /* Clear out all parts of the state in F that can safely be discarded
3352 after the function has been compiled, to let garbage collection
3353 reclaim the memory. */
3356 free_varasm_status (f
)
3359 struct varasm_status
*p
;
3364 /* Clear out the hash tables. */
3365 for (i
= 0; i
< MAX_RTX_HASH_TABLE
; ++i
)
3367 struct constant_descriptor
* cd
;
3369 cd
= p
->x_const_rtx_hash_table
[i
];
3371 struct constant_descriptor
* next
= cd
->next
;
3377 free (p
->x_const_rtx_hash_table
);
3378 free (p
->x_const_rtx_sym_hash_table
);
3384 /* Express an rtx for a constant integer (perhaps symbolic)
3385 as the sum of a symbol or label plus an explicit integer.
3386 They are stored into VALUE. */
3389 decode_rtx_const (mode
, x
, value
)
3390 enum machine_mode mode
;
3392 struct rtx_const
*value
;
3394 /* Clear the whole structure, including any gaps. */
3395 memset (value
, 0, sizeof (struct rtx_const
));
3397 value
->kind
= RTX_INT
; /* Most usual kind. */
3400 switch (GET_CODE (x
))
3403 value
->kind
= RTX_DOUBLE
;
3404 if (GET_MODE (x
) != VOIDmode
)
3406 value
->mode
= GET_MODE (x
);
3407 memcpy ((char *) &value
->un
.du
,
3408 (char *) &CONST_DOUBLE_LOW (x
), sizeof value
->un
.du
);
3412 value
->un
.di
.low
= CONST_DOUBLE_LOW (x
);
3413 value
->un
.di
.high
= CONST_DOUBLE_HIGH (x
);
3418 value
->un
.addr
.offset
= INTVAL (x
);
3424 value
->un
.addr
.base
= x
;
3429 if (GET_CODE (x
) == PLUS
&& GET_CODE (XEXP (x
, 1)) == CONST_INT
)
3431 value
->un
.addr
.base
= XEXP (x
, 0);
3432 value
->un
.addr
.offset
= INTVAL (XEXP (x
, 1));
3434 else if (GET_CODE (x
) == MINUS
&& GET_CODE (XEXP (x
, 1)) == CONST_INT
)
3436 value
->un
.addr
.base
= XEXP (x
, 0);
3437 value
->un
.addr
.offset
= - INTVAL (XEXP (x
, 1));
3441 value
->un
.addr
.base
= x
;
3442 value
->un
.addr
.offset
= 0;
3450 if (value
->kind
== RTX_INT
&& value
->un
.addr
.base
!= 0)
3451 switch (GET_CODE (value
->un
.addr
.base
))
3454 /* Use the string's address, not the SYMBOL_REF's address,
3455 for the sake of addresses of library routines. */
3456 value
->un
.addr
.base
= (rtx
) XSTR (value
->un
.addr
.base
, 0);
3460 /* For a LABEL_REF, compare labels. */
3461 value
->un
.addr
.base
= XEXP (value
->un
.addr
.base
, 0);
3468 /* Given a MINUS expression, simplify it if both sides
3469 include the same symbol. */
3472 simplify_subtraction (x
)
3475 struct rtx_const val0
, val1
;
3477 decode_rtx_const (GET_MODE (x
), XEXP (x
, 0), &val0
);
3478 decode_rtx_const (GET_MODE (x
), XEXP (x
, 1), &val1
);
3480 if (val0
.un
.addr
.base
== val1
.un
.addr
.base
)
3481 return GEN_INT (val0
.un
.addr
.offset
- val1
.un
.addr
.offset
);
3485 /* Compute a hash code for a constant RTL expression. */
3488 const_hash_rtx (mode
, x
)
3489 enum machine_mode mode
;
3495 struct rtx_const value
;
3496 decode_rtx_const (mode
, x
, &value
);
3498 /* Compute hashing function */
3500 for (i
= 0; i
< sizeof value
/ sizeof (int); i
++)
3501 hi
+= ((int *) &value
)[i
];
3503 hi
&= (1 << HASHBITS
) - 1;
3504 hi
%= MAX_RTX_HASH_TABLE
;
3508 /* Compare a constant rtl object X with a constant-descriptor DESC.
3509 Return 1 if DESC describes a constant with the same value as X. */
3512 compare_constant_rtx (mode
, x
, desc
)
3513 enum machine_mode mode
;
3515 struct constant_descriptor
*desc
;
3517 register int *p
= (int *) desc
->u
.contents
;
3520 struct rtx_const value
;
3522 decode_rtx_const (mode
, x
, &value
);
3523 strp
= (int *) &value
;
3524 len
= sizeof value
/ sizeof (int);
3526 /* Compare constant contents. */
3528 if (*p
++ != *strp
++)
3534 /* Construct a constant descriptor for the rtl-expression X.
3535 It is up to the caller to enter the descriptor in the hash table. */
3537 static struct constant_descriptor
*
3538 record_constant_rtx (mode
, x
)
3539 enum machine_mode mode
;
3542 struct constant_descriptor
*ptr
;
3544 ptr
= ((struct constant_descriptor
*)
3545 xcalloc (1, (offsetof (struct constant_descriptor
, u
)
3546 + sizeof (struct rtx_const
))));
3547 decode_rtx_const (mode
, x
, (struct rtx_const
*) ptr
->u
.contents
);
3552 /* Given a constant rtx X, make (or find) a memory constant for its value
3553 and return a MEM rtx to refer to it in memory. */
3556 force_const_mem (mode
, x
)
3557 enum machine_mode mode
;
3561 register struct constant_descriptor
*desc
;
3563 const char *found
= 0;
3566 /* If we want this CONST_DOUBLE in the same mode as it is in memory
3567 (this will always be true for floating CONST_DOUBLEs that have been
3568 placed in memory, but not for VOIDmode (integer) CONST_DOUBLEs),
3569 use the previous copy. Otherwise, make a new one. Note that in
3570 the unlikely event that this same CONST_DOUBLE is used in two different
3571 modes in an alternating fashion, we will allocate a lot of different
3572 memory locations, but this should be extremely rare. */
3574 if (GET_CODE (x
) == CONST_DOUBLE
3575 && GET_CODE (CONST_DOUBLE_MEM (x
)) == MEM
3576 && GET_MODE (CONST_DOUBLE_MEM (x
)) == mode
)
3577 return CONST_DOUBLE_MEM (x
);
3579 /* Compute hash code of X. Search the descriptors for that hash code
3580 to see if any of them describes X. If yes, the descriptor records
3581 the label number already assigned. */
3583 hash
= const_hash_rtx (mode
, x
);
3585 for (desc
= const_rtx_hash_table
[hash
]; desc
; desc
= desc
->next
)
3586 if (compare_constant_rtx (mode
, x
, desc
))
3588 found
= desc
->label
;
3594 register struct pool_constant
*pool
;
3597 /* No constant equal to X is known to have been output.
3598 Make a constant descriptor to enter X in the hash table.
3599 Assign the label number and record it in the descriptor for
3600 future calls to this function to find. */
3602 desc
= record_constant_rtx (mode
, x
);
3603 desc
->next
= const_rtx_hash_table
[hash
];
3604 const_rtx_hash_table
[hash
] = desc
;
3606 /* Align the location counter as required by EXP's data type. */
3607 align
= GET_MODE_ALIGNMENT (mode
== VOIDmode
? word_mode
: mode
);
3608 #ifdef CONSTANT_ALIGNMENT
3609 align
= CONSTANT_ALIGNMENT (make_tree (type_for_mode (mode
, 0), x
),
3613 pool_offset
+= (align
/ BITS_PER_UNIT
) - 1;
3614 pool_offset
&= ~ ((align
/ BITS_PER_UNIT
) - 1);
3616 if (GET_CODE (x
) == LABEL_REF
)
3617 LABEL_PRESERVE_P (XEXP (x
, 0)) = 1;
3619 /* Allocate a pool constant descriptor, fill it in, and chain it in. */
3621 pool
= (struct pool_constant
*) ggc_alloc (sizeof (struct pool_constant
));
3625 pool
->labelno
= const_labelno
;
3626 pool
->align
= align
;
3627 pool
->offset
= pool_offset
;
3634 last_pool
->next
= pool
;
3637 pool_offset
+= GET_MODE_SIZE (mode
);
3639 /* Create a string containing the label name, in LABEL. */
3640 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
3644 desc
->label
= found
= ggc_strdup (label
);
3646 /* Add label to symbol hash table. */
3647 hash
= SYMHASH (found
);
3648 pool
->label
= found
;
3649 pool
->next_sym
= const_rtx_sym_hash_table
[hash
];
3650 const_rtx_sym_hash_table
[hash
] = pool
;
3653 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
3655 def
= gen_rtx_MEM (mode
, gen_rtx_SYMBOL_REF (Pmode
, found
));
3656 set_mem_attributes (def
, type_for_mode (mode
, 0), 1);
3657 RTX_UNCHANGING_P (def
) = 1;
3659 /* Mark the symbol_ref as belonging to this constants pool. */
3660 CONSTANT_POOL_ADDRESS_P (XEXP (def
, 0)) = 1;
3661 current_function_uses_const_pool
= 1;
3663 if (GET_CODE (x
) == CONST_DOUBLE
)
3665 if (CONST_DOUBLE_MEM (x
) == cc0_rtx
)
3667 CONST_DOUBLE_CHAIN (x
) = const_double_chain
;
3668 const_double_chain
= x
;
3670 CONST_DOUBLE_MEM (x
) = def
;
3676 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
3677 the corresponding pool_constant structure. */
3679 static struct pool_constant
*
3680 find_pool_constant (f
, addr
)
3684 struct pool_constant
*pool
;
3685 const char *label
= XSTR (addr
, 0);
3687 for (pool
= f
->varasm
->x_const_rtx_sym_hash_table
[SYMHASH (label
)]; pool
;
3688 pool
= pool
->next_sym
)
3689 if (pool
->label
== label
)
3695 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
3698 get_pool_constant (addr
)
3701 return (find_pool_constant (cfun
, addr
))->constant
;
3704 /* Likewise, but for the constant pool of a specific function. */
3707 get_pool_constant_for_function (f
, addr
)
3711 return (find_pool_constant (f
, addr
))->constant
;
3714 /* Similar, return the mode. */
3717 get_pool_mode (addr
)
3720 return (find_pool_constant (cfun
, addr
))->mode
;
3724 get_pool_mode_for_function (f
, addr
)
3728 return (find_pool_constant (f
, addr
))->mode
;
3731 /* Similar, return the offset in the constant pool. */
3734 get_pool_offset (addr
)
3737 return (find_pool_constant (cfun
, addr
))->offset
;
3740 /* Return the size of the constant pool. */
3748 /* Write all the constants in the constant pool. */
3751 output_constant_pool (fnname
, fndecl
)
3752 const char *fnname ATTRIBUTE_UNUSED
;
3753 tree fndecl ATTRIBUTE_UNUSED
;
3755 struct pool_constant
*pool
;
3757 union real_extract u
;
3759 /* It is possible for gcc to call force_const_mem and then to later
3760 discard the instructions which refer to the constant. In such a
3761 case we do not need to output the constant. */
3762 mark_constant_pool ();
3764 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3765 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3768 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3777 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3778 whose CODE_LABEL has been deleted. This can occur if a jump table
3779 is eliminated by optimization. If so, write a constant of zero
3780 instead. Note that this can also happen by turning the
3781 CODE_LABEL into a NOTE. */
3782 /* ??? This seems completely and utterly wrong. Certainly it's
3783 not true for NOTE_INSN_DELETED_LABEL, but I disbelieve proper
3784 functioning even with INSN_DELETED_P and friends. */
3787 switch (GET_CODE (x
))
3790 if (GET_CODE (XEXP (x
, 0)) != PLUS
3791 || GET_CODE (XEXP (XEXP (x
, 0), 0)) != LABEL_REF
)
3793 tmp
= XEXP (XEXP (x
, 0), 0);
3798 if (INSN_DELETED_P (tmp
)
3799 || (GET_CODE (tmp
) == NOTE
3800 && NOTE_LINE_NUMBER (tmp
) == NOTE_INSN_DELETED
))
3811 /* First switch to correct section. */
3812 #ifdef SELECT_RTX_SECTION
3813 SELECT_RTX_SECTION (pool
->mode
, x
);
3815 readonly_data_section ();
3818 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3819 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file
, x
, pool
->mode
,
3820 pool
->align
, pool
->labelno
, done
);
3823 assemble_align (pool
->align
);
3825 /* Output the label. */
3826 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LC", pool
->labelno
);
3828 /* Output the value of the constant itself. */
3829 switch (GET_MODE_CLASS (pool
->mode
))
3832 if (GET_CODE (x
) != CONST_DOUBLE
)
3835 memcpy ((char *) &u
, (char *) &CONST_DOUBLE_LOW (x
), sizeof u
);
3836 assemble_real (u
.d
, pool
->mode
);
3840 case MODE_PARTIAL_INT
:
3841 assemble_integer (x
, GET_MODE_SIZE (pool
->mode
), 1);
3848 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3854 #ifdef ASM_OUTPUT_POOL_EPILOGUE
3855 ASM_OUTPUT_POOL_EPILOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3858 /* Done with this pool. */
3859 first_pool
= last_pool
= 0;
3862 /* Look through the instructions for this function, and mark all the
3863 entries in the constant pool which are actually being used.
3864 Emit used deferred strings. */
3867 mark_constant_pool ()
3870 struct pool_constant
*pool
;
3872 if (first_pool
== 0 && htab_elements (const_str_htab
) == 0)
3875 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3878 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
3880 mark_constants (PATTERN (insn
));
3882 for (insn
= current_function_epilogue_delay_list
;
3884 insn
= XEXP (insn
, 1))
3886 mark_constants (PATTERN (insn
));
3889 /* Look through appropriate parts of X, marking all entries in the
3890 constant pool which are actually being used. Entries that are only
3891 referenced by other constants are also marked as used. Emit
3892 deferred strings that are used. */
3899 register const char *format_ptr
;
3904 if (GET_CODE (x
) == SYMBOL_REF
)
3906 mark_constant (&x
, NULL
);
3909 /* Never search inside a CONST_DOUBLE, because CONST_DOUBLE_MEM may be
3910 a MEM, but does not constitute a use of that MEM. */
3911 else if (GET_CODE (x
) == CONST_DOUBLE
)
3914 /* Insns may appear inside a SEQUENCE. Only check the patterns of
3915 insns, not any notes that may be attached. We don't want to mark
3916 a constant just because it happens to appear in a REG_EQUIV note. */
3919 mark_constants (PATTERN (x
));
3923 format_ptr
= GET_RTX_FORMAT (GET_CODE (x
));
3925 for (i
= 0; i
< GET_RTX_LENGTH (GET_CODE (x
)); i
++)
3927 switch (*format_ptr
++)
3930 mark_constants (XEXP (x
, i
));
3934 if (XVEC (x
, i
) != 0)
3938 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
3939 mark_constants (XVECEXP (x
, i
, j
));
3958 /* Given a SYMBOL_REF CURRENT_RTX, mark it and all constants it refers
3959 to as used. Emit referenced deferred strings. This function can
3960 be used with for_each_rtx () to mark all SYMBOL_REFs in an rtx. */
3963 mark_constant (current_rtx
, data
)
3965 void *data ATTRIBUTE_UNUSED
;
3967 rtx x
= *current_rtx
;
3971 else if (GET_CODE(x
) == CONST_DOUBLE
)
3972 /* Never search inside a CONST_DOUBLE because CONST_DOUBLE_MEM may
3973 be a MEM but does not constitute a use of that MEM. */
3975 else if (GET_CODE (x
) == SYMBOL_REF
)
3977 if (CONSTANT_POOL_ADDRESS_P (x
))
3979 struct pool_constant
*pool
= find_pool_constant (cfun
, x
);
3980 if (pool
->mark
== 0) {
3982 for_each_rtx (&(pool
->constant
), &mark_constant
, NULL
);
3987 else if (STRING_POOL_ADDRESS_P (x
))
3989 struct deferred_string
**defstr
;
3991 defstr
= (struct deferred_string
**)
3992 htab_find_slot_with_hash (const_str_htab
, XSTR (x
, 0),
3993 STRHASH (XSTR (x
, 0)), NO_INSERT
);
3996 struct deferred_string
*p
= *defstr
;
3998 STRING_POOL_ADDRESS_P (x
) = 0;
3999 output_constant_def_contents (p
->exp
, 0, p
->labelno
);
4000 htab_clear_slot (const_str_htab
, (void **) defstr
);
4007 /* Find all the constants whose addresses are referenced inside of EXP,
4008 and make sure assembler code with a label has been output for each one.
4009 Indicate whether an ADDR_EXPR has been encountered. */
4012 output_addressed_constants (exp
)
4017 /* Give the front-end a chance to convert VALUE to something that
4018 looks more like a constant to the back-end. */
4019 if (lang_expand_constant
)
4020 exp
= (*lang_expand_constant
) (exp
);
4022 switch (TREE_CODE (exp
))
4026 register tree constant
= TREE_OPERAND (exp
, 0);
4028 while (TREE_CODE (constant
) == COMPONENT_REF
)
4030 constant
= TREE_OPERAND (constant
, 0);
4033 if (TREE_CODE_CLASS (TREE_CODE (constant
)) == 'c'
4034 || TREE_CODE (constant
) == CONSTRUCTOR
)
4035 /* No need to do anything here
4036 for addresses of variables or functions. */
4037 output_constant_def (constant
, 0);
4044 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
4045 reloc
|= output_addressed_constants (TREE_OPERAND (exp
, 1));
4050 case NON_LVALUE_EXPR
:
4051 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
4057 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
4058 if (TREE_VALUE (link
) != 0)
4059 reloc
|= output_addressed_constants (TREE_VALUE (link
));
4069 /* Return nonzero if VALUE is a valid constant-valued expression
4070 for use in initializing a static variable; one that can be an
4071 element of a "constant" initializer.
4073 Return null_pointer_node if the value is absolute;
4074 if it is relocatable, return the variable that determines the relocation.
4075 We assume that VALUE has been folded as much as possible;
4076 therefore, we do not need to check for such things as
4077 arithmetic-combinations of integers. */
4080 initializer_constant_valid_p (value
, endtype
)
4084 /* Give the front-end a chance to convert VALUE to something that
4085 looks more like a constant to the back-end. */
4086 if (lang_expand_constant
)
4087 value
= (*lang_expand_constant
) (value
);
4089 switch (TREE_CODE (value
))
4092 if ((TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
4093 || TREE_CODE (TREE_TYPE (value
)) == RECORD_TYPE
)
4094 && TREE_CONSTANT (value
)
4095 && CONSTRUCTOR_ELTS (value
))
4097 initializer_constant_valid_p (TREE_VALUE (CONSTRUCTOR_ELTS (value
)),
4100 return TREE_STATIC (value
) ? null_pointer_node
: 0;
4106 return null_pointer_node
;
4109 return staticp (TREE_OPERAND (value
, 0)) ? TREE_OPERAND (value
, 0) : 0;
4111 case NON_LVALUE_EXPR
:
4112 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
4116 /* Allow conversions between pointer types. */
4117 if (POINTER_TYPE_P (TREE_TYPE (value
))
4118 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
4119 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
4121 /* Allow conversions between real types. */
4122 if (FLOAT_TYPE_P (TREE_TYPE (value
))
4123 && FLOAT_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
4124 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
4126 /* Allow length-preserving conversions between integer types. */
4127 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
4128 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
4129 && (TYPE_PRECISION (TREE_TYPE (value
))
4130 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
4131 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
4133 /* Allow conversions between other integer types only if
4135 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
4136 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
4138 tree inner
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4140 if (inner
== null_pointer_node
)
4141 return null_pointer_node
;
4145 /* Allow (int) &foo provided int is as wide as a pointer. */
4146 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
4147 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
4148 && (TYPE_PRECISION (TREE_TYPE (value
))
4149 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
4150 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4153 /* Likewise conversions from int to pointers, but also allow
4154 conversions from 0. */
4155 if (POINTER_TYPE_P (TREE_TYPE (value
))
4156 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
4158 if (integer_zerop (TREE_OPERAND (value
, 0)))
4159 return null_pointer_node
;
4160 else if (TYPE_PRECISION (TREE_TYPE (value
))
4161 <= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0))))
4162 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4166 /* Allow conversions to union types if the value inside is okay. */
4167 if (TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
)
4168 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4173 if (! INTEGRAL_TYPE_P (endtype
)
4174 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
4176 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4178 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
4180 /* If either term is absolute, use the other terms relocation. */
4181 if (valid0
== null_pointer_node
)
4183 if (valid1
== null_pointer_node
)
4189 if (! INTEGRAL_TYPE_P (endtype
)
4190 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
4192 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4194 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
4196 /* Win if second argument is absolute. */
4197 if (valid1
== null_pointer_node
)
4199 /* Win if both arguments have the same relocation.
4200 Then the value is absolute. */
4201 if (valid0
== valid1
&& valid0
!= 0)
4202 return null_pointer_node
;
4204 /* Since GCC guarantees that string constants are unique in the
4205 generated code, a subtraction between two copies of the same
4206 constant string is absolute. */
4207 if (valid0
&& TREE_CODE (valid0
) == STRING_CST
&&
4208 valid1
&& TREE_CODE (valid1
) == STRING_CST
&&
4209 TREE_STRING_POINTER (valid0
) == TREE_STRING_POINTER (valid1
))
4210 return null_pointer_node
;
4213 /* Support differences between labels. */
4214 if (INTEGRAL_TYPE_P (endtype
))
4217 op0
= TREE_OPERAND (value
, 0);
4218 op1
= TREE_OPERAND (value
, 1);
4222 if (TREE_CODE (op0
) == ADDR_EXPR
4223 && TREE_CODE (TREE_OPERAND (op0
, 0)) == LABEL_DECL
4224 && TREE_CODE (op1
) == ADDR_EXPR
4225 && TREE_CODE (TREE_OPERAND (op1
, 0)) == LABEL_DECL
)
4226 return null_pointer_node
;
4237 /* Output assembler code for constant EXP to FILE, with no label.
4238 This includes the pseudo-op such as ".int" or ".byte", and a newline.
4239 Assumes output_addressed_constants has been done on EXP already.
4241 Generate exactly SIZE bytes of assembler data, padding at the end
4242 with zeros if necessary. SIZE must always be specified.
4244 SIZE is important for structure constructors,
4245 since trailing members may have been omitted from the constructor.
4246 It is also important for initialization of arrays from string constants
4247 since the full length of the string constant might not be wanted.
4248 It is also needed for initialization of unions, where the initializer's
4249 type is just one member, and that may not be as long as the union.
4251 There a case in which we would fail to output exactly SIZE bytes:
4252 for a structure constructor that wants to produce more than SIZE bytes.
4253 But such constructors will never be generated for any possible input. */
4256 output_constant (exp
, size
)
4260 register enum tree_code code
= TREE_CODE (TREE_TYPE (exp
));
4262 /* Some front-ends use constants other than the standard
4263 language-indepdent varieties, but which may still be output
4264 directly. Give the front-end a chance to convert EXP to a
4265 language-independent representation. */
4266 if (lang_expand_constant
)
4268 exp
= (*lang_expand_constant
) (exp
);
4269 code
= TREE_CODE (TREE_TYPE (exp
));
4272 if (size
== 0 || flag_syntax_only
)
4275 /* Eliminate the NON_LVALUE_EXPR_EXPR that makes a cast not be an lvalue.
4276 That way we get the constant (we hope) inside it. Also, strip off any
4277 NOP_EXPR that converts between two record, union, array, or set types
4278 or a CONVERT_EXPR that converts to a union TYPE. */
4279 while ((TREE_CODE (exp
) == NOP_EXPR
4280 && (TREE_TYPE (exp
) == TREE_TYPE (TREE_OPERAND (exp
, 0))
4281 || AGGREGATE_TYPE_P (TREE_TYPE (exp
))))
4282 || (TREE_CODE (exp
) == CONVERT_EXPR
4283 && code
== UNION_TYPE
)
4284 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
4286 exp
= TREE_OPERAND (exp
, 0);
4287 code
= TREE_CODE (TREE_TYPE (exp
));
4290 /* Allow a constructor with no elements for any data type.
4291 This means to fill the space with zeros. */
4292 if (TREE_CODE (exp
) == CONSTRUCTOR
&& CONSTRUCTOR_ELTS (exp
) == 0)
4294 assemble_zeros (size
);
4305 case REFERENCE_TYPE
:
4306 /* ??? What about (int)((float)(int)&foo + 4) */
4307 while (TREE_CODE (exp
) == NOP_EXPR
|| TREE_CODE (exp
) == CONVERT_EXPR
4308 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
4309 exp
= TREE_OPERAND (exp
, 0);
4311 if (! assemble_integer (expand_expr (exp
, NULL_RTX
, VOIDmode
,
4312 EXPAND_INITIALIZER
),
4314 error ("initializer for integer value is too complicated");
4319 if (TREE_CODE (exp
) != REAL_CST
)
4320 error ("initializer for floating value is not a floating constant");
4322 assemble_real (TREE_REAL_CST (exp
),
4323 mode_for_size (size
* BITS_PER_UNIT
, MODE_FLOAT
, 0));
4328 output_constant (TREE_REALPART (exp
), size
/ 2);
4329 output_constant (TREE_IMAGPART (exp
), size
/ 2);
4330 size
-= (size
/ 2) * 2;
4334 if (TREE_CODE (exp
) == CONSTRUCTOR
)
4336 output_constructor (exp
, size
);
4339 else if (TREE_CODE (exp
) == STRING_CST
)
4343 if (size
> TREE_STRING_LENGTH (exp
))
4345 excess
= size
- TREE_STRING_LENGTH (exp
);
4346 size
= TREE_STRING_LENGTH (exp
);
4349 assemble_string (TREE_STRING_POINTER (exp
), size
);
4358 if (TREE_CODE (exp
) == CONSTRUCTOR
)
4359 output_constructor (exp
, size
);
4365 if (TREE_CODE (exp
) == INTEGER_CST
)
4366 assemble_integer (expand_expr (exp
, NULL_RTX
,
4367 VOIDmode
, EXPAND_INITIALIZER
),
4369 else if (TREE_CODE (exp
) == CONSTRUCTOR
)
4371 unsigned char *buffer
= (unsigned char *) alloca (size
);
4372 if (get_set_constructor_bytes (exp
, buffer
, size
))
4374 assemble_string ((char *) buffer
, size
);
4377 error ("unknown set constructor type");
4385 assemble_zeros (size
);
4389 /* Subroutine of output_constructor, used for computing the size of
4390 arrays of unspecified length. VAL must be a CONSTRUCTOR of an array
4391 type with an unspecified upper bound. */
4393 static unsigned HOST_WIDE_INT
4394 array_size_for_constructor (val
)
4399 max_index
= NULL_TREE
;
4400 for (i
= CONSTRUCTOR_ELTS (val
); i
; i
= TREE_CHAIN (i
))
4402 tree index
= TREE_PURPOSE (i
);
4404 if (TREE_CODE (index
) == RANGE_EXPR
)
4405 index
= TREE_OPERAND (index
, 1);
4406 if (max_index
== NULL_TREE
|| tree_int_cst_lt (max_index
, index
))
4410 if (max_index
== NULL_TREE
)
4413 /* Compute the total number of array elements. */
4414 i
= size_binop (MINUS_EXPR
, convert (sizetype
, max_index
),
4416 TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (val
)))));
4417 i
= size_binop (PLUS_EXPR
, i
, convert (sizetype
, integer_one_node
));
4419 /* Multiply by the array element unit size to find number of bytes. */
4420 i
= size_binop (MULT_EXPR
, i
, TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (val
))));
4422 return tree_low_cst (i
, 1);
4425 /* Subroutine of output_constant, used for CONSTRUCTORs (aggregate constants).
4426 Generate at least SIZE bytes, padding if necessary. */
4429 output_constructor (exp
, size
)
4433 tree type
= TREE_TYPE (exp
);
4434 register tree link
, field
= 0;
4436 /* Number of bytes output or skipped so far.
4437 In other words, current position within the constructor. */
4438 HOST_WIDE_INT total_bytes
= 0;
4439 /* Non-zero means BYTE contains part of a byte, to be output. */
4440 int byte_buffer_in_use
= 0;
4441 register int byte
= 0;
4443 if (HOST_BITS_PER_WIDE_INT
< BITS_PER_UNIT
)
4446 if (TREE_CODE (type
) == RECORD_TYPE
)
4447 field
= TYPE_FIELDS (type
);
4449 if (TREE_CODE (type
) == ARRAY_TYPE
4450 && TYPE_DOMAIN (type
) != 0)
4451 min_index
= TYPE_MIN_VALUE (TYPE_DOMAIN (type
));
4453 /* As LINK goes through the elements of the constant,
4454 FIELD goes through the structure fields, if the constant is a structure.
4455 if the constant is a union, then we override this,
4456 by getting the field from the TREE_LIST element.
4457 But the constant could also be an array. Then FIELD is zero.
4459 There is always a maximum of one element in the chain LINK for unions
4460 (even if the initializer in a source program incorrectly contains
4462 for (link
= CONSTRUCTOR_ELTS (exp
);
4464 link
= TREE_CHAIN (link
),
4465 field
= field
? TREE_CHAIN (field
) : 0)
4467 tree val
= TREE_VALUE (link
);
4470 /* The element in a union constructor specifies the proper field
4472 if ((TREE_CODE (type
) == RECORD_TYPE
|| TREE_CODE (type
) == UNION_TYPE
4473 || TREE_CODE (type
) == QUAL_UNION_TYPE
)
4474 && TREE_PURPOSE (link
) != 0)
4475 field
= TREE_PURPOSE (link
);
4477 else if (TREE_CODE (type
) == ARRAY_TYPE
)
4478 index
= TREE_PURPOSE (link
);
4480 /* Eliminate the marker that makes a cast not be an lvalue. */
4484 if (index
&& TREE_CODE (index
) == RANGE_EXPR
)
4486 unsigned HOST_WIDE_INT fieldsize
4487 = int_size_in_bytes (TREE_TYPE (type
));
4488 HOST_WIDE_INT lo_index
= tree_low_cst (TREE_OPERAND (index
, 0), 0);
4489 HOST_WIDE_INT hi_index
= tree_low_cst (TREE_OPERAND (index
, 1), 0);
4490 HOST_WIDE_INT index
;
4492 for (index
= lo_index
; index
<= hi_index
; index
++)
4494 /* Output the element's initial value. */
4496 assemble_zeros (fieldsize
);
4498 output_constant (val
, fieldsize
);
4500 /* Count its size. */
4501 total_bytes
+= fieldsize
;
4504 else if (field
== 0 || !DECL_BIT_FIELD (field
))
4506 /* An element that is not a bit-field. */
4508 unsigned HOST_WIDE_INT fieldsize
;
4509 /* Since this structure is static,
4510 we know the positions are constant. */
4511 HOST_WIDE_INT pos
= field
? int_byte_position (field
) : 0;
4514 pos
= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (val
)), 1)
4515 * (tree_low_cst (index
, 0) - tree_low_cst (min_index
, 0)));
4517 /* Output any buffered-up bit-fields preceding this element. */
4518 if (byte_buffer_in_use
)
4520 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4522 byte_buffer_in_use
= 0;
4525 /* Advance to offset of this element.
4526 Note no alignment needed in an array, since that is guaranteed
4527 if each element has the proper size. */
4528 if ((field
!= 0 || index
!= 0) && pos
!= total_bytes
)
4530 assemble_zeros (pos
- total_bytes
);
4534 else if (field
!= 0 && DECL_PACKED (field
))
4535 /* Some assemblers automaticallly align a datum according to its
4536 size if no align directive is specified. The datum, however,
4537 may be declared with 'packed' attribute, so we have to disable
4539 ASM_OUTPUT_ALIGN (asm_out_file
, 0);
4541 /* Determine size this element should occupy. */
4546 /* If this is an array with an unspecified upper bound,
4547 the initializer determines the size. */
4548 /* ??? This ought to only checked if DECL_SIZE_UNIT is NULL,
4549 but we cannot do this until the deprecated support for
4550 initializing zero-length array members is removed. */
4551 if (TREE_CODE (TREE_TYPE (field
)) == ARRAY_TYPE
4552 && TYPE_DOMAIN (TREE_TYPE (field
))
4553 && ! TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (field
))))
4555 fieldsize
= array_size_for_constructor (val
);
4556 /* Given a non-empty initialization, this field had
4558 if (fieldsize
!= 0 && TREE_CHAIN (field
) != NULL_TREE
)
4561 else if (DECL_SIZE_UNIT (field
))
4563 /* ??? This can't be right. If the decl size overflows
4564 a host integer we will silently emit no data. */
4565 if (host_integerp (DECL_SIZE_UNIT (field
), 1))
4566 fieldsize
= tree_low_cst (DECL_SIZE_UNIT (field
), 1);
4570 fieldsize
= int_size_in_bytes (TREE_TYPE (type
));
4572 /* Output the element's initial value. */
4574 assemble_zeros (fieldsize
);
4576 output_constant (val
, fieldsize
);
4578 /* Count its size. */
4579 total_bytes
+= fieldsize
;
4581 else if (val
!= 0 && TREE_CODE (val
) != INTEGER_CST
)
4582 error ("invalid initial value for member `%s'",
4583 IDENTIFIER_POINTER (DECL_NAME (field
)));
4586 /* Element that is a bit-field. */
4588 HOST_WIDE_INT next_offset
= int_bit_position (field
);
4589 HOST_WIDE_INT end_offset
4590 = (next_offset
+ tree_low_cst (DECL_SIZE (field
), 1));
4593 val
= integer_zero_node
;
4595 /* If this field does not start in this (or, next) byte,
4597 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4599 /* Output remnant of any bit field in previous bytes. */
4600 if (byte_buffer_in_use
)
4602 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4604 byte_buffer_in_use
= 0;
4607 /* If still not at proper byte, advance to there. */
4608 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4610 assemble_zeros (next_offset
/ BITS_PER_UNIT
- total_bytes
);
4611 total_bytes
= next_offset
/ BITS_PER_UNIT
;
4615 if (! byte_buffer_in_use
)
4618 /* We must split the element into pieces that fall within
4619 separate bytes, and combine each byte with previous or
4620 following bit-fields. */
4622 /* next_offset is the offset n fbits from the beginning of
4623 the structure to the next bit of this element to be processed.
4624 end_offset is the offset of the first bit past the end of
4626 while (next_offset
< end_offset
)
4630 HOST_WIDE_INT value
;
4631 HOST_WIDE_INT next_byte
= next_offset
/ BITS_PER_UNIT
;
4632 HOST_WIDE_INT next_bit
= next_offset
% BITS_PER_UNIT
;
4634 /* Advance from byte to byte
4635 within this element when necessary. */
4636 while (next_byte
!= total_bytes
)
4638 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4643 /* Number of bits we can process at once
4644 (all part of the same byte). */
4645 this_time
= MIN (end_offset
- next_offset
,
4646 BITS_PER_UNIT
- next_bit
);
4647 if (BYTES_BIG_ENDIAN
)
4649 /* On big-endian machine, take the most significant bits
4650 first (of the bits that are significant)
4651 and put them into bytes from the most significant end. */
4652 shift
= end_offset
- next_offset
- this_time
;
4654 /* Don't try to take a bunch of bits that cross
4655 the word boundary in the INTEGER_CST. We can
4656 only select bits from the LOW or HIGH part
4658 if (shift
< HOST_BITS_PER_WIDE_INT
4659 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4661 this_time
= shift
+ this_time
- HOST_BITS_PER_WIDE_INT
;
4662 shift
= HOST_BITS_PER_WIDE_INT
;
4665 /* Now get the bits from the appropriate constant word. */
4666 if (shift
< HOST_BITS_PER_WIDE_INT
)
4667 value
= TREE_INT_CST_LOW (val
);
4668 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4670 value
= TREE_INT_CST_HIGH (val
);
4671 shift
-= HOST_BITS_PER_WIDE_INT
;
4676 /* Get the result. This works only when:
4677 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4678 byte
|= (((value
>> shift
)
4679 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4680 << (BITS_PER_UNIT
- this_time
- next_bit
));
4684 /* On little-endian machines,
4685 take first the least significant bits of the value
4686 and pack them starting at the least significant
4687 bits of the bytes. */
4688 shift
= next_offset
- int_bit_position (field
);
4690 /* Don't try to take a bunch of bits that cross
4691 the word boundary in the INTEGER_CST. We can
4692 only select bits from the LOW or HIGH part
4694 if (shift
< HOST_BITS_PER_WIDE_INT
4695 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4696 this_time
= (HOST_BITS_PER_WIDE_INT
- shift
);
4698 /* Now get the bits from the appropriate constant word. */
4699 if (shift
< HOST_BITS_PER_WIDE_INT
)
4700 value
= TREE_INT_CST_LOW (val
);
4701 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4703 value
= TREE_INT_CST_HIGH (val
);
4704 shift
-= HOST_BITS_PER_WIDE_INT
;
4709 /* Get the result. This works only when:
4710 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4711 byte
|= (((value
>> shift
)
4712 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4716 next_offset
+= this_time
;
4717 byte_buffer_in_use
= 1;
4722 if (byte_buffer_in_use
)
4724 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4728 if (total_bytes
< size
)
4729 assemble_zeros (size
- total_bytes
);
4732 #ifdef HANDLE_PRAGMA_WEAK
4733 /* Add function NAME to the weak symbols list. VALUE is a weak alias
4734 associatd with NAME. */
4737 add_weak (name
, value
)
4741 struct weak_syms
*weak
;
4743 weak
= (struct weak_syms
*) permalloc (sizeof (struct weak_syms
));
4748 weak
->next
= weak_decls
;
4750 weak
->value
= value
;
4755 #endif /* HANDLE_PRAGMA_WEAK */
4757 /* Declare DECL to be a weak symbol. */
4763 if (! TREE_PUBLIC (decl
))
4764 error_with_decl (decl
, "weak declaration of `%s' must be public");
4765 else if (TREE_ASM_WRITTEN (decl
))
4766 error_with_decl (decl
, "weak declaration of `%s' must precede definition");
4767 else if (SUPPORTS_WEAK
)
4768 DECL_WEAK (decl
) = 1;
4769 #ifdef HANDLE_PRAGMA_WEAK
4770 add_weak (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)), NULL
);
4774 /* Emit any pending weak declarations. */
4776 #ifdef HANDLE_PRAGMA_WEAK
4777 struct weak_syms
* weak_decls
;
4783 #ifdef HANDLE_PRAGMA_WEAK
4784 if (HANDLE_PRAGMA_WEAK
)
4786 struct weak_syms
*t
;
4787 for (t
= weak_decls
; t
; t
= t
->next
)
4790 ASM_OUTPUT_WEAK_ALIAS (asm_out_file
, t
->name
, t
->value
);
4796 /* Remove NAME from the pending list of weak symbols. This prevents
4797 the compiler from emitting multiple .weak directives which confuses
4799 #ifdef ASM_WEAKEN_LABEL
4801 remove_from_pending_weak_list (name
)
4802 const char *name ATTRIBUTE_UNUSED
;
4804 #ifdef HANDLE_PRAGMA_WEAK
4805 if (HANDLE_PRAGMA_WEAK
)
4807 struct weak_syms
*t
;
4808 for (t
= weak_decls
; t
; t
= t
->next
)
4810 if (t
->name
&& strcmp (name
, t
->name
) == 0)
4819 assemble_alias (decl
, target
)
4820 tree decl
, target ATTRIBUTE_UNUSED
;
4824 /* We must force creation of DECL_RTL for debug info generation, even though
4825 we don't use it here. */
4826 make_decl_rtl (decl
, NULL
);
4828 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
4830 #ifdef ASM_OUTPUT_DEF
4831 /* Make name accessible from other files, if appropriate. */
4833 if (TREE_PUBLIC (decl
))
4835 #ifdef ASM_WEAKEN_LABEL
4836 if (DECL_WEAK (decl
))
4838 ASM_WEAKEN_LABEL (asm_out_file
, name
);
4839 /* Remove this function from the pending weak list so that
4840 we do not emit multiple .weak directives for it. */
4841 remove_from_pending_weak_list
4842 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
4846 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
4849 #ifdef ASM_OUTPUT_DEF_FROM_DECLS
4850 ASM_OUTPUT_DEF_FROM_DECLS (asm_out_file
, decl
, target
);
4852 ASM_OUTPUT_DEF (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4854 TREE_ASM_WRITTEN (decl
) = 1;
4856 #ifdef ASM_OUTPUT_WEAK_ALIAS
4857 if (! DECL_WEAK (decl
))
4858 warning ("only weak aliases are supported in this configuration");
4860 ASM_OUTPUT_WEAK_ALIAS (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4861 TREE_ASM_WRITTEN (decl
) = 1;
4863 warning ("alias definitions not supported in this configuration; ignored");
4868 /* Returns 1 if the target configuration supports defining public symbols
4869 so that one of them will be chosen at link time instead of generating a
4870 multiply-defined symbol error, whether through the use of weak symbols or
4871 a target-specific mechanism for having duplicates discarded. */
4874 supports_one_only ()
4876 if (SUPPORTS_ONE_ONLY
)
4878 return SUPPORTS_WEAK
;
4881 /* Set up DECL as a public symbol that can be defined in multiple
4882 translation units without generating a linker error. */
4885 make_decl_one_only (decl
)
4888 if (TREE_CODE (decl
) != VAR_DECL
&& TREE_CODE (decl
) != FUNCTION_DECL
)
4891 TREE_PUBLIC (decl
) = 1;
4893 if (TREE_CODE (decl
) == VAR_DECL
4894 && (DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
))
4895 DECL_COMMON (decl
) = 1;
4896 else if (SUPPORTS_ONE_ONLY
)
4898 #ifdef MAKE_DECL_ONE_ONLY
4899 MAKE_DECL_ONE_ONLY (decl
);
4901 DECL_ONE_ONLY (decl
) = 1;
4903 else if (SUPPORTS_WEAK
)
4904 DECL_WEAK (decl
) = 1;
4912 const_str_htab
= htab_create (128, const_str_htab_hash
, const_str_htab_eq
,
4913 const_str_htab_del
);
4914 in_named_htab
= htab_create (31, in_named_entry_hash
,
4915 in_named_entry_eq
, NULL
);
4917 ggc_add_root (const_hash_table
, MAX_HASH_TABLE
, sizeof const_hash_table
[0],
4918 mark_const_hash_entry
);
4919 ggc_add_root (&const_str_htab
, 1, sizeof const_str_htab
,
4920 mark_const_str_htab
);
4923 /* Select a set of attributes for section NAME based on the properties
4924 of DECL and whether or not RELOC indicates that DECL's initializer
4925 might contain runtime relocations.
4927 We make the section read-only and executable for a function decl,
4928 read-only for a const data decl, and writable for a non-const data decl. */
4931 default_section_type_flags (decl
, name
, reloc
)
4938 if (decl
&& TREE_CODE (decl
) == FUNCTION_DECL
)
4939 flags
= SECTION_CODE
;
4940 else if (decl
&& DECL_READONLY_SECTION (decl
, reloc
))
4943 flags
= SECTION_WRITE
;
4945 if (decl
&& DECL_ONE_ONLY (decl
))
4946 flags
|= SECTION_LINKONCE
;
4948 if (strcmp (name
, ".bss") == 0
4949 || strncmp (name
, ".bss.", 5) == 0
4950 || strncmp (name
, ".gnu.linkonce.b.", 16) == 0
4951 || strcmp (name
, ".sbss") == 0
4952 || strncmp (name
, ".sbss.", 6) == 0
4953 || strncmp (name
, ".gnu.linkonce.sb.", 17) == 0)
4954 flags
|= SECTION_BSS
;
4959 /* Output assembly to switch to section NAME with attribute FLAGS.
4960 Four variants for common object file formats. */
4963 default_no_named_section (name
, flags
)
4964 const char *name ATTRIBUTE_UNUSED
;
4965 unsigned int flags ATTRIBUTE_UNUSED
;
4967 /* Some object formats don't support named sections at all. The
4968 front-end should already have flagged this as an error. */
4973 default_elf_asm_named_section (name
, flags
)
4977 char flagchars
[8], *f
= flagchars
;
4980 if (!(flags
& SECTION_DEBUG
))
4982 if (flags
& SECTION_WRITE
)
4984 if (flags
& SECTION_CODE
)
4986 if (flags
& SECTION_SMALL
)
4990 if (flags
& SECTION_BSS
)
4995 fprintf (asm_out_file
, "\t.section\t%s,\"%s\",@%s\n",
4996 name
, flagchars
, type
);
5000 default_coff_asm_named_section (name
, flags
)
5004 char flagchars
[8], *f
= flagchars
;
5006 if (flags
& SECTION_WRITE
)
5008 if (flags
& SECTION_CODE
)
5012 fprintf (asm_out_file
, "\t.section\t%s,\"%s\"\n", name
, flagchars
);
5016 default_pe_asm_named_section (name
, flags
)
5020 default_coff_asm_named_section (name
, flags
);
5022 if (flags
& SECTION_LINKONCE
)
5024 /* Functions may have been compiled at various levels of
5025 optimization so we can't use `same_size' here.
5026 Instead, have the linker pick one. */
5027 fprintf (asm_out_file
, "\t.linkonce %s\n",
5028 (flags
& SECTION_CODE
? "discard" : "same_size"));