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. But be careful we don't use a CONST_DOUBLE
1921 that's from a parent function since it may be in its constant pool. */
1922 if (REAL_VALUES_IDENTICAL (dconst0
, d
)
1923 && (cfun
== 0 || decl_function_context (current_function_decl
) == 0))
1924 return CONST0_RTX (mode
);
1926 /* Check for NaN first, because some ports (specifically the i386) do not
1927 emit correct ieee-fp code by default, and thus will generate a core
1928 dump here if we pass a NaN to REAL_VALUES_EQUAL and if REAL_VALUES_EQUAL
1929 does a floating point comparison. */
1930 else if ((! REAL_VALUE_ISNAN (d
) && REAL_VALUES_EQUAL (dconst1
, d
))
1932 || decl_function_context (current_function_decl
) == 0))
1933 return CONST1_RTX (mode
);
1935 if (sizeof u
== sizeof (HOST_WIDE_INT
))
1936 return immed_double_const (u
.i
[0], 0, mode
);
1937 if (sizeof u
== 2 * sizeof (HOST_WIDE_INT
))
1938 return immed_double_const (u
.i
[0], u
.i
[1], mode
);
1940 /* The rest of this function handles the case where
1941 a float value requires more than 2 ints of space.
1942 It will be deleted as dead code on machines that don't need it. */
1944 /* Search the chain for an existing CONST_DOUBLE with the right value.
1945 If one is found, return it. */
1947 for (r
= const_double_chain
; r
; r
= CONST_DOUBLE_CHAIN (r
))
1948 if (! memcmp ((char *) &CONST_DOUBLE_LOW (r
), (char *) &u
, sizeof u
)
1949 && GET_MODE (r
) == mode
)
1952 /* No; make a new one and add it to the chain.
1954 We may be called by an optimizer which may be discarding any memory
1955 allocated during its processing (such as combine and loop). However,
1956 we will be leaving this constant on the chain, so we cannot tolerate
1958 r
= rtx_alloc (CONST_DOUBLE
);
1960 memcpy ((char *) &CONST_DOUBLE_LOW (r
), (char *) &u
, sizeof u
);
1962 /* If we aren't inside a function, don't put r on the
1963 const_double_chain. */
1964 if (current_function_decl
!= 0)
1966 CONST_DOUBLE_CHAIN (r
) = const_double_chain
;
1967 const_double_chain
= r
;
1970 CONST_DOUBLE_CHAIN (r
) = NULL_RTX
;
1972 /* Store const0_rtx in CONST_DOUBLE_MEM since this CONST_DOUBLE is on the
1973 chain, but has not been allocated memory. Actual use of CONST_DOUBLE_MEM
1974 is only through force_const_mem. */
1976 CONST_DOUBLE_MEM (r
) = const0_rtx
;
1981 /* Return a CONST_DOUBLE rtx for a value specified by EXP,
1982 which must be a REAL_CST tree node. */
1985 immed_real_const (exp
)
1988 return immed_real_const_1 (TREE_REAL_CST (exp
), TYPE_MODE (TREE_TYPE (exp
)));
1991 /* At the end of a function, forget the memory-constants
1992 previously made for CONST_DOUBLEs. Mark them as not on real_constant_chain.
1993 Also clear out real_constant_chain and clear out all the chain-pointers. */
1996 clear_const_double_mem ()
1998 register rtx r
, next
;
2000 for (r
= const_double_chain
; r
; r
= next
)
2002 next
= CONST_DOUBLE_CHAIN (r
);
2003 CONST_DOUBLE_CHAIN (r
) = 0;
2004 CONST_DOUBLE_MEM (r
) = cc0_rtx
;
2006 const_double_chain
= 0;
2009 /* Given an expression EXP with a constant value,
2010 reduce it to the sum of an assembler symbol and an integer.
2011 Store them both in the structure *VALUE.
2012 Abort if EXP does not reduce. */
2017 HOST_WIDE_INT offset
;
2021 decode_addr_const (exp
, value
)
2023 struct addr_const
*value
;
2025 register tree target
= TREE_OPERAND (exp
, 0);
2026 register int offset
= 0;
2031 if (TREE_CODE (target
) == COMPONENT_REF
2032 && host_integerp (byte_position (TREE_OPERAND (target
, 1)), 0))
2035 offset
+= int_byte_position (TREE_OPERAND (target
, 1));
2036 target
= TREE_OPERAND (target
, 0);
2038 else if (TREE_CODE (target
) == ARRAY_REF
2039 || TREE_CODE (target
) == ARRAY_RANGE_REF
)
2041 offset
+= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (target
)), 1)
2042 * tree_low_cst (TREE_OPERAND (target
, 1), 0));
2043 target
= TREE_OPERAND (target
, 0);
2049 switch (TREE_CODE (target
))
2053 x
= DECL_RTL (target
);
2057 x
= gen_rtx_MEM (FUNCTION_MODE
,
2058 gen_rtx_LABEL_REF (VOIDmode
,
2059 label_rtx (TREE_OPERAND (exp
, 0))));
2067 x
= TREE_CST_RTL (target
);
2074 if (GET_CODE (x
) != MEM
)
2079 value
->offset
= offset
;
2082 enum kind
{ RTX_DOUBLE
, RTX_INT
};
2085 ENUM_BITFIELD(kind
) kind
: 16;
2086 ENUM_BITFIELD(machine_mode
) mode
: 16;
2088 union real_extract du
;
2089 struct addr_const addr
;
2090 struct {HOST_WIDE_INT high
, low
;} di
;
2094 /* Uniquize all constants that appear in memory.
2095 Each constant in memory thus far output is recorded
2096 in `const_hash_table' with a `struct constant_descriptor'
2097 that contains a polish representation of the value of
2100 We cannot store the trees in the hash table
2101 because the trees may be temporary. */
2103 struct constant_descriptor
2105 struct constant_descriptor
*next
;
2108 /* Make sure the data is reasonably aligned. */
2111 unsigned char contents
[1];
2112 #ifdef HAVE_LONG_DOUBLE
2121 #define MAX_HASH_TABLE 1009
2122 static struct constant_descriptor
*const_hash_table
[MAX_HASH_TABLE
];
2124 #define STRHASH(x) ((hashval_t)((long)(x) >> 3))
2126 struct deferred_string
2133 static htab_t const_str_htab
;
2135 /* Mark a const_hash_table descriptor for GC. */
2138 mark_const_hash_entry (ptr
)
2141 struct constant_descriptor
*desc
= * (struct constant_descriptor
**) ptr
;
2145 ggc_mark_rtx (desc
->rtl
);
2150 /* Mark the hash-table element X (which is really a pointer to an
2151 struct deferred_string *). */
2154 mark_const_str_htab_1 (x
, data
)
2156 void *data ATTRIBUTE_UNUSED
;
2158 ggc_mark_tree (((struct deferred_string
*) *x
)->exp
);
2162 /* Mark a const_str_htab for GC. */
2165 mark_const_str_htab (htab
)
2168 htab_traverse (*((htab_t
*) htab
), mark_const_str_htab_1
, NULL
);
2171 /* Returns a hash code for X (which is a really a
2172 struct deferred_string *). */
2175 const_str_htab_hash (x
)
2178 return STRHASH (((const struct deferred_string
*) x
)->label
);
2181 /* Returns non-zero if the value represented by X (which is really a
2182 struct deferred_string *) is the same as that given by Y
2183 (which is really a char *). */
2186 const_str_htab_eq (x
, y
)
2190 return (((const struct deferred_string
*) x
)->label
== (const char *) y
);
2193 /* Delete the hash table entry dfsp. */
2196 const_str_htab_del (dfsp
)
2202 /* Compute a hash code for a constant expression. */
2208 register const char *p
;
2209 register int len
, hi
, i
;
2210 register enum tree_code code
= TREE_CODE (exp
);
2212 /* Either set P and LEN to the address and len of something to hash and
2213 exit the switch or return a value. */
2218 p
= (char *) &TREE_INT_CST (exp
);
2219 len
= sizeof TREE_INT_CST (exp
);
2223 p
= (char *) &TREE_REAL_CST (exp
);
2224 len
= sizeof TREE_REAL_CST (exp
);
2228 p
= TREE_STRING_POINTER (exp
);
2229 len
= TREE_STRING_LENGTH (exp
);
2233 return (const_hash (TREE_REALPART (exp
)) * 5
2234 + const_hash (TREE_IMAGPART (exp
)));
2237 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2241 len
= int_size_in_bytes (TREE_TYPE (exp
));
2242 tmp
= (char *) alloca (len
);
2243 get_set_constructor_bytes (exp
, (unsigned char *) tmp
, len
);
2251 /* For record type, include the type in the hashing.
2252 We do not do so for array types
2253 because (1) the sizes of the elements are sufficient
2254 and (2) distinct array types can have the same constructor.
2255 Instead, we include the array size because the constructor could
2257 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2258 hi
= ((unsigned long) TREE_TYPE (exp
) & ((1 << HASHBITS
) - 1))
2261 hi
= ((5 + int_size_in_bytes (TREE_TYPE (exp
)))
2262 & ((1 << HASHBITS
) - 1)) % MAX_HASH_TABLE
;
2264 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2265 if (TREE_VALUE (link
))
2267 = (hi
* 603 + const_hash (TREE_VALUE (link
))) % MAX_HASH_TABLE
;
2274 struct addr_const value
;
2276 decode_addr_const (exp
, &value
);
2277 if (GET_CODE (value
.base
) == SYMBOL_REF
)
2279 /* Don't hash the address of the SYMBOL_REF;
2280 only use the offset and the symbol name. */
2282 p
= XSTR (value
.base
, 0);
2283 for (i
= 0; p
[i
] != 0; i
++)
2284 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2286 else if (GET_CODE (value
.base
) == LABEL_REF
)
2287 hi
= value
.offset
+ CODE_LABEL_NUMBER (XEXP (value
.base
, 0)) * 13;
2291 hi
&= (1 << HASHBITS
) - 1;
2292 hi
%= MAX_HASH_TABLE
;
2298 return (const_hash (TREE_OPERAND (exp
, 0)) * 9
2299 + const_hash (TREE_OPERAND (exp
, 1)));
2303 case NON_LVALUE_EXPR
:
2304 return const_hash (TREE_OPERAND (exp
, 0)) * 7 + 2;
2307 /* A language specific constant. Just hash the code. */
2308 return (int) code
% MAX_HASH_TABLE
;
2311 /* Compute hashing function */
2313 for (i
= 0; i
< len
; i
++)
2314 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2316 hi
&= (1 << HASHBITS
) - 1;
2317 hi
%= MAX_HASH_TABLE
;
2321 /* Compare a constant expression EXP with a constant-descriptor DESC.
2322 Return 1 if DESC describes a constant with the same value as EXP. */
2325 compare_constant (exp
, desc
)
2327 struct constant_descriptor
*desc
;
2329 return 0 != compare_constant_1 (exp
, desc
->u
.contents
);
2332 /* Compare constant expression EXP with a substring P of a constant descriptor.
2333 If they match, return a pointer to the end of the substring matched.
2334 If they do not match, return 0.
2336 Since descriptors are written in polish prefix notation,
2337 this function can be used recursively to test one operand of EXP
2338 against a subdescriptor, and if it succeeds it returns the
2339 address of the subdescriptor for the next operand. */
2341 static const unsigned char *
2342 compare_constant_1 (exp
, p
)
2344 const unsigned char *p
;
2346 register const unsigned char *strp
;
2348 register enum tree_code code
= TREE_CODE (exp
);
2350 if (code
!= (enum tree_code
) *p
++)
2353 /* Either set STRP, P and LEN to pointers and length to compare and exit the
2354 switch, or return the result of the comparison. */
2359 /* Integer constants are the same only if the same width of type. */
2360 if (*p
++ != TYPE_PRECISION (TREE_TYPE (exp
)))
2363 strp
= (unsigned char *) &TREE_INT_CST (exp
);
2364 len
= sizeof TREE_INT_CST (exp
);
2368 /* Real constants are the same only if the same width of type. */
2369 if (*p
++ != TYPE_PRECISION (TREE_TYPE (exp
)))
2372 strp
= (unsigned char *) &TREE_REAL_CST (exp
);
2373 len
= sizeof TREE_REAL_CST (exp
);
2377 if (flag_writable_strings
)
2380 if ((enum machine_mode
) *p
++ != TYPE_MODE (TREE_TYPE (exp
)))
2383 strp
= (const unsigned char *)TREE_STRING_POINTER (exp
);
2384 len
= TREE_STRING_LENGTH (exp
);
2385 if (memcmp ((char *) &TREE_STRING_LENGTH (exp
), p
,
2386 sizeof TREE_STRING_LENGTH (exp
)))
2389 p
+= sizeof TREE_STRING_LENGTH (exp
);
2393 p
= compare_constant_1 (TREE_REALPART (exp
), p
);
2397 return compare_constant_1 (TREE_IMAGPART (exp
), p
);
2400 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2402 int xlen
= len
= int_size_in_bytes (TREE_TYPE (exp
));
2403 unsigned char *tmp
= (unsigned char *) alloca (len
);
2405 get_set_constructor_bytes (exp
, tmp
, len
);
2406 strp
= (unsigned char *) tmp
;
2407 if (memcmp ((char *) &xlen
, p
, sizeof xlen
))
2416 int length
= list_length (CONSTRUCTOR_ELTS (exp
));
2418 enum machine_mode mode
= TYPE_MODE (TREE_TYPE (exp
));
2419 int have_purpose
= 0;
2421 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2422 if (TREE_PURPOSE (link
))
2425 if (memcmp ((char *) &length
, p
, sizeof length
))
2430 /* For record constructors, insist that the types match.
2431 For arrays, just verify both constructors are for arrays.
2432 Then insist that either both or none have any TREE_PURPOSE
2434 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2435 type
= TREE_TYPE (exp
);
2439 if (memcmp ((char *) &type
, p
, sizeof type
))
2442 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2444 if (memcmp ((char *) &mode
, p
, sizeof mode
))
2452 if (memcmp ((char *) &have_purpose
, p
, sizeof have_purpose
))
2455 p
+= sizeof have_purpose
;
2457 /* For arrays, insist that the size in bytes match. */
2458 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2460 HOST_WIDE_INT size
= int_size_in_bytes (TREE_TYPE (exp
));
2462 if (memcmp ((char *) &size
, p
, sizeof size
))
2468 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2470 if (TREE_VALUE (link
))
2472 if ((p
= compare_constant_1 (TREE_VALUE (link
), p
)) == 0)
2479 if (memcmp ((char *) &zero
, p
, sizeof zero
))
2485 if (TREE_PURPOSE (link
)
2486 && TREE_CODE (TREE_PURPOSE (link
)) == FIELD_DECL
)
2488 if (memcmp ((char *) &TREE_PURPOSE (link
), p
,
2489 sizeof TREE_PURPOSE (link
)))
2492 p
+= sizeof TREE_PURPOSE (link
);
2494 else if (TREE_PURPOSE (link
))
2496 if ((p
= compare_constant_1 (TREE_PURPOSE (link
), p
)) == 0)
2499 else if (have_purpose
)
2503 if (memcmp ((char *) &zero
, p
, sizeof zero
))
2515 struct addr_const value
;
2517 decode_addr_const (exp
, &value
);
2518 strp
= (unsigned char *) &value
.offset
;
2519 len
= sizeof value
.offset
;
2520 /* Compare the offset. */
2522 if (*p
++ != *strp
++)
2525 /* Compare symbol name. */
2526 strp
= (const unsigned char *) XSTR (value
.base
, 0);
2527 len
= strlen ((const char *) strp
) + 1;
2534 p
= compare_constant_1 (TREE_OPERAND (exp
, 0), p
);
2538 return compare_constant_1 (TREE_OPERAND (exp
, 1), p
);
2542 case NON_LVALUE_EXPR
:
2543 return compare_constant_1 (TREE_OPERAND (exp
, 0), p
);
2546 if (lang_expand_constant
)
2548 exp
= (*lang_expand_constant
) (exp
);
2549 return compare_constant_1 (exp
, p
);
2554 /* Compare constant contents. */
2556 if (*p
++ != *strp
++)
2562 /* Construct a constant descriptor for the expression EXP.
2563 It is up to the caller to enter the descriptor in the hash table. */
2565 static struct constant_descriptor
*
2566 record_constant (exp
)
2569 struct constant_descriptor
*next
= 0;
2574 /* Make a struct constant_descriptor. The first three pointers will
2575 be filled in later. Here we just leave space for them. */
2577 obstack_grow (&permanent_obstack
, (char *) &next
, sizeof next
);
2578 obstack_grow (&permanent_obstack
, (char *) &label
, sizeof label
);
2579 obstack_grow (&permanent_obstack
, (char *) &rtl
, sizeof rtl
);
2581 /* Align the descriptor for the data payload. */
2582 pad
= (offsetof (struct constant_descriptor
, u
)
2583 - offsetof(struct constant_descriptor
, rtl
)
2584 - sizeof(next
->rtl
));
2586 obstack_blank (&permanent_obstack
, pad
);
2588 record_constant_1 (exp
);
2589 return (struct constant_descriptor
*) obstack_finish (&permanent_obstack
);
2592 /* Add a description of constant expression EXP
2593 to the object growing in `permanent_obstack'.
2594 No need to return its address; the caller will get that
2595 from the obstack when the object is complete. */
2598 record_constant_1 (exp
)
2601 register const unsigned char *strp
;
2603 register enum tree_code code
= TREE_CODE (exp
);
2605 obstack_1grow (&permanent_obstack
, (unsigned int) code
);
2610 obstack_1grow (&permanent_obstack
, TYPE_PRECISION (TREE_TYPE (exp
)));
2611 strp
= (unsigned char *) &TREE_INT_CST (exp
);
2612 len
= sizeof TREE_INT_CST (exp
);
2616 obstack_1grow (&permanent_obstack
, TYPE_PRECISION (TREE_TYPE (exp
)));
2617 strp
= (unsigned char *) &TREE_REAL_CST (exp
);
2618 len
= sizeof TREE_REAL_CST (exp
);
2622 if (flag_writable_strings
)
2625 obstack_1grow (&permanent_obstack
, TYPE_MODE (TREE_TYPE (exp
)));
2626 strp
= (const unsigned char *) TREE_STRING_POINTER (exp
);
2627 len
= TREE_STRING_LENGTH (exp
);
2628 obstack_grow (&permanent_obstack
, (char *) &TREE_STRING_LENGTH (exp
),
2629 sizeof TREE_STRING_LENGTH (exp
));
2633 record_constant_1 (TREE_REALPART (exp
));
2634 record_constant_1 (TREE_IMAGPART (exp
));
2638 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2640 int nbytes
= int_size_in_bytes (TREE_TYPE (exp
));
2641 obstack_grow (&permanent_obstack
, &nbytes
, sizeof (nbytes
));
2642 obstack_blank (&permanent_obstack
, nbytes
);
2643 get_set_constructor_bytes
2644 (exp
, (unsigned char *) permanent_obstack
.next_free
-nbytes
,
2651 int length
= list_length (CONSTRUCTOR_ELTS (exp
));
2652 enum machine_mode mode
= TYPE_MODE (TREE_TYPE (exp
));
2654 int have_purpose
= 0;
2656 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2657 if (TREE_PURPOSE (link
))
2660 obstack_grow (&permanent_obstack
, (char *) &length
, sizeof length
);
2662 /* For record constructors, insist that the types match.
2663 For arrays, just verify both constructors are for arrays
2664 of the same mode. Then insist that either both or none
2665 have any TREE_PURPOSE values. */
2666 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2667 type
= TREE_TYPE (exp
);
2671 obstack_grow (&permanent_obstack
, (char *) &type
, sizeof type
);
2672 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2673 obstack_grow (&permanent_obstack
, &mode
, sizeof mode
);
2675 obstack_grow (&permanent_obstack
, (char *) &have_purpose
,
2676 sizeof have_purpose
);
2678 /* For arrays, insist that the size in bytes match. */
2679 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2681 HOST_WIDE_INT size
= int_size_in_bytes (TREE_TYPE (exp
));
2682 obstack_grow (&permanent_obstack
, (char *) &size
, sizeof size
);
2685 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2687 if (TREE_VALUE (link
))
2688 record_constant_1 (TREE_VALUE (link
));
2693 obstack_grow (&permanent_obstack
,
2694 (char *) &zero
, sizeof zero
);
2697 if (TREE_PURPOSE (link
)
2698 && TREE_CODE (TREE_PURPOSE (link
)) == FIELD_DECL
)
2699 obstack_grow (&permanent_obstack
,
2700 (char *) &TREE_PURPOSE (link
),
2701 sizeof TREE_PURPOSE (link
));
2702 else if (TREE_PURPOSE (link
))
2703 record_constant_1 (TREE_PURPOSE (link
));
2704 else if (have_purpose
)
2708 obstack_grow (&permanent_obstack
,
2709 (char *) &zero
, sizeof zero
);
2717 struct addr_const value
;
2719 decode_addr_const (exp
, &value
);
2720 /* Record the offset. */
2721 obstack_grow (&permanent_obstack
,
2722 (char *) &value
.offset
, sizeof value
.offset
);
2724 switch (GET_CODE (value
.base
))
2727 /* Record the symbol name. */
2728 obstack_grow (&permanent_obstack
, XSTR (value
.base
, 0),
2729 strlen (XSTR (value
.base
, 0)) + 1);
2732 /* Record the address of the CODE_LABEL. It may not have
2733 been emitted yet, so it's UID may be zero. But pointer
2734 identity is good enough. */
2735 obstack_grow (&permanent_obstack
, &XEXP (value
.base
, 0),
2747 record_constant_1 (TREE_OPERAND (exp
, 0));
2748 record_constant_1 (TREE_OPERAND (exp
, 1));
2753 case NON_LVALUE_EXPR
:
2754 record_constant_1 (TREE_OPERAND (exp
, 0));
2758 if (lang_expand_constant
)
2760 exp
= (*lang_expand_constant
) (exp
);
2761 record_constant_1 (exp
);
2766 /* Record constant contents. */
2767 obstack_grow (&permanent_obstack
, strp
, len
);
2770 /* Record a list of constant expressions that were passed to
2771 output_constant_def but that could not be output right away. */
2773 struct deferred_constant
2775 struct deferred_constant
*next
;
2781 static struct deferred_constant
*deferred_constants
;
2783 /* Another list of constants which should be output after the
2785 static struct deferred_constant
*after_function_constants
;
2787 /* Nonzero means defer output of addressed subconstants
2788 (i.e., those for which output_constant_def is called.) */
2789 static int defer_addressed_constants_flag
;
2791 /* Start deferring output of subconstants. */
2794 defer_addressed_constants ()
2796 defer_addressed_constants_flag
++;
2799 /* Stop deferring output of subconstants,
2800 and output now all those that have been deferred. */
2803 output_deferred_addressed_constants ()
2805 struct deferred_constant
*p
, *next
;
2807 defer_addressed_constants_flag
--;
2809 if (defer_addressed_constants_flag
> 0)
2812 for (p
= deferred_constants
; p
; p
= next
)
2814 output_constant_def_contents (p
->exp
, p
->reloc
, p
->labelno
);
2819 deferred_constants
= 0;
2822 /* Output any constants which should appear after a function. */
2825 output_after_function_constants ()
2827 struct deferred_constant
*p
, *next
;
2829 for (p
= after_function_constants
; p
; p
= next
)
2831 output_constant_def_contents (p
->exp
, p
->reloc
, p
->labelno
);
2836 after_function_constants
= 0;
2839 /* Make a copy of the whole tree structure for a constant.
2840 This handles the same types of nodes that compare_constant
2841 and record_constant handle. */
2847 switch (TREE_CODE (exp
))
2850 /* For ADDR_EXPR, we do not want to copy the decl whose address
2851 is requested. We do want to copy constants though. */
2852 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, 0))) == 'c')
2853 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2854 copy_constant (TREE_OPERAND (exp
, 0)));
2856 return copy_node (exp
);
2861 return copy_node (exp
);
2864 return build_complex (TREE_TYPE (exp
),
2865 copy_constant (TREE_REALPART (exp
)),
2866 copy_constant (TREE_IMAGPART (exp
)));
2870 return build (TREE_CODE (exp
), TREE_TYPE (exp
),
2871 copy_constant (TREE_OPERAND (exp
, 0)),
2872 copy_constant (TREE_OPERAND (exp
, 1)));
2876 case NON_LVALUE_EXPR
:
2877 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2878 copy_constant (TREE_OPERAND (exp
, 0)));
2882 tree copy
= copy_node (exp
);
2883 tree list
= copy_list (CONSTRUCTOR_ELTS (exp
));
2886 CONSTRUCTOR_ELTS (copy
) = list
;
2887 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
2888 TREE_VALUE (tail
) = copy_constant (TREE_VALUE (tail
));
2889 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2890 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
2891 TREE_PURPOSE (tail
) = copy_constant (TREE_PURPOSE (tail
));
2901 /* Return an rtx representing a reference to constant data in memory
2902 for the constant expression EXP.
2904 If assembler code for such a constant has already been output,
2905 return an rtx to refer to it.
2906 Otherwise, output such a constant in memory (or defer it for later)
2907 and generate an rtx for it.
2909 If DEFER is non-zero, the output of string constants can be deferred
2910 and output only if referenced in the function after all optimizations.
2912 The TREE_CST_RTL of EXP is set up to point to that rtx.
2913 The const_hash_table records which constants already have label strings. */
2916 output_constant_def (exp
, defer
)
2921 register struct constant_descriptor
*desc
;
2922 struct deferred_string
**defstr
;
2926 int after_function
= 0;
2929 if (TREE_CST_RTL (exp
))
2930 return TREE_CST_RTL (exp
);
2932 /* Make sure any other constants whose addresses appear in EXP
2933 are assigned label numbers. */
2935 reloc
= output_addressed_constants (exp
);
2937 /* Compute hash code of EXP. Search the descriptors for that hash code
2938 to see if any of them describes EXP. If yes, the descriptor records
2939 the label number already assigned. */
2941 hash
= const_hash (exp
) % MAX_HASH_TABLE
;
2943 for (desc
= const_hash_table
[hash
]; desc
; desc
= desc
->next
)
2944 if (compare_constant (exp
, desc
))
2949 /* No constant equal to EXP is known to have been output.
2950 Make a constant descriptor to enter EXP in the hash table.
2951 Assign the label number and record it in the descriptor for
2952 future calls to this function to find. */
2954 /* Create a string containing the label name, in LABEL. */
2955 labelno
= const_labelno
++;
2956 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", labelno
);
2958 desc
= record_constant (exp
);
2959 desc
->next
= const_hash_table
[hash
];
2960 desc
->label
= ggc_strdup (label
);
2961 const_hash_table
[hash
] = desc
;
2963 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
2965 = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp
)),
2966 gen_rtx_SYMBOL_REF (Pmode
, desc
->label
));
2968 set_mem_attributes (desc
->rtl
, exp
, 1);
2973 TREE_CST_RTL (exp
) = desc
->rtl
;
2975 /* Optionally set flags or add text to the name to record information
2976 such as that it is a function name. If the name is changed, the macro
2977 ASM_OUTPUT_LABELREF will have to know how to strip this information. */
2978 #ifdef ENCODE_SECTION_INFO
2979 /* A previously-processed constant would already have section info
2983 ENCODE_SECTION_INFO (exp
);
2984 desc
->rtl
= TREE_CST_RTL (exp
);
2985 desc
->label
= XSTR (XEXP (desc
->rtl
, 0), 0);
2989 #ifdef CONSTANT_AFTER_FUNCTION_P
2990 if (current_function_decl
!= 0
2991 && CONSTANT_AFTER_FUNCTION_P (exp
))
2996 && STRING_POOL_ADDRESS_P (XEXP (desc
->rtl
, 0))
2997 && (!defer
|| defer_addressed_constants_flag
|| after_function
))
2999 defstr
= (struct deferred_string
**)
3000 htab_find_slot_with_hash (const_str_htab
, desc
->label
,
3001 STRHASH (desc
->label
), NO_INSERT
);
3004 /* If the string is currently deferred but we need to output it now,
3005 remove it from deferred string hash table. */
3007 labelno
= (*defstr
)->labelno
;
3008 STRING_POOL_ADDRESS_P (XEXP (desc
->rtl
, 0)) = 0;
3009 htab_clear_slot (const_str_htab
, (void **) defstr
);
3013 /* If this is the first time we've seen this particular constant,
3014 output it (or defer its output for later). */
3017 if (defer_addressed_constants_flag
|| after_function
)
3019 struct deferred_constant
*p
;
3020 p
= (struct deferred_constant
*) xmalloc (sizeof (struct deferred_constant
));
3022 p
->exp
= copy_constant (exp
);
3024 p
->labelno
= labelno
;
3027 p
->next
= after_function_constants
;
3028 after_function_constants
= p
;
3032 p
->next
= deferred_constants
;
3033 deferred_constants
= p
;
3038 /* Do no output if -fsyntax-only. */
3039 if (! flag_syntax_only
)
3041 if (TREE_CODE (exp
) != STRING_CST
3043 || flag_writable_strings
3044 || (defstr
= (struct deferred_string
**)
3045 htab_find_slot_with_hash (const_str_htab
,
3047 STRHASH (desc
->label
),
3049 output_constant_def_contents (exp
, reloc
, labelno
);
3052 struct deferred_string
*p
;
3054 p
= (struct deferred_string
*)
3055 xmalloc (sizeof (struct deferred_string
));
3057 p
->exp
= copy_constant (exp
);
3058 p
->label
= desc
->label
;
3059 p
->labelno
= labelno
;
3061 STRING_POOL_ADDRESS_P (XEXP (desc
->rtl
, 0)) = 1;
3067 return TREE_CST_RTL (exp
);
3070 /* Now output assembler code to define the label for EXP,
3071 and follow it with the data of EXP. */
3074 output_constant_def_contents (exp
, reloc
, labelno
)
3081 if (IN_NAMED_SECTION (exp
))
3082 named_section (exp
, NULL
, reloc
);
3085 /* First switch to text section, except for writable strings. */
3086 #ifdef SELECT_SECTION
3087 SELECT_SECTION (exp
, reloc
);
3089 if (((TREE_CODE (exp
) == STRING_CST
) && flag_writable_strings
)
3090 || (flag_pic
&& reloc
))
3093 readonly_data_section ();
3097 /* Align the location counter as required by EXP's data type. */
3098 align
= TYPE_ALIGN (TREE_TYPE (exp
));
3099 #ifdef CONSTANT_ALIGNMENT
3100 align
= CONSTANT_ALIGNMENT (exp
, align
);
3103 if (align
> BITS_PER_UNIT
)
3104 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
3106 /* Output the label itself. */
3107 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LC", labelno
);
3109 /* Output the value of EXP. */
3110 output_constant (exp
,
3111 (TREE_CODE (exp
) == STRING_CST
3112 ? TREE_STRING_LENGTH (exp
)
3113 : int_size_in_bytes (TREE_TYPE (exp
))));
3117 /* Structure to represent sufficient information about a constant so that
3118 it can be output when the constant pool is output, so that function
3119 integration can be done, and to simplify handling on machines that reference
3120 constant pool as base+displacement. */
3122 struct pool_constant
3124 struct constant_descriptor
*desc
;
3125 struct pool_constant
*next
, *next_sym
;
3128 enum machine_mode mode
;
3135 /* Hash code for a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true.
3136 The argument is XSTR (... , 0) */
3138 #define SYMHASH(LABEL) \
3139 ((((unsigned long) (LABEL)) & ((1 << HASHBITS) - 1)) % MAX_RTX_HASH_TABLE)
3141 /* Initialize constant pool hashing for a new function. */
3144 init_varasm_status (f
)
3147 struct varasm_status
*p
;
3148 p
= (struct varasm_status
*) xmalloc (sizeof (struct varasm_status
));
3150 p
->x_const_rtx_hash_table
3151 = ((struct constant_descriptor
**)
3152 xcalloc (MAX_RTX_HASH_TABLE
, sizeof (struct constant_descriptor
*)));
3153 p
->x_const_rtx_sym_hash_table
3154 = ((struct pool_constant
**)
3155 xcalloc (MAX_RTX_HASH_TABLE
, sizeof (struct pool_constant
*)));
3157 p
->x_first_pool
= p
->x_last_pool
= 0;
3158 p
->x_pool_offset
= 0;
3159 p
->x_const_double_chain
= 0;
3162 /* Mark PC for GC. */
3165 mark_pool_constant (pc
)
3166 struct pool_constant
*pc
;
3171 ggc_mark_rtx (pc
->constant
);
3176 /* Mark P for GC. */
3179 mark_varasm_status (p
)
3180 struct varasm_status
*p
;
3185 mark_pool_constant (p
->x_first_pool
);
3186 ggc_mark_rtx (p
->x_const_double_chain
);
3189 /* Clear out all parts of the state in F that can safely be discarded
3190 after the function has been compiled, to let garbage collection
3191 reclaim the memory. */
3194 free_varasm_status (f
)
3197 struct varasm_status
*p
;
3202 /* Clear out the hash tables. */
3203 for (i
= 0; i
< MAX_RTX_HASH_TABLE
; ++i
)
3205 struct constant_descriptor
* cd
;
3207 cd
= p
->x_const_rtx_hash_table
[i
];
3209 struct constant_descriptor
* next
= cd
->next
;
3215 free (p
->x_const_rtx_hash_table
);
3216 free (p
->x_const_rtx_sym_hash_table
);
3222 /* Express an rtx for a constant integer (perhaps symbolic)
3223 as the sum of a symbol or label plus an explicit integer.
3224 They are stored into VALUE. */
3227 decode_rtx_const (mode
, x
, value
)
3228 enum machine_mode mode
;
3230 struct rtx_const
*value
;
3232 /* Clear the whole structure, including any gaps. */
3233 memset (value
, 0, sizeof (struct rtx_const
));
3235 value
->kind
= RTX_INT
; /* Most usual kind. */
3238 switch (GET_CODE (x
))
3241 value
->kind
= RTX_DOUBLE
;
3242 if (GET_MODE (x
) != VOIDmode
)
3244 value
->mode
= GET_MODE (x
);
3245 memcpy ((char *) &value
->un
.du
,
3246 (char *) &CONST_DOUBLE_LOW (x
), sizeof value
->un
.du
);
3250 value
->un
.di
.low
= CONST_DOUBLE_LOW (x
);
3251 value
->un
.di
.high
= CONST_DOUBLE_HIGH (x
);
3256 value
->un
.addr
.offset
= INTVAL (x
);
3262 value
->un
.addr
.base
= x
;
3267 if (GET_CODE (x
) == PLUS
&& GET_CODE (XEXP (x
, 1)) == CONST_INT
)
3269 value
->un
.addr
.base
= XEXP (x
, 0);
3270 value
->un
.addr
.offset
= INTVAL (XEXP (x
, 1));
3272 else if (GET_CODE (x
) == MINUS
&& GET_CODE (XEXP (x
, 1)) == CONST_INT
)
3274 value
->un
.addr
.base
= XEXP (x
, 0);
3275 value
->un
.addr
.offset
= - INTVAL (XEXP (x
, 1));
3279 value
->un
.addr
.base
= x
;
3280 value
->un
.addr
.offset
= 0;
3288 if (value
->kind
== RTX_INT
&& value
->un
.addr
.base
!= 0)
3289 switch (GET_CODE (value
->un
.addr
.base
))
3292 /* Use the string's address, not the SYMBOL_REF's address,
3293 for the sake of addresses of library routines. */
3294 value
->un
.addr
.base
= (rtx
) XSTR (value
->un
.addr
.base
, 0);
3298 /* For a LABEL_REF, compare labels. */
3299 value
->un
.addr
.base
= XEXP (value
->un
.addr
.base
, 0);
3306 /* Given a MINUS expression, simplify it if both sides
3307 include the same symbol. */
3310 simplify_subtraction (x
)
3313 struct rtx_const val0
, val1
;
3315 decode_rtx_const (GET_MODE (x
), XEXP (x
, 0), &val0
);
3316 decode_rtx_const (GET_MODE (x
), XEXP (x
, 1), &val1
);
3318 if (val0
.un
.addr
.base
== val1
.un
.addr
.base
)
3319 return GEN_INT (val0
.un
.addr
.offset
- val1
.un
.addr
.offset
);
3323 /* Compute a hash code for a constant RTL expression. */
3326 const_hash_rtx (mode
, x
)
3327 enum machine_mode mode
;
3333 struct rtx_const value
;
3334 decode_rtx_const (mode
, x
, &value
);
3336 /* Compute hashing function */
3338 for (i
= 0; i
< sizeof value
/ sizeof (int); i
++)
3339 hi
+= ((int *) &value
)[i
];
3341 hi
&= (1 << HASHBITS
) - 1;
3342 hi
%= MAX_RTX_HASH_TABLE
;
3346 /* Compare a constant rtl object X with a constant-descriptor DESC.
3347 Return 1 if DESC describes a constant with the same value as X. */
3350 compare_constant_rtx (mode
, x
, desc
)
3351 enum machine_mode mode
;
3353 struct constant_descriptor
*desc
;
3355 register int *p
= (int *) desc
->u
.contents
;
3358 struct rtx_const value
;
3360 decode_rtx_const (mode
, x
, &value
);
3361 strp
= (int *) &value
;
3362 len
= sizeof value
/ sizeof (int);
3364 /* Compare constant contents. */
3366 if (*p
++ != *strp
++)
3372 /* Construct a constant descriptor for the rtl-expression X.
3373 It is up to the caller to enter the descriptor in the hash table. */
3375 static struct constant_descriptor
*
3376 record_constant_rtx (mode
, x
)
3377 enum machine_mode mode
;
3380 struct constant_descriptor
*ptr
;
3382 ptr
= ((struct constant_descriptor
*)
3383 xcalloc (1, (offsetof (struct constant_descriptor
, u
)
3384 + sizeof (struct rtx_const
))));
3385 decode_rtx_const (mode
, x
, (struct rtx_const
*) ptr
->u
.contents
);
3390 /* Given a constant rtx X, make (or find) a memory constant for its value
3391 and return a MEM rtx to refer to it in memory. */
3394 force_const_mem (mode
, x
)
3395 enum machine_mode mode
;
3399 register struct constant_descriptor
*desc
;
3401 const char *found
= 0;
3404 /* If we want this CONST_DOUBLE in the same mode as it is in memory
3405 (this will always be true for floating CONST_DOUBLEs that have been
3406 placed in memory, but not for VOIDmode (integer) CONST_DOUBLEs),
3407 use the previous copy. Otherwise, make a new one. Note that in
3408 the unlikely event that this same CONST_DOUBLE is used in two different
3409 modes in an alternating fashion, we will allocate a lot of different
3410 memory locations, but this should be extremely rare. */
3412 if (GET_CODE (x
) == CONST_DOUBLE
3413 && GET_CODE (CONST_DOUBLE_MEM (x
)) == MEM
3414 && GET_MODE (CONST_DOUBLE_MEM (x
)) == mode
)
3415 return CONST_DOUBLE_MEM (x
);
3417 /* Compute hash code of X. Search the descriptors for that hash code
3418 to see if any of them describes X. If yes, the descriptor records
3419 the label number already assigned. */
3421 hash
= const_hash_rtx (mode
, x
);
3423 for (desc
= const_rtx_hash_table
[hash
]; desc
; desc
= desc
->next
)
3424 if (compare_constant_rtx (mode
, x
, desc
))
3426 found
= desc
->label
;
3432 register struct pool_constant
*pool
;
3435 /* No constant equal to X is known to have been output.
3436 Make a constant descriptor to enter X in the hash table.
3437 Assign the label number and record it in the descriptor for
3438 future calls to this function to find. */
3440 desc
= record_constant_rtx (mode
, x
);
3441 desc
->next
= const_rtx_hash_table
[hash
];
3442 const_rtx_hash_table
[hash
] = desc
;
3444 /* Align the location counter as required by EXP's data type. */
3445 align
= (mode
== VOIDmode
) ? UNITS_PER_WORD
: GET_MODE_SIZE (mode
);
3446 if (align
> BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
3447 align
= BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
;
3448 #ifdef CONSTANT_ALIGNMENT
3449 align
= CONSTANT_ALIGNMENT (make_tree (type_for_mode (mode
, 0), x
),
3450 align
* BITS_PER_UNIT
) / BITS_PER_UNIT
;
3453 pool_offset
+= align
- 1;
3454 pool_offset
&= ~ (align
- 1);
3456 if (GET_CODE (x
) == LABEL_REF
)
3457 LABEL_PRESERVE_P (XEXP (x
, 0)) = 1;
3459 /* Allocate a pool constant descriptor, fill it in, and chain it in. */
3461 pool
= (struct pool_constant
*) ggc_alloc (sizeof (struct pool_constant
));
3465 pool
->labelno
= const_labelno
;
3466 pool
->align
= align
;
3467 pool
->offset
= pool_offset
;
3474 last_pool
->next
= pool
;
3477 pool_offset
+= GET_MODE_SIZE (mode
);
3479 /* Create a string containing the label name, in LABEL. */
3480 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
3484 desc
->label
= found
= ggc_strdup (label
);
3486 /* Add label to symbol hash table. */
3487 hash
= SYMHASH (found
);
3488 pool
->label
= found
;
3489 pool
->next_sym
= const_rtx_sym_hash_table
[hash
];
3490 const_rtx_sym_hash_table
[hash
] = pool
;
3493 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
3495 def
= gen_rtx_MEM (mode
, gen_rtx_SYMBOL_REF (Pmode
, found
));
3496 set_mem_attributes (def
, type_for_mode (mode
, 0), 1);
3497 RTX_UNCHANGING_P (def
) = 1;
3499 /* Mark the symbol_ref as belonging to this constants pool. */
3500 CONSTANT_POOL_ADDRESS_P (XEXP (def
, 0)) = 1;
3501 current_function_uses_const_pool
= 1;
3503 if (GET_CODE (x
) == CONST_DOUBLE
)
3505 if (CONST_DOUBLE_MEM (x
) == cc0_rtx
)
3507 CONST_DOUBLE_CHAIN (x
) = const_double_chain
;
3508 const_double_chain
= x
;
3510 CONST_DOUBLE_MEM (x
) = def
;
3516 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
3517 the corresponding pool_constant structure. */
3519 static struct pool_constant
*
3520 find_pool_constant (f
, addr
)
3524 struct pool_constant
*pool
;
3525 const char *label
= XSTR (addr
, 0);
3527 for (pool
= f
->varasm
->x_const_rtx_sym_hash_table
[SYMHASH (label
)]; pool
;
3528 pool
= pool
->next_sym
)
3529 if (pool
->label
== label
)
3535 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
3538 get_pool_constant (addr
)
3541 return (find_pool_constant (cfun
, addr
))->constant
;
3544 /* Likewise, but for the constant pool of a specific function. */
3547 get_pool_constant_for_function (f
, addr
)
3551 return (find_pool_constant (f
, addr
))->constant
;
3554 /* Similar, return the mode. */
3557 get_pool_mode (addr
)
3560 return (find_pool_constant (cfun
, addr
))->mode
;
3564 get_pool_mode_for_function (f
, addr
)
3568 return (find_pool_constant (f
, addr
))->mode
;
3571 /* Similar, return the offset in the constant pool. */
3574 get_pool_offset (addr
)
3577 return (find_pool_constant (cfun
, addr
))->offset
;
3580 /* Return the size of the constant pool. */
3588 /* Write all the constants in the constant pool. */
3591 output_constant_pool (fnname
, fndecl
)
3592 const char *fnname ATTRIBUTE_UNUSED
;
3593 tree fndecl ATTRIBUTE_UNUSED
;
3595 struct pool_constant
*pool
;
3597 union real_extract u
;
3599 /* It is possible for gcc to call force_const_mem and then to later
3600 discard the instructions which refer to the constant. In such a
3601 case we do not need to output the constant. */
3602 mark_constant_pool ();
3604 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3605 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3608 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3617 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3618 whose CODE_LABEL has been deleted. This can occur if a jump table
3619 is eliminated by optimization. If so, write a constant of zero
3620 instead. Note that this can also happen by turning the
3621 CODE_LABEL into a NOTE. */
3622 /* ??? This seems completely and utterly wrong. Certainly it's
3623 not true for NOTE_INSN_DELETED_LABEL, but I disbelieve proper
3624 functioning even with INSN_DELETED_P and friends. */
3627 switch (GET_CODE (x
))
3630 if (GET_CODE (XEXP (x
, 0)) != PLUS
3631 || GET_CODE (XEXP (XEXP (x
, 0), 0)) != LABEL_REF
)
3633 tmp
= XEXP (XEXP (x
, 0), 0);
3638 if (INSN_DELETED_P (tmp
)
3639 || (GET_CODE (tmp
) == NOTE
3640 && NOTE_LINE_NUMBER (tmp
) == NOTE_INSN_DELETED
))
3651 /* First switch to correct section. */
3652 #ifdef SELECT_RTX_SECTION
3653 SELECT_RTX_SECTION (pool
->mode
, x
);
3655 readonly_data_section ();
3658 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3659 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file
, x
, pool
->mode
,
3660 pool
->align
, pool
->labelno
, done
);
3663 if (pool
->align
> 1)
3664 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (pool
->align
));
3666 /* Output the label. */
3667 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LC", pool
->labelno
);
3669 /* Output the value of the constant itself. */
3670 switch (GET_MODE_CLASS (pool
->mode
))
3673 if (GET_CODE (x
) != CONST_DOUBLE
)
3676 memcpy ((char *) &u
, (char *) &CONST_DOUBLE_LOW (x
), sizeof u
);
3677 assemble_real (u
.d
, pool
->mode
);
3681 case MODE_PARTIAL_INT
:
3682 assemble_integer (x
, GET_MODE_SIZE (pool
->mode
), 1);
3689 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3695 #ifdef ASM_OUTPUT_POOL_EPILOGUE
3696 ASM_OUTPUT_POOL_EPILOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3699 /* Done with this pool. */
3700 first_pool
= last_pool
= 0;
3703 /* Look through the instructions for this function, and mark all the
3704 entries in the constant pool which are actually being used.
3705 Emit used deferred strings. */
3708 mark_constant_pool ()
3711 struct pool_constant
*pool
;
3713 if (first_pool
== 0 && htab_elements (const_str_htab
) == 0)
3716 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3719 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
3721 mark_constants (PATTERN (insn
));
3723 for (insn
= current_function_epilogue_delay_list
;
3725 insn
= XEXP (insn
, 1))
3727 mark_constants (PATTERN (insn
));
3730 /* Look through appropriate parts of X, marking all entries in the
3731 constant pool which are actually being used. Entries that are only
3732 referenced by other constants are also marked as used. Emit
3733 deferred strings that are used. */
3740 register const char *format_ptr
;
3745 if (GET_CODE (x
) == SYMBOL_REF
)
3747 mark_constant (&x
, NULL
);
3750 /* Never search inside a CONST_DOUBLE, because CONST_DOUBLE_MEM may be
3751 a MEM, but does not constitute a use of that MEM. */
3752 else if (GET_CODE (x
) == CONST_DOUBLE
)
3755 /* Insns may appear inside a SEQUENCE. Only check the patterns of
3756 insns, not any notes that may be attached. We don't want to mark
3757 a constant just because it happens to appear in a REG_EQUIV note. */
3760 mark_constants (PATTERN (x
));
3764 format_ptr
= GET_RTX_FORMAT (GET_CODE (x
));
3766 for (i
= 0; i
< GET_RTX_LENGTH (GET_CODE (x
)); i
++)
3768 switch (*format_ptr
++)
3771 mark_constants (XEXP (x
, i
));
3775 if (XVEC (x
, i
) != 0)
3779 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
3780 mark_constants (XVECEXP (x
, i
, j
));
3799 /* Given a SYMBOL_REF CURRENT_RTX, mark it and all constants it refers
3800 to as used. Emit referenced deferred strings. This function can
3801 be used with for_each_rtx () to mark all SYMBOL_REFs in an rtx. */
3804 mark_constant (current_rtx
, data
)
3806 void *data ATTRIBUTE_UNUSED
;
3808 rtx x
= *current_rtx
;
3812 else if (GET_CODE(x
) == CONST_DOUBLE
)
3813 /* Never search inside a CONST_DOUBLE because CONST_DOUBLE_MEM may
3814 be a MEM but does not constitute a use of that MEM. */
3816 else if (GET_CODE (x
) == SYMBOL_REF
)
3818 if (CONSTANT_POOL_ADDRESS_P (x
))
3820 struct pool_constant
*pool
= find_pool_constant (cfun
, x
);
3821 if (pool
->mark
== 0) {
3823 for_each_rtx (&(pool
->constant
), &mark_constant
, NULL
);
3828 else if (STRING_POOL_ADDRESS_P (x
))
3830 struct deferred_string
**defstr
;
3832 defstr
= (struct deferred_string
**)
3833 htab_find_slot_with_hash (const_str_htab
, XSTR (x
, 0),
3834 STRHASH (XSTR (x
, 0)), NO_INSERT
);
3837 struct deferred_string
*p
= *defstr
;
3839 STRING_POOL_ADDRESS_P (x
) = 0;
3840 output_constant_def_contents (p
->exp
, 0, p
->labelno
);
3841 htab_clear_slot (const_str_htab
, (void **) defstr
);
3848 /* Find all the constants whose addresses are referenced inside of EXP,
3849 and make sure assembler code with a label has been output for each one.
3850 Indicate whether an ADDR_EXPR has been encountered. */
3853 output_addressed_constants (exp
)
3858 /* Give the front-end a chance to convert VALUE to something that
3859 looks more like a constant to the back-end. */
3860 if (lang_expand_constant
)
3861 exp
= (*lang_expand_constant
) (exp
);
3863 switch (TREE_CODE (exp
))
3867 register tree constant
= TREE_OPERAND (exp
, 0);
3869 while (TREE_CODE (constant
) == COMPONENT_REF
)
3871 constant
= TREE_OPERAND (constant
, 0);
3874 if (TREE_CODE_CLASS (TREE_CODE (constant
)) == 'c'
3875 || TREE_CODE (constant
) == CONSTRUCTOR
)
3876 /* No need to do anything here
3877 for addresses of variables or functions. */
3878 output_constant_def (constant
, 0);
3885 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
3886 reloc
|= output_addressed_constants (TREE_OPERAND (exp
, 1));
3891 case NON_LVALUE_EXPR
:
3892 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
3898 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
3899 if (TREE_VALUE (link
) != 0)
3900 reloc
|= output_addressed_constants (TREE_VALUE (link
));
3910 /* Return nonzero if VALUE is a valid constant-valued expression
3911 for use in initializing a static variable; one that can be an
3912 element of a "constant" initializer.
3914 Return null_pointer_node if the value is absolute;
3915 if it is relocatable, return the variable that determines the relocation.
3916 We assume that VALUE has been folded as much as possible;
3917 therefore, we do not need to check for such things as
3918 arithmetic-combinations of integers. */
3921 initializer_constant_valid_p (value
, endtype
)
3925 /* Give the front-end a chance to convert VALUE to something that
3926 looks more like a constant to the back-end. */
3927 if (lang_expand_constant
)
3928 value
= (*lang_expand_constant
) (value
);
3930 switch (TREE_CODE (value
))
3933 if ((TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
3934 || TREE_CODE (TREE_TYPE (value
)) == RECORD_TYPE
)
3935 && TREE_CONSTANT (value
)
3936 && CONSTRUCTOR_ELTS (value
))
3938 initializer_constant_valid_p (TREE_VALUE (CONSTRUCTOR_ELTS (value
)),
3941 return TREE_STATIC (value
) ? null_pointer_node
: 0;
3947 return null_pointer_node
;
3950 return staticp (TREE_OPERAND (value
, 0)) ? TREE_OPERAND (value
, 0) : 0;
3952 case NON_LVALUE_EXPR
:
3953 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3957 /* Allow conversions between pointer types. */
3958 if (POINTER_TYPE_P (TREE_TYPE (value
))
3959 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3960 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3962 /* Allow conversions between real types. */
3963 if (FLOAT_TYPE_P (TREE_TYPE (value
))
3964 && FLOAT_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3965 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3967 /* Allow length-preserving conversions between integer types. */
3968 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
3969 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
3970 && (TYPE_PRECISION (TREE_TYPE (value
))
3971 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
3972 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3974 /* Allow conversions between other integer types only if
3976 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
3977 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3979 tree inner
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3981 if (inner
== null_pointer_node
)
3982 return null_pointer_node
;
3986 /* Allow (int) &foo provided int is as wide as a pointer. */
3987 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
3988 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
3989 && (TYPE_PRECISION (TREE_TYPE (value
))
3990 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
3991 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3994 /* Likewise conversions from int to pointers, but also allow
3995 conversions from 0. */
3996 if (POINTER_TYPE_P (TREE_TYPE (value
))
3997 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3999 if (integer_zerop (TREE_OPERAND (value
, 0)))
4000 return null_pointer_node
;
4001 else if (TYPE_PRECISION (TREE_TYPE (value
))
4002 <= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0))))
4003 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4007 /* Allow conversions to union types if the value inside is okay. */
4008 if (TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
)
4009 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4014 if (! INTEGRAL_TYPE_P (endtype
)
4015 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
4017 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4019 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
4021 /* If either term is absolute, use the other terms relocation. */
4022 if (valid0
== null_pointer_node
)
4024 if (valid1
== null_pointer_node
)
4030 if (! INTEGRAL_TYPE_P (endtype
)
4031 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
4033 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4035 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
4037 /* Win if second argument is absolute. */
4038 if (valid1
== null_pointer_node
)
4040 /* Win if both arguments have the same relocation.
4041 Then the value is absolute. */
4042 if (valid0
== valid1
&& valid0
!= 0)
4043 return null_pointer_node
;
4045 /* Since GCC guarantees that string constants are unique in the
4046 generated code, a subtraction between two copies of the same
4047 constant string is absolute. */
4048 if (valid0
&& TREE_CODE (valid0
) == STRING_CST
&&
4049 valid1
&& TREE_CODE (valid1
) == STRING_CST
&&
4050 TREE_STRING_POINTER (valid0
) == TREE_STRING_POINTER (valid1
))
4051 return null_pointer_node
;
4054 /* Support differences between labels. */
4055 if (INTEGRAL_TYPE_P (endtype
))
4058 op0
= TREE_OPERAND (value
, 0);
4059 op1
= TREE_OPERAND (value
, 1);
4063 if (TREE_CODE (op0
) == ADDR_EXPR
4064 && TREE_CODE (TREE_OPERAND (op0
, 0)) == LABEL_DECL
4065 && TREE_CODE (op1
) == ADDR_EXPR
4066 && TREE_CODE (TREE_OPERAND (op1
, 0)) == LABEL_DECL
)
4067 return null_pointer_node
;
4078 /* Output assembler code for constant EXP to FILE, with no label.
4079 This includes the pseudo-op such as ".int" or ".byte", and a newline.
4080 Assumes output_addressed_constants has been done on EXP already.
4082 Generate exactly SIZE bytes of assembler data, padding at the end
4083 with zeros if necessary. SIZE must always be specified.
4085 SIZE is important for structure constructors,
4086 since trailing members may have been omitted from the constructor.
4087 It is also important for initialization of arrays from string constants
4088 since the full length of the string constant might not be wanted.
4089 It is also needed for initialization of unions, where the initializer's
4090 type is just one member, and that may not be as long as the union.
4092 There a case in which we would fail to output exactly SIZE bytes:
4093 for a structure constructor that wants to produce more than SIZE bytes.
4094 But such constructors will never be generated for any possible input. */
4097 output_constant (exp
, size
)
4101 register enum tree_code code
= TREE_CODE (TREE_TYPE (exp
));
4103 /* Some front-ends use constants other than the standard
4104 language-indepdent varieties, but which may still be output
4105 directly. Give the front-end a chance to convert EXP to a
4106 language-independent representation. */
4107 if (lang_expand_constant
)
4109 exp
= (*lang_expand_constant
) (exp
);
4110 code
= TREE_CODE (TREE_TYPE (exp
));
4113 if (size
== 0 || flag_syntax_only
)
4116 /* Eliminate the NON_LVALUE_EXPR_EXPR that makes a cast not be an lvalue.
4117 That way we get the constant (we hope) inside it. Also, strip off any
4118 NOP_EXPR that converts between two record, union, array, or set types
4119 or a CONVERT_EXPR that converts to a union TYPE. */
4120 while ((TREE_CODE (exp
) == NOP_EXPR
4121 && (TREE_TYPE (exp
) == TREE_TYPE (TREE_OPERAND (exp
, 0))
4122 || AGGREGATE_TYPE_P (TREE_TYPE (exp
))))
4123 || (TREE_CODE (exp
) == CONVERT_EXPR
4124 && code
== UNION_TYPE
)
4125 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
4127 exp
= TREE_OPERAND (exp
, 0);
4128 code
= TREE_CODE (TREE_TYPE (exp
));
4131 /* Allow a constructor with no elements for any data type.
4132 This means to fill the space with zeros. */
4133 if (TREE_CODE (exp
) == CONSTRUCTOR
&& CONSTRUCTOR_ELTS (exp
) == 0)
4135 assemble_zeros (size
);
4146 case REFERENCE_TYPE
:
4147 /* ??? What about (int)((float)(int)&foo + 4) */
4148 while (TREE_CODE (exp
) == NOP_EXPR
|| TREE_CODE (exp
) == CONVERT_EXPR
4149 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
4150 exp
= TREE_OPERAND (exp
, 0);
4152 if (! assemble_integer (expand_expr (exp
, NULL_RTX
, VOIDmode
,
4153 EXPAND_INITIALIZER
),
4155 error ("initializer for integer value is too complicated");
4160 if (TREE_CODE (exp
) != REAL_CST
)
4161 error ("initializer for floating value is not a floating constant");
4163 assemble_real (TREE_REAL_CST (exp
),
4164 mode_for_size (size
* BITS_PER_UNIT
, MODE_FLOAT
, 0));
4169 output_constant (TREE_REALPART (exp
), size
/ 2);
4170 output_constant (TREE_IMAGPART (exp
), size
/ 2);
4171 size
-= (size
/ 2) * 2;
4175 if (TREE_CODE (exp
) == CONSTRUCTOR
)
4177 output_constructor (exp
, size
);
4180 else if (TREE_CODE (exp
) == STRING_CST
)
4184 if (size
> TREE_STRING_LENGTH (exp
))
4186 excess
= size
- TREE_STRING_LENGTH (exp
);
4187 size
= TREE_STRING_LENGTH (exp
);
4190 assemble_string (TREE_STRING_POINTER (exp
), size
);
4199 if (TREE_CODE (exp
) == CONSTRUCTOR
)
4200 output_constructor (exp
, size
);
4206 if (TREE_CODE (exp
) == INTEGER_CST
)
4207 assemble_integer (expand_expr (exp
, NULL_RTX
,
4208 VOIDmode
, EXPAND_INITIALIZER
),
4210 else if (TREE_CODE (exp
) == CONSTRUCTOR
)
4212 unsigned char *buffer
= (unsigned char *) alloca (size
);
4213 if (get_set_constructor_bytes (exp
, buffer
, size
))
4215 assemble_string ((char *) buffer
, size
);
4218 error ("unknown set constructor type");
4226 assemble_zeros (size
);
4230 /* Subroutine of output_constructor, used for computing the size of
4231 arrays of unspecified length. VAL must be a CONSTRUCTOR of an array
4232 type with an unspecified upper bound. */
4234 static unsigned HOST_WIDE_INT
4235 array_size_for_constructor (val
)
4240 max_index
= NULL_TREE
;
4241 for (i
= CONSTRUCTOR_ELTS (val
); i
; i
= TREE_CHAIN (i
))
4243 tree index
= TREE_PURPOSE (i
);
4245 if (TREE_CODE (index
) == RANGE_EXPR
)
4246 index
= TREE_OPERAND (index
, 1);
4247 if (max_index
== NULL_TREE
|| tree_int_cst_lt (max_index
, index
))
4251 if (max_index
== NULL_TREE
)
4254 /* Compute the total number of array elements. */
4255 i
= size_binop (MINUS_EXPR
, convert (sizetype
, max_index
),
4257 TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (val
)))));
4258 i
= size_binop (PLUS_EXPR
, i
, convert (sizetype
, integer_one_node
));
4260 /* Multiply by the array element unit size to find number of bytes. */
4261 i
= size_binop (MULT_EXPR
, i
, TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (val
))));
4263 return tree_low_cst (i
, 1);
4266 /* Subroutine of output_constant, used for CONSTRUCTORs (aggregate constants).
4267 Generate at least SIZE bytes, padding if necessary. */
4270 output_constructor (exp
, size
)
4274 tree type
= TREE_TYPE (exp
);
4275 register tree link
, field
= 0;
4277 /* Number of bytes output or skipped so far.
4278 In other words, current position within the constructor. */
4279 HOST_WIDE_INT total_bytes
= 0;
4280 /* Non-zero means BYTE contains part of a byte, to be output. */
4281 int byte_buffer_in_use
= 0;
4282 register int byte
= 0;
4284 if (HOST_BITS_PER_WIDE_INT
< BITS_PER_UNIT
)
4287 if (TREE_CODE (type
) == RECORD_TYPE
)
4288 field
= TYPE_FIELDS (type
);
4290 if (TREE_CODE (type
) == ARRAY_TYPE
4291 && TYPE_DOMAIN (type
) != 0)
4292 min_index
= TYPE_MIN_VALUE (TYPE_DOMAIN (type
));
4294 /* As LINK goes through the elements of the constant,
4295 FIELD goes through the structure fields, if the constant is a structure.
4296 if the constant is a union, then we override this,
4297 by getting the field from the TREE_LIST element.
4298 But the constant could also be an array. Then FIELD is zero.
4300 There is always a maximum of one element in the chain LINK for unions
4301 (even if the initializer in a source program incorrectly contains
4303 for (link
= CONSTRUCTOR_ELTS (exp
);
4305 link
= TREE_CHAIN (link
),
4306 field
= field
? TREE_CHAIN (field
) : 0)
4308 tree val
= TREE_VALUE (link
);
4311 /* The element in a union constructor specifies the proper field
4313 if ((TREE_CODE (type
) == RECORD_TYPE
|| TREE_CODE (type
) == UNION_TYPE
4314 || TREE_CODE (type
) == QUAL_UNION_TYPE
)
4315 && TREE_PURPOSE (link
) != 0)
4316 field
= TREE_PURPOSE (link
);
4318 else if (TREE_CODE (type
) == ARRAY_TYPE
)
4319 index
= TREE_PURPOSE (link
);
4321 /* Eliminate the marker that makes a cast not be an lvalue. */
4325 if (index
&& TREE_CODE (index
) == RANGE_EXPR
)
4327 unsigned HOST_WIDE_INT fieldsize
4328 = int_size_in_bytes (TREE_TYPE (type
));
4329 HOST_WIDE_INT lo_index
= tree_low_cst (TREE_OPERAND (index
, 0), 0);
4330 HOST_WIDE_INT hi_index
= tree_low_cst (TREE_OPERAND (index
, 1), 0);
4331 HOST_WIDE_INT index
;
4333 for (index
= lo_index
; index
<= hi_index
; index
++)
4335 /* Output the element's initial value. */
4337 assemble_zeros (fieldsize
);
4339 output_constant (val
, fieldsize
);
4341 /* Count its size. */
4342 total_bytes
+= fieldsize
;
4345 else if (field
== 0 || !DECL_BIT_FIELD (field
))
4347 /* An element that is not a bit-field. */
4349 unsigned HOST_WIDE_INT fieldsize
;
4350 /* Since this structure is static,
4351 we know the positions are constant. */
4352 HOST_WIDE_INT pos
= field
? int_byte_position (field
) : 0;
4355 pos
= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (val
)), 1)
4356 * (tree_low_cst (index
, 0) - tree_low_cst (min_index
, 0)));
4358 /* Output any buffered-up bit-fields preceding this element. */
4359 if (byte_buffer_in_use
)
4361 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4363 byte_buffer_in_use
= 0;
4366 /* Advance to offset of this element.
4367 Note no alignment needed in an array, since that is guaranteed
4368 if each element has the proper size. */
4369 if ((field
!= 0 || index
!= 0) && pos
!= total_bytes
)
4371 assemble_zeros (pos
- total_bytes
);
4375 else if (field
!= 0 && DECL_PACKED (field
))
4376 /* Some assemblers automaticallly align a datum according to its
4377 size if no align directive is specified. The datum, however,
4378 may be declared with 'packed' attribute, so we have to disable
4380 ASM_OUTPUT_ALIGN (asm_out_file
, 0);
4382 /* Determine size this element should occupy. */
4387 /* If this is an array with an unspecified upper bound,
4388 the initializer determines the size. */
4389 /* ??? This ought to only checked if DECL_SIZE_UNIT is NULL,
4390 but we cannot do this until the deprecated support for
4391 initializing zero-length array members is removed. */
4392 if (TREE_CODE (TREE_TYPE (field
)) == ARRAY_TYPE
4393 && TYPE_DOMAIN (TREE_TYPE (field
))
4394 && ! TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (field
))))
4396 fieldsize
= array_size_for_constructor (val
);
4397 /* Given a non-empty initialization, this field had
4399 if (fieldsize
!= 0 && TREE_CHAIN (field
) != NULL_TREE
)
4402 else if (DECL_SIZE_UNIT (field
))
4404 /* ??? This can't be right. If the decl size overflows
4405 a host integer we will silently emit no data. */
4406 if (host_integerp (DECL_SIZE_UNIT (field
), 1))
4407 fieldsize
= tree_low_cst (DECL_SIZE_UNIT (field
), 1);
4411 fieldsize
= int_size_in_bytes (TREE_TYPE (type
));
4413 /* Output the element's initial value. */
4415 assemble_zeros (fieldsize
);
4417 output_constant (val
, fieldsize
);
4419 /* Count its size. */
4420 total_bytes
+= fieldsize
;
4422 else if (val
!= 0 && TREE_CODE (val
) != INTEGER_CST
)
4423 error ("invalid initial value for member `%s'",
4424 IDENTIFIER_POINTER (DECL_NAME (field
)));
4427 /* Element that is a bit-field. */
4429 HOST_WIDE_INT next_offset
= int_bit_position (field
);
4430 HOST_WIDE_INT end_offset
4431 = (next_offset
+ tree_low_cst (DECL_SIZE (field
), 1));
4434 val
= integer_zero_node
;
4436 /* If this field does not start in this (or, next) byte,
4438 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4440 /* Output remnant of any bit field in previous bytes. */
4441 if (byte_buffer_in_use
)
4443 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4445 byte_buffer_in_use
= 0;
4448 /* If still not at proper byte, advance to there. */
4449 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4451 assemble_zeros (next_offset
/ BITS_PER_UNIT
- total_bytes
);
4452 total_bytes
= next_offset
/ BITS_PER_UNIT
;
4456 if (! byte_buffer_in_use
)
4459 /* We must split the element into pieces that fall within
4460 separate bytes, and combine each byte with previous or
4461 following bit-fields. */
4463 /* next_offset is the offset n fbits from the beginning of
4464 the structure to the next bit of this element to be processed.
4465 end_offset is the offset of the first bit past the end of
4467 while (next_offset
< end_offset
)
4471 HOST_WIDE_INT value
;
4472 HOST_WIDE_INT next_byte
= next_offset
/ BITS_PER_UNIT
;
4473 HOST_WIDE_INT next_bit
= next_offset
% BITS_PER_UNIT
;
4475 /* Advance from byte to byte
4476 within this element when necessary. */
4477 while (next_byte
!= total_bytes
)
4479 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4484 /* Number of bits we can process at once
4485 (all part of the same byte). */
4486 this_time
= MIN (end_offset
- next_offset
,
4487 BITS_PER_UNIT
- next_bit
);
4488 if (BYTES_BIG_ENDIAN
)
4490 /* On big-endian machine, take the most significant bits
4491 first (of the bits that are significant)
4492 and put them into bytes from the most significant end. */
4493 shift
= end_offset
- next_offset
- this_time
;
4495 /* Don't try to take a bunch of bits that cross
4496 the word boundary in the INTEGER_CST. We can
4497 only select bits from the LOW or HIGH part
4499 if (shift
< HOST_BITS_PER_WIDE_INT
4500 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4502 this_time
= shift
+ this_time
- HOST_BITS_PER_WIDE_INT
;
4503 shift
= HOST_BITS_PER_WIDE_INT
;
4506 /* Now get the bits from the appropriate constant word. */
4507 if (shift
< HOST_BITS_PER_WIDE_INT
)
4508 value
= TREE_INT_CST_LOW (val
);
4509 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4511 value
= TREE_INT_CST_HIGH (val
);
4512 shift
-= HOST_BITS_PER_WIDE_INT
;
4517 /* Get the result. This works only when:
4518 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4519 byte
|= (((value
>> shift
)
4520 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4521 << (BITS_PER_UNIT
- this_time
- next_bit
));
4525 /* On little-endian machines,
4526 take first the least significant bits of the value
4527 and pack them starting at the least significant
4528 bits of the bytes. */
4529 shift
= next_offset
- int_bit_position (field
);
4531 /* Don't try to take a bunch of bits that cross
4532 the word boundary in the INTEGER_CST. We can
4533 only select bits from the LOW or HIGH part
4535 if (shift
< HOST_BITS_PER_WIDE_INT
4536 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4537 this_time
= (HOST_BITS_PER_WIDE_INT
- shift
);
4539 /* Now get the bits from the appropriate constant word. */
4540 if (shift
< HOST_BITS_PER_WIDE_INT
)
4541 value
= TREE_INT_CST_LOW (val
);
4542 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4544 value
= TREE_INT_CST_HIGH (val
);
4545 shift
-= HOST_BITS_PER_WIDE_INT
;
4550 /* Get the result. This works only when:
4551 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4552 byte
|= (((value
>> shift
)
4553 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4557 next_offset
+= this_time
;
4558 byte_buffer_in_use
= 1;
4563 if (byte_buffer_in_use
)
4565 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4569 if (total_bytes
< size
)
4570 assemble_zeros (size
- total_bytes
);
4573 #ifdef HANDLE_PRAGMA_WEAK
4574 /* Add function NAME to the weak symbols list. VALUE is a weak alias
4575 associatd with NAME. */
4578 add_weak (name
, value
)
4582 struct weak_syms
*weak
;
4584 weak
= (struct weak_syms
*) permalloc (sizeof (struct weak_syms
));
4589 weak
->next
= weak_decls
;
4591 weak
->value
= value
;
4596 #endif /* HANDLE_PRAGMA_WEAK */
4598 /* Declare DECL to be a weak symbol. */
4604 if (! TREE_PUBLIC (decl
))
4605 error_with_decl (decl
, "weak declaration of `%s' must be public");
4606 else if (TREE_ASM_WRITTEN (decl
))
4607 error_with_decl (decl
, "weak declaration of `%s' must precede definition");
4608 else if (SUPPORTS_WEAK
)
4609 DECL_WEAK (decl
) = 1;
4610 #ifdef HANDLE_PRAGMA_WEAK
4611 add_weak (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)), NULL
);
4615 /* Emit any pending weak declarations. */
4617 #ifdef HANDLE_PRAGMA_WEAK
4618 struct weak_syms
* weak_decls
;
4624 #ifdef HANDLE_PRAGMA_WEAK
4625 if (HANDLE_PRAGMA_WEAK
)
4627 struct weak_syms
*t
;
4628 for (t
= weak_decls
; t
; t
= t
->next
)
4631 ASM_OUTPUT_WEAK_ALIAS (asm_out_file
, t
->name
, t
->value
);
4637 /* Remove NAME from the pending list of weak symbols. This prevents
4638 the compiler from emitting multiple .weak directives which confuses
4640 #ifdef ASM_WEAKEN_LABEL
4642 remove_from_pending_weak_list (name
)
4643 const char *name ATTRIBUTE_UNUSED
;
4645 #ifdef HANDLE_PRAGMA_WEAK
4646 if (HANDLE_PRAGMA_WEAK
)
4648 struct weak_syms
*t
;
4649 for (t
= weak_decls
; t
; t
= t
->next
)
4651 if (t
->name
&& strcmp (name
, t
->name
) == 0)
4660 assemble_alias (decl
, target
)
4661 tree decl
, target ATTRIBUTE_UNUSED
;
4665 /* We must force creation of DECL_RTL for debug info generation, even though
4666 we don't use it here. */
4667 make_decl_rtl (decl
, NULL
);
4669 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
4671 #ifdef ASM_OUTPUT_DEF
4672 /* Make name accessible from other files, if appropriate. */
4674 if (TREE_PUBLIC (decl
))
4676 #ifdef ASM_WEAKEN_LABEL
4677 if (DECL_WEAK (decl
))
4679 ASM_WEAKEN_LABEL (asm_out_file
, name
);
4680 /* Remove this function from the pending weak list so that
4681 we do not emit multiple .weak directives for it. */
4682 remove_from_pending_weak_list
4683 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
4687 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
4690 #ifdef ASM_OUTPUT_DEF_FROM_DECLS
4691 ASM_OUTPUT_DEF_FROM_DECLS (asm_out_file
, decl
, target
);
4693 ASM_OUTPUT_DEF (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4695 TREE_ASM_WRITTEN (decl
) = 1;
4697 #ifdef ASM_OUTPUT_WEAK_ALIAS
4698 if (! DECL_WEAK (decl
))
4699 warning ("only weak aliases are supported in this configuration");
4701 ASM_OUTPUT_WEAK_ALIAS (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4702 TREE_ASM_WRITTEN (decl
) = 1;
4704 warning ("alias definitions not supported in this configuration; ignored");
4709 /* Returns 1 if the target configuration supports defining public symbols
4710 so that one of them will be chosen at link time instead of generating a
4711 multiply-defined symbol error, whether through the use of weak symbols or
4712 a target-specific mechanism for having duplicates discarded. */
4715 supports_one_only ()
4717 if (SUPPORTS_ONE_ONLY
)
4719 return SUPPORTS_WEAK
;
4722 /* Set up DECL as a public symbol that can be defined in multiple
4723 translation units without generating a linker error. */
4726 make_decl_one_only (decl
)
4729 if (TREE_CODE (decl
) != VAR_DECL
&& TREE_CODE (decl
) != FUNCTION_DECL
)
4732 TREE_PUBLIC (decl
) = 1;
4734 if (TREE_CODE (decl
) == VAR_DECL
4735 && (DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
))
4736 DECL_COMMON (decl
) = 1;
4737 else if (SUPPORTS_ONE_ONLY
)
4739 #ifdef MAKE_DECL_ONE_ONLY
4740 MAKE_DECL_ONE_ONLY (decl
);
4742 DECL_ONE_ONLY (decl
) = 1;
4744 else if (SUPPORTS_WEAK
)
4745 DECL_WEAK (decl
) = 1;
4753 const_str_htab
= htab_create (128, const_str_htab_hash
, const_str_htab_eq
,
4754 const_str_htab_del
);
4755 ggc_add_root (const_hash_table
, MAX_HASH_TABLE
, sizeof const_hash_table
[0],
4756 mark_const_hash_entry
);
4757 ggc_add_root (&const_str_htab
, 1, sizeof const_str_htab
,
4758 mark_const_str_htab
);
4761 /* Extra support for EH values. */
4763 assemble_eh_label (name
)
4766 #ifdef ASM_OUTPUT_EH_LABEL
4767 ASM_OUTPUT_EH_LABEL (asm_out_file
, name
);
4769 assemble_label (name
);
4773 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
4776 assemble_eh_align (align
)
4779 #ifdef ASM_OUTPUT_EH_ALIGN
4780 if (align
> BITS_PER_UNIT
)
4781 ASM_OUTPUT_EH_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
4783 assemble_align (align
);
4788 /* On some platforms, we may want to specify a special mechansim to
4789 output EH data when generating with a function.. */
4791 assemble_eh_integer (x
, size
, force
)
4799 #ifdef ASM_OUTPUT_EH_CHAR
4801 ASM_OUTPUT_EH_CHAR (asm_out_file
, x
);
4805 #ifdef ASM_OUTPUT_EH_SHORT
4807 ASM_OUTPUT_EH_SHORT (asm_out_file
, x
);
4811 #ifdef ASM_OUTPUT_EH_INT
4813 ASM_OUTPUT_EH_INT (asm_out_file
, x
);
4817 #ifdef ASM_OUTPUT_EH_DOUBLE_INT
4819 ASM_OUTPUT_EH_DOUBLE_INT (asm_out_file
, x
);
4826 return (assemble_integer (x
, size
, force
));