1 /* Output variables, constants and external declarations, for GNU compiler.
2 Copyright (C) 1987, 88, 89, 92-98, 1999 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"
51 #ifdef XCOFF_DEBUGGING_INFO
55 #ifndef TRAMPOLINE_ALIGNMENT
56 #define TRAMPOLINE_ALIGNMENT FUNCTION_BOUNDARY
60 #define ASM_STABS_OP ".stabs"
63 /* Define the prefix to use when check_memory_usage_flag is enable. */
64 #ifdef NO_DOLLAR_IN_LABEL
65 #ifdef NO_DOT_IN_LABEL
66 #define CHKR_PREFIX "chkr_prefix_"
67 #else /* !NO_DOT_IN_LABEL */
68 #define CHKR_PREFIX "chkr."
70 #else /* !NO_DOLLAR_IN_LABEL */
71 #define CHKR_PREFIX "chkr$"
73 #define CHKR_PREFIX_SIZE (sizeof (CHKR_PREFIX) - 1)
75 /* This macro gets just the user-specified name
76 out of the string in a SYMBOL_REF. On most machines,
77 we discard the * if any and that's all. */
78 #ifndef STRIP_NAME_ENCODING
79 #define STRIP_NAME_ENCODING(VAR,SYMBOL_NAME) \
80 (VAR) = ((SYMBOL_NAME) + ((SYMBOL_NAME)[0] == '*'))
83 /* File in which assembler code is being written. */
85 extern FILE *asm_out_file
;
87 /* The (assembler) name of the first globally-visible object output. */
88 char *first_global_object_name
;
89 char *weak_global_object_name
;
91 extern struct obstack
*current_obstack
;
92 extern struct obstack
*saveable_obstack
;
93 extern struct obstack
*rtl_obstack
;
94 extern struct obstack permanent_obstack
;
95 #define obstack_chunk_alloc xmalloc
97 /* Number for making the label on the next
98 constant that is stored in memory. */
102 /* Number for making the label on the next
103 static variable internal to a function. */
107 /* Carry information from ASM_DECLARE_OBJECT_NAME
108 to ASM_FINISH_DECLARE_OBJECT. */
110 int size_directive_output
;
112 /* The last decl for which assemble_variable was called,
113 if it did ASM_DECLARE_OBJECT_NAME.
114 If the last call to assemble_variable didn't do that,
117 tree last_assemble_variable_decl
;
119 /* Nonzero if at least one function definition has been seen. */
121 static int function_defined
;
124 struct constant_descriptor
;
126 struct pool_constant
;
128 static const char *strip_reg_name
PROTO((const char *));
129 static int contains_pointers_p
PROTO((tree
));
130 static void decode_addr_const
PROTO((tree
, struct addr_const
*));
131 static int const_hash
PROTO((tree
));
132 static int compare_constant
PROTO((tree
,
133 struct constant_descriptor
*));
134 static char *compare_constant_1
PROTO((tree
, char *));
135 static struct constant_descriptor
*record_constant
PROTO((tree
));
136 static void record_constant_1
PROTO((tree
));
137 static tree copy_constant
PROTO((tree
));
138 static void output_constant_def_contents
PROTO((tree
, int, int));
139 static void decode_rtx_const
PROTO((enum machine_mode
, rtx
,
140 struct rtx_const
*));
141 static int const_hash_rtx
PROTO((enum machine_mode
, rtx
));
142 static int compare_constant_rtx
PROTO((enum machine_mode
, rtx
,
143 struct constant_descriptor
*));
144 static struct constant_descriptor
*record_constant_rtx
PROTO((enum machine_mode
,
146 static struct pool_constant
*find_pool_constant
PROTO((rtx
));
147 static void mark_constant_pool
PROTO((void));
148 static void mark_constants
PROTO((rtx
));
149 static int output_addressed_constants
PROTO((tree
));
150 static void output_after_function_constants
PROTO((void));
151 static void output_constructor
PROTO((tree
, int));
152 #ifdef ASM_OUTPUT_BSS
153 static void asm_output_bss
PROTO((FILE *, tree
, char *, int, int));
155 #ifdef BSS_SECTION_ASM_OP
156 #ifdef ASM_OUTPUT_ALIGNED_BSS
157 static void asm_output_aligned_bss
PROTO((FILE *, tree
, char *, int, int));
159 #endif /* BSS_SECTION_ASM_OP */
161 static enum in_section
{ no_section
, in_text
, in_data
, in_named
162 #ifdef BSS_SECTION_ASM_OP
165 #ifdef EH_FRAME_SECTION_ASM_OP
168 #ifdef EXTRA_SECTIONS
171 } in_section
= no_section
;
173 /* Return a non-zero value if DECL has a section attribute. */
174 #define IN_NAMED_SECTION(DECL) \
175 ((TREE_CODE (DECL) == FUNCTION_DECL || TREE_CODE (DECL) == VAR_DECL) \
176 && DECL_SECTION_NAME (DECL) != NULL_TREE)
178 /* Text of section name when in_section == in_named. */
179 static char *in_named_name
;
181 /* Define functions like text_section for any extra sections. */
182 #ifdef EXTRA_SECTION_FUNCTIONS
183 EXTRA_SECTION_FUNCTIONS
186 /* Tell assembler to switch to text section. */
191 if (in_section
!= in_text
)
193 fprintf (asm_out_file
, "%s\n", TEXT_SECTION_ASM_OP
);
194 in_section
= in_text
;
198 /* Tell assembler to switch to data section. */
203 if (in_section
!= in_data
)
205 if (flag_shared_data
)
207 #ifdef SHARED_SECTION_ASM_OP
208 fprintf (asm_out_file
, "%s\n", SHARED_SECTION_ASM_OP
);
210 fprintf (asm_out_file
, "%s\n", DATA_SECTION_ASM_OP
);
214 fprintf (asm_out_file
, "%s\n", DATA_SECTION_ASM_OP
);
216 in_section
= in_data
;
219 /* Tell assembler to ALWAYS switch to data section, in case
220 it's not sure where it it. */
223 force_data_section ()
225 in_section
= no_section
;
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 { const char *name
; int number
; } table
[]
605 = ADDITIONAL_REGISTER_NAMES
;
607 for (i
= 0; i
< (int)(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)
660 /* First detect errors in declaring global registers. */
661 if (TREE_CODE (decl
) != FUNCTION_DECL
662 && DECL_REGISTER (decl
) && reg_number
== -1)
663 error_with_decl (decl
,
664 "register name not specified for `%s'");
665 else if (TREE_CODE (decl
) != FUNCTION_DECL
666 && DECL_REGISTER (decl
) && reg_number
< 0)
667 error_with_decl (decl
,
668 "invalid register name for `%s'");
669 else if ((reg_number
>= 0 || reg_number
== -3)
670 && (TREE_CODE (decl
) == FUNCTION_DECL
671 && ! DECL_REGISTER (decl
)))
672 error_with_decl (decl
,
673 "register name given for non-register variable `%s'");
674 else if (TREE_CODE (decl
) != FUNCTION_DECL
675 && DECL_REGISTER (decl
)
676 && TYPE_MODE (TREE_TYPE (decl
)) == BLKmode
)
677 error_with_decl (decl
,
678 "data type of `%s' isn't suitable for a register");
679 else if (TREE_CODE (decl
) != FUNCTION_DECL
&& DECL_REGISTER (decl
)
680 && ! HARD_REGNO_MODE_OK (reg_number
,
681 TYPE_MODE (TREE_TYPE (decl
))))
682 error_with_decl (decl
,
683 "register number for `%s' isn't suitable for data type");
684 /* Now handle properly declared static register variables. */
685 else if (TREE_CODE (decl
) != FUNCTION_DECL
&& DECL_REGISTER (decl
))
689 if (DECL_INITIAL (decl
) != 0 && top_level
)
691 DECL_INITIAL (decl
) = 0;
692 error ("global register variable has initial value");
694 if (fixed_regs
[reg_number
] == 0
695 && function_defined
&& top_level
)
696 error ("global register variable follows a function definition");
697 if (TREE_THIS_VOLATILE (decl
))
698 warning ("volatile register variables don't work as you might wish");
700 /* If the user specified one of the eliminables registers here,
701 e.g., FRAME_POINTER_REGNUM, we don't want to get this variable
702 confused with that register and be eliminated. Although this
703 usage is somewhat suspect, we nevertheless use the following
704 kludge to avoid setting DECL_RTL to frame_pointer_rtx. */
707 = gen_rtx_REG (DECL_MODE (decl
), FIRST_PSEUDO_REGISTER
);
708 REGNO (DECL_RTL (decl
)) = reg_number
;
709 REG_USERVAR_P (DECL_RTL (decl
)) = 1;
713 /* Make this register global, so not usable for anything
715 nregs
= HARD_REGNO_NREGS (reg_number
, DECL_MODE (decl
));
717 globalize_reg (reg_number
+ --nregs
);
720 /* Specifying a section attribute on a variable forces it into a
721 non-.bss section, and thus it cannot be common. */
722 else if (TREE_CODE (decl
) == VAR_DECL
723 && DECL_SECTION_NAME (decl
) != NULL_TREE
724 && DECL_INITIAL (decl
) == NULL_TREE
725 && DECL_COMMON (decl
))
726 DECL_COMMON (decl
) = 0;
728 /* Now handle ordinary static variables and functions (in memory).
729 Also handle vars declared register invalidly. */
730 if (DECL_RTL (decl
) == 0)
732 /* Can't use just the variable's own name for a variable
733 whose scope is less than the whole file.
734 Concatenate a distinguishing number. */
735 if (!top_level
&& !TREE_PUBLIC (decl
) && asmspec
== 0)
739 ASM_FORMAT_PRIVATE_NAME (label
, name
, var_labelno
);
740 name
= obstack_copy0 (saveable_obstack
, label
, strlen (label
));
747 /* When -fprefix-function-name is used, the functions
748 names are prefixed. Only nested function names are not
750 if (flag_prefix_function_name
&& TREE_CODE (decl
) == FUNCTION_DECL
)
753 new_name
= (char *) alloca (strlen (name
) + CHKR_PREFIX_SIZE
755 strcpy (new_name
, CHKR_PREFIX
);
756 strcpy (new_name
+ CHKR_PREFIX_SIZE
, name
);
757 name
= obstack_copy0 (saveable_obstack
,
758 new_name
, strlen (new_name
));
761 DECL_RTL (decl
) = gen_rtx_MEM (DECL_MODE (decl
),
762 gen_rtx_SYMBOL_REF (Pmode
, name
));
763 MEM_ALIAS_SET (DECL_RTL (decl
)) = get_alias_set (decl
);
765 /* If this variable is to be treated as volatile, show its
766 tree node has side effects. If it has side effects, either
767 because of this test or from TREE_THIS_VOLATILE also
768 being set, show the MEM is volatile. */
769 if (flag_volatile_global
&& TREE_CODE (decl
) == VAR_DECL
770 && TREE_PUBLIC (decl
))
771 TREE_SIDE_EFFECTS (decl
) = 1;
772 else if (flag_volatile_static
&& TREE_CODE (decl
) == VAR_DECL
773 && (TREE_PUBLIC (decl
) || TREE_STATIC (decl
)))
774 TREE_SIDE_EFFECTS (decl
) = 1;
776 if (TREE_SIDE_EFFECTS (decl
))
777 MEM_VOLATILE_P (DECL_RTL (decl
)) = 1;
779 if (TREE_READONLY (decl
))
780 RTX_UNCHANGING_P (DECL_RTL (decl
)) = 1;
781 MEM_SET_IN_STRUCT_P (DECL_RTL (decl
),
782 AGGREGATE_TYPE_P (TREE_TYPE (decl
)));
784 /* Optionally set flags or add text to the name to record information
785 such as that it is a function name.
786 If the name is changed, the macro ASM_OUTPUT_LABELREF
787 will have to know how to strip this information. */
788 #ifdef ENCODE_SECTION_INFO
789 ENCODE_SECTION_INFO (decl
);
795 /* If the old RTL had the wrong mode, fix the mode. */
796 if (GET_MODE (DECL_RTL (decl
)) != DECL_MODE (decl
))
798 rtx rtl
= DECL_RTL (decl
);
799 PUT_MODE (rtl
, DECL_MODE (decl
));
802 /* ??? Another way to do this would be to do what halfpic.c does
803 and maintain a hashed table of such critters. */
804 /* ??? Another way to do this would be to pass a flag bit to
805 ENCODE_SECTION_INFO saying whether this is a new decl or not. */
806 /* Let the target reassign the RTL if it wants.
807 This is necessary, for example, when one machine specific
808 decl attribute overrides another. */
809 #ifdef REDO_SECTION_INFO_P
810 if (REDO_SECTION_INFO_P (decl
))
811 ENCODE_SECTION_INFO (decl
);
816 /* Make the rtl for variable VAR be volatile.
817 Use this only for static variables. */
820 make_var_volatile (var
)
823 if (GET_CODE (DECL_RTL (var
)) != MEM
)
826 MEM_VOLATILE_P (DECL_RTL (var
)) = 1;
829 /* Output alignment directive to align for constant expression EXP. */
832 assemble_constant_align (exp
)
837 /* Align the location counter as required by EXP's data type. */
838 align
= TYPE_ALIGN (TREE_TYPE (exp
));
839 #ifdef CONSTANT_ALIGNMENT
840 align
= CONSTANT_ALIGNMENT (exp
, align
);
843 if (align
> BITS_PER_UNIT
)
844 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
847 /* Output a string of literal assembler code
848 for an `asm' keyword used between functions. */
851 assemble_asm (string
)
856 if (TREE_CODE (string
) == ADDR_EXPR
)
857 string
= TREE_OPERAND (string
, 0);
859 fprintf (asm_out_file
, "\t%s\n", TREE_STRING_POINTER (string
));
862 #if 0 /* This should no longer be needed, because
863 flag_gnu_linker should be 0 on these systems,
864 which should prevent any output
865 if ASM_OUTPUT_CONSTRUCTOR and ASM_OUTPUT_DESTRUCTOR are absent. */
866 #if !(defined(DBX_DEBUGGING_INFO) && !defined(FASCIST_ASSEMBLER))
867 #ifndef ASM_OUTPUT_CONSTRUCTOR
868 #define ASM_OUTPUT_CONSTRUCTOR(file, name)
870 #ifndef ASM_OUTPUT_DESTRUCTOR
871 #define ASM_OUTPUT_DESTRUCTOR(file, name)
876 /* Record an element in the table of global destructors.
877 How this is done depends on what sort of assembler and linker
880 NAME should be the name of a global function to be called
881 at exit time. This name is output using assemble_name. */
884 assemble_destructor (name
)
887 #ifdef ASM_OUTPUT_DESTRUCTOR
888 ASM_OUTPUT_DESTRUCTOR (asm_out_file
, name
);
892 /* Now tell GNU LD that this is part of the static destructor set. */
893 /* This code works for any machine provided you use GNU as/ld. */
894 fprintf (asm_out_file
, "%s \"___DTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
895 assemble_name (asm_out_file
, name
);
896 fputc ('\n', asm_out_file
);
901 /* Likewise for global constructors. */
904 assemble_constructor (name
)
907 #ifdef ASM_OUTPUT_CONSTRUCTOR
908 ASM_OUTPUT_CONSTRUCTOR (asm_out_file
, name
);
912 /* Now tell GNU LD that this is part of the static constructor set. */
913 /* This code works for any machine provided you use GNU as/ld. */
914 fprintf (asm_out_file
, "%s \"___CTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
915 assemble_name (asm_out_file
, name
);
916 fputc ('\n', asm_out_file
);
921 /* Likewise for entries we want to record for garbage collection.
922 Garbage collection is still under development. */
925 assemble_gc_entry (name
)
928 #ifdef ASM_OUTPUT_GC_ENTRY
929 ASM_OUTPUT_GC_ENTRY (asm_out_file
, name
);
933 /* Now tell GNU LD that this is part of the static constructor set. */
934 fprintf (asm_out_file
, "%s \"___PTR_LIST__\",22,0,0,", ASM_STABS_OP
);
935 assemble_name (asm_out_file
, name
);
936 fputc ('\n', asm_out_file
);
941 /* CONSTANT_POOL_BEFORE_FUNCTION may be defined as an expression with
942 a non-zero value if the constant pool should be output before the
943 start of the function, or a zero value if the pool should output
944 after the end of the function. The default is to put it before the
947 #ifndef CONSTANT_POOL_BEFORE_FUNCTION
948 #define CONSTANT_POOL_BEFORE_FUNCTION 1
951 /* Output assembler code for the constant pool of a function and associated
952 with defining the name of the function. DECL describes the function.
953 NAME is the function's name. For the constant pool, we use the current
954 constant pool data. */
957 assemble_start_function (decl
, fnname
)
963 /* The following code does not need preprocessing in the assembler. */
967 if (CONSTANT_POOL_BEFORE_FUNCTION
)
968 output_constant_pool (fnname
, decl
);
970 #ifdef ASM_OUTPUT_SECTION_NAME
971 /* If the function is to be put in its own section and it's not in a section
972 already, indicate so. */
973 if ((flag_function_sections
974 && DECL_SECTION_NAME (decl
) == NULL_TREE
)
975 || UNIQUE_SECTION_P (decl
))
976 UNIQUE_SECTION (decl
, 0);
979 function_section (decl
);
981 /* Tell assembler to move to target machine's alignment for functions. */
982 align
= floor_log2 (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
984 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
986 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
987 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file
, fnname
);
990 #ifdef SDB_DEBUGGING_INFO
991 /* Output SDB definition of the function. */
992 if (write_symbols
== SDB_DEBUG
)
993 sdbout_mark_begin_function ();
996 #ifdef DBX_DEBUGGING_INFO
997 /* Output DBX definition of the function. */
998 if (write_symbols
== DBX_DEBUG
)
999 dbxout_begin_function (decl
);
1002 /* Make function name accessible from other files, if appropriate. */
1004 if (TREE_PUBLIC (decl
))
1006 if (! first_global_object_name
)
1011 if (! DECL_WEAK (decl
) && ! DECL_ONE_ONLY (decl
))
1012 name
= &first_global_object_name
;
1014 name
= &weak_global_object_name
;
1016 STRIP_NAME_ENCODING (p
, fnname
);
1017 *name
= permalloc (strlen (p
) + 1);
1021 #ifdef ASM_WEAKEN_LABEL
1022 if (DECL_WEAK (decl
))
1023 ASM_WEAKEN_LABEL (asm_out_file
, fnname
);
1026 ASM_GLOBALIZE_LABEL (asm_out_file
, fnname
);
1029 /* Do any machine/system dependent processing of the function name */
1030 #ifdef ASM_DECLARE_FUNCTION_NAME
1031 ASM_DECLARE_FUNCTION_NAME (asm_out_file
, fnname
, current_function_decl
);
1033 /* Standard thing is just output label for the function. */
1034 ASM_OUTPUT_LABEL (asm_out_file
, fnname
);
1035 #endif /* ASM_DECLARE_FUNCTION_NAME */
1038 /* Output assembler code associated with defining the size of the
1039 function. DECL describes the function. NAME is the function's name. */
1042 assemble_end_function (decl
, fnname
)
1046 #ifdef ASM_DECLARE_FUNCTION_SIZE
1047 ASM_DECLARE_FUNCTION_SIZE (asm_out_file
, fnname
, decl
);
1049 if (! CONSTANT_POOL_BEFORE_FUNCTION
)
1051 output_constant_pool (fnname
, decl
);
1052 function_section (decl
); /* need to switch back */
1055 /* Output any constants which should appear after the function. */
1056 output_after_function_constants ();
1059 /* Assemble code to leave SIZE bytes of zeros. */
1062 assemble_zeros (size
)
1065 /* Do no output if -fsyntax-only. */
1066 if (flag_syntax_only
)
1069 #ifdef ASM_NO_SKIP_IN_TEXT
1070 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
1071 so we must output 0s explicitly in the text section. */
1072 if (ASM_NO_SKIP_IN_TEXT
&& in_text_section ())
1076 for (i
= 0; i
< size
- 20; i
+= 20)
1079 fprintf (asm_out_file
,
1080 "%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
);
1082 fprintf (asm_out_file
,
1083 "\tbyte 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n");
1089 fprintf (asm_out_file
, "%s 0", ASM_BYTE_OP
);
1091 fprintf (asm_out_file
, "\tbyte 0");
1094 for (; i
< size
; i
++)
1095 fprintf (asm_out_file
, ",0");
1096 fprintf (asm_out_file
, "\n");
1102 ASM_OUTPUT_SKIP (asm_out_file
, size
);
1105 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
1108 assemble_align (align
)
1111 if (align
> BITS_PER_UNIT
)
1112 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
1115 /* Assemble a string constant with the specified C string as contents. */
1118 assemble_string (p
, size
)
1125 /* If the string is very long, split it up. */
1129 int thissize
= size
- pos
;
1130 if (thissize
> maximum
)
1133 ASM_OUTPUT_ASCII (asm_out_file
, p
, thissize
);
1141 /* Assemble everything that is needed for a variable or function declaration.
1142 Not used for automatic variables, and not used for function definitions.
1143 Should not be called for variables of incomplete structure type.
1145 TOP_LEVEL is nonzero if this variable has file scope.
1146 AT_END is nonzero if this is the special handling, at end of compilation,
1147 to define things that have had only tentative definitions.
1148 DONT_OUTPUT_DATA if nonzero means don't actually output the
1149 initial value (that will be done by the caller). */
1152 assemble_variable (decl
, top_level
, at_end
, dont_output_data
)
1154 int top_level ATTRIBUTE_UNUSED
;
1156 int dont_output_data
;
1158 register char *name
;
1162 enum in_section saved_in_section
;
1164 last_assemble_variable_decl
= 0;
1166 if (GET_CODE (DECL_RTL (decl
)) == REG
)
1168 /* Do output symbol info for global register variables, but do nothing
1171 if (TREE_ASM_WRITTEN (decl
))
1173 TREE_ASM_WRITTEN (decl
) = 1;
1175 /* Do no output if -fsyntax-only. */
1176 if (flag_syntax_only
)
1179 #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
1180 /* File-scope global variables are output here. */
1181 if ((write_symbols
== DBX_DEBUG
|| write_symbols
== XCOFF_DEBUG
)
1183 dbxout_symbol (decl
, 0);
1185 #ifdef SDB_DEBUGGING_INFO
1186 if (write_symbols
== SDB_DEBUG
&& top_level
1187 /* Leave initialized global vars for end of compilation;
1188 see comment in compile_file. */
1189 && (TREE_PUBLIC (decl
) == 0 || DECL_INITIAL (decl
) == 0))
1190 sdbout_symbol (decl
, 0);
1193 /* Don't output any DWARF debugging information for variables here.
1194 In the case of local variables, the information for them is output
1195 when we do our recursive traversal of the tree representation for
1196 the entire containing function. In the case of file-scope variables,
1197 we output information for all of them at the very end of compilation
1198 while we are doing our final traversal of the chain of file-scope
1204 /* Normally no need to say anything here for external references,
1205 since assemble_external is called by the language-specific code
1206 when a declaration is first seen. */
1208 if (DECL_EXTERNAL (decl
))
1211 /* Output no assembler code for a function declaration.
1212 Only definitions of functions output anything. */
1214 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1217 /* If type was incomplete when the variable was declared,
1218 see if it is complete now. */
1220 if (DECL_SIZE (decl
) == 0)
1221 layout_decl (decl
, 0);
1223 /* Still incomplete => don't allocate it; treat the tentative defn
1224 (which is what it must have been) as an `extern' reference. */
1226 if (!dont_output_data
&& DECL_SIZE (decl
) == 0)
1228 error_with_file_and_line (DECL_SOURCE_FILE (decl
),
1229 DECL_SOURCE_LINE (decl
),
1230 "storage size of `%s' isn't known",
1231 IDENTIFIER_POINTER (DECL_NAME (decl
)));
1232 TREE_ASM_WRITTEN (decl
) = 1;
1236 /* The first declaration of a variable that comes through this function
1237 decides whether it is global (in C, has external linkage)
1238 or local (in C, has internal linkage). So do nothing more
1239 if this function has already run. */
1241 if (TREE_ASM_WRITTEN (decl
))
1244 TREE_ASM_WRITTEN (decl
) = 1;
1246 /* Do no output if -fsyntax-only. */
1247 if (flag_syntax_only
)
1252 if (! dont_output_data
)
1256 if (TREE_CODE (DECL_SIZE (decl
)) != INTEGER_CST
)
1259 /* This is better than explicit arithmetic, since it avoids overflow. */
1260 size_tree
= size_binop (CEIL_DIV_EXPR
,
1261 DECL_SIZE (decl
), size_int (BITS_PER_UNIT
));
1263 size
= TREE_INT_CST_LOW (size_tree
);
1264 if (TREE_INT_CST_HIGH (size_tree
) != 0
1265 || size
!= TREE_INT_CST_LOW (size_tree
))
1267 error_with_decl (decl
, "size of variable `%s' is too large");
1272 name
= XSTR (XEXP (DECL_RTL (decl
), 0), 0);
1274 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
)
1275 && ! first_global_object_name
1276 && ! (DECL_COMMON (decl
) && (DECL_INITIAL (decl
) == 0
1277 || DECL_INITIAL (decl
) == error_mark_node
))
1278 && ! DECL_WEAK (decl
)
1279 && ! DECL_ONE_ONLY (decl
))
1283 STRIP_NAME_ENCODING (p
, name
);
1284 first_global_object_name
= permalloc (strlen (p
) + 1);
1285 strcpy (first_global_object_name
, p
);
1288 /* Compute the alignment of this data. */
1290 align
= DECL_ALIGN (decl
);
1292 /* In the case for initialing an array whose length isn't specified,
1293 where we have not yet been able to do the layout,
1294 figure out the proper alignment now. */
1295 if (dont_output_data
&& DECL_SIZE (decl
) == 0
1296 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
)
1297 align
= MAX (align
, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl
))));
1299 /* Some object file formats have a maximum alignment which they support.
1300 In particular, a.out format supports a maximum alignment of 4. */
1301 #ifndef MAX_OFILE_ALIGNMENT
1302 #define MAX_OFILE_ALIGNMENT BIGGEST_ALIGNMENT
1304 if (align
> MAX_OFILE_ALIGNMENT
)
1306 warning_with_decl (decl
,
1307 "alignment of `%s' is greater than maximum object file alignment. Using %d.",
1308 MAX_OFILE_ALIGNMENT
/BITS_PER_UNIT
);
1309 align
= MAX_OFILE_ALIGNMENT
;
1312 /* On some machines, it is good to increase alignment sometimes. */
1313 #ifdef DATA_ALIGNMENT
1314 align
= DATA_ALIGNMENT (TREE_TYPE (decl
), align
);
1316 #ifdef CONSTANT_ALIGNMENT
1317 if (DECL_INITIAL (decl
) != 0 && DECL_INITIAL (decl
) != error_mark_node
)
1318 align
= CONSTANT_ALIGNMENT (DECL_INITIAL (decl
), align
);
1321 /* Reset the alignment in case we have made it tighter, so we can benefit
1322 from it in get_pointer_alignment. */
1323 DECL_ALIGN (decl
) = align
;
1325 /* Handle uninitialized definitions. */
1327 if ((DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
)
1328 /* If the target can't output uninitialized but not common global data
1329 in .bss, then we have to use .data. */
1330 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
1331 && DECL_COMMON (decl
)
1333 && DECL_SECTION_NAME (decl
) == 0
1334 && ! dont_output_data
)
1336 int size
= TREE_INT_CST_LOW (size_tree
);
1339 /* Don't allocate zero bytes of common,
1340 since that means "undefined external" in the linker. */
1341 if (size
== 0) rounded
= 1;
1342 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1343 so that each uninitialized object starts on such a boundary. */
1344 rounded
+= (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1;
1345 rounded
= (rounded
/ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1346 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1348 #if !defined(ASM_OUTPUT_ALIGNED_COMMON) && !defined(ASM_OUTPUT_ALIGNED_BSS)
1349 if ( (DECL_ALIGN (decl
) / BITS_PER_UNIT
) > rounded
)
1351 (decl
, "requested alignment for %s is greater than implemented alignment of %d.",rounded
);
1354 #ifdef DBX_DEBUGGING_INFO
1355 /* File-scope global variables are output here. */
1356 if (write_symbols
== DBX_DEBUG
&& top_level
)
1357 dbxout_symbol (decl
, 0);
1359 #ifdef SDB_DEBUGGING_INFO
1360 if (write_symbols
== SDB_DEBUG
&& top_level
1361 /* Leave initialized global vars for end of compilation;
1362 see comment in compile_file. */
1363 && (TREE_PUBLIC (decl
) == 0 || DECL_INITIAL (decl
) == 0))
1364 sdbout_symbol (decl
, 0);
1367 /* Don't output any DWARF debugging information for variables here.
1368 In the case of local variables, the information for them is output
1369 when we do our recursive traversal of the tree representation for
1370 the entire containing function. In the case of file-scope variables,
1371 we output information for all of them at the very end of compilation
1372 while we are doing our final traversal of the chain of file-scope
1375 #if 0 /* ??? We should either delete this or add a comment describing what
1376 it was intended to do and why we shouldn't delete it. */
1377 if (flag_shared_data
)
1381 if (TREE_PUBLIC (decl
)
1382 #if defined (ASM_OUTPUT_BSS) || defined (ASM_OUTPUT_ALIGNED_BSS)
1383 && DECL_COMMON (decl
)
1387 #ifdef ASM_OUTPUT_SHARED_COMMON
1388 if (flag_shared_data
)
1389 ASM_OUTPUT_SHARED_COMMON (asm_out_file
, name
, size
, rounded
);
1393 #ifdef ASM_OUTPUT_ALIGNED_DECL_COMMON
1394 ASM_OUTPUT_ALIGNED_DECL_COMMON (asm_out_file
, decl
, name
, size
,
1397 #ifdef ASM_OUTPUT_ALIGNED_COMMON
1398 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file
, name
, size
,
1401 ASM_OUTPUT_COMMON (asm_out_file
, name
, size
, rounded
);
1406 #if defined (ASM_OUTPUT_BSS) || defined (ASM_OUTPUT_ALIGNED_BSS)
1407 else if (TREE_PUBLIC (decl
))
1409 #ifdef ASM_OUTPUT_SHARED_BSS
1410 if (flag_shared_data
)
1411 ASM_OUTPUT_SHARED_BSS (asm_out_file
, decl
, name
, size
, rounded
);
1415 #ifdef ASM_OUTPUT_ALIGNED_BSS
1416 ASM_OUTPUT_ALIGNED_BSS (asm_out_file
, decl
, name
, size
,
1419 ASM_OUTPUT_BSS (asm_out_file
, decl
, name
, size
, rounded
);
1423 #endif /* ASM_OUTPUT_BSS || ASM_OUTPUT_ALIGNED_BSS */
1426 #ifdef ASM_OUTPUT_SHARED_LOCAL
1427 if (flag_shared_data
)
1428 ASM_OUTPUT_SHARED_LOCAL (asm_out_file
, name
, size
, rounded
);
1432 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
1433 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file
, decl
, name
, size
,
1436 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1437 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file
, name
, size
,
1440 ASM_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
1448 /* Handle initialized definitions.
1449 Also handle uninitialized global definitions if -fno-common and the
1450 target doesn't support ASM_OUTPUT_BSS. */
1452 /* First make the assembler name(s) global if appropriate. */
1453 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
))
1455 #ifdef ASM_WEAKEN_LABEL
1456 if (DECL_WEAK (decl
))
1457 ASM_WEAKEN_LABEL (asm_out_file
, name
);
1460 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
1463 for (d
= equivalents
; d
; d
= TREE_CHAIN (d
))
1465 tree e
= TREE_VALUE (d
);
1466 if (TREE_PUBLIC (e
) && DECL_NAME (e
))
1467 ASM_GLOBALIZE_LABEL (asm_out_file
,
1468 XSTR (XEXP (DECL_RTL (e
), 0), 0));
1472 /* Output any data that we will need to use the address of. */
1473 if (DECL_INITIAL (decl
) == error_mark_node
)
1474 reloc
= contains_pointers_p (TREE_TYPE (decl
));
1475 else if (DECL_INITIAL (decl
))
1476 reloc
= output_addressed_constants (DECL_INITIAL (decl
));
1478 #ifdef ASM_OUTPUT_SECTION_NAME
1479 if ((flag_data_sections
!= 0
1480 && DECL_SECTION_NAME (decl
) == NULL_TREE
)
1481 || UNIQUE_SECTION_P (decl
))
1482 UNIQUE_SECTION (decl
, reloc
);
1485 /* Switch to the appropriate section. */
1486 variable_section (decl
, reloc
);
1488 /* dbxout.c needs to know this. */
1489 if (in_text_section ())
1490 DECL_IN_TEXT_SECTION (decl
) = 1;
1492 /* Record current section so we can restore it if dbxout.c clobbers it. */
1493 saved_in_section
= in_section
;
1495 /* Output the dbx info now that we have chosen the section. */
1497 #ifdef DBX_DEBUGGING_INFO
1498 /* File-scope global variables are output here. */
1499 if (write_symbols
== DBX_DEBUG
&& top_level
)
1500 dbxout_symbol (decl
, 0);
1502 #ifdef SDB_DEBUGGING_INFO
1503 if (write_symbols
== SDB_DEBUG
&& top_level
1504 /* Leave initialized global vars for end of compilation;
1505 see comment in compile_file. */
1506 && (TREE_PUBLIC (decl
) == 0 || DECL_INITIAL (decl
) == 0))
1507 sdbout_symbol (decl
, 0);
1510 /* Don't output any DWARF debugging information for variables here.
1511 In the case of local variables, the information for them is output
1512 when we do our recursive traversal of the tree representation for
1513 the entire containing function. In the case of file-scope variables,
1514 we output information for all of them at the very end of compilation
1515 while we are doing our final traversal of the chain of file-scope
1518 /* If the debugging output changed sections, reselect the section
1519 that's supposed to be selected. */
1520 if (in_section
!= saved_in_section
)
1521 variable_section (decl
, reloc
);
1523 /* Output the alignment of this data. */
1524 if (align
> BITS_PER_UNIT
)
1525 ASM_OUTPUT_ALIGN (asm_out_file
,
1526 floor_log2 (DECL_ALIGN (decl
) / BITS_PER_UNIT
));
1528 /* Do any machine/system dependent processing of the object. */
1529 #ifdef ASM_DECLARE_OBJECT_NAME
1530 last_assemble_variable_decl
= decl
;
1531 ASM_DECLARE_OBJECT_NAME (asm_out_file
, name
, decl
);
1533 /* Standard thing is just output label for the object. */
1534 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1535 #endif /* ASM_DECLARE_OBJECT_NAME */
1537 if (!dont_output_data
)
1539 if (DECL_INITIAL (decl
))
1540 /* Output the actual data. */
1541 output_constant (DECL_INITIAL (decl
), TREE_INT_CST_LOW (size_tree
));
1543 /* Leave space for it. */
1544 assemble_zeros (TREE_INT_CST_LOW (size_tree
));
1548 #ifdef XCOFF_DEBUGGING_INFO
1549 /* Unfortunately, the IBM assembler cannot handle stabx before the actual
1550 declaration. When something like ".stabx "aa:S-2",aa,133,0" is emitted
1551 and `aa' hasn't been output yet, the assembler generates a stab entry with
1552 a value of zero, in addition to creating an unnecessary external entry
1553 for `aa'. Hence, we must postpone dbxout_symbol to here at the end. */
1555 /* File-scope global variables are output here. */
1556 if (write_symbols
== XCOFF_DEBUG
&& top_level
)
1558 saved_in_section
= in_section
;
1560 dbxout_symbol (decl
, 0);
1562 if (in_section
!= saved_in_section
)
1563 variable_section (decl
, reloc
);
1566 /* There must be a statement after a label. */
1571 /* Return 1 if type TYPE contains any pointers. */
1574 contains_pointers_p (type
)
1577 switch (TREE_CODE (type
))
1580 case REFERENCE_TYPE
:
1581 /* I'm not sure whether OFFSET_TYPE needs this treatment,
1582 so I'll play safe and return 1. */
1588 case QUAL_UNION_TYPE
:
1591 /* For a type that has fields, see if the fields have pointers. */
1592 for (fields
= TYPE_FIELDS (type
); fields
; fields
= TREE_CHAIN (fields
))
1593 if (TREE_CODE (fields
) == FIELD_DECL
1594 && contains_pointers_p (TREE_TYPE (fields
)))
1600 /* An array type contains pointers if its element type does. */
1601 return contains_pointers_p (TREE_TYPE (type
));
1608 /* Output something to declare an external symbol to the assembler.
1609 (Most assemblers don't need this, so we normally output nothing.)
1610 Do nothing if DECL is not external. */
1613 assemble_external (decl
)
1616 #ifdef ASM_OUTPUT_EXTERNAL
1617 if (TREE_CODE_CLASS (TREE_CODE (decl
)) == 'd'
1618 && DECL_EXTERNAL (decl
) && TREE_PUBLIC (decl
))
1620 rtx rtl
= DECL_RTL (decl
);
1622 if (GET_CODE (rtl
) == MEM
&& GET_CODE (XEXP (rtl
, 0)) == SYMBOL_REF
1623 && ! SYMBOL_REF_USED (XEXP (rtl
, 0)))
1625 /* Some systems do require some output. */
1626 SYMBOL_REF_USED (XEXP (rtl
, 0)) = 1;
1627 ASM_OUTPUT_EXTERNAL (asm_out_file
, decl
, XSTR (XEXP (rtl
, 0), 0));
1633 /* Similar, for calling a library function FUN. */
1636 assemble_external_libcall (fun
)
1637 rtx fun ATTRIBUTE_UNUSED
;
1639 #ifdef ASM_OUTPUT_EXTERNAL_LIBCALL
1640 /* Declare library function name external when first used, if nec. */
1641 if (! SYMBOL_REF_USED (fun
))
1643 SYMBOL_REF_USED (fun
) = 1;
1644 ASM_OUTPUT_EXTERNAL_LIBCALL (asm_out_file
, fun
);
1649 /* Declare the label NAME global. */
1652 assemble_global (name
)
1655 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
1658 /* Assemble a label named NAME. */
1661 assemble_label (name
)
1664 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1667 /* Output to FILE a reference to the assembler name of a C-level name NAME.
1668 If NAME starts with a *, the rest of NAME is output verbatim.
1669 Otherwise NAME is transformed in an implementation-defined way
1670 (usually by the addition of an underscore).
1671 Many macros in the tm file are defined to call this function. */
1674 assemble_name (file
, name
)
1681 STRIP_NAME_ENCODING (real_name
, name
);
1682 if (flag_prefix_function_name
1683 && ! bcmp (real_name
, CHKR_PREFIX
, CHKR_PREFIX_SIZE
))
1684 real_name
= real_name
+ CHKR_PREFIX_SIZE
;
1686 id
= maybe_get_identifier (real_name
);
1688 TREE_SYMBOL_REFERENCED (id
) = 1;
1691 fputs (&name
[1], file
);
1693 ASM_OUTPUT_LABELREF (file
, name
);
1696 /* Allocate SIZE bytes writable static space with a gensym name
1697 and return an RTX to refer to its address. */
1700 assemble_static_space (size
)
1708 if (flag_shared_data
)
1712 ASM_GENERATE_INTERNAL_LABEL (name
, "LF", const_labelno
);
1715 namestring
= (char *) obstack_alloc (saveable_obstack
,
1717 strcpy (namestring
, name
);
1719 x
= gen_rtx_SYMBOL_REF (Pmode
, namestring
);
1721 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
1722 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file
, NULL_TREE
, name
, size
,
1725 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1726 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file
, name
, size
, BIGGEST_ALIGNMENT
);
1729 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1730 so that each uninitialized object starts on such a boundary. */
1731 /* Variable `rounded' might or might not be used in ASM_OUTPUT_LOCAL. */
1732 int rounded ATTRIBUTE_UNUSED
1733 = ((size
+ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1)
1734 / (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1735 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1736 ASM_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
1743 /* Assemble the static constant template for function entry trampolines.
1744 This is done at most once per compilation.
1745 Returns an RTX for the address of the template. */
1747 #ifdef TRAMPOLINE_TEMPLATE
1749 assemble_trampoline_template ()
1755 /* By default, put trampoline templates in read-only data section. */
1757 #ifdef TRAMPOLINE_SECTION
1758 TRAMPOLINE_SECTION ();
1760 readonly_data_section ();
1763 /* Write the assembler code to define one. */
1764 align
= floor_log2 (TRAMPOLINE_ALIGNMENT
/ BITS_PER_UNIT
);
1766 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1768 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LTRAMP", 0);
1769 TRAMPOLINE_TEMPLATE (asm_out_file
);
1771 /* Record the rtl to refer to it. */
1772 ASM_GENERATE_INTERNAL_LABEL (label
, "LTRAMP", 0);
1774 = (char *) obstack_copy0 (&permanent_obstack
, label
, strlen (label
));
1775 return gen_rtx_SYMBOL_REF (Pmode
, name
);
1779 /* Assemble the integer constant X into an object of SIZE bytes.
1780 X must be either a CONST_INT or CONST_DOUBLE.
1782 Return 1 if we were able to output the constant, otherwise 0. If FORCE is
1783 non-zero, abort if we can't output the constant. */
1786 assemble_integer (x
, size
, force
)
1791 /* First try to use the standard 1, 2, 4, 8, and 16 byte
1792 ASM_OUTPUT... macros. */
1796 #ifdef ASM_OUTPUT_CHAR
1798 ASM_OUTPUT_CHAR (asm_out_file
, x
);
1802 #ifdef ASM_OUTPUT_SHORT
1804 ASM_OUTPUT_SHORT (asm_out_file
, x
);
1808 #ifdef ASM_OUTPUT_INT
1810 ASM_OUTPUT_INT (asm_out_file
, x
);
1814 #ifdef ASM_OUTPUT_DOUBLE_INT
1816 ASM_OUTPUT_DOUBLE_INT (asm_out_file
, x
);
1820 #ifdef ASM_OUTPUT_QUADRUPLE_INT
1822 ASM_OUTPUT_QUADRUPLE_INT (asm_out_file
, x
);
1827 /* If we couldn't do it that way, there are two other possibilities: First,
1828 if the machine can output an explicit byte and this is a 1 byte constant,
1829 we can use ASM_OUTPUT_BYTE. */
1831 #ifdef ASM_OUTPUT_BYTE
1832 if (size
== 1 && GET_CODE (x
) == CONST_INT
)
1834 ASM_OUTPUT_BYTE (asm_out_file
, INTVAL (x
));
1839 /* Finally, if SIZE is larger than a single word, try to output the constant
1840 one word at a time. */
1842 if (size
> UNITS_PER_WORD
)
1845 enum machine_mode mode
1846 = mode_for_size (size
* BITS_PER_UNIT
, MODE_INT
, 0);
1849 for (i
= 0; i
< size
/ UNITS_PER_WORD
; i
++)
1851 word
= operand_subword (x
, i
, 0, mode
);
1856 if (! assemble_integer (word
, UNITS_PER_WORD
, 0))
1860 if (i
== size
/ UNITS_PER_WORD
)
1862 /* If we output at least one word and then could not finish,
1863 there is no valid way to continue. */
1874 /* Assemble the floating-point constant D into an object of size MODE. */
1877 assemble_real (d
, mode
)
1879 enum machine_mode mode
;
1881 jmp_buf output_constant_handler
;
1883 if (setjmp (output_constant_handler
))
1885 error ("floating point trap outputting a constant");
1886 #ifdef REAL_IS_NOT_DOUBLE
1887 bzero ((char *) &d
, sizeof d
);
1894 set_float_handler (output_constant_handler
);
1898 #ifdef ASM_OUTPUT_BYTE_FLOAT
1900 ASM_OUTPUT_BYTE_FLOAT (asm_out_file
, d
);
1903 #ifdef ASM_OUTPUT_SHORT_FLOAT
1905 ASM_OUTPUT_SHORT_FLOAT (asm_out_file
, d
);
1908 #ifdef ASM_OUTPUT_THREE_QUARTER_FLOAT
1910 ASM_OUTPUT_THREE_QUARTER_FLOAT (asm_out_file
, d
);
1913 #ifdef ASM_OUTPUT_FLOAT
1915 ASM_OUTPUT_FLOAT (asm_out_file
, d
);
1919 #ifdef ASM_OUTPUT_DOUBLE
1921 ASM_OUTPUT_DOUBLE (asm_out_file
, d
);
1925 #ifdef ASM_OUTPUT_LONG_DOUBLE
1928 ASM_OUTPUT_LONG_DOUBLE (asm_out_file
, d
);
1936 set_float_handler (NULL_PTR
);
1939 /* Here we combine duplicate floating constants to make
1940 CONST_DOUBLE rtx's, and force those out to memory when necessary. */
1942 /* Chain of all CONST_DOUBLE rtx's constructed for the current function.
1943 They are chained through the CONST_DOUBLE_CHAIN.
1944 A CONST_DOUBLE rtx has CONST_DOUBLE_MEM != cc0_rtx iff it is on this chain.
1945 In that case, CONST_DOUBLE_MEM is either a MEM,
1946 or const0_rtx if no MEM has been made for this CONST_DOUBLE yet.
1948 (CONST_DOUBLE_MEM is used only for top-level functions.
1949 See force_const_mem for explanation.) */
1951 static rtx const_double_chain
;
1953 /* Return a CONST_DOUBLE or CONST_INT for a value specified as a pair of ints.
1954 For an integer, I0 is the low-order word and I1 is the high-order word.
1955 For a real number, I0 is the word with the low address
1956 and I1 is the word with the high address. */
1959 immed_double_const (i0
, i1
, mode
)
1960 HOST_WIDE_INT i0
, i1
;
1961 enum machine_mode mode
;
1965 if (GET_MODE_CLASS (mode
) == MODE_INT
1966 || GET_MODE_CLASS (mode
) == MODE_PARTIAL_INT
)
1968 /* We clear out all bits that don't belong in MODE, unless they and our
1969 sign bit are all one. So we get either a reasonable negative value
1970 or a reasonable unsigned value for this mode. */
1971 int width
= GET_MODE_BITSIZE (mode
);
1972 if (width
< HOST_BITS_PER_WIDE_INT
1973 && ((i0
& ((HOST_WIDE_INT
) (-1) << (width
- 1)))
1974 != ((HOST_WIDE_INT
) (-1) << (width
- 1))))
1975 i0
&= ((HOST_WIDE_INT
) 1 << width
) - 1, i1
= 0;
1976 else if (width
== HOST_BITS_PER_WIDE_INT
1977 && ! (i1
== ~0 && i0
< 0))
1979 else if (width
> 2 * HOST_BITS_PER_WIDE_INT
)
1980 /* We cannot represent this value as a constant. */
1983 /* If this would be an entire word for the target, but is not for
1984 the host, then sign-extend on the host so that the number will look
1985 the same way on the host that it would on the target.
1987 For example, when building a 64 bit alpha hosted 32 bit sparc
1988 targeted compiler, then we want the 32 bit unsigned value -1 to be
1989 represented as a 64 bit value -1, and not as 0x00000000ffffffff.
1990 The later confuses the sparc backend. */
1992 if (BITS_PER_WORD
< HOST_BITS_PER_WIDE_INT
&& BITS_PER_WORD
== width
1993 && (i0
& ((HOST_WIDE_INT
) 1 << (width
- 1))))
1994 i0
|= ((HOST_WIDE_INT
) (-1) << width
);
1996 /* If MODE fits within HOST_BITS_PER_WIDE_INT, always use a CONST_INT.
1998 ??? Strictly speaking, this is wrong if we create a CONST_INT
1999 for a large unsigned constant with the size of MODE being
2000 HOST_BITS_PER_WIDE_INT and later try to interpret that constant in a
2001 wider mode. In that case we will mis-interpret it as a negative
2004 Unfortunately, the only alternative is to make a CONST_DOUBLE
2005 for any constant in any mode if it is an unsigned constant larger
2006 than the maximum signed integer in an int on the host. However,
2007 doing this will break everyone that always expects to see a CONST_INT
2008 for SImode and smaller.
2010 We have always been making CONST_INTs in this case, so nothing new
2013 if (width
<= HOST_BITS_PER_WIDE_INT
)
2014 i1
= (i0
< 0) ? ~(HOST_WIDE_INT
) 0 : 0;
2016 /* If this integer fits in one word, return a CONST_INT. */
2017 if ((i1
== 0 && i0
>= 0)
2018 || (i1
== ~0 && i0
< 0))
2019 return GEN_INT (i0
);
2021 /* We use VOIDmode for integers. */
2025 /* Search the chain for an existing CONST_DOUBLE with the right value.
2026 If one is found, return it. */
2028 for (r
= const_double_chain
; r
; r
= CONST_DOUBLE_CHAIN (r
))
2029 if (CONST_DOUBLE_LOW (r
) == i0
&& CONST_DOUBLE_HIGH (r
) == i1
2030 && GET_MODE (r
) == mode
)
2033 /* No; make a new one and add it to the chain.
2035 We may be called by an optimizer which may be discarding any memory
2036 allocated during its processing (such as combine and loop). However,
2037 we will be leaving this constant on the chain, so we cannot tolerate
2038 freed memory. So switch to saveable_obstack for this allocation
2039 and then switch back if we were in current_obstack. */
2041 push_obstacks_nochange ();
2042 rtl_in_saveable_obstack ();
2043 r
= gen_rtx_CONST_DOUBLE (mode
, NULL_RTX
, i0
, i1
);
2046 /* Don't touch const_double_chain in nested function; see force_const_mem.
2047 Also, don't touch it if not inside any function. */
2048 if (outer_function_chain
== 0 && current_function_decl
!= 0)
2050 CONST_DOUBLE_CHAIN (r
) = const_double_chain
;
2051 const_double_chain
= r
;
2054 /* Store const0_rtx in mem-slot since this CONST_DOUBLE is on the chain.
2055 Actual use of mem-slot is only through force_const_mem. */
2057 CONST_DOUBLE_MEM (r
) = const0_rtx
;
2062 /* Return a CONST_DOUBLE for a specified `double' value
2063 and machine mode. */
2066 immed_real_const_1 (d
, mode
)
2068 enum machine_mode mode
;
2070 union real_extract u
;
2073 /* Get the desired `double' value as a sequence of ints
2074 since that is how they are stored in a CONST_DOUBLE. */
2078 /* Detect special cases. */
2080 if (REAL_VALUES_IDENTICAL (dconst0
, d
))
2081 return CONST0_RTX (mode
);
2082 /* Check for NaN first, because some ports (specifically the i386) do not
2083 emit correct ieee-fp code by default, and thus will generate a core
2084 dump here if we pass a NaN to REAL_VALUES_EQUAL and if REAL_VALUES_EQUAL
2085 does a floating point comparison. */
2086 else if (! REAL_VALUE_ISNAN (d
) && REAL_VALUES_EQUAL (dconst1
, d
))
2087 return CONST1_RTX (mode
);
2089 if (sizeof u
== sizeof (HOST_WIDE_INT
))
2090 return immed_double_const (u
.i
[0], 0, mode
);
2091 if (sizeof u
== 2 * sizeof (HOST_WIDE_INT
))
2092 return immed_double_const (u
.i
[0], u
.i
[1], mode
);
2094 /* The rest of this function handles the case where
2095 a float value requires more than 2 ints of space.
2096 It will be deleted as dead code on machines that don't need it. */
2098 /* Search the chain for an existing CONST_DOUBLE with the right value.
2099 If one is found, return it. */
2101 for (r
= const_double_chain
; r
; r
= CONST_DOUBLE_CHAIN (r
))
2102 if (! bcmp ((char *) &CONST_DOUBLE_LOW (r
), (char *) &u
, sizeof u
)
2103 && GET_MODE (r
) == mode
)
2106 /* No; make a new one and add it to the chain.
2108 We may be called by an optimizer which may be discarding any memory
2109 allocated during its processing (such as combine and loop). However,
2110 we will be leaving this constant on the chain, so we cannot tolerate
2111 freed memory. So switch to saveable_obstack for this allocation
2112 and then switch back if we were in current_obstack. */
2114 push_obstacks_nochange ();
2115 rtl_in_saveable_obstack ();
2116 r
= rtx_alloc (CONST_DOUBLE
);
2118 bcopy ((char *) &u
, (char *) &CONST_DOUBLE_LOW (r
), sizeof u
);
2121 /* Don't touch const_double_chain in nested function; see force_const_mem.
2122 Also, don't touch it if not inside any function. */
2123 if (outer_function_chain
== 0 && current_function_decl
!= 0)
2125 CONST_DOUBLE_CHAIN (r
) = const_double_chain
;
2126 const_double_chain
= r
;
2129 /* Store const0_rtx in CONST_DOUBLE_MEM since this CONST_DOUBLE is on the
2130 chain, but has not been allocated memory. Actual use of CONST_DOUBLE_MEM
2131 is only through force_const_mem. */
2133 CONST_DOUBLE_MEM (r
) = const0_rtx
;
2138 /* Return a CONST_DOUBLE rtx for a value specified by EXP,
2139 which must be a REAL_CST tree node. */
2142 immed_real_const (exp
)
2145 return immed_real_const_1 (TREE_REAL_CST (exp
), TYPE_MODE (TREE_TYPE (exp
)));
2148 /* At the end of a function, forget the memory-constants
2149 previously made for CONST_DOUBLEs. Mark them as not on real_constant_chain.
2150 Also clear out real_constant_chain and clear out all the chain-pointers. */
2153 clear_const_double_mem ()
2155 register rtx r
, next
;
2157 /* Don't touch CONST_DOUBLE_MEM for nested functions.
2158 See force_const_mem for explanation. */
2159 if (outer_function_chain
!= 0)
2162 for (r
= const_double_chain
; r
; r
= next
)
2164 next
= CONST_DOUBLE_CHAIN (r
);
2165 CONST_DOUBLE_CHAIN (r
) = 0;
2166 CONST_DOUBLE_MEM (r
) = cc0_rtx
;
2168 const_double_chain
= 0;
2171 /* Given an expression EXP with a constant value,
2172 reduce it to the sum of an assembler symbol and an integer.
2173 Store them both in the structure *VALUE.
2174 Abort if EXP does not reduce. */
2179 HOST_WIDE_INT offset
;
2183 decode_addr_const (exp
, value
)
2185 struct addr_const
*value
;
2187 register tree target
= TREE_OPERAND (exp
, 0);
2188 register int offset
= 0;
2193 if (TREE_CODE (target
) == COMPONENT_REF
2194 && (TREE_CODE (DECL_FIELD_BITPOS (TREE_OPERAND (target
, 1)))
2197 offset
+= TREE_INT_CST_LOW (DECL_FIELD_BITPOS (TREE_OPERAND (target
, 1))) / BITS_PER_UNIT
;
2198 target
= TREE_OPERAND (target
, 0);
2200 else if (TREE_CODE (target
) == ARRAY_REF
)
2202 if (TREE_CODE (TREE_OPERAND (target
, 1)) != INTEGER_CST
2203 || TREE_CODE (TYPE_SIZE (TREE_TYPE (target
))) != INTEGER_CST
)
2205 offset
+= ((TREE_INT_CST_LOW (TYPE_SIZE (TREE_TYPE (target
)))
2206 * TREE_INT_CST_LOW (TREE_OPERAND (target
, 1)))
2208 target
= TREE_OPERAND (target
, 0);
2214 switch (TREE_CODE (target
))
2218 x
= DECL_RTL (target
);
2222 x
= gen_rtx_MEM (FUNCTION_MODE
,
2223 gen_rtx_LABEL_REF (VOIDmode
,
2224 label_rtx (TREE_OPERAND (exp
, 0))));
2232 x
= TREE_CST_RTL (target
);
2239 if (GET_CODE (x
) != MEM
)
2244 value
->offset
= offset
;
2247 /* Uniquize all constants that appear in memory.
2248 Each constant in memory thus far output is recorded
2249 in `const_hash_table' with a `struct constant_descriptor'
2250 that contains a polish representation of the value of
2253 We cannot store the trees in the hash table
2254 because the trees may be temporary. */
2256 struct constant_descriptor
2258 struct constant_descriptor
*next
;
2264 #define MAX_HASH_TABLE 1009
2265 static struct constant_descriptor
*const_hash_table
[MAX_HASH_TABLE
];
2267 /* Compute a hash code for a constant expression. */
2274 register int len
, hi
, i
;
2275 register enum tree_code code
= TREE_CODE (exp
);
2277 /* Either set P and LEN to the address and len of something to hash and
2278 exit the switch or return a value. */
2283 p
= (char *) &TREE_INT_CST_LOW (exp
);
2284 len
= 2 * sizeof TREE_INT_CST_LOW (exp
);
2288 p
= (char *) &TREE_REAL_CST (exp
);
2289 len
= sizeof TREE_REAL_CST (exp
);
2293 p
= TREE_STRING_POINTER (exp
);
2294 len
= TREE_STRING_LENGTH (exp
);
2298 return (const_hash (TREE_REALPART (exp
)) * 5
2299 + const_hash (TREE_IMAGPART (exp
)));
2302 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2304 len
= int_size_in_bytes (TREE_TYPE (exp
));
2305 p
= (char *) alloca (len
);
2306 get_set_constructor_bytes (exp
, (unsigned char *) p
, len
);
2313 /* For record type, include the type in the hashing.
2314 We do not do so for array types
2315 because (1) the sizes of the elements are sufficient
2316 and (2) distinct array types can have the same constructor.
2317 Instead, we include the array size because the constructor could
2319 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2320 hi
= ((unsigned long) TREE_TYPE (exp
) & ((1 << HASHBITS
) - 1))
2323 hi
= ((5 + int_size_in_bytes (TREE_TYPE (exp
)))
2324 & ((1 << HASHBITS
) - 1)) % MAX_HASH_TABLE
;
2326 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2327 if (TREE_VALUE (link
))
2329 = (hi
* 603 + const_hash (TREE_VALUE (link
))) % MAX_HASH_TABLE
;
2336 struct addr_const value
;
2338 decode_addr_const (exp
, &value
);
2339 if (GET_CODE (value
.base
) == SYMBOL_REF
)
2341 /* Don't hash the address of the SYMBOL_REF;
2342 only use the offset and the symbol name. */
2344 p
= XSTR (value
.base
, 0);
2345 for (i
= 0; p
[i
] != 0; i
++)
2346 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2348 else if (GET_CODE (value
.base
) == LABEL_REF
)
2349 hi
= value
.offset
+ CODE_LABEL_NUMBER (XEXP (value
.base
, 0)) * 13;
2351 hi
&= (1 << HASHBITS
) - 1;
2352 hi
%= MAX_HASH_TABLE
;
2358 return (const_hash (TREE_OPERAND (exp
, 0)) * 9
2359 + const_hash (TREE_OPERAND (exp
, 1)));
2363 case NON_LVALUE_EXPR
:
2364 return const_hash (TREE_OPERAND (exp
, 0)) * 7 + 2;
2370 /* Compute hashing function */
2372 for (i
= 0; i
< len
; i
++)
2373 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2375 hi
&= (1 << HASHBITS
) - 1;
2376 hi
%= MAX_HASH_TABLE
;
2380 /* Compare a constant expression EXP with a constant-descriptor DESC.
2381 Return 1 if DESC describes a constant with the same value as EXP. */
2384 compare_constant (exp
, desc
)
2386 struct constant_descriptor
*desc
;
2388 return 0 != compare_constant_1 (exp
, desc
->contents
);
2391 /* Compare constant expression EXP with a substring P of a constant descriptor.
2392 If they match, return a pointer to the end of the substring matched.
2393 If they do not match, return 0.
2395 Since descriptors are written in polish prefix notation,
2396 this function can be used recursively to test one operand of EXP
2397 against a subdescriptor, and if it succeeds it returns the
2398 address of the subdescriptor for the next operand. */
2401 compare_constant_1 (exp
, p
)
2405 register char *strp
;
2407 register enum tree_code code
= TREE_CODE (exp
);
2409 if (code
!= (enum tree_code
) *p
++)
2412 /* Either set STRP, P and LEN to pointers and length to compare and exit the
2413 switch, or return the result of the comparison. */
2418 /* Integer constants are the same only if the same width of type. */
2419 if (*p
++ != TYPE_PRECISION (TREE_TYPE (exp
)))
2422 strp
= (char *) &TREE_INT_CST_LOW (exp
);
2423 len
= 2 * sizeof TREE_INT_CST_LOW (exp
);
2427 /* Real constants are the same only if the same width of type. */
2428 if (*p
++ != TYPE_PRECISION (TREE_TYPE (exp
)))
2431 strp
= (char *) &TREE_REAL_CST (exp
);
2432 len
= sizeof TREE_REAL_CST (exp
);
2436 if (flag_writable_strings
)
2439 if (*p
++ != TYPE_MODE (TREE_TYPE (exp
)))
2442 strp
= TREE_STRING_POINTER (exp
);
2443 len
= TREE_STRING_LENGTH (exp
);
2444 if (bcmp ((char *) &TREE_STRING_LENGTH (exp
), p
,
2445 sizeof TREE_STRING_LENGTH (exp
)))
2448 p
+= sizeof TREE_STRING_LENGTH (exp
);
2452 p
= compare_constant_1 (TREE_REALPART (exp
), p
);
2456 return compare_constant_1 (TREE_IMAGPART (exp
), p
);
2459 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2461 int xlen
= len
= int_size_in_bytes (TREE_TYPE (exp
));
2463 strp
= (char *) alloca (len
);
2464 get_set_constructor_bytes (exp
, (unsigned char *) strp
, len
);
2465 if (bcmp ((char *) &xlen
, p
, sizeof xlen
))
2474 int length
= list_length (CONSTRUCTOR_ELTS (exp
));
2476 int have_purpose
= 0;
2478 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2479 if (TREE_PURPOSE (link
))
2482 if (bcmp ((char *) &length
, p
, sizeof length
))
2487 /* For record constructors, insist that the types match.
2488 For arrays, just verify both constructors are for arrays.
2489 Then insist that either both or none have any TREE_PURPOSE
2491 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2492 type
= TREE_TYPE (exp
);
2496 if (bcmp ((char *) &type
, p
, sizeof type
))
2501 if (bcmp ((char *) &have_purpose
, p
, sizeof have_purpose
))
2504 p
+= sizeof have_purpose
;
2506 /* For arrays, insist that the size in bytes match. */
2507 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2509 HOST_WIDE_INT size
= int_size_in_bytes (TREE_TYPE (exp
));
2511 if (bcmp ((char *) &size
, p
, sizeof size
))
2517 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2519 if (TREE_VALUE (link
))
2521 if ((p
= compare_constant_1 (TREE_VALUE (link
), p
)) == 0)
2528 if (bcmp ((char *) &zero
, p
, sizeof zero
))
2534 if (TREE_PURPOSE (link
)
2535 && TREE_CODE (TREE_PURPOSE (link
)) == FIELD_DECL
)
2537 if (bcmp ((char *) &TREE_PURPOSE (link
), p
,
2538 sizeof TREE_PURPOSE (link
)))
2541 p
+= sizeof TREE_PURPOSE (link
);
2543 else if (TREE_PURPOSE (link
))
2545 if ((p
= compare_constant_1 (TREE_PURPOSE (link
), p
)) == 0)
2548 else if (have_purpose
)
2552 if (bcmp ((char *) &zero
, p
, sizeof zero
))
2564 struct addr_const value
;
2566 decode_addr_const (exp
, &value
);
2567 strp
= (char *) &value
.offset
;
2568 len
= sizeof value
.offset
;
2569 /* Compare the offset. */
2571 if (*p
++ != *strp
++)
2574 /* Compare symbol name. */
2575 strp
= XSTR (value
.base
, 0);
2576 len
= strlen (strp
) + 1;
2583 p
= compare_constant_1 (TREE_OPERAND (exp
, 0), p
);
2587 return compare_constant_1 (TREE_OPERAND (exp
, 1), p
);
2591 case NON_LVALUE_EXPR
:
2592 return compare_constant_1 (TREE_OPERAND (exp
, 0), p
);
2598 /* Compare constant contents. */
2600 if (*p
++ != *strp
++)
2606 /* Construct a constant descriptor for the expression EXP.
2607 It is up to the caller to enter the descriptor in the hash table. */
2609 static struct constant_descriptor
*
2610 record_constant (exp
)
2613 struct constant_descriptor
*next
= 0;
2616 /* Make a struct constant_descriptor. The first two pointers will
2617 be filled in later. Here we just leave space for them. */
2619 obstack_grow (&permanent_obstack
, (char *) &next
, sizeof next
);
2620 obstack_grow (&permanent_obstack
, (char *) &label
, sizeof label
);
2621 record_constant_1 (exp
);
2622 return (struct constant_descriptor
*) obstack_finish (&permanent_obstack
);
2625 /* Add a description of constant expression EXP
2626 to the object growing in `permanent_obstack'.
2627 No need to return its address; the caller will get that
2628 from the obstack when the object is complete. */
2631 record_constant_1 (exp
)
2634 register char *strp
;
2636 register enum tree_code code
= TREE_CODE (exp
);
2638 obstack_1grow (&permanent_obstack
, (unsigned int) code
);
2643 obstack_1grow (&permanent_obstack
, TYPE_PRECISION (TREE_TYPE (exp
)));
2644 strp
= (char *) &TREE_INT_CST_LOW (exp
);
2645 len
= 2 * sizeof TREE_INT_CST_LOW (exp
);
2649 obstack_1grow (&permanent_obstack
, TYPE_PRECISION (TREE_TYPE (exp
)));
2650 strp
= (char *) &TREE_REAL_CST (exp
);
2651 len
= sizeof TREE_REAL_CST (exp
);
2655 if (flag_writable_strings
)
2658 obstack_1grow (&permanent_obstack
, TYPE_MODE (TREE_TYPE (exp
)));
2659 strp
= TREE_STRING_POINTER (exp
);
2660 len
= TREE_STRING_LENGTH (exp
);
2661 obstack_grow (&permanent_obstack
, (char *) &TREE_STRING_LENGTH (exp
),
2662 sizeof TREE_STRING_LENGTH (exp
));
2666 record_constant_1 (TREE_REALPART (exp
));
2667 record_constant_1 (TREE_IMAGPART (exp
));
2671 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2673 int nbytes
= int_size_in_bytes (TREE_TYPE (exp
));
2674 obstack_grow (&permanent_obstack
, &nbytes
, sizeof (nbytes
));
2675 obstack_blank (&permanent_obstack
, nbytes
);
2676 get_set_constructor_bytes
2677 (exp
, (unsigned char *) permanent_obstack
.next_free
-nbytes
,
2684 int length
= list_length (CONSTRUCTOR_ELTS (exp
));
2686 int have_purpose
= 0;
2688 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2689 if (TREE_PURPOSE (link
))
2692 obstack_grow (&permanent_obstack
, (char *) &length
, sizeof length
);
2694 /* For record constructors, insist that the types match.
2695 For arrays, just verify both constructors are for arrays.
2696 Then insist that either both or none have any TREE_PURPOSE
2698 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2699 type
= TREE_TYPE (exp
);
2702 obstack_grow (&permanent_obstack
, (char *) &type
, sizeof type
);
2703 obstack_grow (&permanent_obstack
, (char *) &have_purpose
,
2704 sizeof have_purpose
);
2706 /* For arrays, insist that the size in bytes match. */
2707 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2709 HOST_WIDE_INT size
= int_size_in_bytes (TREE_TYPE (exp
));
2710 obstack_grow (&permanent_obstack
, (char *) &size
, sizeof size
);
2713 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2715 if (TREE_VALUE (link
))
2716 record_constant_1 (TREE_VALUE (link
));
2721 obstack_grow (&permanent_obstack
,
2722 (char *) &zero
, sizeof zero
);
2725 if (TREE_PURPOSE (link
)
2726 && TREE_CODE (TREE_PURPOSE (link
)) == FIELD_DECL
)
2727 obstack_grow (&permanent_obstack
,
2728 (char *) &TREE_PURPOSE (link
),
2729 sizeof TREE_PURPOSE (link
));
2730 else if (TREE_PURPOSE (link
))
2731 record_constant_1 (TREE_PURPOSE (link
));
2732 else if (have_purpose
)
2736 obstack_grow (&permanent_obstack
,
2737 (char *) &zero
, sizeof zero
);
2745 struct addr_const value
;
2747 decode_addr_const (exp
, &value
);
2748 /* Record the offset. */
2749 obstack_grow (&permanent_obstack
,
2750 (char *) &value
.offset
, sizeof value
.offset
);
2751 /* Record the symbol name. */
2752 obstack_grow (&permanent_obstack
, XSTR (value
.base
, 0),
2753 strlen (XSTR (value
.base
, 0)) + 1);
2760 record_constant_1 (TREE_OPERAND (exp
, 0));
2761 record_constant_1 (TREE_OPERAND (exp
, 1));
2766 case NON_LVALUE_EXPR
:
2767 record_constant_1 (TREE_OPERAND (exp
, 0));
2774 /* Record constant contents. */
2775 obstack_grow (&permanent_obstack
, strp
, len
);
2778 /* Record a list of constant expressions that were passed to
2779 output_constant_def but that could not be output right away. */
2781 struct deferred_constant
2783 struct deferred_constant
*next
;
2789 static struct deferred_constant
*deferred_constants
;
2791 /* Another list of constants which should be output after the
2793 static struct deferred_constant
*after_function_constants
;
2795 /* Nonzero means defer output of addressed subconstants
2796 (i.e., those for which output_constant_def is called.) */
2797 static int defer_addressed_constants_flag
;
2799 /* Start deferring output of subconstants. */
2802 defer_addressed_constants ()
2804 defer_addressed_constants_flag
++;
2807 /* Stop deferring output of subconstants,
2808 and output now all those that have been deferred. */
2811 output_deferred_addressed_constants ()
2813 struct deferred_constant
*p
, *next
;
2815 defer_addressed_constants_flag
--;
2817 if (defer_addressed_constants_flag
> 0)
2820 for (p
= deferred_constants
; p
; p
= next
)
2822 output_constant_def_contents (p
->exp
, p
->reloc
, p
->labelno
);
2827 deferred_constants
= 0;
2830 /* Output any constants which should appear after a function. */
2833 output_after_function_constants ()
2835 struct deferred_constant
*p
, *next
;
2837 for (p
= after_function_constants
; p
; p
= next
)
2839 output_constant_def_contents (p
->exp
, p
->reloc
, p
->labelno
);
2844 after_function_constants
= 0;
2847 /* Make a copy of the whole tree structure for a constant.
2848 This handles the same types of nodes that compare_constant
2849 and record_constant handle. */
2855 switch (TREE_CODE (exp
))
2858 /* For ADDR_EXPR, we do not want to copy the decl whose address
2859 is requested. We do want to copy constants though. */
2860 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, 0))) == 'c')
2861 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2862 copy_constant (TREE_OPERAND (exp
, 0)));
2864 return copy_node (exp
);
2869 return copy_node (exp
);
2872 return build_complex (TREE_TYPE (exp
),
2873 copy_constant (TREE_REALPART (exp
)),
2874 copy_constant (TREE_IMAGPART (exp
)));
2878 return build (TREE_CODE (exp
), TREE_TYPE (exp
),
2879 copy_constant (TREE_OPERAND (exp
, 0)),
2880 copy_constant (TREE_OPERAND (exp
, 1)));
2884 case NON_LVALUE_EXPR
:
2885 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2886 copy_constant (TREE_OPERAND (exp
, 0)));
2890 tree copy
= copy_node (exp
);
2891 tree list
= copy_list (CONSTRUCTOR_ELTS (exp
));
2894 CONSTRUCTOR_ELTS (copy
) = list
;
2895 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
2896 TREE_VALUE (tail
) = copy_constant (TREE_VALUE (tail
));
2897 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2898 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
2899 TREE_PURPOSE (tail
) = copy_constant (TREE_PURPOSE (tail
));
2909 /* Return an rtx representing a reference to constant data in memory
2910 for the constant expression EXP.
2912 If assembler code for such a constant has already been output,
2913 return an rtx to refer to it.
2914 Otherwise, output such a constant in memory (or defer it for later)
2915 and generate an rtx for it.
2917 The TREE_CST_RTL of EXP is set up to point to that rtx.
2918 The const_hash_table records which constants already have label strings. */
2921 output_constant_def (exp
)
2925 register struct constant_descriptor
*desc
;
2931 if (TREE_CST_RTL (exp
))
2932 return TREE_CST_RTL (exp
);
2934 /* Make sure any other constants whose addresses appear in EXP
2935 are assigned label numbers. */
2937 reloc
= output_addressed_constants (exp
);
2939 /* Compute hash code of EXP. Search the descriptors for that hash code
2940 to see if any of them describes EXP. If yes, the descriptor records
2941 the label number already assigned. */
2943 hash
= const_hash (exp
) % MAX_HASH_TABLE
;
2945 for (desc
= const_hash_table
[hash
]; desc
; desc
= desc
->next
)
2946 if (compare_constant (exp
, desc
))
2948 found
= desc
->label
;
2954 /* No constant equal to EXP is known to have been output.
2955 Make a constant descriptor to enter EXP in the hash table.
2956 Assign the label number and record it in the descriptor for
2957 future calls to this function to find. */
2959 /* Create a string containing the label name, in LABEL. */
2960 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
2962 desc
= record_constant (exp
);
2963 desc
->next
= const_hash_table
[hash
];
2965 = (char *) obstack_copy0 (&permanent_obstack
, label
, strlen (label
));
2966 const_hash_table
[hash
] = desc
;
2970 /* Create a string containing the label name, in LABEL. */
2971 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
2974 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
2976 push_obstacks_nochange ();
2977 if (TREE_PERMANENT (exp
))
2978 end_temporary_allocation ();
2980 def
= gen_rtx_SYMBOL_REF (Pmode
, desc
->label
);
2983 = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp
)), def
);
2984 RTX_UNCHANGING_P (TREE_CST_RTL (exp
)) = 1;
2985 if (AGGREGATE_TYPE_P (TREE_TYPE (exp
)))
2986 MEM_SET_IN_STRUCT_P (TREE_CST_RTL (exp
), 1);
2990 /* Optionally set flags or add text to the name to record information
2991 such as that it is a function name. If the name is changed, the macro
2992 ASM_OUTPUT_LABELREF will have to know how to strip this information. */
2993 #ifdef ENCODE_SECTION_INFO
2994 ENCODE_SECTION_INFO (exp
);
2997 /* If this is the first time we've seen this particular constant,
2998 output it (or defer its output for later). */
3001 int after_function
= 0;
3003 #ifdef CONSTANT_AFTER_FUNCTION_P
3004 if (current_function_decl
!= 0
3005 && CONSTANT_AFTER_FUNCTION_P (exp
))
3009 if (defer_addressed_constants_flag
|| after_function
)
3011 struct deferred_constant
*p
;
3012 p
= (struct deferred_constant
*) xmalloc (sizeof (struct deferred_constant
));
3014 push_obstacks_nochange ();
3015 suspend_momentary ();
3016 p
->exp
= copy_constant (exp
);
3019 p
->labelno
= const_labelno
++;
3022 p
->next
= after_function_constants
;
3023 after_function_constants
= p
;
3027 p
->next
= deferred_constants
;
3028 deferred_constants
= p
;
3033 /* Do no output if -fsyntax-only. */
3034 if (! flag_syntax_only
)
3035 output_constant_def_contents (exp
, reloc
, const_labelno
);
3040 return TREE_CST_RTL (exp
);
3043 /* Now output assembler code to define the label for EXP,
3044 and follow it with the data of EXP. */
3047 output_constant_def_contents (exp
, reloc
, labelno
)
3054 if (IN_NAMED_SECTION (exp
))
3055 named_section (exp
, NULL
, reloc
);
3058 /* First switch to text section, except for writable strings. */
3059 #ifdef SELECT_SECTION
3060 SELECT_SECTION (exp
, reloc
);
3062 if (((TREE_CODE (exp
) == STRING_CST
) && flag_writable_strings
)
3063 || (flag_pic
&& reloc
))
3066 readonly_data_section ();
3070 /* Align the location counter as required by EXP's data type. */
3071 align
= TYPE_ALIGN (TREE_TYPE (exp
));
3072 #ifdef CONSTANT_ALIGNMENT
3073 align
= CONSTANT_ALIGNMENT (exp
, align
);
3076 if (align
> BITS_PER_UNIT
)
3077 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
3079 /* Output the label itself. */
3080 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LC", labelno
);
3082 /* Output the value of EXP. */
3083 output_constant (exp
,
3084 (TREE_CODE (exp
) == STRING_CST
3085 ? TREE_STRING_LENGTH (exp
)
3086 : int_size_in_bytes (TREE_TYPE (exp
))));
3090 /* Similar hash facility for making memory-constants
3091 from constant rtl-expressions. It is used on RISC machines
3092 where immediate integer arguments and constant addresses are restricted
3093 so that such constants must be stored in memory.
3095 This pool of constants is reinitialized for each function
3096 so each function gets its own constants-pool that comes right before it.
3098 All structures allocated here are discarded when functions are saved for
3099 inlining, so they do not need to be allocated permanently. */
3101 #define MAX_RTX_HASH_TABLE 61
3102 static struct constant_descriptor
**const_rtx_hash_table
;
3104 /* Structure to represent sufficient information about a constant so that
3105 it can be output when the constant pool is output, so that function
3106 integration can be done, and to simplify handling on machines that reference
3107 constant pool as base+displacement. */
3109 struct pool_constant
3111 struct constant_descriptor
*desc
;
3112 struct pool_constant
*next
;
3113 enum machine_mode mode
;
3121 /* Pointers to first and last constant in pool. */
3123 static struct pool_constant
*first_pool
, *last_pool
;
3125 /* Current offset in constant pool (does not include any machine-specific
3128 static int pool_offset
;
3130 /* Structure used to maintain hash table mapping symbols used to their
3131 corresponding constants. */
3136 struct pool_constant
*pool
;
3137 struct pool_sym
*next
;
3140 static struct pool_sym
**const_rtx_sym_hash_table
;
3142 /* Hash code for a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true.
3143 The argument is XSTR (... , 0) */
3145 #define SYMHASH(LABEL) \
3146 ((((unsigned long) (LABEL)) & ((1 << HASHBITS) - 1)) % MAX_RTX_HASH_TABLE)
3148 /* Initialize constant pool hashing for next function. */
3151 init_const_rtx_hash_table ()
3153 const_rtx_hash_table
3154 = ((struct constant_descriptor
**)
3155 oballoc (MAX_RTX_HASH_TABLE
* sizeof (struct constant_descriptor
*)));
3156 const_rtx_sym_hash_table
3157 = ((struct pool_sym
**)
3158 oballoc (MAX_RTX_HASH_TABLE
* sizeof (struct pool_sym
*)));
3159 bzero ((char *) const_rtx_hash_table
,
3160 MAX_RTX_HASH_TABLE
* sizeof (struct constant_descriptor
*));
3161 bzero ((char *) const_rtx_sym_hash_table
,
3162 MAX_RTX_HASH_TABLE
* sizeof (struct pool_sym
*));
3164 first_pool
= last_pool
= 0;
3168 /* Save and restore status for a nested function. */
3171 save_varasm_status (p
, context
)
3175 p
->const_rtx_hash_table
= const_rtx_hash_table
;
3176 p
->const_rtx_sym_hash_table
= const_rtx_sym_hash_table
;
3177 p
->first_pool
= first_pool
;
3178 p
->last_pool
= last_pool
;
3179 p
->pool_offset
= pool_offset
;
3180 p
->const_double_chain
= const_double_chain
;
3182 /* If we are pushing to toplevel, we can't reuse const_double_chain. */
3183 if (context
== NULL_TREE
)
3184 const_double_chain
= 0;
3188 restore_varasm_status (p
)
3191 const_rtx_hash_table
= p
->const_rtx_hash_table
;
3192 const_rtx_sym_hash_table
= p
->const_rtx_sym_hash_table
;
3193 first_pool
= p
->first_pool
;
3194 last_pool
= p
->last_pool
;
3195 pool_offset
= p
->pool_offset
;
3196 const_double_chain
= p
->const_double_chain
;
3199 enum kind
{ RTX_DOUBLE
, RTX_INT
};
3203 #ifdef ONLY_INT_FIELDS
3204 unsigned int kind
: 16;
3205 unsigned int mode
: 16;
3207 enum kind kind
: 16;
3208 enum machine_mode mode
: 16;
3211 union real_extract du
;
3212 struct addr_const addr
;
3213 struct {HOST_WIDE_INT high
, low
;} di
;
3217 /* Express an rtx for a constant integer (perhaps symbolic)
3218 as the sum of a symbol or label plus an explicit integer.
3219 They are stored into VALUE. */
3222 decode_rtx_const (mode
, x
, value
)
3223 enum machine_mode mode
;
3225 struct rtx_const
*value
;
3227 /* Clear the whole structure, including any gaps. */
3230 int *p
= (int *) value
;
3231 int *end
= (int *) (value
+ 1);
3236 value
->kind
= RTX_INT
; /* Most usual kind. */
3239 switch (GET_CODE (x
))
3242 value
->kind
= RTX_DOUBLE
;
3243 if (GET_MODE (x
) != VOIDmode
)
3245 value
->mode
= GET_MODE (x
);
3246 bcopy ((char *) &CONST_DOUBLE_LOW (x
),
3247 (char *) &value
->un
.du
, sizeof value
->un
.du
);
3251 value
->un
.di
.low
= CONST_DOUBLE_LOW (x
);
3252 value
->un
.di
.high
= CONST_DOUBLE_HIGH (x
);
3257 value
->un
.addr
.offset
= INTVAL (x
);
3263 value
->un
.addr
.base
= x
;
3268 if (GET_CODE (x
) == PLUS
)
3270 value
->un
.addr
.base
= XEXP (x
, 0);
3271 if (GET_CODE (XEXP (x
, 1)) != CONST_INT
)
3273 value
->un
.addr
.offset
= INTVAL (XEXP (x
, 1));
3275 else if (GET_CODE (x
) == MINUS
)
3277 value
->un
.addr
.base
= XEXP (x
, 0);
3278 if (GET_CODE (XEXP (x
, 1)) != CONST_INT
)
3280 value
->un
.addr
.offset
= - INTVAL (XEXP (x
, 1));
3290 if (value
->kind
== RTX_INT
&& value
->un
.addr
.base
!= 0)
3291 switch (GET_CODE (value
->un
.addr
.base
))
3295 /* Use the string's address, not the SYMBOL_REF's address,
3296 for the sake of addresses of library routines.
3297 For a LABEL_REF, compare labels. */
3298 value
->un
.addr
.base
= XEXP (value
->un
.addr
.base
, 0);
3305 /* Given a MINUS expression, simplify it if both sides
3306 include the same symbol. */
3309 simplify_subtraction (x
)
3312 struct rtx_const val0
, val1
;
3314 decode_rtx_const (GET_MODE (x
), XEXP (x
, 0), &val0
);
3315 decode_rtx_const (GET_MODE (x
), XEXP (x
, 1), &val1
);
3317 if (val0
.un
.addr
.base
== val1
.un
.addr
.base
)
3318 return GEN_INT (val0
.un
.addr
.offset
- val1
.un
.addr
.offset
);
3322 /* Compute a hash code for a constant RTL expression. */
3325 const_hash_rtx (mode
, x
)
3326 enum machine_mode mode
;
3332 struct rtx_const value
;
3333 decode_rtx_const (mode
, x
, &value
);
3335 /* Compute hashing function */
3337 for (i
= 0; i
< sizeof value
/ sizeof (int); i
++)
3338 hi
+= ((int *) &value
)[i
];
3340 hi
&= (1 << HASHBITS
) - 1;
3341 hi
%= MAX_RTX_HASH_TABLE
;
3345 /* Compare a constant rtl object X with a constant-descriptor DESC.
3346 Return 1 if DESC describes a constant with the same value as X. */
3349 compare_constant_rtx (mode
, x
, desc
)
3350 enum machine_mode mode
;
3352 struct constant_descriptor
*desc
;
3354 register int *p
= (int *) desc
->contents
;
3357 struct rtx_const value
;
3359 decode_rtx_const (mode
, x
, &value
);
3360 strp
= (int *) &value
;
3361 len
= sizeof value
/ sizeof (int);
3363 /* Compare constant contents. */
3365 if (*p
++ != *strp
++)
3371 /* Construct a constant descriptor for the rtl-expression X.
3372 It is up to the caller to enter the descriptor in the hash table. */
3374 static struct constant_descriptor
*
3375 record_constant_rtx (mode
, x
)
3376 enum machine_mode mode
;
3379 struct constant_descriptor
*ptr
;
3381 struct rtx_const value
;
3383 decode_rtx_const (mode
, x
, &value
);
3385 /* Put these things in the saveable obstack so we can ensure it won't
3386 be freed if we are called from combine or some other phase that discards
3387 memory allocated from function_obstack (current_obstack). */
3388 obstack_grow (saveable_obstack
, &ptr
, sizeof ptr
);
3389 obstack_grow (saveable_obstack
, &label
, sizeof label
);
3391 /* Record constant contents. */
3392 obstack_grow (saveable_obstack
, &value
, sizeof value
);
3394 return (struct constant_descriptor
*) obstack_finish (saveable_obstack
);
3397 /* Given a constant rtx X, make (or find) a memory constant for its value
3398 and return a MEM rtx to refer to it in memory. */
3401 force_const_mem (mode
, x
)
3402 enum machine_mode mode
;
3406 register struct constant_descriptor
*desc
;
3411 /* If we want this CONST_DOUBLE in the same mode as it is in memory
3412 (this will always be true for floating CONST_DOUBLEs that have been
3413 placed in memory, but not for VOIDmode (integer) CONST_DOUBLEs),
3414 use the previous copy. Otherwise, make a new one. Note that in
3415 the unlikely event that this same CONST_DOUBLE is used in two different
3416 modes in an alternating fashion, we will allocate a lot of different
3417 memory locations, but this should be extremely rare. */
3419 /* Don't use CONST_DOUBLE_MEM in a nested function.
3420 Nested functions have their own constant pools,
3421 so they can't share the same values in CONST_DOUBLE_MEM
3422 with the containing function. */
3423 if (outer_function_chain
== 0)
3424 if (GET_CODE (x
) == CONST_DOUBLE
3425 && GET_CODE (CONST_DOUBLE_MEM (x
)) == MEM
3426 && GET_MODE (CONST_DOUBLE_MEM (x
)) == mode
)
3427 return CONST_DOUBLE_MEM (x
);
3429 /* Compute hash code of X. Search the descriptors for that hash code
3430 to see if any of them describes X. If yes, the descriptor records
3431 the label number already assigned. */
3433 hash
= const_hash_rtx (mode
, x
);
3435 for (desc
= const_rtx_hash_table
[hash
]; desc
; desc
= desc
->next
)
3436 if (compare_constant_rtx (mode
, x
, desc
))
3438 found
= desc
->label
;
3444 register struct pool_constant
*pool
;
3445 register struct pool_sym
*sym
;
3448 /* No constant equal to X is known to have been output.
3449 Make a constant descriptor to enter X in the hash table.
3450 Assign the label number and record it in the descriptor for
3451 future calls to this function to find. */
3453 desc
= record_constant_rtx (mode
, x
);
3454 desc
->next
= const_rtx_hash_table
[hash
];
3455 const_rtx_hash_table
[hash
] = desc
;
3457 /* Align the location counter as required by EXP's data type. */
3458 align
= (mode
== VOIDmode
) ? UNITS_PER_WORD
: GET_MODE_SIZE (mode
);
3459 if (align
> BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
3460 align
= BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
;
3461 #ifdef CONSTANT_ALIGNMENT
3462 align
= CONSTANT_ALIGNMENT (make_tree (type_for_mode (mode
, 0), x
),
3463 align
* BITS_PER_UNIT
) / BITS_PER_UNIT
;
3466 pool_offset
+= align
- 1;
3467 pool_offset
&= ~ (align
- 1);
3469 /* If RTL is not being placed into the saveable obstack, make a
3470 copy of X that is in the saveable obstack in case we are
3471 being called from combine or some other phase that discards
3472 memory it allocates. We used to only do this if it is a
3473 CONST; however, reload can allocate a CONST_INT when
3474 eliminating registers. */
3475 if (rtl_obstack
!= saveable_obstack
3476 && (GET_CODE (x
) == CONST
|| GET_CODE (x
) == CONST_INT
))
3478 push_obstacks_nochange ();
3479 rtl_in_saveable_obstack ();
3481 if (GET_CODE (x
) == CONST
)
3482 x
= gen_rtx_CONST (GET_MODE (x
),
3483 gen_rtx_PLUS (GET_MODE (x
),
3484 XEXP (XEXP (x
, 0), 0),
3485 XEXP (XEXP (x
, 0), 1)));
3487 x
= GEN_INT (INTVAL (x
));
3492 /* Allocate a pool constant descriptor, fill it in, and chain it in. */
3494 pool
= (struct pool_constant
*) savealloc (sizeof (struct pool_constant
));
3498 pool
->labelno
= const_labelno
;
3499 pool
->align
= align
;
3500 pool
->offset
= pool_offset
;
3507 last_pool
->next
= pool
;
3510 pool_offset
+= GET_MODE_SIZE (mode
);
3512 /* Create a string containing the label name, in LABEL. */
3513 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
3518 = (char *) obstack_copy0 (saveable_obstack
, label
, strlen (label
));
3520 /* Add label to symbol hash table. */
3521 hash
= SYMHASH (found
);
3522 sym
= (struct pool_sym
*) savealloc (sizeof (struct pool_sym
));
3525 sym
->next
= const_rtx_sym_hash_table
[hash
];
3526 const_rtx_sym_hash_table
[hash
] = sym
;
3529 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
3531 def
= gen_rtx_MEM (mode
, gen_rtx_SYMBOL_REF (Pmode
, found
));
3533 RTX_UNCHANGING_P (def
) = 1;
3534 /* Mark the symbol_ref as belonging to this constants pool. */
3535 CONSTANT_POOL_ADDRESS_P (XEXP (def
, 0)) = 1;
3536 current_function_uses_const_pool
= 1;
3538 if (outer_function_chain
== 0)
3539 if (GET_CODE (x
) == CONST_DOUBLE
)
3541 if (CONST_DOUBLE_MEM (x
) == cc0_rtx
)
3543 CONST_DOUBLE_CHAIN (x
) = const_double_chain
;
3544 const_double_chain
= x
;
3546 CONST_DOUBLE_MEM (x
) = def
;
3552 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
3553 the corresponding pool_constant structure. */
3555 static struct pool_constant
*
3556 find_pool_constant (addr
)
3559 struct pool_sym
*sym
;
3560 char *label
= XSTR (addr
, 0);
3562 for (sym
= const_rtx_sym_hash_table
[SYMHASH (label
)]; sym
; sym
= sym
->next
)
3563 if (sym
->label
== label
)
3569 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
3572 get_pool_constant (addr
)
3575 return (find_pool_constant (addr
))->constant
;
3578 /* Similar, return the mode. */
3581 get_pool_mode (addr
)
3584 return (find_pool_constant (addr
))->mode
;
3587 /* Similar, return the offset in the constant pool. */
3590 get_pool_offset (addr
)
3593 return (find_pool_constant (addr
))->offset
;
3596 /* Return the size of the constant pool. */
3604 /* Write all the constants in the constant pool. */
3607 output_constant_pool (fnname
, fndecl
)
3608 char *fnname ATTRIBUTE_UNUSED
;
3609 tree fndecl ATTRIBUTE_UNUSED
;
3611 struct pool_constant
*pool
;
3613 union real_extract u
;
3615 /* It is possible for gcc to call force_const_mem and then to later
3616 discard the instructions which refer to the constant. In such a
3617 case we do not need to output the constant. */
3618 if (optimize
>= 0 && flag_expensive_optimizations
)
3619 mark_constant_pool ();
3621 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3622 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3625 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3632 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3633 whose CODE_LABEL has been deleted. This can occur if a jump table
3634 is eliminated by optimization. If so, write a constant of zero
3635 instead. Note that this can also happen by turning the
3636 CODE_LABEL into a NOTE. */
3637 if (((GET_CODE (x
) == LABEL_REF
3638 && (INSN_DELETED_P (XEXP (x
, 0))
3639 || GET_CODE (XEXP (x
, 0)) == NOTE
)))
3640 || (GET_CODE (x
) == CONST
&& GET_CODE (XEXP (x
, 0)) == PLUS
3641 && GET_CODE (XEXP (XEXP (x
, 0), 0)) == LABEL_REF
3642 && (INSN_DELETED_P (XEXP (XEXP (XEXP (x
, 0), 0), 0))
3643 || GET_CODE (XEXP (XEXP (XEXP (x
, 0), 0), 0)) == NOTE
)))
3646 /* First switch to correct section. */
3647 #ifdef SELECT_RTX_SECTION
3648 SELECT_RTX_SECTION (pool
->mode
, x
);
3650 readonly_data_section ();
3653 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3654 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file
, x
, pool
->mode
,
3655 pool
->align
, pool
->labelno
, done
);
3658 if (pool
->align
> 1)
3659 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (pool
->align
));
3661 /* Output the label. */
3662 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LC", pool
->labelno
);
3664 /* Output the value of the constant itself. */
3665 switch (GET_MODE_CLASS (pool
->mode
))
3668 if (GET_CODE (x
) != CONST_DOUBLE
)
3671 bcopy ((char *) &CONST_DOUBLE_LOW (x
), (char *) &u
, sizeof u
);
3672 assemble_real (u
.d
, pool
->mode
);
3676 case MODE_PARTIAL_INT
:
3677 assemble_integer (x
, GET_MODE_SIZE (pool
->mode
), 1);
3684 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3690 #ifdef ASM_OUTPUT_POOL_EPILOGUE
3691 ASM_OUTPUT_POOL_EPILOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3694 /* Done with this pool. */
3695 first_pool
= last_pool
= 0;
3698 /* Look through the instructions for this function, and mark all the
3699 entries in the constant pool which are actually being used. */
3702 mark_constant_pool ()
3705 struct pool_constant
*pool
;
3707 if (first_pool
== 0)
3710 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3713 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
3714 if (GET_RTX_CLASS (GET_CODE (insn
)) == 'i')
3715 mark_constants (PATTERN (insn
));
3717 for (insn
= current_function_epilogue_delay_list
;
3719 insn
= XEXP (insn
, 1))
3720 if (GET_RTX_CLASS (GET_CODE (insn
)) == 'i')
3721 mark_constants (PATTERN (insn
));
3729 register char *format_ptr
;
3734 if (GET_CODE (x
) == SYMBOL_REF
)
3736 if (CONSTANT_POOL_ADDRESS_P (x
))
3737 find_pool_constant (x
)->mark
= 1;
3740 /* Never search inside a CONST_DOUBLE, because CONST_DOUBLE_MEM may be
3741 a MEM, but does not constitute a use of that MEM. This is particularly
3742 important inside a nested function, because CONST_DOUBLE_MEM may be
3743 a reference to a MEM in the parent's constant pool. See the comment
3744 in force_const_mem. */
3745 else if (GET_CODE (x
) == CONST_DOUBLE
)
3748 /* Insns may appear inside a SEQUENCE. Only check the patterns of
3749 insns, not any notes that may be attached. We don't want to mark
3750 a constant just because it happens to appear in a REG_EQUIV note. */
3751 if (GET_RTX_CLASS (GET_CODE (x
)) == 'i')
3753 mark_constants (PATTERN (x
));
3757 format_ptr
= GET_RTX_FORMAT (GET_CODE (x
));
3759 for (i
= 0; i
< GET_RTX_LENGTH (GET_CODE (x
)); i
++)
3761 switch (*format_ptr
++)
3764 mark_constants (XEXP (x
, i
));
3768 if (XVEC (x
, i
) != 0)
3772 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
3773 mark_constants (XVECEXP (x
, i
, j
));
3792 /* Find all the constants whose addresses are referenced inside of EXP,
3793 and make sure assembler code with a label has been output for each one.
3794 Indicate whether an ADDR_EXPR has been encountered. */
3797 output_addressed_constants (exp
)
3802 switch (TREE_CODE (exp
))
3806 register tree constant
= TREE_OPERAND (exp
, 0);
3808 while (TREE_CODE (constant
) == COMPONENT_REF
)
3810 constant
= TREE_OPERAND (constant
, 0);
3813 if (TREE_CODE_CLASS (TREE_CODE (constant
)) == 'c'
3814 || TREE_CODE (constant
) == CONSTRUCTOR
)
3815 /* No need to do anything here
3816 for addresses of variables or functions. */
3817 output_constant_def (constant
);
3824 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
3825 reloc
|= output_addressed_constants (TREE_OPERAND (exp
, 1));
3830 case NON_LVALUE_EXPR
:
3831 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
3837 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
3838 if (TREE_VALUE (link
) != 0)
3839 reloc
|= output_addressed_constants (TREE_VALUE (link
));
3849 /* Output assembler code for constant EXP to FILE, with no label.
3850 This includes the pseudo-op such as ".int" or ".byte", and a newline.
3851 Assumes output_addressed_constants has been done on EXP already.
3853 Generate exactly SIZE bytes of assembler data, padding at the end
3854 with zeros if necessary. SIZE must always be specified.
3856 SIZE is important for structure constructors,
3857 since trailing members may have been omitted from the constructor.
3858 It is also important for initialization of arrays from string constants
3859 since the full length of the string constant might not be wanted.
3860 It is also needed for initialization of unions, where the initializer's
3861 type is just one member, and that may not be as long as the union.
3863 There a case in which we would fail to output exactly SIZE bytes:
3864 for a structure constructor that wants to produce more than SIZE bytes.
3865 But such constructors will never be generated for any possible input. */
3868 output_constant (exp
, size
)
3872 register enum tree_code code
= TREE_CODE (TREE_TYPE (exp
));
3877 /* Eliminate the NON_LVALUE_EXPR_EXPR that makes a cast not be an lvalue.
3878 That way we get the constant (we hope) inside it. Also, strip off any
3879 NOP_EXPR that converts between two record, union, array, or set types. */
3880 while ((TREE_CODE (exp
) == NOP_EXPR
3881 && (TREE_TYPE (exp
) == TREE_TYPE (TREE_OPERAND (exp
, 0))
3882 || AGGREGATE_TYPE_P (TREE_TYPE (exp
))))
3883 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
3884 exp
= TREE_OPERAND (exp
, 0);
3886 /* Allow a constructor with no elements for any data type.
3887 This means to fill the space with zeros. */
3888 if (TREE_CODE (exp
) == CONSTRUCTOR
&& CONSTRUCTOR_ELTS (exp
) == 0)
3890 assemble_zeros (size
);
3901 case REFERENCE_TYPE
:
3902 /* ??? What about (int)((float)(int)&foo + 4) */
3903 while (TREE_CODE (exp
) == NOP_EXPR
|| TREE_CODE (exp
) == CONVERT_EXPR
3904 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
3905 exp
= TREE_OPERAND (exp
, 0);
3907 if (! assemble_integer (expand_expr (exp
, NULL_RTX
, VOIDmode
,
3908 EXPAND_INITIALIZER
),
3910 error ("initializer for integer value is too complicated");
3915 if (TREE_CODE (exp
) != REAL_CST
)
3916 error ("initializer for floating value is not a floating constant");
3918 assemble_real (TREE_REAL_CST (exp
),
3919 mode_for_size (size
* BITS_PER_UNIT
, MODE_FLOAT
, 0));
3924 output_constant (TREE_REALPART (exp
), size
/ 2);
3925 output_constant (TREE_IMAGPART (exp
), size
/ 2);
3926 size
-= (size
/ 2) * 2;
3930 if (TREE_CODE (exp
) == CONSTRUCTOR
)
3932 output_constructor (exp
, size
);
3935 else if (TREE_CODE (exp
) == STRING_CST
)
3939 if (size
> TREE_STRING_LENGTH (exp
))
3941 excess
= size
- TREE_STRING_LENGTH (exp
);
3942 size
= TREE_STRING_LENGTH (exp
);
3945 assemble_string (TREE_STRING_POINTER (exp
), size
);
3954 if (TREE_CODE (exp
) == CONSTRUCTOR
)
3955 output_constructor (exp
, size
);
3961 if (TREE_CODE (exp
) == INTEGER_CST
)
3962 assemble_integer (expand_expr (exp
, NULL_RTX
,
3963 VOIDmode
, EXPAND_INITIALIZER
),
3965 else if (TREE_CODE (exp
) == CONSTRUCTOR
)
3967 unsigned char *buffer
= (unsigned char *) alloca (size
);
3968 if (get_set_constructor_bytes (exp
, buffer
, size
))
3970 assemble_string ((char *) buffer
, size
);
3973 error ("unknown set constructor type");
3981 assemble_zeros (size
);
3985 /* Subroutine of output_constant, used for CONSTRUCTORs
3986 (aggregate constants).
3987 Generate at least SIZE bytes, padding if necessary. */
3990 output_constructor (exp
, size
)
3994 register tree link
, field
= 0;
3995 HOST_WIDE_INT min_index
= 0;
3996 /* Number of bytes output or skipped so far.
3997 In other words, current position within the constructor. */
3998 int total_bytes
= 0;
3999 /* Non-zero means BYTE contains part of a byte, to be output. */
4000 int byte_buffer_in_use
= 0;
4003 if (HOST_BITS_PER_WIDE_INT
< BITS_PER_UNIT
)
4006 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
4007 field
= TYPE_FIELDS (TREE_TYPE (exp
));
4009 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
4010 && TYPE_DOMAIN (TREE_TYPE (exp
)) != 0)
4012 = TREE_INT_CST_LOW (TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (exp
))));
4014 /* As LINK goes through the elements of the constant,
4015 FIELD goes through the structure fields, if the constant is a structure.
4016 if the constant is a union, then we override this,
4017 by getting the field from the TREE_LIST element.
4018 But the constant could also be an array. Then FIELD is zero.
4020 There is always a maximum of one element in the chain LINK for unions
4021 (even if the initializer in a source program incorrectly contains
4023 for (link
= CONSTRUCTOR_ELTS (exp
);
4025 link
= TREE_CHAIN (link
),
4026 field
= field
? TREE_CHAIN (field
) : 0)
4028 tree val
= TREE_VALUE (link
);
4031 /* the element in a union constructor specifies the proper field. */
4033 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
4034 || TREE_CODE (TREE_TYPE (exp
)) == UNION_TYPE
)
4036 /* if available, use the type given by link */
4037 if (TREE_PURPOSE (link
) != 0)
4038 field
= TREE_PURPOSE (link
);
4041 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
4042 index
= TREE_PURPOSE (link
);
4044 /* Eliminate the marker that makes a cast not be an lvalue. */
4048 if (index
&& TREE_CODE (index
) == RANGE_EXPR
)
4050 register int fieldsize
4051 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (exp
)));
4052 HOST_WIDE_INT lo_index
= TREE_INT_CST_LOW (TREE_OPERAND (index
, 0));
4053 HOST_WIDE_INT hi_index
= TREE_INT_CST_LOW (TREE_OPERAND (index
, 1));
4054 HOST_WIDE_INT index
;
4055 for (index
= lo_index
; index
<= hi_index
; index
++)
4057 /* Output the element's initial value. */
4059 assemble_zeros (fieldsize
);
4061 output_constant (val
, fieldsize
);
4063 /* Count its size. */
4064 total_bytes
+= fieldsize
;
4067 else if (field
== 0 || !DECL_BIT_FIELD (field
))
4069 /* An element that is not a bit-field. */
4071 register int fieldsize
;
4072 /* Since this structure is static,
4073 we know the positions are constant. */
4074 int bitpos
= (field
? (TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field
))
4078 bitpos
= (TREE_INT_CST_LOW (TYPE_SIZE (TREE_TYPE (val
)))
4080 * (TREE_INT_CST_LOW (index
) - min_index
));
4082 /* Output any buffered-up bit-fields preceding this element. */
4083 if (byte_buffer_in_use
)
4085 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4087 byte_buffer_in_use
= 0;
4090 /* Advance to offset of this element.
4091 Note no alignment needed in an array, since that is guaranteed
4092 if each element has the proper size. */
4093 if ((field
!= 0 || index
!= 0) && bitpos
!= total_bytes
)
4095 assemble_zeros (bitpos
- total_bytes
);
4096 total_bytes
= bitpos
;
4099 /* Determine size this element should occupy. */
4102 if (TREE_CODE (DECL_SIZE (field
)) != INTEGER_CST
)
4104 if (TREE_INT_CST_LOW (DECL_SIZE (field
)) > 100000)
4106 /* This avoids overflow trouble. */
4107 tree size_tree
= size_binop (CEIL_DIV_EXPR
,
4109 size_int (BITS_PER_UNIT
));
4110 fieldsize
= TREE_INT_CST_LOW (size_tree
);
4114 fieldsize
= TREE_INT_CST_LOW (DECL_SIZE (field
));
4115 fieldsize
= (fieldsize
+ BITS_PER_UNIT
- 1) / BITS_PER_UNIT
;
4119 fieldsize
= int_size_in_bytes (TREE_TYPE (TREE_TYPE (exp
)));
4121 /* Output the element's initial value. */
4123 assemble_zeros (fieldsize
);
4125 output_constant (val
, fieldsize
);
4127 /* Count its size. */
4128 total_bytes
+= fieldsize
;
4130 else if (val
!= 0 && TREE_CODE (val
) != INTEGER_CST
)
4131 error ("invalid initial value for member `%s'",
4132 IDENTIFIER_POINTER (DECL_NAME (field
)));
4135 /* Element that is a bit-field. */
4137 int next_offset
= TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field
));
4139 = (next_offset
+ TREE_INT_CST_LOW (DECL_SIZE (field
)));
4142 val
= integer_zero_node
;
4144 /* If this field does not start in this (or, next) byte,
4146 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4148 /* Output remnant of any bit field in previous bytes. */
4149 if (byte_buffer_in_use
)
4151 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4153 byte_buffer_in_use
= 0;
4156 /* If still not at proper byte, advance to there. */
4157 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4159 assemble_zeros (next_offset
/ BITS_PER_UNIT
- total_bytes
);
4160 total_bytes
= next_offset
/ BITS_PER_UNIT
;
4164 if (! byte_buffer_in_use
)
4167 /* We must split the element into pieces that fall within
4168 separate bytes, and combine each byte with previous or
4169 following bit-fields. */
4171 /* next_offset is the offset n fbits from the beginning of
4172 the structure to the next bit of this element to be processed.
4173 end_offset is the offset of the first bit past the end of
4175 while (next_offset
< end_offset
)
4179 HOST_WIDE_INT value
;
4180 int next_byte
= next_offset
/ BITS_PER_UNIT
;
4181 int next_bit
= next_offset
% BITS_PER_UNIT
;
4183 /* Advance from byte to byte
4184 within this element when necessary. */
4185 while (next_byte
!= total_bytes
)
4187 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4192 /* Number of bits we can process at once
4193 (all part of the same byte). */
4194 this_time
= MIN (end_offset
- next_offset
,
4195 BITS_PER_UNIT
- next_bit
);
4196 if (BYTES_BIG_ENDIAN
)
4198 /* On big-endian machine, take the most significant bits
4199 first (of the bits that are significant)
4200 and put them into bytes from the most significant end. */
4201 shift
= end_offset
- next_offset
- this_time
;
4202 /* Don't try to take a bunch of bits that cross
4203 the word boundary in the INTEGER_CST. */
4204 if (shift
< HOST_BITS_PER_WIDE_INT
4205 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4207 this_time
-= (HOST_BITS_PER_WIDE_INT
- shift
);
4208 shift
= HOST_BITS_PER_WIDE_INT
;
4211 /* Now get the bits from the appropriate constant word. */
4212 if (shift
< HOST_BITS_PER_WIDE_INT
)
4214 value
= TREE_INT_CST_LOW (val
);
4216 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4218 value
= TREE_INT_CST_HIGH (val
);
4219 shift
-= HOST_BITS_PER_WIDE_INT
;
4223 byte
|= (((value
>> shift
)
4224 & (((HOST_WIDE_INT
) 1 << this_time
) - 1))
4225 << (BITS_PER_UNIT
- this_time
- next_bit
));
4229 /* On little-endian machines,
4230 take first the least significant bits of the value
4231 and pack them starting at the least significant
4232 bits of the bytes. */
4233 shift
= (next_offset
4234 - TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field
)));
4235 /* Don't try to take a bunch of bits that cross
4236 the word boundary in the INTEGER_CST. */
4237 if (shift
< HOST_BITS_PER_WIDE_INT
4238 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4240 this_time
-= (HOST_BITS_PER_WIDE_INT
- shift
);
4241 shift
= HOST_BITS_PER_WIDE_INT
;
4244 /* Now get the bits from the appropriate constant word. */
4245 if (shift
< HOST_BITS_PER_WIDE_INT
)
4246 value
= TREE_INT_CST_LOW (val
);
4247 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4249 value
= TREE_INT_CST_HIGH (val
);
4250 shift
-= HOST_BITS_PER_WIDE_INT
;
4254 byte
|= (((value
>> shift
)
4255 & (((HOST_WIDE_INT
) 1 << this_time
) - 1))
4258 next_offset
+= this_time
;
4259 byte_buffer_in_use
= 1;
4263 if (byte_buffer_in_use
)
4265 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4268 if (total_bytes
< size
)
4269 assemble_zeros (size
- total_bytes
);
4272 #ifdef HANDLE_PRAGMA_WEAK
4273 /* Add function NAME to the weak symbols list. VALUE is a weak alias
4274 associatd with NAME. */
4277 add_weak (name
, value
)
4281 struct weak_syms
*weak
;
4283 weak
= (struct weak_syms
*) permalloc (sizeof (struct weak_syms
));
4288 weak
->next
= weak_decls
;
4290 weak
->value
= value
;
4295 #endif /* HANDLE_PRAGMA_WEAK */
4297 /* Declare DECL to be a weak symbol. */
4303 if (! TREE_PUBLIC (decl
))
4304 error_with_decl (decl
, "weak declaration of `%s' must be public");
4305 else if (TREE_ASM_WRITTEN (decl
))
4306 error_with_decl (decl
, "weak declaration of `%s' must precede definition");
4307 else if (SUPPORTS_WEAK
)
4308 DECL_WEAK (decl
) = 1;
4309 #ifdef HANDLE_PRAGMA_WEAK
4310 add_weak (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)), NULL
);
4314 /* Emit any pending weak declarations. */
4316 #ifdef HANDLE_PRAGMA_WEAK
4317 struct weak_syms
* weak_decls
;
4323 #ifdef HANDLE_PRAGMA_WEAK
4324 if (HANDLE_PRAGMA_WEAK
)
4326 struct weak_syms
*t
;
4327 for (t
= weak_decls
; t
; t
= t
->next
)
4329 ASM_WEAKEN_LABEL (asm_out_file
, t
->name
);
4331 ASM_OUTPUT_DEF (asm_out_file
, t
->name
, t
->value
);
4338 assemble_alias (decl
, target
)
4343 make_decl_rtl (decl
, (char *) 0, 1);
4344 name
= XSTR (XEXP (DECL_RTL (decl
), 0), 0);
4346 #ifdef ASM_OUTPUT_DEF
4347 /* Make name accessible from other files, if appropriate. */
4349 if (TREE_PUBLIC (decl
))
4351 #ifdef ASM_WEAKEN_LABEL
4352 if (DECL_WEAK (decl
))
4353 ASM_WEAKEN_LABEL (asm_out_file
, name
);
4356 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
4359 ASM_OUTPUT_DEF (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4360 TREE_ASM_WRITTEN (decl
) = 1;
4362 #ifdef ASM_OUTPUT_WEAK_ALIAS
4363 if (! DECL_WEAK (decl
))
4364 warning ("only weak aliases are supported in this configuration");
4366 ASM_OUTPUT_WEAK_ALIAS (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4367 TREE_ASM_WRITTEN (decl
) = 1;
4369 warning ("alias definitions not supported in this configuration; ignored");
4374 /* This determines whether or not we support link-once semantics. */
4375 #ifndef SUPPORTS_ONE_ONLY
4376 #ifdef MAKE_DECL_ONE_ONLY
4377 #define SUPPORTS_ONE_ONLY 1
4379 #define SUPPORTS_ONE_ONLY 0
4383 /* Returns 1 if the target configuration supports defining public symbols
4384 so that one of them will be chosen at link time instead of generating a
4385 multiply-defined symbol error, whether through the use of weak symbols or
4386 a target-specific mechanism for having duplicates discarded. */
4389 supports_one_only ()
4391 if (SUPPORTS_ONE_ONLY
)
4393 return SUPPORTS_WEAK
;
4396 /* Set up DECL as a public symbol that can be defined in multiple
4397 translation units without generating a linker error. */
4400 make_decl_one_only (decl
)
4403 if (TREE_CODE (decl
) != VAR_DECL
&& TREE_CODE (decl
) != FUNCTION_DECL
)
4406 TREE_PUBLIC (decl
) = 1;
4408 if (TREE_CODE (decl
) == VAR_DECL
4409 && (DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
))
4410 DECL_COMMON (decl
) = 1;
4411 else if (SUPPORTS_ONE_ONLY
)
4413 #ifdef MAKE_DECL_ONE_ONLY
4414 MAKE_DECL_ONE_ONLY (decl
);
4416 DECL_ONE_ONLY (decl
) = 1;
4418 else if (SUPPORTS_WEAK
)
4419 DECL_WEAK (decl
) = 1;