1 /* Output variables, constants and external declarations, for GNU compiler.
2 Copyright (C) 1987, 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997,
3 1998, 1999, 2000, 2001 Free Software Foundation, Inc.
5 This file is part of GNU CC.
7 GNU CC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GNU CC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU CC; see the file COPYING. If not, write to
19 the Free Software Foundation, 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
23 /* This file handles generation of all the assembler code
24 *except* the instructions of a function.
25 This includes declarations of variables and their initial values.
27 We also output the assembler code for constants stored in memory
28 and are responsible for combining constants with the same value. */
38 #include "hard-reg-set.h"
51 #ifdef XCOFF_DEBUGGING_INFO
55 #ifndef TRAMPOLINE_ALIGNMENT
56 #define TRAMPOLINE_ALIGNMENT FUNCTION_BOUNDARY
60 #define ASM_STABS_OP "\t.stabs\t"
63 /* Define the prefix to use when check_memory_usage_flag is enable. */
64 #define CHKR_PREFIX "_CHKR_"
65 #define CHKR_PREFIX_SIZE (sizeof (CHKR_PREFIX) - 1)
67 /* File in which assembler code is being written. */
69 extern FILE *asm_out_file
;
71 /* The (assembler) name of the first globally-visible object output. */
72 const char *first_global_object_name
;
73 const char *weak_global_object_name
;
75 extern struct obstack permanent_obstack
;
76 #define obstack_chunk_alloc xmalloc
79 struct constant_descriptor
;
83 #define MAX_RTX_HASH_TABLE 61
87 /* Hash facility for making memory-constants
88 from constant rtl-expressions. It is used on RISC machines
89 where immediate integer arguments and constant addresses are restricted
90 so that such constants must be stored in memory.
92 This pool of constants is reinitialized for each function
93 so each function gets its own constants-pool that comes right before
95 struct constant_descriptor
**x_const_rtx_hash_table
;
96 struct pool_constant
**x_const_rtx_sym_hash_table
;
98 /* Pointers to first and last constant in pool. */
99 struct pool_constant
*x_first_pool
, *x_last_pool
;
101 /* Current offset in constant pool (does not include any machine-specific
105 /* Chain of all CONST_DOUBLE rtx's constructed for the current function.
106 They are chained through the CONST_DOUBLE_CHAIN.
107 A CONST_DOUBLE rtx has CONST_DOUBLE_MEM != cc0_rtx iff it is on this chain.
108 In that case, CONST_DOUBLE_MEM is either a MEM,
109 or const0_rtx if no MEM has been made for this CONST_DOUBLE yet. */
110 rtx x_const_double_chain
;
113 #define const_rtx_hash_table (cfun->varasm->x_const_rtx_hash_table)
114 #define const_rtx_sym_hash_table (cfun->varasm->x_const_rtx_sym_hash_table)
115 #define first_pool (cfun->varasm->x_first_pool)
116 #define last_pool (cfun->varasm->x_last_pool)
117 #define pool_offset (cfun->varasm->x_pool_offset)
118 #define const_double_chain (cfun->varasm->x_const_double_chain)
120 /* Number for making the label on the next
121 constant that is stored in memory. */
125 /* Number for making the label on the next
126 static variable internal to a function. */
130 /* Carry information from ASM_DECLARE_OBJECT_NAME
131 to ASM_FINISH_DECLARE_OBJECT. */
133 int size_directive_output
;
135 /* The last decl for which assemble_variable was called,
136 if it did ASM_DECLARE_OBJECT_NAME.
137 If the last call to assemble_variable didn't do that,
140 tree last_assemble_variable_decl
;
142 static const char *strip_reg_name
PARAMS ((const char *));
143 static int contains_pointers_p
PARAMS ((tree
));
144 static void decode_addr_const
PARAMS ((tree
, struct addr_const
*));
145 static int const_hash
PARAMS ((tree
));
146 static int compare_constant
PARAMS ((tree
,
147 struct constant_descriptor
*));
148 static const unsigned char *compare_constant_1
PARAMS ((tree
, const unsigned char *));
149 static struct constant_descriptor
*record_constant
PARAMS ((tree
));
150 static void record_constant_1
PARAMS ((tree
));
151 static tree copy_constant
PARAMS ((tree
));
152 static void output_constant_def_contents
PARAMS ((tree
, int, int));
153 static void decode_rtx_const
PARAMS ((enum machine_mode
, rtx
,
154 struct rtx_const
*));
155 static int const_hash_rtx
PARAMS ((enum machine_mode
, rtx
));
156 static int compare_constant_rtx
PARAMS ((enum machine_mode
, rtx
,
157 struct constant_descriptor
*));
158 static struct constant_descriptor
*record_constant_rtx
PARAMS ((enum machine_mode
,
160 static struct pool_constant
*find_pool_constant
PARAMS ((struct function
*, rtx
));
161 static void mark_constant_pool
PARAMS ((void));
162 static void mark_constants
PARAMS ((rtx
));
163 static int mark_constant
PARAMS ((rtx
*current_rtx
, void *data
));
164 static int output_addressed_constants
PARAMS ((tree
));
165 static void output_after_function_constants
PARAMS ((void));
166 static unsigned HOST_WIDE_INT array_size_for_constructor
PARAMS ((tree
));
167 static void output_constructor
PARAMS ((tree
, int));
168 #ifdef ASM_WEAKEN_LABEL
169 static void remove_from_pending_weak_list
PARAMS ((const char *));
171 #ifdef ASM_OUTPUT_BSS
172 static void asm_output_bss
PARAMS ((FILE *, tree
, const char *, int, int));
174 #ifdef BSS_SECTION_ASM_OP
175 #ifdef ASM_OUTPUT_ALIGNED_BSS
176 static void asm_output_aligned_bss
PARAMS ((FILE *, tree
, const char *,
179 #endif /* BSS_SECTION_ASM_OP */
180 static void mark_pool_constant
PARAMS ((struct pool_constant
*));
181 static void mark_const_hash_entry
PARAMS ((void *));
182 static int mark_const_str_htab_1
PARAMS ((void **, void *));
183 static void mark_const_str_htab
PARAMS ((void *));
184 static hashval_t const_str_htab_hash
PARAMS ((const void *x
));
185 static int const_str_htab_eq
PARAMS ((const void *x
, const void *y
));
186 static void const_str_htab_del
PARAMS ((void *));
187 static void asm_emit_uninitialised
PARAMS ((tree
, const char*, int, int));
189 static enum in_section
{ no_section
, in_text
, in_data
, in_named
190 #ifdef BSS_SECTION_ASM_OP
193 #ifdef EH_FRAME_SECTION_ASM_OP
196 #ifdef EXTRA_SECTIONS
199 } in_section
= no_section
;
201 /* Return a non-zero value if DECL has a section attribute. */
202 #ifndef IN_NAMED_SECTION
203 #define IN_NAMED_SECTION(DECL) \
204 ((TREE_CODE (DECL) == FUNCTION_DECL || TREE_CODE (DECL) == VAR_DECL) \
205 && DECL_SECTION_NAME (DECL) != NULL_TREE)
208 /* Text of section name when in_section == in_named. */
209 static const char *in_named_name
;
211 /* Define functions like text_section for any extra sections. */
212 #ifdef EXTRA_SECTION_FUNCTIONS
213 EXTRA_SECTION_FUNCTIONS
216 /* Tell assembler to switch to text section. */
221 if (in_section
!= in_text
)
223 fprintf (asm_out_file
, "%s\n", TEXT_SECTION_ASM_OP
);
224 in_section
= in_text
;
228 /* Tell assembler to switch to data section. */
233 if (in_section
!= in_data
)
235 if (flag_shared_data
)
237 #ifdef SHARED_SECTION_ASM_OP
238 fprintf (asm_out_file
, "%s\n", SHARED_SECTION_ASM_OP
);
240 fprintf (asm_out_file
, "%s\n", DATA_SECTION_ASM_OP
);
244 fprintf (asm_out_file
, "%s\n", DATA_SECTION_ASM_OP
);
246 in_section
= in_data
;
249 /* Tell assembler to ALWAYS switch to data section, in case
250 it's not sure where it it. */
253 force_data_section ()
255 in_section
= no_section
;
259 /* Tell assembler to switch to read-only data section. This is normally
263 readonly_data_section ()
265 #ifdef READONLY_DATA_SECTION
266 READONLY_DATA_SECTION (); /* Note this can call data_section. */
272 /* Determine if we're in the text section. */
277 return in_section
== in_text
;
280 /* Determine if we're in the data section. */
285 return in_section
== in_data
;
288 /* Tell assembler to change to section NAME for DECL.
289 If DECL is NULL, just switch to section NAME.
290 If NAME is NULL, get the name from DECL.
291 If RELOC is 1, the initializer for DECL contains relocs. */
294 named_section (decl
, name
, reloc
)
297 int reloc ATTRIBUTE_UNUSED
;
299 if (decl
!= NULL_TREE
&& !DECL_P (decl
))
302 name
= TREE_STRING_POINTER (DECL_SECTION_NAME (decl
));
304 if (in_section
!= in_named
|| strcmp (name
, in_named_name
))
306 #ifdef ASM_OUTPUT_SECTION_NAME
307 ASM_OUTPUT_SECTION_NAME (asm_out_file
, decl
, name
, reloc
);
309 /* Section attributes are not supported if this macro isn't provided -
310 some host formats don't support them at all. The front-end should
311 already have flagged this as an error. */
315 in_named_name
= ggc_strdup (name
);
316 in_section
= in_named
;
320 #ifdef BSS_SECTION_ASM_OP
322 /* Tell the assembler to switch to the bss section. */
327 if (in_section
!= in_bss
)
329 #ifdef SHARED_BSS_SECTION_ASM_OP
330 if (flag_shared_data
)
331 fprintf (asm_out_file
, "%s\n", SHARED_BSS_SECTION_ASM_OP
);
334 fprintf (asm_out_file
, "%s\n", BSS_SECTION_ASM_OP
);
340 #ifdef ASM_OUTPUT_BSS
342 /* Utility function for ASM_OUTPUT_BSS for targets to use if
343 they don't support alignments in .bss.
344 ??? It is believed that this function will work in most cases so such
345 support is localized here. */
348 asm_output_bss (file
, decl
, name
, size
, rounded
)
350 tree decl ATTRIBUTE_UNUSED
;
352 int size ATTRIBUTE_UNUSED
, rounded
;
354 ASM_GLOBALIZE_LABEL (file
, name
);
356 #ifdef ASM_DECLARE_OBJECT_NAME
357 last_assemble_variable_decl
= decl
;
358 ASM_DECLARE_OBJECT_NAME (file
, name
, decl
);
360 /* Standard thing is just output label for the object. */
361 ASM_OUTPUT_LABEL (file
, name
);
362 #endif /* ASM_DECLARE_OBJECT_NAME */
363 ASM_OUTPUT_SKIP (file
, rounded
);
368 #ifdef ASM_OUTPUT_ALIGNED_BSS
370 /* Utility function for targets to use in implementing
371 ASM_OUTPUT_ALIGNED_BSS.
372 ??? It is believed that this function will work in most cases so such
373 support is localized here. */
376 asm_output_aligned_bss (file
, decl
, name
, size
, align
)
382 ASM_GLOBALIZE_LABEL (file
, name
);
384 ASM_OUTPUT_ALIGN (file
, floor_log2 (align
/ BITS_PER_UNIT
));
385 #ifdef ASM_DECLARE_OBJECT_NAME
386 last_assemble_variable_decl
= decl
;
387 ASM_DECLARE_OBJECT_NAME (file
, name
, decl
);
389 /* Standard thing is just output label for the object. */
390 ASM_OUTPUT_LABEL (file
, name
);
391 #endif /* ASM_DECLARE_OBJECT_NAME */
392 ASM_OUTPUT_SKIP (file
, size
? size
: 1);
397 #endif /* BSS_SECTION_ASM_OP */
399 #ifdef EH_FRAME_SECTION_ASM_OP
403 if (in_section
!= in_eh_frame
)
405 fprintf (asm_out_file
, "%s\n", EH_FRAME_SECTION_ASM_OP
);
406 in_section
= in_eh_frame
;
411 /* Switch to the section for function DECL.
413 If DECL is NULL_TREE, switch to the text section.
414 ??? It's not clear that we will ever be passed NULL_TREE, but it's
415 safer to handle it. */
418 function_section (decl
)
421 if (decl
!= NULL_TREE
422 && DECL_SECTION_NAME (decl
) != NULL_TREE
)
423 named_section (decl
, (char *) 0, 0);
428 /* Switch to section for variable DECL.
430 RELOC is the `reloc' argument to SELECT_SECTION. */
433 variable_section (decl
, reloc
)
437 if (IN_NAMED_SECTION (decl
))
438 named_section (decl
, NULL
, reloc
);
441 /* C++ can have const variables that get initialized from constructors,
442 and thus can not be in a readonly section. We prevent this by
443 verifying that the initial value is constant for objects put in a
446 error_mark_node is used by the C front end to indicate that the
447 initializer has not been seen yet. In this case, we assume that
448 the initializer must be constant.
450 C++ uses error_mark_node for variables that have complicated
451 initializers, but these variables go in BSS so we won't be called
454 #ifdef SELECT_SECTION
455 SELECT_SECTION (decl
, reloc
);
457 if (DECL_READONLY_SECTION (decl
, reloc
))
458 readonly_data_section ();
465 /* Tell assembler to switch to the section for the exception handling
471 #if defined (EXCEPTION_SECTION)
472 EXCEPTION_SECTION ();
474 #ifdef ASM_OUTPUT_SECTION_NAME
475 named_section (NULL_TREE
, ".gcc_except_table", 0);
480 readonly_data_section ();
485 /* Given NAME, a putative register name, discard any customary prefixes. */
488 strip_reg_name (name
)
491 #ifdef REGISTER_PREFIX
492 if (!strncmp (name
, REGISTER_PREFIX
, strlen (REGISTER_PREFIX
)))
493 name
+= strlen (REGISTER_PREFIX
);
495 if (name
[0] == '%' || name
[0] == '#')
500 /* Decode an `asm' spec for a declaration as a register name.
501 Return the register number, or -1 if nothing specified,
502 or -2 if the ASMSPEC is not `cc' or `memory' and is not recognized,
503 or -3 if ASMSPEC is `cc' and is not recognized,
504 or -4 if ASMSPEC is `memory' and is not recognized.
505 Accept an exact spelling or a decimal number.
506 Prefixes such as % are optional. */
509 decode_reg_name (asmspec
)
516 /* Get rid of confusing prefixes. */
517 asmspec
= strip_reg_name (asmspec
);
519 /* Allow a decimal number as a "register name". */
520 for (i
= strlen (asmspec
) - 1; i
>= 0; i
--)
521 if (! (asmspec
[i
] >= '0' && asmspec
[i
] <= '9'))
523 if (asmspec
[0] != 0 && i
< 0)
526 if (i
< FIRST_PSEUDO_REGISTER
&& i
>= 0)
532 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
534 && ! strcmp (asmspec
, strip_reg_name (reg_names
[i
])))
537 #ifdef ADDITIONAL_REGISTER_NAMES
539 static struct { const char *name
; int number
; } table
[]
540 = ADDITIONAL_REGISTER_NAMES
;
542 for (i
= 0; i
< (int) ARRAY_SIZE (table
); i
++)
543 if (! strcmp (asmspec
, table
[i
].name
))
544 return table
[i
].number
;
546 #endif /* ADDITIONAL_REGISTER_NAMES */
548 if (!strcmp (asmspec
, "memory"))
551 if (!strcmp (asmspec
, "cc"))
560 /* Create the DECL_RTL for a VAR_DECL or FUNCTION_DECL. DECL should
561 have static storage duration. In other words, it should not be an
562 automatic variable, including PARM_DECLs.
564 There is, however, one exception: this function handles variables
565 explicitly placed in a particular register by the user.
567 ASMSPEC, if not 0, is the string which the user specified as the
568 assembler symbol name.
570 This is never called for PARM_DECL nodes. */
573 make_decl_rtl (decl
, asmspec
)
577 int top_level
= (DECL_CONTEXT (decl
) == NULL_TREE
);
578 const char *name
= 0;
579 const char *new_name
= 0;
582 /* Check that we are not being given an automatic variable. */
583 /* A weak alias has TREE_PUBLIC set but not the other bits. */
584 if (TREE_CODE (decl
) == PARM_DECL
585 || TREE_CODE (decl
) == RESULT_DECL
586 || (TREE_CODE (decl
) == VAR_DECL
587 && !TREE_STATIC (decl
)
588 && !TREE_PUBLIC (decl
)
589 && !DECL_EXTERNAL (decl
)
590 && !DECL_REGISTER (decl
)))
592 /* And that we were not given a type or a label. */
593 else if (TREE_CODE (decl
) == TYPE_DECL
594 || TREE_CODE (decl
) == LABEL_DECL
)
597 /* For a duplicate declaration, we can be called twice on the
598 same DECL node. Don't discard the RTL already made. */
599 if (DECL_RTL_SET_P (decl
))
601 /* If the old RTL had the wrong mode, fix the mode. */
602 if (GET_MODE (DECL_RTL (decl
)) != DECL_MODE (decl
))
604 rtx rtl
= DECL_RTL (decl
);
605 PUT_MODE (rtl
, DECL_MODE (decl
));
608 /* ??? Another way to do this would be to do what halfpic.c does
609 and maintain a hashed table of such critters. */
610 /* ??? Another way to do this would be to pass a flag bit to
611 ENCODE_SECTION_INFO saying whether this is a new decl or not. */
612 /* Let the target reassign the RTL if it wants.
613 This is necessary, for example, when one machine specific
614 decl attribute overrides another. */
615 #ifdef REDO_SECTION_INFO_P
616 if (REDO_SECTION_INFO_P (decl
))
617 ENCODE_SECTION_INFO (decl
);
622 new_name
= name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
624 reg_number
= decode_reg_name (asmspec
);
625 if (reg_number
== -2)
627 /* ASMSPEC is given, and not the name of a register. Mark the
628 name with a star so assemble_name won't munge it. */
629 char *starred
= alloca (strlen (asmspec
) + 2);
631 strcpy (starred
+ 1, asmspec
);
635 if (TREE_CODE (decl
) != FUNCTION_DECL
&& DECL_REGISTER (decl
))
637 /* First detect errors in declaring global registers. */
638 if (reg_number
== -1)
639 error_with_decl (decl
, "register name not specified for `%s'");
640 else if (reg_number
< 0)
641 error_with_decl (decl
, "invalid register name for `%s'");
642 else if (TYPE_MODE (TREE_TYPE (decl
)) == BLKmode
)
643 error_with_decl (decl
,
644 "data type of `%s' isn't suitable for a register");
645 else if (! HARD_REGNO_MODE_OK (reg_number
, TYPE_MODE (TREE_TYPE (decl
))))
646 error_with_decl (decl
,
647 "register specified for `%s' isn't suitable for data type");
648 /* Now handle properly declared static register variables. */
653 if (DECL_INITIAL (decl
) != 0 && TREE_STATIC (decl
))
655 DECL_INITIAL (decl
) = 0;
656 error ("global register variable has initial value");
658 if (TREE_THIS_VOLATILE (decl
))
659 warning ("volatile register variables don't work as you might wish");
661 /* If the user specified one of the eliminables registers here,
662 e.g., FRAME_POINTER_REGNUM, we don't want to get this variable
663 confused with that register and be eliminated. Although this
664 usage is somewhat suspect, we nevertheless use the following
665 kludge to avoid setting DECL_RTL to frame_pointer_rtx. */
668 gen_rtx_REG (DECL_MODE (decl
),
669 FIRST_PSEUDO_REGISTER
));
670 REGNO (DECL_RTL (decl
)) = reg_number
;
671 REG_USERVAR_P (DECL_RTL (decl
)) = 1;
673 if (TREE_STATIC (decl
))
675 /* Make this register global, so not usable for anything
677 #ifdef ASM_DECLARE_REGISTER_GLOBAL
678 ASM_DECLARE_REGISTER_GLOBAL (asm_out_file
, decl
, reg_number
, name
);
680 nregs
= HARD_REGNO_NREGS (reg_number
, DECL_MODE (decl
));
682 globalize_reg (reg_number
+ --nregs
);
685 /* As a register variable, it has no section. */
690 /* Now handle ordinary static variables and functions (in memory).
691 Also handle vars declared register invalidly. */
693 if (reg_number
>= 0 || reg_number
== -3)
694 error_with_decl (decl
,
695 "register name given for non-register variable `%s'");
697 /* Specifying a section attribute on a variable forces it into a
698 non-.bss section, and thus it cannot be common. */
699 if (TREE_CODE (decl
) == VAR_DECL
700 && DECL_SECTION_NAME (decl
) != NULL_TREE
701 && DECL_INITIAL (decl
) == NULL_TREE
702 && DECL_COMMON (decl
))
703 DECL_COMMON (decl
) = 0;
705 /* Can't use just the variable's own name for a variable
706 whose scope is less than the whole file, unless it's a member
707 of a local class (which will already be unambiguous).
708 Concatenate a distinguishing number. */
709 if (!top_level
&& !TREE_PUBLIC (decl
)
710 && ! (DECL_CONTEXT (decl
) && TYPE_P (DECL_CONTEXT (decl
)))
714 ASM_FORMAT_PRIVATE_NAME (label
, name
, var_labelno
);
719 /* When -fprefix-function-name is used, the functions
720 names are prefixed. Only nested function names are not
722 else if (flag_prefix_function_name
&& TREE_CODE (decl
) == FUNCTION_DECL
)
724 size_t name_len
= IDENTIFIER_LENGTH (DECL_ASSEMBLER_NAME (decl
));
727 pname
= alloca (name_len
+ CHKR_PREFIX_SIZE
+ 1);
728 memcpy (pname
, CHKR_PREFIX
, CHKR_PREFIX_SIZE
);
729 memcpy (pname
+ CHKR_PREFIX_SIZE
, name
, name_len
+ 1);
733 if (name
!= new_name
)
735 SET_DECL_ASSEMBLER_NAME (decl
, get_identifier (new_name
));
736 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
739 /* If this variable is to be treated as volatile, show its
740 tree node has side effects. */
741 if ((flag_volatile_global
&& TREE_CODE (decl
) == VAR_DECL
742 && TREE_PUBLIC (decl
))
743 || ((flag_volatile_static
&& TREE_CODE (decl
) == VAR_DECL
744 && (TREE_PUBLIC (decl
) || TREE_STATIC (decl
)))))
745 TREE_SIDE_EFFECTS (decl
) = 1;
747 SET_DECL_RTL (decl
, gen_rtx_MEM (DECL_MODE (decl
),
748 gen_rtx_SYMBOL_REF (Pmode
, name
)));
749 if (TREE_CODE (decl
) != FUNCTION_DECL
)
750 set_mem_attributes (DECL_RTL (decl
), decl
, 1);
752 /* Optionally set flags or add text to the name to record information
753 such as that it is a function name.
754 If the name is changed, the macro ASM_OUTPUT_LABELREF
755 will have to know how to strip this information. */
756 #ifdef ENCODE_SECTION_INFO
757 ENCODE_SECTION_INFO (decl
);
761 /* Make the rtl for variable VAR be volatile.
762 Use this only for static variables. */
765 make_var_volatile (var
)
768 if (GET_CODE (DECL_RTL (var
)) != MEM
)
771 MEM_VOLATILE_P (DECL_RTL (var
)) = 1;
774 /* Output alignment directive to align for constant expression EXP. */
777 assemble_constant_align (exp
)
782 /* Align the location counter as required by EXP's data type. */
783 align
= TYPE_ALIGN (TREE_TYPE (exp
));
784 #ifdef CONSTANT_ALIGNMENT
785 align
= CONSTANT_ALIGNMENT (exp
, align
);
788 if (align
> BITS_PER_UNIT
)
789 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
792 /* Output a string of literal assembler code
793 for an `asm' keyword used between functions. */
796 assemble_asm (string
)
801 if (TREE_CODE (string
) == ADDR_EXPR
)
802 string
= TREE_OPERAND (string
, 0);
804 fprintf (asm_out_file
, "\t%s\n", TREE_STRING_POINTER (string
));
807 #if 0 /* This should no longer be needed, because
808 flag_gnu_linker should be 0 on these systems,
809 which should prevent any output
810 if ASM_OUTPUT_CONSTRUCTOR and ASM_OUTPUT_DESTRUCTOR are absent. */
811 #if !(defined(DBX_DEBUGGING_INFO) && !defined(FASCIST_ASSEMBLER))
812 #ifndef ASM_OUTPUT_CONSTRUCTOR
813 #define ASM_OUTPUT_CONSTRUCTOR(file, name)
815 #ifndef ASM_OUTPUT_DESTRUCTOR
816 #define ASM_OUTPUT_DESTRUCTOR(file, name)
821 /* Record an element in the table of global destructors.
822 How this is done depends on what sort of assembler and linker
825 NAME should be the name of a global function to be called
826 at exit time. This name is output using assemble_name. */
829 assemble_destructor (name
)
832 #ifdef ASM_OUTPUT_DESTRUCTOR
833 ASM_OUTPUT_DESTRUCTOR (asm_out_file
, name
);
837 /* Now tell GNU LD that this is part of the static destructor set. */
838 /* This code works for any machine provided you use GNU as/ld. */
839 fprintf (asm_out_file
, "%s\"___DTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
840 assemble_name (asm_out_file
, name
);
841 fputc ('\n', asm_out_file
);
846 /* Likewise for global constructors. */
849 assemble_constructor (name
)
852 #ifdef ASM_OUTPUT_CONSTRUCTOR
853 ASM_OUTPUT_CONSTRUCTOR (asm_out_file
, name
);
857 /* Now tell GNU LD that this is part of the static constructor set. */
858 /* This code works for any machine provided you use GNU as/ld. */
859 fprintf (asm_out_file
, "%s\"___CTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
860 assemble_name (asm_out_file
, name
);
861 fputc ('\n', asm_out_file
);
866 /* Likewise for entries we want to record for garbage collection.
867 Garbage collection is still under development. */
870 assemble_gc_entry (name
)
873 #ifdef ASM_OUTPUT_GC_ENTRY
874 ASM_OUTPUT_GC_ENTRY (asm_out_file
, name
);
878 /* Now tell GNU LD that this is part of the static constructor set. */
879 fprintf (asm_out_file
, "%s\"___PTR_LIST__\",22,0,0,", ASM_STABS_OP
);
880 assemble_name (asm_out_file
, name
);
881 fputc ('\n', asm_out_file
);
886 /* CONSTANT_POOL_BEFORE_FUNCTION may be defined as an expression with
887 a non-zero value if the constant pool should be output before the
888 start of the function, or a zero value if the pool should output
889 after the end of the function. The default is to put it before the
892 #ifndef CONSTANT_POOL_BEFORE_FUNCTION
893 #define CONSTANT_POOL_BEFORE_FUNCTION 1
896 /* Output assembler code for the constant pool of a function and associated
897 with defining the name of the function. DECL describes the function.
898 NAME is the function's name. For the constant pool, we use the current
899 constant pool data. */
902 assemble_start_function (decl
, fnname
)
908 /* The following code does not need preprocessing in the assembler. */
912 if (CONSTANT_POOL_BEFORE_FUNCTION
)
913 output_constant_pool (fnname
, decl
);
915 #ifdef ASM_OUTPUT_SECTION_NAME
916 /* If the function is to be put in its own section and it's not in a section
917 already, indicate so. */
918 if ((flag_function_sections
919 && DECL_SECTION_NAME (decl
) == NULL_TREE
)
920 || UNIQUE_SECTION_P (decl
))
921 UNIQUE_SECTION (decl
, 0);
924 function_section (decl
);
926 /* Tell assembler to move to target machine's alignment for functions. */
927 align
= floor_log2 (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
929 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
931 /* Handle a user-specified function alignment.
932 Note that we still need to align to FUNCTION_BOUNDARY, as above,
933 because ASM_OUTPUT_MAX_SKIP_ALIGN might not do any alignment at all. */
934 if (align_functions_log
> align
)
936 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
937 ASM_OUTPUT_MAX_SKIP_ALIGN (asm_out_file
,
938 align_functions_log
, align_functions
-1);
940 ASM_OUTPUT_ALIGN (asm_out_file
, align_functions_log
);
944 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
945 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file
, fnname
);
948 #ifdef SDB_DEBUGGING_INFO
949 /* Output SDB definition of the function. */
950 if (write_symbols
== SDB_DEBUG
)
951 sdbout_mark_begin_function ();
954 #ifdef DBX_DEBUGGING_INFO
955 /* Output DBX definition of the function. */
956 if (write_symbols
== DBX_DEBUG
)
957 dbxout_begin_function (decl
);
960 /* Make function name accessible from other files, if appropriate. */
962 if (TREE_PUBLIC (decl
))
964 if (! first_global_object_name
)
969 STRIP_NAME_ENCODING (p
, fnname
);
970 name
= permalloc (strlen (p
) + 1);
973 if (! DECL_WEAK (decl
) && ! DECL_ONE_ONLY (decl
))
974 first_global_object_name
= name
;
976 weak_global_object_name
= name
;
979 #ifdef ASM_WEAKEN_LABEL
980 if (DECL_WEAK (decl
))
982 ASM_WEAKEN_LABEL (asm_out_file
, fnname
);
983 /* Remove this function from the pending weak list so that
984 we do not emit multiple .weak directives for it. */
985 remove_from_pending_weak_list
986 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
990 ASM_GLOBALIZE_LABEL (asm_out_file
, fnname
);
993 /* Do any machine/system dependent processing of the function name */
994 #ifdef ASM_DECLARE_FUNCTION_NAME
995 ASM_DECLARE_FUNCTION_NAME (asm_out_file
, fnname
, current_function_decl
);
997 /* Standard thing is just output label for the function. */
998 ASM_OUTPUT_LABEL (asm_out_file
, fnname
);
999 #endif /* ASM_DECLARE_FUNCTION_NAME */
1002 /* Output assembler code associated with defining the size of the
1003 function. DECL describes the function. NAME is the function's name. */
1006 assemble_end_function (decl
, fnname
)
1010 #ifdef ASM_DECLARE_FUNCTION_SIZE
1011 ASM_DECLARE_FUNCTION_SIZE (asm_out_file
, fnname
, decl
);
1013 if (! CONSTANT_POOL_BEFORE_FUNCTION
)
1015 output_constant_pool (fnname
, decl
);
1016 function_section (decl
); /* need to switch back */
1019 /* Output any constants which should appear after the function. */
1020 output_after_function_constants ();
1023 /* Assemble code to leave SIZE bytes of zeros. */
1026 assemble_zeros (size
)
1029 /* Do no output if -fsyntax-only. */
1030 if (flag_syntax_only
)
1033 #ifdef ASM_NO_SKIP_IN_TEXT
1034 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
1035 so we must output 0s explicitly in the text section. */
1036 if (ASM_NO_SKIP_IN_TEXT
&& in_text_section ())
1040 for (i
= 0; i
< size
- 20; i
+= 20)
1043 fprintf (asm_out_file
,
1044 "%s0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n", ASM_BYTE_OP
);
1046 fprintf (asm_out_file
,
1047 "\tbyte 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n");
1053 fprintf (asm_out_file
, "%s0", ASM_BYTE_OP
);
1055 fprintf (asm_out_file
, "\tbyte 0");
1058 for (; i
< size
; i
++)
1059 fprintf (asm_out_file
, ",0");
1060 fprintf (asm_out_file
, "\n");
1066 ASM_OUTPUT_SKIP (asm_out_file
, size
);
1069 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
1072 assemble_align (align
)
1075 if (align
> BITS_PER_UNIT
)
1076 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
1079 /* Assemble a string constant with the specified C string as contents. */
1082 assemble_string (p
, size
)
1089 /* If the string is very long, split it up. */
1093 int thissize
= size
- pos
;
1094 if (thissize
> maximum
)
1097 ASM_OUTPUT_ASCII (asm_out_file
, p
, thissize
);
1105 #if defined ASM_OUTPUT_ALIGNED_DECL_LOCAL
1106 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1107 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1109 #if defined ASM_OUTPUT_ALIGNED_LOCAL
1110 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1111 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, DECL_ALIGN (decl))
1113 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1114 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded)
1118 #if defined ASM_OUTPUT_ALIGNED_BSS
1119 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1120 ASM_OUTPUT_ALIGNED_BSS (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1122 #if defined ASM_OUTPUT_BSS
1123 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1124 ASM_OUTPUT_BSS (asm_out_file, decl, name, size, rounded)
1130 #if defined ASM_OUTPUT_ALIGNED_DECL_COMMON
1131 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1132 ASM_OUTPUT_ALIGNED_DECL_COMMON (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1134 #if defined ASM_OUTPUT_ALIGNED_COMMON
1135 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1136 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file, name, size, DECL_ALIGN (decl))
1138 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1139 ASM_OUTPUT_COMMON (asm_out_file, name, size, rounded)
1144 asm_emit_uninitialised (decl
, name
, size
, rounded
)
1147 int size ATTRIBUTE_UNUSED
;
1148 int rounded ATTRIBUTE_UNUSED
;
1156 destination
= asm_dest_local
;
1158 if (TREE_PUBLIC (decl
))
1160 #if defined ASM_EMIT_BSS
1161 if (! DECL_COMMON (decl
))
1162 destination
= asm_dest_bss
;
1165 destination
= asm_dest_common
;
1168 if (flag_shared_data
)
1170 switch (destination
)
1172 #ifdef ASM_OUTPUT_SHARED_BSS
1174 ASM_OUTPUT_SHARED_BSS (asm_out_file
, decl
, name
, size
, rounded
);
1177 #ifdef ASM_OUTPUT_SHARED_COMMON
1178 case asm_dest_common
:
1179 ASM_OUTPUT_SHARED_COMMON (asm_out_file
, name
, size
, rounded
);
1182 #ifdef ASM_OUTPUT_SHARED_LOCAL
1183 case asm_dest_local
:
1184 ASM_OUTPUT_SHARED_LOCAL (asm_out_file
, name
, size
, rounded
);
1192 #ifdef ASM_OUTPUT_SECTION_NAME
1193 /* We already know that DECL_SECTION_NAME() == NULL. */
1194 if (flag_data_sections
!= 0 || UNIQUE_SECTION_P (decl
))
1195 UNIQUE_SECTION (decl
, 0);
1198 switch (destination
)
1202 ASM_EMIT_BSS (decl
, name
, size
, rounded
);
1205 case asm_dest_common
:
1206 ASM_EMIT_COMMON (decl
, name
, size
, rounded
);
1208 case asm_dest_local
:
1209 ASM_EMIT_LOCAL (decl
, name
, size
, rounded
);
1218 /* Assemble everything that is needed for a variable or function declaration.
1219 Not used for automatic variables, and not used for function definitions.
1220 Should not be called for variables of incomplete structure type.
1222 TOP_LEVEL is nonzero if this variable has file scope.
1223 AT_END is nonzero if this is the special handling, at end of compilation,
1224 to define things that have had only tentative definitions.
1225 DONT_OUTPUT_DATA if nonzero means don't actually output the
1226 initial value (that will be done by the caller). */
1229 assemble_variable (decl
, top_level
, at_end
, dont_output_data
)
1231 int top_level ATTRIBUTE_UNUSED
;
1232 int at_end ATTRIBUTE_UNUSED
;
1233 int dont_output_data
;
1235 register const char *name
;
1238 enum in_section saved_in_section
;
1240 last_assemble_variable_decl
= 0;
1242 if (DECL_RTL_SET_P (decl
) && GET_CODE (DECL_RTL (decl
)) == REG
)
1244 /* Do output symbol info for global register variables, but do nothing
1247 if (TREE_ASM_WRITTEN (decl
))
1249 TREE_ASM_WRITTEN (decl
) = 1;
1251 /* Do no output if -fsyntax-only. */
1252 if (flag_syntax_only
)
1255 #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
1256 /* File-scope global variables are output here. */
1257 if ((write_symbols
== DBX_DEBUG
|| write_symbols
== XCOFF_DEBUG
)
1259 dbxout_symbol (decl
, 0);
1261 #ifdef SDB_DEBUGGING_INFO
1262 if (write_symbols
== SDB_DEBUG
&& top_level
1263 /* Leave initialized global vars for end of compilation;
1264 see comment in compile_file. */
1265 && (TREE_PUBLIC (decl
) == 0 || DECL_INITIAL (decl
) == 0))
1266 sdbout_symbol (decl
, 0);
1269 /* Don't output any DWARF debugging information for variables here.
1270 In the case of local variables, the information for them is output
1271 when we do our recursive traversal of the tree representation for
1272 the entire containing function. In the case of file-scope variables,
1273 we output information for all of them at the very end of compilation
1274 while we are doing our final traversal of the chain of file-scope
1280 /* Normally no need to say anything here for external references,
1281 since assemble_external is called by the language-specific code
1282 when a declaration is first seen. */
1284 if (DECL_EXTERNAL (decl
))
1287 /* Output no assembler code for a function declaration.
1288 Only definitions of functions output anything. */
1290 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1293 /* If type was incomplete when the variable was declared,
1294 see if it is complete now. */
1296 if (DECL_SIZE (decl
) == 0)
1297 layout_decl (decl
, 0);
1299 /* Still incomplete => don't allocate it; treat the tentative defn
1300 (which is what it must have been) as an `extern' reference. */
1302 if (!dont_output_data
&& DECL_SIZE (decl
) == 0)
1304 error_with_file_and_line (DECL_SOURCE_FILE (decl
),
1305 DECL_SOURCE_LINE (decl
),
1306 "storage size of `%s' isn't known",
1307 IDENTIFIER_POINTER (DECL_NAME (decl
)));
1308 TREE_ASM_WRITTEN (decl
) = 1;
1312 /* The first declaration of a variable that comes through this function
1313 decides whether it is global (in C, has external linkage)
1314 or local (in C, has internal linkage). So do nothing more
1315 if this function has already run. */
1317 if (TREE_ASM_WRITTEN (decl
))
1320 TREE_ASM_WRITTEN (decl
) = 1;
1322 /* Do no output if -fsyntax-only. */
1323 if (flag_syntax_only
)
1328 if (! dont_output_data
1329 && ! host_integerp (DECL_SIZE_UNIT (decl
), 1))
1331 error_with_decl (decl
, "size of variable `%s' is too large");
1335 name
= XSTR (XEXP (DECL_RTL (decl
), 0), 0);
1336 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
)
1337 && ! first_global_object_name
1338 && ! (DECL_COMMON (decl
) && (DECL_INITIAL (decl
) == 0
1339 || DECL_INITIAL (decl
) == error_mark_node
))
1340 && ! DECL_WEAK (decl
)
1341 && ! DECL_ONE_ONLY (decl
))
1346 STRIP_NAME_ENCODING (p
, name
);
1347 xname
= permalloc (strlen (p
) + 1);
1349 first_global_object_name
= xname
;
1352 /* Compute the alignment of this data. */
1354 align
= DECL_ALIGN (decl
);
1356 /* In the case for initialing an array whose length isn't specified,
1357 where we have not yet been able to do the layout,
1358 figure out the proper alignment now. */
1359 if (dont_output_data
&& DECL_SIZE (decl
) == 0
1360 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
)
1361 align
= MAX (align
, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl
))));
1363 /* Some object file formats have a maximum alignment which they support.
1364 In particular, a.out format supports a maximum alignment of 4. */
1365 #ifndef MAX_OFILE_ALIGNMENT
1366 #define MAX_OFILE_ALIGNMENT BIGGEST_ALIGNMENT
1368 if (align
> MAX_OFILE_ALIGNMENT
)
1370 warning_with_decl (decl
,
1371 "alignment of `%s' is greater than maximum object file alignment. Using %d.",
1372 MAX_OFILE_ALIGNMENT
/BITS_PER_UNIT
);
1373 align
= MAX_OFILE_ALIGNMENT
;
1376 /* On some machines, it is good to increase alignment sometimes. */
1377 #ifdef DATA_ALIGNMENT
1378 align
= DATA_ALIGNMENT (TREE_TYPE (decl
), align
);
1380 #ifdef CONSTANT_ALIGNMENT
1381 if (DECL_INITIAL (decl
) != 0 && DECL_INITIAL (decl
) != error_mark_node
)
1382 align
= CONSTANT_ALIGNMENT (DECL_INITIAL (decl
), align
);
1385 /* Reset the alignment in case we have made it tighter, so we can benefit
1386 from it in get_pointer_alignment. */
1387 DECL_ALIGN (decl
) = align
;
1389 /* Handle uninitialized definitions. */
1391 if ((DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
)
1392 /* If the target can't output uninitialized but not common global data
1393 in .bss, then we have to use .data. */
1394 #if ! defined ASM_EMIT_BSS
1395 && DECL_COMMON (decl
)
1397 && DECL_SECTION_NAME (decl
) == NULL_TREE
1398 && ! dont_output_data
)
1400 unsigned HOST_WIDE_INT size
= tree_low_cst (DECL_SIZE_UNIT (decl
), 1);
1401 unsigned HOST_WIDE_INT rounded
= size
;
1403 /* Don't allocate zero bytes of common,
1404 since that means "undefined external" in the linker. */
1408 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1409 so that each uninitialized object starts on such a boundary. */
1410 rounded
+= (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1;
1411 rounded
= (rounded
/ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1412 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1414 /* Don't continue this line--convex cc version 4.1 would lose. */
1415 #if !defined(ASM_OUTPUT_ALIGNED_COMMON) && !defined(ASM_OUTPUT_ALIGNED_DECL_COMMON) && !defined(ASM_OUTPUT_ALIGNED_BSS)
1416 if ((unsigned HOST_WIDE_INT
) DECL_ALIGN (decl
) / BITS_PER_UNIT
> rounded
)
1418 (decl
, "requested alignment for %s is greater than implemented alignment of %d.",rounded
);
1421 #ifdef DBX_DEBUGGING_INFO
1422 /* File-scope global variables are output here. */
1423 if (write_symbols
== DBX_DEBUG
&& top_level
)
1424 dbxout_symbol (decl
, 0);
1426 #ifdef SDB_DEBUGGING_INFO
1427 if (write_symbols
== SDB_DEBUG
&& top_level
1428 /* Leave initialized global vars for end of compilation;
1429 see comment in compile_file. */
1430 && (TREE_PUBLIC (decl
) == 0 || DECL_INITIAL (decl
) == 0))
1431 sdbout_symbol (decl
, 0);
1434 /* Don't output any DWARF debugging information for variables here.
1435 In the case of local variables, the information for them is output
1436 when we do our recursive traversal of the tree representation for
1437 the entire containing function. In the case of file-scope variables,
1438 we output information for all of them at the very end of compilation
1439 while we are doing our final traversal of the chain of file-scope
1442 #if 0 /* ??? We should either delete this or add a comment describing what
1443 it was intended to do and why we shouldn't delete it. */
1444 if (flag_shared_data
)
1447 asm_emit_uninitialised (decl
, name
, size
, rounded
);
1452 /* Handle initialized definitions.
1453 Also handle uninitialized global definitions if -fno-common and the
1454 target doesn't support ASM_OUTPUT_BSS. */
1456 /* First make the assembler name(s) global if appropriate. */
1457 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
))
1459 #ifdef ASM_WEAKEN_LABEL
1460 if (DECL_WEAK (decl
))
1462 ASM_WEAKEN_LABEL (asm_out_file
, name
);
1463 /* Remove this variable from the pending weak list so that
1464 we do not emit multiple .weak directives for it. */
1465 remove_from_pending_weak_list
1466 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
1470 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
1473 for (d
= equivalents
; d
; d
= TREE_CHAIN (d
))
1475 tree e
= TREE_VALUE (d
);
1476 if (TREE_PUBLIC (e
) && DECL_NAME (e
))
1477 ASM_GLOBALIZE_LABEL (asm_out_file
,
1478 XSTR (XEXP (DECL_RTL (e
), 0), 0));
1482 /* Output any data that we will need to use the address of. */
1483 if (DECL_INITIAL (decl
) == error_mark_node
)
1484 reloc
= contains_pointers_p (TREE_TYPE (decl
));
1485 else if (DECL_INITIAL (decl
))
1486 reloc
= output_addressed_constants (DECL_INITIAL (decl
));
1488 #ifdef ASM_OUTPUT_SECTION_NAME
1489 if ((flag_data_sections
!= 0 && DECL_SECTION_NAME (decl
) == NULL_TREE
)
1490 || UNIQUE_SECTION_P (decl
))
1491 UNIQUE_SECTION (decl
, reloc
);
1494 /* Switch to the appropriate section. */
1495 variable_section (decl
, reloc
);
1497 /* dbxout.c needs to know this. */
1498 if (in_text_section ())
1499 DECL_IN_TEXT_SECTION (decl
) = 1;
1501 /* Record current section so we can restore it if dbxout.c clobbers it. */
1502 saved_in_section
= in_section
;
1504 /* Output the dbx info now that we have chosen the section. */
1506 #ifdef DBX_DEBUGGING_INFO
1507 /* File-scope global variables are output here. */
1508 if (write_symbols
== DBX_DEBUG
&& top_level
)
1509 dbxout_symbol (decl
, 0);
1511 #ifdef SDB_DEBUGGING_INFO
1512 if (write_symbols
== SDB_DEBUG
&& top_level
1513 /* Leave initialized global vars for end of compilation;
1514 see comment in compile_file. */
1515 && (TREE_PUBLIC (decl
) == 0 || DECL_INITIAL (decl
) == 0))
1516 sdbout_symbol (decl
, 0);
1519 /* Don't output any DWARF debugging information for variables here.
1520 In the case of local variables, the information for them is output
1521 when we do our recursive traversal of the tree representation for
1522 the entire containing function. In the case of file-scope variables,
1523 we output information for all of them at the very end of compilation
1524 while we are doing our final traversal of the chain of file-scope
1527 /* If the debugging output changed sections, reselect the section
1528 that's supposed to be selected. */
1529 if (in_section
!= saved_in_section
)
1530 variable_section (decl
, reloc
);
1532 /* Output the alignment of this data. */
1533 if (align
> BITS_PER_UNIT
)
1534 ASM_OUTPUT_ALIGN (asm_out_file
,
1535 floor_log2 (DECL_ALIGN (decl
) / BITS_PER_UNIT
));
1537 /* Do any machine/system dependent processing of the object. */
1538 #ifdef ASM_DECLARE_OBJECT_NAME
1539 last_assemble_variable_decl
= decl
;
1540 ASM_DECLARE_OBJECT_NAME (asm_out_file
, name
, decl
);
1542 /* Standard thing is just output label for the object. */
1543 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1544 #endif /* ASM_DECLARE_OBJECT_NAME */
1546 if (!dont_output_data
)
1548 if (DECL_INITIAL (decl
))
1549 /* Output the actual data. */
1550 output_constant (DECL_INITIAL (decl
),
1551 tree_low_cst (DECL_SIZE_UNIT (decl
), 1));
1553 /* Leave space for it. */
1554 assemble_zeros (tree_low_cst (DECL_SIZE_UNIT (decl
), 1));
1558 #ifdef XCOFF_DEBUGGING_INFO
1559 /* Unfortunately, the IBM assembler cannot handle stabx before the actual
1560 declaration. When something like ".stabx "aa:S-2",aa,133,0" is emitted
1561 and `aa' hasn't been output yet, the assembler generates a stab entry with
1562 a value of zero, in addition to creating an unnecessary external entry
1563 for `aa'. Hence, we must postpone dbxout_symbol to here at the end. */
1565 /* File-scope global variables are output here. */
1566 if (write_symbols
== XCOFF_DEBUG
&& top_level
)
1568 saved_in_section
= in_section
;
1570 dbxout_symbol (decl
, 0);
1572 if (in_section
!= saved_in_section
)
1573 variable_section (decl
, reloc
);
1576 /* There must be a statement after a label. */
1581 /* Return 1 if type TYPE contains any pointers. */
1584 contains_pointers_p (type
)
1587 switch (TREE_CODE (type
))
1590 case REFERENCE_TYPE
:
1591 /* I'm not sure whether OFFSET_TYPE needs this treatment,
1592 so I'll play safe and return 1. */
1598 case QUAL_UNION_TYPE
:
1601 /* For a type that has fields, see if the fields have pointers. */
1602 for (fields
= TYPE_FIELDS (type
); fields
; fields
= TREE_CHAIN (fields
))
1603 if (TREE_CODE (fields
) == FIELD_DECL
1604 && contains_pointers_p (TREE_TYPE (fields
)))
1610 /* An array type contains pointers if its element type does. */
1611 return contains_pointers_p (TREE_TYPE (type
));
1618 /* Output something to declare an external symbol to the assembler.
1619 (Most assemblers don't need this, so we normally output nothing.)
1620 Do nothing if DECL is not external. */
1623 assemble_external (decl
)
1624 tree decl ATTRIBUTE_UNUSED
;
1626 #ifdef ASM_OUTPUT_EXTERNAL
1627 if (DECL_P (decl
) && DECL_EXTERNAL (decl
) && TREE_PUBLIC (decl
))
1629 rtx rtl
= DECL_RTL (decl
);
1631 if (GET_CODE (rtl
) == MEM
&& GET_CODE (XEXP (rtl
, 0)) == SYMBOL_REF
1632 && ! SYMBOL_REF_USED (XEXP (rtl
, 0)))
1634 /* Some systems do require some output. */
1635 SYMBOL_REF_USED (XEXP (rtl
, 0)) = 1;
1636 ASM_OUTPUT_EXTERNAL (asm_out_file
, decl
, XSTR (XEXP (rtl
, 0), 0));
1642 /* Similar, for calling a library function FUN. */
1645 assemble_external_libcall (fun
)
1646 rtx fun ATTRIBUTE_UNUSED
;
1648 #ifdef ASM_OUTPUT_EXTERNAL_LIBCALL
1649 /* Declare library function name external when first used, if nec. */
1650 if (! SYMBOL_REF_USED (fun
))
1652 SYMBOL_REF_USED (fun
) = 1;
1653 ASM_OUTPUT_EXTERNAL_LIBCALL (asm_out_file
, fun
);
1658 /* Declare the label NAME global. */
1661 assemble_global (name
)
1664 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
1667 /* Assemble a label named NAME. */
1670 assemble_label (name
)
1673 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1676 /* Output to FILE a reference to the assembler name of a C-level name NAME.
1677 If NAME starts with a *, the rest of NAME is output verbatim.
1678 Otherwise NAME is transformed in an implementation-defined way
1679 (usually by the addition of an underscore).
1680 Many macros in the tm file are defined to call this function. */
1683 assemble_name (file
, name
)
1687 const char *real_name
;
1690 STRIP_NAME_ENCODING (real_name
, name
);
1691 if (flag_prefix_function_name
1692 && ! memcmp (real_name
, CHKR_PREFIX
, CHKR_PREFIX_SIZE
))
1693 real_name
= real_name
+ CHKR_PREFIX_SIZE
;
1695 id
= maybe_get_identifier (real_name
);
1697 TREE_SYMBOL_REFERENCED (id
) = 1;
1700 fputs (&name
[1], file
);
1702 ASM_OUTPUT_LABELREF (file
, name
);
1705 /* Allocate SIZE bytes writable static space with a gensym name
1706 and return an RTX to refer to its address. */
1709 assemble_static_space (size
)
1713 const char *namestring
;
1717 if (flag_shared_data
)
1721 ASM_GENERATE_INTERNAL_LABEL (name
, "LF", const_labelno
);
1723 namestring
= ggc_strdup (name
);
1725 x
= gen_rtx_SYMBOL_REF (Pmode
, namestring
);
1727 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
1728 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file
, NULL_TREE
, name
, size
,
1731 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1732 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file
, name
, size
, BIGGEST_ALIGNMENT
);
1735 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1736 so that each uninitialized object starts on such a boundary. */
1737 /* Variable `rounded' might or might not be used in ASM_OUTPUT_LOCAL. */
1738 int rounded ATTRIBUTE_UNUSED
1739 = ((size
+ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1)
1740 / (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1741 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1742 ASM_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
1749 /* Assemble the static constant template for function entry trampolines.
1750 This is done at most once per compilation.
1751 Returns an RTX for the address of the template. */
1753 #ifdef TRAMPOLINE_TEMPLATE
1755 assemble_trampoline_template ()
1761 /* By default, put trampoline templates in read-only data section. */
1763 #ifdef TRAMPOLINE_SECTION
1764 TRAMPOLINE_SECTION ();
1766 readonly_data_section ();
1769 /* Write the assembler code to define one. */
1770 align
= floor_log2 (TRAMPOLINE_ALIGNMENT
/ BITS_PER_UNIT
);
1772 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1774 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LTRAMP", 0);
1775 TRAMPOLINE_TEMPLATE (asm_out_file
);
1777 /* Record the rtl to refer to it. */
1778 ASM_GENERATE_INTERNAL_LABEL (label
, "LTRAMP", 0);
1779 name
= ggc_strdup (label
);
1780 return gen_rtx_SYMBOL_REF (Pmode
, name
);
1784 /* Assemble the integer constant X into an object of SIZE bytes.
1785 X must be either a CONST_INT or CONST_DOUBLE.
1787 Return 1 if we were able to output the constant, otherwise 0. If FORCE is
1788 non-zero, abort if we can't output the constant. */
1791 assemble_integer (x
, size
, force
)
1796 /* First try to use the standard 1, 2, 4, 8, and 16 byte
1797 ASM_OUTPUT... macros. */
1801 #ifdef ASM_OUTPUT_CHAR
1803 ASM_OUTPUT_CHAR (asm_out_file
, x
);
1807 #ifdef ASM_OUTPUT_SHORT
1809 ASM_OUTPUT_SHORT (asm_out_file
, x
);
1813 #ifdef ASM_OUTPUT_INT
1815 ASM_OUTPUT_INT (asm_out_file
, x
);
1819 #ifdef ASM_OUTPUT_DOUBLE_INT
1821 ASM_OUTPUT_DOUBLE_INT (asm_out_file
, x
);
1825 #ifdef ASM_OUTPUT_QUADRUPLE_INT
1827 ASM_OUTPUT_QUADRUPLE_INT (asm_out_file
, x
);
1832 /* If we couldn't do it that way, there are two other possibilities: First,
1833 if the machine can output an explicit byte and this is a 1 byte constant,
1834 we can use ASM_OUTPUT_BYTE. */
1836 #ifdef ASM_OUTPUT_BYTE
1837 if (size
== 1 && GET_CODE (x
) == CONST_INT
)
1839 ASM_OUTPUT_BYTE (asm_out_file
, INTVAL (x
));
1844 /* Finally, if SIZE is larger than a single word, try to output the constant
1845 one word at a time. */
1847 if (size
> UNITS_PER_WORD
)
1850 enum machine_mode mode
1851 = mode_for_size (size
* BITS_PER_UNIT
, MODE_INT
, 0);
1854 for (i
= 0; i
< size
/ UNITS_PER_WORD
; i
++)
1856 word
= operand_subword (x
, i
, 0, mode
);
1861 if (! assemble_integer (word
, UNITS_PER_WORD
, 0))
1865 if (i
== size
/ UNITS_PER_WORD
)
1867 /* If we output at least one word and then could not finish,
1868 there is no valid way to continue. */
1879 /* Assemble the floating-point constant D into an object of size MODE. */
1882 assemble_real (d
, mode
)
1884 enum machine_mode mode
;
1886 jmp_buf output_constant_handler
;
1888 if (setjmp (output_constant_handler
))
1890 error ("floating point trap outputting a constant");
1891 #ifdef REAL_IS_NOT_DOUBLE
1892 memset ((char *) &d
, 0, sizeof d
);
1899 set_float_handler (output_constant_handler
);
1903 #ifdef ASM_OUTPUT_BYTE_FLOAT
1905 ASM_OUTPUT_BYTE_FLOAT (asm_out_file
, d
);
1908 #ifdef ASM_OUTPUT_SHORT_FLOAT
1910 ASM_OUTPUT_SHORT_FLOAT (asm_out_file
, d
);
1913 #ifdef ASM_OUTPUT_THREE_QUARTER_FLOAT
1915 ASM_OUTPUT_THREE_QUARTER_FLOAT (asm_out_file
, d
);
1918 #ifdef ASM_OUTPUT_FLOAT
1920 ASM_OUTPUT_FLOAT (asm_out_file
, d
);
1924 #ifdef ASM_OUTPUT_DOUBLE
1926 ASM_OUTPUT_DOUBLE (asm_out_file
, d
);
1930 #ifdef ASM_OUTPUT_LONG_DOUBLE
1933 ASM_OUTPUT_LONG_DOUBLE (asm_out_file
, d
);
1941 set_float_handler (NULL_PTR
);
1944 /* Here we combine duplicate floating constants to make
1945 CONST_DOUBLE rtx's, and force those out to memory when necessary. */
1947 /* Return a CONST_DOUBLE or CONST_INT for a value specified as a pair of ints.
1948 For an integer, I0 is the low-order word and I1 is the high-order word.
1949 For a real number, I0 is the word with the low address
1950 and I1 is the word with the high address. */
1953 immed_double_const (i0
, i1
, mode
)
1954 HOST_WIDE_INT i0
, i1
;
1955 enum machine_mode mode
;
1959 if (GET_MODE_CLASS (mode
) == MODE_INT
1960 || GET_MODE_CLASS (mode
) == MODE_PARTIAL_INT
)
1962 /* We clear out all bits that don't belong in MODE, unless they and our
1963 sign bit are all one. So we get either a reasonable negative value
1964 or a reasonable unsigned value for this mode. */
1965 int width
= GET_MODE_BITSIZE (mode
);
1966 if (width
< HOST_BITS_PER_WIDE_INT
1967 && ((i0
& ((HOST_WIDE_INT
) (-1) << (width
- 1)))
1968 != ((HOST_WIDE_INT
) (-1) << (width
- 1))))
1969 i0
&= ((HOST_WIDE_INT
) 1 << width
) - 1, i1
= 0;
1970 else if (width
== HOST_BITS_PER_WIDE_INT
1971 && ! (i1
== ~0 && i0
< 0))
1973 else if (width
> 2 * HOST_BITS_PER_WIDE_INT
)
1974 /* We cannot represent this value as a constant. */
1977 /* If this would be an entire word for the target, but is not for
1978 the host, then sign-extend on the host so that the number will look
1979 the same way on the host that it would on the target.
1981 For example, when building a 64 bit alpha hosted 32 bit sparc
1982 targeted compiler, then we want the 32 bit unsigned value -1 to be
1983 represented as a 64 bit value -1, and not as 0x00000000ffffffff.
1984 The later confuses the sparc backend. */
1986 if (BITS_PER_WORD
< HOST_BITS_PER_WIDE_INT
&& BITS_PER_WORD
== width
1987 && (i0
& ((HOST_WIDE_INT
) 1 << (width
- 1))))
1988 i0
|= ((HOST_WIDE_INT
) (-1) << width
);
1990 /* If MODE fits within HOST_BITS_PER_WIDE_INT, always use a CONST_INT.
1992 ??? Strictly speaking, this is wrong if we create a CONST_INT
1993 for a large unsigned constant with the size of MODE being
1994 HOST_BITS_PER_WIDE_INT and later try to interpret that constant in a
1995 wider mode. In that case we will mis-interpret it as a negative
1998 Unfortunately, the only alternative is to make a CONST_DOUBLE
1999 for any constant in any mode if it is an unsigned constant larger
2000 than the maximum signed integer in an int on the host. However,
2001 doing this will break everyone that always expects to see a CONST_INT
2002 for SImode and smaller.
2004 We have always been making CONST_INTs in this case, so nothing new
2007 if (width
<= HOST_BITS_PER_WIDE_INT
)
2008 i1
= (i0
< 0) ? ~(HOST_WIDE_INT
) 0 : 0;
2010 /* If this integer fits in one word, return a CONST_INT. */
2011 if ((i1
== 0 && i0
>= 0)
2012 || (i1
== ~0 && i0
< 0))
2013 return GEN_INT (i0
);
2015 /* We use VOIDmode for integers. */
2019 /* Search the chain for an existing CONST_DOUBLE with the right value.
2020 If one is found, return it. */
2022 for (r
= const_double_chain
; r
; r
= CONST_DOUBLE_CHAIN (r
))
2023 if (CONST_DOUBLE_LOW (r
) == i0
&& CONST_DOUBLE_HIGH (r
) == i1
2024 && GET_MODE (r
) == mode
)
2027 /* No; make a new one and add it to the chain. */
2028 r
= gen_rtx_CONST_DOUBLE (mode
, const0_rtx
, i0
, i1
);
2030 /* Don't touch const_double_chain if not inside any function. */
2031 if (current_function_decl
!= 0)
2033 CONST_DOUBLE_CHAIN (r
) = const_double_chain
;
2034 const_double_chain
= r
;
2040 /* Return a CONST_DOUBLE for a specified `double' value
2041 and machine mode. */
2044 immed_real_const_1 (d
, mode
)
2046 enum machine_mode mode
;
2048 union real_extract u
;
2051 /* Get the desired `double' value as a sequence of ints
2052 since that is how they are stored in a CONST_DOUBLE. */
2056 /* Detect special cases. But be careful we don't use a CONST_DOUBLE
2057 that's from a parent function since it may be in its constant pool. */
2058 if (REAL_VALUES_IDENTICAL (dconst0
, d
)
2059 && (cfun
== 0 || decl_function_context (current_function_decl
) == 0))
2060 return CONST0_RTX (mode
);
2062 /* Check for NaN first, because some ports (specifically the i386) do not
2063 emit correct ieee-fp code by default, and thus will generate a core
2064 dump here if we pass a NaN to REAL_VALUES_EQUAL and if REAL_VALUES_EQUAL
2065 does a floating point comparison. */
2066 else if ((! REAL_VALUE_ISNAN (d
) && REAL_VALUES_EQUAL (dconst1
, d
))
2068 || decl_function_context (current_function_decl
) == 0))
2069 return CONST1_RTX (mode
);
2071 if (sizeof u
== sizeof (HOST_WIDE_INT
))
2072 return immed_double_const (u
.i
[0], 0, mode
);
2073 if (sizeof u
== 2 * sizeof (HOST_WIDE_INT
))
2074 return immed_double_const (u
.i
[0], u
.i
[1], mode
);
2076 /* The rest of this function handles the case where
2077 a float value requires more than 2 ints of space.
2078 It will be deleted as dead code on machines that don't need it. */
2080 /* Search the chain for an existing CONST_DOUBLE with the right value.
2081 If one is found, return it. */
2083 for (r
= const_double_chain
; r
; r
= CONST_DOUBLE_CHAIN (r
))
2084 if (! memcmp ((char *) &CONST_DOUBLE_LOW (r
), (char *) &u
, sizeof u
)
2085 && GET_MODE (r
) == mode
)
2088 /* No; make a new one and add it to the chain.
2090 We may be called by an optimizer which may be discarding any memory
2091 allocated during its processing (such as combine and loop). However,
2092 we will be leaving this constant on the chain, so we cannot tolerate
2094 r
= rtx_alloc (CONST_DOUBLE
);
2096 memcpy ((char *) &CONST_DOUBLE_LOW (r
), (char *) &u
, sizeof u
);
2098 /* If we aren't inside a function, don't put r on the
2099 const_double_chain. */
2100 if (current_function_decl
!= 0)
2102 CONST_DOUBLE_CHAIN (r
) = const_double_chain
;
2103 const_double_chain
= r
;
2106 CONST_DOUBLE_CHAIN (r
) = NULL_RTX
;
2108 /* Store const0_rtx in CONST_DOUBLE_MEM since this CONST_DOUBLE is on the
2109 chain, but has not been allocated memory. Actual use of CONST_DOUBLE_MEM
2110 is only through force_const_mem. */
2112 CONST_DOUBLE_MEM (r
) = const0_rtx
;
2117 /* Return a CONST_DOUBLE rtx for a value specified by EXP,
2118 which must be a REAL_CST tree node. */
2121 immed_real_const (exp
)
2124 return immed_real_const_1 (TREE_REAL_CST (exp
), TYPE_MODE (TREE_TYPE (exp
)));
2127 /* At the end of a function, forget the memory-constants
2128 previously made for CONST_DOUBLEs. Mark them as not on real_constant_chain.
2129 Also clear out real_constant_chain and clear out all the chain-pointers. */
2132 clear_const_double_mem ()
2134 register rtx r
, next
;
2136 for (r
= const_double_chain
; r
; r
= next
)
2138 next
= CONST_DOUBLE_CHAIN (r
);
2139 CONST_DOUBLE_CHAIN (r
) = 0;
2140 CONST_DOUBLE_MEM (r
) = cc0_rtx
;
2142 const_double_chain
= 0;
2145 /* Given an expression EXP with a constant value,
2146 reduce it to the sum of an assembler symbol and an integer.
2147 Store them both in the structure *VALUE.
2148 Abort if EXP does not reduce. */
2153 HOST_WIDE_INT offset
;
2157 decode_addr_const (exp
, value
)
2159 struct addr_const
*value
;
2161 register tree target
= TREE_OPERAND (exp
, 0);
2162 register int offset
= 0;
2167 if (TREE_CODE (target
) == COMPONENT_REF
2168 && host_integerp (byte_position (TREE_OPERAND (target
, 1)), 0))
2171 offset
+= int_byte_position (TREE_OPERAND (target
, 1));
2172 target
= TREE_OPERAND (target
, 0);
2174 else if (TREE_CODE (target
) == ARRAY_REF
)
2176 offset
+= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (target
)), 1)
2177 * tree_low_cst (TREE_OPERAND (target
, 1), 0));
2178 target
= TREE_OPERAND (target
, 0);
2184 switch (TREE_CODE (target
))
2188 x
= DECL_RTL (target
);
2192 x
= gen_rtx_MEM (FUNCTION_MODE
,
2193 gen_rtx_LABEL_REF (VOIDmode
,
2194 label_rtx (TREE_OPERAND (exp
, 0))));
2202 x
= TREE_CST_RTL (target
);
2209 if (GET_CODE (x
) != MEM
)
2214 value
->offset
= offset
;
2217 enum kind
{ RTX_DOUBLE
, RTX_INT
};
2220 ENUM_BITFIELD(kind
) kind
: 16;
2221 ENUM_BITFIELD(machine_mode
) mode
: 16;
2223 union real_extract du
;
2224 struct addr_const addr
;
2225 struct {HOST_WIDE_INT high
, low
;} di
;
2229 /* Uniquize all constants that appear in memory.
2230 Each constant in memory thus far output is recorded
2231 in `const_hash_table' with a `struct constant_descriptor'
2232 that contains a polish representation of the value of
2235 We cannot store the trees in the hash table
2236 because the trees may be temporary. */
2238 struct constant_descriptor
2240 struct constant_descriptor
*next
;
2243 /* Make sure the data is reasonably aligned. */
2246 unsigned char contents
[1];
2247 #ifdef HAVE_LONG_DOUBLE
2256 #define MAX_HASH_TABLE 1009
2257 static struct constant_descriptor
*const_hash_table
[MAX_HASH_TABLE
];
2259 #define STRHASH(x) ((hashval_t)((long)(x) >> 3))
2261 struct deferred_string
2268 static htab_t const_str_htab
;
2270 /* Mark a const_hash_table descriptor for GC. */
2273 mark_const_hash_entry (ptr
)
2276 struct constant_descriptor
*desc
= * (struct constant_descriptor
**) ptr
;
2280 ggc_mark_rtx (desc
->rtl
);
2285 /* Mark the hash-table element X (which is really a pointer to an
2286 struct deferred_string *). */
2289 mark_const_str_htab_1 (x
, data
)
2291 void *data ATTRIBUTE_UNUSED
;
2293 ggc_mark_tree (((struct deferred_string
*) *x
)->exp
);
2297 /* Mark a const_str_htab for GC. */
2300 mark_const_str_htab (htab
)
2303 htab_traverse (*((htab_t
*) htab
), mark_const_str_htab_1
, NULL
);
2306 /* Returns a hash code for X (which is a really a
2307 struct deferred_string *). */
2310 const_str_htab_hash (x
)
2313 return STRHASH (((const struct deferred_string
*) x
)->label
);
2316 /* Returns non-zero if the value represented by X (which is really a
2317 struct deferred_string *) is the same as that given by Y
2318 (which is really a char *). */
2321 const_str_htab_eq (x
, y
)
2325 return (((const struct deferred_string
*) x
)->label
== (const char *) y
);
2328 /* Delete the hash table entry dfsp. */
2331 const_str_htab_del (dfsp
)
2337 /* Compute a hash code for a constant expression. */
2343 register const char *p
;
2344 register int len
, hi
, i
;
2345 register enum tree_code code
= TREE_CODE (exp
);
2347 /* Either set P and LEN to the address and len of something to hash and
2348 exit the switch or return a value. */
2353 p
= (char *) &TREE_INT_CST (exp
);
2354 len
= sizeof TREE_INT_CST (exp
);
2358 p
= (char *) &TREE_REAL_CST (exp
);
2359 len
= sizeof TREE_REAL_CST (exp
);
2363 p
= TREE_STRING_POINTER (exp
);
2364 len
= TREE_STRING_LENGTH (exp
);
2368 return (const_hash (TREE_REALPART (exp
)) * 5
2369 + const_hash (TREE_IMAGPART (exp
)));
2372 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2376 len
= int_size_in_bytes (TREE_TYPE (exp
));
2377 tmp
= (char *) alloca (len
);
2378 get_set_constructor_bytes (exp
, (unsigned char *) tmp
, len
);
2386 /* For record type, include the type in the hashing.
2387 We do not do so for array types
2388 because (1) the sizes of the elements are sufficient
2389 and (2) distinct array types can have the same constructor.
2390 Instead, we include the array size because the constructor could
2392 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2393 hi
= ((unsigned long) TREE_TYPE (exp
) & ((1 << HASHBITS
) - 1))
2396 hi
= ((5 + int_size_in_bytes (TREE_TYPE (exp
)))
2397 & ((1 << HASHBITS
) - 1)) % MAX_HASH_TABLE
;
2399 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2400 if (TREE_VALUE (link
))
2402 = (hi
* 603 + const_hash (TREE_VALUE (link
))) % MAX_HASH_TABLE
;
2409 struct addr_const value
;
2411 decode_addr_const (exp
, &value
);
2412 if (GET_CODE (value
.base
) == SYMBOL_REF
)
2414 /* Don't hash the address of the SYMBOL_REF;
2415 only use the offset and the symbol name. */
2417 p
= XSTR (value
.base
, 0);
2418 for (i
= 0; p
[i
] != 0; i
++)
2419 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2421 else if (GET_CODE (value
.base
) == LABEL_REF
)
2422 hi
= value
.offset
+ CODE_LABEL_NUMBER (XEXP (value
.base
, 0)) * 13;
2426 hi
&= (1 << HASHBITS
) - 1;
2427 hi
%= MAX_HASH_TABLE
;
2433 return (const_hash (TREE_OPERAND (exp
, 0)) * 9
2434 + const_hash (TREE_OPERAND (exp
, 1)));
2438 case NON_LVALUE_EXPR
:
2439 return const_hash (TREE_OPERAND (exp
, 0)) * 7 + 2;
2442 /* A language specific constant. Just hash the code. */
2443 return (int) code
% MAX_HASH_TABLE
;
2446 /* Compute hashing function */
2448 for (i
= 0; i
< len
; i
++)
2449 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2451 hi
&= (1 << HASHBITS
) - 1;
2452 hi
%= MAX_HASH_TABLE
;
2456 /* Compare a constant expression EXP with a constant-descriptor DESC.
2457 Return 1 if DESC describes a constant with the same value as EXP. */
2460 compare_constant (exp
, desc
)
2462 struct constant_descriptor
*desc
;
2464 return 0 != compare_constant_1 (exp
, desc
->u
.contents
);
2467 /* Compare constant expression EXP with a substring P of a constant descriptor.
2468 If they match, return a pointer to the end of the substring matched.
2469 If they do not match, return 0.
2471 Since descriptors are written in polish prefix notation,
2472 this function can be used recursively to test one operand of EXP
2473 against a subdescriptor, and if it succeeds it returns the
2474 address of the subdescriptor for the next operand. */
2476 static const unsigned char *
2477 compare_constant_1 (exp
, p
)
2479 const unsigned char *p
;
2481 register const unsigned char *strp
;
2483 register enum tree_code code
= TREE_CODE (exp
);
2485 if (code
!= (enum tree_code
) *p
++)
2488 /* Either set STRP, P and LEN to pointers and length to compare and exit the
2489 switch, or return the result of the comparison. */
2494 /* Integer constants are the same only if the same width of type. */
2495 if (*p
++ != TYPE_PRECISION (TREE_TYPE (exp
)))
2498 strp
= (unsigned char *) &TREE_INT_CST (exp
);
2499 len
= sizeof TREE_INT_CST (exp
);
2503 /* Real constants are the same only if the same width of type. */
2504 if (*p
++ != TYPE_PRECISION (TREE_TYPE (exp
)))
2507 strp
= (unsigned char *) &TREE_REAL_CST (exp
);
2508 len
= sizeof TREE_REAL_CST (exp
);
2512 if (flag_writable_strings
)
2515 if ((enum machine_mode
) *p
++ != TYPE_MODE (TREE_TYPE (exp
)))
2518 strp
= (const unsigned char *)TREE_STRING_POINTER (exp
);
2519 len
= TREE_STRING_LENGTH (exp
);
2520 if (memcmp ((char *) &TREE_STRING_LENGTH (exp
), p
,
2521 sizeof TREE_STRING_LENGTH (exp
)))
2524 p
+= sizeof TREE_STRING_LENGTH (exp
);
2528 p
= compare_constant_1 (TREE_REALPART (exp
), p
);
2532 return compare_constant_1 (TREE_IMAGPART (exp
), p
);
2535 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2537 int xlen
= len
= int_size_in_bytes (TREE_TYPE (exp
));
2538 unsigned char *tmp
= (unsigned char *) alloca (len
);
2540 get_set_constructor_bytes (exp
, tmp
, len
);
2541 strp
= (unsigned char *) tmp
;
2542 if (memcmp ((char *) &xlen
, p
, sizeof xlen
))
2551 int length
= list_length (CONSTRUCTOR_ELTS (exp
));
2553 enum machine_mode mode
= TYPE_MODE (TREE_TYPE (exp
));
2554 int have_purpose
= 0;
2556 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2557 if (TREE_PURPOSE (link
))
2560 if (memcmp ((char *) &length
, p
, sizeof length
))
2565 /* For record constructors, insist that the types match.
2566 For arrays, just verify both constructors are for arrays.
2567 Then insist that either both or none have any TREE_PURPOSE
2569 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2570 type
= TREE_TYPE (exp
);
2574 if (memcmp ((char *) &type
, p
, sizeof type
))
2577 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2579 if (memcmp ((char *) &mode
, p
, sizeof mode
))
2587 if (memcmp ((char *) &have_purpose
, p
, sizeof have_purpose
))
2590 p
+= sizeof have_purpose
;
2592 /* For arrays, insist that the size in bytes match. */
2593 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2595 HOST_WIDE_INT size
= int_size_in_bytes (TREE_TYPE (exp
));
2597 if (memcmp ((char *) &size
, p
, sizeof size
))
2603 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2605 if (TREE_VALUE (link
))
2607 if ((p
= compare_constant_1 (TREE_VALUE (link
), p
)) == 0)
2614 if (memcmp ((char *) &zero
, p
, sizeof zero
))
2620 if (TREE_PURPOSE (link
)
2621 && TREE_CODE (TREE_PURPOSE (link
)) == FIELD_DECL
)
2623 if (memcmp ((char *) &TREE_PURPOSE (link
), p
,
2624 sizeof TREE_PURPOSE (link
)))
2627 p
+= sizeof TREE_PURPOSE (link
);
2629 else if (TREE_PURPOSE (link
))
2631 if ((p
= compare_constant_1 (TREE_PURPOSE (link
), p
)) == 0)
2634 else if (have_purpose
)
2638 if (memcmp ((char *) &zero
, p
, sizeof zero
))
2650 struct addr_const value
;
2652 decode_addr_const (exp
, &value
);
2653 strp
= (unsigned char *) &value
.offset
;
2654 len
= sizeof value
.offset
;
2655 /* Compare the offset. */
2657 if (*p
++ != *strp
++)
2660 /* Compare symbol name. */
2661 strp
= (const unsigned char *) XSTR (value
.base
, 0);
2662 len
= strlen ((const char *) strp
) + 1;
2669 p
= compare_constant_1 (TREE_OPERAND (exp
, 0), p
);
2673 return compare_constant_1 (TREE_OPERAND (exp
, 1), p
);
2677 case NON_LVALUE_EXPR
:
2678 return compare_constant_1 (TREE_OPERAND (exp
, 0), p
);
2681 if (lang_expand_constant
)
2683 exp
= (*lang_expand_constant
) (exp
);
2684 return compare_constant_1 (exp
, p
);
2689 /* Compare constant contents. */
2691 if (*p
++ != *strp
++)
2697 /* Construct a constant descriptor for the expression EXP.
2698 It is up to the caller to enter the descriptor in the hash table. */
2700 static struct constant_descriptor
*
2701 record_constant (exp
)
2704 struct constant_descriptor
*next
= 0;
2709 /* Make a struct constant_descriptor. The first three pointers will
2710 be filled in later. Here we just leave space for them. */
2712 obstack_grow (&permanent_obstack
, (char *) &next
, sizeof next
);
2713 obstack_grow (&permanent_obstack
, (char *) &label
, sizeof label
);
2714 obstack_grow (&permanent_obstack
, (char *) &rtl
, sizeof rtl
);
2716 /* Align the descriptor for the data payload. */
2717 pad
= (offsetof (struct constant_descriptor
, u
)
2718 - offsetof(struct constant_descriptor
, rtl
)
2719 - sizeof(next
->rtl
));
2721 obstack_blank (&permanent_obstack
, pad
);
2723 record_constant_1 (exp
);
2724 return (struct constant_descriptor
*) obstack_finish (&permanent_obstack
);
2727 /* Add a description of constant expression EXP
2728 to the object growing in `permanent_obstack'.
2729 No need to return its address; the caller will get that
2730 from the obstack when the object is complete. */
2733 record_constant_1 (exp
)
2736 register const unsigned char *strp
;
2738 register enum tree_code code
= TREE_CODE (exp
);
2740 obstack_1grow (&permanent_obstack
, (unsigned int) code
);
2745 obstack_1grow (&permanent_obstack
, TYPE_PRECISION (TREE_TYPE (exp
)));
2746 strp
= (unsigned char *) &TREE_INT_CST (exp
);
2747 len
= sizeof TREE_INT_CST (exp
);
2751 obstack_1grow (&permanent_obstack
, TYPE_PRECISION (TREE_TYPE (exp
)));
2752 strp
= (unsigned char *) &TREE_REAL_CST (exp
);
2753 len
= sizeof TREE_REAL_CST (exp
);
2757 if (flag_writable_strings
)
2760 obstack_1grow (&permanent_obstack
, TYPE_MODE (TREE_TYPE (exp
)));
2761 strp
= (const unsigned char *) TREE_STRING_POINTER (exp
);
2762 len
= TREE_STRING_LENGTH (exp
);
2763 obstack_grow (&permanent_obstack
, (char *) &TREE_STRING_LENGTH (exp
),
2764 sizeof TREE_STRING_LENGTH (exp
));
2768 record_constant_1 (TREE_REALPART (exp
));
2769 record_constant_1 (TREE_IMAGPART (exp
));
2773 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2775 int nbytes
= int_size_in_bytes (TREE_TYPE (exp
));
2776 obstack_grow (&permanent_obstack
, &nbytes
, sizeof (nbytes
));
2777 obstack_blank (&permanent_obstack
, nbytes
);
2778 get_set_constructor_bytes
2779 (exp
, (unsigned char *) permanent_obstack
.next_free
-nbytes
,
2786 int length
= list_length (CONSTRUCTOR_ELTS (exp
));
2787 enum machine_mode mode
= TYPE_MODE (TREE_TYPE (exp
));
2789 int have_purpose
= 0;
2791 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2792 if (TREE_PURPOSE (link
))
2795 obstack_grow (&permanent_obstack
, (char *) &length
, sizeof length
);
2797 /* For record constructors, insist that the types match.
2798 For arrays, just verify both constructors are for arrays
2799 of the same mode. Then insist that either both or none
2800 have any TREE_PURPOSE values. */
2801 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2802 type
= TREE_TYPE (exp
);
2806 obstack_grow (&permanent_obstack
, (char *) &type
, sizeof type
);
2807 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2808 obstack_grow (&permanent_obstack
, &mode
, sizeof mode
);
2810 obstack_grow (&permanent_obstack
, (char *) &have_purpose
,
2811 sizeof have_purpose
);
2813 /* For arrays, insist that the size in bytes match. */
2814 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2816 HOST_WIDE_INT size
= int_size_in_bytes (TREE_TYPE (exp
));
2817 obstack_grow (&permanent_obstack
, (char *) &size
, sizeof size
);
2820 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2822 if (TREE_VALUE (link
))
2823 record_constant_1 (TREE_VALUE (link
));
2828 obstack_grow (&permanent_obstack
,
2829 (char *) &zero
, sizeof zero
);
2832 if (TREE_PURPOSE (link
)
2833 && TREE_CODE (TREE_PURPOSE (link
)) == FIELD_DECL
)
2834 obstack_grow (&permanent_obstack
,
2835 (char *) &TREE_PURPOSE (link
),
2836 sizeof TREE_PURPOSE (link
));
2837 else if (TREE_PURPOSE (link
))
2838 record_constant_1 (TREE_PURPOSE (link
));
2839 else if (have_purpose
)
2843 obstack_grow (&permanent_obstack
,
2844 (char *) &zero
, sizeof zero
);
2852 struct addr_const value
;
2854 decode_addr_const (exp
, &value
);
2855 /* Record the offset. */
2856 obstack_grow (&permanent_obstack
,
2857 (char *) &value
.offset
, sizeof value
.offset
);
2859 switch (GET_CODE (value
.base
))
2862 /* Record the symbol name. */
2863 obstack_grow (&permanent_obstack
, XSTR (value
.base
, 0),
2864 strlen (XSTR (value
.base
, 0)) + 1);
2867 /* Record the address of the CODE_LABEL. It may not have
2868 been emitted yet, so it's UID may be zero. But pointer
2869 identity is good enough. */
2870 obstack_grow (&permanent_obstack
, &XEXP (value
.base
, 0),
2882 record_constant_1 (TREE_OPERAND (exp
, 0));
2883 record_constant_1 (TREE_OPERAND (exp
, 1));
2888 case NON_LVALUE_EXPR
:
2889 record_constant_1 (TREE_OPERAND (exp
, 0));
2893 if (lang_expand_constant
)
2895 exp
= (*lang_expand_constant
) (exp
);
2896 record_constant_1 (exp
);
2901 /* Record constant contents. */
2902 obstack_grow (&permanent_obstack
, strp
, len
);
2905 /* Record a list of constant expressions that were passed to
2906 output_constant_def but that could not be output right away. */
2908 struct deferred_constant
2910 struct deferred_constant
*next
;
2916 static struct deferred_constant
*deferred_constants
;
2918 /* Another list of constants which should be output after the
2920 static struct deferred_constant
*after_function_constants
;
2922 /* Nonzero means defer output of addressed subconstants
2923 (i.e., those for which output_constant_def is called.) */
2924 static int defer_addressed_constants_flag
;
2926 /* Start deferring output of subconstants. */
2929 defer_addressed_constants ()
2931 defer_addressed_constants_flag
++;
2934 /* Stop deferring output of subconstants,
2935 and output now all those that have been deferred. */
2938 output_deferred_addressed_constants ()
2940 struct deferred_constant
*p
, *next
;
2942 defer_addressed_constants_flag
--;
2944 if (defer_addressed_constants_flag
> 0)
2947 for (p
= deferred_constants
; p
; p
= next
)
2949 output_constant_def_contents (p
->exp
, p
->reloc
, p
->labelno
);
2954 deferred_constants
= 0;
2957 /* Output any constants which should appear after a function. */
2960 output_after_function_constants ()
2962 struct deferred_constant
*p
, *next
;
2964 for (p
= after_function_constants
; p
; p
= next
)
2966 output_constant_def_contents (p
->exp
, p
->reloc
, p
->labelno
);
2971 after_function_constants
= 0;
2974 /* Make a copy of the whole tree structure for a constant.
2975 This handles the same types of nodes that compare_constant
2976 and record_constant handle. */
2982 switch (TREE_CODE (exp
))
2985 /* For ADDR_EXPR, we do not want to copy the decl whose address
2986 is requested. We do want to copy constants though. */
2987 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, 0))) == 'c')
2988 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2989 copy_constant (TREE_OPERAND (exp
, 0)));
2991 return copy_node (exp
);
2996 return copy_node (exp
);
2999 return build_complex (TREE_TYPE (exp
),
3000 copy_constant (TREE_REALPART (exp
)),
3001 copy_constant (TREE_IMAGPART (exp
)));
3005 return build (TREE_CODE (exp
), TREE_TYPE (exp
),
3006 copy_constant (TREE_OPERAND (exp
, 0)),
3007 copy_constant (TREE_OPERAND (exp
, 1)));
3011 case NON_LVALUE_EXPR
:
3012 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
3013 copy_constant (TREE_OPERAND (exp
, 0)));
3017 tree copy
= copy_node (exp
);
3018 tree list
= copy_list (CONSTRUCTOR_ELTS (exp
));
3021 CONSTRUCTOR_ELTS (copy
) = list
;
3022 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
3023 TREE_VALUE (tail
) = copy_constant (TREE_VALUE (tail
));
3024 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
3025 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
3026 TREE_PURPOSE (tail
) = copy_constant (TREE_PURPOSE (tail
));
3036 /* Return an rtx representing a reference to constant data in memory
3037 for the constant expression EXP.
3039 If assembler code for such a constant has already been output,
3040 return an rtx to refer to it.
3041 Otherwise, output such a constant in memory (or defer it for later)
3042 and generate an rtx for it.
3044 If DEFER is non-zero, the output of string constants can be deferred
3045 and output only if referenced in the function after all optimizations.
3047 The TREE_CST_RTL of EXP is set up to point to that rtx.
3048 The const_hash_table records which constants already have label strings. */
3051 output_constant_def (exp
, defer
)
3056 register struct constant_descriptor
*desc
;
3057 struct deferred_string
**defstr
;
3061 int after_function
= 0;
3064 if (TREE_CST_RTL (exp
))
3065 return TREE_CST_RTL (exp
);
3067 /* Make sure any other constants whose addresses appear in EXP
3068 are assigned label numbers. */
3070 reloc
= output_addressed_constants (exp
);
3072 /* Compute hash code of EXP. Search the descriptors for that hash code
3073 to see if any of them describes EXP. If yes, the descriptor records
3074 the label number already assigned. */
3076 hash
= const_hash (exp
) % MAX_HASH_TABLE
;
3078 for (desc
= const_hash_table
[hash
]; desc
; desc
= desc
->next
)
3079 if (compare_constant (exp
, desc
))
3084 /* No constant equal to EXP is known to have been output.
3085 Make a constant descriptor to enter EXP in the hash table.
3086 Assign the label number and record it in the descriptor for
3087 future calls to this function to find. */
3089 /* Create a string containing the label name, in LABEL. */
3090 labelno
= const_labelno
++;
3091 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", labelno
);
3093 desc
= record_constant (exp
);
3094 desc
->next
= const_hash_table
[hash
];
3095 desc
->label
= ggc_strdup (label
);
3096 const_hash_table
[hash
] = desc
;
3098 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
3100 = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp
)),
3101 gen_rtx_SYMBOL_REF (Pmode
, desc
->label
));
3103 set_mem_attributes (desc
->rtl
, exp
, 1);
3108 TREE_CST_RTL (exp
) = desc
->rtl
;
3110 /* Optionally set flags or add text to the name to record information
3111 such as that it is a function name. If the name is changed, the macro
3112 ASM_OUTPUT_LABELREF will have to know how to strip this information. */
3113 #ifdef ENCODE_SECTION_INFO
3114 /* A previously-processed constant would already have section info
3118 ENCODE_SECTION_INFO (exp
);
3119 desc
->rtl
= TREE_CST_RTL (exp
);
3120 desc
->label
= XSTR (XEXP (desc
->rtl
, 0), 0);
3124 #ifdef CONSTANT_AFTER_FUNCTION_P
3125 if (current_function_decl
!= 0
3126 && CONSTANT_AFTER_FUNCTION_P (exp
))
3131 && STRING_POOL_ADDRESS_P (XEXP (desc
->rtl
, 0))
3132 && (!defer
|| defer_addressed_constants_flag
|| after_function
))
3134 defstr
= (struct deferred_string
**)
3135 htab_find_slot_with_hash (const_str_htab
, desc
->label
,
3136 STRHASH (desc
->label
), NO_INSERT
);
3139 /* If the string is currently deferred but we need to output it now,
3140 remove it from deferred string hash table. */
3142 labelno
= (*defstr
)->labelno
;
3143 STRING_POOL_ADDRESS_P (XEXP (desc
->rtl
, 0)) = 0;
3144 htab_clear_slot (const_str_htab
, (void **) defstr
);
3148 /* If this is the first time we've seen this particular constant,
3149 output it (or defer its output for later). */
3152 if (defer_addressed_constants_flag
|| after_function
)
3154 struct deferred_constant
*p
;
3155 p
= (struct deferred_constant
*) xmalloc (sizeof (struct deferred_constant
));
3157 p
->exp
= copy_constant (exp
);
3159 p
->labelno
= labelno
;
3162 p
->next
= after_function_constants
;
3163 after_function_constants
= p
;
3167 p
->next
= deferred_constants
;
3168 deferred_constants
= p
;
3173 /* Do no output if -fsyntax-only. */
3174 if (! flag_syntax_only
)
3176 if (TREE_CODE (exp
) != STRING_CST
3178 || flag_writable_strings
3179 || (defstr
= (struct deferred_string
**)
3180 htab_find_slot_with_hash (const_str_htab
,
3182 STRHASH (desc
->label
),
3184 output_constant_def_contents (exp
, reloc
, labelno
);
3187 struct deferred_string
*p
;
3189 p
= (struct deferred_string
*)
3190 xmalloc (sizeof (struct deferred_string
));
3192 p
->exp
= copy_constant (exp
);
3193 p
->label
= desc
->label
;
3194 p
->labelno
= labelno
;
3196 STRING_POOL_ADDRESS_P (XEXP (desc
->rtl
, 0)) = 1;
3202 return TREE_CST_RTL (exp
);
3205 /* Now output assembler code to define the label for EXP,
3206 and follow it with the data of EXP. */
3209 output_constant_def_contents (exp
, reloc
, labelno
)
3216 if (IN_NAMED_SECTION (exp
))
3217 named_section (exp
, NULL
, reloc
);
3220 /* First switch to text section, except for writable strings. */
3221 #ifdef SELECT_SECTION
3222 SELECT_SECTION (exp
, reloc
);
3224 if (((TREE_CODE (exp
) == STRING_CST
) && flag_writable_strings
)
3225 || (flag_pic
&& reloc
))
3228 readonly_data_section ();
3232 /* Align the location counter as required by EXP's data type. */
3233 align
= TYPE_ALIGN (TREE_TYPE (exp
));
3234 #ifdef CONSTANT_ALIGNMENT
3235 align
= CONSTANT_ALIGNMENT (exp
, align
);
3238 if (align
> BITS_PER_UNIT
)
3239 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
3241 /* Output the label itself. */
3242 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LC", labelno
);
3244 /* Output the value of EXP. */
3245 output_constant (exp
,
3246 (TREE_CODE (exp
) == STRING_CST
3247 ? TREE_STRING_LENGTH (exp
)
3248 : int_size_in_bytes (TREE_TYPE (exp
))));
3252 /* Structure to represent sufficient information about a constant so that
3253 it can be output when the constant pool is output, so that function
3254 integration can be done, and to simplify handling on machines that reference
3255 constant pool as base+displacement. */
3257 struct pool_constant
3259 struct constant_descriptor
*desc
;
3260 struct pool_constant
*next
, *next_sym
;
3263 enum machine_mode mode
;
3270 /* Hash code for a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true.
3271 The argument is XSTR (... , 0) */
3273 #define SYMHASH(LABEL) \
3274 ((((unsigned long) (LABEL)) & ((1 << HASHBITS) - 1)) % MAX_RTX_HASH_TABLE)
3276 /* Initialize constant pool hashing for a new function. */
3279 init_varasm_status (f
)
3282 struct varasm_status
*p
;
3283 p
= (struct varasm_status
*) xmalloc (sizeof (struct varasm_status
));
3285 p
->x_const_rtx_hash_table
3286 = ((struct constant_descriptor
**)
3287 xcalloc (MAX_RTX_HASH_TABLE
, sizeof (struct constant_descriptor
*)));
3288 p
->x_const_rtx_sym_hash_table
3289 = ((struct pool_constant
**)
3290 xcalloc (MAX_RTX_HASH_TABLE
, sizeof (struct pool_constant
*)));
3292 p
->x_first_pool
= p
->x_last_pool
= 0;
3293 p
->x_pool_offset
= 0;
3294 p
->x_const_double_chain
= 0;
3297 /* Mark PC for GC. */
3300 mark_pool_constant (pc
)
3301 struct pool_constant
*pc
;
3306 ggc_mark_rtx (pc
->constant
);
3311 /* Mark P for GC. */
3314 mark_varasm_status (p
)
3315 struct varasm_status
*p
;
3320 mark_pool_constant (p
->x_first_pool
);
3321 ggc_mark_rtx (p
->x_const_double_chain
);
3324 /* Clear out all parts of the state in F that can safely be discarded
3325 after the function has been compiled, to let garbage collection
3326 reclaim the memory. */
3329 free_varasm_status (f
)
3332 struct varasm_status
*p
;
3337 /* Clear out the hash tables. */
3338 for (i
= 0; i
< MAX_RTX_HASH_TABLE
; ++i
)
3340 struct constant_descriptor
* cd
;
3342 cd
= p
->x_const_rtx_hash_table
[i
];
3344 struct constant_descriptor
* next
= cd
->next
;
3350 free (p
->x_const_rtx_hash_table
);
3351 free (p
->x_const_rtx_sym_hash_table
);
3357 /* Express an rtx for a constant integer (perhaps symbolic)
3358 as the sum of a symbol or label plus an explicit integer.
3359 They are stored into VALUE. */
3362 decode_rtx_const (mode
, x
, value
)
3363 enum machine_mode mode
;
3365 struct rtx_const
*value
;
3367 /* Clear the whole structure, including any gaps. */
3368 memset (value
, 0, sizeof (struct rtx_const
));
3370 value
->kind
= RTX_INT
; /* Most usual kind. */
3373 switch (GET_CODE (x
))
3376 value
->kind
= RTX_DOUBLE
;
3377 if (GET_MODE (x
) != VOIDmode
)
3379 value
->mode
= GET_MODE (x
);
3380 memcpy ((char *) &value
->un
.du
,
3381 (char *) &CONST_DOUBLE_LOW (x
), sizeof value
->un
.du
);
3385 value
->un
.di
.low
= CONST_DOUBLE_LOW (x
);
3386 value
->un
.di
.high
= CONST_DOUBLE_HIGH (x
);
3391 value
->un
.addr
.offset
= INTVAL (x
);
3397 value
->un
.addr
.base
= x
;
3402 if (GET_CODE (x
) == PLUS
&& GET_CODE (XEXP (x
, 1)) == CONST_INT
)
3404 value
->un
.addr
.base
= XEXP (x
, 0);
3405 value
->un
.addr
.offset
= INTVAL (XEXP (x
, 1));
3407 else if (GET_CODE (x
) == MINUS
&& GET_CODE (XEXP (x
, 1)) == CONST_INT
)
3409 value
->un
.addr
.base
= XEXP (x
, 0);
3410 value
->un
.addr
.offset
= - INTVAL (XEXP (x
, 1));
3414 value
->un
.addr
.base
= x
;
3415 value
->un
.addr
.offset
= 0;
3423 if (value
->kind
== RTX_INT
&& value
->un
.addr
.base
!= 0)
3424 switch (GET_CODE (value
->un
.addr
.base
))
3427 /* Use the string's address, not the SYMBOL_REF's address,
3428 for the sake of addresses of library routines. */
3429 value
->un
.addr
.base
= (rtx
) XSTR (value
->un
.addr
.base
, 0);
3433 /* For a LABEL_REF, compare labels. */
3434 value
->un
.addr
.base
= XEXP (value
->un
.addr
.base
, 0);
3441 /* Given a MINUS expression, simplify it if both sides
3442 include the same symbol. */
3445 simplify_subtraction (x
)
3448 struct rtx_const val0
, val1
;
3450 decode_rtx_const (GET_MODE (x
), XEXP (x
, 0), &val0
);
3451 decode_rtx_const (GET_MODE (x
), XEXP (x
, 1), &val1
);
3453 if (val0
.un
.addr
.base
== val1
.un
.addr
.base
)
3454 return GEN_INT (val0
.un
.addr
.offset
- val1
.un
.addr
.offset
);
3458 /* Compute a hash code for a constant RTL expression. */
3461 const_hash_rtx (mode
, x
)
3462 enum machine_mode mode
;
3468 struct rtx_const value
;
3469 decode_rtx_const (mode
, x
, &value
);
3471 /* Compute hashing function */
3473 for (i
= 0; i
< sizeof value
/ sizeof (int); i
++)
3474 hi
+= ((int *) &value
)[i
];
3476 hi
&= (1 << HASHBITS
) - 1;
3477 hi
%= MAX_RTX_HASH_TABLE
;
3481 /* Compare a constant rtl object X with a constant-descriptor DESC.
3482 Return 1 if DESC describes a constant with the same value as X. */
3485 compare_constant_rtx (mode
, x
, desc
)
3486 enum machine_mode mode
;
3488 struct constant_descriptor
*desc
;
3490 register int *p
= (int *) desc
->u
.contents
;
3493 struct rtx_const value
;
3495 decode_rtx_const (mode
, x
, &value
);
3496 strp
= (int *) &value
;
3497 len
= sizeof value
/ sizeof (int);
3499 /* Compare constant contents. */
3501 if (*p
++ != *strp
++)
3507 /* Construct a constant descriptor for the rtl-expression X.
3508 It is up to the caller to enter the descriptor in the hash table. */
3510 static struct constant_descriptor
*
3511 record_constant_rtx (mode
, x
)
3512 enum machine_mode mode
;
3515 struct constant_descriptor
*ptr
;
3517 ptr
= ((struct constant_descriptor
*)
3518 xcalloc (1, (offsetof (struct constant_descriptor
, u
)
3519 + sizeof (struct rtx_const
))));
3520 decode_rtx_const (mode
, x
, (struct rtx_const
*) ptr
->u
.contents
);
3525 /* Given a constant rtx X, make (or find) a memory constant for its value
3526 and return a MEM rtx to refer to it in memory. */
3529 force_const_mem (mode
, x
)
3530 enum machine_mode mode
;
3534 register struct constant_descriptor
*desc
;
3536 const char *found
= 0;
3539 /* If we want this CONST_DOUBLE in the same mode as it is in memory
3540 (this will always be true for floating CONST_DOUBLEs that have been
3541 placed in memory, but not for VOIDmode (integer) CONST_DOUBLEs),
3542 use the previous copy. Otherwise, make a new one. Note that in
3543 the unlikely event that this same CONST_DOUBLE is used in two different
3544 modes in an alternating fashion, we will allocate a lot of different
3545 memory locations, but this should be extremely rare. */
3547 if (GET_CODE (x
) == CONST_DOUBLE
3548 && GET_CODE (CONST_DOUBLE_MEM (x
)) == MEM
3549 && GET_MODE (CONST_DOUBLE_MEM (x
)) == mode
)
3550 return CONST_DOUBLE_MEM (x
);
3552 /* Compute hash code of X. Search the descriptors for that hash code
3553 to see if any of them describes X. If yes, the descriptor records
3554 the label number already assigned. */
3556 hash
= const_hash_rtx (mode
, x
);
3558 for (desc
= const_rtx_hash_table
[hash
]; desc
; desc
= desc
->next
)
3559 if (compare_constant_rtx (mode
, x
, desc
))
3561 found
= desc
->label
;
3567 register struct pool_constant
*pool
;
3570 /* No constant equal to X is known to have been output.
3571 Make a constant descriptor to enter X in the hash table.
3572 Assign the label number and record it in the descriptor for
3573 future calls to this function to find. */
3575 desc
= record_constant_rtx (mode
, x
);
3576 desc
->next
= const_rtx_hash_table
[hash
];
3577 const_rtx_hash_table
[hash
] = desc
;
3579 /* Align the location counter as required by EXP's data type. */
3580 align
= (mode
== VOIDmode
) ? UNITS_PER_WORD
: GET_MODE_SIZE (mode
);
3581 if (align
> BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
3582 align
= BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
;
3583 #ifdef CONSTANT_ALIGNMENT
3584 align
= CONSTANT_ALIGNMENT (make_tree (type_for_mode (mode
, 0), x
),
3585 align
* BITS_PER_UNIT
) / BITS_PER_UNIT
;
3588 pool_offset
+= align
- 1;
3589 pool_offset
&= ~ (align
- 1);
3591 /* Allocate a pool constant descriptor, fill it in, and chain it in. */
3593 pool
= (struct pool_constant
*) ggc_alloc (sizeof (struct pool_constant
));
3597 pool
->labelno
= const_labelno
;
3598 pool
->align
= align
;
3599 pool
->offset
= pool_offset
;
3606 last_pool
->next
= pool
;
3609 pool_offset
+= GET_MODE_SIZE (mode
);
3611 /* Create a string containing the label name, in LABEL. */
3612 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
3616 desc
->label
= found
= ggc_strdup (label
);
3618 /* Add label to symbol hash table. */
3619 hash
= SYMHASH (found
);
3620 pool
->label
= found
;
3621 pool
->next_sym
= const_rtx_sym_hash_table
[hash
];
3622 const_rtx_sym_hash_table
[hash
] = pool
;
3625 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
3627 def
= gen_rtx_MEM (mode
, gen_rtx_SYMBOL_REF (Pmode
, found
));
3628 set_mem_attributes (def
, type_for_mode (mode
, 0), 1);
3629 RTX_UNCHANGING_P (def
) = 1;
3631 /* Mark the symbol_ref as belonging to this constants pool. */
3632 CONSTANT_POOL_ADDRESS_P (XEXP (def
, 0)) = 1;
3633 current_function_uses_const_pool
= 1;
3635 if (GET_CODE (x
) == CONST_DOUBLE
)
3637 if (CONST_DOUBLE_MEM (x
) == cc0_rtx
)
3639 CONST_DOUBLE_CHAIN (x
) = const_double_chain
;
3640 const_double_chain
= x
;
3642 CONST_DOUBLE_MEM (x
) = def
;
3648 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
3649 the corresponding pool_constant structure. */
3651 static struct pool_constant
*
3652 find_pool_constant (f
, addr
)
3656 struct pool_constant
*pool
;
3657 const char *label
= XSTR (addr
, 0);
3659 for (pool
= f
->varasm
->x_const_rtx_sym_hash_table
[SYMHASH (label
)]; pool
;
3660 pool
= pool
->next_sym
)
3661 if (pool
->label
== label
)
3667 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
3670 get_pool_constant (addr
)
3673 return (find_pool_constant (cfun
, addr
))->constant
;
3676 /* Likewise, but for the constant pool of a specific function. */
3679 get_pool_constant_for_function (f
, addr
)
3683 return (find_pool_constant (f
, addr
))->constant
;
3686 /* Similar, return the mode. */
3689 get_pool_mode (addr
)
3692 return (find_pool_constant (cfun
, addr
))->mode
;
3696 get_pool_mode_for_function (f
, addr
)
3700 return (find_pool_constant (f
, addr
))->mode
;
3703 /* Similar, return the offset in the constant pool. */
3706 get_pool_offset (addr
)
3709 return (find_pool_constant (cfun
, addr
))->offset
;
3712 /* Return the size of the constant pool. */
3720 /* Write all the constants in the constant pool. */
3723 output_constant_pool (fnname
, fndecl
)
3724 const char *fnname ATTRIBUTE_UNUSED
;
3725 tree fndecl ATTRIBUTE_UNUSED
;
3727 struct pool_constant
*pool
;
3729 union real_extract u
;
3731 /* It is possible for gcc to call force_const_mem and then to later
3732 discard the instructions which refer to the constant. In such a
3733 case we do not need to output the constant. */
3734 mark_constant_pool ();
3736 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3737 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3740 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3749 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3750 whose CODE_LABEL has been deleted. This can occur if a jump table
3751 is eliminated by optimization. If so, write a constant of zero
3752 instead. Note that this can also happen by turning the
3753 CODE_LABEL into a NOTE. */
3754 /* ??? This seems completely and utterly wrong. Certainly it's
3755 not true for NOTE_INSN_DELETED_LABEL, but I disbelieve proper
3756 functioning even with INSN_DELETED_P and friends. */
3759 switch (GET_CODE (x
))
3762 if (GET_CODE (XEXP (x
, 0)) != PLUS
3763 || GET_CODE (XEXP (XEXP (x
, 0), 0)) != LABEL_REF
)
3765 tmp
= XEXP (XEXP (x
, 0), 0);
3770 if (INSN_DELETED_P (tmp
)
3771 || (GET_CODE (tmp
) == NOTE
3772 && NOTE_LINE_NUMBER (tmp
) == NOTE_INSN_DELETED
))
3783 /* First switch to correct section. */
3784 #ifdef SELECT_RTX_SECTION
3785 SELECT_RTX_SECTION (pool
->mode
, x
);
3787 readonly_data_section ();
3790 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3791 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file
, x
, pool
->mode
,
3792 pool
->align
, pool
->labelno
, done
);
3795 if (pool
->align
> 1)
3796 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (pool
->align
));
3798 /* Output the label. */
3799 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LC", pool
->labelno
);
3801 /* Output the value of the constant itself. */
3802 switch (GET_MODE_CLASS (pool
->mode
))
3805 if (GET_CODE (x
) != CONST_DOUBLE
)
3808 memcpy ((char *) &u
, (char *) &CONST_DOUBLE_LOW (x
), sizeof u
);
3809 assemble_real (u
.d
, pool
->mode
);
3813 case MODE_PARTIAL_INT
:
3814 assemble_integer (x
, GET_MODE_SIZE (pool
->mode
), 1);
3821 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3827 #ifdef ASM_OUTPUT_POOL_EPILOGUE
3828 ASM_OUTPUT_POOL_EPILOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3831 /* Done with this pool. */
3832 first_pool
= last_pool
= 0;
3835 /* Look through the instructions for this function, and mark all the
3836 entries in the constant pool which are actually being used.
3837 Emit used deferred strings. */
3840 mark_constant_pool ()
3843 struct pool_constant
*pool
;
3845 if (first_pool
== 0 && htab_elements (const_str_htab
) == 0)
3848 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3851 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
3853 mark_constants (PATTERN (insn
));
3855 for (insn
= current_function_epilogue_delay_list
;
3857 insn
= XEXP (insn
, 1))
3859 mark_constants (PATTERN (insn
));
3862 /* Look through appropriate parts of X, marking all entries in the
3863 constant pool which are actually being used. Entries that are only
3864 referenced by other constants are also marked as used. Emit
3865 deferred strings that are used. */
3872 register const char *format_ptr
;
3877 if (GET_CODE (x
) == SYMBOL_REF
)
3879 mark_constant (&x
, NULL
);
3882 /* Never search inside a CONST_DOUBLE, because CONST_DOUBLE_MEM may be
3883 a MEM, but does not constitute a use of that MEM. */
3884 else if (GET_CODE (x
) == CONST_DOUBLE
)
3887 /* Insns may appear inside a SEQUENCE. Only check the patterns of
3888 insns, not any notes that may be attached. We don't want to mark
3889 a constant just because it happens to appear in a REG_EQUIV note. */
3892 mark_constants (PATTERN (x
));
3896 format_ptr
= GET_RTX_FORMAT (GET_CODE (x
));
3898 for (i
= 0; i
< GET_RTX_LENGTH (GET_CODE (x
)); i
++)
3900 switch (*format_ptr
++)
3903 mark_constants (XEXP (x
, i
));
3907 if (XVEC (x
, i
) != 0)
3911 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
3912 mark_constants (XVECEXP (x
, i
, j
));
3931 /* Given a SYMBOL_REF CURRENT_RTX, mark it and all constants it refers
3932 to as used. Emit referenced deferred strings. This function can
3933 be used with for_each_rtx () to mark all SYMBOL_REFs in an rtx. */
3936 mark_constant (current_rtx
, data
)
3938 void *data ATTRIBUTE_UNUSED
;
3940 rtx x
= *current_rtx
;
3944 else if (GET_CODE(x
) == CONST_DOUBLE
)
3945 /* Never search inside a CONST_DOUBLE because CONST_DOUBLE_MEM may
3946 be a MEM but does not constitute a use of that MEM. */
3948 else if (GET_CODE (x
) == SYMBOL_REF
)
3950 if (CONSTANT_POOL_ADDRESS_P (x
))
3952 struct pool_constant
*pool
= find_pool_constant (cfun
, x
);
3953 if (pool
->mark
== 0) {
3955 for_each_rtx (&(pool
->constant
), &mark_constant
, NULL
);
3960 else if (STRING_POOL_ADDRESS_P (x
))
3962 struct deferred_string
**defstr
;
3964 defstr
= (struct deferred_string
**)
3965 htab_find_slot_with_hash (const_str_htab
, XSTR (x
, 0),
3966 STRHASH (XSTR (x
, 0)), NO_INSERT
);
3969 struct deferred_string
*p
= *defstr
;
3971 STRING_POOL_ADDRESS_P (x
) = 0;
3972 output_constant_def_contents (p
->exp
, 0, p
->labelno
);
3973 htab_clear_slot (const_str_htab
, (void **) defstr
);
3980 /* Find all the constants whose addresses are referenced inside of EXP,
3981 and make sure assembler code with a label has been output for each one.
3982 Indicate whether an ADDR_EXPR has been encountered. */
3985 output_addressed_constants (exp
)
3990 /* Give the front-end a chance to convert VALUE to something that
3991 looks more like a constant to the back-end. */
3992 if (lang_expand_constant
)
3993 exp
= (*lang_expand_constant
) (exp
);
3995 switch (TREE_CODE (exp
))
3999 register tree constant
= TREE_OPERAND (exp
, 0);
4001 while (TREE_CODE (constant
) == COMPONENT_REF
)
4003 constant
= TREE_OPERAND (constant
, 0);
4006 if (TREE_CODE_CLASS (TREE_CODE (constant
)) == 'c'
4007 || TREE_CODE (constant
) == CONSTRUCTOR
)
4008 /* No need to do anything here
4009 for addresses of variables or functions. */
4010 output_constant_def (constant
, 0);
4017 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
4018 reloc
|= output_addressed_constants (TREE_OPERAND (exp
, 1));
4023 case NON_LVALUE_EXPR
:
4024 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
4030 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
4031 if (TREE_VALUE (link
) != 0)
4032 reloc
|= output_addressed_constants (TREE_VALUE (link
));
4042 /* Return nonzero if VALUE is a valid constant-valued expression
4043 for use in initializing a static variable; one that can be an
4044 element of a "constant" initializer.
4046 Return null_pointer_node if the value is absolute;
4047 if it is relocatable, return the variable that determines the relocation.
4048 We assume that VALUE has been folded as much as possible;
4049 therefore, we do not need to check for such things as
4050 arithmetic-combinations of integers. */
4053 initializer_constant_valid_p (value
, endtype
)
4057 /* Give the front-end a chance to convert VALUE to something that
4058 looks more like a constant to the back-end. */
4059 if (lang_expand_constant
)
4060 value
= (*lang_expand_constant
) (value
);
4062 switch (TREE_CODE (value
))
4065 if ((TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
4066 || TREE_CODE (TREE_TYPE (value
)) == RECORD_TYPE
)
4067 && TREE_CONSTANT (value
)
4068 && CONSTRUCTOR_ELTS (value
))
4070 initializer_constant_valid_p (TREE_VALUE (CONSTRUCTOR_ELTS (value
)),
4073 return TREE_STATIC (value
) ? null_pointer_node
: 0;
4079 return null_pointer_node
;
4082 return staticp (TREE_OPERAND (value
, 0)) ? TREE_OPERAND (value
, 0) : 0;
4084 case NON_LVALUE_EXPR
:
4085 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
4089 /* Allow conversions between pointer types. */
4090 if (POINTER_TYPE_P (TREE_TYPE (value
))
4091 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
4092 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
4094 /* Allow conversions between real types. */
4095 if (FLOAT_TYPE_P (TREE_TYPE (value
))
4096 && FLOAT_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
4097 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
4099 /* Allow length-preserving conversions between integer types. */
4100 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
4101 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
4102 && (TYPE_PRECISION (TREE_TYPE (value
))
4103 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
4104 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
4106 /* Allow conversions between other integer types only if
4108 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
4109 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
4111 tree inner
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4113 if (inner
== null_pointer_node
)
4114 return null_pointer_node
;
4118 /* Allow (int) &foo provided int is as wide as a pointer. */
4119 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
4120 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
4121 && (TYPE_PRECISION (TREE_TYPE (value
))
4122 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
4123 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4126 /* Likewise conversions from int to pointers, but also allow
4127 conversions from 0. */
4128 if (POINTER_TYPE_P (TREE_TYPE (value
))
4129 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
4131 if (integer_zerop (TREE_OPERAND (value
, 0)))
4132 return null_pointer_node
;
4133 else if (TYPE_PRECISION (TREE_TYPE (value
))
4134 <= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0))))
4135 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4139 /* Allow conversions to union types if the value inside is okay. */
4140 if (TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
)
4141 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4146 if (! INTEGRAL_TYPE_P (endtype
)
4147 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
4149 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4151 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
4153 /* If either term is absolute, use the other terms relocation. */
4154 if (valid0
== null_pointer_node
)
4156 if (valid1
== null_pointer_node
)
4162 if (! INTEGRAL_TYPE_P (endtype
)
4163 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
4165 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4167 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
4169 /* Win if second argument is absolute. */
4170 if (valid1
== null_pointer_node
)
4172 /* Win if both arguments have the same relocation.
4173 Then the value is absolute. */
4174 if (valid0
== valid1
&& valid0
!= 0)
4175 return null_pointer_node
;
4177 /* Since GCC guarantees that string constants are unique in the
4178 generated code, a subtraction between two copies of the same
4179 constant string is absolute. */
4180 if (valid0
&& TREE_CODE (valid0
) == STRING_CST
&&
4181 valid1
&& TREE_CODE (valid1
) == STRING_CST
&&
4182 TREE_STRING_POINTER (valid0
) == TREE_STRING_POINTER (valid1
))
4183 return null_pointer_node
;
4186 /* Support differences between labels. */
4187 if (INTEGRAL_TYPE_P (endtype
))
4190 op0
= TREE_OPERAND (value
, 0);
4191 op1
= TREE_OPERAND (value
, 1);
4195 if (TREE_CODE (op0
) == ADDR_EXPR
4196 && TREE_CODE (TREE_OPERAND (op0
, 0)) == LABEL_DECL
4197 && TREE_CODE (op1
) == ADDR_EXPR
4198 && TREE_CODE (TREE_OPERAND (op1
, 0)) == LABEL_DECL
)
4199 return null_pointer_node
;
4210 /* Output assembler code for constant EXP to FILE, with no label.
4211 This includes the pseudo-op such as ".int" or ".byte", and a newline.
4212 Assumes output_addressed_constants has been done on EXP already.
4214 Generate exactly SIZE bytes of assembler data, padding at the end
4215 with zeros if necessary. SIZE must always be specified.
4217 SIZE is important for structure constructors,
4218 since trailing members may have been omitted from the constructor.
4219 It is also important for initialization of arrays from string constants
4220 since the full length of the string constant might not be wanted.
4221 It is also needed for initialization of unions, where the initializer's
4222 type is just one member, and that may not be as long as the union.
4224 There a case in which we would fail to output exactly SIZE bytes:
4225 for a structure constructor that wants to produce more than SIZE bytes.
4226 But such constructors will never be generated for any possible input. */
4229 output_constant (exp
, size
)
4233 register enum tree_code code
= TREE_CODE (TREE_TYPE (exp
));
4235 /* Some front-ends use constants other than the standard
4236 language-indepdent varieties, but which may still be output
4237 directly. Give the front-end a chance to convert EXP to a
4238 language-independent representation. */
4239 if (lang_expand_constant
)
4241 exp
= (*lang_expand_constant
) (exp
);
4242 code
= TREE_CODE (TREE_TYPE (exp
));
4245 if (size
== 0 || flag_syntax_only
)
4248 /* Eliminate the NON_LVALUE_EXPR_EXPR that makes a cast not be an lvalue.
4249 That way we get the constant (we hope) inside it. Also, strip off any
4250 NOP_EXPR that converts between two record, union, array, or set types
4251 or a CONVERT_EXPR that converts to a union TYPE. */
4252 while ((TREE_CODE (exp
) == NOP_EXPR
4253 && (TREE_TYPE (exp
) == TREE_TYPE (TREE_OPERAND (exp
, 0))
4254 || AGGREGATE_TYPE_P (TREE_TYPE (exp
))))
4255 || (TREE_CODE (exp
) == CONVERT_EXPR
4256 && code
== UNION_TYPE
)
4257 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
4259 exp
= TREE_OPERAND (exp
, 0);
4260 code
= TREE_CODE (TREE_TYPE (exp
));
4263 /* Allow a constructor with no elements for any data type.
4264 This means to fill the space with zeros. */
4265 if (TREE_CODE (exp
) == CONSTRUCTOR
&& CONSTRUCTOR_ELTS (exp
) == 0)
4267 assemble_zeros (size
);
4278 case REFERENCE_TYPE
:
4279 /* ??? What about (int)((float)(int)&foo + 4) */
4280 while (TREE_CODE (exp
) == NOP_EXPR
|| TREE_CODE (exp
) == CONVERT_EXPR
4281 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
4282 exp
= TREE_OPERAND (exp
, 0);
4284 if (! assemble_integer (expand_expr (exp
, NULL_RTX
, VOIDmode
,
4285 EXPAND_INITIALIZER
),
4287 error ("initializer for integer value is too complicated");
4292 if (TREE_CODE (exp
) != REAL_CST
)
4293 error ("initializer for floating value is not a floating constant");
4295 assemble_real (TREE_REAL_CST (exp
),
4296 mode_for_size (size
* BITS_PER_UNIT
, MODE_FLOAT
, 0));
4301 output_constant (TREE_REALPART (exp
), size
/ 2);
4302 output_constant (TREE_IMAGPART (exp
), size
/ 2);
4303 size
-= (size
/ 2) * 2;
4307 if (TREE_CODE (exp
) == CONSTRUCTOR
)
4309 output_constructor (exp
, size
);
4312 else if (TREE_CODE (exp
) == STRING_CST
)
4316 if (size
> TREE_STRING_LENGTH (exp
))
4318 excess
= size
- TREE_STRING_LENGTH (exp
);
4319 size
= TREE_STRING_LENGTH (exp
);
4322 assemble_string (TREE_STRING_POINTER (exp
), size
);
4331 if (TREE_CODE (exp
) == CONSTRUCTOR
)
4332 output_constructor (exp
, size
);
4338 if (TREE_CODE (exp
) == INTEGER_CST
)
4339 assemble_integer (expand_expr (exp
, NULL_RTX
,
4340 VOIDmode
, EXPAND_INITIALIZER
),
4342 else if (TREE_CODE (exp
) == CONSTRUCTOR
)
4344 unsigned char *buffer
= (unsigned char *) alloca (size
);
4345 if (get_set_constructor_bytes (exp
, buffer
, size
))
4347 assemble_string ((char *) buffer
, size
);
4350 error ("unknown set constructor type");
4358 assemble_zeros (size
);
4362 /* Subroutine of output_constructor, used for computing the size of
4363 arrays of unspecified length. VAL must be a CONSTRUCTOR of an array
4364 type with an unspecified upper bound. */
4366 static unsigned HOST_WIDE_INT
4367 array_size_for_constructor (val
)
4372 max_index
= NULL_TREE
;
4373 for (i
= CONSTRUCTOR_ELTS (val
); i
; i
= TREE_CHAIN (i
))
4375 tree index
= TREE_PURPOSE (i
);
4377 if (TREE_CODE (index
) == RANGE_EXPR
)
4378 index
= TREE_OPERAND (index
, 1);
4379 if (max_index
== NULL_TREE
|| tree_int_cst_lt (max_index
, index
))
4383 if (max_index
== NULL_TREE
)
4386 /* Compute the total number of array elements. */
4387 i
= size_binop (MINUS_EXPR
, convert (sizetype
, max_index
),
4389 TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (val
)))));
4390 i
= size_binop (PLUS_EXPR
, i
, convert (sizetype
, integer_one_node
));
4392 /* Multiply by the array element unit size to find number of bytes. */
4393 i
= size_binop (MULT_EXPR
, i
, TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (val
))));
4395 return tree_low_cst (i
, 1);
4398 /* Subroutine of output_constant, used for CONSTRUCTORs (aggregate constants).
4399 Generate at least SIZE bytes, padding if necessary. */
4402 output_constructor (exp
, size
)
4406 tree type
= TREE_TYPE (exp
);
4407 register tree link
, field
= 0;
4409 /* Number of bytes output or skipped so far.
4410 In other words, current position within the constructor. */
4411 HOST_WIDE_INT total_bytes
= 0;
4412 /* Non-zero means BYTE contains part of a byte, to be output. */
4413 int byte_buffer_in_use
= 0;
4414 register int byte
= 0;
4416 if (HOST_BITS_PER_WIDE_INT
< BITS_PER_UNIT
)
4419 if (TREE_CODE (type
) == RECORD_TYPE
)
4420 field
= TYPE_FIELDS (type
);
4422 if (TREE_CODE (type
) == ARRAY_TYPE
4423 && TYPE_DOMAIN (type
) != 0)
4424 min_index
= TYPE_MIN_VALUE (TYPE_DOMAIN (type
));
4426 /* As LINK goes through the elements of the constant,
4427 FIELD goes through the structure fields, if the constant is a structure.
4428 if the constant is a union, then we override this,
4429 by getting the field from the TREE_LIST element.
4430 But the constant could also be an array. Then FIELD is zero.
4432 There is always a maximum of one element in the chain LINK for unions
4433 (even if the initializer in a source program incorrectly contains
4435 for (link
= CONSTRUCTOR_ELTS (exp
);
4437 link
= TREE_CHAIN (link
),
4438 field
= field
? TREE_CHAIN (field
) : 0)
4440 tree val
= TREE_VALUE (link
);
4443 /* The element in a union constructor specifies the proper field
4445 if ((TREE_CODE (type
) == RECORD_TYPE
|| TREE_CODE (type
) == UNION_TYPE
4446 || TREE_CODE (type
) == QUAL_UNION_TYPE
)
4447 && TREE_PURPOSE (link
) != 0)
4448 field
= TREE_PURPOSE (link
);
4450 else if (TREE_CODE (type
) == ARRAY_TYPE
)
4451 index
= TREE_PURPOSE (link
);
4453 /* Eliminate the marker that makes a cast not be an lvalue. */
4457 if (index
&& TREE_CODE (index
) == RANGE_EXPR
)
4459 unsigned HOST_WIDE_INT fieldsize
4460 = int_size_in_bytes (TREE_TYPE (type
));
4461 HOST_WIDE_INT lo_index
= tree_low_cst (TREE_OPERAND (index
, 0), 0);
4462 HOST_WIDE_INT hi_index
= tree_low_cst (TREE_OPERAND (index
, 1), 0);
4463 HOST_WIDE_INT index
;
4465 for (index
= lo_index
; index
<= hi_index
; index
++)
4467 /* Output the element's initial value. */
4469 assemble_zeros (fieldsize
);
4471 output_constant (val
, fieldsize
);
4473 /* Count its size. */
4474 total_bytes
+= fieldsize
;
4477 else if (field
== 0 || !DECL_BIT_FIELD (field
))
4479 /* An element that is not a bit-field. */
4481 unsigned HOST_WIDE_INT fieldsize
;
4482 /* Since this structure is static,
4483 we know the positions are constant. */
4484 HOST_WIDE_INT pos
= field
? int_byte_position (field
) : 0;
4487 pos
= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (val
)), 1)
4488 * (tree_low_cst (index
, 0) - tree_low_cst (min_index
, 0)));
4490 /* Output any buffered-up bit-fields preceding this element. */
4491 if (byte_buffer_in_use
)
4493 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4495 byte_buffer_in_use
= 0;
4498 /* Advance to offset of this element.
4499 Note no alignment needed in an array, since that is guaranteed
4500 if each element has the proper size. */
4501 if ((field
!= 0 || index
!= 0) && pos
!= total_bytes
)
4503 assemble_zeros (pos
- total_bytes
);
4507 else if (field
!= 0 && DECL_PACKED (field
))
4508 /* Some assemblers automaticallly align a datum according to its
4509 size if no align directive is specified. The datum, however,
4510 may be declared with 'packed' attribute, so we have to disable
4512 ASM_OUTPUT_ALIGN (asm_out_file
, 0);
4514 /* Determine size this element should occupy. */
4519 /* If this is an array with an unspecified upper bound,
4520 the initializer determines the size. */
4521 /* ??? This ought to only checked if DECL_SIZE_UNIT is NULL,
4522 but we cannot do this until the deprecated support for
4523 initializing zero-length array members is removed. */
4524 if (TREE_CODE (TREE_TYPE (field
)) == ARRAY_TYPE
4525 && TYPE_DOMAIN (TREE_TYPE (field
))
4526 && ! TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (field
))))
4528 fieldsize
= array_size_for_constructor (val
);
4529 /* Given a non-empty initialization, this field had
4531 if (fieldsize
!= 0 && TREE_CHAIN (field
) != NULL_TREE
)
4534 else if (DECL_SIZE_UNIT (field
))
4536 /* ??? This can't be right. If the decl size overflows
4537 a host integer we will silently emit no data. */
4538 if (host_integerp (DECL_SIZE_UNIT (field
), 1))
4539 fieldsize
= tree_low_cst (DECL_SIZE_UNIT (field
), 1);
4543 fieldsize
= int_size_in_bytes (TREE_TYPE (type
));
4545 /* Output the element's initial value. */
4547 assemble_zeros (fieldsize
);
4549 output_constant (val
, fieldsize
);
4551 /* Count its size. */
4552 total_bytes
+= fieldsize
;
4554 else if (val
!= 0 && TREE_CODE (val
) != INTEGER_CST
)
4555 error ("invalid initial value for member `%s'",
4556 IDENTIFIER_POINTER (DECL_NAME (field
)));
4559 /* Element that is a bit-field. */
4561 HOST_WIDE_INT next_offset
= int_bit_position (field
);
4562 HOST_WIDE_INT end_offset
4563 = (next_offset
+ tree_low_cst (DECL_SIZE (field
), 1));
4566 val
= integer_zero_node
;
4568 /* If this field does not start in this (or, next) byte,
4570 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4572 /* Output remnant of any bit field in previous bytes. */
4573 if (byte_buffer_in_use
)
4575 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4577 byte_buffer_in_use
= 0;
4580 /* If still not at proper byte, advance to there. */
4581 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4583 assemble_zeros (next_offset
/ BITS_PER_UNIT
- total_bytes
);
4584 total_bytes
= next_offset
/ BITS_PER_UNIT
;
4588 if (! byte_buffer_in_use
)
4591 /* We must split the element into pieces that fall within
4592 separate bytes, and combine each byte with previous or
4593 following bit-fields. */
4595 /* next_offset is the offset n fbits from the beginning of
4596 the structure to the next bit of this element to be processed.
4597 end_offset is the offset of the first bit past the end of
4599 while (next_offset
< end_offset
)
4603 HOST_WIDE_INT value
;
4604 HOST_WIDE_INT next_byte
= next_offset
/ BITS_PER_UNIT
;
4605 HOST_WIDE_INT next_bit
= next_offset
% BITS_PER_UNIT
;
4607 /* Advance from byte to byte
4608 within this element when necessary. */
4609 while (next_byte
!= total_bytes
)
4611 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4616 /* Number of bits we can process at once
4617 (all part of the same byte). */
4618 this_time
= MIN (end_offset
- next_offset
,
4619 BITS_PER_UNIT
- next_bit
);
4620 if (BYTES_BIG_ENDIAN
)
4622 /* On big-endian machine, take the most significant bits
4623 first (of the bits that are significant)
4624 and put them into bytes from the most significant end. */
4625 shift
= end_offset
- next_offset
- this_time
;
4627 /* Don't try to take a bunch of bits that cross
4628 the word boundary in the INTEGER_CST. We can
4629 only select bits from the LOW or HIGH part
4631 if (shift
< HOST_BITS_PER_WIDE_INT
4632 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4634 this_time
= shift
+ this_time
- HOST_BITS_PER_WIDE_INT
;
4635 shift
= HOST_BITS_PER_WIDE_INT
;
4638 /* Now get the bits from the appropriate constant word. */
4639 if (shift
< HOST_BITS_PER_WIDE_INT
)
4640 value
= TREE_INT_CST_LOW (val
);
4641 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4643 value
= TREE_INT_CST_HIGH (val
);
4644 shift
-= HOST_BITS_PER_WIDE_INT
;
4649 /* Get the result. This works only when:
4650 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4651 byte
|= (((value
>> shift
)
4652 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4653 << (BITS_PER_UNIT
- this_time
- next_bit
));
4657 /* On little-endian machines,
4658 take first the least significant bits of the value
4659 and pack them starting at the least significant
4660 bits of the bytes. */
4661 shift
= next_offset
- int_bit_position (field
);
4663 /* Don't try to take a bunch of bits that cross
4664 the word boundary in the INTEGER_CST. We can
4665 only select bits from the LOW or HIGH part
4667 if (shift
< HOST_BITS_PER_WIDE_INT
4668 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4669 this_time
= (HOST_BITS_PER_WIDE_INT
- shift
);
4671 /* Now get the bits from the appropriate constant word. */
4672 if (shift
< HOST_BITS_PER_WIDE_INT
)
4673 value
= TREE_INT_CST_LOW (val
);
4674 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4676 value
= TREE_INT_CST_HIGH (val
);
4677 shift
-= HOST_BITS_PER_WIDE_INT
;
4682 /* Get the result. This works only when:
4683 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4684 byte
|= (((value
>> shift
)
4685 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4689 next_offset
+= this_time
;
4690 byte_buffer_in_use
= 1;
4695 if (byte_buffer_in_use
)
4697 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4701 if (total_bytes
< size
)
4702 assemble_zeros (size
- total_bytes
);
4705 #ifdef HANDLE_PRAGMA_WEAK
4706 /* Add function NAME to the weak symbols list. VALUE is a weak alias
4707 associatd with NAME. */
4710 add_weak (name
, value
)
4714 struct weak_syms
*weak
;
4716 weak
= (struct weak_syms
*) permalloc (sizeof (struct weak_syms
));
4721 weak
->next
= weak_decls
;
4723 weak
->value
= value
;
4728 #endif /* HANDLE_PRAGMA_WEAK */
4730 /* Declare DECL to be a weak symbol. */
4736 if (! TREE_PUBLIC (decl
))
4737 error_with_decl (decl
, "weak declaration of `%s' must be public");
4738 else if (TREE_ASM_WRITTEN (decl
))
4739 error_with_decl (decl
, "weak declaration of `%s' must precede definition");
4740 else if (SUPPORTS_WEAK
)
4741 DECL_WEAK (decl
) = 1;
4742 #ifdef HANDLE_PRAGMA_WEAK
4743 add_weak (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)), NULL
);
4747 /* Emit any pending weak declarations. */
4749 #ifdef HANDLE_PRAGMA_WEAK
4750 struct weak_syms
* weak_decls
;
4756 #ifdef HANDLE_PRAGMA_WEAK
4757 if (HANDLE_PRAGMA_WEAK
)
4759 struct weak_syms
*t
;
4760 for (t
= weak_decls
; t
; t
= t
->next
)
4764 ASM_WEAKEN_LABEL (asm_out_file
, t
->name
);
4766 ASM_OUTPUT_DEF (asm_out_file
, t
->name
, t
->value
);
4773 /* Remove NAME from the pending list of weak symbols. This prevents
4774 the compiler from emitting multiple .weak directives which confuses
4776 #ifdef ASM_WEAKEN_LABEL
4778 remove_from_pending_weak_list (name
)
4779 const char *name ATTRIBUTE_UNUSED
;
4781 #ifdef HANDLE_PRAGMA_WEAK
4782 if (HANDLE_PRAGMA_WEAK
)
4784 struct weak_syms
*t
;
4785 for (t
= weak_decls
; t
; t
= t
->next
)
4787 if (t
->name
&& strcmp (name
, t
->name
) == 0)
4796 assemble_alias (decl
, target
)
4797 tree decl
, target ATTRIBUTE_UNUSED
;
4801 /* We must force creation of DECL_RTL for debug info generation, even though
4802 we don't use it here. */
4803 make_decl_rtl (decl
, NULL_PTR
);
4805 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
4807 #ifdef ASM_OUTPUT_DEF
4808 /* Make name accessible from other files, if appropriate. */
4810 if (TREE_PUBLIC (decl
))
4812 #ifdef ASM_WEAKEN_LABEL
4813 if (DECL_WEAK (decl
))
4815 ASM_WEAKEN_LABEL (asm_out_file
, name
);
4816 /* Remove this function from the pending weak list so that
4817 we do not emit multiple .weak directives for it. */
4818 remove_from_pending_weak_list
4819 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
4823 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
4826 #ifdef ASM_OUTPUT_DEF_FROM_DECLS
4827 ASM_OUTPUT_DEF_FROM_DECLS (asm_out_file
, decl
, target
);
4829 ASM_OUTPUT_DEF (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4831 TREE_ASM_WRITTEN (decl
) = 1;
4833 #ifdef ASM_OUTPUT_WEAK_ALIAS
4834 if (! DECL_WEAK (decl
))
4835 warning ("only weak aliases are supported in this configuration");
4837 ASM_OUTPUT_WEAK_ALIAS (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4838 TREE_ASM_WRITTEN (decl
) = 1;
4840 warning ("alias definitions not supported in this configuration; ignored");
4845 /* Returns 1 if the target configuration supports defining public symbols
4846 so that one of them will be chosen at link time instead of generating a
4847 multiply-defined symbol error, whether through the use of weak symbols or
4848 a target-specific mechanism for having duplicates discarded. */
4851 supports_one_only ()
4853 if (SUPPORTS_ONE_ONLY
)
4855 return SUPPORTS_WEAK
;
4858 /* Set up DECL as a public symbol that can be defined in multiple
4859 translation units without generating a linker error. */
4862 make_decl_one_only (decl
)
4865 if (TREE_CODE (decl
) != VAR_DECL
&& TREE_CODE (decl
) != FUNCTION_DECL
)
4868 TREE_PUBLIC (decl
) = 1;
4870 if (TREE_CODE (decl
) == VAR_DECL
4871 && (DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
))
4872 DECL_COMMON (decl
) = 1;
4873 else if (SUPPORTS_ONE_ONLY
)
4875 #ifdef MAKE_DECL_ONE_ONLY
4876 MAKE_DECL_ONE_ONLY (decl
);
4878 DECL_ONE_ONLY (decl
) = 1;
4880 else if (SUPPORTS_WEAK
)
4881 DECL_WEAK (decl
) = 1;
4889 const_str_htab
= htab_create (128, const_str_htab_hash
, const_str_htab_eq
,
4890 const_str_htab_del
);
4891 ggc_add_root (const_hash_table
, MAX_HASH_TABLE
, sizeof const_hash_table
[0],
4892 mark_const_hash_entry
);
4893 ggc_add_root (&const_str_htab
, 1, sizeof const_str_htab
,
4894 mark_const_str_htab
);
4897 /* Extra support for EH values. */
4899 assemble_eh_label (name
)
4902 #ifdef ASM_OUTPUT_EH_LABEL
4903 ASM_OUTPUT_EH_LABEL (asm_out_file
, name
);
4905 assemble_label (name
);
4909 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
4912 assemble_eh_align (align
)
4915 #ifdef ASM_OUTPUT_EH_ALIGN
4916 if (align
> BITS_PER_UNIT
)
4917 ASM_OUTPUT_EH_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
4919 assemble_align (align
);
4924 /* On some platforms, we may want to specify a special mechansim to
4925 output EH data when generating with a function.. */
4927 assemble_eh_integer (x
, size
, force
)
4935 #ifdef ASM_OUTPUT_EH_CHAR
4937 ASM_OUTPUT_EH_CHAR (asm_out_file
, x
);
4941 #ifdef ASM_OUTPUT_EH_SHORT
4943 ASM_OUTPUT_EH_SHORT (asm_out_file
, x
);
4947 #ifdef ASM_OUTPUT_EH_INT
4949 ASM_OUTPUT_EH_INT (asm_out_file
, x
);
4953 #ifdef ASM_OUTPUT_EH_DOUBLE_INT
4955 ASM_OUTPUT_EH_DOUBLE_INT (asm_out_file
, x
);
4962 return (assemble_integer (x
, size
, force
));