1 /* Output variables, constants and external declarations, for GNU compiler.
2 Copyright (C) 1987, 88, 89, 92-97, 1998 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. */
32 /* #include <stab.h> */
40 #include "hard-reg-set.h"
49 #ifdef XCOFF_DEBUGGING_INFO
53 #ifndef TRAMPOLINE_ALIGNMENT
54 #define TRAMPOLINE_ALIGNMENT FUNCTION_BOUNDARY
58 #define ASM_STABS_OP ".stabs"
61 /* Define the prefix to use when check_memory_usage_flag is enable. */
62 #ifdef NO_DOLLAR_IN_LABEL
63 #ifdef NO_DOT_IN_LABEL
64 #define CHKR_PREFIX "chkr_prefix_"
65 #else /* !NO_DOT_IN_LABEL */
66 #define CHKR_PREFIX "chkr."
68 #else /* !NO_DOLLAR_IN_LABEL */
69 #define CHKR_PREFIX "chkr$"
71 #define CHKR_PREFIX_SIZE (sizeof (CHKR_PREFIX) - 1)
73 /* This macro gets just the user-specified name
74 out of the string in a SYMBOL_REF. On most machines,
75 we discard the * if any and that's all. */
76 #ifndef STRIP_NAME_ENCODING
77 #define STRIP_NAME_ENCODING(VAR,SYMBOL_NAME) \
78 (VAR) = ((SYMBOL_NAME) + ((SYMBOL_NAME)[0] == '*'))
81 /* File in which assembler code is being written. */
83 extern FILE *asm_out_file
;
85 /* The (assembler) name of the first globally-visible object output. */
86 char *first_global_object_name
;
88 extern struct obstack
*current_obstack
;
89 extern struct obstack
*saveable_obstack
;
90 extern struct obstack
*rtl_obstack
;
91 extern struct obstack permanent_obstack
;
92 #define obstack_chunk_alloc xmalloc
94 /* Number for making the label on the next
95 constant that is stored in memory. */
99 /* Number for making the label on the next
100 static variable internal to a function. */
104 /* Carry information from ASM_DECLARE_OBJECT_NAME
105 to ASM_FINISH_DECLARE_OBJECT. */
107 int size_directive_output
;
109 /* The last decl for which assemble_variable was called,
110 if it did ASM_DECLARE_OBJECT_NAME.
111 If the last call to assemble_variable didn't do that,
114 tree last_assemble_variable_decl
;
117 #ifdef HANDLE_PRAGMA_WEAK
118 /* Any weak symbol declarations waiting to be emitted. */
122 struct weak_syms
*next
;
127 static struct weak_syms
*weak_decls
;
130 /* Nonzero if at least one function definition has been seen. */
132 static int function_defined
;
135 struct constant_descriptor
;
137 struct pool_constant
;
139 static char *strip_reg_name
PROTO((char *));
140 static int contains_pointers_p
PROTO((tree
));
141 static void decode_addr_const
PROTO((tree
, struct addr_const
*));
142 static int const_hash
PROTO((tree
));
143 static int compare_constant
PROTO((tree
,
144 struct constant_descriptor
*));
145 static char *compare_constant_1
PROTO((tree
, char *));
146 static struct constant_descriptor
*record_constant
PROTO((tree
));
147 static void record_constant_1
PROTO((tree
));
148 static tree copy_constant
PROTO((tree
));
149 static void output_constant_def_contents
PROTO((tree
, int, int));
150 static void decode_rtx_const
PROTO((enum machine_mode
, rtx
,
151 struct rtx_const
*));
152 static int const_hash_rtx
PROTO((enum machine_mode
, rtx
));
153 static int compare_constant_rtx
PROTO((enum machine_mode
, rtx
,
154 struct constant_descriptor
*));
155 static struct constant_descriptor
*record_constant_rtx
PROTO((enum machine_mode
,
157 static struct pool_constant
*find_pool_constant
PROTO((rtx
));
158 static void mark_constant_pool
PROTO((void));
159 static void mark_constants
PROTO((rtx
));
160 static int output_addressed_constants
PROTO((tree
));
161 static void output_after_function_constants
PROTO((void));
162 static void output_constructor
PROTO((tree
, int));
163 #ifdef ASM_OUTPUT_BSS
164 static void asm_output_bss
PROTO((FILE *, tree
, char *, int, int));
166 #ifdef ASM_OUTPUT_ALIGNED_BSS
167 static void asm_output_aligned_bss
PROTO((FILE *, tree
, char *, int, int));
170 static enum in_section
{ no_section
, in_text
, in_data
, in_named
171 #ifdef BSS_SECTION_ASM_OP
174 #ifdef EH_FRAME_SECTION_ASM_OP
177 #ifdef EXTRA_SECTIONS
180 } in_section
= no_section
;
182 /* Return a non-zero value if DECL has a section attribute. */
183 #define IN_NAMED_SECTION(DECL) \
184 ((TREE_CODE (DECL) == FUNCTION_DECL || TREE_CODE (DECL) == VAR_DECL) \
185 && DECL_SECTION_NAME (DECL) != NULL_TREE)
187 /* Text of section name when in_section == in_named. */
188 static char *in_named_name
;
190 /* Define functions like text_section for any extra sections. */
191 #ifdef EXTRA_SECTION_FUNCTIONS
192 EXTRA_SECTION_FUNCTIONS
195 /* Tell assembler to switch to text section. */
200 if (in_section
!= in_text
)
202 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
)
214 if (flag_shared_data
)
216 #ifdef SHARED_SECTION_ASM_OP
217 fprintf (asm_out_file
, "%s\n", SHARED_SECTION_ASM_OP
);
219 fprintf (asm_out_file
, "%s\n", DATA_SECTION_ASM_OP
);
223 fprintf (asm_out_file
, "%s\n", DATA_SECTION_ASM_OP
);
225 in_section
= in_data
;
229 /* Tell assembler to switch to read-only data section. This is normally
233 readonly_data_section ()
235 #ifdef READONLY_DATA_SECTION
236 READONLY_DATA_SECTION (); /* Note this can call data_section. */
242 /* Determine if we're in the text section. */
247 return in_section
== in_text
;
250 /* Determine if we're in the data section. */
255 return in_section
== in_data
;
258 /* Tell assembler to change to section NAME for DECL.
259 If DECL is NULL, just switch to section NAME.
260 If NAME is NULL, get the name from DECL.
261 If RELOC is 1, the initializer for DECL contains relocs. */
264 named_section (decl
, name
, reloc
)
269 if (decl
!= NULL_TREE
270 && TREE_CODE_CLASS (TREE_CODE (decl
)) != 'd')
273 name
= TREE_STRING_POINTER (DECL_SECTION_NAME (decl
));
275 if (in_section
!= in_named
|| strcmp (name
, in_named_name
))
277 #ifdef ASM_OUTPUT_SECTION_NAME
278 ASM_OUTPUT_SECTION_NAME (asm_out_file
, decl
, name
, reloc
);
280 /* Section attributes are not supported if this macro isn't provided -
281 some host formats don't support them at all. The front-end should
282 already have flagged this as an error. */
286 in_named_name
= obstack_alloc (&permanent_obstack
, strlen (name
) + 1);
287 strcpy (in_named_name
, name
);
288 in_section
= in_named
;
292 #ifdef ASM_OUTPUT_SECTION_NAME
293 #ifndef UNIQUE_SECTION
294 #define UNIQUE_SECTION(DECL,RELOC) \
297 char *name, *string; \
299 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (DECL)); \
300 /* Strip off any encoding in name. */ \
301 STRIP_NAME_ENCODING (name, name); \
303 len = strlen (name) + 1; \
304 string = alloca (len + 1); \
305 sprintf (string, ".%s", name); \
307 DECL_SECTION_NAME (DECL) = build_string (len, string); \
310 #ifndef UNIQUE_SECTION_P
311 #define UNIQUE_SECTION_P(DECL) 0
315 #ifdef BSS_SECTION_ASM_OP
317 /* Tell the assembler to switch to the bss section. */
322 if (in_section
!= in_bss
)
324 #ifdef SHARED_BSS_SECTION_ASM_OP
325 if (flag_shared_data
)
326 fprintf (asm_out_file
, "%s\n", SHARED_BSS_SECTION_ASM_OP
);
329 fprintf (asm_out_file
, "%s\n", BSS_SECTION_ASM_OP
);
335 #ifdef ASM_OUTPUT_BSS
337 /* Utility function for ASM_OUTPUT_BSS for targets to use if
338 they don't support alignments in .bss.
339 ??? It is believed that this function will work in most cases so such
340 support is localized here. */
343 asm_output_bss (file
, decl
, name
, size
, rounded
)
349 ASM_GLOBALIZE_LABEL (file
, name
);
351 #ifdef ASM_DECLARE_OBJECT_NAME
352 last_assemble_variable_decl
= decl
;
353 ASM_DECLARE_OBJECT_NAME (file
, name
, decl
);
355 /* Standard thing is just output label for the object. */
356 ASM_OUTPUT_LABEL (file
, name
);
357 #endif /* ASM_DECLARE_OBJECT_NAME */
358 ASM_OUTPUT_SKIP (file
, rounded
);
363 #ifdef ASM_OUTPUT_ALIGNED_BSS
365 /* Utility function for targets to use in implementing
366 ASM_OUTPUT_ALIGNED_BSS.
367 ??? It is believed that this function will work in most cases so such
368 support is localized here. */
371 asm_output_aligned_bss (file
, decl
, name
, size
, align
)
377 ASM_GLOBALIZE_LABEL (file
, name
);
379 ASM_OUTPUT_ALIGN (file
, floor_log2 (align
/ BITS_PER_UNIT
));
380 #ifdef ASM_DECLARE_OBJECT_NAME
381 last_assemble_variable_decl
= decl
;
382 ASM_DECLARE_OBJECT_NAME (file
, name
, decl
);
384 /* Standard thing is just output label for the object. */
385 ASM_OUTPUT_LABEL (file
, name
);
386 #endif /* ASM_DECLARE_OBJECT_NAME */
387 ASM_OUTPUT_SKIP (file
, size
? size
: 1);
392 #endif /* BSS_SECTION_ASM_OP */
394 #ifdef EH_FRAME_SECTION_ASM_OP
398 if (in_section
!= in_eh_frame
)
400 fprintf (asm_out_file
, "%s\n", EH_FRAME_SECTION_ASM_OP
);
401 in_section
= in_eh_frame
;
406 /* Switch to the section for function DECL.
408 If DECL is NULL_TREE, switch to the text section.
409 ??? It's not clear that we will ever be passed NULL_TREE, but it's
410 safer to handle it. */
413 function_section (decl
)
416 if (decl
!= NULL_TREE
417 && DECL_SECTION_NAME (decl
) != NULL_TREE
)
418 named_section (decl
, (char *) 0, 0);
423 /* Switch to section for variable DECL.
425 RELOC is the `reloc' argument to SELECT_SECTION. */
428 variable_section (decl
, reloc
)
432 if (IN_NAMED_SECTION (decl
))
433 named_section (decl
, NULL
, reloc
);
436 /* C++ can have const variables that get initialized from constructors,
437 and thus can not be in a readonly section. We prevent this by
438 verifying that the initial value is constant for objects put in a
441 error_mark_node is used by the C front end to indicate that the
442 initializer has not been seen yet. In this case, we assume that
443 the initializer must be constant.
445 C++ uses error_mark_node for variables that have complicated
446 initializers, but these variables go in BSS so we won't be called
449 #ifdef SELECT_SECTION
450 SELECT_SECTION (decl
, reloc
);
452 if (DECL_READONLY_SECTION (decl
, reloc
))
453 readonly_data_section ();
460 /* Tell assembler to switch to the section for the exception handling
466 #if defined (EXCEPTION_SECTION)
467 EXCEPTION_SECTION ();
469 #ifdef ASM_OUTPUT_SECTION_NAME
470 named_section (NULL_TREE
, ".gcc_except_table", 0);
475 readonly_data_section ();
480 /* Create the rtl to represent a function, for a function definition.
481 DECL is a FUNCTION_DECL node which describes which function.
482 The rtl is stored into DECL. */
485 make_function_rtl (decl
)
488 char *name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
489 char *new_name
= name
;
491 /* Rename a nested function to avoid conflicts. */
492 if (decl_function_context (decl
) != 0
493 && DECL_INITIAL (decl
) != 0
494 && DECL_RTL (decl
) == 0)
498 name
= IDENTIFIER_POINTER (DECL_NAME (decl
));
499 ASM_FORMAT_PRIVATE_NAME (label
, name
, var_labelno
);
500 name
= obstack_copy0 (saveable_obstack
, label
, strlen (label
));
505 /* When -fprefix-function-name is used, every function name is
506 prefixed. Even static functions are prefixed because they
507 could be declared latter. Note that a nested function name
509 if (flag_prefix_function_name
)
511 new_name
= (char *) alloca (strlen (name
) + CHKR_PREFIX_SIZE
+ 1);
512 strcpy (new_name
, CHKR_PREFIX
);
513 strcpy (new_name
+ CHKR_PREFIX_SIZE
, name
);
514 name
= obstack_copy0 (saveable_obstack
, new_name
, strlen (new_name
));
518 if (DECL_RTL (decl
) == 0)
521 = gen_rtx_MEM (DECL_MODE (decl
),
522 gen_rtx_SYMBOL_REF (Pmode
, name
));
524 /* Optionally set flags or add text to the name to record information
525 such as that it is a function name. If the name is changed, the macro
526 ASM_OUTPUT_LABELREF will have to know how to strip this information. */
527 #ifdef ENCODE_SECTION_INFO
528 ENCODE_SECTION_INFO (decl
);
533 /* ??? Another way to do this would be to do what halfpic.c does
534 and maintain a hashed table of such critters. */
535 /* ??? Another way to do this would be to pass a flag bit to
536 ENCODE_SECTION_INFO saying whether this is a new decl or not. */
537 /* Let the target reassign the RTL if it wants.
538 This is necessary, for example, when one machine specific
539 decl attribute overrides another. */
540 #ifdef REDO_SECTION_INFO_P
541 if (REDO_SECTION_INFO_P (decl
))
542 ENCODE_SECTION_INFO (decl
);
546 /* Record at least one function has been defined. */
547 function_defined
= 1;
550 /* Given NAME, a putative register name, discard any customary prefixes. */
553 strip_reg_name (name
)
556 #ifdef REGISTER_PREFIX
557 if (!strncmp (name
, REGISTER_PREFIX
, strlen (REGISTER_PREFIX
)))
558 name
+= strlen (REGISTER_PREFIX
);
560 if (name
[0] == '%' || name
[0] == '#')
565 /* Decode an `asm' spec for a declaration as a register name.
566 Return the register number, or -1 if nothing specified,
567 or -2 if the ASMSPEC is not `cc' or `memory' and is not recognized,
568 or -3 if ASMSPEC is `cc' and is not recognized,
569 or -4 if ASMSPEC is `memory' and is not recognized.
570 Accept an exact spelling or a decimal number.
571 Prefixes such as % are optional. */
574 decode_reg_name (asmspec
)
581 /* Get rid of confusing prefixes. */
582 asmspec
= strip_reg_name (asmspec
);
584 /* Allow a decimal number as a "register name". */
585 for (i
= strlen (asmspec
) - 1; i
>= 0; i
--)
586 if (! (asmspec
[i
] >= '0' && asmspec
[i
] <= '9'))
588 if (asmspec
[0] != 0 && i
< 0)
591 if (i
< FIRST_PSEUDO_REGISTER
&& i
>= 0)
597 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
599 && ! strcmp (asmspec
, strip_reg_name (reg_names
[i
])))
602 #ifdef ADDITIONAL_REGISTER_NAMES
604 static struct { char *name
; int number
; } table
[]
605 = ADDITIONAL_REGISTER_NAMES
;
607 for (i
= 0; i
< sizeof (table
) / sizeof (table
[0]); i
++)
608 if (! strcmp (asmspec
, table
[i
].name
))
609 return table
[i
].number
;
611 #endif /* ADDITIONAL_REGISTER_NAMES */
613 if (!strcmp (asmspec
, "memory"))
616 if (!strcmp (asmspec
, "cc"))
625 /* Create the DECL_RTL for a declaration for a static or external variable
626 or static or external function.
627 ASMSPEC, if not 0, is the string which the user specified
628 as the assembler symbol name.
629 TOP_LEVEL is nonzero if this is a file-scope variable.
631 This is never called for PARM_DECL nodes. */
634 make_decl_rtl (decl
, asmspec
, top_level
)
639 register char *name
= 0;
642 reg_number
= decode_reg_name (asmspec
);
644 if (DECL_ASSEMBLER_NAME (decl
) != NULL_TREE
)
645 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
647 if (reg_number
== -2)
649 /* ASMSPEC is given, and not the name of a register. */
650 name
= (char *) obstack_alloc (saveable_obstack
,
651 strlen (asmspec
) + 2);
653 strcpy (&name
[1], asmspec
);
656 /* For a duplicate declaration, we can be called twice on the
657 same DECL node. Don't discard the RTL already made. */
658 if (DECL_RTL (decl
) == 0)
662 /* First detect errors in declaring global registers. */
663 if (TREE_CODE (decl
) != FUNCTION_DECL
664 && DECL_REGISTER (decl
) && reg_number
== -1)
665 error_with_decl (decl
,
666 "register name not specified for `%s'");
667 else if (TREE_CODE (decl
) != FUNCTION_DECL
668 && DECL_REGISTER (decl
) && reg_number
< 0)
669 error_with_decl (decl
,
670 "invalid register name for `%s'");
671 else if ((reg_number
>= 0 || reg_number
== -3)
672 && (TREE_CODE (decl
) == FUNCTION_DECL
673 && ! DECL_REGISTER (decl
)))
674 error_with_decl (decl
,
675 "register name given for non-register variable `%s'");
676 else if (TREE_CODE (decl
) != FUNCTION_DECL
677 && DECL_REGISTER (decl
)
678 && TYPE_MODE (TREE_TYPE (decl
)) == BLKmode
)
679 error_with_decl (decl
,
680 "data type of `%s' isn't suitable for a register");
681 else if (TREE_CODE (decl
) != FUNCTION_DECL
&& DECL_REGISTER (decl
)
682 && ! HARD_REGNO_MODE_OK (reg_number
,
683 TYPE_MODE (TREE_TYPE (decl
))))
684 error_with_decl (decl
,
685 "register number for `%s' isn't suitable for data type");
686 /* Now handle properly declared static register variables. */
687 else if (TREE_CODE (decl
) != FUNCTION_DECL
&& DECL_REGISTER (decl
))
691 if (DECL_INITIAL (decl
) != 0 && top_level
)
693 DECL_INITIAL (decl
) = 0;
694 error ("global register variable has initial value");
696 if (fixed_regs
[reg_number
] == 0
697 && function_defined
&& top_level
)
698 error ("global register variable follows a function definition");
699 if (TREE_THIS_VOLATILE (decl
))
700 warning ("volatile register variables don't work as you might wish");
702 /* If the user specified one of the eliminables registers here,
703 e.g., FRAME_POINTER_REGNUM, we don't want to get this variable
704 confused with that register and be eliminated. Although this
705 usage is somewhat suspect, we nevertheless use the following
706 kludge to avoid setting DECL_RTL to frame_pointer_rtx. */
709 = gen_rtx_REG (DECL_MODE (decl
), FIRST_PSEUDO_REGISTER
);
710 REGNO (DECL_RTL (decl
)) = reg_number
;
711 REG_USERVAR_P (DECL_RTL (decl
)) = 1;
715 /* Make this register global, so not usable for anything
717 nregs
= HARD_REGNO_NREGS (reg_number
, DECL_MODE (decl
));
719 globalize_reg (reg_number
+ --nregs
);
722 /* Specifying a section attribute on a variable forces it into a
723 non-.bss section, and thus it cannot be common. */
724 else if (TREE_CODE (decl
) == VAR_DECL
725 && DECL_SECTION_NAME (decl
) != NULL_TREE
726 && DECL_INITIAL (decl
) == NULL_TREE
727 && DECL_COMMON (decl
))
728 DECL_COMMON (decl
) = 0;
730 /* Now handle ordinary static variables and functions (in memory).
731 Also handle vars declared register invalidly. */
732 if (DECL_RTL (decl
) == 0)
734 /* Can't use just the variable's own name for a variable
735 whose scope is less than the whole file.
736 Concatenate a distinguishing number. */
737 if (!top_level
&& !TREE_PUBLIC (decl
) && asmspec
== 0)
741 ASM_FORMAT_PRIVATE_NAME (label
, name
, var_labelno
);
742 name
= obstack_copy0 (saveable_obstack
, label
, strlen (label
));
749 /* When -fprefix-function-name is used, the functions
750 names are prefixed. Only nested function names are not
752 if (flag_prefix_function_name
&& TREE_CODE (decl
) == FUNCTION_DECL
)
755 new_name
= (char *) alloca (strlen (name
) + CHKR_PREFIX_SIZE
757 strcpy (new_name
, CHKR_PREFIX
);
758 strcpy (new_name
+ CHKR_PREFIX_SIZE
, name
);
759 name
= obstack_copy0 (saveable_obstack
,
760 new_name
, strlen (new_name
));
763 DECL_RTL (decl
) = gen_rtx_MEM (DECL_MODE (decl
),
764 gen_rtx_SYMBOL_REF (Pmode
, name
));
766 /* If this variable is to be treated as volatile, show its
767 tree node has side effects. If it has side effects, either
768 because of this test or from TREE_THIS_VOLATILE also
769 being set, show the MEM is volatile. */
770 if (flag_volatile_global
&& TREE_CODE (decl
) == VAR_DECL
771 && TREE_PUBLIC (decl
))
772 TREE_SIDE_EFFECTS (decl
) = 1;
773 if (TREE_SIDE_EFFECTS (decl
))
774 MEM_VOLATILE_P (DECL_RTL (decl
)) = 1;
776 if (TREE_READONLY (decl
))
777 RTX_UNCHANGING_P (DECL_RTL (decl
)) = 1;
778 MEM_IN_STRUCT_P (DECL_RTL (decl
))
779 = AGGREGATE_TYPE_P (TREE_TYPE (decl
));
781 /* Optionally set flags or add text to the name to record information
782 such as that it is a function name.
783 If the name is changed, the macro ASM_OUTPUT_LABELREF
784 will have to know how to strip this information. */
785 #ifdef ENCODE_SECTION_INFO
786 ENCODE_SECTION_INFO (decl
);
792 /* If the old RTL had the wrong mode, fix the mode. */
793 if (GET_MODE (DECL_RTL (decl
)) != DECL_MODE (decl
))
795 rtx rtl
= DECL_RTL (decl
);
796 PUT_MODE (rtl
, DECL_MODE (decl
));
799 /* ??? Another way to do this would be to do what halfpic.c does
800 and maintain a hashed table of such critters. */
801 /* ??? Another way to do this would be to pass a flag bit to
802 ENCODE_SECTION_INFO saying whether this is a new decl or not. */
803 /* Let the target reassign the RTL if it wants.
804 This is necessary, for example, when one machine specific
805 decl attribute overrides another. */
806 #ifdef REDO_SECTION_INFO_P
807 if (REDO_SECTION_INFO_P (decl
))
808 ENCODE_SECTION_INFO (decl
);
813 /* Make the rtl for variable VAR be volatile.
814 Use this only for static variables. */
817 make_var_volatile (var
)
820 if (GET_CODE (DECL_RTL (var
)) != MEM
)
823 MEM_VOLATILE_P (DECL_RTL (var
)) = 1;
826 /* Output alignment directive to align for constant expression EXP. */
829 assemble_constant_align (exp
)
834 /* Align the location counter as required by EXP's data type. */
835 align
= TYPE_ALIGN (TREE_TYPE (exp
));
836 #ifdef CONSTANT_ALIGNMENT
837 align
= CONSTANT_ALIGNMENT (exp
, align
);
840 if (align
> BITS_PER_UNIT
)
841 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
844 /* Output a string of literal assembler code
845 for an `asm' keyword used between functions. */
848 assemble_asm (string
)
853 if (TREE_CODE (string
) == ADDR_EXPR
)
854 string
= TREE_OPERAND (string
, 0);
856 fprintf (asm_out_file
, "\t%s\n", TREE_STRING_POINTER (string
));
859 #if 0 /* This should no longer be needed, because
860 flag_gnu_linker should be 0 on these systems,
861 which should prevent any output
862 if ASM_OUTPUT_CONSTRUCTOR and ASM_OUTPUT_DESTRUCTOR are absent. */
863 #if !(defined(DBX_DEBUGGING_INFO) && !defined(FASCIST_ASSEMBLER))
864 #ifndef ASM_OUTPUT_CONSTRUCTOR
865 #define ASM_OUTPUT_CONSTRUCTOR(file, name)
867 #ifndef ASM_OUTPUT_DESTRUCTOR
868 #define ASM_OUTPUT_DESTRUCTOR(file, name)
873 /* Record an element in the table of global destructors.
874 How this is done depends on what sort of assembler and linker
877 NAME should be the name of a global function to be called
878 at exit time. This name is output using assemble_name. */
881 assemble_destructor (name
)
884 #ifdef ASM_OUTPUT_DESTRUCTOR
885 ASM_OUTPUT_DESTRUCTOR (asm_out_file
, name
);
889 /* Now tell GNU LD that this is part of the static destructor set. */
890 /* This code works for any machine provided you use GNU as/ld. */
891 fprintf (asm_out_file
, "%s \"___DTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
892 assemble_name (asm_out_file
, name
);
893 fputc ('\n', asm_out_file
);
898 /* Likewise for global constructors. */
901 assemble_constructor (name
)
904 #ifdef ASM_OUTPUT_CONSTRUCTOR
905 ASM_OUTPUT_CONSTRUCTOR (asm_out_file
, name
);
909 /* Now tell GNU LD that this is part of the static constructor set. */
910 /* This code works for any machine provided you use GNU as/ld. */
911 fprintf (asm_out_file
, "%s \"___CTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
912 assemble_name (asm_out_file
, name
);
913 fputc ('\n', asm_out_file
);
918 /* Likewise for entries we want to record for garbage collection.
919 Garbage collection is still under development. */
922 assemble_gc_entry (name
)
925 #ifdef ASM_OUTPUT_GC_ENTRY
926 ASM_OUTPUT_GC_ENTRY (asm_out_file
, name
);
930 /* Now tell GNU LD that this is part of the static constructor set. */
931 fprintf (asm_out_file
, "%s \"___PTR_LIST__\",22,0,0,", ASM_STABS_OP
);
932 assemble_name (asm_out_file
, name
);
933 fputc ('\n', asm_out_file
);
938 /* CONSTANT_POOL_BEFORE_FUNCTION may be defined as an expression with
939 a non-zero value if the constant pool should be output before the
940 start of the function, or a zero value if the pool should output
941 after the end of the function. The default is to put it before the
944 #ifndef CONSTANT_POOL_BEFORE_FUNCTION
945 #define CONSTANT_POOL_BEFORE_FUNCTION 1
948 /* Output assembler code for the constant pool of a function and associated
949 with defining the name of the function. DECL describes the function.
950 NAME is the function's name. For the constant pool, we use the current
951 constant pool data. */
954 assemble_start_function (decl
, fnname
)
960 /* The following code does not need preprocessing in the assembler. */
964 if (CONSTANT_POOL_BEFORE_FUNCTION
)
965 output_constant_pool (fnname
, decl
);
967 #ifdef ASM_OUTPUT_SECTION_NAME
968 /* If the function is to be put in its own section and it's not in a section
969 already, indicate so. */
970 if ((flag_function_sections
971 && DECL_SECTION_NAME (decl
) == NULL_TREE
)
972 || UNIQUE_SECTION_P (decl
))
973 UNIQUE_SECTION (decl
, 0);
976 function_section (decl
);
978 /* Tell assembler to move to target machine's alignment for functions. */
979 align
= floor_log2 (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
981 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
983 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
984 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file
, fnname
);
987 #ifdef SDB_DEBUGGING_INFO
988 /* Output SDB definition of the function. */
989 if (write_symbols
== SDB_DEBUG
)
990 sdbout_mark_begin_function ();
993 #ifdef DBX_DEBUGGING_INFO
994 /* Output DBX definition of the function. */
995 if (write_symbols
== DBX_DEBUG
)
996 dbxout_begin_function (decl
);
999 /* Make function name accessible from other files, if appropriate. */
1001 if (TREE_PUBLIC (decl
))
1003 if (!first_global_object_name
&& ! DECL_WEAK (decl
)
1004 && ! DECL_ONE_ONLY (decl
))
1008 STRIP_NAME_ENCODING (p
, fnname
);
1009 first_global_object_name
= permalloc (strlen (p
) + 1);
1010 strcpy (first_global_object_name
, p
);
1013 #ifdef ASM_WEAKEN_LABEL
1014 if (DECL_WEAK (decl
))
1015 ASM_WEAKEN_LABEL (asm_out_file
, fnname
);
1018 ASM_GLOBALIZE_LABEL (asm_out_file
, fnname
);
1021 /* Do any machine/system dependent processing of the function name */
1022 #ifdef ASM_DECLARE_FUNCTION_NAME
1023 ASM_DECLARE_FUNCTION_NAME (asm_out_file
, fnname
, current_function_decl
);
1025 /* Standard thing is just output label for the function. */
1026 ASM_OUTPUT_LABEL (asm_out_file
, fnname
);
1027 #endif /* ASM_DECLARE_FUNCTION_NAME */
1030 /* Output assembler code associated with defining the size of the
1031 function. DECL describes the function. NAME is the function's name. */
1034 assemble_end_function (decl
, fnname
)
1038 #ifdef ASM_DECLARE_FUNCTION_SIZE
1039 ASM_DECLARE_FUNCTION_SIZE (asm_out_file
, fnname
, decl
);
1041 if (! CONSTANT_POOL_BEFORE_FUNCTION
)
1043 output_constant_pool (fnname
, decl
);
1044 function_section (decl
); /* need to switch back */
1047 /* Output any constants which should appear after the function. */
1048 output_after_function_constants ();
1051 /* Assemble code to leave SIZE bytes of zeros. */
1054 assemble_zeros (size
)
1057 #ifdef ASM_NO_SKIP_IN_TEXT
1058 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
1059 so we must output 0s explicitly in the text section. */
1060 if (ASM_NO_SKIP_IN_TEXT
&& in_text_section ())
1064 for (i
= 0; i
< size
- 20; i
+= 20)
1067 fprintf (asm_out_file
,
1068 "%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
);
1070 fprintf (asm_out_file
,
1071 "\tbyte 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n");
1077 fprintf (asm_out_file
, "%s 0", ASM_BYTE_OP
);
1079 fprintf (asm_out_file
, "\tbyte 0");
1082 for (; i
< size
; i
++)
1083 fprintf (asm_out_file
, ",0");
1084 fprintf (asm_out_file
, "\n");
1090 ASM_OUTPUT_SKIP (asm_out_file
, size
);
1093 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
1096 assemble_align (align
)
1099 if (align
> BITS_PER_UNIT
)
1100 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
1103 /* Assemble a string constant with the specified C string as contents. */
1106 assemble_string (p
, size
)
1113 /* If the string is very long, split it up. */
1117 int thissize
= size
- pos
;
1118 if (thissize
> maximum
)
1121 ASM_OUTPUT_ASCII (asm_out_file
, p
, thissize
);
1129 /* Assemble everything that is needed for a variable or function declaration.
1130 Not used for automatic variables, and not used for function definitions.
1131 Should not be called for variables of incomplete structure type.
1133 TOP_LEVEL is nonzero if this variable has file scope.
1134 AT_END is nonzero if this is the special handling, at end of compilation,
1135 to define things that have had only tentative definitions.
1136 DONT_OUTPUT_DATA if nonzero means don't actually output the
1137 initial value (that will be done by the caller). */
1140 assemble_variable (decl
, top_level
, at_end
, dont_output_data
)
1144 int dont_output_data
;
1146 register char *name
;
1150 enum in_section saved_in_section
;
1152 last_assemble_variable_decl
= 0;
1154 if (GET_CODE (DECL_RTL (decl
)) == REG
)
1156 /* Do output symbol info for global register variables, but do nothing
1159 if (TREE_ASM_WRITTEN (decl
))
1161 TREE_ASM_WRITTEN (decl
) = 1;
1163 #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
1164 /* File-scope global variables are output here. */
1165 if ((write_symbols
== DBX_DEBUG
|| write_symbols
== XCOFF_DEBUG
)
1167 dbxout_symbol (decl
, 0);
1169 #ifdef SDB_DEBUGGING_INFO
1170 if (write_symbols
== SDB_DEBUG
&& top_level
1171 /* Leave initialized global vars for end of compilation;
1172 see comment in compile_file. */
1173 && (TREE_PUBLIC (decl
) == 0 || DECL_INITIAL (decl
) == 0))
1174 sdbout_symbol (decl
, 0);
1177 /* Don't output any DWARF debugging information for variables here.
1178 In the case of local variables, the information for them is output
1179 when we do our recursive traversal of the tree representation for
1180 the entire containing function. In the case of file-scope variables,
1181 we output information for all of them at the very end of compilation
1182 while we are doing our final traversal of the chain of file-scope
1188 /* Normally no need to say anything here for external references,
1189 since assemble_external is called by the language-specific code
1190 when a declaration is first seen. */
1192 if (DECL_EXTERNAL (decl
))
1195 /* Output no assembler code for a function declaration.
1196 Only definitions of functions output anything. */
1198 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1201 /* If type was incomplete when the variable was declared,
1202 see if it is complete now. */
1204 if (DECL_SIZE (decl
) == 0)
1205 layout_decl (decl
, 0);
1207 /* Still incomplete => don't allocate it; treat the tentative defn
1208 (which is what it must have been) as an `extern' reference. */
1210 if (!dont_output_data
&& DECL_SIZE (decl
) == 0)
1212 error_with_file_and_line (DECL_SOURCE_FILE (decl
),
1213 DECL_SOURCE_LINE (decl
),
1214 "storage size of `%s' isn't known",
1215 IDENTIFIER_POINTER (DECL_NAME (decl
)));
1216 TREE_ASM_WRITTEN (decl
) = 1;
1220 /* The first declaration of a variable that comes through this function
1221 decides whether it is global (in C, has external linkage)
1222 or local (in C, has internal linkage). So do nothing more
1223 if this function has already run. */
1225 if (TREE_ASM_WRITTEN (decl
))
1228 TREE_ASM_WRITTEN (decl
) = 1;
1232 if (! dont_output_data
)
1236 if (TREE_CODE (DECL_SIZE (decl
)) != INTEGER_CST
)
1239 /* This is better than explicit arithmetic, since it avoids overflow. */
1240 size_tree
= size_binop (CEIL_DIV_EXPR
,
1241 DECL_SIZE (decl
), size_int (BITS_PER_UNIT
));
1243 size
= TREE_INT_CST_LOW (size_tree
);
1244 if (TREE_INT_CST_HIGH (size_tree
) != 0
1245 || size
!= TREE_INT_CST_LOW (size_tree
))
1247 error_with_decl (decl
, "size of variable `%s' is too large");
1252 name
= XSTR (XEXP (DECL_RTL (decl
), 0), 0);
1254 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
)
1255 && ! first_global_object_name
1256 && ! (DECL_COMMON (decl
) && (DECL_INITIAL (decl
) == 0
1257 || DECL_INITIAL (decl
) == error_mark_node
))
1258 && ! DECL_WEAK (decl
)
1259 && ! DECL_ONE_ONLY (decl
))
1263 STRIP_NAME_ENCODING (p
, name
);
1264 first_global_object_name
= permalloc (strlen (p
) + 1);
1265 strcpy (first_global_object_name
, p
);
1268 /* Compute the alignment of this data. */
1270 align
= DECL_ALIGN (decl
);
1272 /* In the case for initialing an array whose length isn't specified,
1273 where we have not yet been able to do the layout,
1274 figure out the proper alignment now. */
1275 if (dont_output_data
&& DECL_SIZE (decl
) == 0
1276 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
)
1277 align
= MAX (align
, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl
))));
1279 /* Some object file formats have a maximum alignment which they support.
1280 In particular, a.out format supports a maximum alignment of 4. */
1281 #ifndef MAX_OFILE_ALIGNMENT
1282 #define MAX_OFILE_ALIGNMENT BIGGEST_ALIGNMENT
1284 if (align
> MAX_OFILE_ALIGNMENT
)
1286 warning_with_decl (decl
,
1287 "alignment of `%s' is greater than maximum object file alignment");
1288 align
= MAX_OFILE_ALIGNMENT
;
1291 /* On some machines, it is good to increase alignment sometimes. */
1292 #ifdef DATA_ALIGNMENT
1293 align
= DATA_ALIGNMENT (TREE_TYPE (decl
), align
);
1295 #ifdef CONSTANT_ALIGNMENT
1296 if (DECL_INITIAL (decl
) != 0 && DECL_INITIAL (decl
) != error_mark_node
)
1297 align
= CONSTANT_ALIGNMENT (DECL_INITIAL (decl
), align
);
1300 /* Reset the alignment in case we have made it tighter, so we can benefit
1301 from it in get_pointer_alignment. */
1302 DECL_ALIGN (decl
) = align
;
1304 /* Handle uninitialized definitions. */
1306 if ((DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
)
1307 /* If the target can't output uninitialized but not common global data
1308 in .bss, then we have to use .data. */
1309 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
1310 && DECL_COMMON (decl
)
1312 && ! dont_output_data
)
1314 int size
= TREE_INT_CST_LOW (size_tree
);
1317 /* Don't allocate zero bytes of common,
1318 since that means "undefined external" in the linker. */
1319 if (size
== 0) rounded
= 1;
1320 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1321 so that each uninitialized object starts on such a boundary. */
1322 rounded
+= (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1;
1323 rounded
= (rounded
/ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1324 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1326 #ifdef DBX_DEBUGGING_INFO
1327 /* File-scope global variables are output here. */
1328 if (write_symbols
== DBX_DEBUG
&& top_level
)
1329 dbxout_symbol (decl
, 0);
1331 #ifdef SDB_DEBUGGING_INFO
1332 if (write_symbols
== SDB_DEBUG
&& top_level
1333 /* Leave initialized global vars for end of compilation;
1334 see comment in compile_file. */
1335 && (TREE_PUBLIC (decl
) == 0 || DECL_INITIAL (decl
) == 0))
1336 sdbout_symbol (decl
, 0);
1339 /* Don't output any DWARF debugging information for variables here.
1340 In the case of local variables, the information for them is output
1341 when we do our recursive traversal of the tree representation for
1342 the entire containing function. In the case of file-scope variables,
1343 we output information for all of them at the very end of compilation
1344 while we are doing our final traversal of the chain of file-scope
1347 #if 0 /* ??? We should either delete this or add a comment describing what
1348 it was intended to do and why we shouldn't delete it. */
1349 if (flag_shared_data
)
1353 if (TREE_PUBLIC (decl
)
1354 #if defined (ASM_OUTPUT_BSS) || defined (ASM_OUTPUT_ALIGNED_BSS)
1355 && DECL_COMMON (decl
)
1359 #ifdef ASM_OUTPUT_SHARED_COMMON
1360 if (flag_shared_data
)
1361 ASM_OUTPUT_SHARED_COMMON (asm_out_file
, name
, size
, rounded
);
1365 #ifdef ASM_OUTPUT_ALIGNED_DECL_COMMON
1366 ASM_OUTPUT_ALIGNED_DECL_COMMON (asm_out_file
, decl
, name
, size
,
1369 #ifdef ASM_OUTPUT_ALIGNED_COMMON
1370 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file
, name
, size
,
1373 ASM_OUTPUT_COMMON (asm_out_file
, name
, size
, rounded
);
1378 #if defined (ASM_OUTPUT_BSS) || defined (ASM_OUTPUT_ALIGNED_BSS)
1379 else if (TREE_PUBLIC (decl
))
1381 #ifdef ASM_OUTPUT_SHARED_BSS
1382 if (flag_shared_data
)
1383 ASM_OUTPUT_SHARED_BSS (asm_out_file
, decl
, name
, size
, rounded
);
1387 #ifdef ASM_OUTPUT_ALIGNED_BSS
1388 ASM_OUTPUT_ALIGNED_BSS (asm_out_file
, decl
, name
, size
,
1391 ASM_OUTPUT_BSS (asm_out_file
, decl
, name
, size
, rounded
);
1395 #endif /* ASM_OUTPUT_BSS || ASM_OUTPUT_ALIGNED_BSS */
1398 #ifdef ASM_OUTPUT_SHARED_LOCAL
1399 if (flag_shared_data
)
1400 ASM_OUTPUT_SHARED_LOCAL (asm_out_file
, name
, size
, rounded
);
1404 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
1405 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file
, decl
, name
, size
,
1408 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1409 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file
, name
, size
,
1412 ASM_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
1420 /* Handle initialized definitions.
1421 Also handle uninitialized global definitions if -fno-common and the
1422 target doesn't support ASM_OUTPUT_BSS. */
1424 /* First make the assembler name(s) global if appropriate. */
1425 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
))
1427 #ifdef ASM_WEAKEN_LABEL
1428 if (DECL_WEAK (decl
))
1429 ASM_WEAKEN_LABEL (asm_out_file
, name
);
1432 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
1435 for (d
= equivalents
; d
; d
= TREE_CHAIN (d
))
1437 tree e
= TREE_VALUE (d
);
1438 if (TREE_PUBLIC (e
) && DECL_NAME (e
))
1439 ASM_GLOBALIZE_LABEL (asm_out_file
,
1440 XSTR (XEXP (DECL_RTL (e
), 0), 0));
1444 /* Output any data that we will need to use the address of. */
1445 if (DECL_INITIAL (decl
) == error_mark_node
)
1446 reloc
= contains_pointers_p (TREE_TYPE (decl
));
1447 else if (DECL_INITIAL (decl
))
1448 reloc
= output_addressed_constants (DECL_INITIAL (decl
));
1450 #ifdef ASM_OUTPUT_SECTION_NAME
1451 if (UNIQUE_SECTION_P (decl
))
1452 UNIQUE_SECTION (decl
, reloc
);
1455 /* Switch to the appropriate section. */
1456 variable_section (decl
, reloc
);
1458 /* dbxout.c needs to know this. */
1459 if (in_text_section ())
1460 DECL_IN_TEXT_SECTION (decl
) = 1;
1462 /* Record current section so we can restore it if dbxout.c clobbers it. */
1463 saved_in_section
= in_section
;
1465 /* Output the dbx info now that we have chosen the section. */
1467 #ifdef DBX_DEBUGGING_INFO
1468 /* File-scope global variables are output here. */
1469 if (write_symbols
== DBX_DEBUG
&& top_level
)
1470 dbxout_symbol (decl
, 0);
1472 #ifdef SDB_DEBUGGING_INFO
1473 if (write_symbols
== SDB_DEBUG
&& top_level
1474 /* Leave initialized global vars for end of compilation;
1475 see comment in compile_file. */
1476 && (TREE_PUBLIC (decl
) == 0 || DECL_INITIAL (decl
) == 0))
1477 sdbout_symbol (decl
, 0);
1480 /* Don't output any DWARF debugging information for variables here.
1481 In the case of local variables, the information for them is output
1482 when we do our recursive traversal of the tree representation for
1483 the entire containing function. In the case of file-scope variables,
1484 we output information for all of them at the very end of compilation
1485 while we are doing our final traversal of the chain of file-scope
1488 /* If the debugging output changed sections, reselect the section
1489 that's supposed to be selected. */
1490 if (in_section
!= saved_in_section
)
1491 variable_section (decl
, reloc
);
1493 /* Output the alignment of this data. */
1494 if (align
> BITS_PER_UNIT
)
1495 ASM_OUTPUT_ALIGN (asm_out_file
,
1496 floor_log2 (DECL_ALIGN (decl
) / BITS_PER_UNIT
));
1498 /* Do any machine/system dependent processing of the object. */
1499 #ifdef ASM_DECLARE_OBJECT_NAME
1500 last_assemble_variable_decl
= decl
;
1501 ASM_DECLARE_OBJECT_NAME (asm_out_file
, name
, decl
);
1503 /* Standard thing is just output label for the object. */
1504 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1505 #endif /* ASM_DECLARE_OBJECT_NAME */
1507 if (!dont_output_data
)
1509 if (DECL_INITIAL (decl
))
1510 /* Output the actual data. */
1511 output_constant (DECL_INITIAL (decl
), TREE_INT_CST_LOW (size_tree
));
1513 /* Leave space for it. */
1514 assemble_zeros (TREE_INT_CST_LOW (size_tree
));
1518 #ifdef XCOFF_DEBUGGING_INFO
1519 /* Unfortunately, the IBM assembler cannot handle stabx before the actual
1520 declaration. When something like ".stabx "aa:S-2",aa,133,0" is emitted
1521 and `aa' hasn't been output yet, the assembler generates a stab entry with
1522 a value of zero, in addition to creating an unnecessary external entry
1523 for `aa'. Hence, we must postpone dbxout_symbol to here at the end. */
1525 /* File-scope global variables are output here. */
1526 if (write_symbols
== XCOFF_DEBUG
&& top_level
)
1528 saved_in_section
= in_section
;
1530 dbxout_symbol (decl
, 0);
1532 if (in_section
!= saved_in_section
)
1533 variable_section (decl
, reloc
);
1536 /* There must be a statement after a label. */
1541 /* Return 1 if type TYPE contains any pointers. */
1544 contains_pointers_p (type
)
1547 switch (TREE_CODE (type
))
1550 case REFERENCE_TYPE
:
1551 /* I'm not sure whether OFFSET_TYPE needs this treatment,
1552 so I'll play safe and return 1. */
1558 case QUAL_UNION_TYPE
:
1561 /* For a type that has fields, see if the fields have pointers. */
1562 for (fields
= TYPE_FIELDS (type
); fields
; fields
= TREE_CHAIN (fields
))
1563 if (TREE_CODE (fields
) == FIELD_DECL
1564 && contains_pointers_p (TREE_TYPE (fields
)))
1570 /* An array type contains pointers if its element type does. */
1571 return contains_pointers_p (TREE_TYPE (type
));
1578 /* Output something to declare an external symbol to the assembler.
1579 (Most assemblers don't need this, so we normally output nothing.)
1580 Do nothing if DECL is not external. */
1583 assemble_external (decl
)
1586 #ifdef ASM_OUTPUT_EXTERNAL
1587 if (TREE_CODE_CLASS (TREE_CODE (decl
)) == 'd'
1588 && DECL_EXTERNAL (decl
) && TREE_PUBLIC (decl
))
1590 rtx rtl
= DECL_RTL (decl
);
1592 if (GET_CODE (rtl
) == MEM
&& GET_CODE (XEXP (rtl
, 0)) == SYMBOL_REF
1593 && ! SYMBOL_REF_USED (XEXP (rtl
, 0)))
1595 /* Some systems do require some output. */
1596 SYMBOL_REF_USED (XEXP (rtl
, 0)) = 1;
1597 ASM_OUTPUT_EXTERNAL (asm_out_file
, decl
, XSTR (XEXP (rtl
, 0), 0));
1603 /* Similar, for calling a library function FUN. */
1606 assemble_external_libcall (fun
)
1609 #ifdef ASM_OUTPUT_EXTERNAL_LIBCALL
1610 /* Declare library function name external when first used, if nec. */
1611 if (! SYMBOL_REF_USED (fun
))
1613 SYMBOL_REF_USED (fun
) = 1;
1614 ASM_OUTPUT_EXTERNAL_LIBCALL (asm_out_file
, fun
);
1619 /* Declare the label NAME global. */
1622 assemble_global (name
)
1625 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
1628 /* Assemble a label named NAME. */
1631 assemble_label (name
)
1634 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1637 /* Output to FILE a reference to the assembler name of a C-level name NAME.
1638 If NAME starts with a *, the rest of NAME is output verbatim.
1639 Otherwise NAME is transformed in an implementation-defined way
1640 (usually by the addition of an underscore).
1641 Many macros in the tm file are defined to call this function. */
1644 assemble_name (file
, name
)
1651 STRIP_NAME_ENCODING (real_name
, name
);
1652 if (flag_prefix_function_name
1653 && ! bcmp (real_name
, CHKR_PREFIX
, CHKR_PREFIX_SIZE
))
1654 real_name
= real_name
+ CHKR_PREFIX_SIZE
;
1656 id
= maybe_get_identifier (real_name
);
1658 TREE_SYMBOL_REFERENCED (id
) = 1;
1661 fputs (&name
[1], file
);
1663 ASM_OUTPUT_LABELREF (file
, name
);
1666 /* Allocate SIZE bytes writable static space with a gensym name
1667 and return an RTX to refer to its address. */
1670 assemble_static_space (size
)
1676 #ifndef ASM_OUTPUT_ALIGNED_LOCAL
1677 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1678 so that each uninitialized object starts on such a boundary. */
1679 int rounded
= ((size
+ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1)
1680 / (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1681 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1685 if (flag_shared_data
)
1689 ASM_GENERATE_INTERNAL_LABEL (name
, "LF", const_labelno
);
1692 namestring
= (char *) obstack_alloc (saveable_obstack
,
1694 strcpy (namestring
, name
);
1696 x
= gen_rtx_SYMBOL_REF (Pmode
, namestring
);
1698 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
1699 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file
, NULL_TREE
, name
, size
,
1702 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1703 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file
, name
, size
, BIGGEST_ALIGNMENT
);
1705 ASM_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
1711 /* Assemble the static constant template for function entry trampolines.
1712 This is done at most once per compilation.
1713 Returns an RTX for the address of the template. */
1715 #ifdef TRAMPOLINE_TEMPLATE
1717 assemble_trampoline_template ()
1723 /* By default, put trampoline templates in read-only data section. */
1725 #ifdef TRAMPOLINE_SECTION
1726 TRAMPOLINE_SECTION ();
1728 readonly_data_section ();
1731 /* Write the assembler code to define one. */
1732 align
= floor_log2 (TRAMPOLINE_ALIGNMENT
/ BITS_PER_UNIT
);
1734 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1736 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LTRAMP", 0);
1737 TRAMPOLINE_TEMPLATE (asm_out_file
);
1739 /* Record the rtl to refer to it. */
1740 ASM_GENERATE_INTERNAL_LABEL (label
, "LTRAMP", 0);
1742 = (char *) obstack_copy0 (&permanent_obstack
, label
, strlen (label
));
1743 return gen_rtx_SYMBOL_REF (Pmode
, name
);
1747 /* Assemble the integer constant X into an object of SIZE bytes.
1748 X must be either a CONST_INT or CONST_DOUBLE.
1750 Return 1 if we were able to output the constant, otherwise 0. If FORCE is
1751 non-zero, abort if we can't output the constant. */
1754 assemble_integer (x
, size
, force
)
1759 /* First try to use the standard 1, 2, 4, 8, and 16 byte
1760 ASM_OUTPUT... macros. */
1764 #ifdef ASM_OUTPUT_CHAR
1766 ASM_OUTPUT_CHAR (asm_out_file
, x
);
1770 #ifdef ASM_OUTPUT_SHORT
1772 ASM_OUTPUT_SHORT (asm_out_file
, x
);
1776 #ifdef ASM_OUTPUT_INT
1778 ASM_OUTPUT_INT (asm_out_file
, x
);
1782 #ifdef ASM_OUTPUT_DOUBLE_INT
1784 ASM_OUTPUT_DOUBLE_INT (asm_out_file
, x
);
1788 #ifdef ASM_OUTPUT_QUADRUPLE_INT
1790 ASM_OUTPUT_QUADRUPLE_INT (asm_out_file
, x
);
1795 /* If we couldn't do it that way, there are two other possibilities: First,
1796 if the machine can output an explicit byte and this is a 1 byte constant,
1797 we can use ASM_OUTPUT_BYTE. */
1799 #ifdef ASM_OUTPUT_BYTE
1800 if (size
== 1 && GET_CODE (x
) == CONST_INT
)
1802 ASM_OUTPUT_BYTE (asm_out_file
, INTVAL (x
));
1807 /* Finally, if SIZE is larger than a single word, try to output the constant
1808 one word at a time. */
1810 if (size
> UNITS_PER_WORD
)
1813 enum machine_mode mode
1814 = mode_for_size (size
* BITS_PER_UNIT
, MODE_INT
, 0);
1817 for (i
= 0; i
< size
/ UNITS_PER_WORD
; i
++)
1819 word
= operand_subword (x
, i
, 0, mode
);
1824 if (! assemble_integer (word
, UNITS_PER_WORD
, 0))
1828 if (i
== size
/ UNITS_PER_WORD
)
1830 /* If we output at least one word and then could not finish,
1831 there is no valid way to continue. */
1842 /* Assemble the floating-point constant D into an object of size MODE. */
1845 assemble_real (d
, mode
)
1847 enum machine_mode mode
;
1849 jmp_buf output_constant_handler
;
1851 if (setjmp (output_constant_handler
))
1853 error ("floating point trap outputting a constant");
1854 #ifdef REAL_IS_NOT_DOUBLE
1855 bzero ((char *) &d
, sizeof d
);
1862 set_float_handler (output_constant_handler
);
1866 #ifdef ASM_OUTPUT_BYTE_FLOAT
1868 ASM_OUTPUT_BYTE_FLOAT (asm_out_file
, d
);
1871 #ifdef ASM_OUTPUT_SHORT_FLOAT
1873 ASM_OUTPUT_SHORT_FLOAT (asm_out_file
, d
);
1876 #ifdef ASM_OUTPUT_THREE_QUARTER_FLOAT
1878 ASM_OUTPUT_THREE_QUARTER_FLOAT (asm_out_file
, d
);
1881 #ifdef ASM_OUTPUT_FLOAT
1883 ASM_OUTPUT_FLOAT (asm_out_file
, d
);
1887 #ifdef ASM_OUTPUT_DOUBLE
1889 ASM_OUTPUT_DOUBLE (asm_out_file
, d
);
1893 #ifdef ASM_OUTPUT_LONG_DOUBLE
1896 ASM_OUTPUT_LONG_DOUBLE (asm_out_file
, d
);
1904 set_float_handler (NULL_PTR
);
1907 /* Here we combine duplicate floating constants to make
1908 CONST_DOUBLE rtx's, and force those out to memory when necessary. */
1910 /* Chain of all CONST_DOUBLE rtx's constructed for the current function.
1911 They are chained through the CONST_DOUBLE_CHAIN.
1912 A CONST_DOUBLE rtx has CONST_DOUBLE_MEM != cc0_rtx iff it is on this chain.
1913 In that case, CONST_DOUBLE_MEM is either a MEM,
1914 or const0_rtx if no MEM has been made for this CONST_DOUBLE yet.
1916 (CONST_DOUBLE_MEM is used only for top-level functions.
1917 See force_const_mem for explanation.) */
1919 static rtx const_double_chain
;
1921 /* Return a CONST_DOUBLE or CONST_INT for a value specified as a pair of ints.
1922 For an integer, I0 is the low-order word and I1 is the high-order word.
1923 For a real number, I0 is the word with the low address
1924 and I1 is the word with the high address. */
1927 immed_double_const (i0
, i1
, mode
)
1928 HOST_WIDE_INT i0
, i1
;
1929 enum machine_mode mode
;
1933 if (GET_MODE_CLASS (mode
) == MODE_INT
1934 || GET_MODE_CLASS (mode
) == MODE_PARTIAL_INT
)
1936 /* We clear out all bits that don't belong in MODE, unless they and our
1937 sign bit are all one. So we get either a reasonable negative value
1938 or a reasonable unsigned value for this mode. */
1939 int width
= GET_MODE_BITSIZE (mode
);
1940 if (width
< HOST_BITS_PER_WIDE_INT
1941 && ((i0
& ((HOST_WIDE_INT
) (-1) << (width
- 1)))
1942 != ((HOST_WIDE_INT
) (-1) << (width
- 1))))
1943 i0
&= ((HOST_WIDE_INT
) 1 << width
) - 1, i1
= 0;
1944 else if (width
== HOST_BITS_PER_WIDE_INT
1945 && ! (i1
== ~0 && i0
< 0))
1947 else if (width
> 2 * HOST_BITS_PER_WIDE_INT
)
1948 /* We cannot represent this value as a constant. */
1951 /* If this would be an entire word for the target, but is not for
1952 the host, then sign-extend on the host so that the number will look
1953 the same way on the host that it would on the target.
1955 For example, when building a 64 bit alpha hosted 32 bit sparc
1956 targeted compiler, then we want the 32 bit unsigned value -1 to be
1957 represented as a 64 bit value -1, and not as 0x00000000ffffffff.
1958 The later confuses the sparc backend. */
1960 if (BITS_PER_WORD
< HOST_BITS_PER_WIDE_INT
&& BITS_PER_WORD
== width
1961 && (i0
& ((HOST_WIDE_INT
) 1 << (width
- 1))))
1962 i0
|= ((HOST_WIDE_INT
) (-1) << width
);
1964 /* If MODE fits within HOST_BITS_PER_WIDE_INT, always use a CONST_INT.
1966 ??? Strictly speaking, this is wrong if we create a CONST_INT
1967 for a large unsigned constant with the size of MODE being
1968 HOST_BITS_PER_WIDE_INT and later try to interpret that constant in a
1969 wider mode. In that case we will mis-interpret it as a negative
1972 Unfortunately, the only alternative is to make a CONST_DOUBLE
1973 for any constant in any mode if it is an unsigned constant larger
1974 than the maximum signed integer in an int on the host. However,
1975 doing this will break everyone that always expects to see a CONST_INT
1976 for SImode and smaller.
1978 We have always been making CONST_INTs in this case, so nothing new
1981 if (width
<= HOST_BITS_PER_WIDE_INT
)
1982 i1
= (i0
< 0) ? ~(HOST_WIDE_INT
) 0 : 0;
1984 /* If this integer fits in one word, return a CONST_INT. */
1985 if ((i1
== 0 && i0
>= 0)
1986 || (i1
== ~0 && i0
< 0))
1987 return GEN_INT (i0
);
1989 /* We use VOIDmode for integers. */
1993 /* Search the chain for an existing CONST_DOUBLE with the right value.
1994 If one is found, return it. */
1996 for (r
= const_double_chain
; r
; r
= CONST_DOUBLE_CHAIN (r
))
1997 if (CONST_DOUBLE_LOW (r
) == i0
&& CONST_DOUBLE_HIGH (r
) == i1
1998 && GET_MODE (r
) == mode
)
2001 /* No; make a new one and add it to the chain.
2003 We may be called by an optimizer which may be discarding any memory
2004 allocated during its processing (such as combine and loop). However,
2005 we will be leaving this constant on the chain, so we cannot tolerate
2006 freed memory. So switch to saveable_obstack for this allocation
2007 and then switch back if we were in current_obstack. */
2009 push_obstacks_nochange ();
2010 rtl_in_saveable_obstack ();
2011 r
= gen_rtx_CONST_DOUBLE (mode
, NULL_RTX
, i0
, i1
);
2014 /* Don't touch const_double_chain in nested function; see force_const_mem.
2015 Also, don't touch it if not inside any function. */
2016 if (outer_function_chain
== 0 && current_function_decl
!= 0)
2018 CONST_DOUBLE_CHAIN (r
) = const_double_chain
;
2019 const_double_chain
= r
;
2022 /* Store const0_rtx in mem-slot since this CONST_DOUBLE is on the chain.
2023 Actual use of mem-slot is only through force_const_mem. */
2025 CONST_DOUBLE_MEM (r
) = const0_rtx
;
2030 /* Return a CONST_DOUBLE for a specified `double' value
2031 and machine mode. */
2034 immed_real_const_1 (d
, mode
)
2036 enum machine_mode mode
;
2038 union real_extract u
;
2041 /* Get the desired `double' value as a sequence of ints
2042 since that is how they are stored in a CONST_DOUBLE. */
2046 /* Detect special cases. */
2048 if (REAL_VALUES_IDENTICAL (dconst0
, d
))
2049 return CONST0_RTX (mode
);
2050 /* Check for NaN first, because some ports (specifically the i386) do not
2051 emit correct ieee-fp code by default, and thus will generate a core
2052 dump here if we pass a NaN to REAL_VALUES_EQUAL and if REAL_VALUES_EQUAL
2053 does a floating point comparison. */
2054 else if (! REAL_VALUE_ISNAN (d
) && REAL_VALUES_EQUAL (dconst1
, d
))
2055 return CONST1_RTX (mode
);
2057 if (sizeof u
== 2 * sizeof (HOST_WIDE_INT
))
2058 return immed_double_const (u
.i
[0], u
.i
[1], mode
);
2060 /* The rest of this function handles the case where
2061 a float value requires more than 2 ints of space.
2062 It will be deleted as dead code on machines that don't need it. */
2064 /* Search the chain for an existing CONST_DOUBLE with the right value.
2065 If one is found, return it. */
2067 for (r
= const_double_chain
; r
; r
= CONST_DOUBLE_CHAIN (r
))
2068 if (! bcmp ((char *) &CONST_DOUBLE_LOW (r
), (char *) &u
, sizeof u
)
2069 && GET_MODE (r
) == mode
)
2072 /* No; make a new one and add it to the chain.
2074 We may be called by an optimizer which may be discarding any memory
2075 allocated during its processing (such as combine and loop). However,
2076 we will be leaving this constant on the chain, so we cannot tolerate
2077 freed memory. So switch to saveable_obstack for this allocation
2078 and then switch back if we were in current_obstack. */
2080 push_obstacks_nochange ();
2081 rtl_in_saveable_obstack ();
2082 r
= rtx_alloc (CONST_DOUBLE
);
2084 bcopy ((char *) &u
, (char *) &CONST_DOUBLE_LOW (r
), sizeof u
);
2087 /* Don't touch const_double_chain in nested function; see force_const_mem.
2088 Also, don't touch it if not inside any function. */
2089 if (outer_function_chain
== 0 && current_function_decl
!= 0)
2091 CONST_DOUBLE_CHAIN (r
) = const_double_chain
;
2092 const_double_chain
= r
;
2095 /* Store const0_rtx in CONST_DOUBLE_MEM since this CONST_DOUBLE is on the
2096 chain, but has not been allocated memory. Actual use of CONST_DOUBLE_MEM
2097 is only through force_const_mem. */
2099 CONST_DOUBLE_MEM (r
) = const0_rtx
;
2104 /* Return a CONST_DOUBLE rtx for a value specified by EXP,
2105 which must be a REAL_CST tree node. */
2108 immed_real_const (exp
)
2111 return immed_real_const_1 (TREE_REAL_CST (exp
), TYPE_MODE (TREE_TYPE (exp
)));
2114 /* At the end of a function, forget the memory-constants
2115 previously made for CONST_DOUBLEs. Mark them as not on real_constant_chain.
2116 Also clear out real_constant_chain and clear out all the chain-pointers. */
2119 clear_const_double_mem ()
2121 register rtx r
, next
;
2123 /* Don't touch CONST_DOUBLE_MEM for nested functions.
2124 See force_const_mem for explanation. */
2125 if (outer_function_chain
!= 0)
2128 for (r
= const_double_chain
; r
; r
= next
)
2130 next
= CONST_DOUBLE_CHAIN (r
);
2131 CONST_DOUBLE_CHAIN (r
) = 0;
2132 CONST_DOUBLE_MEM (r
) = cc0_rtx
;
2134 const_double_chain
= 0;
2137 /* Given an expression EXP with a constant value,
2138 reduce it to the sum of an assembler symbol and an integer.
2139 Store them both in the structure *VALUE.
2140 Abort if EXP does not reduce. */
2145 HOST_WIDE_INT offset
;
2149 decode_addr_const (exp
, value
)
2151 struct addr_const
*value
;
2153 register tree target
= TREE_OPERAND (exp
, 0);
2154 register int offset
= 0;
2159 if (TREE_CODE (target
) == COMPONENT_REF
2160 && (TREE_CODE (DECL_FIELD_BITPOS (TREE_OPERAND (target
, 1)))
2163 offset
+= TREE_INT_CST_LOW (DECL_FIELD_BITPOS (TREE_OPERAND (target
, 1))) / BITS_PER_UNIT
;
2164 target
= TREE_OPERAND (target
, 0);
2166 else if (TREE_CODE (target
) == ARRAY_REF
)
2168 if (TREE_CODE (TREE_OPERAND (target
, 1)) != INTEGER_CST
2169 || TREE_CODE (TYPE_SIZE (TREE_TYPE (target
))) != INTEGER_CST
)
2171 offset
+= ((TREE_INT_CST_LOW (TYPE_SIZE (TREE_TYPE (target
)))
2172 * TREE_INT_CST_LOW (TREE_OPERAND (target
, 1)))
2174 target
= TREE_OPERAND (target
, 0);
2180 switch (TREE_CODE (target
))
2184 x
= DECL_RTL (target
);
2188 x
= gen_rtx_MEM (FUNCTION_MODE
,
2189 gen_rtx_LABEL_REF (VOIDmode
,
2190 label_rtx (TREE_OPERAND (exp
, 0))));
2198 x
= TREE_CST_RTL (target
);
2205 if (GET_CODE (x
) != MEM
)
2210 value
->offset
= offset
;
2213 /* Uniquize all constants that appear in memory.
2214 Each constant in memory thus far output is recorded
2215 in `const_hash_table' with a `struct constant_descriptor'
2216 that contains a polish representation of the value of
2219 We cannot store the trees in the hash table
2220 because the trees may be temporary. */
2222 struct constant_descriptor
2224 struct constant_descriptor
*next
;
2230 #define MAX_HASH_TABLE 1009
2231 static struct constant_descriptor
*const_hash_table
[MAX_HASH_TABLE
];
2233 /* Compute a hash code for a constant expression. */
2240 register int len
, hi
, i
;
2241 register enum tree_code code
= TREE_CODE (exp
);
2243 /* Either set P and LEN to the address and len of something to hash and
2244 exit the switch or return a value. */
2249 p
= (char *) &TREE_INT_CST_LOW (exp
);
2250 len
= 2 * sizeof TREE_INT_CST_LOW (exp
);
2254 p
= (char *) &TREE_REAL_CST (exp
);
2255 len
= sizeof TREE_REAL_CST (exp
);
2259 p
= TREE_STRING_POINTER (exp
);
2260 len
= TREE_STRING_LENGTH (exp
);
2264 return (const_hash (TREE_REALPART (exp
)) * 5
2265 + const_hash (TREE_IMAGPART (exp
)));
2268 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2270 len
= int_size_in_bytes (TREE_TYPE (exp
));
2271 p
= (char *) alloca (len
);
2272 get_set_constructor_bytes (exp
, (unsigned char *) p
, len
);
2279 /* For record type, include the type in the hashing.
2280 We do not do so for array types
2281 because (1) the sizes of the elements are sufficient
2282 and (2) distinct array types can have the same constructor.
2283 Instead, we include the array size because the constructor could
2285 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2286 hi
= ((unsigned long) TREE_TYPE (exp
) & ((1 << HASHBITS
) - 1))
2289 hi
= ((5 + int_size_in_bytes (TREE_TYPE (exp
)))
2290 & ((1 << HASHBITS
) - 1)) % MAX_HASH_TABLE
;
2292 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2293 if (TREE_VALUE (link
))
2295 = (hi
* 603 + const_hash (TREE_VALUE (link
))) % MAX_HASH_TABLE
;
2302 struct addr_const value
;
2304 decode_addr_const (exp
, &value
);
2305 if (GET_CODE (value
.base
) == SYMBOL_REF
)
2307 /* Don't hash the address of the SYMBOL_REF;
2308 only use the offset and the symbol name. */
2310 p
= XSTR (value
.base
, 0);
2311 for (i
= 0; p
[i
] != 0; i
++)
2312 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2314 else if (GET_CODE (value
.base
) == LABEL_REF
)
2315 hi
= value
.offset
+ CODE_LABEL_NUMBER (XEXP (value
.base
, 0)) * 13;
2317 hi
&= (1 << HASHBITS
) - 1;
2318 hi
%= MAX_HASH_TABLE
;
2324 return (const_hash (TREE_OPERAND (exp
, 0)) * 9
2325 + const_hash (TREE_OPERAND (exp
, 1)));
2329 case NON_LVALUE_EXPR
:
2330 return const_hash (TREE_OPERAND (exp
, 0)) * 7 + 2;
2336 /* Compute hashing function */
2338 for (i
= 0; i
< len
; i
++)
2339 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2341 hi
&= (1 << HASHBITS
) - 1;
2342 hi
%= MAX_HASH_TABLE
;
2346 /* Compare a constant expression EXP with a constant-descriptor DESC.
2347 Return 1 if DESC describes a constant with the same value as EXP. */
2350 compare_constant (exp
, desc
)
2352 struct constant_descriptor
*desc
;
2354 return 0 != compare_constant_1 (exp
, desc
->contents
);
2357 /* Compare constant expression EXP with a substring P of a constant descriptor.
2358 If they match, return a pointer to the end of the substring matched.
2359 If they do not match, return 0.
2361 Since descriptors are written in polish prefix notation,
2362 this function can be used recursively to test one operand of EXP
2363 against a subdescriptor, and if it succeeds it returns the
2364 address of the subdescriptor for the next operand. */
2367 compare_constant_1 (exp
, p
)
2371 register char *strp
;
2373 register enum tree_code code
= TREE_CODE (exp
);
2375 if (code
!= (enum tree_code
) *p
++)
2378 /* Either set STRP, P and LEN to pointers and length to compare and exit the
2379 switch, or return the result of the comparison. */
2384 /* Integer constants are the same only if the same width of type. */
2385 if (*p
++ != TYPE_PRECISION (TREE_TYPE (exp
)))
2388 strp
= (char *) &TREE_INT_CST_LOW (exp
);
2389 len
= 2 * sizeof TREE_INT_CST_LOW (exp
);
2393 /* Real constants are the same only if the same width of type. */
2394 if (*p
++ != TYPE_PRECISION (TREE_TYPE (exp
)))
2397 strp
= (char *) &TREE_REAL_CST (exp
);
2398 len
= sizeof TREE_REAL_CST (exp
);
2402 if (flag_writable_strings
)
2405 if (*p
++ != TYPE_MODE (TREE_TYPE (exp
)))
2408 strp
= TREE_STRING_POINTER (exp
);
2409 len
= TREE_STRING_LENGTH (exp
);
2410 if (bcmp ((char *) &TREE_STRING_LENGTH (exp
), p
,
2411 sizeof TREE_STRING_LENGTH (exp
)))
2414 p
+= sizeof TREE_STRING_LENGTH (exp
);
2418 p
= compare_constant_1 (TREE_REALPART (exp
), p
);
2422 return compare_constant_1 (TREE_IMAGPART (exp
), p
);
2425 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2427 int xlen
= len
= int_size_in_bytes (TREE_TYPE (exp
));
2429 strp
= (char *) alloca (len
);
2430 get_set_constructor_bytes (exp
, (unsigned char *) strp
, len
);
2431 if (bcmp ((char *) &xlen
, p
, sizeof xlen
))
2440 int length
= list_length (CONSTRUCTOR_ELTS (exp
));
2442 int have_purpose
= 0;
2444 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2445 if (TREE_PURPOSE (link
))
2448 if (bcmp ((char *) &length
, p
, sizeof length
))
2453 /* For record constructors, insist that the types match.
2454 For arrays, just verify both constructors are for arrays.
2455 Then insist that either both or none have any TREE_PURPOSE
2457 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2458 type
= TREE_TYPE (exp
);
2462 if (bcmp ((char *) &type
, p
, sizeof type
))
2467 if (bcmp ((char *) &have_purpose
, p
, sizeof have_purpose
))
2470 p
+= sizeof have_purpose
;
2472 /* For arrays, insist that the size in bytes match. */
2473 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2475 HOST_WIDE_INT size
= int_size_in_bytes (TREE_TYPE (exp
));
2477 if (bcmp ((char *) &size
, p
, sizeof size
))
2483 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2485 if (TREE_VALUE (link
))
2487 if ((p
= compare_constant_1 (TREE_VALUE (link
), p
)) == 0)
2494 if (bcmp ((char *) &zero
, p
, sizeof zero
))
2500 if (TREE_PURPOSE (link
)
2501 && TREE_CODE (TREE_PURPOSE (link
)) == FIELD_DECL
)
2503 if (bcmp ((char *) &TREE_PURPOSE (link
), p
,
2504 sizeof TREE_PURPOSE (link
)))
2507 p
+= sizeof TREE_PURPOSE (link
);
2509 else if (TREE_PURPOSE (link
))
2511 if ((p
= compare_constant_1 (TREE_PURPOSE (link
), p
)) == 0)
2514 else if (have_purpose
)
2518 if (bcmp ((char *) &zero
, p
, sizeof zero
))
2530 struct addr_const value
;
2532 decode_addr_const (exp
, &value
);
2533 strp
= (char *) &value
.offset
;
2534 len
= sizeof value
.offset
;
2535 /* Compare the offset. */
2537 if (*p
++ != *strp
++)
2540 /* Compare symbol name. */
2541 strp
= XSTR (value
.base
, 0);
2542 len
= strlen (strp
) + 1;
2548 p
= compare_constant_1 (TREE_OPERAND (exp
, 0), p
);
2552 return compare_constant_1 (TREE_OPERAND (exp
, 1), p
);
2556 case NON_LVALUE_EXPR
:
2557 return compare_constant_1 (TREE_OPERAND (exp
, 0), p
);
2563 /* Compare constant contents. */
2565 if (*p
++ != *strp
++)
2571 /* Construct a constant descriptor for the expression EXP.
2572 It is up to the caller to enter the descriptor in the hash table. */
2574 static struct constant_descriptor
*
2575 record_constant (exp
)
2578 struct constant_descriptor
*next
= 0;
2581 /* Make a struct constant_descriptor. The first two pointers will
2582 be filled in later. Here we just leave space for them. */
2584 obstack_grow (&permanent_obstack
, (char *) &next
, sizeof next
);
2585 obstack_grow (&permanent_obstack
, (char *) &label
, sizeof label
);
2586 record_constant_1 (exp
);
2587 return (struct constant_descriptor
*) obstack_finish (&permanent_obstack
);
2590 /* Add a description of constant expression EXP
2591 to the object growing in `permanent_obstack'.
2592 No need to return its address; the caller will get that
2593 from the obstack when the object is complete. */
2596 record_constant_1 (exp
)
2599 register char *strp
;
2601 register enum tree_code code
= TREE_CODE (exp
);
2603 obstack_1grow (&permanent_obstack
, (unsigned int) code
);
2608 obstack_1grow (&permanent_obstack
, TYPE_PRECISION (TREE_TYPE (exp
)));
2609 strp
= (char *) &TREE_INT_CST_LOW (exp
);
2610 len
= 2 * sizeof TREE_INT_CST_LOW (exp
);
2614 obstack_1grow (&permanent_obstack
, TYPE_PRECISION (TREE_TYPE (exp
)));
2615 strp
= (char *) &TREE_REAL_CST (exp
);
2616 len
= sizeof TREE_REAL_CST (exp
);
2620 if (flag_writable_strings
)
2623 obstack_1grow (&permanent_obstack
, TYPE_MODE (TREE_TYPE (exp
)));
2624 strp
= TREE_STRING_POINTER (exp
);
2625 len
= TREE_STRING_LENGTH (exp
);
2626 obstack_grow (&permanent_obstack
, (char *) &TREE_STRING_LENGTH (exp
),
2627 sizeof TREE_STRING_LENGTH (exp
));
2631 record_constant_1 (TREE_REALPART (exp
));
2632 record_constant_1 (TREE_IMAGPART (exp
));
2636 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2638 int nbytes
= int_size_in_bytes (TREE_TYPE (exp
));
2639 obstack_grow (&permanent_obstack
, &nbytes
, sizeof (nbytes
));
2640 obstack_blank (&permanent_obstack
, nbytes
);
2641 get_set_constructor_bytes
2642 (exp
, (unsigned char *) permanent_obstack
.next_free
-nbytes
,
2649 int length
= list_length (CONSTRUCTOR_ELTS (exp
));
2651 int have_purpose
= 0;
2653 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2654 if (TREE_PURPOSE (link
))
2657 obstack_grow (&permanent_obstack
, (char *) &length
, sizeof length
);
2659 /* For record constructors, insist that the types match.
2660 For arrays, just verify both constructors are for arrays.
2661 Then insist that either both or none have any TREE_PURPOSE
2663 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2664 type
= TREE_TYPE (exp
);
2667 obstack_grow (&permanent_obstack
, (char *) &type
, sizeof type
);
2668 obstack_grow (&permanent_obstack
, (char *) &have_purpose
,
2669 sizeof have_purpose
);
2671 /* For arrays, insist that the size in bytes match. */
2672 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2674 HOST_WIDE_INT size
= int_size_in_bytes (TREE_TYPE (exp
));
2675 obstack_grow (&permanent_obstack
, (char *) &size
, sizeof size
);
2678 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2680 if (TREE_VALUE (link
))
2681 record_constant_1 (TREE_VALUE (link
));
2686 obstack_grow (&permanent_obstack
,
2687 (char *) &zero
, sizeof zero
);
2690 if (TREE_PURPOSE (link
)
2691 && TREE_CODE (TREE_PURPOSE (link
)) == FIELD_DECL
)
2692 obstack_grow (&permanent_obstack
,
2693 (char *) &TREE_PURPOSE (link
),
2694 sizeof TREE_PURPOSE (link
));
2695 else if (TREE_PURPOSE (link
))
2696 record_constant_1 (TREE_PURPOSE (link
));
2697 else if (have_purpose
)
2701 obstack_grow (&permanent_obstack
,
2702 (char *) &zero
, sizeof zero
);
2710 struct addr_const value
;
2712 decode_addr_const (exp
, &value
);
2713 /* Record the offset. */
2714 obstack_grow (&permanent_obstack
,
2715 (char *) &value
.offset
, sizeof value
.offset
);
2716 /* Record the symbol name. */
2717 obstack_grow (&permanent_obstack
, XSTR (value
.base
, 0),
2718 strlen (XSTR (value
.base
, 0)) + 1);
2724 record_constant_1 (TREE_OPERAND (exp
, 0));
2725 record_constant_1 (TREE_OPERAND (exp
, 1));
2730 case NON_LVALUE_EXPR
:
2731 record_constant_1 (TREE_OPERAND (exp
, 0));
2738 /* Record constant contents. */
2739 obstack_grow (&permanent_obstack
, strp
, len
);
2742 /* Record a list of constant expressions that were passed to
2743 output_constant_def but that could not be output right away. */
2745 struct deferred_constant
2747 struct deferred_constant
*next
;
2753 static struct deferred_constant
*deferred_constants
;
2755 /* Another list of constants which should be output after the
2757 static struct deferred_constant
*after_function_constants
;
2759 /* Nonzero means defer output of addressed subconstants
2760 (i.e., those for which output_constant_def is called.) */
2761 static int defer_addressed_constants_flag
;
2763 /* Start deferring output of subconstants. */
2766 defer_addressed_constants ()
2768 defer_addressed_constants_flag
++;
2771 /* Stop deferring output of subconstants,
2772 and output now all those that have been deferred. */
2775 output_deferred_addressed_constants ()
2777 struct deferred_constant
*p
, *next
;
2779 defer_addressed_constants_flag
--;
2781 if (defer_addressed_constants_flag
> 0)
2784 for (p
= deferred_constants
; p
; p
= next
)
2786 output_constant_def_contents (p
->exp
, p
->reloc
, p
->labelno
);
2791 deferred_constants
= 0;
2794 /* Output any constants which should appear after a function. */
2797 output_after_function_constants ()
2799 struct deferred_constant
*p
, *next
;
2801 for (p
= after_function_constants
; p
; p
= next
)
2803 output_constant_def_contents (p
->exp
, p
->reloc
, p
->labelno
);
2808 after_function_constants
= 0;
2811 /* Make a copy of the whole tree structure for a constant.
2812 This handles the same types of nodes that compare_constant
2813 and record_constant handle. */
2819 switch (TREE_CODE (exp
))
2822 /* For ADDR_EXPR, we do not want to copy the decl whose address
2823 is requested. We do want to copy constants though. */
2824 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, 0))) == 'c')
2825 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2826 copy_constant (TREE_OPERAND (exp
, 0)));
2828 return copy_node (exp
);
2833 return copy_node (exp
);
2836 return build_complex (TREE_TYPE (exp
),
2837 copy_constant (TREE_REALPART (exp
)),
2838 copy_constant (TREE_IMAGPART (exp
)));
2842 return build (TREE_CODE (exp
), TREE_TYPE (exp
),
2843 copy_constant (TREE_OPERAND (exp
, 0)),
2844 copy_constant (TREE_OPERAND (exp
, 1)));
2848 case NON_LVALUE_EXPR
:
2849 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2850 copy_constant (TREE_OPERAND (exp
, 0)));
2854 tree copy
= copy_node (exp
);
2855 tree list
= copy_list (CONSTRUCTOR_ELTS (exp
));
2858 CONSTRUCTOR_ELTS (copy
) = list
;
2859 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
2860 TREE_VALUE (tail
) = copy_constant (TREE_VALUE (tail
));
2861 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2862 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
2863 TREE_PURPOSE (tail
) = copy_constant (TREE_PURPOSE (tail
));
2873 /* Return an rtx representing a reference to constant data in memory
2874 for the constant expression EXP.
2876 If assembler code for such a constant has already been output,
2877 return an rtx to refer to it.
2878 Otherwise, output such a constant in memory (or defer it for later)
2879 and generate an rtx for it.
2881 The TREE_CST_RTL of EXP is set up to point to that rtx.
2882 The const_hash_table records which constants already have label strings. */
2885 output_constant_def (exp
)
2889 register struct constant_descriptor
*desc
;
2895 if (TREE_CST_RTL (exp
))
2896 return TREE_CST_RTL (exp
);
2898 /* Make sure any other constants whose addresses appear in EXP
2899 are assigned label numbers. */
2901 reloc
= output_addressed_constants (exp
);
2903 /* Compute hash code of EXP. Search the descriptors for that hash code
2904 to see if any of them describes EXP. If yes, the descriptor records
2905 the label number already assigned. */
2907 hash
= const_hash (exp
) % MAX_HASH_TABLE
;
2909 for (desc
= const_hash_table
[hash
]; desc
; desc
= desc
->next
)
2910 if (compare_constant (exp
, desc
))
2912 found
= desc
->label
;
2918 /* No constant equal to EXP is known to have been output.
2919 Make a constant descriptor to enter EXP in the hash table.
2920 Assign the label number and record it in the descriptor for
2921 future calls to this function to find. */
2923 /* Create a string containing the label name, in LABEL. */
2924 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
2926 desc
= record_constant (exp
);
2927 desc
->next
= const_hash_table
[hash
];
2929 = (char *) obstack_copy0 (&permanent_obstack
, label
, strlen (label
));
2930 const_hash_table
[hash
] = desc
;
2934 /* Create a string containing the label name, in LABEL. */
2935 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
2938 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
2940 push_obstacks_nochange ();
2941 if (TREE_PERMANENT (exp
))
2942 end_temporary_allocation ();
2944 def
= gen_rtx_SYMBOL_REF (Pmode
, desc
->label
);
2947 = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp
)), def
);
2948 RTX_UNCHANGING_P (TREE_CST_RTL (exp
)) = 1;
2949 if (AGGREGATE_TYPE_P (TREE_TYPE (exp
)))
2950 MEM_IN_STRUCT_P (TREE_CST_RTL (exp
)) = 1;
2954 /* Optionally set flags or add text to the name to record information
2955 such as that it is a function name. If the name is changed, the macro
2956 ASM_OUTPUT_LABELREF will have to know how to strip this information. */
2957 #ifdef ENCODE_SECTION_INFO
2958 ENCODE_SECTION_INFO (exp
);
2961 /* If this is the first time we've seen this particular constant,
2962 output it (or defer its output for later). */
2965 int after_function
= 0;
2967 #ifdef CONSTANT_AFTER_FUNCTION_P
2968 if (current_function_decl
!= 0
2969 && CONSTANT_AFTER_FUNCTION_P (exp
))
2973 if (defer_addressed_constants_flag
|| after_function
)
2975 struct deferred_constant
*p
;
2976 p
= (struct deferred_constant
*) xmalloc (sizeof (struct deferred_constant
));
2978 push_obstacks_nochange ();
2979 suspend_momentary ();
2980 p
->exp
= copy_constant (exp
);
2983 p
->labelno
= const_labelno
++;
2986 p
->next
= after_function_constants
;
2987 after_function_constants
= p
;
2991 p
->next
= deferred_constants
;
2992 deferred_constants
= p
;
2996 output_constant_def_contents (exp
, reloc
, const_labelno
++);
2999 return TREE_CST_RTL (exp
);
3002 /* Now output assembler code to define the label for EXP,
3003 and follow it with the data of EXP. */
3006 output_constant_def_contents (exp
, reloc
, labelno
)
3013 if (IN_NAMED_SECTION (exp
))
3014 named_section (exp
, NULL
, reloc
);
3017 /* First switch to text section, except for writable strings. */
3018 #ifdef SELECT_SECTION
3019 SELECT_SECTION (exp
, reloc
);
3021 if (((TREE_CODE (exp
) == STRING_CST
) && flag_writable_strings
)
3022 || (flag_pic
&& reloc
))
3025 readonly_data_section ();
3029 /* Align the location counter as required by EXP's data type. */
3030 align
= TYPE_ALIGN (TREE_TYPE (exp
));
3031 #ifdef CONSTANT_ALIGNMENT
3032 align
= CONSTANT_ALIGNMENT (exp
, align
);
3035 if (align
> BITS_PER_UNIT
)
3036 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
3038 /* Output the label itself. */
3039 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LC", labelno
);
3041 /* Output the value of EXP. */
3042 output_constant (exp
,
3043 (TREE_CODE (exp
) == STRING_CST
3044 ? TREE_STRING_LENGTH (exp
)
3045 : int_size_in_bytes (TREE_TYPE (exp
))));
3049 /* Similar hash facility for making memory-constants
3050 from constant rtl-expressions. It is used on RISC machines
3051 where immediate integer arguments and constant addresses are restricted
3052 so that such constants must be stored in memory.
3054 This pool of constants is reinitialized for each function
3055 so each function gets its own constants-pool that comes right before it.
3057 All structures allocated here are discarded when functions are saved for
3058 inlining, so they do not need to be allocated permanently. */
3060 #define MAX_RTX_HASH_TABLE 61
3061 static struct constant_descriptor
**const_rtx_hash_table
;
3063 /* Structure to represent sufficient information about a constant so that
3064 it can be output when the constant pool is output, so that function
3065 integration can be done, and to simplify handling on machines that reference
3066 constant pool as base+displacement. */
3068 struct pool_constant
3070 struct constant_descriptor
*desc
;
3071 struct pool_constant
*next
;
3072 enum machine_mode mode
;
3080 /* Pointers to first and last constant in pool. */
3082 static struct pool_constant
*first_pool
, *last_pool
;
3084 /* Current offset in constant pool (does not include any machine-specific
3087 static int pool_offset
;
3089 /* Structure used to maintain hash table mapping symbols used to their
3090 corresponding constants. */
3095 struct pool_constant
*pool
;
3096 struct pool_sym
*next
;
3099 static struct pool_sym
**const_rtx_sym_hash_table
;
3101 /* Hash code for a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true.
3102 The argument is XSTR (... , 0) */
3104 #define SYMHASH(LABEL) \
3105 ((((unsigned long) (LABEL)) & ((1 << HASHBITS) - 1)) % MAX_RTX_HASH_TABLE)
3107 /* Initialize constant pool hashing for next function. */
3110 init_const_rtx_hash_table ()
3112 const_rtx_hash_table
3113 = ((struct constant_descriptor
**)
3114 oballoc (MAX_RTX_HASH_TABLE
* sizeof (struct constant_descriptor
*)));
3115 const_rtx_sym_hash_table
3116 = ((struct pool_sym
**)
3117 oballoc (MAX_RTX_HASH_TABLE
* sizeof (struct pool_sym
*)));
3118 bzero ((char *) const_rtx_hash_table
,
3119 MAX_RTX_HASH_TABLE
* sizeof (struct constant_descriptor
*));
3120 bzero ((char *) const_rtx_sym_hash_table
,
3121 MAX_RTX_HASH_TABLE
* sizeof (struct pool_sym
*));
3123 first_pool
= last_pool
= 0;
3127 /* Save and restore status for a nested function. */
3130 save_varasm_status (p
, context
)
3134 p
->const_rtx_hash_table
= const_rtx_hash_table
;
3135 p
->const_rtx_sym_hash_table
= const_rtx_sym_hash_table
;
3136 p
->first_pool
= first_pool
;
3137 p
->last_pool
= last_pool
;
3138 p
->pool_offset
= pool_offset
;
3139 p
->const_double_chain
= const_double_chain
;
3141 /* If we are pushing to toplevel, we can't reuse const_double_chain. */
3142 if (context
== NULL_TREE
)
3143 const_double_chain
= 0;
3147 restore_varasm_status (p
)
3150 const_rtx_hash_table
= p
->const_rtx_hash_table
;
3151 const_rtx_sym_hash_table
= p
->const_rtx_sym_hash_table
;
3152 first_pool
= p
->first_pool
;
3153 last_pool
= p
->last_pool
;
3154 pool_offset
= p
->pool_offset
;
3155 const_double_chain
= p
->const_double_chain
;
3158 enum kind
{ RTX_DOUBLE
, RTX_INT
};
3162 #ifdef ONLY_INT_FIELDS
3163 unsigned int kind
: 16;
3164 unsigned int mode
: 16;
3166 enum kind kind
: 16;
3167 enum machine_mode mode
: 16;
3170 union real_extract du
;
3171 struct addr_const addr
;
3172 struct {HOST_WIDE_INT high
, low
;} di
;
3176 /* Express an rtx for a constant integer (perhaps symbolic)
3177 as the sum of a symbol or label plus an explicit integer.
3178 They are stored into VALUE. */
3181 decode_rtx_const (mode
, x
, value
)
3182 enum machine_mode mode
;
3184 struct rtx_const
*value
;
3186 /* Clear the whole structure, including any gaps. */
3189 int *p
= (int *) value
;
3190 int *end
= (int *) (value
+ 1);
3195 value
->kind
= RTX_INT
; /* Most usual kind. */
3198 switch (GET_CODE (x
))
3201 value
->kind
= RTX_DOUBLE
;
3202 if (GET_MODE (x
) != VOIDmode
)
3204 value
->mode
= GET_MODE (x
);
3205 bcopy ((char *) &CONST_DOUBLE_LOW (x
),
3206 (char *) &value
->un
.du
, sizeof value
->un
.du
);
3210 value
->un
.di
.low
= CONST_DOUBLE_LOW (x
);
3211 value
->un
.di
.high
= CONST_DOUBLE_HIGH (x
);
3216 value
->un
.addr
.offset
= INTVAL (x
);
3222 value
->un
.addr
.base
= x
;
3227 if (GET_CODE (x
) == PLUS
)
3229 value
->un
.addr
.base
= XEXP (x
, 0);
3230 if (GET_CODE (XEXP (x
, 1)) != CONST_INT
)
3232 value
->un
.addr
.offset
= INTVAL (XEXP (x
, 1));
3234 else if (GET_CODE (x
) == MINUS
)
3236 value
->un
.addr
.base
= XEXP (x
, 0);
3237 if (GET_CODE (XEXP (x
, 1)) != CONST_INT
)
3239 value
->un
.addr
.offset
= - INTVAL (XEXP (x
, 1));
3249 if (value
->kind
== RTX_INT
&& value
->un
.addr
.base
!= 0)
3250 switch (GET_CODE (value
->un
.addr
.base
))
3254 /* Use the string's address, not the SYMBOL_REF's address,
3255 for the sake of addresses of library routines.
3256 For a LABEL_REF, compare labels. */
3257 value
->un
.addr
.base
= XEXP (value
->un
.addr
.base
, 0);
3264 /* Given a MINUS expression, simplify it if both sides
3265 include the same symbol. */
3268 simplify_subtraction (x
)
3271 struct rtx_const val0
, val1
;
3273 decode_rtx_const (GET_MODE (x
), XEXP (x
, 0), &val0
);
3274 decode_rtx_const (GET_MODE (x
), XEXP (x
, 1), &val1
);
3276 if (val0
.un
.addr
.base
== val1
.un
.addr
.base
)
3277 return GEN_INT (val0
.un
.addr
.offset
- val1
.un
.addr
.offset
);
3281 /* Compute a hash code for a constant RTL expression. */
3284 const_hash_rtx (mode
, x
)
3285 enum machine_mode mode
;
3291 struct rtx_const value
;
3292 decode_rtx_const (mode
, x
, &value
);
3294 /* Compute hashing function */
3296 for (i
= 0; i
< sizeof value
/ sizeof (int); i
++)
3297 hi
+= ((int *) &value
)[i
];
3299 hi
&= (1 << HASHBITS
) - 1;
3300 hi
%= MAX_RTX_HASH_TABLE
;
3304 /* Compare a constant rtl object X with a constant-descriptor DESC.
3305 Return 1 if DESC describes a constant with the same value as X. */
3308 compare_constant_rtx (mode
, x
, desc
)
3309 enum machine_mode mode
;
3311 struct constant_descriptor
*desc
;
3313 register int *p
= (int *) desc
->contents
;
3316 struct rtx_const value
;
3318 decode_rtx_const (mode
, x
, &value
);
3319 strp
= (int *) &value
;
3320 len
= sizeof value
/ sizeof (int);
3322 /* Compare constant contents. */
3324 if (*p
++ != *strp
++)
3330 /* Construct a constant descriptor for the rtl-expression X.
3331 It is up to the caller to enter the descriptor in the hash table. */
3333 static struct constant_descriptor
*
3334 record_constant_rtx (mode
, x
)
3335 enum machine_mode mode
;
3338 struct constant_descriptor
*ptr
;
3340 struct rtx_const value
;
3342 decode_rtx_const (mode
, x
, &value
);
3344 /* Put these things in the saveable obstack so we can ensure it won't
3345 be freed if we are called from combine or some other phase that discards
3346 memory allocated from function_obstack (current_obstack). */
3347 obstack_grow (saveable_obstack
, &ptr
, sizeof ptr
);
3348 obstack_grow (saveable_obstack
, &label
, sizeof label
);
3350 /* Record constant contents. */
3351 obstack_grow (saveable_obstack
, &value
, sizeof value
);
3353 return (struct constant_descriptor
*) obstack_finish (saveable_obstack
);
3356 /* Given a constant rtx X, make (or find) a memory constant for its value
3357 and return a MEM rtx to refer to it in memory. */
3360 force_const_mem (mode
, x
)
3361 enum machine_mode mode
;
3365 register struct constant_descriptor
*desc
;
3370 /* If we want this CONST_DOUBLE in the same mode as it is in memory
3371 (this will always be true for floating CONST_DOUBLEs that have been
3372 placed in memory, but not for VOIDmode (integer) CONST_DOUBLEs),
3373 use the previous copy. Otherwise, make a new one. Note that in
3374 the unlikely event that this same CONST_DOUBLE is used in two different
3375 modes in an alternating fashion, we will allocate a lot of different
3376 memory locations, but this should be extremely rare. */
3378 /* Don't use CONST_DOUBLE_MEM in a nested function.
3379 Nested functions have their own constant pools,
3380 so they can't share the same values in CONST_DOUBLE_MEM
3381 with the containing function. */
3382 if (outer_function_chain
== 0)
3383 if (GET_CODE (x
) == CONST_DOUBLE
3384 && GET_CODE (CONST_DOUBLE_MEM (x
)) == MEM
3385 && GET_MODE (CONST_DOUBLE_MEM (x
)) == mode
)
3386 return CONST_DOUBLE_MEM (x
);
3388 /* Compute hash code of X. Search the descriptors for that hash code
3389 to see if any of them describes X. If yes, the descriptor records
3390 the label number already assigned. */
3392 hash
= const_hash_rtx (mode
, x
);
3394 for (desc
= const_rtx_hash_table
[hash
]; desc
; desc
= desc
->next
)
3395 if (compare_constant_rtx (mode
, x
, desc
))
3397 found
= desc
->label
;
3403 register struct pool_constant
*pool
;
3404 register struct pool_sym
*sym
;
3407 /* No constant equal to X is known to have been output.
3408 Make a constant descriptor to enter X in the hash table.
3409 Assign the label number and record it in the descriptor for
3410 future calls to this function to find. */
3412 desc
= record_constant_rtx (mode
, x
);
3413 desc
->next
= const_rtx_hash_table
[hash
];
3414 const_rtx_hash_table
[hash
] = desc
;
3416 /* Align the location counter as required by EXP's data type. */
3417 align
= (mode
== VOIDmode
) ? UNITS_PER_WORD
: GET_MODE_SIZE (mode
);
3418 if (align
> BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
3419 align
= BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
;
3420 #ifdef CONSTANT_ALIGNMENT
3421 align
= CONSTANT_ALIGNMENT (make_tree (type_for_mode (mode
, 0), x
),
3422 align
* BITS_PER_UNIT
) / BITS_PER_UNIT
;
3425 pool_offset
+= align
- 1;
3426 pool_offset
&= ~ (align
- 1);
3428 /* If RTL is not being placed into the saveable obstack, make a
3429 copy of X that is in the saveable obstack in case we are
3430 being called from combine or some other phase that discards
3431 memory it allocates. We used to only do this if it is a
3432 CONST; however, reload can allocate a CONST_INT when
3433 eliminating registers. */
3434 if (rtl_obstack
!= saveable_obstack
3435 && (GET_CODE (x
) == CONST
|| GET_CODE (x
) == CONST_INT
))
3437 push_obstacks_nochange ();
3438 rtl_in_saveable_obstack ();
3440 if (GET_CODE (x
) == CONST
)
3441 x
= gen_rtx_CONST (GET_MODE (x
),
3442 gen_rtx_PLUS (GET_MODE (x
),
3443 XEXP (XEXP (x
, 0), 0),
3444 XEXP (XEXP (x
, 0), 1)));
3446 x
= GEN_INT (INTVAL (x
));
3451 /* Allocate a pool constant descriptor, fill it in, and chain it in. */
3453 pool
= (struct pool_constant
*) savealloc (sizeof (struct pool_constant
));
3457 pool
->labelno
= const_labelno
;
3458 pool
->align
= align
;
3459 pool
->offset
= pool_offset
;
3466 last_pool
->next
= pool
;
3469 pool_offset
+= GET_MODE_SIZE (mode
);
3471 /* Create a string containing the label name, in LABEL. */
3472 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
3477 = (char *) obstack_copy0 (saveable_obstack
, label
, strlen (label
));
3479 /* Add label to symbol hash table. */
3480 hash
= SYMHASH (found
);
3481 sym
= (struct pool_sym
*) savealloc (sizeof (struct pool_sym
));
3484 sym
->next
= const_rtx_sym_hash_table
[hash
];
3485 const_rtx_sym_hash_table
[hash
] = sym
;
3488 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
3490 def
= gen_rtx_MEM (mode
, gen_rtx_SYMBOL_REF (Pmode
, found
));
3492 RTX_UNCHANGING_P (def
) = 1;
3493 /* Mark the symbol_ref as belonging to this constants pool. */
3494 CONSTANT_POOL_ADDRESS_P (XEXP (def
, 0)) = 1;
3495 current_function_uses_const_pool
= 1;
3497 if (outer_function_chain
== 0)
3498 if (GET_CODE (x
) == CONST_DOUBLE
)
3500 if (CONST_DOUBLE_MEM (x
) == cc0_rtx
)
3502 CONST_DOUBLE_CHAIN (x
) = const_double_chain
;
3503 const_double_chain
= x
;
3505 CONST_DOUBLE_MEM (x
) = def
;
3511 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
3512 the corresponding pool_constant structure. */
3514 static struct pool_constant
*
3515 find_pool_constant (addr
)
3518 struct pool_sym
*sym
;
3519 char *label
= XSTR (addr
, 0);
3521 for (sym
= const_rtx_sym_hash_table
[SYMHASH (label
)]; sym
; sym
= sym
->next
)
3522 if (sym
->label
== label
)
3528 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
3531 get_pool_constant (addr
)
3534 return (find_pool_constant (addr
))->constant
;
3537 /* Similar, return the mode. */
3540 get_pool_mode (addr
)
3543 return (find_pool_constant (addr
))->mode
;
3546 /* Similar, return the offset in the constant pool. */
3549 get_pool_offset (addr
)
3552 return (find_pool_constant (addr
))->offset
;
3555 /* Return the size of the constant pool. */
3563 /* Write all the constants in the constant pool. */
3566 output_constant_pool (fnname
, fndecl
)
3570 struct pool_constant
*pool
;
3572 union real_extract u
;
3574 /* It is possible for gcc to call force_const_mem and then to later
3575 discard the instructions which refer to the constant. In such a
3576 case we do not need to output the constant. */
3577 if (optimize
>= 0 && flag_expensive_optimizations
)
3578 mark_constant_pool ();
3580 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3581 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3584 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3591 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3592 whose CODE_LABEL has been deleted. This can occur if a jump table
3593 is eliminated by optimization. If so, write a constant of zero
3594 instead. Note that this can also happen by turning the
3595 CODE_LABEL into a NOTE. */
3596 if (((GET_CODE (x
) == LABEL_REF
3597 && (INSN_DELETED_P (XEXP (x
, 0))
3598 || GET_CODE (XEXP (x
, 0)) == NOTE
)))
3599 || (GET_CODE (x
) == CONST
&& GET_CODE (XEXP (x
, 0)) == PLUS
3600 && GET_CODE (XEXP (XEXP (x
, 0), 0)) == LABEL_REF
3601 && (INSN_DELETED_P (XEXP (XEXP (XEXP (x
, 0), 0), 0))
3602 || GET_CODE (XEXP (XEXP (XEXP (x
, 0), 0), 0)) == NOTE
)))
3605 /* First switch to correct section. */
3606 #ifdef SELECT_RTX_SECTION
3607 SELECT_RTX_SECTION (pool
->mode
, x
);
3609 readonly_data_section ();
3612 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3613 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file
, x
, pool
->mode
,
3614 pool
->align
, pool
->labelno
, done
);
3617 if (pool
->align
> 1)
3618 ASM_OUTPUT_ALIGN (asm_out_file
, exact_log2 (pool
->align
));
3620 /* Output the label. */
3621 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LC", pool
->labelno
);
3623 /* Output the value of the constant itself. */
3624 switch (GET_MODE_CLASS (pool
->mode
))
3627 if (GET_CODE (x
) != CONST_DOUBLE
)
3630 bcopy ((char *) &CONST_DOUBLE_LOW (x
), (char *) &u
, sizeof u
);
3631 assemble_real (u
.d
, pool
->mode
);
3635 case MODE_PARTIAL_INT
:
3636 assemble_integer (x
, GET_MODE_SIZE (pool
->mode
), 1);
3643 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3649 #ifdef ASM_OUTPUT_POOL_EPILOGUE
3650 ASM_OUTPUT_POOL_EPILOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3653 /* Done with this pool. */
3654 first_pool
= last_pool
= 0;
3657 /* Look through the instructions for this function, and mark all the
3658 entries in the constant pool which are actually being used. */
3661 mark_constant_pool ()
3664 struct pool_constant
*pool
;
3666 if (first_pool
== 0)
3669 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3672 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
3673 if (GET_RTX_CLASS (GET_CODE (insn
)) == 'i')
3674 mark_constants (PATTERN (insn
));
3676 for (insn
= current_function_epilogue_delay_list
;
3678 insn
= XEXP (insn
, 1))
3679 if (GET_RTX_CLASS (GET_CODE (insn
)) == 'i')
3680 mark_constants (PATTERN (insn
));
3688 register char *format_ptr
;
3693 if (GET_CODE (x
) == SYMBOL_REF
)
3695 if (CONSTANT_POOL_ADDRESS_P (x
))
3696 find_pool_constant (x
)->mark
= 1;
3699 /* Never search inside a CONST_DOUBLE, because CONST_DOUBLE_MEM may be
3700 a MEM, but does not constitute a use of that MEM. This is particularly
3701 important inside a nested function, because CONST_DOUBLE_MEM may be
3702 a reference to a MEM in the parent's constant pool. See the comment
3703 in force_const_mem. */
3704 else if (GET_CODE (x
) == CONST_DOUBLE
)
3707 /* Insns may appear inside a SEQUENCE. Only check the patterns of
3708 insns, not any notes that may be attached. We don't want to mark
3709 a constant just because it happens to appear in a REG_EQUIV note. */
3710 if (GET_RTX_CLASS (GET_CODE (x
)) == 'i')
3712 mark_constants (PATTERN (x
));
3716 format_ptr
= GET_RTX_FORMAT (GET_CODE (x
));
3718 for (i
= 0; i
< GET_RTX_LENGTH (GET_CODE (x
)); i
++)
3720 switch (*format_ptr
++)
3723 mark_constants (XEXP (x
, i
));
3727 if (XVEC (x
, i
) != 0)
3731 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
3732 mark_constants (XVECEXP (x
, i
, j
));
3751 /* Find all the constants whose addresses are referenced inside of EXP,
3752 and make sure assembler code with a label has been output for each one.
3753 Indicate whether an ADDR_EXPR has been encountered. */
3756 output_addressed_constants (exp
)
3761 switch (TREE_CODE (exp
))
3765 register tree constant
= TREE_OPERAND (exp
, 0);
3767 while (TREE_CODE (constant
) == COMPONENT_REF
)
3769 constant
= TREE_OPERAND (constant
, 0);
3772 if (TREE_CODE_CLASS (TREE_CODE (constant
)) == 'c'
3773 || TREE_CODE (constant
) == CONSTRUCTOR
)
3774 /* No need to do anything here
3775 for addresses of variables or functions. */
3776 output_constant_def (constant
);
3783 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
3784 reloc
|= output_addressed_constants (TREE_OPERAND (exp
, 1));
3789 case NON_LVALUE_EXPR
:
3790 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
3796 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
3797 if (TREE_VALUE (link
) != 0)
3798 reloc
|= output_addressed_constants (TREE_VALUE (link
));
3808 /* Output assembler code for constant EXP to FILE, with no label.
3809 This includes the pseudo-op such as ".int" or ".byte", and a newline.
3810 Assumes output_addressed_constants has been done on EXP already.
3812 Generate exactly SIZE bytes of assembler data, padding at the end
3813 with zeros if necessary. SIZE must always be specified.
3815 SIZE is important for structure constructors,
3816 since trailing members may have been omitted from the constructor.
3817 It is also important for initialization of arrays from string constants
3818 since the full length of the string constant might not be wanted.
3819 It is also needed for initialization of unions, where the initializer's
3820 type is just one member, and that may not be as long as the union.
3822 There a case in which we would fail to output exactly SIZE bytes:
3823 for a structure constructor that wants to produce more than SIZE bytes.
3824 But such constructors will never be generated for any possible input. */
3827 output_constant (exp
, size
)
3831 register enum tree_code code
= TREE_CODE (TREE_TYPE (exp
));
3836 /* Eliminate the NON_LVALUE_EXPR_EXPR that makes a cast not be an lvalue.
3837 That way we get the constant (we hope) inside it. Also, strip off any
3838 NOP_EXPR that converts between two record, union, array, or set types. */
3839 while ((TREE_CODE (exp
) == NOP_EXPR
3840 && (TREE_TYPE (exp
) == TREE_TYPE (TREE_OPERAND (exp
, 0))
3841 || AGGREGATE_TYPE_P (TREE_TYPE (exp
))))
3842 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
3843 exp
= TREE_OPERAND (exp
, 0);
3845 /* Allow a constructor with no elements for any data type.
3846 This means to fill the space with zeros. */
3847 if (TREE_CODE (exp
) == CONSTRUCTOR
&& CONSTRUCTOR_ELTS (exp
) == 0)
3849 assemble_zeros (size
);
3860 case REFERENCE_TYPE
:
3861 /* ??? What about (int)((float)(int)&foo + 4) */
3862 while (TREE_CODE (exp
) == NOP_EXPR
|| TREE_CODE (exp
) == CONVERT_EXPR
3863 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
3864 exp
= TREE_OPERAND (exp
, 0);
3866 if (! assemble_integer (expand_expr (exp
, NULL_RTX
, VOIDmode
,
3867 EXPAND_INITIALIZER
),
3869 error ("initializer for integer value is too complicated");
3874 if (TREE_CODE (exp
) != REAL_CST
)
3875 error ("initializer for floating value is not a floating constant");
3877 assemble_real (TREE_REAL_CST (exp
),
3878 mode_for_size (size
* BITS_PER_UNIT
, MODE_FLOAT
, 0));
3883 output_constant (TREE_REALPART (exp
), size
/ 2);
3884 output_constant (TREE_IMAGPART (exp
), size
/ 2);
3885 size
-= (size
/ 2) * 2;
3889 if (TREE_CODE (exp
) == CONSTRUCTOR
)
3891 output_constructor (exp
, size
);
3894 else if (TREE_CODE (exp
) == STRING_CST
)
3898 if (size
> TREE_STRING_LENGTH (exp
))
3900 excess
= size
- TREE_STRING_LENGTH (exp
);
3901 size
= TREE_STRING_LENGTH (exp
);
3904 assemble_string (TREE_STRING_POINTER (exp
), size
);
3913 if (TREE_CODE (exp
) == CONSTRUCTOR
)
3914 output_constructor (exp
, size
);
3920 if (TREE_CODE (exp
) == INTEGER_CST
)
3921 assemble_integer (expand_expr (exp
, NULL_RTX
,
3922 VOIDmode
, EXPAND_INITIALIZER
),
3924 else if (TREE_CODE (exp
) == CONSTRUCTOR
)
3926 unsigned char *buffer
= (unsigned char *) alloca (size
);
3927 if (get_set_constructor_bytes (exp
, buffer
, size
))
3929 assemble_string ((char *) buffer
, size
);
3932 error ("unknown set constructor type");
3940 assemble_zeros (size
);
3944 /* Subroutine of output_constant, used for CONSTRUCTORs
3945 (aggregate constants).
3946 Generate at least SIZE bytes, padding if necessary. */
3949 output_constructor (exp
, size
)
3953 register tree link
, field
= 0;
3954 HOST_WIDE_INT min_index
= 0;
3955 /* Number of bytes output or skipped so far.
3956 In other words, current position within the constructor. */
3957 int total_bytes
= 0;
3958 /* Non-zero means BYTE contains part of a byte, to be output. */
3959 int byte_buffer_in_use
= 0;
3962 if (HOST_BITS_PER_WIDE_INT
< BITS_PER_UNIT
)
3965 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
3966 field
= TYPE_FIELDS (TREE_TYPE (exp
));
3968 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
3969 && TYPE_DOMAIN (TREE_TYPE (exp
)) != 0)
3971 = TREE_INT_CST_LOW (TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (exp
))));
3973 /* As LINK goes through the elements of the constant,
3974 FIELD goes through the structure fields, if the constant is a structure.
3975 if the constant is a union, then we override this,
3976 by getting the field from the TREE_LIST element.
3977 But the constant could also be an array. Then FIELD is zero. */
3978 for (link
= CONSTRUCTOR_ELTS (exp
);
3980 link
= TREE_CHAIN (link
),
3981 field
= field
? TREE_CHAIN (field
) : 0)
3983 tree val
= TREE_VALUE (link
);
3986 /* the element in a union constructor specifies the proper field. */
3988 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
3989 || TREE_CODE (TREE_TYPE (exp
)) == UNION_TYPE
)
3991 /* if available, use the type given by link */
3992 if (TREE_PURPOSE (link
) != 0)
3993 field
= TREE_PURPOSE (link
);
3996 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
3997 index
= TREE_PURPOSE (link
);
3999 /* Eliminate the marker that makes a cast not be an lvalue. */
4003 if (index
&& TREE_CODE (index
) == RANGE_EXPR
)
4005 register int fieldsize
4006 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (exp
)));
4007 HOST_WIDE_INT lo_index
= TREE_INT_CST_LOW (TREE_OPERAND (index
, 0));
4008 HOST_WIDE_INT hi_index
= TREE_INT_CST_LOW (TREE_OPERAND (index
, 1));
4009 HOST_WIDE_INT index
;
4010 for (index
= lo_index
; index
<= hi_index
; index
++)
4012 /* Output the element's initial value. */
4014 assemble_zeros (fieldsize
);
4016 output_constant (val
, fieldsize
);
4018 /* Count its size. */
4019 total_bytes
+= fieldsize
;
4022 else if (field
== 0 || !DECL_BIT_FIELD (field
))
4024 /* An element that is not a bit-field. */
4026 register int fieldsize
;
4027 /* Since this structure is static,
4028 we know the positions are constant. */
4029 int bitpos
= (field
? (TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field
))
4033 bitpos
= (TREE_INT_CST_LOW (TYPE_SIZE (TREE_TYPE (val
)))
4035 * (TREE_INT_CST_LOW (index
) - min_index
));
4037 /* Output any buffered-up bit-fields preceding this element. */
4038 if (byte_buffer_in_use
)
4040 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4042 byte_buffer_in_use
= 0;
4045 /* Advance to offset of this element.
4046 Note no alignment needed in an array, since that is guaranteed
4047 if each element has the proper size. */
4048 if ((field
!= 0 || index
!= 0) && bitpos
!= total_bytes
)
4050 assemble_zeros (bitpos
- total_bytes
);
4051 total_bytes
= bitpos
;
4054 /* Determine size this element should occupy. */
4057 if (TREE_CODE (DECL_SIZE (field
)) != INTEGER_CST
)
4059 if (TREE_INT_CST_LOW (DECL_SIZE (field
)) > 100000)
4061 /* This avoids overflow trouble. */
4062 tree size_tree
= size_binop (CEIL_DIV_EXPR
,
4064 size_int (BITS_PER_UNIT
));
4065 fieldsize
= TREE_INT_CST_LOW (size_tree
);
4069 fieldsize
= TREE_INT_CST_LOW (DECL_SIZE (field
));
4070 fieldsize
= (fieldsize
+ BITS_PER_UNIT
- 1) / BITS_PER_UNIT
;
4074 fieldsize
= int_size_in_bytes (TREE_TYPE (TREE_TYPE (exp
)));
4076 /* Output the element's initial value. */
4078 assemble_zeros (fieldsize
);
4080 output_constant (val
, fieldsize
);
4082 /* Count its size. */
4083 total_bytes
+= fieldsize
;
4085 else if (val
!= 0 && TREE_CODE (val
) != INTEGER_CST
)
4086 error ("invalid initial value for member `%s'",
4087 IDENTIFIER_POINTER (DECL_NAME (field
)));
4090 /* Element that is a bit-field. */
4092 int next_offset
= TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field
));
4094 = (next_offset
+ TREE_INT_CST_LOW (DECL_SIZE (field
)));
4097 val
= integer_zero_node
;
4099 /* If this field does not start in this (or, next) byte,
4101 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4103 /* Output remnant of any bit field in previous bytes. */
4104 if (byte_buffer_in_use
)
4106 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4108 byte_buffer_in_use
= 0;
4111 /* If still not at proper byte, advance to there. */
4112 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4114 assemble_zeros (next_offset
/ BITS_PER_UNIT
- total_bytes
);
4115 total_bytes
= next_offset
/ BITS_PER_UNIT
;
4119 if (! byte_buffer_in_use
)
4122 /* We must split the element into pieces that fall within
4123 separate bytes, and combine each byte with previous or
4124 following bit-fields. */
4126 /* next_offset is the offset n fbits from the beginning of
4127 the structure to the next bit of this element to be processed.
4128 end_offset is the offset of the first bit past the end of
4130 while (next_offset
< end_offset
)
4134 HOST_WIDE_INT value
;
4135 int next_byte
= next_offset
/ BITS_PER_UNIT
;
4136 int next_bit
= next_offset
% BITS_PER_UNIT
;
4138 /* Advance from byte to byte
4139 within this element when necessary. */
4140 while (next_byte
!= total_bytes
)
4142 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4147 /* Number of bits we can process at once
4148 (all part of the same byte). */
4149 this_time
= MIN (end_offset
- next_offset
,
4150 BITS_PER_UNIT
- next_bit
);
4151 if (BYTES_BIG_ENDIAN
)
4153 /* On big-endian machine, take the most significant bits
4154 first (of the bits that are significant)
4155 and put them into bytes from the most significant end. */
4156 shift
= end_offset
- next_offset
- this_time
;
4157 /* Don't try to take a bunch of bits that cross
4158 the word boundary in the INTEGER_CST. */
4159 if (shift
< HOST_BITS_PER_WIDE_INT
4160 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4162 this_time
-= (HOST_BITS_PER_WIDE_INT
- shift
);
4163 shift
= HOST_BITS_PER_WIDE_INT
;
4166 /* Now get the bits from the appropriate constant word. */
4167 if (shift
< HOST_BITS_PER_WIDE_INT
)
4169 value
= TREE_INT_CST_LOW (val
);
4171 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4173 value
= TREE_INT_CST_HIGH (val
);
4174 shift
-= HOST_BITS_PER_WIDE_INT
;
4178 byte
|= (((value
>> shift
)
4179 & (((HOST_WIDE_INT
) 1 << this_time
) - 1))
4180 << (BITS_PER_UNIT
- this_time
- next_bit
));
4184 /* On little-endian machines,
4185 take first the least significant bits of the value
4186 and pack them starting at the least significant
4187 bits of the bytes. */
4188 shift
= (next_offset
4189 - TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field
)));
4190 /* Don't try to take a bunch of bits that cross
4191 the word boundary in the INTEGER_CST. */
4192 if (shift
< HOST_BITS_PER_WIDE_INT
4193 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4195 this_time
-= (HOST_BITS_PER_WIDE_INT
- shift
);
4196 shift
= HOST_BITS_PER_WIDE_INT
;
4199 /* Now get the bits from the appropriate constant word. */
4200 if (shift
< HOST_BITS_PER_WIDE_INT
)
4201 value
= TREE_INT_CST_LOW (val
);
4202 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4204 value
= TREE_INT_CST_HIGH (val
);
4205 shift
-= HOST_BITS_PER_WIDE_INT
;
4209 byte
|= (((value
>> shift
)
4210 & (((HOST_WIDE_INT
) 1 << this_time
) - 1))
4213 next_offset
+= this_time
;
4214 byte_buffer_in_use
= 1;
4218 if (byte_buffer_in_use
)
4220 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4223 if (total_bytes
< size
)
4224 assemble_zeros (size
- total_bytes
);
4227 /* Output asm to handle ``#pragma weak'' */
4230 handle_pragma_weak (what
, name
, value
)
4231 enum pragma_state what
;
4234 #ifdef HANDLE_PRAGMA_WEAK
4235 if (what
== ps_name
|| what
== ps_value
)
4237 struct weak_syms
*weak
=
4238 (struct weak_syms
*)permalloc (sizeof (struct weak_syms
));
4239 weak
->next
= weak_decls
;
4240 weak
->name
= permalloc (strlen (name
) + 1);
4241 strcpy (weak
->name
, name
);
4243 if (what
!= ps_value
)
4244 weak
->value
= NULL_PTR
;
4248 weak
->value
= permalloc (strlen (value
) + 1);
4249 strcpy (weak
->value
, value
);
4254 else if (! (what
== ps_done
|| what
== ps_start
))
4255 warning ("malformed `#pragma weak'");
4256 #endif /* HANDLE_PRAGMA_WEAK */
4259 /* Declare DECL to be a weak symbol. */
4265 if (! TREE_PUBLIC (decl
))
4266 error_with_decl (decl
, "weak declaration of `%s' must be public");
4267 else if (TREE_ASM_WRITTEN (decl
))
4268 error_with_decl (decl
, "weak declaration of `%s' must precede definition");
4269 else if (SUPPORTS_WEAK
)
4270 DECL_WEAK (decl
) = 1;
4273 /* Emit any pending weak declarations. */
4278 #ifdef HANDLE_PRAGMA_WEAK
4279 if (HANDLE_PRAGMA_WEAK
)
4281 struct weak_syms
*t
;
4282 for (t
= weak_decls
; t
; t
= t
->next
)
4284 ASM_WEAKEN_LABEL (asm_out_file
, t
->name
);
4286 ASM_OUTPUT_DEF (asm_out_file
, t
->name
, t
->value
);
4293 assemble_alias (decl
, target
)
4298 make_decl_rtl (decl
, (char *) 0, 1);
4299 name
= XSTR (XEXP (DECL_RTL (decl
), 0), 0);
4301 #ifdef ASM_OUTPUT_DEF
4302 /* Make name accessible from other files, if appropriate. */
4304 if (TREE_PUBLIC (decl
))
4306 #ifdef ASM_WEAKEN_LABEL
4307 if (DECL_WEAK (decl
))
4308 ASM_WEAKEN_LABEL (asm_out_file
, name
);
4311 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
4314 ASM_OUTPUT_DEF (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4315 TREE_ASM_WRITTEN (decl
) = 1;
4317 #ifdef ASM_OUTPUT_WEAK_ALIAS
4318 if (! DECL_WEAK (decl
))
4319 warning ("only weak aliases are supported in this configuration");
4321 ASM_OUTPUT_WEAK_ALIAS (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4322 TREE_ASM_WRITTEN (decl
) = 1;
4324 warning ("alias definitions not supported in this configuration; ignored");
4329 /* This determines whether or not we support link-once semantics. */
4330 #ifndef SUPPORTS_ONE_ONLY
4331 #ifdef MAKE_DECL_ONE_ONLY
4332 #define SUPPORTS_ONE_ONLY 1
4334 #define SUPPORTS_ONE_ONLY 0
4338 /* Returns 1 if the target configuration supports defining public symbols
4339 so that one of them will be chosen at link time instead of generating a
4340 multiply-defined symbol error, whether through the use of weak symbols or
4341 a target-specific mechanism for having duplicates discarded. */
4344 supports_one_only ()
4346 if (SUPPORTS_ONE_ONLY
)
4348 return SUPPORTS_WEAK
;
4351 /* Set up DECL as a public symbol that can be defined in multiple
4352 translation units without generating a linker error. */
4355 make_decl_one_only (decl
)
4358 if (TREE_CODE (decl
) != VAR_DECL
&& TREE_CODE (decl
) != FUNCTION_DECL
)
4361 TREE_PUBLIC (decl
) = 1;
4363 if (TREE_CODE (decl
) == VAR_DECL
4364 && (DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
))
4365 DECL_COMMON (decl
) = 1;
4366 else if (SUPPORTS_ONE_ONLY
)
4368 #ifdef MAKE_DECL_ONE_ONLY
4369 MAKE_DECL_ONE_ONLY (decl
);
4371 DECL_ONE_ONLY (decl
) = 1;
4373 else if (SUPPORTS_WEAK
)
4374 DECL_WEAK (decl
) = 1;