1 /* Output variables, constants and external declarations, for GNU compiler.
2 Copyright (C) 1987, 88, 89, 92-6, 1997 Free Software Foundation, Inc.
4 This file is part of GNU CC.
6 GNU CC is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2, or (at your option)
11 GNU CC is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with GNU CC; see the file COPYING. If not, write to
18 the Free Software Foundation, 59 Temple Place - Suite 330,
19 Boston, MA 02111-1307, USA. */
22 /* This file handles generation of all the assembler code
23 *except* the instructions of a function.
24 This includes declarations of variables and their initial values.
26 We also output the assembler code for constants stored in memory
27 and are responsible for combining constants with the same value. */
31 /* #include <stab.h> */
40 #include "hard-reg-set.h"
49 #ifdef XCOFF_DEBUGGING_INFO
55 #ifndef TRAMPOLINE_ALIGNMENT
56 #define TRAMPOLINE_ALIGNMENT FUNCTION_BOUNDARY
60 #define ASM_STABS_OP ".stabs"
63 /* Define the prefix to use when check_memory_usage_flag is enable. */
64 #ifdef NO_DOLLAR_IN_LABEL
65 #ifdef NO_DOT_IN_LABEL
66 #define CHKR_PREFIX "chkr_prefix_"
67 #else /* !NO_DOT_IN_LABEL */
68 #define CHKR_PREFIX "chkr."
70 #else /* !NO_DOLLAR_IN_LABLE */
71 #define CHKR_PREFIX "chkr$"
73 #define CHKR_PREFIX_SIZE (sizeof (CHKR_PREFIX) - 1)
75 /* This macro gets just the user-specified name
76 out of the string in a SYMBOL_REF. On most machines,
77 we discard the * if any and that's all. */
78 #ifndef STRIP_NAME_ENCODING
79 #define STRIP_NAME_ENCODING(VAR,SYMBOL_NAME) \
80 (VAR) = ((SYMBOL_NAME) + ((SYMBOL_NAME)[0] == '*'))
83 /* File in which assembler code is being written. */
85 extern FILE *asm_out_file
;
87 /* The (assembler) name of the first globally-visible object output. */
88 char *first_global_object_name
;
90 extern struct obstack
*current_obstack
;
91 extern struct obstack
*saveable_obstack
;
92 extern struct obstack
*rtl_obstack
;
93 extern struct obstack permanent_obstack
;
94 #define obstack_chunk_alloc xmalloc
96 /* Number for making the label on the next
97 constant that is stored in memory. */
101 /* Number for making the label on the next
102 static variable internal to a function. */
106 /* Carry information from ASM_DECLARE_OBJECT_NAME
107 to ASM_FINISH_DECLARE_OBJECT. */
109 int size_directive_output
;
111 /* The last decl for which assemble_variable was called,
112 if it did ASM_DECLARE_OBJECT_NAME.
113 If the last call to assemble_variable didn't do that,
116 tree last_assemble_variable_decl
;
119 #ifdef HANDLE_PRAGMA_WEAK
120 /* Any weak symbol declarations waiting to be emitted. */
124 struct weak_syms
*next
;
129 static struct weak_syms
*weak_decls
;
132 /* Nonzero if at least one function definition has been seen. */
134 static int function_defined
;
137 struct constant_descriptor
;
139 struct pool_constant
;
141 static void bc_make_decl_rtl
PROTO((tree
, char *, int));
142 static char *strip_reg_name
PROTO((char *));
143 static void bc_output_ascii
PROTO((FILE *, char *, int));
144 static int contains_pointers_p
PROTO((tree
));
145 static void decode_addr_const
PROTO((tree
, struct addr_const
*));
146 static int const_hash
PROTO((tree
));
147 static int compare_constant
PROTO((tree
,
148 struct constant_descriptor
*));
149 static char *compare_constant_1
PROTO((tree
, char *));
150 static struct constant_descriptor
*record_constant
PROTO((tree
));
151 static void record_constant_1
PROTO((tree
));
152 static tree copy_constant
PROTO((tree
));
153 static void output_constant_def_contents
PROTO((tree
, int, int));
154 static void decode_rtx_const
PROTO((enum machine_mode
, rtx
,
155 struct rtx_const
*));
156 static int const_hash_rtx
PROTO((enum machine_mode
, rtx
));
157 static int compare_constant_rtx
PROTO((enum machine_mode
, rtx
,
158 struct constant_descriptor
*));
159 static struct constant_descriptor
*record_constant_rtx
PROTO((enum machine_mode
,
161 static struct pool_constant
*find_pool_constant
PROTO((rtx
));
162 static void mark_constant_pool
PROTO((void));
163 static void mark_constants
PROTO((rtx
));
164 static int output_addressed_constants
PROTO((tree
));
165 static void output_after_function_constants
PROTO((void));
166 static void bc_assemble_integer
PROTO((tree
, int));
167 static void output_constructor
PROTO((tree
, int));
169 static enum in_section
{ no_section
, in_text
, in_data
, in_named
170 #ifdef BSS_SECTION_ASM_OP
173 #ifdef EXTRA_SECTIONS
176 } in_section
= no_section
;
178 /* Return a non-zero value if DECL has a section attribute. */
179 #define IN_NAMED_SECTION(DECL) \
180 ((TREE_CODE (DECL) == FUNCTION_DECL || TREE_CODE (DECL) == VAR_DECL) \
181 && DECL_SECTION_NAME (DECL) != NULL_TREE)
183 /* Text of section name when in_section == in_named. */
184 static char *in_named_name
;
186 /* Define functions like text_section for any extra sections. */
187 #ifdef EXTRA_SECTION_FUNCTIONS
188 EXTRA_SECTION_FUNCTIONS
191 /* Tell assembler to switch to text section. */
196 if (in_section
!= in_text
)
201 fprintf (asm_out_file
, "%s\n", TEXT_SECTION_ASM_OP
);
203 in_section
= in_text
;
207 /* Tell assembler to switch to data section. */
212 if (in_section
!= in_data
)
218 if (flag_shared_data
)
220 #ifdef SHARED_SECTION_ASM_OP
221 fprintf (asm_out_file
, "%s\n", SHARED_SECTION_ASM_OP
);
223 fprintf (asm_out_file
, "%s\n", DATA_SECTION_ASM_OP
);
227 fprintf (asm_out_file
, "%s\n", DATA_SECTION_ASM_OP
);
230 in_section
= in_data
;
234 /* Tell assembler to switch to read-only data section. This is normally
238 readonly_data_section ()
240 #ifdef READONLY_DATA_SECTION
241 READONLY_DATA_SECTION (); /* Note this can call data_section. */
247 /* Determine if we're in the text section. */
252 return in_section
== in_text
;
255 /* Determine if we're in the data section. */
260 return in_section
== in_data
;
263 /* Tell assembler to change to section NAME for DECL.
264 If DECL is NULL, just switch to section NAME.
265 If NAME is NULL, get the name from DECL.
266 If RELOC is 1, the initializer for DECL contains relocs. */
269 named_section (decl
, name
, reloc
)
274 if (decl
!= NULL_TREE
275 && TREE_CODE_CLASS (TREE_CODE (decl
)) != 'd')
278 name
= TREE_STRING_POINTER (DECL_SECTION_NAME (decl
));
280 if (in_section
!= in_named
|| strcmp (name
, in_named_name
))
282 in_named_name
= obstack_alloc (&permanent_obstack
, strlen (name
) + 1);
283 strcpy (in_named_name
, name
);
284 in_section
= in_named
;
286 #ifdef ASM_OUTPUT_SECTION_NAME
287 ASM_OUTPUT_SECTION_NAME (asm_out_file
, decl
, name
, reloc
);
289 /* Section attributes are not supported if this macro isn't provided -
290 some host formats don't support them at all. The front-end should
291 already have flagged this as an error. */
297 #ifdef ASM_OUTPUT_SECTION_NAME
298 #ifndef UNIQUE_SECTION
299 #define UNIQUE_SECTION(DECL,RELOC) \
302 char *name, *string; \
304 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (DECL)); \
305 /* Strip off any encoding in name. */ \
306 STRIP_NAME_ENCODING (name, name); \
308 len = strlen (name) + 1; \
309 string = alloca (len + 1); \
310 sprintf (string, ".%s", name); \
312 DECL_SECTION_NAME (DECL) = build_string (len, string); \
315 #ifndef UNIQUE_SECTION_P
316 #define UNIQUE_SECTION_P(DECL) 0
320 #ifdef BSS_SECTION_ASM_OP
322 /* Tell the assembler to switch to the bss section. */
327 if (in_section
!= in_bss
)
333 #ifdef SHARED_BSS_SECTION_ASM_OP
334 if (flag_shared_data
)
335 fprintf (asm_out_file
, "%s\n", SHARED_BSS_SECTION_ASM_OP
);
338 fprintf (asm_out_file
, "%s\n", BSS_SECTION_ASM_OP
);
345 #ifdef ASM_OUTPUT_BSS
347 /* Utility function for ASM_OUTPUT_BSS for targets to use if
348 they don't support alignments in .bss.
349 ??? It is believed that this function will work in most cases so such
350 support is localized here. */
353 asm_output_bss (file
, decl
, name
, size
, rounded
)
359 ASM_GLOBALIZE_LABEL (file
, name
);
361 #ifdef ASM_DECLARE_OBJECT_NAME
362 last_assemble_variable_decl
= decl
;
363 ASM_DECLARE_OBJECT_NAME (file
, name
, decl
);
365 /* Standard thing is just output label for the object. */
366 ASM_OUTPUT_LABEL (file
, name
);
367 #endif /* ASM_DECLARE_OBJECT_NAME */
368 ASM_OUTPUT_SKIP (file
, rounded
);
373 #ifdef ASM_OUTPUT_ALIGNED_BSS
375 /* Utility function for targets to use in implementing
376 ASM_OUTPUT_ALIGNED_BSS.
377 ??? It is believed that this function will work in most cases so such
378 support is localized here. */
381 asm_output_aligned_bss (file
, decl
, name
, size
, align
)
387 ASM_GLOBALIZE_LABEL (file
, name
);
389 ASM_OUTPUT_ALIGN (file
, floor_log2 (align
/ BITS_PER_UNIT
));
390 #ifdef ASM_DECLARE_OBJECT_NAME
391 last_assemble_variable_decl
= decl
;
392 ASM_DECLARE_OBJECT_NAME (file
, name
, decl
);
394 /* Standard thing is just output label for the object. */
395 ASM_OUTPUT_LABEL (file
, name
);
396 #endif /* ASM_DECLARE_OBJECT_NAME */
397 ASM_OUTPUT_SKIP (file
, size
? size
: 1);
402 #endif /* BSS_SECTION_ASM_OP */
404 /* Switch to the section for function DECL.
406 If DECL is NULL_TREE, switch to the text section.
407 ??? It's not clear that we will ever be passed NULL_TREE, but it's
408 safer to handle it. */
411 function_section (decl
)
414 if (decl
!= NULL_TREE
415 && DECL_SECTION_NAME (decl
) != NULL_TREE
)
416 named_section (decl
, (char *) 0, 0);
421 /* Switch to section for variable DECL.
423 RELOC is the `reloc' argument to SELECT_SECTION. */
426 variable_section (decl
, reloc
)
430 if (IN_NAMED_SECTION (decl
))
431 named_section (decl
, NULL
, reloc
);
434 /* C++ can have const variables that get initialized from constructors,
435 and thus can not be in a readonly section. We prevent this by
436 verifying that the initial value is constant for objects put in a
439 error_mark_node is used by the C front end to indicate that the
440 initializer has not been seen yet. In this case, we assume that
441 the initializer must be constant.
443 C++ uses error_mark_node for variables that have complicated
444 initializers, but these variables go in BSS so we won't be called
447 #ifdef SELECT_SECTION
448 SELECT_SECTION (decl
, reloc
);
450 if (DECL_READONLY_SECTION (decl
, reloc
))
451 readonly_data_section ();
458 /* Tell assembler to switch to the section for the exception handling
464 #ifdef ASM_OUTPUT_SECTION_NAME
465 named_section (NULL_TREE
, ".gcc_except_table", 0);
470 #if defined (EXCEPTION_SECTION)
471 EXCEPTION_SECTION ();
473 readonly_data_section ();
478 /* Create the rtl to represent a function, for a function definition.
479 DECL is a FUNCTION_DECL node which describes which function.
480 The rtl is stored into DECL. */
483 make_function_rtl (decl
)
486 char *name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
487 char *new_name
= name
;
491 if (DECL_RTL (decl
) == 0)
492 DECL_RTL (decl
) = bc_gen_rtx (name
, 0, (struct bc_label
*) 0);
494 /* Record that at least one function has been defined. */
495 function_defined
= 1;
499 /* Rename a nested function to avoid conflicts. */
500 if (decl_function_context (decl
) != 0
501 && DECL_INITIAL (decl
) != 0
502 && DECL_RTL (decl
) == 0)
506 name
= IDENTIFIER_POINTER (DECL_NAME (decl
));
507 ASM_FORMAT_PRIVATE_NAME (label
, name
, var_labelno
);
508 name
= obstack_copy0 (saveable_obstack
, label
, strlen (label
));
513 /* When -fprefix-function-name is used, every function name is
514 prefixed. Even static functions are prefixed because they
515 could be declared latter. Note that a nested function name
517 if (flag_prefix_function_name
)
519 new_name
= (char *) alloca (strlen (name
) + CHKR_PREFIX_SIZE
+ 1);
520 strcpy (new_name
, CHKR_PREFIX
);
521 strcpy (new_name
+ CHKR_PREFIX_SIZE
, name
);
522 name
= obstack_copy0 (saveable_obstack
, new_name
, strlen (new_name
));
526 if (DECL_RTL (decl
) == 0)
529 = gen_rtx (MEM
, DECL_MODE (decl
),
530 gen_rtx (SYMBOL_REF
, Pmode
, name
));
532 /* Optionally set flags or add text to the name to record information
533 such as that it is a function name. If the name is changed, the macro
534 ASM_OUTPUT_LABELREF will have to know how to strip this information. */
535 #ifdef ENCODE_SECTION_INFO
536 ENCODE_SECTION_INFO (decl
);
540 /* Record at least one function has been defined. */
541 function_defined
= 1;
544 /* Create the DECL_RTL for a declaration for a static or external
545 variable or static or external function.
546 ASMSPEC, if not 0, is the string which the user specified
547 as the assembler symbol name.
548 TOP_LEVEL is nonzero if this is a file-scope variable.
549 This is never called for PARM_DECLs. */
552 bc_make_decl_rtl (decl
, asmspec
, top_level
)
557 register char *name
= TREE_STRING_POINTER (DECL_ASSEMBLER_NAME (decl
));
559 if (DECL_RTL (decl
) == 0)
561 /* Print an error message for register variables. */
562 if (DECL_REGISTER (decl
))
563 error ("global register variables not supported in the interpreter");
565 /* Handle ordinary static variables and functions. */
566 if (DECL_RTL (decl
) == 0)
568 /* Can't use just the variable's own name for a variable
569 whose scope is less than the whole file.
570 Concatenate a distinguishing number. */
571 if (!top_level
&& !TREE_PUBLIC (decl
) && asmspec
== 0)
575 ASM_FORMAT_PRIVATE_NAME (label
, name
, var_labelno
);
576 name
= obstack_copy0 (saveable_obstack
, label
, strlen (label
));
580 DECL_RTL (decl
) = bc_gen_rtx (name
, 0, (struct bc_label
*) 0);
585 /* Given NAME, a putative register name, discard any customary prefixes. */
588 strip_reg_name (name
)
591 #ifdef REGISTER_PREFIX
592 if (!strncmp (name
, REGISTER_PREFIX
, strlen (REGISTER_PREFIX
)))
593 name
+= strlen (REGISTER_PREFIX
);
595 if (name
[0] == '%' || name
[0] == '#')
600 /* Decode an `asm' spec for a declaration as a register name.
601 Return the register number, or -1 if nothing specified,
602 or -2 if the ASMSPEC is not `cc' or `memory' and is not recognized,
603 or -3 if ASMSPEC is `cc' and is not recognized,
604 or -4 if ASMSPEC is `memory' and is not recognized.
605 Accept an exact spelling or a decimal number.
606 Prefixes such as % are optional. */
609 decode_reg_name (asmspec
)
616 /* Get rid of confusing prefixes. */
617 asmspec
= strip_reg_name (asmspec
);
619 /* Allow a decimal number as a "register name". */
620 for (i
= strlen (asmspec
) - 1; i
>= 0; i
--)
621 if (! (asmspec
[i
] >= '0' && asmspec
[i
] <= '9'))
623 if (asmspec
[0] != 0 && i
< 0)
626 if (i
< FIRST_PSEUDO_REGISTER
&& i
>= 0)
632 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
634 && ! strcmp (asmspec
, strip_reg_name (reg_names
[i
])))
637 #ifdef ADDITIONAL_REGISTER_NAMES
639 static struct { char *name
; int number
; } table
[]
640 = ADDITIONAL_REGISTER_NAMES
;
642 for (i
= 0; i
< sizeof (table
) / sizeof (table
[0]); i
++)
643 if (! strcmp (asmspec
, table
[i
].name
))
644 return table
[i
].number
;
646 #endif /* ADDITIONAL_REGISTER_NAMES */
648 if (!strcmp (asmspec
, "memory"))
651 if (!strcmp (asmspec
, "cc"))
660 /* Create the DECL_RTL for a declaration for a static or external variable
661 or static or external function.
662 ASMSPEC, if not 0, is the string which the user specified
663 as the assembler symbol name.
664 TOP_LEVEL is nonzero if this is a file-scope variable.
666 This is never called for PARM_DECL nodes. */
669 make_decl_rtl (decl
, asmspec
, top_level
)
674 register char *name
= 0;
679 bc_make_decl_rtl (decl
, asmspec
, top_level
);
683 reg_number
= decode_reg_name (asmspec
);
685 if (DECL_ASSEMBLER_NAME (decl
) != NULL_TREE
)
686 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
688 if (reg_number
== -2)
690 /* ASMSPEC is given, and not the name of a register. */
691 name
= (char *) obstack_alloc (saveable_obstack
,
692 strlen (asmspec
) + 2);
694 strcpy (&name
[1], asmspec
);
697 /* For a duplicate declaration, we can be called twice on the
698 same DECL node. Don't discard the RTL already made. */
699 if (DECL_RTL (decl
) == 0)
703 /* First detect errors in declaring global registers. */
704 if (TREE_CODE (decl
) != FUNCTION_DECL
705 && DECL_REGISTER (decl
) && reg_number
== -1)
706 error_with_decl (decl
,
707 "register name not specified for `%s'");
708 else if (TREE_CODE (decl
) != FUNCTION_DECL
709 && DECL_REGISTER (decl
) && reg_number
< 0)
710 error_with_decl (decl
,
711 "invalid register name for `%s'");
712 else if ((reg_number
>= 0 || reg_number
== -3)
713 && (TREE_CODE (decl
) == FUNCTION_DECL
714 && ! DECL_REGISTER (decl
)))
715 error_with_decl (decl
,
716 "register name given for non-register variable `%s'");
717 else if (TREE_CODE (decl
) != FUNCTION_DECL
718 && DECL_REGISTER (decl
)
719 && TYPE_MODE (TREE_TYPE (decl
)) == BLKmode
)
720 error_with_decl (decl
,
721 "data type of `%s' isn't suitable for a register");
722 else if (TREE_CODE (decl
) != FUNCTION_DECL
&& DECL_REGISTER (decl
)
723 && ! HARD_REGNO_MODE_OK (reg_number
,
724 TYPE_MODE (TREE_TYPE (decl
))))
725 error_with_decl (decl
,
726 "register number for `%s' isn't suitable for data type");
727 /* Now handle properly declared static register variables. */
728 else if (TREE_CODE (decl
) != FUNCTION_DECL
&& DECL_REGISTER (decl
))
732 if (DECL_INITIAL (decl
) != 0 && top_level
)
734 DECL_INITIAL (decl
) = 0;
735 error ("global register variable has initial value");
737 if (fixed_regs
[reg_number
] == 0
738 && function_defined
&& top_level
)
739 error ("global register variable follows a function definition");
740 if (TREE_THIS_VOLATILE (decl
))
741 warning ("volatile register variables don't work as you might wish");
743 /* If the user specified one of the eliminables registers here,
744 e.g., FRAME_POINTER_REGNUM, we don't want to get this variable
745 confused with that register and be eliminated. Although this
746 usage is somewhat suspect, we nevertheless use the following
747 kludge to avoid setting DECL_RTL to frame_pointer_rtx. */
750 = gen_rtx (REG
, DECL_MODE (decl
), FIRST_PSEUDO_REGISTER
);
751 REGNO (DECL_RTL (decl
)) = reg_number
;
752 REG_USERVAR_P (DECL_RTL (decl
)) = 1;
756 /* Make this register global, so not usable for anything
758 nregs
= HARD_REGNO_NREGS (reg_number
, DECL_MODE (decl
));
760 globalize_reg (reg_number
+ --nregs
);
763 /* Specifying a section attribute on a variable forces it into a
764 non-.bss section, and thus it cannot be common. */
765 else if (TREE_CODE (decl
) == VAR_DECL
766 && DECL_SECTION_NAME (decl
) != NULL_TREE
767 && DECL_INITIAL (decl
) == NULL_TREE
768 && DECL_COMMON (decl
))
769 DECL_COMMON (decl
) = 0;
771 /* Now handle ordinary static variables and functions (in memory).
772 Also handle vars declared register invalidly. */
773 if (DECL_RTL (decl
) == 0)
775 /* Can't use just the variable's own name for a variable
776 whose scope is less than the whole file.
777 Concatenate a distinguishing number. */
778 if (!top_level
&& !TREE_PUBLIC (decl
) && asmspec
== 0)
782 ASM_FORMAT_PRIVATE_NAME (label
, name
, var_labelno
);
783 name
= obstack_copy0 (saveable_obstack
, label
, strlen (label
));
790 /* When -fprefix-function-name is used, the functions
791 names are prefixed. Only nested function names are not
793 if (flag_prefix_function_name
&& TREE_CODE (decl
) == FUNCTION_DECL
)
796 new_name
= (char *) alloca (strlen (name
) + CHKR_PREFIX_SIZE
798 strcpy (new_name
, CHKR_PREFIX
);
799 strcpy (new_name
+ CHKR_PREFIX_SIZE
, name
);
800 name
= obstack_copy0 (saveable_obstack
,
801 new_name
, strlen (new_name
));
804 DECL_RTL (decl
) = gen_rtx (MEM
, DECL_MODE (decl
),
805 gen_rtx (SYMBOL_REF
, Pmode
, name
));
807 /* If this variable is to be treated as volatile, show its
808 tree node has side effects. If it has side effects, either
809 because of this test or from TREE_THIS_VOLATILE also
810 being set, show the MEM is volatile. */
811 if (flag_volatile_global
&& TREE_CODE (decl
) == VAR_DECL
812 && TREE_PUBLIC (decl
))
813 TREE_SIDE_EFFECTS (decl
) = 1;
814 if (TREE_SIDE_EFFECTS (decl
))
815 MEM_VOLATILE_P (DECL_RTL (decl
)) = 1;
817 if (TREE_READONLY (decl
))
818 RTX_UNCHANGING_P (DECL_RTL (decl
)) = 1;
819 MEM_IN_STRUCT_P (DECL_RTL (decl
))
820 = AGGREGATE_TYPE_P (TREE_TYPE (decl
));
822 /* Optionally set flags or add text to the name to record information
823 such as that it is a function name.
824 If the name is changed, the macro ASM_OUTPUT_LABELREF
825 will have to know how to strip this information. */
826 #ifdef ENCODE_SECTION_INFO
827 ENCODE_SECTION_INFO (decl
);
831 /* If the old RTL had the wrong mode, fix the mode. */
832 else if (GET_MODE (DECL_RTL (decl
)) != DECL_MODE (decl
))
834 rtx rtl
= DECL_RTL (decl
);
835 PUT_MODE (rtl
, DECL_MODE (decl
));
839 /* Make the rtl for variable VAR be volatile.
840 Use this only for static variables. */
843 make_var_volatile (var
)
846 if (GET_CODE (DECL_RTL (var
)) != MEM
)
849 MEM_VOLATILE_P (DECL_RTL (var
)) = 1;
852 /* Output alignment directive to align for constant expression EXP. */
855 assemble_constant_align (exp
)
860 /* Align the location counter as required by EXP's data type. */
861 align
= TYPE_ALIGN (TREE_TYPE (exp
));
862 #ifdef CONSTANT_ALIGNMENT
863 align
= CONSTANT_ALIGNMENT (exp
, align
);
866 if (align
> BITS_PER_UNIT
)
867 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
870 /* Output a string of literal assembler code
871 for an `asm' keyword used between functions. */
874 assemble_asm (string
)
879 error ("asm statements not allowed in interpreter");
885 if (TREE_CODE (string
) == ADDR_EXPR
)
886 string
= TREE_OPERAND (string
, 0);
888 fprintf (asm_out_file
, "\t%s\n", TREE_STRING_POINTER (string
));
891 #if 0 /* This should no longer be needed, because
892 flag_gnu_linker should be 0 on these systems,
893 which should prevent any output
894 if ASM_OUTPUT_CONSTRUCTOR and ASM_OUTPUT_DESTRUCTOR are absent. */
895 #if !(defined(DBX_DEBUGGING_INFO) && !defined(FASCIST_ASSEMBLER))
896 #ifndef ASM_OUTPUT_CONSTRUCTOR
897 #define ASM_OUTPUT_CONSTRUCTOR(file, name)
899 #ifndef ASM_OUTPUT_DESTRUCTOR
900 #define ASM_OUTPUT_DESTRUCTOR(file, name)
905 /* Record an element in the table of global destructors.
906 How this is done depends on what sort of assembler and linker
909 NAME should be the name of a global function to be called
910 at exit time. This name is output using assemble_name. */
913 assemble_destructor (name
)
916 #ifdef ASM_OUTPUT_DESTRUCTOR
917 ASM_OUTPUT_DESTRUCTOR (asm_out_file
, name
);
921 /* Now tell GNU LD that this is part of the static destructor set. */
922 /* This code works for any machine provided you use GNU as/ld. */
923 fprintf (asm_out_file
, "%s \"___DTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
924 assemble_name (asm_out_file
, name
);
925 fputc ('\n', asm_out_file
);
930 /* Likewise for global constructors. */
933 assemble_constructor (name
)
936 #ifdef ASM_OUTPUT_CONSTRUCTOR
937 ASM_OUTPUT_CONSTRUCTOR (asm_out_file
, name
);
941 /* Now tell GNU LD that this is part of the static constructor set. */
942 /* This code works for any machine provided you use GNU as/ld. */
943 fprintf (asm_out_file
, "%s \"___CTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
944 assemble_name (asm_out_file
, name
);
945 fputc ('\n', asm_out_file
);
950 /* Likewise for entries we want to record for garbage collection.
951 Garbage collection is still under development. */
954 assemble_gc_entry (name
)
957 #ifdef ASM_OUTPUT_GC_ENTRY
958 ASM_OUTPUT_GC_ENTRY (asm_out_file
, name
);
962 /* Now tell GNU LD that this is part of the static constructor set. */
963 fprintf (asm_out_file
, "%s \"___PTR_LIST__\",22,0,0,", ASM_STABS_OP
);
964 assemble_name (asm_out_file
, name
);
965 fputc ('\n', asm_out_file
);
970 /* CONSTANT_POOL_BEFORE_FUNCTION may be defined as an expression with
971 a non-zero value if the constant pool should be output before the
972 start of the function, or a zero value if the pool should output
973 after the end of the function. The default is to put it before the
976 #ifndef CONSTANT_POOL_BEFORE_FUNCTION
977 #define CONSTANT_POOL_BEFORE_FUNCTION 1
980 /* Output assembler code for the constant pool of a function and associated
981 with defining the name of the function. DECL describes the function.
982 NAME is the function's name. For the constant pool, we use the current
983 constant pool data. */
986 assemble_start_function (decl
, fnname
)
992 /* The following code does not need preprocessing in the assembler. */
996 if (CONSTANT_POOL_BEFORE_FUNCTION
)
997 output_constant_pool (fnname
, decl
);
999 #ifdef ASM_OUTPUT_SECTION_NAME
1000 /* If the function is to be put in its own section and it's not in a section
1001 already, indicate so. */
1002 if ((flag_function_sections
1003 && DECL_SECTION_NAME (decl
) == NULL_TREE
)
1004 || UNIQUE_SECTION_P (decl
))
1005 UNIQUE_SECTION (decl
, 0);
1008 function_section (decl
);
1010 /* Tell assembler to move to target machine's alignment for functions. */
1011 align
= floor_log2 (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
1014 if (output_bytecode
)
1015 BC_OUTPUT_ALIGN (asm_out_file
, align
);
1017 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1020 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
1021 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file
, fnname
);
1024 #ifdef SDB_DEBUGGING_INFO
1025 /* Output SDB definition of the function. */
1026 if (write_symbols
== SDB_DEBUG
)
1027 sdbout_mark_begin_function ();
1030 #ifdef DBX_DEBUGGING_INFO
1031 /* Output DBX definition of the function. */
1032 if (write_symbols
== DBX_DEBUG
)
1033 dbxout_begin_function (decl
);
1036 /* Make function name accessible from other files, if appropriate. */
1038 if (TREE_PUBLIC (decl
))
1040 if (!first_global_object_name
&& ! DECL_WEAK (decl
)
1041 && ! DECL_ONE_ONLY (decl
))
1045 STRIP_NAME_ENCODING (p
, fnname
);
1046 first_global_object_name
= permalloc (strlen (p
) + 1);
1047 strcpy (first_global_object_name
, p
);
1050 #ifdef ASM_WEAKEN_LABEL
1051 if (DECL_WEAK (decl
))
1052 ASM_WEAKEN_LABEL (asm_out_file
, fnname
);
1055 if (output_bytecode
)
1056 BC_GLOBALIZE_LABEL (asm_out_file
, fnname
);
1058 ASM_GLOBALIZE_LABEL (asm_out_file
, fnname
);
1061 /* Do any machine/system dependent processing of the function name */
1062 if (output_bytecode
)
1063 BC_OUTPUT_LABEL (asm_out_file
, fnname
);
1066 #ifdef ASM_DECLARE_FUNCTION_NAME
1067 ASM_DECLARE_FUNCTION_NAME (asm_out_file
, fnname
, current_function_decl
);
1069 /* Standard thing is just output label for the function. */
1070 ASM_OUTPUT_LABEL (asm_out_file
, fnname
);
1071 #endif /* ASM_DECLARE_FUNCTION_NAME */
1075 /* Output assembler code associated with defining the size of the
1076 function. DECL describes the function. NAME is the function's name. */
1079 assemble_end_function (decl
, fnname
)
1083 #ifdef ASM_DECLARE_FUNCTION_SIZE
1084 ASM_DECLARE_FUNCTION_SIZE (asm_out_file
, fnname
, decl
);
1086 if (! CONSTANT_POOL_BEFORE_FUNCTION
)
1088 output_constant_pool (fnname
, decl
);
1089 function_section (decl
); /* need to switch back */
1092 /* Output any constants which should appear after the function. */
1093 output_after_function_constants ();
1096 /* Assemble code to leave SIZE bytes of zeros. */
1099 assemble_zeros (size
)
1102 if (output_bytecode
)
1104 bc_emit_const_skip (size
);
1108 #ifdef ASM_NO_SKIP_IN_TEXT
1109 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
1110 so we must output 0s explicitly in the text section. */
1111 if (ASM_NO_SKIP_IN_TEXT
&& in_text_section ())
1115 for (i
= 0; i
< size
- 20; i
+= 20)
1118 fprintf (asm_out_file
,
1119 "%s 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n", ASM_BYTE_OP
);
1121 fprintf (asm_out_file
,
1122 "\tbyte 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n");
1128 fprintf (asm_out_file
, "%s 0", ASM_BYTE_OP
);
1130 fprintf (asm_out_file
, "\tbyte 0");
1133 for (; i
< size
; i
++)
1134 fprintf (asm_out_file
, ",0");
1135 fprintf (asm_out_file
, "\n");
1142 if (output_bytecode
)
1143 BC_OUTPUT_SKIP (asm_out_file
, size
);
1145 ASM_OUTPUT_SKIP (asm_out_file
, size
);
1149 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
1152 assemble_align (align
)
1155 if (align
> BITS_PER_UNIT
)
1156 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
1159 /* Assemble a string constant with the specified C string as contents. */
1162 assemble_string (p
, size
)
1170 if (output_bytecode
)
1176 /* If the string is very long, split it up. */
1180 int thissize
= size
- pos
;
1181 if (thissize
> maximum
)
1184 if (output_bytecode
)
1185 bc_output_ascii (asm_out_file
, p
, thissize
);
1188 ASM_OUTPUT_ASCII (asm_out_file
, p
, thissize
);
1197 bc_output_ascii (file
, p
, size
)
1202 BC_OUTPUT_ASCII (file
, p
, size
);
1205 /* Assemble everything that is needed for a variable or function declaration.
1206 Not used for automatic variables, and not used for function definitions.
1207 Should not be called for variables of incomplete structure type.
1209 TOP_LEVEL is nonzero if this variable has file scope.
1210 AT_END is nonzero if this is the special handling, at end of compilation,
1211 to define things that have had only tentative definitions.
1212 DONT_OUTPUT_DATA if nonzero means don't actually output the
1213 initial value (that will be done by the caller). */
1216 assemble_variable (decl
, top_level
, at_end
, dont_output_data
)
1220 int dont_output_data
;
1222 register char *name
;
1226 enum in_section saved_in_section
;
1228 last_assemble_variable_decl
= 0;
1230 if (output_bytecode
)
1233 if (GET_CODE (DECL_RTL (decl
)) == REG
)
1235 /* Do output symbol info for global register variables, but do nothing
1238 if (TREE_ASM_WRITTEN (decl
))
1240 TREE_ASM_WRITTEN (decl
) = 1;
1242 if (!output_bytecode
)
1244 #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
1245 /* File-scope global variables are output here. */
1246 if ((write_symbols
== DBX_DEBUG
|| write_symbols
== XCOFF_DEBUG
)
1248 dbxout_symbol (decl
, 0);
1250 #ifdef SDB_DEBUGGING_INFO
1251 if (write_symbols
== SDB_DEBUG
&& top_level
1252 /* Leave initialized global vars for end of compilation;
1253 see comment in compile_file. */
1254 && (TREE_PUBLIC (decl
) == 0 || DECL_INITIAL (decl
) == 0))
1255 sdbout_symbol (decl
, 0);
1259 /* Don't output any DWARF debugging information for variables here.
1260 In the case of local variables, the information for them is output
1261 when we do our recursive traversal of the tree representation for
1262 the entire containing function. In the case of file-scope variables,
1263 we output information for all of them at the very end of compilation
1264 while we are doing our final traversal of the chain of file-scope
1270 /* Normally no need to say anything here for external references,
1271 since assemble_external is called by the language-specific code
1272 when a declaration is first seen. */
1274 if (DECL_EXTERNAL (decl
))
1277 /* Output no assembler code for a function declaration.
1278 Only definitions of functions output anything. */
1280 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1283 /* If type was incomplete when the variable was declared,
1284 see if it is complete now. */
1286 if (DECL_SIZE (decl
) == 0)
1287 layout_decl (decl
, 0);
1289 /* Still incomplete => don't allocate it; treat the tentative defn
1290 (which is what it must have been) as an `extern' reference. */
1292 if (!dont_output_data
&& DECL_SIZE (decl
) == 0)
1294 error_with_file_and_line (DECL_SOURCE_FILE (decl
),
1295 DECL_SOURCE_LINE (decl
),
1296 "storage size of `%s' isn't known",
1297 IDENTIFIER_POINTER (DECL_NAME (decl
)));
1298 TREE_ASM_WRITTEN (decl
) = 1;
1302 /* The first declaration of a variable that comes through this function
1303 decides whether it is global (in C, has external linkage)
1304 or local (in C, has internal linkage). So do nothing more
1305 if this function has already run. */
1307 if (TREE_ASM_WRITTEN (decl
))
1310 TREE_ASM_WRITTEN (decl
) = 1;
1314 if (! dont_output_data
)
1318 if (TREE_CODE (DECL_SIZE (decl
)) != INTEGER_CST
)
1321 /* This is better than explicit arithmetic, since it avoids overflow. */
1322 size_tree
= size_binop (CEIL_DIV_EXPR
,
1323 DECL_SIZE (decl
), size_int (BITS_PER_UNIT
));
1325 size
= TREE_INT_CST_LOW (size_tree
);
1326 if (TREE_INT_CST_HIGH (size_tree
) != 0
1327 || size
!= TREE_INT_CST_LOW (size_tree
))
1329 error_with_decl (decl
, "size of variable `%s' is too large");
1334 name
= XSTR (XEXP (DECL_RTL (decl
), 0), 0);
1336 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
)
1337 && ! first_global_object_name
1338 && ! (DECL_COMMON (decl
) && (DECL_INITIAL (decl
) == 0
1339 || DECL_INITIAL (decl
) == error_mark_node
))
1340 && ! DECL_WEAK (decl
)
1341 && ! DECL_ONE_ONLY (decl
))
1345 STRIP_NAME_ENCODING (p
, name
);
1346 first_global_object_name
= permalloc (strlen (p
) + 1);
1347 strcpy (first_global_object_name
, p
);
1350 /* Handle uninitialized definitions. */
1352 if ((DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
)
1353 /* If the target can't output uninitialized but not common global data
1354 in .bss, then we have to use .data. */
1355 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
1356 && DECL_COMMON (decl
)
1358 && ! dont_output_data
)
1360 int size
= TREE_INT_CST_LOW (size_tree
);
1363 /* Don't allocate zero bytes of common,
1364 since that means "undefined external" in the linker. */
1365 if (size
== 0) rounded
= 1;
1366 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1367 so that each uninitialized object starts on such a boundary. */
1368 rounded
+= (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1;
1369 rounded
= (rounded
/ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1370 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1372 #ifdef DBX_DEBUGGING_INFO
1373 /* File-scope global variables are output here. */
1374 if (write_symbols
== DBX_DEBUG
&& top_level
)
1375 dbxout_symbol (decl
, 0);
1377 #ifdef SDB_DEBUGGING_INFO
1378 if (write_symbols
== SDB_DEBUG
&& top_level
1379 /* Leave initialized global vars for end of compilation;
1380 see comment in compile_file. */
1381 && (TREE_PUBLIC (decl
) == 0 || DECL_INITIAL (decl
) == 0))
1382 sdbout_symbol (decl
, 0);
1385 /* Don't output any DWARF debugging information for variables here.
1386 In the case of local variables, the information for them is output
1387 when we do our recursive traversal of the tree representation for
1388 the entire containing function. In the case of file-scope variables,
1389 we output information for all of them at the very end of compilation
1390 while we are doing our final traversal of the chain of file-scope
1393 #if 0 /* ??? We should either delete this or add a comment describing what
1394 it was intended to do and why we shouldn't delete it. */
1395 if (flag_shared_data
)
1399 if (TREE_PUBLIC (decl
)
1400 #if defined (ASM_OUTPUT_BSS) || defined (ASM_OUTPUT_ALIGNED_BSS)
1401 && DECL_COMMON (decl
)
1405 #ifdef ASM_OUTPUT_SHARED_COMMON
1406 if (flag_shared_data
)
1407 ASM_OUTPUT_SHARED_COMMON (asm_out_file
, name
, size
, rounded
);
1410 if (output_bytecode
)
1412 BC_OUTPUT_COMMON (asm_out_file
, name
, size
, rounded
);
1416 #ifdef ASM_OUTPUT_ALIGNED_COMMON
1417 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file
, name
, size
,
1420 ASM_OUTPUT_COMMON (asm_out_file
, name
, size
, rounded
);
1424 #if defined (ASM_OUTPUT_BSS) || defined (ASM_OUTPUT_ALIGNED_BSS)
1425 else if (TREE_PUBLIC (decl
))
1427 #ifdef ASM_OUTPUT_SHARED_BSS
1428 if (flag_shared_data
)
1429 ASM_OUTPUT_SHARED_BSS (asm_out_file
, decl
, name
, size
, rounded
);
1432 if (output_bytecode
)
1434 BC_OUTPUT_BSS (asm_out_file
, name
, size
, rounded
);
1438 #ifdef ASM_OUTPUT_ALIGNED_BSS
1439 ASM_OUTPUT_ALIGNED_BSS (asm_out_file
, decl
, name
, size
,
1442 ASM_OUTPUT_BSS (asm_out_file
, decl
, name
, size
, rounded
);
1446 #endif /* ASM_OUTPUT_BSS || ASM_OUTPUT_ALIGNED_BSS */
1449 #ifdef ASM_OUTPUT_SHARED_LOCAL
1450 if (flag_shared_data
)
1451 ASM_OUTPUT_SHARED_LOCAL (asm_out_file
, name
, size
, rounded
);
1454 if (output_bytecode
)
1456 BC_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
1460 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1461 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file
, name
, size
,
1464 ASM_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
1471 /* Handle initialized definitions.
1472 Also handle uninitialized global definitions if -fno-common and the
1473 target doesn't support ASM_OUTPUT_BSS. */
1475 /* First make the assembler name(s) global if appropriate. */
1476 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
))
1478 #ifdef ASM_WEAKEN_LABEL
1479 if (DECL_WEAK (decl
))
1480 ASM_WEAKEN_LABEL (asm_out_file
, name
);
1483 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
1486 for (d
= equivalents
; d
; d
= TREE_CHAIN (d
))
1488 tree e
= TREE_VALUE (d
);
1489 if (TREE_PUBLIC (e
) && DECL_NAME (e
))
1490 ASM_GLOBALIZE_LABEL (asm_out_file
,
1491 XSTR (XEXP (DECL_RTL (e
), 0), 0));
1495 /* Output any data that we will need to use the address of. */
1496 if (DECL_INITIAL (decl
) == error_mark_node
)
1497 reloc
= contains_pointers_p (TREE_TYPE (decl
));
1498 else if (DECL_INITIAL (decl
))
1499 reloc
= output_addressed_constants (DECL_INITIAL (decl
));
1501 #ifdef ASM_OUTPUT_SECTION_NAME
1502 if (UNIQUE_SECTION_P (decl
))
1503 UNIQUE_SECTION (decl
, reloc
);
1506 /* Switch to the appropriate section. */
1507 variable_section (decl
, reloc
);
1509 /* dbxout.c needs to know this. */
1510 if (in_text_section ())
1511 DECL_IN_TEXT_SECTION (decl
) = 1;
1513 /* Record current section so we can restore it if dbxout.c clobbers it. */
1514 saved_in_section
= in_section
;
1516 /* Output the dbx info now that we have chosen the section. */
1518 #ifdef DBX_DEBUGGING_INFO
1519 /* File-scope global variables are output here. */
1520 if (write_symbols
== DBX_DEBUG
&& top_level
)
1521 dbxout_symbol (decl
, 0);
1523 #ifdef SDB_DEBUGGING_INFO
1524 if (write_symbols
== SDB_DEBUG
&& top_level
1525 /* Leave initialized global vars for end of compilation;
1526 see comment in compile_file. */
1527 && (TREE_PUBLIC (decl
) == 0 || DECL_INITIAL (decl
) == 0))
1528 sdbout_symbol (decl
, 0);
1531 /* Don't output any DWARF debugging information for variables here.
1532 In the case of local variables, the information for them is output
1533 when we do our recursive traversal of the tree representation for
1534 the entire containing function. In the case of file-scope variables,
1535 we output information for all of them at the very end of compilation
1536 while we are doing our final traversal of the chain of file-scope
1539 /* If the debugging output changed sections, reselect the section
1540 that's supposed to be selected. */
1541 if (in_section
!= saved_in_section
)
1542 variable_section (decl
, reloc
);
1544 /* Compute and output the alignment of this data. */
1546 align
= DECL_ALIGN (decl
);
1547 /* In the case for initialing an array whose length isn't specified,
1548 where we have not yet been able to do the layout,
1549 figure out the proper alignment now. */
1550 if (dont_output_data
&& DECL_SIZE (decl
) == 0
1551 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
)
1552 align
= MAX (align
, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl
))));
1554 /* Some object file formats have a maximum alignment which they support.
1555 In particular, a.out format supports a maximum alignment of 4. */
1556 #ifndef MAX_OFILE_ALIGNMENT
1557 #define MAX_OFILE_ALIGNMENT BIGGEST_ALIGNMENT
1559 if (align
> MAX_OFILE_ALIGNMENT
)
1561 warning_with_decl (decl
,
1562 "alignment of `%s' is greater than maximum object file alignment");
1563 align
= MAX_OFILE_ALIGNMENT
;
1565 #ifdef DATA_ALIGNMENT
1566 /* On some machines, it is good to increase alignment sometimes. */
1567 align
= DATA_ALIGNMENT (TREE_TYPE (decl
), align
);
1569 #ifdef CONSTANT_ALIGNMENT
1570 if (DECL_INITIAL (decl
))
1571 align
= CONSTANT_ALIGNMENT (DECL_INITIAL (decl
), align
);
1574 /* Reset the alignment in case we have made it tighter, so we can benefit
1575 from it in get_pointer_alignment. */
1576 DECL_ALIGN (decl
) = align
;
1578 if (align
> BITS_PER_UNIT
)
1580 if (output_bytecode
)
1581 BC_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
1583 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
1586 /* Do any machine/system dependent processing of the object. */
1587 if (output_bytecode
)
1588 BC_OUTPUT_LABEL (asm_out_file
, name
);
1591 #ifdef ASM_DECLARE_OBJECT_NAME
1592 last_assemble_variable_decl
= decl
;
1593 ASM_DECLARE_OBJECT_NAME (asm_out_file
, name
, decl
);
1595 /* Standard thing is just output label for the object. */
1596 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1597 #endif /* ASM_DECLARE_OBJECT_NAME */
1600 if (!dont_output_data
)
1602 if (DECL_INITIAL (decl
))
1603 /* Output the actual data. */
1604 output_constant (DECL_INITIAL (decl
), TREE_INT_CST_LOW (size_tree
));
1606 /* Leave space for it. */
1607 assemble_zeros (TREE_INT_CST_LOW (size_tree
));
1611 #ifdef XCOFF_DEBUGGING_INFO
1612 /* Unfortunately, the IBM assembler cannot handle stabx before the actual
1613 declaration. When something like ".stabx "aa:S-2",aa,133,0" is emitted
1614 and `aa' hasn't been output yet, the assembler generates a stab entry with
1615 a value of zero, in addition to creating an unnecessary external entry
1616 for `aa'. Hence, we must postpone dbxout_symbol to here at the end. */
1618 /* File-scope global variables are output here. */
1619 if (write_symbols
== XCOFF_DEBUG
&& top_level
)
1621 saved_in_section
= in_section
;
1623 dbxout_symbol (decl
, 0);
1625 if (in_section
!= saved_in_section
)
1626 variable_section (decl
, reloc
);
1629 /* There must be a statement after a label. */
1634 /* Return 1 if type TYPE contains any pointers. */
1637 contains_pointers_p (type
)
1640 switch (TREE_CODE (type
))
1643 case REFERENCE_TYPE
:
1644 /* I'm not sure whether OFFSET_TYPE needs this treatment,
1645 so I'll play safe and return 1. */
1651 case QUAL_UNION_TYPE
:
1654 /* For a type that has fields, see if the fields have pointers. */
1655 for (fields
= TYPE_FIELDS (type
); fields
; fields
= TREE_CHAIN (fields
))
1656 if (TREE_CODE (fields
) == FIELD_DECL
1657 && contains_pointers_p (TREE_TYPE (fields
)))
1663 /* An array type contains pointers if its element type does. */
1664 return contains_pointers_p (TREE_TYPE (type
));
1671 /* Output text storage for constructor CONSTR. */
1674 bc_output_constructor (constr
, size
)
1680 /* Must always be a literal; non-literal constructors are handled
1683 if (!TREE_CONSTANT (constr
))
1690 for (i
= 0; TYPE_ALIGN (constr
) >= BITS_PER_UNIT
<< (i
+ 1); i
++)
1694 BC_OUTPUT_ALIGN (asm_out_file
, i
);
1697 output_constant (constr
, size
);
1700 /* Create storage for constructor CONSTR. */
1703 bc_output_data_constructor (constr
)
1708 /* Put in data section */
1712 for (i
= 0; TYPE_ALIGN (constr
) >= BITS_PER_UNIT
<< (i
+ 1); i
++);
1714 BC_OUTPUT_ALIGN (asm_out_file
, i
);
1716 /* The constructor is filled in at runtime. */
1717 BC_OUTPUT_SKIP (asm_out_file
, int_size_in_bytes (TREE_TYPE (constr
)));
1720 /* Output something to declare an external symbol to the assembler.
1721 (Most assemblers don't need this, so we normally output nothing.)
1722 Do nothing if DECL is not external. */
1725 assemble_external (decl
)
1728 if (output_bytecode
)
1731 #ifdef ASM_OUTPUT_EXTERNAL
1732 if (TREE_CODE_CLASS (TREE_CODE (decl
)) == 'd'
1733 && DECL_EXTERNAL (decl
) && TREE_PUBLIC (decl
))
1735 rtx rtl
= DECL_RTL (decl
);
1737 if (GET_CODE (rtl
) == MEM
&& GET_CODE (XEXP (rtl
, 0)) == SYMBOL_REF
1738 && ! SYMBOL_REF_USED (XEXP (rtl
, 0)))
1740 /* Some systems do require some output. */
1741 SYMBOL_REF_USED (XEXP (rtl
, 0)) = 1;
1742 ASM_OUTPUT_EXTERNAL (asm_out_file
, decl
, XSTR (XEXP (rtl
, 0), 0));
1748 /* Similar, for calling a library function FUN. */
1751 assemble_external_libcall (fun
)
1754 #ifdef ASM_OUTPUT_EXTERNAL_LIBCALL
1755 if (!output_bytecode
)
1757 /* Declare library function name external when first used, if nec. */
1758 if (! SYMBOL_REF_USED (fun
))
1760 SYMBOL_REF_USED (fun
) = 1;
1761 ASM_OUTPUT_EXTERNAL_LIBCALL (asm_out_file
, fun
);
1767 /* Declare the label NAME global. */
1770 assemble_global (name
)
1773 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
1776 /* Assemble a label named NAME. */
1779 assemble_label (name
)
1782 if (output_bytecode
)
1783 BC_OUTPUT_LABEL (asm_out_file
, name
);
1785 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1788 /* Output to FILE a reference to the assembler name of a C-level name NAME.
1789 If NAME starts with a *, the rest of NAME is output verbatim.
1790 Otherwise NAME is transformed in an implementation-defined way
1791 (usually by the addition of an underscore).
1792 Many macros in the tm file are defined to call this function. */
1795 assemble_name (file
, name
)
1802 STRIP_NAME_ENCODING (real_name
, name
);
1803 if (flag_prefix_function_name
1804 && ! bcmp (real_name
, CHKR_PREFIX
, CHKR_PREFIX_SIZE
))
1805 real_name
= real_name
+ CHKR_PREFIX_SIZE
;
1807 id
= maybe_get_identifier (real_name
);
1809 TREE_SYMBOL_REFERENCED (id
) = 1;
1813 if (output_bytecode
)
1814 bc_emit_labelref (name
, 0);
1816 fputs (&name
[1], file
);
1820 if (output_bytecode
)
1821 BC_OUTPUT_LABELREF (file
, name
);
1823 ASM_OUTPUT_LABELREF (file
, name
);
1827 /* Allocate SIZE bytes writable static space with a gensym name
1828 and return an RTX to refer to its address. */
1831 assemble_static_space (size
)
1837 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1838 so that each uninitialized object starts on such a boundary. */
1839 int rounded
= ((size
+ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1)
1840 / (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1841 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1844 if (flag_shared_data
)
1848 ASM_GENERATE_INTERNAL_LABEL (name
, "LF", const_labelno
);
1851 namestring
= (char *) obstack_alloc (saveable_obstack
,
1853 strcpy (namestring
, name
);
1855 if (output_bytecode
)
1856 x
= bc_gen_rtx (namestring
, 0, (struct bc_label
*) 0);
1858 x
= gen_rtx (SYMBOL_REF
, Pmode
, namestring
);
1860 if (output_bytecode
)
1862 BC_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
1866 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1867 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file
, name
, size
, BIGGEST_ALIGNMENT
);
1869 ASM_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
1875 /* Assemble the static constant template for function entry trampolines.
1876 This is done at most once per compilation.
1877 Returns an RTX for the address of the template. */
1879 #ifdef TRAMPOLINE_TEMPLATE
1881 assemble_trampoline_template ()
1887 /* Shouldn't get here */
1888 if (output_bytecode
)
1891 /* By default, put trampoline templates in read-only data section. */
1893 #ifdef TRAMPOLINE_SECTION
1894 TRAMPOLINE_SECTION ();
1896 readonly_data_section ();
1899 /* Write the assembler code to define one. */
1900 align
= floor_log2 (TRAMPOLINE_ALIGNMENT
/ BITS_PER_UNIT
);
1902 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1904 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LTRAMP", 0);
1905 TRAMPOLINE_TEMPLATE (asm_out_file
);
1907 /* Record the rtl to refer to it. */
1908 ASM_GENERATE_INTERNAL_LABEL (label
, "LTRAMP", 0);
1910 = (char *) obstack_copy0 (&permanent_obstack
, label
, strlen (label
));
1911 return gen_rtx (SYMBOL_REF
, Pmode
, name
);
1915 /* Assemble the integer constant X into an object of SIZE bytes.
1916 X must be either a CONST_INT or CONST_DOUBLE.
1918 Return 1 if we were able to output the constant, otherwise 0. If FORCE is
1919 non-zero, abort if we can't output the constant. */
1922 assemble_integer (x
, size
, force
)
1927 /* First try to use the standard 1, 2, 4, 8, and 16 byte
1928 ASM_OUTPUT... macros. */
1932 #ifdef ASM_OUTPUT_CHAR
1934 ASM_OUTPUT_CHAR (asm_out_file
, x
);
1938 #ifdef ASM_OUTPUT_SHORT
1940 ASM_OUTPUT_SHORT (asm_out_file
, x
);
1944 #ifdef ASM_OUTPUT_INT
1946 ASM_OUTPUT_INT (asm_out_file
, x
);
1950 #ifdef ASM_OUTPUT_DOUBLE_INT
1952 ASM_OUTPUT_DOUBLE_INT (asm_out_file
, x
);
1956 #ifdef ASM_OUTPUT_QUADRUPLE_INT
1958 ASM_OUTPUT_QUADRUPLE_INT (asm_out_file
, x
);
1963 /* If we couldn't do it that way, there are two other possibilities: First,
1964 if the machine can output an explicit byte and this is a 1 byte constant,
1965 we can use ASM_OUTPUT_BYTE. */
1967 #ifdef ASM_OUTPUT_BYTE
1968 if (size
== 1 && GET_CODE (x
) == CONST_INT
)
1970 ASM_OUTPUT_BYTE (asm_out_file
, INTVAL (x
));
1975 /* Finally, if SIZE is larger than a single word, try to output the constant
1976 one word at a time. */
1978 if (size
> UNITS_PER_WORD
)
1981 enum machine_mode mode
1982 = mode_for_size (size
* BITS_PER_UNIT
, MODE_INT
, 0);
1985 for (i
= 0; i
< size
/ UNITS_PER_WORD
; i
++)
1987 word
= operand_subword (x
, i
, 0, mode
);
1992 if (! assemble_integer (word
, UNITS_PER_WORD
, 0))
1996 if (i
== size
/ UNITS_PER_WORD
)
1998 /* If we output at least one word and then could not finish,
1999 there is no valid way to continue. */
2010 /* Assemble the floating-point constant D into an object of size MODE. */
2013 assemble_real (d
, mode
)
2015 enum machine_mode mode
;
2017 jmp_buf output_constant_handler
;
2019 if (setjmp (output_constant_handler
))
2021 error ("floating point trap outputting a constant");
2022 #ifdef REAL_IS_NOT_DOUBLE
2023 bzero ((char *) &d
, sizeof d
);
2030 set_float_handler (output_constant_handler
);
2034 #ifdef ASM_OUTPUT_BYTE_FLOAT
2036 ASM_OUTPUT_BYTE_FLOAT (asm_out_file
, d
);
2039 #ifdef ASM_OUTPUT_SHORT_FLOAT
2041 ASM_OUTPUT_SHORT_FLOAT (asm_out_file
, d
);
2044 #ifdef ASM_OUTPUT_THREE_QUARTER_FLOAT
2046 ASM_OUTPUT_THREE_QUARTER_FLOAT (asm_out_file
, d
);
2049 #ifdef ASM_OUTPUT_FLOAT
2051 ASM_OUTPUT_FLOAT (asm_out_file
, d
);
2055 #ifdef ASM_OUTPUT_DOUBLE
2057 ASM_OUTPUT_DOUBLE (asm_out_file
, d
);
2061 #ifdef ASM_OUTPUT_LONG_DOUBLE
2064 ASM_OUTPUT_LONG_DOUBLE (asm_out_file
, d
);
2072 set_float_handler (NULL_PTR
);
2075 /* Here we combine duplicate floating constants to make
2076 CONST_DOUBLE rtx's, and force those out to memory when necessary. */
2078 /* Chain of all CONST_DOUBLE rtx's constructed for the current function.
2079 They are chained through the CONST_DOUBLE_CHAIN.
2080 A CONST_DOUBLE rtx has CONST_DOUBLE_MEM != cc0_rtx iff it is on this chain.
2081 In that case, CONST_DOUBLE_MEM is either a MEM,
2082 or const0_rtx if no MEM has been made for this CONST_DOUBLE yet.
2084 (CONST_DOUBLE_MEM is used only for top-level functions.
2085 See force_const_mem for explanation.) */
2087 static rtx const_double_chain
;
2089 /* Return a CONST_DOUBLE or CONST_INT for a value specified as a pair of ints.
2090 For an integer, I0 is the low-order word and I1 is the high-order word.
2091 For a real number, I0 is the word with the low address
2092 and I1 is the word with the high address. */
2095 immed_double_const (i0
, i1
, mode
)
2096 HOST_WIDE_INT i0
, i1
;
2097 enum machine_mode mode
;
2100 int in_current_obstack
;
2102 if (GET_MODE_CLASS (mode
) == MODE_INT
2103 || GET_MODE_CLASS (mode
) == MODE_PARTIAL_INT
)
2105 /* We clear out all bits that don't belong in MODE, unless they and our
2106 sign bit are all one. So we get either a reasonable negative value
2107 or a reasonable unsigned value for this mode. */
2108 int width
= GET_MODE_BITSIZE (mode
);
2109 if (width
< HOST_BITS_PER_WIDE_INT
2110 && ((i0
& ((HOST_WIDE_INT
) (-1) << (width
- 1)))
2111 != ((HOST_WIDE_INT
) (-1) << (width
- 1))))
2112 i0
&= ((HOST_WIDE_INT
) 1 << width
) - 1, i1
= 0;
2113 else if (width
== HOST_BITS_PER_WIDE_INT
2114 && ! (i1
== ~0 && i0
< 0))
2116 else if (width
> 2 * HOST_BITS_PER_WIDE_INT
)
2117 /* We cannot represent this value as a constant. */
2120 /* If this would be an entire word for the target, but is not for
2121 the host, then sign-extend on the host so that the number will look
2122 the same way on the host that it would on the target.
2124 For example, when building a 64 bit alpha hosted 32 bit sparc
2125 targeted compiler, then we want the 32 bit unsigned value -1 to be
2126 represented as a 64 bit value -1, and not as 0x00000000ffffffff.
2127 The later confuses the sparc backend. */
2129 if (BITS_PER_WORD
< HOST_BITS_PER_WIDE_INT
&& BITS_PER_WORD
== width
2130 && (i0
& ((HOST_WIDE_INT
) 1 << (width
- 1))))
2131 i0
|= ((HOST_WIDE_INT
) (-1) << width
);
2133 /* If MODE fits within HOST_BITS_PER_WIDE_INT, always use a CONST_INT.
2135 ??? Strictly speaking, this is wrong if we create a CONST_INT
2136 for a large unsigned constant with the size of MODE being
2137 HOST_BITS_PER_WIDE_INT and later try to interpret that constant in a
2138 wider mode. In that case we will mis-interpret it as a negative
2141 Unfortunately, the only alternative is to make a CONST_DOUBLE
2142 for any constant in any mode if it is an unsigned constant larger
2143 than the maximum signed integer in an int on the host. However,
2144 doing this will break everyone that always expects to see a CONST_INT
2145 for SImode and smaller.
2147 We have always been making CONST_INTs in this case, so nothing new
2150 if (width
<= HOST_BITS_PER_WIDE_INT
)
2151 i1
= (i0
< 0) ? ~0 : 0;
2153 /* If this integer fits in one word, return a CONST_INT. */
2154 if ((i1
== 0 && i0
>= 0)
2155 || (i1
== ~0 && i0
< 0))
2156 return GEN_INT (i0
);
2158 /* We use VOIDmode for integers. */
2162 /* Search the chain for an existing CONST_DOUBLE with the right value.
2163 If one is found, return it. */
2165 for (r
= const_double_chain
; r
; r
= CONST_DOUBLE_CHAIN (r
))
2166 if (CONST_DOUBLE_LOW (r
) == i0
&& CONST_DOUBLE_HIGH (r
) == i1
2167 && GET_MODE (r
) == mode
)
2170 /* No; make a new one and add it to the chain.
2172 We may be called by an optimizer which may be discarding any memory
2173 allocated during its processing (such as combine and loop). However,
2174 we will be leaving this constant on the chain, so we cannot tolerate
2175 freed memory. So switch to saveable_obstack for this allocation
2176 and then switch back if we were in current_obstack. */
2178 push_obstacks_nochange ();
2179 rtl_in_saveable_obstack ();
2180 r
= gen_rtx (CONST_DOUBLE
, mode
, 0, i0
, i1
);
2183 /* Don't touch const_double_chain in nested function; see force_const_mem.
2184 Also, don't touch it if not inside any function. */
2185 if (outer_function_chain
== 0 && current_function_decl
!= 0)
2187 CONST_DOUBLE_CHAIN (r
) = const_double_chain
;
2188 const_double_chain
= r
;
2191 /* Store const0_rtx in mem-slot since this CONST_DOUBLE is on the chain.
2192 Actual use of mem-slot is only through force_const_mem. */
2194 CONST_DOUBLE_MEM (r
) = const0_rtx
;
2199 /* Return a CONST_DOUBLE for a specified `double' value
2200 and machine mode. */
2203 immed_real_const_1 (d
, mode
)
2205 enum machine_mode mode
;
2207 union real_extract u
;
2209 int in_current_obstack
;
2211 /* Get the desired `double' value as a sequence of ints
2212 since that is how they are stored in a CONST_DOUBLE. */
2216 /* Detect special cases. */
2218 /* Avoid REAL_VALUES_EQUAL here in order to distinguish minus zero. */
2219 if (!bcmp ((char *) &dconst0
, (char *) &d
, sizeof d
))
2220 return CONST0_RTX (mode
);
2221 /* Check for NaN first, because some ports (specifically the i386) do not
2222 emit correct ieee-fp code by default, and thus will generate a core
2223 dump here if we pass a NaN to REAL_VALUES_EQUAL and if REAL_VALUES_EQUAL
2224 does a floating point comparison. */
2225 else if (! REAL_VALUE_ISNAN (d
) && REAL_VALUES_EQUAL (dconst1
, d
))
2226 return CONST1_RTX (mode
);
2228 if (sizeof u
== 2 * sizeof (HOST_WIDE_INT
))
2229 return immed_double_const (u
.i
[0], u
.i
[1], mode
);
2231 /* The rest of this function handles the case where
2232 a float value requires more than 2 ints of space.
2233 It will be deleted as dead code on machines that don't need it. */
2235 /* Search the chain for an existing CONST_DOUBLE with the right value.
2236 If one is found, return it. */
2238 for (r
= const_double_chain
; r
; r
= CONST_DOUBLE_CHAIN (r
))
2239 if (! bcmp ((char *) &CONST_DOUBLE_LOW (r
), (char *) &u
, sizeof u
)
2240 && GET_MODE (r
) == mode
)
2243 /* No; make a new one and add it to the chain.
2245 We may be called by an optimizer which may be discarding any memory
2246 allocated during its processing (such as combine and loop). However,
2247 we will be leaving this constant on the chain, so we cannot tolerate
2248 freed memory. So switch to saveable_obstack for this allocation
2249 and then switch back if we were in current_obstack. */
2251 push_obstacks_nochange ();
2252 rtl_in_saveable_obstack ();
2253 r
= rtx_alloc (CONST_DOUBLE
);
2255 bcopy ((char *) &u
, (char *) &CONST_DOUBLE_LOW (r
), sizeof u
);
2258 /* Don't touch const_double_chain in nested function; see force_const_mem.
2259 Also, don't touch it if not inside any function. */
2260 if (outer_function_chain
== 0 && current_function_decl
!= 0)
2262 CONST_DOUBLE_CHAIN (r
) = const_double_chain
;
2263 const_double_chain
= r
;
2266 /* Store const0_rtx in CONST_DOUBLE_MEM since this CONST_DOUBLE is on the
2267 chain, but has not been allocated memory. Actual use of CONST_DOUBLE_MEM
2268 is only through force_const_mem. */
2270 CONST_DOUBLE_MEM (r
) = const0_rtx
;
2275 /* Return a CONST_DOUBLE rtx for a value specified by EXP,
2276 which must be a REAL_CST tree node. */
2279 immed_real_const (exp
)
2282 return immed_real_const_1 (TREE_REAL_CST (exp
), TYPE_MODE (TREE_TYPE (exp
)));
2285 /* At the end of a function, forget the memory-constants
2286 previously made for CONST_DOUBLEs. Mark them as not on real_constant_chain.
2287 Also clear out real_constant_chain and clear out all the chain-pointers. */
2290 clear_const_double_mem ()
2292 register rtx r
, next
;
2294 /* Don't touch CONST_DOUBLE_MEM for nested functions.
2295 See force_const_mem for explanation. */
2296 if (outer_function_chain
!= 0)
2299 for (r
= const_double_chain
; r
; r
= next
)
2301 next
= CONST_DOUBLE_CHAIN (r
);
2302 CONST_DOUBLE_CHAIN (r
) = 0;
2303 CONST_DOUBLE_MEM (r
) = cc0_rtx
;
2305 const_double_chain
= 0;
2308 /* Given an expression EXP with a constant value,
2309 reduce it to the sum of an assembler symbol and an integer.
2310 Store them both in the structure *VALUE.
2311 Abort if EXP does not reduce. */
2316 HOST_WIDE_INT offset
;
2320 decode_addr_const (exp
, value
)
2322 struct addr_const
*value
;
2324 register tree target
= TREE_OPERAND (exp
, 0);
2325 register int offset
= 0;
2330 if (TREE_CODE (target
) == COMPONENT_REF
2331 && (TREE_CODE (DECL_FIELD_BITPOS (TREE_OPERAND (target
, 1)))
2334 offset
+= TREE_INT_CST_LOW (DECL_FIELD_BITPOS (TREE_OPERAND (target
, 1))) / BITS_PER_UNIT
;
2335 target
= TREE_OPERAND (target
, 0);
2337 else if (TREE_CODE (target
) == ARRAY_REF
)
2339 if (TREE_CODE (TREE_OPERAND (target
, 1)) != INTEGER_CST
2340 || TREE_CODE (TYPE_SIZE (TREE_TYPE (target
))) != INTEGER_CST
)
2342 offset
+= ((TREE_INT_CST_LOW (TYPE_SIZE (TREE_TYPE (target
)))
2343 * TREE_INT_CST_LOW (TREE_OPERAND (target
, 1)))
2345 target
= TREE_OPERAND (target
, 0);
2351 switch (TREE_CODE (target
))
2355 x
= DECL_RTL (target
);
2359 if (output_bytecode
)
2360 /* FIXME: this may not be correct, check it */
2361 x
= bc_gen_rtx (TREE_STRING_POINTER (target
), 0, (struct bc_label
*) 0);
2363 x
= gen_rtx (MEM
, FUNCTION_MODE
,
2364 gen_rtx (LABEL_REF
, VOIDmode
,
2365 label_rtx (TREE_OPERAND (exp
, 0))));
2373 x
= TREE_CST_RTL (target
);
2380 if (!output_bytecode
)
2382 if (GET_CODE (x
) != MEM
)
2388 value
->offset
= offset
;
2391 /* Uniquize all constants that appear in memory.
2392 Each constant in memory thus far output is recorded
2393 in `const_hash_table' with a `struct constant_descriptor'
2394 that contains a polish representation of the value of
2397 We cannot store the trees in the hash table
2398 because the trees may be temporary. */
2400 struct constant_descriptor
2402 struct constant_descriptor
*next
;
2408 #define MAX_HASH_TABLE 1009
2409 static struct constant_descriptor
*const_hash_table
[MAX_HASH_TABLE
];
2411 /* Compute a hash code for a constant expression. */
2418 register int len
, hi
, i
;
2419 register enum tree_code code
= TREE_CODE (exp
);
2421 /* Either set P and LEN to the address and len of something to hash and
2422 exit the switch or return a value. */
2427 p
= (char *) &TREE_INT_CST_LOW (exp
);
2428 len
= 2 * sizeof TREE_INT_CST_LOW (exp
);
2432 p
= (char *) &TREE_REAL_CST (exp
);
2433 len
= sizeof TREE_REAL_CST (exp
);
2437 p
= TREE_STRING_POINTER (exp
);
2438 len
= TREE_STRING_LENGTH (exp
);
2442 return (const_hash (TREE_REALPART (exp
)) * 5
2443 + const_hash (TREE_IMAGPART (exp
)));
2446 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2448 len
= int_size_in_bytes (TREE_TYPE (exp
));
2449 p
= (char *) alloca (len
);
2450 get_set_constructor_bytes (exp
, (unsigned char *) p
, len
);
2457 /* For record type, include the type in the hashing.
2458 We do not do so for array types
2459 because (1) the sizes of the elements are sufficient
2460 and (2) distinct array types can have the same constructor.
2461 Instead, we include the array size because the constructor could
2463 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2464 hi
= ((HOST_WIDE_INT
) TREE_TYPE (exp
) & ((1 << HASHBITS
) - 1))
2467 hi
= ((5 + int_size_in_bytes (TREE_TYPE (exp
)))
2468 & ((1 << HASHBITS
) - 1)) % MAX_HASH_TABLE
;
2470 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2471 if (TREE_VALUE (link
))
2473 = (hi
* 603 + const_hash (TREE_VALUE (link
))) % MAX_HASH_TABLE
;
2480 struct addr_const value
;
2482 decode_addr_const (exp
, &value
);
2483 if (GET_CODE (value
.base
) == SYMBOL_REF
)
2485 /* Don't hash the address of the SYMBOL_REF;
2486 only use the offset and the symbol name. */
2488 p
= XSTR (value
.base
, 0);
2489 for (i
= 0; p
[i
] != 0; i
++)
2490 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2492 else if (GET_CODE (value
.base
) == LABEL_REF
)
2493 hi
= value
.offset
+ CODE_LABEL_NUMBER (XEXP (value
.base
, 0)) * 13;
2495 hi
&= (1 << HASHBITS
) - 1;
2496 hi
%= MAX_HASH_TABLE
;
2502 return (const_hash (TREE_OPERAND (exp
, 0)) * 9
2503 + const_hash (TREE_OPERAND (exp
, 1)));
2507 case NON_LVALUE_EXPR
:
2508 return const_hash (TREE_OPERAND (exp
, 0)) * 7 + 2;
2511 /* Compute hashing function */
2513 for (i
= 0; i
< len
; i
++)
2514 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2516 hi
&= (1 << HASHBITS
) - 1;
2517 hi
%= MAX_HASH_TABLE
;
2521 /* Compare a constant expression EXP with a constant-descriptor DESC.
2522 Return 1 if DESC describes a constant with the same value as EXP. */
2525 compare_constant (exp
, desc
)
2527 struct constant_descriptor
*desc
;
2529 return 0 != compare_constant_1 (exp
, desc
->contents
);
2532 /* Compare constant expression EXP with a substring P of a constant descriptor.
2533 If they match, return a pointer to the end of the substring matched.
2534 If they do not match, return 0.
2536 Since descriptors are written in polish prefix notation,
2537 this function can be used recursively to test one operand of EXP
2538 against a subdescriptor, and if it succeeds it returns the
2539 address of the subdescriptor for the next operand. */
2542 compare_constant_1 (exp
, p
)
2546 register char *strp
;
2548 register enum tree_code code
= TREE_CODE (exp
);
2550 if (code
!= (enum tree_code
) *p
++)
2553 /* Either set STRP, P and LEN to pointers and length to compare and exit the
2554 switch, or return the result of the comparison. */
2559 /* Integer constants are the same only if the same width of type. */
2560 if (*p
++ != TYPE_PRECISION (TREE_TYPE (exp
)))
2563 strp
= (char *) &TREE_INT_CST_LOW (exp
);
2564 len
= 2 * sizeof TREE_INT_CST_LOW (exp
);
2568 /* Real constants are the same only if the same width of type. */
2569 if (*p
++ != TYPE_PRECISION (TREE_TYPE (exp
)))
2572 strp
= (char *) &TREE_REAL_CST (exp
);
2573 len
= sizeof TREE_REAL_CST (exp
);
2577 if (flag_writable_strings
)
2580 if (*p
++ != TYPE_MODE (TREE_TYPE (exp
)))
2583 strp
= TREE_STRING_POINTER (exp
);
2584 len
= TREE_STRING_LENGTH (exp
);
2585 if (bcmp ((char *) &TREE_STRING_LENGTH (exp
), p
,
2586 sizeof TREE_STRING_LENGTH (exp
)))
2589 p
+= sizeof TREE_STRING_LENGTH (exp
);
2593 p
= compare_constant_1 (TREE_REALPART (exp
), p
);
2597 return compare_constant_1 (TREE_IMAGPART (exp
), p
);
2600 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2602 int xlen
= len
= int_size_in_bytes (TREE_TYPE (exp
));
2604 strp
= (char *) alloca (len
);
2605 get_set_constructor_bytes (exp
, (unsigned char *) strp
, len
);
2606 if (bcmp ((char *) &xlen
, p
, sizeof xlen
))
2615 int length
= list_length (CONSTRUCTOR_ELTS (exp
));
2618 if (bcmp ((char *) &length
, p
, sizeof length
))
2623 /* For record constructors, insist that the types match.
2624 For arrays, just verify both constructors are for arrays. */
2625 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2626 type
= TREE_TYPE (exp
);
2630 if (bcmp ((char *) &type
, p
, sizeof type
))
2635 /* For arrays, insist that the size in bytes match. */
2636 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2638 int size
= int_size_in_bytes (TREE_TYPE (exp
));
2639 if (bcmp ((char *) &size
, p
, sizeof size
))
2645 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2647 if (TREE_VALUE (link
))
2649 if ((p
= compare_constant_1 (TREE_VALUE (link
), p
)) == 0)
2656 if (bcmp ((char *) &zero
, p
, sizeof zero
))
2668 struct addr_const value
;
2670 decode_addr_const (exp
, &value
);
2671 strp
= (char *) &value
.offset
;
2672 len
= sizeof value
.offset
;
2673 /* Compare the offset. */
2675 if (*p
++ != *strp
++)
2678 /* Compare symbol name. */
2679 strp
= XSTR (value
.base
, 0);
2680 len
= strlen (strp
) + 1;
2686 p
= compare_constant_1 (TREE_OPERAND (exp
, 0), p
);
2690 return compare_constant_1 (TREE_OPERAND (exp
, 1), p
);
2694 case NON_LVALUE_EXPR
:
2695 return compare_constant_1 (TREE_OPERAND (exp
, 0), p
);
2698 /* Compare constant contents. */
2700 if (*p
++ != *strp
++)
2706 /* Construct a constant descriptor for the expression EXP.
2707 It is up to the caller to enter the descriptor in the hash table. */
2709 static struct constant_descriptor
*
2710 record_constant (exp
)
2713 struct constant_descriptor
*next
= 0;
2716 /* Make a struct constant_descriptor. The first two pointers will
2717 be filled in later. Here we just leave space for them. */
2719 obstack_grow (&permanent_obstack
, (char *) &next
, sizeof next
);
2720 obstack_grow (&permanent_obstack
, (char *) &label
, sizeof label
);
2721 record_constant_1 (exp
);
2722 return (struct constant_descriptor
*) obstack_finish (&permanent_obstack
);
2725 /* Add a description of constant expression EXP
2726 to the object growing in `permanent_obstack'.
2727 No need to return its address; the caller will get that
2728 from the obstack when the object is complete. */
2731 record_constant_1 (exp
)
2734 register char *strp
;
2736 register enum tree_code code
= TREE_CODE (exp
);
2738 obstack_1grow (&permanent_obstack
, (unsigned int) code
);
2743 obstack_1grow (&permanent_obstack
, TYPE_PRECISION (TREE_TYPE (exp
)));
2744 strp
= (char *) &TREE_INT_CST_LOW (exp
);
2745 len
= 2 * sizeof TREE_INT_CST_LOW (exp
);
2749 obstack_1grow (&permanent_obstack
, TYPE_PRECISION (TREE_TYPE (exp
)));
2750 strp
= (char *) &TREE_REAL_CST (exp
);
2751 len
= sizeof TREE_REAL_CST (exp
);
2755 if (flag_writable_strings
)
2758 obstack_1grow (&permanent_obstack
, TYPE_MODE (TREE_TYPE (exp
)));
2759 strp
= TREE_STRING_POINTER (exp
);
2760 len
= TREE_STRING_LENGTH (exp
);
2761 obstack_grow (&permanent_obstack
, (char *) &TREE_STRING_LENGTH (exp
),
2762 sizeof TREE_STRING_LENGTH (exp
));
2766 record_constant_1 (TREE_REALPART (exp
));
2767 record_constant_1 (TREE_IMAGPART (exp
));
2771 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2773 int nbytes
= int_size_in_bytes (TREE_TYPE (exp
));
2774 obstack_grow (&permanent_obstack
, &nbytes
, sizeof (nbytes
));
2775 obstack_blank (&permanent_obstack
, nbytes
);
2776 get_set_constructor_bytes
2777 (exp
, (unsigned char *) permanent_obstack
.next_free
-nbytes
,
2784 int length
= list_length (CONSTRUCTOR_ELTS (exp
));
2787 obstack_grow (&permanent_obstack
, (char *) &length
, sizeof length
);
2789 /* For record constructors, insist that the types match.
2790 For arrays, just verify both constructors are for arrays. */
2791 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2792 type
= TREE_TYPE (exp
);
2795 obstack_grow (&permanent_obstack
, (char *) &type
, sizeof type
);
2797 /* For arrays, insist that the size in bytes match. */
2798 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2800 int size
= int_size_in_bytes (TREE_TYPE (exp
));
2801 obstack_grow (&permanent_obstack
, (char *) &size
, sizeof size
);
2804 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2806 if (TREE_VALUE (link
))
2807 record_constant_1 (TREE_VALUE (link
));
2812 obstack_grow (&permanent_obstack
,
2813 (char *) &zero
, sizeof zero
);
2821 struct addr_const value
;
2823 decode_addr_const (exp
, &value
);
2824 /* Record the offset. */
2825 obstack_grow (&permanent_obstack
,
2826 (char *) &value
.offset
, sizeof value
.offset
);
2827 /* Record the symbol name. */
2828 obstack_grow (&permanent_obstack
, XSTR (value
.base
, 0),
2829 strlen (XSTR (value
.base
, 0)) + 1);
2835 record_constant_1 (TREE_OPERAND (exp
, 0));
2836 record_constant_1 (TREE_OPERAND (exp
, 1));
2841 case NON_LVALUE_EXPR
:
2842 record_constant_1 (TREE_OPERAND (exp
, 0));
2849 /* Record constant contents. */
2850 obstack_grow (&permanent_obstack
, strp
, len
);
2853 /* Record a list of constant expressions that were passed to
2854 output_constant_def but that could not be output right away. */
2856 struct deferred_constant
2858 struct deferred_constant
*next
;
2864 static struct deferred_constant
*deferred_constants
;
2866 /* Another list of constants which should be output after the
2868 static struct deferred_constant
*after_function_constants
;
2870 /* Nonzero means defer output of addressed subconstants
2871 (i.e., those for which output_constant_def is called.) */
2872 static int defer_addressed_constants_flag
;
2874 /* Start deferring output of subconstants. */
2877 defer_addressed_constants ()
2879 defer_addressed_constants_flag
++;
2882 /* Stop deferring output of subconstants,
2883 and output now all those that have been deferred. */
2886 output_deferred_addressed_constants ()
2888 struct deferred_constant
*p
, *next
;
2890 defer_addressed_constants_flag
--;
2892 if (defer_addressed_constants_flag
> 0)
2895 for (p
= deferred_constants
; p
; p
= next
)
2897 output_constant_def_contents (p
->exp
, p
->reloc
, p
->labelno
);
2902 deferred_constants
= 0;
2905 /* Output any constants which should appear after a function. */
2908 output_after_function_constants ()
2910 struct deferred_constant
*p
, *next
;
2912 for (p
= after_function_constants
; p
; p
= next
)
2914 output_constant_def_contents (p
->exp
, p
->reloc
, p
->labelno
);
2919 after_function_constants
= 0;
2922 /* Make a copy of the whole tree structure for a constant.
2923 This handles the same types of nodes that compare_constant
2924 and record_constant handle. */
2930 switch (TREE_CODE (exp
))
2933 /* For ADDR_EXPR, we do not want to copy the decl whose address
2934 is requested. We do want to copy constants though. */
2935 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, 0))) == 'c')
2936 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2937 copy_constant (TREE_OPERAND (exp
, 0)));
2939 return copy_node (exp
);
2944 return copy_node (exp
);
2947 return build_complex (TREE_TYPE (exp
),
2948 copy_constant (TREE_REALPART (exp
)),
2949 copy_constant (TREE_IMAGPART (exp
)));
2953 return build (TREE_CODE (exp
), TREE_TYPE (exp
),
2954 copy_constant (TREE_OPERAND (exp
, 0)),
2955 copy_constant (TREE_OPERAND (exp
, 1)));
2959 case NON_LVALUE_EXPR
:
2960 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2961 copy_constant (TREE_OPERAND (exp
, 0)));
2965 tree copy
= copy_node (exp
);
2966 tree list
= copy_list (CONSTRUCTOR_ELTS (exp
));
2969 CONSTRUCTOR_ELTS (copy
) = list
;
2970 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
2971 TREE_VALUE (tail
) = copy_constant (TREE_VALUE (tail
));
2972 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2973 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
2974 TREE_PURPOSE (tail
) = copy_constant (TREE_PURPOSE (tail
));
2984 /* Return an rtx representing a reference to constant data in memory
2985 for the constant expression EXP.
2987 If assembler code for such a constant has already been output,
2988 return an rtx to refer to it.
2989 Otherwise, output such a constant in memory (or defer it for later)
2990 and generate an rtx for it.
2992 The TREE_CST_RTL of EXP is set up to point to that rtx.
2993 The const_hash_table records which constants already have label strings. */
2996 output_constant_def (exp
)
3000 register struct constant_descriptor
*desc
;
3006 if (TREE_CST_RTL (exp
))
3007 return TREE_CST_RTL (exp
);
3009 /* Make sure any other constants whose addresses appear in EXP
3010 are assigned label numbers. */
3012 reloc
= output_addressed_constants (exp
);
3014 /* Compute hash code of EXP. Search the descriptors for that hash code
3015 to see if any of them describes EXP. If yes, the descriptor records
3016 the label number already assigned. */
3018 hash
= const_hash (exp
) % MAX_HASH_TABLE
;
3020 for (desc
= const_hash_table
[hash
]; desc
; desc
= desc
->next
)
3021 if (compare_constant (exp
, desc
))
3023 found
= desc
->label
;
3029 /* No constant equal to EXP is known to have been output.
3030 Make a constant descriptor to enter EXP in the hash table.
3031 Assign the label number and record it in the descriptor for
3032 future calls to this function to find. */
3034 /* Create a string containing the label name, in LABEL. */
3035 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
3037 desc
= record_constant (exp
);
3038 desc
->next
= const_hash_table
[hash
];
3040 = (char *) obstack_copy0 (&permanent_obstack
, label
, strlen (label
));
3041 const_hash_table
[hash
] = desc
;
3045 /* Create a string containing the label name, in LABEL. */
3046 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
3049 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
3051 push_obstacks_nochange ();
3052 if (TREE_PERMANENT (exp
))
3053 end_temporary_allocation ();
3055 def
= gen_rtx (SYMBOL_REF
, Pmode
, desc
->label
);
3058 = gen_rtx (MEM
, TYPE_MODE (TREE_TYPE (exp
)), def
);
3059 RTX_UNCHANGING_P (TREE_CST_RTL (exp
)) = 1;
3060 if (AGGREGATE_TYPE_P (TREE_TYPE (exp
)))
3061 MEM_IN_STRUCT_P (TREE_CST_RTL (exp
)) = 1;
3065 /* Optionally set flags or add text to the name to record information
3066 such as that it is a function name. If the name is changed, the macro
3067 ASM_OUTPUT_LABELREF will have to know how to strip this information. */
3068 #ifdef ENCODE_SECTION_INFO
3069 ENCODE_SECTION_INFO (exp
);
3072 /* If this is the first time we've seen this particular constant,
3073 output it (or defer its output for later). */
3076 int after_function
= 0;
3078 #ifdef CONSTANT_AFTER_FUNCTION_P
3079 if (current_function_decl
!= 0
3080 && CONSTANT_AFTER_FUNCTION_P (exp
))
3084 if (defer_addressed_constants_flag
|| after_function
)
3086 struct deferred_constant
*p
;
3087 p
= (struct deferred_constant
*) xmalloc (sizeof (struct deferred_constant
));
3089 push_obstacks_nochange ();
3090 suspend_momentary ();
3091 p
->exp
= copy_constant (exp
);
3094 p
->labelno
= const_labelno
++;
3097 p
->next
= after_function_constants
;
3098 after_function_constants
= p
;
3102 p
->next
= deferred_constants
;
3103 deferred_constants
= p
;
3107 output_constant_def_contents (exp
, reloc
, const_labelno
++);
3110 return TREE_CST_RTL (exp
);
3113 /* Now output assembler code to define the label for EXP,
3114 and follow it with the data of EXP. */
3117 output_constant_def_contents (exp
, reloc
, labelno
)
3124 if (IN_NAMED_SECTION (exp
))
3125 named_section (exp
, NULL
, reloc
);
3128 /* First switch to text section, except for writable strings. */
3129 #ifdef SELECT_SECTION
3130 SELECT_SECTION (exp
, reloc
);
3132 if (((TREE_CODE (exp
) == STRING_CST
) && flag_writable_strings
)
3133 || (flag_pic
&& reloc
))
3136 readonly_data_section ();
3140 /* Align the location counter as required by EXP's data type. */
3141 align
= TYPE_ALIGN (TREE_TYPE (exp
));
3142 #ifdef CONSTANT_ALIGNMENT
3143 align
= CONSTANT_ALIGNMENT (exp
, align
);
3146 if (align
> BITS_PER_UNIT
)
3148 if (!output_bytecode
)
3150 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
3154 BC_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
3158 /* Output the label itself. */
3159 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LC", labelno
);
3161 /* Output the value of EXP. */
3162 output_constant (exp
,
3163 (TREE_CODE (exp
) == STRING_CST
3164 ? TREE_STRING_LENGTH (exp
)
3165 : int_size_in_bytes (TREE_TYPE (exp
))));
3169 /* Similar hash facility for making memory-constants
3170 from constant rtl-expressions. It is used on RISC machines
3171 where immediate integer arguments and constant addresses are restricted
3172 so that such constants must be stored in memory.
3174 This pool of constants is reinitialized for each function
3175 so each function gets its own constants-pool that comes right before it.
3177 All structures allocated here are discarded when functions are saved for
3178 inlining, so they do not need to be allocated permanently. */
3180 #define MAX_RTX_HASH_TABLE 61
3181 static struct constant_descriptor
**const_rtx_hash_table
;
3183 /* Structure to represent sufficient information about a constant so that
3184 it can be output when the constant pool is output, so that function
3185 integration can be done, and to simplify handling on machines that reference
3186 constant pool as base+displacement. */
3188 struct pool_constant
3190 struct constant_descriptor
*desc
;
3191 struct pool_constant
*next
;
3192 enum machine_mode mode
;
3200 /* Pointers to first and last constant in pool. */
3202 static struct pool_constant
*first_pool
, *last_pool
;
3204 /* Current offset in constant pool (does not include any machine-specific
3207 static int pool_offset
;
3209 /* Structure used to maintain hash table mapping symbols used to their
3210 corresponding constants. */
3215 struct pool_constant
*pool
;
3216 struct pool_sym
*next
;
3219 static struct pool_sym
**const_rtx_sym_hash_table
;
3221 /* Hash code for a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true.
3222 The argument is XSTR (... , 0) */
3224 #define SYMHASH(LABEL) \
3225 ((((HOST_WIDE_INT) (LABEL)) & ((1 << HASHBITS) - 1)) % MAX_RTX_HASH_TABLE)
3227 /* Initialize constant pool hashing for next function. */
3230 init_const_rtx_hash_table ()
3232 const_rtx_hash_table
3233 = ((struct constant_descriptor
**)
3234 oballoc (MAX_RTX_HASH_TABLE
* sizeof (struct constant_descriptor
*)));
3235 const_rtx_sym_hash_table
3236 = ((struct pool_sym
**)
3237 oballoc (MAX_RTX_HASH_TABLE
* sizeof (struct pool_sym
*)));
3238 bzero ((char *) const_rtx_hash_table
,
3239 MAX_RTX_HASH_TABLE
* sizeof (struct constant_descriptor
*));
3240 bzero ((char *) const_rtx_sym_hash_table
,
3241 MAX_RTX_HASH_TABLE
* sizeof (struct pool_sym
*));
3243 first_pool
= last_pool
= 0;
3247 /* Save and restore status for a nested function. */
3250 save_varasm_status (p
)
3253 p
->const_rtx_hash_table
= const_rtx_hash_table
;
3254 p
->const_rtx_sym_hash_table
= const_rtx_sym_hash_table
;
3255 p
->first_pool
= first_pool
;
3256 p
->last_pool
= last_pool
;
3257 p
->pool_offset
= pool_offset
;
3261 restore_varasm_status (p
)
3264 const_rtx_hash_table
= p
->const_rtx_hash_table
;
3265 const_rtx_sym_hash_table
= p
->const_rtx_sym_hash_table
;
3266 first_pool
= p
->first_pool
;
3267 last_pool
= p
->last_pool
;
3268 pool_offset
= p
->pool_offset
;
3271 enum kind
{ RTX_DOUBLE
, RTX_INT
};
3275 #ifdef ONLY_INT_FIELDS
3276 unsigned int kind
: 16;
3277 unsigned int mode
: 16;
3279 enum kind kind
: 16;
3280 enum machine_mode mode
: 16;
3283 union real_extract du
;
3284 struct addr_const addr
;
3285 struct {HOST_WIDE_INT high
, low
;} di
;
3289 /* Express an rtx for a constant integer (perhaps symbolic)
3290 as the sum of a symbol or label plus an explicit integer.
3291 They are stored into VALUE. */
3294 decode_rtx_const (mode
, x
, value
)
3295 enum machine_mode mode
;
3297 struct rtx_const
*value
;
3299 /* Clear the whole structure, including any gaps. */
3302 int *p
= (int *) value
;
3303 int *end
= (int *) (value
+ 1);
3308 value
->kind
= RTX_INT
; /* Most usual kind. */
3311 switch (GET_CODE (x
))
3314 value
->kind
= RTX_DOUBLE
;
3315 if (GET_MODE (x
) != VOIDmode
)
3317 value
->mode
= GET_MODE (x
);
3318 bcopy ((char *) &CONST_DOUBLE_LOW (x
),
3319 (char *) &value
->un
.du
, sizeof value
->un
.du
);
3323 value
->un
.di
.low
= CONST_DOUBLE_LOW (x
);
3324 value
->un
.di
.high
= CONST_DOUBLE_HIGH (x
);
3329 value
->un
.addr
.offset
= INTVAL (x
);
3335 value
->un
.addr
.base
= x
;
3340 if (GET_CODE (x
) == PLUS
)
3342 value
->un
.addr
.base
= XEXP (x
, 0);
3343 if (GET_CODE (XEXP (x
, 1)) != CONST_INT
)
3345 value
->un
.addr
.offset
= INTVAL (XEXP (x
, 1));
3347 else if (GET_CODE (x
) == MINUS
)
3349 value
->un
.addr
.base
= XEXP (x
, 0);
3350 if (GET_CODE (XEXP (x
, 1)) != CONST_INT
)
3352 value
->un
.addr
.offset
= - INTVAL (XEXP (x
, 1));
3362 if (value
->kind
== RTX_INT
&& value
->un
.addr
.base
!= 0)
3363 switch (GET_CODE (value
->un
.addr
.base
))
3367 /* Use the string's address, not the SYMBOL_REF's address,
3368 for the sake of addresses of library routines.
3369 For a LABEL_REF, compare labels. */
3370 value
->un
.addr
.base
= XEXP (value
->un
.addr
.base
, 0);
3374 /* Given a MINUS expression, simplify it if both sides
3375 include the same symbol. */
3378 simplify_subtraction (x
)
3381 struct rtx_const val0
, val1
;
3383 decode_rtx_const (GET_MODE (x
), XEXP (x
, 0), &val0
);
3384 decode_rtx_const (GET_MODE (x
), XEXP (x
, 1), &val1
);
3386 if (val0
.un
.addr
.base
== val1
.un
.addr
.base
)
3387 return GEN_INT (val0
.un
.addr
.offset
- val1
.un
.addr
.offset
);
3391 /* Compute a hash code for a constant RTL expression. */
3394 const_hash_rtx (mode
, x
)
3395 enum machine_mode mode
;
3400 struct rtx_const value
;
3401 decode_rtx_const (mode
, x
, &value
);
3403 /* Compute hashing function */
3405 for (i
= 0; i
< sizeof value
/ sizeof (int); i
++)
3406 hi
+= ((int *) &value
)[i
];
3408 hi
&= (1 << HASHBITS
) - 1;
3409 hi
%= MAX_RTX_HASH_TABLE
;
3413 /* Compare a constant rtl object X with a constant-descriptor DESC.
3414 Return 1 if DESC describes a constant with the same value as X. */
3417 compare_constant_rtx (mode
, x
, desc
)
3418 enum machine_mode mode
;
3420 struct constant_descriptor
*desc
;
3422 register int *p
= (int *) desc
->contents
;
3425 struct rtx_const value
;
3427 decode_rtx_const (mode
, x
, &value
);
3428 strp
= (int *) &value
;
3429 len
= sizeof value
/ sizeof (int);
3431 /* Compare constant contents. */
3433 if (*p
++ != *strp
++)
3439 /* Construct a constant descriptor for the rtl-expression X.
3440 It is up to the caller to enter the descriptor in the hash table. */
3442 static struct constant_descriptor
*
3443 record_constant_rtx (mode
, x
)
3444 enum machine_mode mode
;
3447 struct constant_descriptor
*ptr
;
3449 struct rtx_const value
;
3451 decode_rtx_const (mode
, x
, &value
);
3453 /* Put these things in the saveable obstack so we can ensure it won't
3454 be freed if we are called from combine or some other phase that discards
3455 memory allocated from function_obstack (current_obstack). */
3456 obstack_grow (saveable_obstack
, &ptr
, sizeof ptr
);
3457 obstack_grow (saveable_obstack
, &label
, sizeof label
);
3459 /* Record constant contents. */
3460 obstack_grow (saveable_obstack
, &value
, sizeof value
);
3462 return (struct constant_descriptor
*) obstack_finish (saveable_obstack
);
3465 /* Given a constant rtx X, make (or find) a memory constant for its value
3466 and return a MEM rtx to refer to it in memory. */
3469 force_const_mem (mode
, x
)
3470 enum machine_mode mode
;
3474 register struct constant_descriptor
*desc
;
3479 /* If we want this CONST_DOUBLE in the same mode as it is in memory
3480 (this will always be true for floating CONST_DOUBLEs that have been
3481 placed in memory, but not for VOIDmode (integer) CONST_DOUBLEs),
3482 use the previous copy. Otherwise, make a new one. Note that in
3483 the unlikely event that this same CONST_DOUBLE is used in two different
3484 modes in an alternating fashion, we will allocate a lot of different
3485 memory locations, but this should be extremely rare. */
3487 /* Don't use CONST_DOUBLE_MEM in a nested function.
3488 Nested functions have their own constant pools,
3489 so they can't share the same values in CONST_DOUBLE_MEM
3490 with the containing function. */
3491 if (outer_function_chain
== 0)
3492 if (GET_CODE (x
) == CONST_DOUBLE
3493 && GET_CODE (CONST_DOUBLE_MEM (x
)) == MEM
3494 && GET_MODE (CONST_DOUBLE_MEM (x
)) == mode
)
3495 return CONST_DOUBLE_MEM (x
);
3497 /* Compute hash code of X. Search the descriptors for that hash code
3498 to see if any of them describes X. If yes, the descriptor records
3499 the label number already assigned. */
3501 hash
= const_hash_rtx (mode
, x
);
3503 for (desc
= const_rtx_hash_table
[hash
]; desc
; desc
= desc
->next
)
3504 if (compare_constant_rtx (mode
, x
, desc
))
3506 found
= desc
->label
;
3512 register struct pool_constant
*pool
;
3513 register struct pool_sym
*sym
;
3516 /* No constant equal to X is known to have been output.
3517 Make a constant descriptor to enter X in the hash table.
3518 Assign the label number and record it in the descriptor for
3519 future calls to this function to find. */
3521 desc
= record_constant_rtx (mode
, x
);
3522 desc
->next
= const_rtx_hash_table
[hash
];
3523 const_rtx_hash_table
[hash
] = desc
;
3525 /* Align the location counter as required by EXP's data type. */
3526 align
= (mode
== VOIDmode
) ? UNITS_PER_WORD
: GET_MODE_SIZE (mode
);
3527 if (align
> BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
3528 align
= BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
;
3530 pool_offset
+= align
- 1;
3531 pool_offset
&= ~ (align
- 1);
3533 /* If RTL is not being placed into the saveable obstack, make a
3534 copy of X that is in the saveable obstack in case we are
3535 being called from combine or some other phase that discards
3536 memory it allocates. We used to only do this if it is a
3537 CONST; however, reload can allocate a CONST_INT when
3538 eliminating registers. */
3539 if (rtl_obstack
!= saveable_obstack
3540 && (GET_CODE (x
) == CONST
|| GET_CODE (x
) == CONST_INT
))
3542 push_obstacks_nochange ();
3543 rtl_in_saveable_obstack ();
3545 if (GET_CODE (x
) == CONST
)
3546 x
= gen_rtx (CONST
, GET_MODE (x
),
3547 gen_rtx (PLUS
, GET_MODE (x
),
3548 XEXP (XEXP (x
, 0), 0),
3549 XEXP (XEXP (x
, 0), 1)));
3551 x
= GEN_INT (INTVAL (x
));
3556 /* Allocate a pool constant descriptor, fill it in, and chain it in. */
3558 pool
= (struct pool_constant
*) savealloc (sizeof (struct pool_constant
));
3562 pool
->labelno
= const_labelno
;
3563 pool
->align
= align
;
3564 pool
->offset
= pool_offset
;
3571 last_pool
->next
= pool
;
3574 pool_offset
+= GET_MODE_SIZE (mode
);
3576 /* Create a string containing the label name, in LABEL. */
3577 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
3582 = (char *) obstack_copy0 (saveable_obstack
, label
, strlen (label
));
3584 /* Add label to symbol hash table. */
3585 hash
= SYMHASH (found
);
3586 sym
= (struct pool_sym
*) savealloc (sizeof (struct pool_sym
));
3589 sym
->next
= const_rtx_sym_hash_table
[hash
];
3590 const_rtx_sym_hash_table
[hash
] = sym
;
3593 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
3595 def
= gen_rtx (MEM
, mode
, gen_rtx (SYMBOL_REF
, Pmode
, found
));
3597 RTX_UNCHANGING_P (def
) = 1;
3598 /* Mark the symbol_ref as belonging to this constants pool. */
3599 CONSTANT_POOL_ADDRESS_P (XEXP (def
, 0)) = 1;
3600 current_function_uses_const_pool
= 1;
3602 if (outer_function_chain
== 0)
3603 if (GET_CODE (x
) == CONST_DOUBLE
)
3605 if (CONST_DOUBLE_MEM (x
) == cc0_rtx
)
3607 CONST_DOUBLE_CHAIN (x
) = const_double_chain
;
3608 const_double_chain
= x
;
3610 CONST_DOUBLE_MEM (x
) = def
;
3616 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
3617 the corresponding pool_constant structure. */
3619 static struct pool_constant
*
3620 find_pool_constant (addr
)
3623 struct pool_sym
*sym
;
3624 char *label
= XSTR (addr
, 0);
3626 for (sym
= const_rtx_sym_hash_table
[SYMHASH (label
)]; sym
; sym
= sym
->next
)
3627 if (sym
->label
== label
)
3633 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
3636 get_pool_constant (addr
)
3639 return (find_pool_constant (addr
))->constant
;
3642 /* Similar, return the mode. */
3645 get_pool_mode (addr
)
3648 return (find_pool_constant (addr
))->mode
;
3651 /* Similar, return the offset in the constant pool. */
3654 get_pool_offset (addr
)
3657 return (find_pool_constant (addr
))->offset
;
3660 /* Return the size of the constant pool. */
3668 /* Write all the constants in the constant pool. */
3671 output_constant_pool (fnname
, fndecl
)
3675 struct pool_constant
*pool
;
3677 union real_extract u
;
3679 /* It is possible for gcc to call force_const_mem and then to later
3680 discard the instructions which refer to the constant. In such a
3681 case we do not need to output the constant. */
3682 if (optimize
>= 0 && flag_expensive_optimizations
)
3683 mark_constant_pool ();
3685 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3686 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3689 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3696 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3697 whose CODE_LABEL has been deleted. This can occur if a jump table
3698 is eliminated by optimization. If so, write a constant of zero
3699 instead. Note that this can also happen by turning the
3700 CODE_LABEL into a NOTE. */
3701 if (((GET_CODE (x
) == LABEL_REF
3702 && (INSN_DELETED_P (XEXP (x
, 0))
3703 || GET_CODE (XEXP (x
, 0)) == NOTE
)))
3704 || (GET_CODE (x
) == CONST
&& GET_CODE (XEXP (x
, 0)) == PLUS
3705 && GET_CODE (XEXP (XEXP (x
, 0), 0)) == LABEL_REF
3706 && (INSN_DELETED_P (XEXP (XEXP (XEXP (x
, 0), 0), 0))
3707 || GET_CODE (XEXP (XEXP (XEXP (x
, 0), 0), 0)) == NOTE
)))
3710 /* First switch to correct section. */
3711 #ifdef SELECT_RTX_SECTION
3712 SELECT_RTX_SECTION (pool
->mode
, x
);
3714 readonly_data_section ();
3717 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3718 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file
, x
, pool
->mode
,
3719 pool
->align
, pool
->labelno
, done
);
3722 if (pool
->align
> 1)
3723 ASM_OUTPUT_ALIGN (asm_out_file
, exact_log2 (pool
->align
));
3725 /* Output the label. */
3726 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LC", pool
->labelno
);
3728 /* Output the value of the constant itself. */
3729 switch (GET_MODE_CLASS (pool
->mode
))
3732 if (GET_CODE (x
) != CONST_DOUBLE
)
3735 bcopy ((char *) &CONST_DOUBLE_LOW (x
), (char *) &u
, sizeof u
);
3736 assemble_real (u
.d
, pool
->mode
);
3740 case MODE_PARTIAL_INT
:
3741 assemble_integer (x
, GET_MODE_SIZE (pool
->mode
), 1);
3751 #ifdef ASM_OUTPUT_POOL_EPILOGUE
3752 ASM_OUTPUT_POOL_EPILOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3755 /* Done with this pool. */
3756 first_pool
= last_pool
= 0;
3759 /* Look through the instructions for this function, and mark all the
3760 entries in the constant pool which are actually being used. */
3763 mark_constant_pool ()
3766 struct pool_constant
*pool
;
3768 if (first_pool
== 0)
3771 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3774 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
3775 if (GET_RTX_CLASS (GET_CODE (insn
)) == 'i')
3776 mark_constants (PATTERN (insn
));
3778 for (insn
= current_function_epilogue_delay_list
;
3780 insn
= XEXP (insn
, 1))
3781 if (GET_RTX_CLASS (GET_CODE (insn
)) == 'i')
3782 mark_constants (PATTERN (insn
));
3790 register char *format_ptr
;
3795 if (GET_CODE (x
) == SYMBOL_REF
)
3797 if (CONSTANT_POOL_ADDRESS_P (x
))
3798 find_pool_constant (x
)->mark
= 1;
3802 /* Insns may appear inside a SEQUENCE. Only check the patterns of
3803 insns, not any notes that may be attached. We don't want to mark
3804 a constant just because it happens to appear in a REG_EQUIV note. */
3805 if (GET_RTX_CLASS (GET_CODE (x
)) == 'i')
3807 mark_constants (PATTERN (x
));
3811 format_ptr
= GET_RTX_FORMAT (GET_CODE (x
));
3813 for (i
= 0; i
< GET_RTX_LENGTH (GET_CODE (x
)); i
++)
3815 switch (*format_ptr
++)
3818 mark_constants (XEXP (x
, i
));
3822 if (XVEC (x
, i
) != 0)
3826 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
3827 mark_constants (XVECEXP (x
, i
, j
));
3846 /* Find all the constants whose addresses are referenced inside of EXP,
3847 and make sure assembler code with a label has been output for each one.
3848 Indicate whether an ADDR_EXPR has been encountered. */
3851 output_addressed_constants (exp
)
3856 switch (TREE_CODE (exp
))
3860 register tree constant
= TREE_OPERAND (exp
, 0);
3862 while (TREE_CODE (constant
) == COMPONENT_REF
)
3864 constant
= TREE_OPERAND (constant
, 0);
3867 if (TREE_CODE_CLASS (TREE_CODE (constant
)) == 'c'
3868 || TREE_CODE (constant
) == CONSTRUCTOR
)
3869 /* No need to do anything here
3870 for addresses of variables or functions. */
3871 output_constant_def (constant
);
3878 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
3879 reloc
|= output_addressed_constants (TREE_OPERAND (exp
, 1));
3884 case NON_LVALUE_EXPR
:
3885 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
3891 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
3892 if (TREE_VALUE (link
) != 0)
3893 reloc
|= output_addressed_constants (TREE_VALUE (link
));
3903 /* Output assembler code for constant EXP to FILE, with no label.
3904 This includes the pseudo-op such as ".int" or ".byte", and a newline.
3905 Assumes output_addressed_constants has been done on EXP already.
3907 Generate exactly SIZE bytes of assembler data, padding at the end
3908 with zeros if necessary. SIZE must always be specified.
3910 SIZE is important for structure constructors,
3911 since trailing members may have been omitted from the constructor.
3912 It is also important for initialization of arrays from string constants
3913 since the full length of the string constant might not be wanted.
3914 It is also needed for initialization of unions, where the initializer's
3915 type is just one member, and that may not be as long as the union.
3917 There a case in which we would fail to output exactly SIZE bytes:
3918 for a structure constructor that wants to produce more than SIZE bytes.
3919 But such constructors will never be generated for any possible input. */
3922 output_constant (exp
, size
)
3926 register enum tree_code code
= TREE_CODE (TREE_TYPE (exp
));
3932 /* Eliminate the NON_LVALUE_EXPR_EXPR that makes a cast not be an lvalue.
3933 That way we get the constant (we hope) inside it. Also, strip off any
3934 NOP_EXPR that converts between two record, union, array, or set types. */
3935 while ((TREE_CODE (exp
) == NOP_EXPR
3936 && (TREE_TYPE (exp
) == TREE_TYPE (TREE_OPERAND (exp
, 0))
3937 || AGGREGATE_TYPE_P (TREE_TYPE (exp
))))
3938 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
3939 exp
= TREE_OPERAND (exp
, 0);
3941 /* Allow a constructor with no elements for any data type.
3942 This means to fill the space with zeros. */
3943 if (TREE_CODE (exp
) == CONSTRUCTOR
&& CONSTRUCTOR_ELTS (exp
) == 0)
3945 if (output_bytecode
)
3946 bc_emit_const_skip (size
);
3948 assemble_zeros (size
);
3959 case REFERENCE_TYPE
:
3960 /* ??? What about (int)((float)(int)&foo + 4) */
3961 while (TREE_CODE (exp
) == NOP_EXPR
|| TREE_CODE (exp
) == CONVERT_EXPR
3962 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
3963 exp
= TREE_OPERAND (exp
, 0);
3965 if (! assemble_integer (expand_expr (exp
, NULL_RTX
, VOIDmode
,
3966 EXPAND_INITIALIZER
),
3968 error ("initializer for integer value is too complicated");
3973 if (TREE_CODE (exp
) != REAL_CST
)
3974 error ("initializer for floating value is not a floating constant");
3976 assemble_real (TREE_REAL_CST (exp
),
3977 mode_for_size (size
* BITS_PER_UNIT
, MODE_FLOAT
, 0));
3982 output_constant (TREE_REALPART (exp
), size
/ 2);
3983 output_constant (TREE_IMAGPART (exp
), size
/ 2);
3984 size
-= (size
/ 2) * 2;
3988 if (TREE_CODE (exp
) == CONSTRUCTOR
)
3990 output_constructor (exp
, size
);
3993 else if (TREE_CODE (exp
) == STRING_CST
)
3997 if (size
> TREE_STRING_LENGTH (exp
))
3999 excess
= size
- TREE_STRING_LENGTH (exp
);
4000 size
= TREE_STRING_LENGTH (exp
);
4003 assemble_string (TREE_STRING_POINTER (exp
), size
);
4012 if (TREE_CODE (exp
) == CONSTRUCTOR
)
4013 output_constructor (exp
, size
);
4019 if (TREE_CODE (exp
) == INTEGER_CST
)
4020 assemble_integer (expand_expr (exp
, NULL_RTX
,
4021 VOIDmode
, EXPAND_INITIALIZER
),
4023 else if (TREE_CODE (exp
) == CONSTRUCTOR
)
4025 unsigned char *buffer
= (unsigned char *) alloca (size
);
4026 if (get_set_constructor_bytes (exp
, buffer
, size
))
4028 assemble_string ((char *) buffer
, size
);
4031 error ("unknown set constructor type");
4036 assemble_zeros (size
);
4039 /* Bytecode specific code to output assembler for integer. */
4042 bc_assemble_integer (exp
, size
)
4050 /* FIXME: is this fold() business going to be as good as the
4051 expand_expr() using EXPAND_SUM above in the RTL case? I
4053 FIXME: Copied as is from BC-GCC1; may need work. Don't hate. -bson */
4057 while (TREE_CODE (exp
) == NOP_EXPR
|| TREE_CODE (exp
) == CONVERT_EXPR
4058 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
4059 exp
= TREE_OPERAND (exp
, 0);
4060 if (TREE_CODE (exp
) == INTEGER_CST
)
4065 else if (TREE_CODE (exp
) == PLUS_EXPR
)
4067 const_part
= TREE_OPERAND (exp
, 0);
4068 while (TREE_CODE (const_part
) == NOP_EXPR
4069 || TREE_CODE (const_part
) == CONVERT_EXPR
4070 || TREE_CODE (const_part
) == NON_LVALUE_EXPR
)
4071 const_part
= TREE_OPERAND (const_part
, 0);
4072 addr_part
= TREE_OPERAND (exp
, 1);
4073 while (TREE_CODE (addr_part
) == NOP_EXPR
4074 || TREE_CODE (addr_part
) == CONVERT_EXPR
4075 || TREE_CODE (addr_part
) == NON_LVALUE_EXPR
)
4076 addr_part
= TREE_OPERAND (addr_part
, 0);
4077 if (TREE_CODE (const_part
) != INTEGER_CST
)
4078 tmp
= const_part
, const_part
= addr_part
, addr_part
= tmp
;
4079 if (TREE_CODE (const_part
) != INTEGER_CST
4080 || TREE_CODE (addr_part
) != ADDR_EXPR
)
4081 abort (); /* FIXME: we really haven't considered
4082 all the possible cases here. */
4084 else if (TREE_CODE (exp
) == ADDR_EXPR
)
4086 const_part
= integer_zero_node
;
4090 abort (); /* FIXME: ditto previous. */
4096 char c
= TREE_INT_CST_LOW (const_part
);
4102 short s
= TREE_INT_CST_LOW (const_part
);
4103 bc_emit ((char *) &s
, 2);
4108 int i
= TREE_INT_CST_LOW (const_part
);
4109 bc_emit ((char *) &i
, 4);
4114 if (WORDS_BIG_ENDIAN
)
4116 int i
= TREE_INT_CST_HIGH (const_part
);
4117 bc_emit ((char *) &i
, 4);
4118 i
= TREE_INT_CST_LOW (const_part
);
4119 bc_emit ((char *) &i
, 4);
4123 int i
= TREE_INT_CST_LOW (const_part
);
4124 bc_emit ((char *) &i
, 4);
4125 i
= TREE_INT_CST_HIGH (const_part
);
4126 bc_emit ((char *) &i
, 4);
4133 && TREE_CODE (TREE_OPERAND (addr_part
, 0)) == VAR_DECL
)
4134 bc_emit_labelref (IDENTIFIER_POINTER
4135 (DECL_ASSEMBLER_NAME (TREE_OPERAND (addr_part
, 0))),
4136 TREE_INT_CST_LOW (const_part
));
4138 abort (); /* FIXME: there may be more cases. */
4141 /* Subroutine of output_constant, used for CONSTRUCTORs
4142 (aggregate constants).
4143 Generate at least SIZE bytes, padding if necessary. */
4146 output_constructor (exp
, size
)
4150 register tree link
, field
= 0;
4151 HOST_WIDE_INT min_index
= 0;
4152 /* Number of bytes output or skipped so far.
4153 In other words, current position within the constructor. */
4154 int total_bytes
= 0;
4155 /* Non-zero means BYTE contains part of a byte, to be output. */
4156 int byte_buffer_in_use
= 0;
4159 if (HOST_BITS_PER_WIDE_INT
< BITS_PER_UNIT
)
4162 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
4163 field
= TYPE_FIELDS (TREE_TYPE (exp
));
4165 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
4166 && TYPE_DOMAIN (TREE_TYPE (exp
)) != 0)
4168 = TREE_INT_CST_LOW (TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (exp
))));
4170 /* As LINK goes through the elements of the constant,
4171 FIELD goes through the structure fields, if the constant is a structure.
4172 if the constant is a union, then we override this,
4173 by getting the field from the TREE_LIST element.
4174 But the constant could also be an array. Then FIELD is zero. */
4175 for (link
= CONSTRUCTOR_ELTS (exp
);
4177 link
= TREE_CHAIN (link
),
4178 field
= field
? TREE_CHAIN (field
) : 0)
4180 tree val
= TREE_VALUE (link
);
4183 /* the element in a union constructor specifies the proper field. */
4185 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
4186 || TREE_CODE (TREE_TYPE (exp
)) == UNION_TYPE
)
4188 /* if available, use the type given by link */
4189 if (TREE_PURPOSE (link
) != 0)
4190 field
= TREE_PURPOSE (link
);
4193 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
4194 index
= TREE_PURPOSE (link
);
4196 /* Eliminate the marker that makes a cast not be an lvalue. */
4200 if (index
&& TREE_CODE (index
) == RANGE_EXPR
)
4202 register int fieldsize
4203 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (exp
)));
4204 HOST_WIDE_INT lo_index
= TREE_INT_CST_LOW (TREE_OPERAND (index
, 0));
4205 HOST_WIDE_INT hi_index
= TREE_INT_CST_LOW (TREE_OPERAND (index
, 1));
4206 HOST_WIDE_INT index
;
4207 for (index
= lo_index
; index
<= hi_index
; index
++)
4209 /* Output the element's initial value. */
4211 assemble_zeros (fieldsize
);
4213 output_constant (val
, fieldsize
);
4215 /* Count its size. */
4216 total_bytes
+= fieldsize
;
4219 else if (field
== 0 || !DECL_BIT_FIELD (field
))
4221 /* An element that is not a bit-field. */
4223 register int fieldsize
;
4224 /* Since this structure is static,
4225 we know the positions are constant. */
4226 int bitpos
= (field
? (TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field
))
4230 bitpos
= (TREE_INT_CST_LOW (TYPE_SIZE (TREE_TYPE (val
)))
4232 * (TREE_INT_CST_LOW (index
) - min_index
));
4234 /* Output any buffered-up bit-fields preceding this element. */
4235 if (byte_buffer_in_use
)
4237 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4239 byte_buffer_in_use
= 0;
4242 /* Advance to offset of this element.
4243 Note no alignment needed in an array, since that is guaranteed
4244 if each element has the proper size. */
4245 if ((field
!= 0 || index
!= 0) && bitpos
!= total_bytes
)
4247 if (!output_bytecode
)
4248 assemble_zeros (bitpos
- total_bytes
);
4250 bc_emit_const_skip (bitpos
- total_bytes
);
4251 total_bytes
= bitpos
;
4254 /* Determine size this element should occupy. */
4257 if (TREE_CODE (DECL_SIZE (field
)) != INTEGER_CST
)
4259 if (TREE_INT_CST_LOW (DECL_SIZE (field
)) > 100000)
4261 /* This avoids overflow trouble. */
4262 tree size_tree
= size_binop (CEIL_DIV_EXPR
,
4264 size_int (BITS_PER_UNIT
));
4265 fieldsize
= TREE_INT_CST_LOW (size_tree
);
4269 fieldsize
= TREE_INT_CST_LOW (DECL_SIZE (field
));
4270 fieldsize
= (fieldsize
+ BITS_PER_UNIT
- 1) / BITS_PER_UNIT
;
4274 fieldsize
= int_size_in_bytes (TREE_TYPE (TREE_TYPE (exp
)));
4276 /* Output the element's initial value. */
4278 assemble_zeros (fieldsize
);
4280 output_constant (val
, fieldsize
);
4282 /* Count its size. */
4283 total_bytes
+= fieldsize
;
4285 else if (val
!= 0 && TREE_CODE (val
) != INTEGER_CST
)
4286 error ("invalid initial value for member `%s'",
4287 IDENTIFIER_POINTER (DECL_NAME (field
)));
4290 /* Element that is a bit-field. */
4292 int next_offset
= TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field
));
4294 = (next_offset
+ TREE_INT_CST_LOW (DECL_SIZE (field
)));
4297 val
= integer_zero_node
;
4299 /* If this field does not start in this (or, next) byte,
4301 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4303 /* Output remnant of any bit field in previous bytes. */
4304 if (byte_buffer_in_use
)
4306 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4308 byte_buffer_in_use
= 0;
4311 /* If still not at proper byte, advance to there. */
4312 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4314 assemble_zeros (next_offset
/ BITS_PER_UNIT
- total_bytes
);
4315 total_bytes
= next_offset
/ BITS_PER_UNIT
;
4319 if (! byte_buffer_in_use
)
4322 /* We must split the element into pieces that fall within
4323 separate bytes, and combine each byte with previous or
4324 following bit-fields. */
4326 /* next_offset is the offset n fbits from the beginning of
4327 the structure to the next bit of this element to be processed.
4328 end_offset is the offset of the first bit past the end of
4330 while (next_offset
< end_offset
)
4334 HOST_WIDE_INT value
;
4335 int next_byte
= next_offset
/ BITS_PER_UNIT
;
4336 int next_bit
= next_offset
% BITS_PER_UNIT
;
4338 /* Advance from byte to byte
4339 within this element when necessary. */
4340 while (next_byte
!= total_bytes
)
4342 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4347 /* Number of bits we can process at once
4348 (all part of the same byte). */
4349 this_time
= MIN (end_offset
- next_offset
,
4350 BITS_PER_UNIT
- next_bit
);
4351 if (BYTES_BIG_ENDIAN
)
4353 /* On big-endian machine, take the most significant bits
4354 first (of the bits that are significant)
4355 and put them into bytes from the most significant end. */
4356 shift
= end_offset
- next_offset
- this_time
;
4357 /* Don't try to take a bunch of bits that cross
4358 the word boundary in the INTEGER_CST. */
4359 if (shift
< HOST_BITS_PER_WIDE_INT
4360 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4362 this_time
-= (HOST_BITS_PER_WIDE_INT
- shift
);
4363 shift
= HOST_BITS_PER_WIDE_INT
;
4366 /* Now get the bits from the appropriate constant word. */
4367 if (shift
< HOST_BITS_PER_WIDE_INT
)
4369 value
= TREE_INT_CST_LOW (val
);
4371 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4373 value
= TREE_INT_CST_HIGH (val
);
4374 shift
-= HOST_BITS_PER_WIDE_INT
;
4378 byte
|= (((value
>> shift
)
4379 & (((HOST_WIDE_INT
) 1 << this_time
) - 1))
4380 << (BITS_PER_UNIT
- this_time
- next_bit
));
4384 /* On little-endian machines,
4385 take first the least significant bits of the value
4386 and pack them starting at the least significant
4387 bits of the bytes. */
4388 shift
= (next_offset
4389 - TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field
)));
4390 /* Don't try to take a bunch of bits that cross
4391 the word boundary in the INTEGER_CST. */
4392 if (shift
< HOST_BITS_PER_WIDE_INT
4393 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4395 this_time
-= (HOST_BITS_PER_WIDE_INT
- shift
);
4396 shift
= HOST_BITS_PER_WIDE_INT
;
4399 /* Now get the bits from the appropriate constant word. */
4400 if (shift
< HOST_BITS_PER_INT
)
4401 value
= TREE_INT_CST_LOW (val
);
4402 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4404 value
= TREE_INT_CST_HIGH (val
);
4405 shift
-= HOST_BITS_PER_WIDE_INT
;
4409 byte
|= (((value
>> shift
)
4410 & (((HOST_WIDE_INT
) 1 << this_time
) - 1))
4413 next_offset
+= this_time
;
4414 byte_buffer_in_use
= 1;
4418 if (byte_buffer_in_use
)
4420 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4423 if (total_bytes
< size
)
4424 assemble_zeros (size
- total_bytes
);
4427 /* Output asm to handle ``#pragma weak'' */
4430 handle_pragma_weak (what
, name
, value
)
4431 enum pragma_state what
;
4434 #ifdef HANDLE_PRAGMA_WEAK
4435 if (what
== ps_name
|| what
== ps_value
)
4437 struct weak_syms
*weak
=
4438 (struct weak_syms
*)permalloc (sizeof (struct weak_syms
));
4439 weak
->next
= weak_decls
;
4440 weak
->name
= permalloc (strlen (name
) + 1);
4441 strcpy (weak
->name
, name
);
4443 if (what
!= ps_value
)
4444 weak
->value
= NULL_PTR
;
4448 weak
->value
= permalloc (strlen (value
) + 1);
4449 strcpy (weak
->value
, value
);
4454 else if (! (what
== ps_done
|| what
== ps_start
))
4455 warning ("malformed `#pragma weak'");
4456 #endif /* HANDLE_PRAGMA_WEAK */
4459 /* Declare DECL to be a weak symbol. */
4465 if (! TREE_PUBLIC (decl
))
4466 error_with_decl (decl
, "weak declaration of `%s' must be public");
4467 else if (TREE_ASM_WRITTEN (decl
))
4468 error_with_decl (decl
, "weak declaration of `%s' must precede definition");
4469 else if (SUPPORTS_WEAK
)
4470 DECL_WEAK (decl
) = 1;
4473 /* Emit any pending weak declarations. */
4478 #ifdef HANDLE_PRAGMA_WEAK
4479 if (HANDLE_PRAGMA_WEAK
)
4481 struct weak_syms
*t
;
4482 for (t
= weak_decls
; t
; t
= t
->next
)
4484 ASM_WEAKEN_LABEL (asm_out_file
, t
->name
);
4486 ASM_OUTPUT_DEF (asm_out_file
, t
->name
, t
->value
);
4493 assemble_alias (decl
, target
)
4498 make_decl_rtl (decl
, (char *) 0, 1);
4499 name
= XSTR (XEXP (DECL_RTL (decl
), 0), 0);
4501 #ifdef ASM_OUTPUT_DEF
4502 /* Make name accessible from other files, if appropriate. */
4504 if (TREE_PUBLIC (decl
))
4506 #ifdef ASM_WEAKEN_LABEL
4507 if (DECL_WEAK (decl
))
4508 ASM_WEAKEN_LABEL (asm_out_file
, name
);
4511 if (output_bytecode
)
4512 BC_GLOBALIZE_LABEL (asm_out_file
, name
);
4514 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
4517 ASM_OUTPUT_DEF (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4518 TREE_ASM_WRITTEN (decl
) = 1;
4520 #ifdef ASM_OUTPUT_WEAK_ALIAS
4521 if (! DECL_WEAK (decl
))
4522 warning ("only weak aliases are supported in this configuration");
4524 ASM_OUTPUT_WEAK_ALIAS (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4525 TREE_ASM_WRITTEN (decl
) = 1;
4527 warning ("alias definitions not supported in this configuration; ignored");
4532 /* This determines whether or not we support link-once semantics. */
4533 #ifndef SUPPORTS_ONE_ONLY
4534 #ifdef MAKE_DECL_ONE_ONLY
4535 #define SUPPORTS_ONE_ONLY 1
4537 #define SUPPORTS_ONE_ONLY 0
4541 /* Returns 1 if the target configuration supports defining public symbols
4542 so that one of them will be chosen at link time instead of generating a
4543 multiply-defined symbol error, whether through the use of weak symbols or
4544 a target-specific mechanism for having duplicates discarded. */
4547 supports_one_only ()
4549 if (SUPPORTS_ONE_ONLY
)
4551 return SUPPORTS_WEAK
;
4554 /* Set up DECL as a public symbol that can be defined in multiple
4555 translation units without generating a linker error. */
4558 make_decl_one_only (decl
)
4561 if (TREE_CODE (decl
) != VAR_DECL
&& TREE_CODE (decl
) != FUNCTION_DECL
)
4564 TREE_PUBLIC (decl
) = 1;
4566 if (TREE_CODE (decl
) == VAR_DECL
4567 && (DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
))
4568 DECL_COMMON (decl
) = 1;
4569 else if (SUPPORTS_ONE_ONLY
)
4571 #ifdef MAKE_DECL_ONE_ONLY
4572 MAKE_DECL_ONE_ONLY (decl
);
4574 DECL_ONE_ONLY (decl
) = 1;
4576 else if (SUPPORTS_WEAK
)
4577 DECL_WEAK (decl
) = 1;