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"
50 #ifdef XCOFF_DEBUGGING_INFO
51 #include "xcoffout.h" /* Needed for external data
52 declarations for e.g. AIX 4.x. */
55 #ifndef TRAMPOLINE_ALIGNMENT
56 #define TRAMPOLINE_ALIGNMENT FUNCTION_BOUNDARY
60 #define ASM_STABS_OP "\t.stabs\t"
63 /* Define the prefix to use when check_memory_usage_flag is enable. */
64 #define CHKR_PREFIX "_CHKR_"
65 #define CHKR_PREFIX_SIZE (sizeof (CHKR_PREFIX) - 1)
67 /* The (assembler) name of the first globally-visible object output. */
68 const char *first_global_object_name
;
69 const char *weak_global_object_name
;
71 extern struct obstack permanent_obstack
;
72 #define obstack_chunk_alloc xmalloc
75 struct constant_descriptor
;
79 #define MAX_RTX_HASH_TABLE 61
83 /* Hash facility for making memory-constants
84 from constant rtl-expressions. It is used on RISC machines
85 where immediate integer arguments and constant addresses are restricted
86 so that such constants must be stored in memory.
88 This pool of constants is reinitialized for each function
89 so each function gets its own constants-pool that comes right before
91 struct constant_descriptor
**x_const_rtx_hash_table
;
92 struct pool_constant
**x_const_rtx_sym_hash_table
;
94 /* Pointers to first and last constant in pool. */
95 struct pool_constant
*x_first_pool
, *x_last_pool
;
97 /* Current offset in constant pool (does not include any machine-specific
101 /* Chain of all CONST_DOUBLE rtx's constructed for the current function.
102 They are chained through the CONST_DOUBLE_CHAIN.
103 A CONST_DOUBLE rtx has CONST_DOUBLE_MEM != cc0_rtx iff it is on this chain.
104 In that case, CONST_DOUBLE_MEM is either a MEM,
105 or const0_rtx if no MEM has been made for this CONST_DOUBLE yet. */
106 rtx x_const_double_chain
;
109 #define const_rtx_hash_table (cfun->varasm->x_const_rtx_hash_table)
110 #define const_rtx_sym_hash_table (cfun->varasm->x_const_rtx_sym_hash_table)
111 #define first_pool (cfun->varasm->x_first_pool)
112 #define last_pool (cfun->varasm->x_last_pool)
113 #define pool_offset (cfun->varasm->x_pool_offset)
114 #define const_double_chain (cfun->varasm->x_const_double_chain)
116 /* Number for making the label on the next
117 constant that is stored in memory. */
121 /* Number for making the label on the next
122 static variable internal to a function. */
126 /* Carry information from ASM_DECLARE_OBJECT_NAME
127 to ASM_FINISH_DECLARE_OBJECT. */
129 int size_directive_output
;
131 /* The last decl for which assemble_variable was called,
132 if it did ASM_DECLARE_OBJECT_NAME.
133 If the last call to assemble_variable didn't do that,
136 tree last_assemble_variable_decl
;
138 static const char *strip_reg_name
PARAMS ((const char *));
139 static int contains_pointers_p
PARAMS ((tree
));
140 static void decode_addr_const
PARAMS ((tree
, struct addr_const
*));
141 static int const_hash
PARAMS ((tree
));
142 static int compare_constant
PARAMS ((tree
,
143 struct constant_descriptor
*));
144 static const unsigned char *compare_constant_1
PARAMS ((tree
, const unsigned char *));
145 static struct constant_descriptor
*record_constant
PARAMS ((tree
));
146 static void record_constant_1
PARAMS ((tree
));
147 static tree copy_constant
PARAMS ((tree
));
148 static void output_constant_def_contents
PARAMS ((tree
, int, int));
149 static void decode_rtx_const
PARAMS ((enum machine_mode
, rtx
,
150 struct rtx_const
*));
151 static int const_hash_rtx
PARAMS ((enum machine_mode
, rtx
));
152 static int compare_constant_rtx
PARAMS ((enum machine_mode
, rtx
,
153 struct constant_descriptor
*));
154 static struct constant_descriptor
*record_constant_rtx
PARAMS ((enum machine_mode
,
156 static struct pool_constant
*find_pool_constant
PARAMS ((struct function
*, rtx
));
157 static void mark_constant_pool
PARAMS ((void));
158 static void mark_constants
PARAMS ((rtx
));
159 static int mark_constant
PARAMS ((rtx
*current_rtx
, void *data
));
160 static int output_addressed_constants
PARAMS ((tree
));
161 static void output_after_function_constants
PARAMS ((void));
162 static unsigned HOST_WIDE_INT array_size_for_constructor
PARAMS ((tree
));
163 static void output_constructor
PARAMS ((tree
, int));
164 #ifdef ASM_WEAKEN_LABEL
165 static void remove_from_pending_weak_list
PARAMS ((const char *));
167 #ifdef ASM_OUTPUT_BSS
168 static void asm_output_bss
PARAMS ((FILE *, tree
, const char *, int, int));
170 #ifdef BSS_SECTION_ASM_OP
171 #ifdef ASM_OUTPUT_ALIGNED_BSS
172 static void asm_output_aligned_bss
PARAMS ((FILE *, tree
, const char *,
175 #endif /* BSS_SECTION_ASM_OP */
176 static void mark_pool_constant
PARAMS ((struct pool_constant
*));
177 static void mark_const_hash_entry
PARAMS ((void *));
178 static int mark_const_str_htab_1
PARAMS ((void **, void *));
179 static void mark_const_str_htab
PARAMS ((void *));
180 static hashval_t const_str_htab_hash
PARAMS ((const void *x
));
181 static int const_str_htab_eq
PARAMS ((const void *x
, const void *y
));
182 static void const_str_htab_del
PARAMS ((void *));
183 static void asm_emit_uninitialised
PARAMS ((tree
, const char*, int, int));
185 static enum in_section
{ no_section
, in_text
, in_data
, in_named
186 #ifdef BSS_SECTION_ASM_OP
189 #ifdef EH_FRAME_SECTION_ASM_OP
192 #ifdef EXTRA_SECTIONS
195 } in_section
= no_section
;
197 /* Return a non-zero value if DECL has a section attribute. */
198 #ifndef IN_NAMED_SECTION
199 #define IN_NAMED_SECTION(DECL) \
200 ((TREE_CODE (DECL) == FUNCTION_DECL || TREE_CODE (DECL) == VAR_DECL) \
201 && DECL_SECTION_NAME (DECL) != NULL_TREE)
204 /* Text of section name when in_section == in_named. */
205 static const char *in_named_name
;
207 /* Define functions like text_section for any extra sections. */
208 #ifdef EXTRA_SECTION_FUNCTIONS
209 EXTRA_SECTION_FUNCTIONS
212 /* Tell assembler to switch to text section. */
217 if (in_section
!= in_text
)
219 fprintf (asm_out_file
, "%s\n", TEXT_SECTION_ASM_OP
);
220 in_section
= in_text
;
224 /* Tell assembler to switch to data section. */
229 if (in_section
!= in_data
)
231 if (flag_shared_data
)
233 #ifdef SHARED_SECTION_ASM_OP
234 fprintf (asm_out_file
, "%s\n", SHARED_SECTION_ASM_OP
);
236 fprintf (asm_out_file
, "%s\n", DATA_SECTION_ASM_OP
);
240 fprintf (asm_out_file
, "%s\n", DATA_SECTION_ASM_OP
);
242 in_section
= in_data
;
245 /* Tell assembler to ALWAYS switch to data section, in case
246 it's not sure where it it. */
249 force_data_section ()
251 in_section
= no_section
;
255 /* Tell assembler to switch to read-only data section. This is normally
259 readonly_data_section ()
261 #ifdef READONLY_DATA_SECTION
262 READONLY_DATA_SECTION (); /* Note this can call data_section. */
268 /* Determine if we're in the text section. */
273 return in_section
== in_text
;
276 /* Determine if we're in the data section. */
281 return in_section
== in_data
;
284 /* Tell assembler to change to section NAME for DECL.
285 If DECL is NULL, just switch to section NAME.
286 If NAME is NULL, get the name from DECL.
287 If RELOC is 1, the initializer for DECL contains relocs. */
290 named_section (decl
, name
, reloc
)
293 int reloc ATTRIBUTE_UNUSED
;
295 if (decl
!= NULL_TREE
&& !DECL_P (decl
))
298 name
= TREE_STRING_POINTER (DECL_SECTION_NAME (decl
));
300 if (in_section
!= in_named
|| strcmp (name
, in_named_name
))
302 #ifdef ASM_OUTPUT_SECTION_NAME
303 ASM_OUTPUT_SECTION_NAME (asm_out_file
, decl
, name
, reloc
);
305 /* Section attributes are not supported if this macro isn't provided -
306 some host formats don't support them at all. The front-end should
307 already have flagged this as an error. */
311 in_named_name
= ggc_strdup (name
);
312 in_section
= in_named
;
316 #ifdef BSS_SECTION_ASM_OP
318 /* Tell the assembler to switch to the bss section. */
323 if (in_section
!= in_bss
)
325 #ifdef SHARED_BSS_SECTION_ASM_OP
326 if (flag_shared_data
)
327 fprintf (asm_out_file
, "%s\n", SHARED_BSS_SECTION_ASM_OP
);
330 fprintf (asm_out_file
, "%s\n", BSS_SECTION_ASM_OP
);
336 #ifdef ASM_OUTPUT_BSS
338 /* Utility function for ASM_OUTPUT_BSS for targets to use if
339 they don't support alignments in .bss.
340 ??? It is believed that this function will work in most cases so such
341 support is localized here. */
344 asm_output_bss (file
, decl
, name
, size
, rounded
)
346 tree decl ATTRIBUTE_UNUSED
;
348 int size ATTRIBUTE_UNUSED
, rounded
;
350 ASM_GLOBALIZE_LABEL (file
, name
);
352 #ifdef ASM_DECLARE_OBJECT_NAME
353 last_assemble_variable_decl
= decl
;
354 ASM_DECLARE_OBJECT_NAME (file
, name
, decl
);
356 /* Standard thing is just output label for the object. */
357 ASM_OUTPUT_LABEL (file
, name
);
358 #endif /* ASM_DECLARE_OBJECT_NAME */
359 ASM_OUTPUT_SKIP (file
, rounded
);
364 #ifdef ASM_OUTPUT_ALIGNED_BSS
366 /* Utility function for targets to use in implementing
367 ASM_OUTPUT_ALIGNED_BSS.
368 ??? It is believed that this function will work in most cases so such
369 support is localized here. */
372 asm_output_aligned_bss (file
, decl
, name
, size
, align
)
378 ASM_GLOBALIZE_LABEL (file
, name
);
380 ASM_OUTPUT_ALIGN (file
, floor_log2 (align
/ BITS_PER_UNIT
));
381 #ifdef ASM_DECLARE_OBJECT_NAME
382 last_assemble_variable_decl
= decl
;
383 ASM_DECLARE_OBJECT_NAME (file
, name
, decl
);
385 /* Standard thing is just output label for the object. */
386 ASM_OUTPUT_LABEL (file
, name
);
387 #endif /* ASM_DECLARE_OBJECT_NAME */
388 ASM_OUTPUT_SKIP (file
, size
? size
: 1);
393 #endif /* BSS_SECTION_ASM_OP */
395 #ifdef EH_FRAME_SECTION_ASM_OP
399 if (in_section
!= in_eh_frame
)
401 fprintf (asm_out_file
, "%s\n", EH_FRAME_SECTION_ASM_OP
);
402 in_section
= in_eh_frame
;
407 /* Switch to the section for function DECL.
409 If DECL is NULL_TREE, switch to the text section.
410 ??? It's not clear that we will ever be passed NULL_TREE, but it's
411 safer to handle it. */
414 function_section (decl
)
417 if (decl
!= NULL_TREE
418 && DECL_SECTION_NAME (decl
) != NULL_TREE
)
419 named_section (decl
, (char *) 0, 0);
424 /* Switch to section for variable DECL.
426 RELOC is the `reloc' argument to SELECT_SECTION. */
429 variable_section (decl
, reloc
)
433 if (IN_NAMED_SECTION (decl
))
434 named_section (decl
, NULL
, reloc
);
437 /* C++ can have const variables that get initialized from constructors,
438 and thus can not be in a readonly section. We prevent this by
439 verifying that the initial value is constant for objects put in a
442 error_mark_node is used by the C front end to indicate that the
443 initializer has not been seen yet. In this case, we assume that
444 the initializer must be constant.
446 C++ uses error_mark_node for variables that have complicated
447 initializers, but these variables go in BSS so we won't be called
450 #ifdef SELECT_SECTION
451 SELECT_SECTION (decl
, reloc
);
453 if (DECL_READONLY_SECTION (decl
, reloc
))
454 readonly_data_section ();
461 /* Tell assembler to switch to the section for the exception handling
467 #if defined (EXCEPTION_SECTION)
468 EXCEPTION_SECTION ();
470 #ifdef ASM_OUTPUT_SECTION_NAME
471 named_section (NULL_TREE
, ".gcc_except_table", 0);
476 readonly_data_section ();
481 /* Given NAME, a putative register name, discard any customary prefixes. */
484 strip_reg_name (name
)
487 #ifdef REGISTER_PREFIX
488 if (!strncmp (name
, REGISTER_PREFIX
, strlen (REGISTER_PREFIX
)))
489 name
+= strlen (REGISTER_PREFIX
);
491 if (name
[0] == '%' || name
[0] == '#')
496 /* Decode an `asm' spec for a declaration as a register name.
497 Return the register number, or -1 if nothing specified,
498 or -2 if the ASMSPEC is not `cc' or `memory' and is not recognized,
499 or -3 if ASMSPEC is `cc' and is not recognized,
500 or -4 if ASMSPEC is `memory' and is not recognized.
501 Accept an exact spelling or a decimal number.
502 Prefixes such as % are optional. */
505 decode_reg_name (asmspec
)
512 /* Get rid of confusing prefixes. */
513 asmspec
= strip_reg_name (asmspec
);
515 /* Allow a decimal number as a "register name". */
516 for (i
= strlen (asmspec
) - 1; i
>= 0; i
--)
517 if (! (asmspec
[i
] >= '0' && asmspec
[i
] <= '9'))
519 if (asmspec
[0] != 0 && i
< 0)
522 if (i
< FIRST_PSEUDO_REGISTER
&& i
>= 0)
528 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
530 && ! strcmp (asmspec
, strip_reg_name (reg_names
[i
])))
533 #ifdef ADDITIONAL_REGISTER_NAMES
535 static struct { const char *name
; int number
; } table
[]
536 = ADDITIONAL_REGISTER_NAMES
;
538 for (i
= 0; i
< (int) ARRAY_SIZE (table
); i
++)
539 if (! strcmp (asmspec
, table
[i
].name
))
540 return table
[i
].number
;
542 #endif /* ADDITIONAL_REGISTER_NAMES */
544 if (!strcmp (asmspec
, "memory"))
547 if (!strcmp (asmspec
, "cc"))
556 /* Create the DECL_RTL for a VAR_DECL or FUNCTION_DECL. DECL should
557 have static storage duration. In other words, it should not be an
558 automatic variable, including PARM_DECLs.
560 There is, however, one exception: this function handles variables
561 explicitly placed in a particular register by the user.
563 ASMSPEC, if not 0, is the string which the user specified as the
564 assembler symbol name.
566 This is never called for PARM_DECL nodes. */
569 make_decl_rtl (decl
, asmspec
)
573 int top_level
= (DECL_CONTEXT (decl
) == NULL_TREE
);
574 const char *name
= 0;
575 const char *new_name
= 0;
578 /* Check that we are not being given an automatic variable. */
579 /* A weak alias has TREE_PUBLIC set but not the other bits. */
580 if (TREE_CODE (decl
) == PARM_DECL
581 || TREE_CODE (decl
) == RESULT_DECL
582 || (TREE_CODE (decl
) == VAR_DECL
583 && !TREE_STATIC (decl
)
584 && !TREE_PUBLIC (decl
)
585 && !DECL_EXTERNAL (decl
)
586 && !DECL_REGISTER (decl
)))
588 /* And that we were not given a type or a label. */
589 else if (TREE_CODE (decl
) == TYPE_DECL
590 || TREE_CODE (decl
) == LABEL_DECL
)
593 /* For a duplicate declaration, we can be called twice on the
594 same DECL node. Don't discard the RTL already made. */
595 if (DECL_RTL_SET_P (decl
))
597 /* If the old RTL had the wrong mode, fix the mode. */
598 if (GET_MODE (DECL_RTL (decl
)) != DECL_MODE (decl
))
600 rtx rtl
= DECL_RTL (decl
);
601 PUT_MODE (rtl
, DECL_MODE (decl
));
604 /* ??? Another way to do this would be to do what halfpic.c does
605 and maintain a hashed table of such critters. */
606 /* ??? Another way to do this would be to pass a flag bit to
607 ENCODE_SECTION_INFO saying whether this is a new decl or not. */
608 /* Let the target reassign the RTL if it wants.
609 This is necessary, for example, when one machine specific
610 decl attribute overrides another. */
611 #ifdef REDO_SECTION_INFO_P
612 if (REDO_SECTION_INFO_P (decl
))
613 ENCODE_SECTION_INFO (decl
);
618 new_name
= name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
620 reg_number
= decode_reg_name (asmspec
);
621 if (reg_number
== -2)
623 /* ASMSPEC is given, and not the name of a register. Mark the
624 name with a star so assemble_name won't munge it. */
625 char *starred
= alloca (strlen (asmspec
) + 2);
627 strcpy (starred
+ 1, asmspec
);
631 if (TREE_CODE (decl
) != FUNCTION_DECL
&& DECL_REGISTER (decl
))
633 /* First detect errors in declaring global registers. */
634 if (reg_number
== -1)
635 error_with_decl (decl
, "register name not specified for `%s'");
636 else if (reg_number
< 0)
637 error_with_decl (decl
, "invalid register name for `%s'");
638 else if (TYPE_MODE (TREE_TYPE (decl
)) == BLKmode
)
639 error_with_decl (decl
,
640 "data type of `%s' isn't suitable for a register");
641 else if (! HARD_REGNO_MODE_OK (reg_number
, TYPE_MODE (TREE_TYPE (decl
))))
642 error_with_decl (decl
,
643 "register specified for `%s' isn't suitable for data type");
644 /* Now handle properly declared static register variables. */
649 if (DECL_INITIAL (decl
) != 0 && TREE_STATIC (decl
))
651 DECL_INITIAL (decl
) = 0;
652 error ("global register variable has initial value");
654 if (TREE_THIS_VOLATILE (decl
))
655 warning ("volatile register variables don't work as you might wish");
657 /* If the user specified one of the eliminables registers here,
658 e.g., FRAME_POINTER_REGNUM, we don't want to get this variable
659 confused with that register and be eliminated. Although this
660 usage is somewhat suspect, we nevertheless use the following
661 kludge to avoid setting DECL_RTL to frame_pointer_rtx. */
664 gen_rtx_REG (DECL_MODE (decl
),
665 FIRST_PSEUDO_REGISTER
));
666 REGNO (DECL_RTL (decl
)) = reg_number
;
667 REG_USERVAR_P (DECL_RTL (decl
)) = 1;
669 if (TREE_STATIC (decl
))
671 /* Make this register global, so not usable for anything
673 #ifdef ASM_DECLARE_REGISTER_GLOBAL
674 ASM_DECLARE_REGISTER_GLOBAL (asm_out_file
, decl
, reg_number
, name
);
676 nregs
= HARD_REGNO_NREGS (reg_number
, DECL_MODE (decl
));
678 globalize_reg (reg_number
+ --nregs
);
681 /* As a register variable, it has no section. */
686 /* Now handle ordinary static variables and functions (in memory).
687 Also handle vars declared register invalidly. */
689 if (reg_number
>= 0 || reg_number
== -3)
690 error_with_decl (decl
,
691 "register name given for non-register variable `%s'");
693 /* Specifying a section attribute on a variable forces it into a
694 non-.bss section, and thus it cannot be common. */
695 if (TREE_CODE (decl
) == VAR_DECL
696 && DECL_SECTION_NAME (decl
) != NULL_TREE
697 && DECL_INITIAL (decl
) == NULL_TREE
698 && DECL_COMMON (decl
))
699 DECL_COMMON (decl
) = 0;
701 /* Can't use just the variable's own name for a variable
702 whose scope is less than the whole file, unless it's a member
703 of a local class (which will already be unambiguous).
704 Concatenate a distinguishing number. */
705 if (!top_level
&& !TREE_PUBLIC (decl
)
706 && ! (DECL_CONTEXT (decl
) && TYPE_P (DECL_CONTEXT (decl
)))
708 && name
== IDENTIFIER_POINTER (DECL_NAME (decl
)))
711 ASM_FORMAT_PRIVATE_NAME (label
, name
, var_labelno
);
716 /* When -fprefix-function-name is used, the functions
717 names are prefixed. Only nested function names are not
719 else if (flag_prefix_function_name
&& TREE_CODE (decl
) == FUNCTION_DECL
)
721 size_t name_len
= IDENTIFIER_LENGTH (DECL_ASSEMBLER_NAME (decl
));
724 pname
= alloca (name_len
+ CHKR_PREFIX_SIZE
+ 1);
725 memcpy (pname
, CHKR_PREFIX
, CHKR_PREFIX_SIZE
);
726 memcpy (pname
+ CHKR_PREFIX_SIZE
, name
, name_len
+ 1);
730 if (name
!= new_name
)
732 SET_DECL_ASSEMBLER_NAME (decl
, get_identifier (new_name
));
733 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
736 /* If this variable is to be treated as volatile, show its
737 tree node has side effects. */
738 if ((flag_volatile_global
&& TREE_CODE (decl
) == VAR_DECL
739 && TREE_PUBLIC (decl
))
740 || ((flag_volatile_static
&& TREE_CODE (decl
) == VAR_DECL
741 && (TREE_PUBLIC (decl
) || TREE_STATIC (decl
)))))
742 TREE_SIDE_EFFECTS (decl
) = 1;
744 SET_DECL_RTL (decl
, gen_rtx_MEM (DECL_MODE (decl
),
745 gen_rtx_SYMBOL_REF (Pmode
, name
)));
746 SYMBOL_REF_WEAK (XEXP (DECL_RTL (decl
), 0)) = DECL_WEAK (decl
);
747 if (TREE_CODE (decl
) != FUNCTION_DECL
)
748 set_mem_attributes (DECL_RTL (decl
), decl
, 1);
750 /* Optionally set flags or add text to the name to record information
751 such as that it is a function name.
752 If the name is changed, the macro ASM_OUTPUT_LABELREF
753 will have to know how to strip this information. */
754 #ifdef ENCODE_SECTION_INFO
755 ENCODE_SECTION_INFO (decl
);
759 /* Make the rtl for variable VAR be volatile.
760 Use this only for static variables. */
763 make_var_volatile (var
)
766 if (GET_CODE (DECL_RTL (var
)) != MEM
)
769 MEM_VOLATILE_P (DECL_RTL (var
)) = 1;
772 /* Output alignment directive to align for constant expression EXP. */
775 assemble_constant_align (exp
)
780 /* Align the location counter as required by EXP's data type. */
781 align
= TYPE_ALIGN (TREE_TYPE (exp
));
782 #ifdef CONSTANT_ALIGNMENT
783 align
= CONSTANT_ALIGNMENT (exp
, align
);
786 if (align
> BITS_PER_UNIT
)
787 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
790 /* Output a string of literal assembler code
791 for an `asm' keyword used between functions. */
794 assemble_asm (string
)
799 if (TREE_CODE (string
) == ADDR_EXPR
)
800 string
= TREE_OPERAND (string
, 0);
802 fprintf (asm_out_file
, "\t%s\n", TREE_STRING_POINTER (string
));
805 /* Record an element in the table of global destructors.
806 How this is done depends on what sort of assembler and linker
809 NAME should be the name of a global function to be called
810 at exit time. This name is output using assemble_name. */
813 assemble_destructor (name
)
816 #ifdef ASM_OUTPUT_DESTRUCTOR
817 ASM_OUTPUT_DESTRUCTOR (asm_out_file
, name
);
821 /* Now tell GNU LD that this is part of the static destructor set. */
822 /* This code works for any machine provided you use GNU as/ld. */
823 fprintf (asm_out_file
, "%s\"___DTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
824 assemble_name (asm_out_file
, name
);
825 fputc ('\n', asm_out_file
);
830 /* Likewise for global constructors. */
833 assemble_constructor (name
)
836 #ifdef ASM_OUTPUT_CONSTRUCTOR
837 ASM_OUTPUT_CONSTRUCTOR (asm_out_file
, name
);
841 /* Now tell GNU LD that this is part of the static constructor set. */
842 /* This code works for any machine provided you use GNU as/ld. */
843 fprintf (asm_out_file
, "%s\"___CTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
844 assemble_name (asm_out_file
, name
);
845 fputc ('\n', asm_out_file
);
850 /* Likewise for entries we want to record for garbage collection.
851 Garbage collection is still under development. */
854 assemble_gc_entry (name
)
857 #ifdef ASM_OUTPUT_GC_ENTRY
858 ASM_OUTPUT_GC_ENTRY (asm_out_file
, name
);
862 /* Now tell GNU LD that this is part of the static constructor set. */
863 fprintf (asm_out_file
, "%s\"___PTR_LIST__\",22,0,0,", ASM_STABS_OP
);
864 assemble_name (asm_out_file
, name
);
865 fputc ('\n', asm_out_file
);
870 /* CONSTANT_POOL_BEFORE_FUNCTION may be defined as an expression with
871 a non-zero value if the constant pool should be output before the
872 start of the function, or a zero value if the pool should output
873 after the end of the function. The default is to put it before the
876 #ifndef CONSTANT_POOL_BEFORE_FUNCTION
877 #define CONSTANT_POOL_BEFORE_FUNCTION 1
880 /* Output assembler code for the constant pool of a function and associated
881 with defining the name of the function. DECL describes the function.
882 NAME is the function's name. For the constant pool, we use the current
883 constant pool data. */
886 assemble_start_function (decl
, fnname
)
892 /* The following code does not need preprocessing in the assembler. */
896 if (CONSTANT_POOL_BEFORE_FUNCTION
)
897 output_constant_pool (fnname
, decl
);
899 #ifdef ASM_OUTPUT_SECTION_NAME
900 /* If the function is to be put in its own section and it's not in a section
901 already, indicate so. */
902 if ((flag_function_sections
903 && DECL_SECTION_NAME (decl
) == NULL_TREE
)
904 || UNIQUE_SECTION_P (decl
))
905 UNIQUE_SECTION (decl
, 0);
908 function_section (decl
);
910 /* Tell assembler to move to target machine's alignment for functions. */
911 align
= floor_log2 (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
913 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
915 /* Handle a user-specified function alignment.
916 Note that we still need to align to FUNCTION_BOUNDARY, as above,
917 because ASM_OUTPUT_MAX_SKIP_ALIGN might not do any alignment at all. */
918 if (align_functions_log
> align
)
920 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
921 ASM_OUTPUT_MAX_SKIP_ALIGN (asm_out_file
,
922 align_functions_log
, align_functions
-1);
924 ASM_OUTPUT_ALIGN (asm_out_file
, align_functions_log
);
928 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
929 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file
, fnname
);
932 (*debug_hooks
->begin_function
) (decl
);
934 /* Make function name accessible from other files, if appropriate. */
936 if (TREE_PUBLIC (decl
))
938 if (! first_global_object_name
)
943 STRIP_NAME_ENCODING (p
, fnname
);
944 name
= permalloc (strlen (p
) + 1);
947 if (! DECL_WEAK (decl
) && ! DECL_ONE_ONLY (decl
))
948 first_global_object_name
= name
;
950 weak_global_object_name
= name
;
953 #ifdef ASM_WEAKEN_LABEL
954 if (DECL_WEAK (decl
))
956 ASM_WEAKEN_LABEL (asm_out_file
, fnname
);
957 /* Remove this function from the pending weak list so that
958 we do not emit multiple .weak directives for it. */
959 remove_from_pending_weak_list
960 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
964 ASM_GLOBALIZE_LABEL (asm_out_file
, fnname
);
967 /* Do any machine/system dependent processing of the function name */
968 #ifdef ASM_DECLARE_FUNCTION_NAME
969 ASM_DECLARE_FUNCTION_NAME (asm_out_file
, fnname
, current_function_decl
);
971 /* Standard thing is just output label for the function. */
972 ASM_OUTPUT_LABEL (asm_out_file
, fnname
);
973 #endif /* ASM_DECLARE_FUNCTION_NAME */
976 /* Output assembler code associated with defining the size of the
977 function. DECL describes the function. NAME is the function's name. */
980 assemble_end_function (decl
, fnname
)
984 #ifdef ASM_DECLARE_FUNCTION_SIZE
985 ASM_DECLARE_FUNCTION_SIZE (asm_out_file
, fnname
, decl
);
987 if (! CONSTANT_POOL_BEFORE_FUNCTION
)
989 output_constant_pool (fnname
, decl
);
990 function_section (decl
); /* need to switch back */
993 /* Output any constants which should appear after the function. */
994 output_after_function_constants ();
997 /* Assemble code to leave SIZE bytes of zeros. */
1000 assemble_zeros (size
)
1003 /* Do no output if -fsyntax-only. */
1004 if (flag_syntax_only
)
1007 #ifdef ASM_NO_SKIP_IN_TEXT
1008 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
1009 so we must output 0s explicitly in the text section. */
1010 if (ASM_NO_SKIP_IN_TEXT
&& in_text_section ())
1014 for (i
= 0; i
< size
- 20; i
+= 20)
1017 fprintf (asm_out_file
,
1018 "%s0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n", ASM_BYTE_OP
);
1020 fprintf (asm_out_file
,
1021 "\tbyte 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n");
1027 fprintf (asm_out_file
, "%s0", ASM_BYTE_OP
);
1029 fprintf (asm_out_file
, "\tbyte 0");
1032 for (; i
< size
; i
++)
1033 fprintf (asm_out_file
, ",0");
1034 fprintf (asm_out_file
, "\n");
1040 ASM_OUTPUT_SKIP (asm_out_file
, size
);
1043 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
1046 assemble_align (align
)
1049 if (align
> BITS_PER_UNIT
)
1050 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
1053 /* Assemble a string constant with the specified C string as contents. */
1056 assemble_string (p
, size
)
1063 /* If the string is very long, split it up. */
1067 int thissize
= size
- pos
;
1068 if (thissize
> maximum
)
1071 ASM_OUTPUT_ASCII (asm_out_file
, p
, thissize
);
1079 #if defined ASM_OUTPUT_ALIGNED_DECL_LOCAL
1080 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1081 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1083 #if defined ASM_OUTPUT_ALIGNED_LOCAL
1084 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1085 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, DECL_ALIGN (decl))
1087 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1088 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded)
1092 #if defined ASM_OUTPUT_ALIGNED_BSS
1093 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1094 ASM_OUTPUT_ALIGNED_BSS (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1096 #if defined ASM_OUTPUT_BSS
1097 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1098 ASM_OUTPUT_BSS (asm_out_file, decl, name, size, rounded)
1104 #if defined ASM_OUTPUT_ALIGNED_DECL_COMMON
1105 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1106 ASM_OUTPUT_ALIGNED_DECL_COMMON (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1108 #if defined ASM_OUTPUT_ALIGNED_COMMON
1109 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1110 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file, name, size, DECL_ALIGN (decl))
1112 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1113 ASM_OUTPUT_COMMON (asm_out_file, name, size, rounded)
1118 asm_emit_uninitialised (decl
, name
, size
, rounded
)
1121 int size ATTRIBUTE_UNUSED
;
1122 int rounded ATTRIBUTE_UNUSED
;
1130 destination
= asm_dest_local
;
1132 if (TREE_PUBLIC (decl
))
1134 #if defined ASM_EMIT_BSS
1135 if (! DECL_COMMON (decl
))
1136 destination
= asm_dest_bss
;
1139 destination
= asm_dest_common
;
1142 if (flag_shared_data
)
1144 switch (destination
)
1146 #ifdef ASM_OUTPUT_SHARED_BSS
1148 ASM_OUTPUT_SHARED_BSS (asm_out_file
, decl
, name
, size
, rounded
);
1151 #ifdef ASM_OUTPUT_SHARED_COMMON
1152 case asm_dest_common
:
1153 ASM_OUTPUT_SHARED_COMMON (asm_out_file
, name
, size
, rounded
);
1156 #ifdef ASM_OUTPUT_SHARED_LOCAL
1157 case asm_dest_local
:
1158 ASM_OUTPUT_SHARED_LOCAL (asm_out_file
, name
, size
, rounded
);
1166 #ifdef ASM_OUTPUT_SECTION_NAME
1167 /* We already know that DECL_SECTION_NAME() == NULL. */
1168 if (flag_data_sections
!= 0 || UNIQUE_SECTION_P (decl
))
1169 UNIQUE_SECTION (decl
, 0);
1172 switch (destination
)
1176 ASM_EMIT_BSS (decl
, name
, size
, rounded
);
1179 case asm_dest_common
:
1180 ASM_EMIT_COMMON (decl
, name
, size
, rounded
);
1182 case asm_dest_local
:
1183 ASM_EMIT_LOCAL (decl
, name
, size
, rounded
);
1192 /* Assemble everything that is needed for a variable or function declaration.
1193 Not used for automatic variables, and not used for function definitions.
1194 Should not be called for variables of incomplete structure type.
1196 TOP_LEVEL is nonzero if this variable has file scope.
1197 AT_END is nonzero if this is the special handling, at end of compilation,
1198 to define things that have had only tentative definitions.
1199 DONT_OUTPUT_DATA if nonzero means don't actually output the
1200 initial value (that will be done by the caller). */
1203 assemble_variable (decl
, top_level
, at_end
, dont_output_data
)
1205 int top_level ATTRIBUTE_UNUSED
;
1206 int at_end ATTRIBUTE_UNUSED
;
1207 int dont_output_data
;
1209 register const char *name
;
1214 last_assemble_variable_decl
= 0;
1216 /* Normally no need to say anything here for external references,
1217 since assemble_external is called by the language-specific code
1218 when a declaration is first seen. */
1220 if (DECL_EXTERNAL (decl
))
1223 /* Output no assembler code for a function declaration.
1224 Only definitions of functions output anything. */
1226 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1229 /* Do nothing for global register variables. */
1230 if (DECL_RTL_SET_P (decl
) && GET_CODE (DECL_RTL (decl
)) == REG
)
1232 TREE_ASM_WRITTEN (decl
) = 1;
1236 /* If type was incomplete when the variable was declared,
1237 see if it is complete now. */
1239 if (DECL_SIZE (decl
) == 0)
1240 layout_decl (decl
, 0);
1242 /* Still incomplete => don't allocate it; treat the tentative defn
1243 (which is what it must have been) as an `extern' reference. */
1245 if (!dont_output_data
&& DECL_SIZE (decl
) == 0)
1247 error_with_file_and_line (DECL_SOURCE_FILE (decl
),
1248 DECL_SOURCE_LINE (decl
),
1249 "storage size of `%s' isn't known",
1250 IDENTIFIER_POINTER (DECL_NAME (decl
)));
1251 TREE_ASM_WRITTEN (decl
) = 1;
1255 /* The first declaration of a variable that comes through this function
1256 decides whether it is global (in C, has external linkage)
1257 or local (in C, has internal linkage). So do nothing more
1258 if this function has already run. */
1260 if (TREE_ASM_WRITTEN (decl
))
1263 /* Make sure ENCODE_SECTION_INFO is invoked before we set ASM_WRITTEN. */
1264 decl_rtl
= DECL_RTL (decl
);
1266 TREE_ASM_WRITTEN (decl
) = 1;
1268 /* Do no output if -fsyntax-only. */
1269 if (flag_syntax_only
)
1274 if (! dont_output_data
1275 && ! host_integerp (DECL_SIZE_UNIT (decl
), 1))
1277 error_with_decl (decl
, "size of variable `%s' is too large");
1281 name
= XSTR (XEXP (decl_rtl
, 0), 0);
1282 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
)
1283 && ! first_global_object_name
1284 && ! (DECL_COMMON (decl
) && (DECL_INITIAL (decl
) == 0
1285 || DECL_INITIAL (decl
) == error_mark_node
))
1286 && ! DECL_WEAK (decl
)
1287 && ! DECL_ONE_ONLY (decl
))
1292 STRIP_NAME_ENCODING (p
, name
);
1293 xname
= permalloc (strlen (p
) + 1);
1295 first_global_object_name
= xname
;
1298 /* Compute the alignment of this data. */
1300 align
= DECL_ALIGN (decl
);
1302 /* In the case for initialing an array whose length isn't specified,
1303 where we have not yet been able to do the layout,
1304 figure out the proper alignment now. */
1305 if (dont_output_data
&& DECL_SIZE (decl
) == 0
1306 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
)
1307 align
= MAX (align
, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl
))));
1309 /* Some object file formats have a maximum alignment which they support.
1310 In particular, a.out format supports a maximum alignment of 4. */
1311 #ifndef MAX_OFILE_ALIGNMENT
1312 #define MAX_OFILE_ALIGNMENT BIGGEST_ALIGNMENT
1314 if (align
> MAX_OFILE_ALIGNMENT
)
1316 warning_with_decl (decl
,
1317 "alignment of `%s' is greater than maximum object file alignment. Using %d.",
1318 MAX_OFILE_ALIGNMENT
/BITS_PER_UNIT
);
1319 align
= MAX_OFILE_ALIGNMENT
;
1322 /* On some machines, it is good to increase alignment sometimes. */
1323 #ifdef DATA_ALIGNMENT
1324 align
= DATA_ALIGNMENT (TREE_TYPE (decl
), align
);
1326 #ifdef CONSTANT_ALIGNMENT
1327 if (DECL_INITIAL (decl
) != 0 && DECL_INITIAL (decl
) != error_mark_node
)
1328 align
= CONSTANT_ALIGNMENT (DECL_INITIAL (decl
), align
);
1331 /* Reset the alignment in case we have made it tighter, so we can benefit
1332 from it in get_pointer_alignment. */
1333 DECL_ALIGN (decl
) = align
;
1335 /* Handle uninitialized definitions. */
1337 if ((DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
)
1338 /* If the target can't output uninitialized but not common global data
1339 in .bss, then we have to use .data. */
1340 #if ! defined ASM_EMIT_BSS
1341 && DECL_COMMON (decl
)
1343 && DECL_SECTION_NAME (decl
) == NULL_TREE
1344 && ! dont_output_data
)
1346 unsigned HOST_WIDE_INT size
= tree_low_cst (DECL_SIZE_UNIT (decl
), 1);
1347 unsigned HOST_WIDE_INT rounded
= size
;
1349 /* Don't allocate zero bytes of common,
1350 since that means "undefined external" in the linker. */
1354 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1355 so that each uninitialized object starts on such a boundary. */
1356 rounded
+= (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1;
1357 rounded
= (rounded
/ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1358 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1360 /* Don't continue this line--convex cc version 4.1 would lose. */
1361 #if !defined(ASM_OUTPUT_ALIGNED_COMMON) && !defined(ASM_OUTPUT_ALIGNED_DECL_COMMON) && !defined(ASM_OUTPUT_ALIGNED_BSS)
1362 if ((unsigned HOST_WIDE_INT
) DECL_ALIGN (decl
) / BITS_PER_UNIT
> rounded
)
1364 (decl
, "requested alignment for %s is greater than implemented alignment of %d.",rounded
);
1367 asm_emit_uninitialised (decl
, name
, size
, rounded
);
1372 /* Handle initialized definitions.
1373 Also handle uninitialized global definitions if -fno-common and the
1374 target doesn't support ASM_OUTPUT_BSS. */
1376 /* First make the assembler name(s) global if appropriate. */
1377 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
))
1379 #ifdef ASM_WEAKEN_LABEL
1380 if (DECL_WEAK (decl
))
1382 ASM_WEAKEN_LABEL (asm_out_file
, name
);
1383 /* Remove this variable from the pending weak list so that
1384 we do not emit multiple .weak directives for it. */
1385 remove_from_pending_weak_list
1386 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
1390 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
1393 /* Output any data that we will need to use the address of. */
1394 if (DECL_INITIAL (decl
) == error_mark_node
)
1395 reloc
= contains_pointers_p (TREE_TYPE (decl
));
1396 else if (DECL_INITIAL (decl
))
1397 reloc
= output_addressed_constants (DECL_INITIAL (decl
));
1399 #ifdef ASM_OUTPUT_SECTION_NAME
1400 if ((flag_data_sections
!= 0 && DECL_SECTION_NAME (decl
) == NULL_TREE
)
1401 || UNIQUE_SECTION_P (decl
))
1402 UNIQUE_SECTION (decl
, reloc
);
1405 /* Switch to the appropriate section. */
1406 variable_section (decl
, reloc
);
1408 /* dbxout.c needs to know this. */
1409 if (in_text_section ())
1410 DECL_IN_TEXT_SECTION (decl
) = 1;
1412 /* Output the alignment of this data. */
1413 if (align
> BITS_PER_UNIT
)
1414 ASM_OUTPUT_ALIGN (asm_out_file
,
1415 floor_log2 (DECL_ALIGN (decl
) / BITS_PER_UNIT
));
1417 /* Do any machine/system dependent processing of the object. */
1418 #ifdef ASM_DECLARE_OBJECT_NAME
1419 last_assemble_variable_decl
= decl
;
1420 ASM_DECLARE_OBJECT_NAME (asm_out_file
, name
, decl
);
1422 /* Standard thing is just output label for the object. */
1423 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1424 #endif /* ASM_DECLARE_OBJECT_NAME */
1426 if (!dont_output_data
)
1428 if (DECL_INITIAL (decl
))
1429 /* Output the actual data. */
1430 output_constant (DECL_INITIAL (decl
),
1431 tree_low_cst (DECL_SIZE_UNIT (decl
), 1));
1433 /* Leave space for it. */
1434 assemble_zeros (tree_low_cst (DECL_SIZE_UNIT (decl
), 1));
1438 /* Return 1 if type TYPE contains any pointers. */
1441 contains_pointers_p (type
)
1444 switch (TREE_CODE (type
))
1447 case REFERENCE_TYPE
:
1448 /* I'm not sure whether OFFSET_TYPE needs this treatment,
1449 so I'll play safe and return 1. */
1455 case QUAL_UNION_TYPE
:
1458 /* For a type that has fields, see if the fields have pointers. */
1459 for (fields
= TYPE_FIELDS (type
); fields
; fields
= TREE_CHAIN (fields
))
1460 if (TREE_CODE (fields
) == FIELD_DECL
1461 && contains_pointers_p (TREE_TYPE (fields
)))
1467 /* An array type contains pointers if its element type does. */
1468 return contains_pointers_p (TREE_TYPE (type
));
1475 /* Output something to declare an external symbol to the assembler.
1476 (Most assemblers don't need this, so we normally output nothing.)
1477 Do nothing if DECL is not external. */
1480 assemble_external (decl
)
1481 tree decl ATTRIBUTE_UNUSED
;
1483 /* Because most platforms do not define ASM_OUTPUT_EXTERNAL, the
1484 main body of this code is only rarely exercised. To provide some
1485 testing, on all platforms, we make sure that the ASM_OUT_FILE is
1486 open. If it's not, we should not be calling this function. */
1490 #ifdef ASM_OUTPUT_EXTERNAL
1491 if (DECL_P (decl
) && DECL_EXTERNAL (decl
) && TREE_PUBLIC (decl
))
1493 rtx rtl
= DECL_RTL (decl
);
1495 if (GET_CODE (rtl
) == MEM
&& GET_CODE (XEXP (rtl
, 0)) == SYMBOL_REF
1496 && ! SYMBOL_REF_USED (XEXP (rtl
, 0)))
1498 /* Some systems do require some output. */
1499 SYMBOL_REF_USED (XEXP (rtl
, 0)) = 1;
1500 ASM_OUTPUT_EXTERNAL (asm_out_file
, decl
, XSTR (XEXP (rtl
, 0), 0));
1506 /* Similar, for calling a library function FUN. */
1509 assemble_external_libcall (fun
)
1510 rtx fun ATTRIBUTE_UNUSED
;
1512 #ifdef ASM_OUTPUT_EXTERNAL_LIBCALL
1513 /* Declare library function name external when first used, if nec. */
1514 if (! SYMBOL_REF_USED (fun
))
1516 SYMBOL_REF_USED (fun
) = 1;
1517 ASM_OUTPUT_EXTERNAL_LIBCALL (asm_out_file
, fun
);
1522 /* Declare the label NAME global. */
1525 assemble_global (name
)
1528 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
1531 /* Assemble a label named NAME. */
1534 assemble_label (name
)
1537 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1540 /* Output to FILE a reference to the assembler name of a C-level name NAME.
1541 If NAME starts with a *, the rest of NAME is output verbatim.
1542 Otherwise NAME is transformed in an implementation-defined way
1543 (usually by the addition of an underscore).
1544 Many macros in the tm file are defined to call this function. */
1547 assemble_name (file
, name
)
1551 const char *real_name
;
1554 STRIP_NAME_ENCODING (real_name
, name
);
1555 if (flag_prefix_function_name
1556 && ! memcmp (real_name
, CHKR_PREFIX
, CHKR_PREFIX_SIZE
))
1557 real_name
= real_name
+ CHKR_PREFIX_SIZE
;
1559 id
= maybe_get_identifier (real_name
);
1561 TREE_SYMBOL_REFERENCED (id
) = 1;
1564 fputs (&name
[1], file
);
1566 ASM_OUTPUT_LABELREF (file
, name
);
1569 /* Allocate SIZE bytes writable static space with a gensym name
1570 and return an RTX to refer to its address. */
1573 assemble_static_space (size
)
1577 const char *namestring
;
1581 if (flag_shared_data
)
1585 ASM_GENERATE_INTERNAL_LABEL (name
, "LF", const_labelno
);
1587 namestring
= ggc_strdup (name
);
1589 x
= gen_rtx_SYMBOL_REF (Pmode
, namestring
);
1591 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
1592 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file
, NULL_TREE
, name
, size
,
1595 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1596 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file
, name
, size
, BIGGEST_ALIGNMENT
);
1599 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1600 so that each uninitialized object starts on such a boundary. */
1601 /* Variable `rounded' might or might not be used in ASM_OUTPUT_LOCAL. */
1602 int rounded ATTRIBUTE_UNUSED
1603 = ((size
+ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1)
1604 / (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1605 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1606 ASM_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
1613 /* Assemble the static constant template for function entry trampolines.
1614 This is done at most once per compilation.
1615 Returns an RTX for the address of the template. */
1617 #ifdef TRAMPOLINE_TEMPLATE
1619 assemble_trampoline_template ()
1625 /* By default, put trampoline templates in read-only data section. */
1627 #ifdef TRAMPOLINE_SECTION
1628 TRAMPOLINE_SECTION ();
1630 readonly_data_section ();
1633 /* Write the assembler code to define one. */
1634 align
= floor_log2 (TRAMPOLINE_ALIGNMENT
/ BITS_PER_UNIT
);
1636 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1638 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LTRAMP", 0);
1639 TRAMPOLINE_TEMPLATE (asm_out_file
);
1641 /* Record the rtl to refer to it. */
1642 ASM_GENERATE_INTERNAL_LABEL (label
, "LTRAMP", 0);
1643 name
= ggc_strdup (label
);
1644 return gen_rtx_SYMBOL_REF (Pmode
, name
);
1648 /* Assemble the integer constant X into an object of SIZE bytes.
1649 X must be either a CONST_INT or CONST_DOUBLE.
1651 Return 1 if we were able to output the constant, otherwise 0. If FORCE is
1652 non-zero, abort if we can't output the constant. */
1655 assemble_integer (x
, size
, force
)
1660 /* First try to use the standard 1, 2, 4, 8, and 16 byte
1661 ASM_OUTPUT... macros. */
1665 #ifdef ASM_OUTPUT_CHAR
1667 ASM_OUTPUT_CHAR (asm_out_file
, x
);
1671 #ifdef ASM_OUTPUT_SHORT
1673 ASM_OUTPUT_SHORT (asm_out_file
, x
);
1677 #ifdef ASM_OUTPUT_INT
1679 ASM_OUTPUT_INT (asm_out_file
, x
);
1683 #ifdef ASM_OUTPUT_DOUBLE_INT
1685 ASM_OUTPUT_DOUBLE_INT (asm_out_file
, x
);
1689 #ifdef ASM_OUTPUT_QUADRUPLE_INT
1691 ASM_OUTPUT_QUADRUPLE_INT (asm_out_file
, x
);
1696 /* If we couldn't do it that way, there are two other possibilities: First,
1697 if the machine can output an explicit byte and this is a 1 byte constant,
1698 we can use ASM_OUTPUT_BYTE. */
1700 #ifdef ASM_OUTPUT_BYTE
1701 if (size
== 1 && GET_CODE (x
) == CONST_INT
)
1703 ASM_OUTPUT_BYTE (asm_out_file
, INTVAL (x
));
1708 /* Finally, if SIZE is larger than a single word, try to output the constant
1709 one word at a time. */
1711 if (size
> UNITS_PER_WORD
)
1714 enum machine_mode mode
1715 = mode_for_size (size
* BITS_PER_UNIT
, MODE_INT
, 0);
1718 for (i
= 0; i
< size
/ UNITS_PER_WORD
; i
++)
1720 word
= operand_subword (x
, i
, 0, mode
);
1725 if (! assemble_integer (word
, UNITS_PER_WORD
, 0))
1729 if (i
== size
/ UNITS_PER_WORD
)
1731 /* If we output at least one word and then could not finish,
1732 there is no valid way to continue. */
1743 /* Assemble the floating-point constant D into an object of size MODE. */
1746 assemble_real (d
, mode
)
1748 enum machine_mode mode
;
1750 jmp_buf output_constant_handler
;
1752 if (setjmp (output_constant_handler
))
1754 error ("floating point trap outputting a constant");
1755 #ifdef REAL_IS_NOT_DOUBLE
1756 memset ((char *) &d
, 0, sizeof d
);
1763 set_float_handler (output_constant_handler
);
1767 #ifdef ASM_OUTPUT_BYTE_FLOAT
1769 ASM_OUTPUT_BYTE_FLOAT (asm_out_file
, d
);
1772 #ifdef ASM_OUTPUT_SHORT_FLOAT
1774 ASM_OUTPUT_SHORT_FLOAT (asm_out_file
, d
);
1777 #ifdef ASM_OUTPUT_THREE_QUARTER_FLOAT
1779 ASM_OUTPUT_THREE_QUARTER_FLOAT (asm_out_file
, d
);
1782 #ifdef ASM_OUTPUT_FLOAT
1784 ASM_OUTPUT_FLOAT (asm_out_file
, d
);
1788 #ifdef ASM_OUTPUT_DOUBLE
1790 ASM_OUTPUT_DOUBLE (asm_out_file
, d
);
1794 #ifdef ASM_OUTPUT_LONG_DOUBLE
1797 ASM_OUTPUT_LONG_DOUBLE (asm_out_file
, d
);
1805 set_float_handler (NULL
);
1808 /* Here we combine duplicate floating constants to make
1809 CONST_DOUBLE rtx's, and force those out to memory when necessary. */
1811 /* Return a CONST_DOUBLE or CONST_INT for a value specified as a pair of ints.
1812 For an integer, I0 is the low-order word and I1 is the high-order word.
1813 For a real number, I0 is the word with the low address
1814 and I1 is the word with the high address. */
1817 immed_double_const (i0
, i1
, mode
)
1818 HOST_WIDE_INT i0
, i1
;
1819 enum machine_mode mode
;
1823 if (GET_MODE_CLASS (mode
) == MODE_INT
1824 || GET_MODE_CLASS (mode
) == MODE_PARTIAL_INT
)
1826 /* We clear out all bits that don't belong in MODE, unless they and our
1827 sign bit are all one. So we get either a reasonable negative value
1828 or a reasonable unsigned value for this mode. */
1829 int width
= GET_MODE_BITSIZE (mode
);
1830 if (width
< HOST_BITS_PER_WIDE_INT
1831 && ((i0
& ((HOST_WIDE_INT
) (-1) << (width
- 1)))
1832 != ((HOST_WIDE_INT
) (-1) << (width
- 1))))
1833 i0
&= ((HOST_WIDE_INT
) 1 << width
) - 1, i1
= 0;
1834 else if (width
== HOST_BITS_PER_WIDE_INT
1835 && ! (i1
== ~0 && i0
< 0))
1837 else if (width
> 2 * HOST_BITS_PER_WIDE_INT
)
1838 /* We cannot represent this value as a constant. */
1841 /* If this would be an entire word for the target, but is not for
1842 the host, then sign-extend on the host so that the number will look
1843 the same way on the host that it would on the target.
1845 For example, when building a 64 bit alpha hosted 32 bit sparc
1846 targeted compiler, then we want the 32 bit unsigned value -1 to be
1847 represented as a 64 bit value -1, and not as 0x00000000ffffffff.
1848 The later confuses the sparc backend. */
1850 if (width
< HOST_BITS_PER_WIDE_INT
1851 && (i0
& ((HOST_WIDE_INT
) 1 << (width
- 1))))
1852 i0
|= ((HOST_WIDE_INT
) (-1) << width
);
1854 /* If MODE fits within HOST_BITS_PER_WIDE_INT, always use a CONST_INT.
1856 ??? Strictly speaking, this is wrong if we create a CONST_INT
1857 for a large unsigned constant with the size of MODE being
1858 HOST_BITS_PER_WIDE_INT and later try to interpret that constant in a
1859 wider mode. In that case we will mis-interpret it as a negative
1862 Unfortunately, the only alternative is to make a CONST_DOUBLE
1863 for any constant in any mode if it is an unsigned constant larger
1864 than the maximum signed integer in an int on the host. However,
1865 doing this will break everyone that always expects to see a CONST_INT
1866 for SImode and smaller.
1868 We have always been making CONST_INTs in this case, so nothing new
1871 if (width
<= HOST_BITS_PER_WIDE_INT
)
1872 i1
= (i0
< 0) ? ~(HOST_WIDE_INT
) 0 : 0;
1874 /* If this integer fits in one word, return a CONST_INT. */
1875 if ((i1
== 0 && i0
>= 0)
1876 || (i1
== ~0 && i0
< 0))
1877 return GEN_INT (i0
);
1879 /* We use VOIDmode for integers. */
1883 /* Search the chain for an existing CONST_DOUBLE with the right value.
1884 If one is found, return it. */
1886 for (r
= const_double_chain
; r
; r
= CONST_DOUBLE_CHAIN (r
))
1887 if (CONST_DOUBLE_LOW (r
) == i0
&& CONST_DOUBLE_HIGH (r
) == i1
1888 && GET_MODE (r
) == mode
)
1891 /* No; make a new one and add it to the chain. */
1892 r
= gen_rtx_CONST_DOUBLE (mode
, const0_rtx
, i0
, i1
);
1894 /* Don't touch const_double_chain if not inside any function. */
1895 if (current_function_decl
!= 0)
1897 CONST_DOUBLE_CHAIN (r
) = const_double_chain
;
1898 const_double_chain
= r
;
1904 /* Return a CONST_DOUBLE for a specified `double' value
1905 and machine mode. */
1908 immed_real_const_1 (d
, mode
)
1910 enum machine_mode mode
;
1912 union real_extract u
;
1915 /* Get the desired `double' value as a sequence of ints
1916 since that is how they are stored in a CONST_DOUBLE. */
1920 /* Detect special cases. */
1921 if (REAL_VALUES_IDENTICAL (dconst0
, d
))
1922 return CONST0_RTX (mode
);
1924 /* Check for NaN first, because some ports (specifically the i386) do not
1925 emit correct ieee-fp code by default, and thus will generate a core
1926 dump here if we pass a NaN to REAL_VALUES_EQUAL and if REAL_VALUES_EQUAL
1927 does a floating point comparison. */
1928 else if (! REAL_VALUE_ISNAN (d
) && REAL_VALUES_EQUAL (dconst1
, d
))
1929 return CONST1_RTX (mode
);
1931 if (sizeof u
== sizeof (HOST_WIDE_INT
))
1932 return immed_double_const (u
.i
[0], 0, mode
);
1933 if (sizeof u
== 2 * sizeof (HOST_WIDE_INT
))
1934 return immed_double_const (u
.i
[0], u
.i
[1], mode
);
1936 /* The rest of this function handles the case where
1937 a float value requires more than 2 ints of space.
1938 It will be deleted as dead code on machines that don't need it. */
1940 /* Search the chain for an existing CONST_DOUBLE with the right value.
1941 If one is found, return it. */
1943 for (r
= const_double_chain
; r
; r
= CONST_DOUBLE_CHAIN (r
))
1944 if (! memcmp ((char *) &CONST_DOUBLE_LOW (r
), (char *) &u
, sizeof u
)
1945 && GET_MODE (r
) == mode
)
1948 /* No; make a new one and add it to the chain.
1950 We may be called by an optimizer which may be discarding any memory
1951 allocated during its processing (such as combine and loop). However,
1952 we will be leaving this constant on the chain, so we cannot tolerate
1954 r
= rtx_alloc (CONST_DOUBLE
);
1956 memcpy ((char *) &CONST_DOUBLE_LOW (r
), (char *) &u
, sizeof u
);
1958 /* If we aren't inside a function, don't put r on the
1959 const_double_chain. */
1960 if (current_function_decl
!= 0)
1962 CONST_DOUBLE_CHAIN (r
) = const_double_chain
;
1963 const_double_chain
= r
;
1966 CONST_DOUBLE_CHAIN (r
) = NULL_RTX
;
1968 /* Store const0_rtx in CONST_DOUBLE_MEM since this CONST_DOUBLE is on the
1969 chain, but has not been allocated memory. Actual use of CONST_DOUBLE_MEM
1970 is only through force_const_mem. */
1972 CONST_DOUBLE_MEM (r
) = const0_rtx
;
1977 /* Return a CONST_DOUBLE rtx for a value specified by EXP,
1978 which must be a REAL_CST tree node. */
1981 immed_real_const (exp
)
1984 return immed_real_const_1 (TREE_REAL_CST (exp
), TYPE_MODE (TREE_TYPE (exp
)));
1987 /* At the end of a function, forget the memory-constants
1988 previously made for CONST_DOUBLEs. Mark them as not on real_constant_chain.
1989 Also clear out real_constant_chain and clear out all the chain-pointers. */
1992 clear_const_double_mem ()
1994 register rtx r
, next
;
1995 enum machine_mode mode
;
1998 for (r
= const_double_chain
; r
; r
= next
)
2000 next
= CONST_DOUBLE_CHAIN (r
);
2001 CONST_DOUBLE_CHAIN (r
) = 0;
2002 CONST_DOUBLE_MEM (r
) = cc0_rtx
;
2004 const_double_chain
= 0;
2006 for (i
= 0; i
<= 2; i
++)
2007 for (mode
= GET_CLASS_NARROWEST_MODE (MODE_FLOAT
); mode
!= VOIDmode
;
2008 mode
= GET_MODE_WIDER_MODE (mode
))
2010 r
= const_tiny_rtx
[i
][(int) mode
];
2011 CONST_DOUBLE_CHAIN (r
) = 0;
2012 CONST_DOUBLE_MEM (r
) = cc0_rtx
;
2016 /* Given an expression EXP with a constant value,
2017 reduce it to the sum of an assembler symbol and an integer.
2018 Store them both in the structure *VALUE.
2019 Abort if EXP does not reduce. */
2024 HOST_WIDE_INT offset
;
2028 decode_addr_const (exp
, value
)
2030 struct addr_const
*value
;
2032 register tree target
= TREE_OPERAND (exp
, 0);
2033 register int offset
= 0;
2038 if (TREE_CODE (target
) == COMPONENT_REF
2039 && host_integerp (byte_position (TREE_OPERAND (target
, 1)), 0))
2042 offset
+= int_byte_position (TREE_OPERAND (target
, 1));
2043 target
= TREE_OPERAND (target
, 0);
2045 else if (TREE_CODE (target
) == ARRAY_REF
2046 || TREE_CODE (target
) == ARRAY_RANGE_REF
)
2048 offset
+= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (target
)), 1)
2049 * tree_low_cst (TREE_OPERAND (target
, 1), 0));
2050 target
= TREE_OPERAND (target
, 0);
2056 switch (TREE_CODE (target
))
2060 x
= DECL_RTL (target
);
2064 x
= gen_rtx_MEM (FUNCTION_MODE
,
2065 gen_rtx_LABEL_REF (VOIDmode
,
2066 label_rtx (TREE_OPERAND (exp
, 0))));
2074 x
= TREE_CST_RTL (target
);
2081 if (GET_CODE (x
) != MEM
)
2086 value
->offset
= offset
;
2089 enum kind
{ RTX_DOUBLE
, RTX_INT
};
2092 ENUM_BITFIELD(kind
) kind
: 16;
2093 ENUM_BITFIELD(machine_mode
) mode
: 16;
2095 union real_extract du
;
2096 struct addr_const addr
;
2097 struct {HOST_WIDE_INT high
, low
;} di
;
2101 /* Uniquize all constants that appear in memory.
2102 Each constant in memory thus far output is recorded
2103 in `const_hash_table' with a `struct constant_descriptor'
2104 that contains a polish representation of the value of
2107 We cannot store the trees in the hash table
2108 because the trees may be temporary. */
2110 struct constant_descriptor
2112 struct constant_descriptor
*next
;
2115 /* Make sure the data is reasonably aligned. */
2118 unsigned char contents
[1];
2119 #ifdef HAVE_LONG_DOUBLE
2128 #define MAX_HASH_TABLE 1009
2129 static struct constant_descriptor
*const_hash_table
[MAX_HASH_TABLE
];
2131 #define STRHASH(x) ((hashval_t)((long)(x) >> 3))
2133 struct deferred_string
2140 static htab_t const_str_htab
;
2142 /* Mark a const_hash_table descriptor for GC. */
2145 mark_const_hash_entry (ptr
)
2148 struct constant_descriptor
*desc
= * (struct constant_descriptor
**) ptr
;
2152 ggc_mark_rtx (desc
->rtl
);
2157 /* Mark the hash-table element X (which is really a pointer to an
2158 struct deferred_string *). */
2161 mark_const_str_htab_1 (x
, data
)
2163 void *data ATTRIBUTE_UNUSED
;
2165 ggc_mark_tree (((struct deferred_string
*) *x
)->exp
);
2169 /* Mark a const_str_htab for GC. */
2172 mark_const_str_htab (htab
)
2175 htab_traverse (*((htab_t
*) htab
), mark_const_str_htab_1
, NULL
);
2178 /* Returns a hash code for X (which is a really a
2179 struct deferred_string *). */
2182 const_str_htab_hash (x
)
2185 return STRHASH (((const struct deferred_string
*) x
)->label
);
2188 /* Returns non-zero if the value represented by X (which is really a
2189 struct deferred_string *) is the same as that given by Y
2190 (which is really a char *). */
2193 const_str_htab_eq (x
, y
)
2197 return (((const struct deferred_string
*) x
)->label
== (const char *) y
);
2200 /* Delete the hash table entry dfsp. */
2203 const_str_htab_del (dfsp
)
2209 /* Compute a hash code for a constant expression. */
2215 register const char *p
;
2216 register int len
, hi
, i
;
2217 register enum tree_code code
= TREE_CODE (exp
);
2219 /* Either set P and LEN to the address and len of something to hash and
2220 exit the switch or return a value. */
2225 p
= (char *) &TREE_INT_CST (exp
);
2226 len
= sizeof TREE_INT_CST (exp
);
2230 p
= (char *) &TREE_REAL_CST (exp
);
2231 len
= sizeof TREE_REAL_CST (exp
);
2235 p
= TREE_STRING_POINTER (exp
);
2236 len
= TREE_STRING_LENGTH (exp
);
2240 return (const_hash (TREE_REALPART (exp
)) * 5
2241 + const_hash (TREE_IMAGPART (exp
)));
2244 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2248 len
= int_size_in_bytes (TREE_TYPE (exp
));
2249 tmp
= (char *) alloca (len
);
2250 get_set_constructor_bytes (exp
, (unsigned char *) tmp
, len
);
2258 /* For record type, include the type in the hashing.
2259 We do not do so for array types
2260 because (1) the sizes of the elements are sufficient
2261 and (2) distinct array types can have the same constructor.
2262 Instead, we include the array size because the constructor could
2264 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2265 hi
= ((unsigned long) TREE_TYPE (exp
) & ((1 << HASHBITS
) - 1))
2268 hi
= ((5 + int_size_in_bytes (TREE_TYPE (exp
)))
2269 & ((1 << HASHBITS
) - 1)) % MAX_HASH_TABLE
;
2271 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2272 if (TREE_VALUE (link
))
2274 = (hi
* 603 + const_hash (TREE_VALUE (link
))) % MAX_HASH_TABLE
;
2281 struct addr_const value
;
2283 decode_addr_const (exp
, &value
);
2284 if (GET_CODE (value
.base
) == SYMBOL_REF
)
2286 /* Don't hash the address of the SYMBOL_REF;
2287 only use the offset and the symbol name. */
2289 p
= XSTR (value
.base
, 0);
2290 for (i
= 0; p
[i
] != 0; i
++)
2291 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2293 else if (GET_CODE (value
.base
) == LABEL_REF
)
2294 hi
= value
.offset
+ CODE_LABEL_NUMBER (XEXP (value
.base
, 0)) * 13;
2298 hi
&= (1 << HASHBITS
) - 1;
2299 hi
%= MAX_HASH_TABLE
;
2305 return (const_hash (TREE_OPERAND (exp
, 0)) * 9
2306 + const_hash (TREE_OPERAND (exp
, 1)));
2310 case NON_LVALUE_EXPR
:
2311 return const_hash (TREE_OPERAND (exp
, 0)) * 7 + 2;
2314 /* A language specific constant. Just hash the code. */
2315 return (int) code
% MAX_HASH_TABLE
;
2318 /* Compute hashing function */
2320 for (i
= 0; i
< len
; i
++)
2321 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2323 hi
&= (1 << HASHBITS
) - 1;
2324 hi
%= MAX_HASH_TABLE
;
2328 /* Compare a constant expression EXP with a constant-descriptor DESC.
2329 Return 1 if DESC describes a constant with the same value as EXP. */
2332 compare_constant (exp
, desc
)
2334 struct constant_descriptor
*desc
;
2336 return 0 != compare_constant_1 (exp
, desc
->u
.contents
);
2339 /* Compare constant expression EXP with a substring P of a constant descriptor.
2340 If they match, return a pointer to the end of the substring matched.
2341 If they do not match, return 0.
2343 Since descriptors are written in polish prefix notation,
2344 this function can be used recursively to test one operand of EXP
2345 against a subdescriptor, and if it succeeds it returns the
2346 address of the subdescriptor for the next operand. */
2348 static const unsigned char *
2349 compare_constant_1 (exp
, p
)
2351 const unsigned char *p
;
2353 register const unsigned char *strp
;
2355 register enum tree_code code
= TREE_CODE (exp
);
2357 if (code
!= (enum tree_code
) *p
++)
2360 /* Either set STRP, P and LEN to pointers and length to compare and exit the
2361 switch, or return the result of the comparison. */
2366 /* Integer constants are the same only if the same width of type. */
2367 if (*p
++ != TYPE_PRECISION (TREE_TYPE (exp
)))
2370 strp
= (unsigned char *) &TREE_INT_CST (exp
);
2371 len
= sizeof TREE_INT_CST (exp
);
2375 /* Real constants are the same only if the same width of type. */
2376 if (*p
++ != TYPE_PRECISION (TREE_TYPE (exp
)))
2379 strp
= (unsigned char *) &TREE_REAL_CST (exp
);
2380 len
= sizeof TREE_REAL_CST (exp
);
2384 if (flag_writable_strings
)
2387 if ((enum machine_mode
) *p
++ != TYPE_MODE (TREE_TYPE (exp
)))
2390 strp
= (const unsigned char *)TREE_STRING_POINTER (exp
);
2391 len
= TREE_STRING_LENGTH (exp
);
2392 if (memcmp ((char *) &TREE_STRING_LENGTH (exp
), p
,
2393 sizeof TREE_STRING_LENGTH (exp
)))
2396 p
+= sizeof TREE_STRING_LENGTH (exp
);
2400 p
= compare_constant_1 (TREE_REALPART (exp
), p
);
2404 return compare_constant_1 (TREE_IMAGPART (exp
), p
);
2407 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2409 int xlen
= len
= int_size_in_bytes (TREE_TYPE (exp
));
2410 unsigned char *tmp
= (unsigned char *) alloca (len
);
2412 get_set_constructor_bytes (exp
, tmp
, len
);
2413 strp
= (unsigned char *) tmp
;
2414 if (memcmp ((char *) &xlen
, p
, sizeof xlen
))
2423 int length
= list_length (CONSTRUCTOR_ELTS (exp
));
2425 enum machine_mode mode
= TYPE_MODE (TREE_TYPE (exp
));
2426 int have_purpose
= 0;
2428 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2429 if (TREE_PURPOSE (link
))
2432 if (memcmp ((char *) &length
, p
, sizeof length
))
2437 /* For record constructors, insist that the types match.
2438 For arrays, just verify both constructors are for arrays.
2439 Then insist that either both or none have any TREE_PURPOSE
2441 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2442 type
= TREE_TYPE (exp
);
2446 if (memcmp ((char *) &type
, p
, sizeof type
))
2449 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2451 if (memcmp ((char *) &mode
, p
, sizeof mode
))
2459 if (memcmp ((char *) &have_purpose
, p
, sizeof have_purpose
))
2462 p
+= sizeof have_purpose
;
2464 /* For arrays, insist that the size in bytes match. */
2465 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2467 HOST_WIDE_INT size
= int_size_in_bytes (TREE_TYPE (exp
));
2469 if (memcmp ((char *) &size
, p
, sizeof size
))
2475 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2477 if (TREE_VALUE (link
))
2479 if ((p
= compare_constant_1 (TREE_VALUE (link
), p
)) == 0)
2486 if (memcmp ((char *) &zero
, p
, sizeof zero
))
2492 if (TREE_PURPOSE (link
)
2493 && TREE_CODE (TREE_PURPOSE (link
)) == FIELD_DECL
)
2495 if (memcmp ((char *) &TREE_PURPOSE (link
), p
,
2496 sizeof TREE_PURPOSE (link
)))
2499 p
+= sizeof TREE_PURPOSE (link
);
2501 else if (TREE_PURPOSE (link
))
2503 if ((p
= compare_constant_1 (TREE_PURPOSE (link
), p
)) == 0)
2506 else if (have_purpose
)
2510 if (memcmp ((char *) &zero
, p
, sizeof zero
))
2522 struct addr_const value
;
2524 decode_addr_const (exp
, &value
);
2525 strp
= (unsigned char *) &value
.offset
;
2526 len
= sizeof value
.offset
;
2527 /* Compare the offset. */
2529 if (*p
++ != *strp
++)
2532 /* Compare symbol name. */
2533 strp
= (const unsigned char *) XSTR (value
.base
, 0);
2534 len
= strlen ((const char *) strp
) + 1;
2541 p
= compare_constant_1 (TREE_OPERAND (exp
, 0), p
);
2545 return compare_constant_1 (TREE_OPERAND (exp
, 1), p
);
2549 case NON_LVALUE_EXPR
:
2550 return compare_constant_1 (TREE_OPERAND (exp
, 0), p
);
2553 if (lang_expand_constant
)
2555 exp
= (*lang_expand_constant
) (exp
);
2556 return compare_constant_1 (exp
, p
);
2561 /* Compare constant contents. */
2563 if (*p
++ != *strp
++)
2569 /* Construct a constant descriptor for the expression EXP.
2570 It is up to the caller to enter the descriptor in the hash table. */
2572 static struct constant_descriptor
*
2573 record_constant (exp
)
2576 struct constant_descriptor
*next
= 0;
2581 /* Make a struct constant_descriptor. The first three pointers will
2582 be filled in later. Here we just leave space for them. */
2584 obstack_grow (&permanent_obstack
, (char *) &next
, sizeof next
);
2585 obstack_grow (&permanent_obstack
, (char *) &label
, sizeof label
);
2586 obstack_grow (&permanent_obstack
, (char *) &rtl
, sizeof rtl
);
2588 /* Align the descriptor for the data payload. */
2589 pad
= (offsetof (struct constant_descriptor
, u
)
2590 - offsetof(struct constant_descriptor
, rtl
)
2591 - sizeof(next
->rtl
));
2593 obstack_blank (&permanent_obstack
, pad
);
2595 record_constant_1 (exp
);
2596 return (struct constant_descriptor
*) obstack_finish (&permanent_obstack
);
2599 /* Add a description of constant expression EXP
2600 to the object growing in `permanent_obstack'.
2601 No need to return its address; the caller will get that
2602 from the obstack when the object is complete. */
2605 record_constant_1 (exp
)
2608 register const unsigned char *strp
;
2610 register enum tree_code code
= TREE_CODE (exp
);
2612 obstack_1grow (&permanent_obstack
, (unsigned int) code
);
2617 obstack_1grow (&permanent_obstack
, TYPE_PRECISION (TREE_TYPE (exp
)));
2618 strp
= (unsigned char *) &TREE_INT_CST (exp
);
2619 len
= sizeof TREE_INT_CST (exp
);
2623 obstack_1grow (&permanent_obstack
, TYPE_PRECISION (TREE_TYPE (exp
)));
2624 strp
= (unsigned char *) &TREE_REAL_CST (exp
);
2625 len
= sizeof TREE_REAL_CST (exp
);
2629 if (flag_writable_strings
)
2632 obstack_1grow (&permanent_obstack
, TYPE_MODE (TREE_TYPE (exp
)));
2633 strp
= (const unsigned char *) TREE_STRING_POINTER (exp
);
2634 len
= TREE_STRING_LENGTH (exp
);
2635 obstack_grow (&permanent_obstack
, (char *) &TREE_STRING_LENGTH (exp
),
2636 sizeof TREE_STRING_LENGTH (exp
));
2640 record_constant_1 (TREE_REALPART (exp
));
2641 record_constant_1 (TREE_IMAGPART (exp
));
2645 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2647 int nbytes
= int_size_in_bytes (TREE_TYPE (exp
));
2648 obstack_grow (&permanent_obstack
, &nbytes
, sizeof (nbytes
));
2649 obstack_blank (&permanent_obstack
, nbytes
);
2650 get_set_constructor_bytes
2651 (exp
, (unsigned char *) permanent_obstack
.next_free
-nbytes
,
2658 int length
= list_length (CONSTRUCTOR_ELTS (exp
));
2659 enum machine_mode mode
= TYPE_MODE (TREE_TYPE (exp
));
2661 int have_purpose
= 0;
2663 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2664 if (TREE_PURPOSE (link
))
2667 obstack_grow (&permanent_obstack
, (char *) &length
, sizeof length
);
2669 /* For record constructors, insist that the types match.
2670 For arrays, just verify both constructors are for arrays
2671 of the same mode. Then insist that either both or none
2672 have any TREE_PURPOSE values. */
2673 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2674 type
= TREE_TYPE (exp
);
2678 obstack_grow (&permanent_obstack
, (char *) &type
, sizeof type
);
2679 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2680 obstack_grow (&permanent_obstack
, &mode
, sizeof mode
);
2682 obstack_grow (&permanent_obstack
, (char *) &have_purpose
,
2683 sizeof have_purpose
);
2685 /* For arrays, insist that the size in bytes match. */
2686 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2688 HOST_WIDE_INT size
= int_size_in_bytes (TREE_TYPE (exp
));
2689 obstack_grow (&permanent_obstack
, (char *) &size
, sizeof size
);
2692 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2694 if (TREE_VALUE (link
))
2695 record_constant_1 (TREE_VALUE (link
));
2700 obstack_grow (&permanent_obstack
,
2701 (char *) &zero
, sizeof zero
);
2704 if (TREE_PURPOSE (link
)
2705 && TREE_CODE (TREE_PURPOSE (link
)) == FIELD_DECL
)
2706 obstack_grow (&permanent_obstack
,
2707 (char *) &TREE_PURPOSE (link
),
2708 sizeof TREE_PURPOSE (link
));
2709 else if (TREE_PURPOSE (link
))
2710 record_constant_1 (TREE_PURPOSE (link
));
2711 else if (have_purpose
)
2715 obstack_grow (&permanent_obstack
,
2716 (char *) &zero
, sizeof zero
);
2724 struct addr_const value
;
2726 decode_addr_const (exp
, &value
);
2727 /* Record the offset. */
2728 obstack_grow (&permanent_obstack
,
2729 (char *) &value
.offset
, sizeof value
.offset
);
2731 switch (GET_CODE (value
.base
))
2734 /* Record the symbol name. */
2735 obstack_grow (&permanent_obstack
, XSTR (value
.base
, 0),
2736 strlen (XSTR (value
.base
, 0)) + 1);
2739 /* Record the address of the CODE_LABEL. It may not have
2740 been emitted yet, so it's UID may be zero. But pointer
2741 identity is good enough. */
2742 obstack_grow (&permanent_obstack
, &XEXP (value
.base
, 0),
2754 record_constant_1 (TREE_OPERAND (exp
, 0));
2755 record_constant_1 (TREE_OPERAND (exp
, 1));
2760 case NON_LVALUE_EXPR
:
2761 record_constant_1 (TREE_OPERAND (exp
, 0));
2765 if (lang_expand_constant
)
2767 exp
= (*lang_expand_constant
) (exp
);
2768 record_constant_1 (exp
);
2773 /* Record constant contents. */
2774 obstack_grow (&permanent_obstack
, strp
, len
);
2777 /* Record a list of constant expressions that were passed to
2778 output_constant_def but that could not be output right away. */
2780 struct deferred_constant
2782 struct deferred_constant
*next
;
2788 static struct deferred_constant
*deferred_constants
;
2790 /* Another list of constants which should be output after the
2792 static struct deferred_constant
*after_function_constants
;
2794 /* Nonzero means defer output of addressed subconstants
2795 (i.e., those for which output_constant_def is called.) */
2796 static int defer_addressed_constants_flag
;
2798 /* Start deferring output of subconstants. */
2801 defer_addressed_constants ()
2803 defer_addressed_constants_flag
++;
2806 /* Stop deferring output of subconstants,
2807 and output now all those that have been deferred. */
2810 output_deferred_addressed_constants ()
2812 struct deferred_constant
*p
, *next
;
2814 defer_addressed_constants_flag
--;
2816 if (defer_addressed_constants_flag
> 0)
2819 for (p
= deferred_constants
; p
; p
= next
)
2821 output_constant_def_contents (p
->exp
, p
->reloc
, p
->labelno
);
2826 deferred_constants
= 0;
2829 /* Output any constants which should appear after a function. */
2832 output_after_function_constants ()
2834 struct deferred_constant
*p
, *next
;
2836 for (p
= after_function_constants
; p
; p
= next
)
2838 output_constant_def_contents (p
->exp
, p
->reloc
, p
->labelno
);
2843 after_function_constants
= 0;
2846 /* Make a copy of the whole tree structure for a constant.
2847 This handles the same types of nodes that compare_constant
2848 and record_constant handle. */
2854 switch (TREE_CODE (exp
))
2857 /* For ADDR_EXPR, we do not want to copy the decl whose address
2858 is requested. We do want to copy constants though. */
2859 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, 0))) == 'c')
2860 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2861 copy_constant (TREE_OPERAND (exp
, 0)));
2863 return copy_node (exp
);
2868 return copy_node (exp
);
2871 return build_complex (TREE_TYPE (exp
),
2872 copy_constant (TREE_REALPART (exp
)),
2873 copy_constant (TREE_IMAGPART (exp
)));
2877 return build (TREE_CODE (exp
), TREE_TYPE (exp
),
2878 copy_constant (TREE_OPERAND (exp
, 0)),
2879 copy_constant (TREE_OPERAND (exp
, 1)));
2883 case NON_LVALUE_EXPR
:
2884 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2885 copy_constant (TREE_OPERAND (exp
, 0)));
2889 tree copy
= copy_node (exp
);
2890 tree list
= copy_list (CONSTRUCTOR_ELTS (exp
));
2893 CONSTRUCTOR_ELTS (copy
) = list
;
2894 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
2895 TREE_VALUE (tail
) = copy_constant (TREE_VALUE (tail
));
2896 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2897 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
2898 TREE_PURPOSE (tail
) = copy_constant (TREE_PURPOSE (tail
));
2908 /* Return an rtx representing a reference to constant data in memory
2909 for the constant expression EXP.
2911 If assembler code for such a constant has already been output,
2912 return an rtx to refer to it.
2913 Otherwise, output such a constant in memory (or defer it for later)
2914 and generate an rtx for it.
2916 If DEFER is non-zero, the output of string constants can be deferred
2917 and output only if referenced in the function after all optimizations.
2919 The TREE_CST_RTL of EXP is set up to point to that rtx.
2920 The const_hash_table records which constants already have label strings. */
2923 output_constant_def (exp
, defer
)
2928 register struct constant_descriptor
*desc
;
2929 struct deferred_string
**defstr
;
2933 int after_function
= 0;
2936 if (TREE_CST_RTL (exp
))
2937 return TREE_CST_RTL (exp
);
2939 /* Make sure any other constants whose addresses appear in EXP
2940 are assigned label numbers. */
2942 reloc
= output_addressed_constants (exp
);
2944 /* Compute hash code of EXP. Search the descriptors for that hash code
2945 to see if any of them describes EXP. If yes, the descriptor records
2946 the label number already assigned. */
2948 hash
= const_hash (exp
) % MAX_HASH_TABLE
;
2950 for (desc
= const_hash_table
[hash
]; desc
; desc
= desc
->next
)
2951 if (compare_constant (exp
, desc
))
2956 /* No constant equal to EXP is known to have been output.
2957 Make a constant descriptor to enter EXP in the hash table.
2958 Assign the label number and record it in the descriptor for
2959 future calls to this function to find. */
2961 /* Create a string containing the label name, in LABEL. */
2962 labelno
= const_labelno
++;
2963 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", labelno
);
2965 desc
= record_constant (exp
);
2966 desc
->next
= const_hash_table
[hash
];
2967 desc
->label
= ggc_strdup (label
);
2968 const_hash_table
[hash
] = desc
;
2970 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
2972 = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp
)),
2973 gen_rtx_SYMBOL_REF (Pmode
, desc
->label
));
2975 set_mem_attributes (desc
->rtl
, exp
, 1);
2980 TREE_CST_RTL (exp
) = desc
->rtl
;
2982 /* Optionally set flags or add text to the name to record information
2983 such as that it is a function name. If the name is changed, the macro
2984 ASM_OUTPUT_LABELREF will have to know how to strip this information. */
2985 #ifdef ENCODE_SECTION_INFO
2986 /* A previously-processed constant would already have section info
2990 ENCODE_SECTION_INFO (exp
);
2991 desc
->rtl
= TREE_CST_RTL (exp
);
2992 desc
->label
= XSTR (XEXP (desc
->rtl
, 0), 0);
2996 #ifdef CONSTANT_AFTER_FUNCTION_P
2997 if (current_function_decl
!= 0
2998 && CONSTANT_AFTER_FUNCTION_P (exp
))
3003 && STRING_POOL_ADDRESS_P (XEXP (desc
->rtl
, 0))
3004 && (!defer
|| defer_addressed_constants_flag
|| after_function
))
3006 defstr
= (struct deferred_string
**)
3007 htab_find_slot_with_hash (const_str_htab
, desc
->label
,
3008 STRHASH (desc
->label
), NO_INSERT
);
3011 /* If the string is currently deferred but we need to output it now,
3012 remove it from deferred string hash table. */
3014 labelno
= (*defstr
)->labelno
;
3015 STRING_POOL_ADDRESS_P (XEXP (desc
->rtl
, 0)) = 0;
3016 htab_clear_slot (const_str_htab
, (void **) defstr
);
3020 /* If this is the first time we've seen this particular constant,
3021 output it (or defer its output for later). */
3024 if (defer_addressed_constants_flag
|| after_function
)
3026 struct deferred_constant
*p
;
3027 p
= (struct deferred_constant
*) xmalloc (sizeof (struct deferred_constant
));
3029 p
->exp
= copy_constant (exp
);
3031 p
->labelno
= labelno
;
3034 p
->next
= after_function_constants
;
3035 after_function_constants
= p
;
3039 p
->next
= deferred_constants
;
3040 deferred_constants
= p
;
3045 /* Do no output if -fsyntax-only. */
3046 if (! flag_syntax_only
)
3048 if (TREE_CODE (exp
) != STRING_CST
3050 || flag_writable_strings
3051 || (defstr
= (struct deferred_string
**)
3052 htab_find_slot_with_hash (const_str_htab
,
3054 STRHASH (desc
->label
),
3056 output_constant_def_contents (exp
, reloc
, labelno
);
3059 struct deferred_string
*p
;
3061 p
= (struct deferred_string
*)
3062 xmalloc (sizeof (struct deferred_string
));
3064 p
->exp
= copy_constant (exp
);
3065 p
->label
= desc
->label
;
3066 p
->labelno
= labelno
;
3068 STRING_POOL_ADDRESS_P (XEXP (desc
->rtl
, 0)) = 1;
3074 return TREE_CST_RTL (exp
);
3077 /* Now output assembler code to define the label for EXP,
3078 and follow it with the data of EXP. */
3081 output_constant_def_contents (exp
, reloc
, labelno
)
3088 if (IN_NAMED_SECTION (exp
))
3089 named_section (exp
, NULL
, reloc
);
3092 /* First switch to text section, except for writable strings. */
3093 #ifdef SELECT_SECTION
3094 SELECT_SECTION (exp
, reloc
);
3096 if (((TREE_CODE (exp
) == STRING_CST
) && flag_writable_strings
)
3097 || (flag_pic
&& reloc
))
3100 readonly_data_section ();
3104 /* Align the location counter as required by EXP's data type. */
3105 align
= TYPE_ALIGN (TREE_TYPE (exp
));
3106 #ifdef CONSTANT_ALIGNMENT
3107 align
= CONSTANT_ALIGNMENT (exp
, align
);
3110 if (align
> BITS_PER_UNIT
)
3111 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
3113 /* Output the label itself. */
3114 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LC", labelno
);
3116 /* Output the value of EXP. */
3117 output_constant (exp
,
3118 (TREE_CODE (exp
) == STRING_CST
3119 ? MAX (TREE_STRING_LENGTH (exp
),
3120 int_size_in_bytes (TREE_TYPE (exp
)))
3121 : int_size_in_bytes (TREE_TYPE (exp
))));
3125 /* Structure to represent sufficient information about a constant so that
3126 it can be output when the constant pool is output, so that function
3127 integration can be done, and to simplify handling on machines that reference
3128 constant pool as base+displacement. */
3130 struct pool_constant
3132 struct constant_descriptor
*desc
;
3133 struct pool_constant
*next
, *next_sym
;
3136 enum machine_mode mode
;
3143 /* Hash code for a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true.
3144 The argument is XSTR (... , 0) */
3146 #define SYMHASH(LABEL) \
3147 ((((unsigned long) (LABEL)) & ((1 << HASHBITS) - 1)) % MAX_RTX_HASH_TABLE)
3149 /* Initialize constant pool hashing for a new function. */
3152 init_varasm_status (f
)
3155 struct varasm_status
*p
;
3156 p
= (struct varasm_status
*) xmalloc (sizeof (struct varasm_status
));
3158 p
->x_const_rtx_hash_table
3159 = ((struct constant_descriptor
**)
3160 xcalloc (MAX_RTX_HASH_TABLE
, sizeof (struct constant_descriptor
*)));
3161 p
->x_const_rtx_sym_hash_table
3162 = ((struct pool_constant
**)
3163 xcalloc (MAX_RTX_HASH_TABLE
, sizeof (struct pool_constant
*)));
3165 p
->x_first_pool
= p
->x_last_pool
= 0;
3166 p
->x_pool_offset
= 0;
3167 p
->x_const_double_chain
= 0;
3170 /* Mark PC for GC. */
3173 mark_pool_constant (pc
)
3174 struct pool_constant
*pc
;
3179 ggc_mark_rtx (pc
->constant
);
3184 /* Mark P for GC. */
3187 mark_varasm_status (p
)
3188 struct varasm_status
*p
;
3193 mark_pool_constant (p
->x_first_pool
);
3194 ggc_mark_rtx (p
->x_const_double_chain
);
3197 /* Clear out all parts of the state in F that can safely be discarded
3198 after the function has been compiled, to let garbage collection
3199 reclaim the memory. */
3202 free_varasm_status (f
)
3205 struct varasm_status
*p
;
3210 /* Clear out the hash tables. */
3211 for (i
= 0; i
< MAX_RTX_HASH_TABLE
; ++i
)
3213 struct constant_descriptor
* cd
;
3215 cd
= p
->x_const_rtx_hash_table
[i
];
3217 struct constant_descriptor
* next
= cd
->next
;
3223 free (p
->x_const_rtx_hash_table
);
3224 free (p
->x_const_rtx_sym_hash_table
);
3230 /* Express an rtx for a constant integer (perhaps symbolic)
3231 as the sum of a symbol or label plus an explicit integer.
3232 They are stored into VALUE. */
3235 decode_rtx_const (mode
, x
, value
)
3236 enum machine_mode mode
;
3238 struct rtx_const
*value
;
3240 /* Clear the whole structure, including any gaps. */
3241 memset (value
, 0, sizeof (struct rtx_const
));
3243 value
->kind
= RTX_INT
; /* Most usual kind. */
3246 switch (GET_CODE (x
))
3249 value
->kind
= RTX_DOUBLE
;
3250 if (GET_MODE (x
) != VOIDmode
)
3252 value
->mode
= GET_MODE (x
);
3253 memcpy ((char *) &value
->un
.du
,
3254 (char *) &CONST_DOUBLE_LOW (x
), sizeof value
->un
.du
);
3258 value
->un
.di
.low
= CONST_DOUBLE_LOW (x
);
3259 value
->un
.di
.high
= CONST_DOUBLE_HIGH (x
);
3264 value
->un
.addr
.offset
= INTVAL (x
);
3270 value
->un
.addr
.base
= x
;
3275 if (GET_CODE (x
) == PLUS
&& GET_CODE (XEXP (x
, 1)) == CONST_INT
)
3277 value
->un
.addr
.base
= XEXP (x
, 0);
3278 value
->un
.addr
.offset
= INTVAL (XEXP (x
, 1));
3280 else if (GET_CODE (x
) == MINUS
&& GET_CODE (XEXP (x
, 1)) == CONST_INT
)
3282 value
->un
.addr
.base
= XEXP (x
, 0);
3283 value
->un
.addr
.offset
= - INTVAL (XEXP (x
, 1));
3287 value
->un
.addr
.base
= x
;
3288 value
->un
.addr
.offset
= 0;
3296 if (value
->kind
== RTX_INT
&& value
->un
.addr
.base
!= 0)
3297 switch (GET_CODE (value
->un
.addr
.base
))
3300 /* Use the string's address, not the SYMBOL_REF's address,
3301 for the sake of addresses of library routines. */
3302 value
->un
.addr
.base
= (rtx
) XSTR (value
->un
.addr
.base
, 0);
3306 /* For a LABEL_REF, compare labels. */
3307 value
->un
.addr
.base
= XEXP (value
->un
.addr
.base
, 0);
3314 /* Given a MINUS expression, simplify it if both sides
3315 include the same symbol. */
3318 simplify_subtraction (x
)
3321 struct rtx_const val0
, val1
;
3323 decode_rtx_const (GET_MODE (x
), XEXP (x
, 0), &val0
);
3324 decode_rtx_const (GET_MODE (x
), XEXP (x
, 1), &val1
);
3326 if (val0
.un
.addr
.base
== val1
.un
.addr
.base
)
3327 return GEN_INT (val0
.un
.addr
.offset
- val1
.un
.addr
.offset
);
3331 /* Compute a hash code for a constant RTL expression. */
3334 const_hash_rtx (mode
, x
)
3335 enum machine_mode mode
;
3341 struct rtx_const value
;
3342 decode_rtx_const (mode
, x
, &value
);
3344 /* Compute hashing function */
3346 for (i
= 0; i
< sizeof value
/ sizeof (int); i
++)
3347 hi
+= ((int *) &value
)[i
];
3349 hi
&= (1 << HASHBITS
) - 1;
3350 hi
%= MAX_RTX_HASH_TABLE
;
3354 /* Compare a constant rtl object X with a constant-descriptor DESC.
3355 Return 1 if DESC describes a constant with the same value as X. */
3358 compare_constant_rtx (mode
, x
, desc
)
3359 enum machine_mode mode
;
3361 struct constant_descriptor
*desc
;
3363 register int *p
= (int *) desc
->u
.contents
;
3366 struct rtx_const value
;
3368 decode_rtx_const (mode
, x
, &value
);
3369 strp
= (int *) &value
;
3370 len
= sizeof value
/ sizeof (int);
3372 /* Compare constant contents. */
3374 if (*p
++ != *strp
++)
3380 /* Construct a constant descriptor for the rtl-expression X.
3381 It is up to the caller to enter the descriptor in the hash table. */
3383 static struct constant_descriptor
*
3384 record_constant_rtx (mode
, x
)
3385 enum machine_mode mode
;
3388 struct constant_descriptor
*ptr
;
3390 ptr
= ((struct constant_descriptor
*)
3391 xcalloc (1, (offsetof (struct constant_descriptor
, u
)
3392 + sizeof (struct rtx_const
))));
3393 decode_rtx_const (mode
, x
, (struct rtx_const
*) ptr
->u
.contents
);
3398 /* Given a constant rtx X, make (or find) a memory constant for its value
3399 and return a MEM rtx to refer to it in memory. */
3402 force_const_mem (mode
, x
)
3403 enum machine_mode mode
;
3407 register struct constant_descriptor
*desc
;
3409 const char *found
= 0;
3412 /* If we want this CONST_DOUBLE in the same mode as it is in memory
3413 (this will always be true for floating CONST_DOUBLEs that have been
3414 placed in memory, but not for VOIDmode (integer) CONST_DOUBLEs),
3415 use the previous copy. Otherwise, make a new one. Note that in
3416 the unlikely event that this same CONST_DOUBLE is used in two different
3417 modes in an alternating fashion, we will allocate a lot of different
3418 memory locations, but this should be extremely rare. */
3420 if (GET_CODE (x
) == CONST_DOUBLE
3421 && GET_CODE (CONST_DOUBLE_MEM (x
)) == MEM
3422 && GET_MODE (CONST_DOUBLE_MEM (x
)) == mode
)
3423 return CONST_DOUBLE_MEM (x
);
3425 /* Compute hash code of X. Search the descriptors for that hash code
3426 to see if any of them describes X. If yes, the descriptor records
3427 the label number already assigned. */
3429 hash
= const_hash_rtx (mode
, x
);
3431 for (desc
= const_rtx_hash_table
[hash
]; desc
; desc
= desc
->next
)
3432 if (compare_constant_rtx (mode
, x
, desc
))
3434 found
= desc
->label
;
3440 register struct pool_constant
*pool
;
3443 /* No constant equal to X is known to have been output.
3444 Make a constant descriptor to enter X in the hash table.
3445 Assign the label number and record it in the descriptor for
3446 future calls to this function to find. */
3448 desc
= record_constant_rtx (mode
, x
);
3449 desc
->next
= const_rtx_hash_table
[hash
];
3450 const_rtx_hash_table
[hash
] = desc
;
3452 /* Align the location counter as required by EXP's data type. */
3453 align
= (mode
== VOIDmode
) ? UNITS_PER_WORD
: GET_MODE_SIZE (mode
);
3454 if (align
> BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
3455 align
= BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
;
3456 #ifdef CONSTANT_ALIGNMENT
3457 align
= CONSTANT_ALIGNMENT (make_tree (type_for_mode (mode
, 0), x
),
3458 align
* BITS_PER_UNIT
) / BITS_PER_UNIT
;
3461 pool_offset
+= align
- 1;
3462 pool_offset
&= ~ (align
- 1);
3464 if (GET_CODE (x
) == LABEL_REF
)
3465 LABEL_PRESERVE_P (XEXP (x
, 0)) = 1;
3467 /* Allocate a pool constant descriptor, fill it in, and chain it in. */
3469 pool
= (struct pool_constant
*) ggc_alloc (sizeof (struct pool_constant
));
3473 pool
->labelno
= const_labelno
;
3474 pool
->align
= align
;
3475 pool
->offset
= pool_offset
;
3482 last_pool
->next
= pool
;
3485 pool_offset
+= GET_MODE_SIZE (mode
);
3487 /* Create a string containing the label name, in LABEL. */
3488 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
3492 desc
->label
= found
= ggc_strdup (label
);
3494 /* Add label to symbol hash table. */
3495 hash
= SYMHASH (found
);
3496 pool
->label
= found
;
3497 pool
->next_sym
= const_rtx_sym_hash_table
[hash
];
3498 const_rtx_sym_hash_table
[hash
] = pool
;
3501 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
3503 def
= gen_rtx_MEM (mode
, gen_rtx_SYMBOL_REF (Pmode
, found
));
3504 set_mem_attributes (def
, type_for_mode (mode
, 0), 1);
3505 RTX_UNCHANGING_P (def
) = 1;
3507 /* Mark the symbol_ref as belonging to this constants pool. */
3508 CONSTANT_POOL_ADDRESS_P (XEXP (def
, 0)) = 1;
3509 current_function_uses_const_pool
= 1;
3511 if (GET_CODE (x
) == CONST_DOUBLE
)
3513 if (CONST_DOUBLE_MEM (x
) == cc0_rtx
)
3515 CONST_DOUBLE_CHAIN (x
) = const_double_chain
;
3516 const_double_chain
= x
;
3518 CONST_DOUBLE_MEM (x
) = def
;
3524 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
3525 the corresponding pool_constant structure. */
3527 static struct pool_constant
*
3528 find_pool_constant (f
, addr
)
3532 struct pool_constant
*pool
;
3533 const char *label
= XSTR (addr
, 0);
3535 for (pool
= f
->varasm
->x_const_rtx_sym_hash_table
[SYMHASH (label
)]; pool
;
3536 pool
= pool
->next_sym
)
3537 if (pool
->label
== label
)
3543 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
3546 get_pool_constant (addr
)
3549 return (find_pool_constant (cfun
, addr
))->constant
;
3552 /* Likewise, but for the constant pool of a specific function. */
3555 get_pool_constant_for_function (f
, addr
)
3559 return (find_pool_constant (f
, addr
))->constant
;
3562 /* Similar, return the mode. */
3565 get_pool_mode (addr
)
3568 return (find_pool_constant (cfun
, addr
))->mode
;
3572 get_pool_mode_for_function (f
, addr
)
3576 return (find_pool_constant (f
, addr
))->mode
;
3579 /* Similar, return the offset in the constant pool. */
3582 get_pool_offset (addr
)
3585 return (find_pool_constant (cfun
, addr
))->offset
;
3588 /* Return the size of the constant pool. */
3596 /* Write all the constants in the constant pool. */
3599 output_constant_pool (fnname
, fndecl
)
3600 const char *fnname ATTRIBUTE_UNUSED
;
3601 tree fndecl ATTRIBUTE_UNUSED
;
3603 struct pool_constant
*pool
;
3605 union real_extract u
;
3607 /* It is possible for gcc to call force_const_mem and then to later
3608 discard the instructions which refer to the constant. In such a
3609 case we do not need to output the constant. */
3610 mark_constant_pool ();
3612 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3613 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3616 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3625 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3626 whose CODE_LABEL has been deleted. This can occur if a jump table
3627 is eliminated by optimization. If so, write a constant of zero
3628 instead. Note that this can also happen by turning the
3629 CODE_LABEL into a NOTE. */
3630 /* ??? This seems completely and utterly wrong. Certainly it's
3631 not true for NOTE_INSN_DELETED_LABEL, but I disbelieve proper
3632 functioning even with INSN_DELETED_P and friends. */
3635 switch (GET_CODE (x
))
3638 if (GET_CODE (XEXP (x
, 0)) != PLUS
3639 || GET_CODE (XEXP (XEXP (x
, 0), 0)) != LABEL_REF
)
3641 tmp
= XEXP (XEXP (x
, 0), 0);
3646 if (INSN_DELETED_P (tmp
)
3647 || (GET_CODE (tmp
) == NOTE
3648 && NOTE_LINE_NUMBER (tmp
) == NOTE_INSN_DELETED
))
3659 /* First switch to correct section. */
3660 #ifdef SELECT_RTX_SECTION
3661 SELECT_RTX_SECTION (pool
->mode
, x
);
3663 readonly_data_section ();
3666 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3667 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file
, x
, pool
->mode
,
3668 pool
->align
, pool
->labelno
, done
);
3671 if (pool
->align
> 1)
3672 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (pool
->align
));
3674 /* Output the label. */
3675 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LC", pool
->labelno
);
3677 /* Output the value of the constant itself. */
3678 switch (GET_MODE_CLASS (pool
->mode
))
3681 if (GET_CODE (x
) != CONST_DOUBLE
)
3684 memcpy ((char *) &u
, (char *) &CONST_DOUBLE_LOW (x
), sizeof u
);
3685 assemble_real (u
.d
, pool
->mode
);
3689 case MODE_PARTIAL_INT
:
3690 assemble_integer (x
, GET_MODE_SIZE (pool
->mode
), 1);
3697 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3703 #ifdef ASM_OUTPUT_POOL_EPILOGUE
3704 ASM_OUTPUT_POOL_EPILOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3707 /* Done with this pool. */
3708 first_pool
= last_pool
= 0;
3711 /* Look through the instructions for this function, and mark all the
3712 entries in the constant pool which are actually being used.
3713 Emit used deferred strings. */
3716 mark_constant_pool ()
3719 struct pool_constant
*pool
;
3721 if (first_pool
== 0 && htab_elements (const_str_htab
) == 0)
3724 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3727 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
3729 mark_constants (PATTERN (insn
));
3731 for (insn
= current_function_epilogue_delay_list
;
3733 insn
= XEXP (insn
, 1))
3735 mark_constants (PATTERN (insn
));
3738 /* Look through appropriate parts of X, marking all entries in the
3739 constant pool which are actually being used. Entries that are only
3740 referenced by other constants are also marked as used. Emit
3741 deferred strings that are used. */
3748 register const char *format_ptr
;
3753 if (GET_CODE (x
) == SYMBOL_REF
)
3755 mark_constant (&x
, NULL
);
3758 /* Never search inside a CONST_DOUBLE, because CONST_DOUBLE_MEM may be
3759 a MEM, but does not constitute a use of that MEM. */
3760 else if (GET_CODE (x
) == CONST_DOUBLE
)
3763 /* Insns may appear inside a SEQUENCE. Only check the patterns of
3764 insns, not any notes that may be attached. We don't want to mark
3765 a constant just because it happens to appear in a REG_EQUIV note. */
3768 mark_constants (PATTERN (x
));
3772 format_ptr
= GET_RTX_FORMAT (GET_CODE (x
));
3774 for (i
= 0; i
< GET_RTX_LENGTH (GET_CODE (x
)); i
++)
3776 switch (*format_ptr
++)
3779 mark_constants (XEXP (x
, i
));
3783 if (XVEC (x
, i
) != 0)
3787 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
3788 mark_constants (XVECEXP (x
, i
, j
));
3807 /* Given a SYMBOL_REF CURRENT_RTX, mark it and all constants it refers
3808 to as used. Emit referenced deferred strings. This function can
3809 be used with for_each_rtx () to mark all SYMBOL_REFs in an rtx. */
3812 mark_constant (current_rtx
, data
)
3814 void *data ATTRIBUTE_UNUSED
;
3816 rtx x
= *current_rtx
;
3820 else if (GET_CODE(x
) == CONST_DOUBLE
)
3821 /* Never search inside a CONST_DOUBLE because CONST_DOUBLE_MEM may
3822 be a MEM but does not constitute a use of that MEM. */
3824 else if (GET_CODE (x
) == SYMBOL_REF
)
3826 if (CONSTANT_POOL_ADDRESS_P (x
))
3828 struct pool_constant
*pool
= find_pool_constant (cfun
, x
);
3829 if (pool
->mark
== 0) {
3831 for_each_rtx (&(pool
->constant
), &mark_constant
, NULL
);
3836 else if (STRING_POOL_ADDRESS_P (x
))
3838 struct deferred_string
**defstr
;
3840 defstr
= (struct deferred_string
**)
3841 htab_find_slot_with_hash (const_str_htab
, XSTR (x
, 0),
3842 STRHASH (XSTR (x
, 0)), NO_INSERT
);
3845 struct deferred_string
*p
= *defstr
;
3847 STRING_POOL_ADDRESS_P (x
) = 0;
3848 output_constant_def_contents (p
->exp
, 0, p
->labelno
);
3849 htab_clear_slot (const_str_htab
, (void **) defstr
);
3856 /* Find all the constants whose addresses are referenced inside of EXP,
3857 and make sure assembler code with a label has been output for each one.
3858 Indicate whether an ADDR_EXPR has been encountered. */
3861 output_addressed_constants (exp
)
3866 /* Give the front-end a chance to convert VALUE to something that
3867 looks more like a constant to the back-end. */
3868 if (lang_expand_constant
)
3869 exp
= (*lang_expand_constant
) (exp
);
3871 switch (TREE_CODE (exp
))
3875 register tree constant
= TREE_OPERAND (exp
, 0);
3877 while (TREE_CODE (constant
) == COMPONENT_REF
)
3879 constant
= TREE_OPERAND (constant
, 0);
3882 if (TREE_CODE_CLASS (TREE_CODE (constant
)) == 'c'
3883 || TREE_CODE (constant
) == CONSTRUCTOR
)
3884 /* No need to do anything here
3885 for addresses of variables or functions. */
3886 output_constant_def (constant
, 0);
3893 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
3894 reloc
|= output_addressed_constants (TREE_OPERAND (exp
, 1));
3899 case NON_LVALUE_EXPR
:
3900 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
3906 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
3907 if (TREE_VALUE (link
) != 0)
3908 reloc
|= output_addressed_constants (TREE_VALUE (link
));
3918 /* Return nonzero if VALUE is a valid constant-valued expression
3919 for use in initializing a static variable; one that can be an
3920 element of a "constant" initializer.
3922 Return null_pointer_node if the value is absolute;
3923 if it is relocatable, return the variable that determines the relocation.
3924 We assume that VALUE has been folded as much as possible;
3925 therefore, we do not need to check for such things as
3926 arithmetic-combinations of integers. */
3929 initializer_constant_valid_p (value
, endtype
)
3933 /* Give the front-end a chance to convert VALUE to something that
3934 looks more like a constant to the back-end. */
3935 if (lang_expand_constant
)
3936 value
= (*lang_expand_constant
) (value
);
3938 switch (TREE_CODE (value
))
3941 if ((TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
3942 || TREE_CODE (TREE_TYPE (value
)) == RECORD_TYPE
)
3943 && TREE_CONSTANT (value
)
3944 && CONSTRUCTOR_ELTS (value
))
3946 initializer_constant_valid_p (TREE_VALUE (CONSTRUCTOR_ELTS (value
)),
3949 return TREE_STATIC (value
) ? null_pointer_node
: 0;
3955 return null_pointer_node
;
3958 return staticp (TREE_OPERAND (value
, 0)) ? TREE_OPERAND (value
, 0) : 0;
3960 case NON_LVALUE_EXPR
:
3961 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3965 /* Allow conversions between pointer types. */
3966 if (POINTER_TYPE_P (TREE_TYPE (value
))
3967 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3968 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3970 /* Allow conversions between real types. */
3971 if (FLOAT_TYPE_P (TREE_TYPE (value
))
3972 && FLOAT_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3973 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3975 /* Allow length-preserving conversions between integer types. */
3976 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
3977 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
3978 && (TYPE_PRECISION (TREE_TYPE (value
))
3979 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
3980 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3982 /* Allow conversions between other integer types only if
3984 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
3985 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3987 tree inner
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3989 if (inner
== null_pointer_node
)
3990 return null_pointer_node
;
3994 /* Allow (int) &foo provided int is as wide as a pointer. */
3995 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
3996 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
3997 && (TYPE_PRECISION (TREE_TYPE (value
))
3998 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
3999 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4002 /* Likewise conversions from int to pointers, but also allow
4003 conversions from 0. */
4004 if (POINTER_TYPE_P (TREE_TYPE (value
))
4005 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
4007 if (integer_zerop (TREE_OPERAND (value
, 0)))
4008 return null_pointer_node
;
4009 else if (TYPE_PRECISION (TREE_TYPE (value
))
4010 <= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0))))
4011 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4015 /* Allow conversions to union types if the value inside is okay. */
4016 if (TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
)
4017 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4022 if (! INTEGRAL_TYPE_P (endtype
)
4023 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
4025 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4027 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
4029 /* If either term is absolute, use the other terms relocation. */
4030 if (valid0
== null_pointer_node
)
4032 if (valid1
== null_pointer_node
)
4038 if (! INTEGRAL_TYPE_P (endtype
)
4039 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
4041 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4043 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
4045 /* Win if second argument is absolute. */
4046 if (valid1
== null_pointer_node
)
4048 /* Win if both arguments have the same relocation.
4049 Then the value is absolute. */
4050 if (valid0
== valid1
&& valid0
!= 0)
4051 return null_pointer_node
;
4053 /* Since GCC guarantees that string constants are unique in the
4054 generated code, a subtraction between two copies of the same
4055 constant string is absolute. */
4056 if (valid0
&& TREE_CODE (valid0
) == STRING_CST
&&
4057 valid1
&& TREE_CODE (valid1
) == STRING_CST
&&
4058 TREE_STRING_POINTER (valid0
) == TREE_STRING_POINTER (valid1
))
4059 return null_pointer_node
;
4062 /* Support differences between labels. */
4063 if (INTEGRAL_TYPE_P (endtype
))
4066 op0
= TREE_OPERAND (value
, 0);
4067 op1
= TREE_OPERAND (value
, 1);
4071 if (TREE_CODE (op0
) == ADDR_EXPR
4072 && TREE_CODE (TREE_OPERAND (op0
, 0)) == LABEL_DECL
4073 && TREE_CODE (op1
) == ADDR_EXPR
4074 && TREE_CODE (TREE_OPERAND (op1
, 0)) == LABEL_DECL
)
4075 return null_pointer_node
;
4086 /* Output assembler code for constant EXP to FILE, with no label.
4087 This includes the pseudo-op such as ".int" or ".byte", and a newline.
4088 Assumes output_addressed_constants has been done on EXP already.
4090 Generate exactly SIZE bytes of assembler data, padding at the end
4091 with zeros if necessary. SIZE must always be specified.
4093 SIZE is important for structure constructors,
4094 since trailing members may have been omitted from the constructor.
4095 It is also important for initialization of arrays from string constants
4096 since the full length of the string constant might not be wanted.
4097 It is also needed for initialization of unions, where the initializer's
4098 type is just one member, and that may not be as long as the union.
4100 There a case in which we would fail to output exactly SIZE bytes:
4101 for a structure constructor that wants to produce more than SIZE bytes.
4102 But such constructors will never be generated for any possible input. */
4105 output_constant (exp
, size
)
4109 register enum tree_code code
= TREE_CODE (TREE_TYPE (exp
));
4111 /* Some front-ends use constants other than the standard
4112 language-indepdent varieties, but which may still be output
4113 directly. Give the front-end a chance to convert EXP to a
4114 language-independent representation. */
4115 if (lang_expand_constant
)
4117 exp
= (*lang_expand_constant
) (exp
);
4118 code
= TREE_CODE (TREE_TYPE (exp
));
4121 if (size
== 0 || flag_syntax_only
)
4124 /* Eliminate the NON_LVALUE_EXPR_EXPR that makes a cast not be an lvalue.
4125 That way we get the constant (we hope) inside it. Also, strip off any
4126 NOP_EXPR that converts between two record, union, array, or set types
4127 or a CONVERT_EXPR that converts to a union TYPE. */
4128 while ((TREE_CODE (exp
) == NOP_EXPR
4129 && (TREE_TYPE (exp
) == TREE_TYPE (TREE_OPERAND (exp
, 0))
4130 || AGGREGATE_TYPE_P (TREE_TYPE (exp
))))
4131 || (TREE_CODE (exp
) == CONVERT_EXPR
4132 && code
== UNION_TYPE
)
4133 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
4135 exp
= TREE_OPERAND (exp
, 0);
4136 code
= TREE_CODE (TREE_TYPE (exp
));
4139 /* Allow a constructor with no elements for any data type.
4140 This means to fill the space with zeros. */
4141 if (TREE_CODE (exp
) == CONSTRUCTOR
&& CONSTRUCTOR_ELTS (exp
) == 0)
4143 assemble_zeros (size
);
4154 case REFERENCE_TYPE
:
4155 /* ??? What about (int)((float)(int)&foo + 4) */
4156 while (TREE_CODE (exp
) == NOP_EXPR
|| TREE_CODE (exp
) == CONVERT_EXPR
4157 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
4158 exp
= TREE_OPERAND (exp
, 0);
4160 if (! assemble_integer (expand_expr (exp
, NULL_RTX
, VOIDmode
,
4161 EXPAND_INITIALIZER
),
4163 error ("initializer for integer value is too complicated");
4168 if (TREE_CODE (exp
) != REAL_CST
)
4169 error ("initializer for floating value is not a floating constant");
4171 assemble_real (TREE_REAL_CST (exp
),
4172 mode_for_size (size
* BITS_PER_UNIT
, MODE_FLOAT
, 0));
4177 output_constant (TREE_REALPART (exp
), size
/ 2);
4178 output_constant (TREE_IMAGPART (exp
), size
/ 2);
4179 size
-= (size
/ 2) * 2;
4183 if (TREE_CODE (exp
) == CONSTRUCTOR
)
4185 output_constructor (exp
, size
);
4188 else if (TREE_CODE (exp
) == STRING_CST
)
4192 if (size
> TREE_STRING_LENGTH (exp
))
4194 excess
= size
- TREE_STRING_LENGTH (exp
);
4195 size
= TREE_STRING_LENGTH (exp
);
4198 assemble_string (TREE_STRING_POINTER (exp
), size
);
4207 if (TREE_CODE (exp
) == CONSTRUCTOR
)
4208 output_constructor (exp
, size
);
4214 if (TREE_CODE (exp
) == INTEGER_CST
)
4215 assemble_integer (expand_expr (exp
, NULL_RTX
,
4216 VOIDmode
, EXPAND_INITIALIZER
),
4218 else if (TREE_CODE (exp
) == CONSTRUCTOR
)
4220 unsigned char *buffer
= (unsigned char *) alloca (size
);
4221 if (get_set_constructor_bytes (exp
, buffer
, size
))
4223 assemble_string ((char *) buffer
, size
);
4226 error ("unknown set constructor type");
4234 assemble_zeros (size
);
4238 /* Subroutine of output_constructor, used for computing the size of
4239 arrays of unspecified length. VAL must be a CONSTRUCTOR of an array
4240 type with an unspecified upper bound. */
4242 static unsigned HOST_WIDE_INT
4243 array_size_for_constructor (val
)
4248 max_index
= NULL_TREE
;
4249 for (i
= CONSTRUCTOR_ELTS (val
); i
; i
= TREE_CHAIN (i
))
4251 tree index
= TREE_PURPOSE (i
);
4253 if (TREE_CODE (index
) == RANGE_EXPR
)
4254 index
= TREE_OPERAND (index
, 1);
4255 if (max_index
== NULL_TREE
|| tree_int_cst_lt (max_index
, index
))
4259 if (max_index
== NULL_TREE
)
4262 /* Compute the total number of array elements. */
4263 i
= size_binop (MINUS_EXPR
, convert (sizetype
, max_index
),
4265 TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (val
)))));
4266 i
= size_binop (PLUS_EXPR
, i
, convert (sizetype
, integer_one_node
));
4268 /* Multiply by the array element unit size to find number of bytes. */
4269 i
= size_binop (MULT_EXPR
, i
, TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (val
))));
4271 return tree_low_cst (i
, 1);
4274 /* Subroutine of output_constant, used for CONSTRUCTORs (aggregate constants).
4275 Generate at least SIZE bytes, padding if necessary. */
4278 output_constructor (exp
, size
)
4282 tree type
= TREE_TYPE (exp
);
4283 register tree link
, field
= 0;
4285 /* Number of bytes output or skipped so far.
4286 In other words, current position within the constructor. */
4287 HOST_WIDE_INT total_bytes
= 0;
4288 /* Non-zero means BYTE contains part of a byte, to be output. */
4289 int byte_buffer_in_use
= 0;
4290 register int byte
= 0;
4292 if (HOST_BITS_PER_WIDE_INT
< BITS_PER_UNIT
)
4295 if (TREE_CODE (type
) == RECORD_TYPE
)
4296 field
= TYPE_FIELDS (type
);
4298 if (TREE_CODE (type
) == ARRAY_TYPE
4299 && TYPE_DOMAIN (type
) != 0)
4300 min_index
= TYPE_MIN_VALUE (TYPE_DOMAIN (type
));
4302 /* As LINK goes through the elements of the constant,
4303 FIELD goes through the structure fields, if the constant is a structure.
4304 if the constant is a union, then we override this,
4305 by getting the field from the TREE_LIST element.
4306 But the constant could also be an array. Then FIELD is zero.
4308 There is always a maximum of one element in the chain LINK for unions
4309 (even if the initializer in a source program incorrectly contains
4311 for (link
= CONSTRUCTOR_ELTS (exp
);
4313 link
= TREE_CHAIN (link
),
4314 field
= field
? TREE_CHAIN (field
) : 0)
4316 tree val
= TREE_VALUE (link
);
4319 /* The element in a union constructor specifies the proper field
4321 if ((TREE_CODE (type
) == RECORD_TYPE
|| TREE_CODE (type
) == UNION_TYPE
4322 || TREE_CODE (type
) == QUAL_UNION_TYPE
)
4323 && TREE_PURPOSE (link
) != 0)
4324 field
= TREE_PURPOSE (link
);
4326 else if (TREE_CODE (type
) == ARRAY_TYPE
)
4327 index
= TREE_PURPOSE (link
);
4329 /* Eliminate the marker that makes a cast not be an lvalue. */
4333 if (index
&& TREE_CODE (index
) == RANGE_EXPR
)
4335 unsigned HOST_WIDE_INT fieldsize
4336 = int_size_in_bytes (TREE_TYPE (type
));
4337 HOST_WIDE_INT lo_index
= tree_low_cst (TREE_OPERAND (index
, 0), 0);
4338 HOST_WIDE_INT hi_index
= tree_low_cst (TREE_OPERAND (index
, 1), 0);
4339 HOST_WIDE_INT index
;
4341 for (index
= lo_index
; index
<= hi_index
; index
++)
4343 /* Output the element's initial value. */
4345 assemble_zeros (fieldsize
);
4347 output_constant (val
, fieldsize
);
4349 /* Count its size. */
4350 total_bytes
+= fieldsize
;
4353 else if (field
== 0 || !DECL_BIT_FIELD (field
))
4355 /* An element that is not a bit-field. */
4357 unsigned HOST_WIDE_INT fieldsize
;
4358 /* Since this structure is static,
4359 we know the positions are constant. */
4360 HOST_WIDE_INT pos
= field
? int_byte_position (field
) : 0;
4363 pos
= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (val
)), 1)
4364 * (tree_low_cst (index
, 0) - tree_low_cst (min_index
, 0)));
4366 /* Output any buffered-up bit-fields preceding this element. */
4367 if (byte_buffer_in_use
)
4369 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4371 byte_buffer_in_use
= 0;
4374 /* Advance to offset of this element.
4375 Note no alignment needed in an array, since that is guaranteed
4376 if each element has the proper size. */
4377 if ((field
!= 0 || index
!= 0) && pos
!= total_bytes
)
4379 assemble_zeros (pos
- total_bytes
);
4383 else if (field
!= 0 && DECL_PACKED (field
))
4384 /* Some assemblers automaticallly align a datum according to its
4385 size if no align directive is specified. The datum, however,
4386 may be declared with 'packed' attribute, so we have to disable
4388 ASM_OUTPUT_ALIGN (asm_out_file
, 0);
4390 /* Determine size this element should occupy. */
4395 /* If this is an array with an unspecified upper bound,
4396 the initializer determines the size. */
4397 /* ??? This ought to only checked if DECL_SIZE_UNIT is NULL,
4398 but we cannot do this until the deprecated support for
4399 initializing zero-length array members is removed. */
4400 if (TREE_CODE (TREE_TYPE (field
)) == ARRAY_TYPE
4401 && TYPE_DOMAIN (TREE_TYPE (field
))
4402 && ! TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (field
))))
4404 fieldsize
= array_size_for_constructor (val
);
4405 /* Given a non-empty initialization, this field had
4407 if (fieldsize
!= 0 && TREE_CHAIN (field
) != NULL_TREE
)
4410 else if (DECL_SIZE_UNIT (field
))
4412 /* ??? This can't be right. If the decl size overflows
4413 a host integer we will silently emit no data. */
4414 if (host_integerp (DECL_SIZE_UNIT (field
), 1))
4415 fieldsize
= tree_low_cst (DECL_SIZE_UNIT (field
), 1);
4419 fieldsize
= int_size_in_bytes (TREE_TYPE (type
));
4421 /* Output the element's initial value. */
4423 assemble_zeros (fieldsize
);
4425 output_constant (val
, fieldsize
);
4427 /* Count its size. */
4428 total_bytes
+= fieldsize
;
4430 else if (val
!= 0 && TREE_CODE (val
) != INTEGER_CST
)
4431 error ("invalid initial value for member `%s'",
4432 IDENTIFIER_POINTER (DECL_NAME (field
)));
4435 /* Element that is a bit-field. */
4437 HOST_WIDE_INT next_offset
= int_bit_position (field
);
4438 HOST_WIDE_INT end_offset
4439 = (next_offset
+ tree_low_cst (DECL_SIZE (field
), 1));
4442 val
= integer_zero_node
;
4444 /* If this field does not start in this (or, next) byte,
4446 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4448 /* Output remnant of any bit field in previous bytes. */
4449 if (byte_buffer_in_use
)
4451 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4453 byte_buffer_in_use
= 0;
4456 /* If still not at proper byte, advance to there. */
4457 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4459 assemble_zeros (next_offset
/ BITS_PER_UNIT
- total_bytes
);
4460 total_bytes
= next_offset
/ BITS_PER_UNIT
;
4464 if (! byte_buffer_in_use
)
4467 /* We must split the element into pieces that fall within
4468 separate bytes, and combine each byte with previous or
4469 following bit-fields. */
4471 /* next_offset is the offset n fbits from the beginning of
4472 the structure to the next bit of this element to be processed.
4473 end_offset is the offset of the first bit past the end of
4475 while (next_offset
< end_offset
)
4479 HOST_WIDE_INT value
;
4480 HOST_WIDE_INT next_byte
= next_offset
/ BITS_PER_UNIT
;
4481 HOST_WIDE_INT next_bit
= next_offset
% BITS_PER_UNIT
;
4483 /* Advance from byte to byte
4484 within this element when necessary. */
4485 while (next_byte
!= total_bytes
)
4487 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4492 /* Number of bits we can process at once
4493 (all part of the same byte). */
4494 this_time
= MIN (end_offset
- next_offset
,
4495 BITS_PER_UNIT
- next_bit
);
4496 if (BYTES_BIG_ENDIAN
)
4498 /* On big-endian machine, take the most significant bits
4499 first (of the bits that are significant)
4500 and put them into bytes from the most significant end. */
4501 shift
= end_offset
- next_offset
- this_time
;
4503 /* Don't try to take a bunch of bits that cross
4504 the word boundary in the INTEGER_CST. We can
4505 only select bits from the LOW or HIGH part
4507 if (shift
< HOST_BITS_PER_WIDE_INT
4508 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4510 this_time
= shift
+ this_time
- HOST_BITS_PER_WIDE_INT
;
4511 shift
= HOST_BITS_PER_WIDE_INT
;
4514 /* Now get the bits from the appropriate constant word. */
4515 if (shift
< HOST_BITS_PER_WIDE_INT
)
4516 value
= TREE_INT_CST_LOW (val
);
4517 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4519 value
= TREE_INT_CST_HIGH (val
);
4520 shift
-= HOST_BITS_PER_WIDE_INT
;
4525 /* Get the result. This works only when:
4526 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4527 byte
|= (((value
>> shift
)
4528 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4529 << (BITS_PER_UNIT
- this_time
- next_bit
));
4533 /* On little-endian machines,
4534 take first the least significant bits of the value
4535 and pack them starting at the least significant
4536 bits of the bytes. */
4537 shift
= next_offset
- int_bit_position (field
);
4539 /* Don't try to take a bunch of bits that cross
4540 the word boundary in the INTEGER_CST. We can
4541 only select bits from the LOW or HIGH part
4543 if (shift
< HOST_BITS_PER_WIDE_INT
4544 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4545 this_time
= (HOST_BITS_PER_WIDE_INT
- shift
);
4547 /* Now get the bits from the appropriate constant word. */
4548 if (shift
< HOST_BITS_PER_WIDE_INT
)
4549 value
= TREE_INT_CST_LOW (val
);
4550 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4552 value
= TREE_INT_CST_HIGH (val
);
4553 shift
-= HOST_BITS_PER_WIDE_INT
;
4558 /* Get the result. This works only when:
4559 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4560 byte
|= (((value
>> shift
)
4561 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4565 next_offset
+= this_time
;
4566 byte_buffer_in_use
= 1;
4571 if (byte_buffer_in_use
)
4573 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4577 if (total_bytes
< size
)
4578 assemble_zeros (size
- total_bytes
);
4581 #ifdef HANDLE_PRAGMA_WEAK
4582 /* Add function NAME to the weak symbols list. VALUE is a weak alias
4583 associatd with NAME. */
4586 add_weak (name
, value
)
4590 struct weak_syms
*weak
;
4592 weak
= (struct weak_syms
*) permalloc (sizeof (struct weak_syms
));
4597 weak
->next
= weak_decls
;
4599 weak
->value
= value
;
4604 #endif /* HANDLE_PRAGMA_WEAK */
4606 /* Declare DECL to be a weak symbol. */
4612 if (! TREE_PUBLIC (decl
))
4613 error_with_decl (decl
, "weak declaration of `%s' must be public");
4614 else if (TREE_ASM_WRITTEN (decl
))
4615 error_with_decl (decl
, "weak declaration of `%s' must precede definition");
4616 else if (SUPPORTS_WEAK
)
4617 DECL_WEAK (decl
) = 1;
4618 #ifdef HANDLE_PRAGMA_WEAK
4619 add_weak (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)), NULL
);
4623 /* Emit any pending weak declarations. */
4625 #ifdef HANDLE_PRAGMA_WEAK
4626 struct weak_syms
* weak_decls
;
4632 #ifdef HANDLE_PRAGMA_WEAK
4633 if (HANDLE_PRAGMA_WEAK
)
4635 struct weak_syms
*t
;
4636 for (t
= weak_decls
; t
; t
= t
->next
)
4639 ASM_OUTPUT_WEAK_ALIAS (asm_out_file
, t
->name
, t
->value
);
4645 /* Remove NAME from the pending list of weak symbols. This prevents
4646 the compiler from emitting multiple .weak directives which confuses
4648 #ifdef ASM_WEAKEN_LABEL
4650 remove_from_pending_weak_list (name
)
4651 const char *name ATTRIBUTE_UNUSED
;
4653 #ifdef HANDLE_PRAGMA_WEAK
4654 if (HANDLE_PRAGMA_WEAK
)
4656 struct weak_syms
*t
;
4657 for (t
= weak_decls
; t
; t
= t
->next
)
4659 if (t
->name
&& strcmp (name
, t
->name
) == 0)
4668 assemble_alias (decl
, target
)
4669 tree decl
, target ATTRIBUTE_UNUSED
;
4673 /* We must force creation of DECL_RTL for debug info generation, even though
4674 we don't use it here. */
4675 make_decl_rtl (decl
, NULL
);
4677 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
4679 #ifdef ASM_OUTPUT_DEF
4680 /* Make name accessible from other files, if appropriate. */
4682 if (TREE_PUBLIC (decl
))
4684 #ifdef ASM_WEAKEN_LABEL
4685 if (DECL_WEAK (decl
))
4687 ASM_WEAKEN_LABEL (asm_out_file
, name
);
4688 /* Remove this function from the pending weak list so that
4689 we do not emit multiple .weak directives for it. */
4690 remove_from_pending_weak_list
4691 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
4695 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
4698 #ifdef ASM_OUTPUT_DEF_FROM_DECLS
4699 ASM_OUTPUT_DEF_FROM_DECLS (asm_out_file
, decl
, target
);
4701 ASM_OUTPUT_DEF (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4703 TREE_ASM_WRITTEN (decl
) = 1;
4705 #ifdef ASM_OUTPUT_WEAK_ALIAS
4706 if (! DECL_WEAK (decl
))
4707 warning ("only weak aliases are supported in this configuration");
4709 ASM_OUTPUT_WEAK_ALIAS (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4710 TREE_ASM_WRITTEN (decl
) = 1;
4712 warning ("alias definitions not supported in this configuration; ignored");
4717 /* Returns 1 if the target configuration supports defining public symbols
4718 so that one of them will be chosen at link time instead of generating a
4719 multiply-defined symbol error, whether through the use of weak symbols or
4720 a target-specific mechanism for having duplicates discarded. */
4723 supports_one_only ()
4725 if (SUPPORTS_ONE_ONLY
)
4727 return SUPPORTS_WEAK
;
4730 /* Set up DECL as a public symbol that can be defined in multiple
4731 translation units without generating a linker error. */
4734 make_decl_one_only (decl
)
4737 if (TREE_CODE (decl
) != VAR_DECL
&& TREE_CODE (decl
) != FUNCTION_DECL
)
4740 TREE_PUBLIC (decl
) = 1;
4742 if (TREE_CODE (decl
) == VAR_DECL
4743 && (DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
))
4744 DECL_COMMON (decl
) = 1;
4745 else if (SUPPORTS_ONE_ONLY
)
4747 #ifdef MAKE_DECL_ONE_ONLY
4748 MAKE_DECL_ONE_ONLY (decl
);
4750 DECL_ONE_ONLY (decl
) = 1;
4752 else if (SUPPORTS_WEAK
)
4753 DECL_WEAK (decl
) = 1;
4761 const_str_htab
= htab_create (128, const_str_htab_hash
, const_str_htab_eq
,
4762 const_str_htab_del
);
4763 ggc_add_root (const_hash_table
, MAX_HASH_TABLE
, sizeof const_hash_table
[0],
4764 mark_const_hash_entry
);
4765 ggc_add_root (&const_str_htab
, 1, sizeof const_str_htab
,
4766 mark_const_str_htab
);