1 /* Output variables, constants and external declarations, for GNU compiler.
2 Copyright (C) 1987, 88, 89, 92-97, 1998 Free Software Foundation, Inc.
4 This file is part of GNU CC.
6 GNU CC is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2, or (at your option)
11 GNU CC is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with GNU CC; see the file COPYING. If not, write to
18 the Free Software Foundation, 59 Temple Place - Suite 330,
19 Boston, MA 02111-1307, USA. */
22 /* This file handles generation of all the assembler code
23 *except* the instructions of a function.
24 This includes declarations of variables and their initial values.
26 We also output the assembler code for constants stored in memory
27 and are responsible for combining constants with the same value. */
32 /* #include <stab.h> */
40 #include "hard-reg-set.h"
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
;
120 #ifdef HANDLE_PRAGMA_WEAK
121 /* Any weak symbol declarations waiting to be emitted. */
125 struct weak_syms
*next
;
130 static struct weak_syms
*weak_decls
;
133 /* Nonzero if at least one function definition has been seen. */
135 static int function_defined
;
138 struct constant_descriptor
;
140 struct pool_constant
;
142 static char *strip_reg_name
PROTO((char *));
143 static int contains_pointers_p
PROTO((tree
));
144 static void decode_addr_const
PROTO((tree
, struct addr_const
*));
145 static int const_hash
PROTO((tree
));
146 static int compare_constant
PROTO((tree
,
147 struct constant_descriptor
*));
148 static char *compare_constant_1
PROTO((tree
, char *));
149 static struct constant_descriptor
*record_constant
PROTO((tree
));
150 static void record_constant_1
PROTO((tree
));
151 static tree copy_constant
PROTO((tree
));
152 static void output_constant_def_contents
PROTO((tree
, int, int));
153 static void decode_rtx_const
PROTO((enum machine_mode
, rtx
,
154 struct rtx_const
*));
155 static int const_hash_rtx
PROTO((enum machine_mode
, rtx
));
156 static int compare_constant_rtx
PROTO((enum machine_mode
, rtx
,
157 struct constant_descriptor
*));
158 static struct constant_descriptor
*record_constant_rtx
PROTO((enum machine_mode
,
160 static struct pool_constant
*find_pool_constant
PROTO((rtx
));
161 static void mark_constant_pool
PROTO((void));
162 static void mark_constants
PROTO((rtx
));
163 static int output_addressed_constants
PROTO((tree
));
164 static void output_after_function_constants
PROTO((void));
165 static void output_constructor
PROTO((tree
, int));
166 #ifdef ASM_OUTPUT_BSS
167 static void asm_output_bss
PROTO((FILE *, tree
, char *, int, int));
169 #ifdef BSS_SECTION_ASM_OP
170 #ifdef ASM_OUTPUT_ALIGNED_BSS
171 static void asm_output_aligned_bss
PROTO((FILE *, tree
, char *, int, int));
173 #endif /* BSS_SECTION_ASM_OP */
175 static enum in_section
{ no_section
, in_text
, in_data
, in_named
176 #ifdef BSS_SECTION_ASM_OP
179 #ifdef EH_FRAME_SECTION_ASM_OP
182 #ifdef EXTRA_SECTIONS
185 } in_section
= no_section
;
187 /* Return a non-zero value if DECL has a section attribute. */
188 #define IN_NAMED_SECTION(DECL) \
189 ((TREE_CODE (DECL) == FUNCTION_DECL || TREE_CODE (DECL) == VAR_DECL) \
190 && DECL_SECTION_NAME (DECL) != NULL_TREE)
192 /* Text of section name when in_section == in_named. */
193 static char *in_named_name
;
195 /* Define functions like text_section for any extra sections. */
196 #ifdef EXTRA_SECTION_FUNCTIONS
197 EXTRA_SECTION_FUNCTIONS
200 /* Tell assembler to switch to text section. */
205 if (in_section
!= in_text
)
207 fprintf (asm_out_file
, "%s\n", TEXT_SECTION_ASM_OP
);
208 in_section
= in_text
;
212 /* Tell assembler to switch to data section. */
217 if (in_section
!= in_data
)
219 if (flag_shared_data
)
221 #ifdef SHARED_SECTION_ASM_OP
222 fprintf (asm_out_file
, "%s\n", SHARED_SECTION_ASM_OP
);
224 fprintf (asm_out_file
, "%s\n", DATA_SECTION_ASM_OP
);
228 fprintf (asm_out_file
, "%s\n", DATA_SECTION_ASM_OP
);
230 in_section
= in_data
;
234 /* Tell assembler to switch to read-only data section. This is normally
238 readonly_data_section ()
240 #ifdef READONLY_DATA_SECTION
241 READONLY_DATA_SECTION (); /* Note this can call data_section. */
247 /* Determine if we're in the text section. */
252 return in_section
== in_text
;
255 /* Determine if we're in the data section. */
260 return in_section
== in_data
;
263 /* Tell assembler to change to section NAME for DECL.
264 If DECL is NULL, just switch to section NAME.
265 If NAME is NULL, get the name from DECL.
266 If RELOC is 1, the initializer for DECL contains relocs. */
269 named_section (decl
, name
, reloc
)
274 if (decl
!= NULL_TREE
275 && TREE_CODE_CLASS (TREE_CODE (decl
)) != 'd')
278 name
= TREE_STRING_POINTER (DECL_SECTION_NAME (decl
));
280 if (in_section
!= in_named
|| strcmp (name
, in_named_name
))
282 #ifdef ASM_OUTPUT_SECTION_NAME
283 ASM_OUTPUT_SECTION_NAME (asm_out_file
, decl
, name
, reloc
);
285 /* Section attributes are not supported if this macro isn't provided -
286 some host formats don't support them at all. The front-end should
287 already have flagged this as an error. */
291 in_named_name
= obstack_alloc (&permanent_obstack
, strlen (name
) + 1);
292 strcpy (in_named_name
, name
);
293 in_section
= in_named
;
297 #ifdef ASM_OUTPUT_SECTION_NAME
298 #ifndef UNIQUE_SECTION
299 #define UNIQUE_SECTION(DECL,RELOC) \
302 char *name, *string; \
304 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (DECL)); \
305 /* Strip off any encoding in name. */ \
306 STRIP_NAME_ENCODING (name, name); \
308 len = strlen (name) + 1; \
309 string = alloca (len + 1); \
310 sprintf (string, ".%s", name); \
312 DECL_SECTION_NAME (DECL) = build_string (len, string); \
315 #ifndef UNIQUE_SECTION_P
316 #define UNIQUE_SECTION_P(DECL) 0
320 #ifdef BSS_SECTION_ASM_OP
322 /* Tell the assembler to switch to the bss section. */
327 if (in_section
!= in_bss
)
329 #ifdef SHARED_BSS_SECTION_ASM_OP
330 if (flag_shared_data
)
331 fprintf (asm_out_file
, "%s\n", SHARED_BSS_SECTION_ASM_OP
);
334 fprintf (asm_out_file
, "%s\n", BSS_SECTION_ASM_OP
);
340 #ifdef ASM_OUTPUT_BSS
342 /* Utility function for ASM_OUTPUT_BSS for targets to use if
343 they don't support alignments in .bss.
344 ??? It is believed that this function will work in most cases so such
345 support is localized here. */
348 asm_output_bss (file
, decl
, name
, size
, rounded
)
354 ASM_GLOBALIZE_LABEL (file
, name
);
356 #ifdef ASM_DECLARE_OBJECT_NAME
357 last_assemble_variable_decl
= decl
;
358 ASM_DECLARE_OBJECT_NAME (file
, name
, decl
);
360 /* Standard thing is just output label for the object. */
361 ASM_OUTPUT_LABEL (file
, name
);
362 #endif /* ASM_DECLARE_OBJECT_NAME */
363 ASM_OUTPUT_SKIP (file
, rounded
);
368 #ifdef ASM_OUTPUT_ALIGNED_BSS
370 /* Utility function for targets to use in implementing
371 ASM_OUTPUT_ALIGNED_BSS.
372 ??? It is believed that this function will work in most cases so such
373 support is localized here. */
376 asm_output_aligned_bss (file
, decl
, name
, size
, align
)
382 ASM_GLOBALIZE_LABEL (file
, name
);
384 ASM_OUTPUT_ALIGN (file
, floor_log2 (align
/ BITS_PER_UNIT
));
385 #ifdef ASM_DECLARE_OBJECT_NAME
386 last_assemble_variable_decl
= decl
;
387 ASM_DECLARE_OBJECT_NAME (file
, name
, decl
);
389 /* Standard thing is just output label for the object. */
390 ASM_OUTPUT_LABEL (file
, name
);
391 #endif /* ASM_DECLARE_OBJECT_NAME */
392 ASM_OUTPUT_SKIP (file
, size
? size
: 1);
397 #endif /* BSS_SECTION_ASM_OP */
399 #ifdef EH_FRAME_SECTION_ASM_OP
403 if (in_section
!= in_eh_frame
)
405 fprintf (asm_out_file
, "%s\n", EH_FRAME_SECTION_ASM_OP
);
406 in_section
= in_eh_frame
;
411 /* Switch to the section for function DECL.
413 If DECL is NULL_TREE, switch to the text section.
414 ??? It's not clear that we will ever be passed NULL_TREE, but it's
415 safer to handle it. */
418 function_section (decl
)
421 if (decl
!= NULL_TREE
422 && DECL_SECTION_NAME (decl
) != NULL_TREE
)
423 named_section (decl
, (char *) 0, 0);
428 /* Switch to section for variable DECL.
430 RELOC is the `reloc' argument to SELECT_SECTION. */
433 variable_section (decl
, reloc
)
437 if (IN_NAMED_SECTION (decl
))
438 named_section (decl
, NULL
, reloc
);
441 /* C++ can have const variables that get initialized from constructors,
442 and thus can not be in a readonly section. We prevent this by
443 verifying that the initial value is constant for objects put in a
446 error_mark_node is used by the C front end to indicate that the
447 initializer has not been seen yet. In this case, we assume that
448 the initializer must be constant.
450 C++ uses error_mark_node for variables that have complicated
451 initializers, but these variables go in BSS so we won't be called
454 #ifdef SELECT_SECTION
455 SELECT_SECTION (decl
, reloc
);
457 if (DECL_READONLY_SECTION (decl
, reloc
))
458 readonly_data_section ();
465 /* Tell assembler to switch to the section for the exception handling
471 #if defined (EXCEPTION_SECTION)
472 EXCEPTION_SECTION ();
474 #ifdef ASM_OUTPUT_SECTION_NAME
475 named_section (NULL_TREE
, ".gcc_except_table", 0);
480 readonly_data_section ();
485 /* Create the rtl to represent a function, for a function definition.
486 DECL is a FUNCTION_DECL node which describes which function.
487 The rtl is stored into DECL. */
490 make_function_rtl (decl
)
493 char *name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
494 char *new_name
= name
;
496 /* Rename a nested function to avoid conflicts. */
497 if (decl_function_context (decl
) != 0
498 && DECL_INITIAL (decl
) != 0
499 && DECL_RTL (decl
) == 0)
503 name
= IDENTIFIER_POINTER (DECL_NAME (decl
));
504 ASM_FORMAT_PRIVATE_NAME (label
, name
, var_labelno
);
505 name
= obstack_copy0 (saveable_obstack
, label
, strlen (label
));
510 /* When -fprefix-function-name is used, every function name is
511 prefixed. Even static functions are prefixed because they
512 could be declared latter. Note that a nested function name
514 if (flag_prefix_function_name
)
516 new_name
= (char *) alloca (strlen (name
) + CHKR_PREFIX_SIZE
+ 1);
517 strcpy (new_name
, CHKR_PREFIX
);
518 strcpy (new_name
+ CHKR_PREFIX_SIZE
, name
);
519 name
= obstack_copy0 (saveable_obstack
, new_name
, strlen (new_name
));
523 if (DECL_RTL (decl
) == 0)
526 = gen_rtx_MEM (DECL_MODE (decl
),
527 gen_rtx_SYMBOL_REF (Pmode
, name
));
529 /* Optionally set flags or add text to the name to record information
530 such as that it is a function name. If the name is changed, the macro
531 ASM_OUTPUT_LABELREF will have to know how to strip this information. */
532 #ifdef ENCODE_SECTION_INFO
533 ENCODE_SECTION_INFO (decl
);
538 /* ??? Another way to do this would be to do what halfpic.c does
539 and maintain a hashed table of such critters. */
540 /* ??? Another way to do this would be to pass a flag bit to
541 ENCODE_SECTION_INFO saying whether this is a new decl or not. */
542 /* Let the target reassign the RTL if it wants.
543 This is necessary, for example, when one machine specific
544 decl attribute overrides another. */
545 #ifdef REDO_SECTION_INFO_P
546 if (REDO_SECTION_INFO_P (decl
))
547 ENCODE_SECTION_INFO (decl
);
551 /* Record at least one function has been defined. */
552 function_defined
= 1;
555 /* Given NAME, a putative register name, discard any customary prefixes. */
558 strip_reg_name (name
)
561 #ifdef REGISTER_PREFIX
562 if (!strncmp (name
, REGISTER_PREFIX
, strlen (REGISTER_PREFIX
)))
563 name
+= strlen (REGISTER_PREFIX
);
565 if (name
[0] == '%' || name
[0] == '#')
570 /* Decode an `asm' spec for a declaration as a register name.
571 Return the register number, or -1 if nothing specified,
572 or -2 if the ASMSPEC is not `cc' or `memory' and is not recognized,
573 or -3 if ASMSPEC is `cc' and is not recognized,
574 or -4 if ASMSPEC is `memory' and is not recognized.
575 Accept an exact spelling or a decimal number.
576 Prefixes such as % are optional. */
579 decode_reg_name (asmspec
)
586 /* Get rid of confusing prefixes. */
587 asmspec
= strip_reg_name (asmspec
);
589 /* Allow a decimal number as a "register name". */
590 for (i
= strlen (asmspec
) - 1; i
>= 0; i
--)
591 if (! (asmspec
[i
] >= '0' && asmspec
[i
] <= '9'))
593 if (asmspec
[0] != 0 && i
< 0)
596 if (i
< FIRST_PSEUDO_REGISTER
&& i
>= 0)
602 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
604 && ! strcmp (asmspec
, strip_reg_name (reg_names
[i
])))
607 #ifdef ADDITIONAL_REGISTER_NAMES
609 static struct { char *name
; int number
; } table
[]
610 = ADDITIONAL_REGISTER_NAMES
;
612 for (i
= 0; i
< sizeof (table
) / sizeof (table
[0]); i
++)
613 if (! strcmp (asmspec
, table
[i
].name
))
614 return table
[i
].number
;
616 #endif /* ADDITIONAL_REGISTER_NAMES */
618 if (!strcmp (asmspec
, "memory"))
621 if (!strcmp (asmspec
, "cc"))
630 /* Create the DECL_RTL for a declaration for a static or external variable
631 or static or external function.
632 ASMSPEC, if not 0, is the string which the user specified
633 as the assembler symbol name.
634 TOP_LEVEL is nonzero if this is a file-scope variable.
636 This is never called for PARM_DECL nodes. */
639 make_decl_rtl (decl
, asmspec
, top_level
)
644 register char *name
= 0;
647 reg_number
= decode_reg_name (asmspec
);
649 if (DECL_ASSEMBLER_NAME (decl
) != NULL_TREE
)
650 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
652 if (reg_number
== -2)
654 /* ASMSPEC is given, and not the name of a register. */
655 name
= (char *) obstack_alloc (saveable_obstack
,
656 strlen (asmspec
) + 2);
658 strcpy (&name
[1], asmspec
);
661 /* For a duplicate declaration, we can be called twice on the
662 same DECL node. Don't discard the RTL already made. */
663 if (DECL_RTL (decl
) == 0)
665 /* First detect errors in declaring global registers. */
666 if (TREE_CODE (decl
) != FUNCTION_DECL
667 && DECL_REGISTER (decl
) && reg_number
== -1)
668 error_with_decl (decl
,
669 "register name not specified for `%s'");
670 else if (TREE_CODE (decl
) != FUNCTION_DECL
671 && DECL_REGISTER (decl
) && reg_number
< 0)
672 error_with_decl (decl
,
673 "invalid register name for `%s'");
674 else if ((reg_number
>= 0 || reg_number
== -3)
675 && (TREE_CODE (decl
) == FUNCTION_DECL
676 && ! DECL_REGISTER (decl
)))
677 error_with_decl (decl
,
678 "register name given for non-register variable `%s'");
679 else if (TREE_CODE (decl
) != FUNCTION_DECL
680 && DECL_REGISTER (decl
)
681 && TYPE_MODE (TREE_TYPE (decl
)) == BLKmode
)
682 error_with_decl (decl
,
683 "data type of `%s' isn't suitable for a register");
684 else if (TREE_CODE (decl
) != FUNCTION_DECL
&& DECL_REGISTER (decl
)
685 && ! HARD_REGNO_MODE_OK (reg_number
,
686 TYPE_MODE (TREE_TYPE (decl
))))
687 error_with_decl (decl
,
688 "register number for `%s' isn't suitable for data type");
689 /* Now handle properly declared static register variables. */
690 else if (TREE_CODE (decl
) != FUNCTION_DECL
&& DECL_REGISTER (decl
))
694 if (DECL_INITIAL (decl
) != 0 && top_level
)
696 DECL_INITIAL (decl
) = 0;
697 error ("global register variable has initial value");
699 if (fixed_regs
[reg_number
] == 0
700 && function_defined
&& top_level
)
701 error ("global register variable follows a function definition");
702 if (TREE_THIS_VOLATILE (decl
))
703 warning ("volatile register variables don't work as you might wish");
705 /* If the user specified one of the eliminables registers here,
706 e.g., FRAME_POINTER_REGNUM, we don't want to get this variable
707 confused with that register and be eliminated. Although this
708 usage is somewhat suspect, we nevertheless use the following
709 kludge to avoid setting DECL_RTL to frame_pointer_rtx. */
712 = gen_rtx_REG (DECL_MODE (decl
), FIRST_PSEUDO_REGISTER
);
713 REGNO (DECL_RTL (decl
)) = reg_number
;
714 REG_USERVAR_P (DECL_RTL (decl
)) = 1;
718 /* Make this register global, so not usable for anything
720 nregs
= HARD_REGNO_NREGS (reg_number
, DECL_MODE (decl
));
722 globalize_reg (reg_number
+ --nregs
);
725 /* Specifying a section attribute on a variable forces it into a
726 non-.bss section, and thus it cannot be common. */
727 else if (TREE_CODE (decl
) == VAR_DECL
728 && DECL_SECTION_NAME (decl
) != NULL_TREE
729 && DECL_INITIAL (decl
) == NULL_TREE
730 && DECL_COMMON (decl
))
731 DECL_COMMON (decl
) = 0;
733 /* Now handle ordinary static variables and functions (in memory).
734 Also handle vars declared register invalidly. */
735 if (DECL_RTL (decl
) == 0)
737 /* Can't use just the variable's own name for a variable
738 whose scope is less than the whole file.
739 Concatenate a distinguishing number. */
740 if (!top_level
&& !TREE_PUBLIC (decl
) && asmspec
== 0)
744 ASM_FORMAT_PRIVATE_NAME (label
, name
, var_labelno
);
745 name
= obstack_copy0 (saveable_obstack
, label
, strlen (label
));
752 /* When -fprefix-function-name is used, the functions
753 names are prefixed. Only nested function names are not
755 if (flag_prefix_function_name
&& TREE_CODE (decl
) == FUNCTION_DECL
)
758 new_name
= (char *) alloca (strlen (name
) + CHKR_PREFIX_SIZE
760 strcpy (new_name
, CHKR_PREFIX
);
761 strcpy (new_name
+ CHKR_PREFIX_SIZE
, name
);
762 name
= obstack_copy0 (saveable_obstack
,
763 new_name
, strlen (new_name
));
766 DECL_RTL (decl
) = gen_rtx_MEM (DECL_MODE (decl
),
767 gen_rtx_SYMBOL_REF (Pmode
, name
));
768 MEM_ALIAS_SET (DECL_RTL (decl
)) = get_alias_set (decl
);
770 /* If this variable is to be treated as volatile, show its
771 tree node has side effects. If it has side effects, either
772 because of this test or from TREE_THIS_VOLATILE also
773 being set, show the MEM is volatile. */
774 if (flag_volatile_global
&& TREE_CODE (decl
) == VAR_DECL
775 && TREE_PUBLIC (decl
))
776 TREE_SIDE_EFFECTS (decl
) = 1;
777 if (TREE_SIDE_EFFECTS (decl
))
778 MEM_VOLATILE_P (DECL_RTL (decl
)) = 1;
780 if (TREE_READONLY (decl
))
781 RTX_UNCHANGING_P (DECL_RTL (decl
)) = 1;
782 MEM_IN_STRUCT_P (DECL_RTL (decl
))
783 = AGGREGATE_TYPE_P (TREE_TYPE (decl
));
785 /* Optionally set flags or add text to the name to record information
786 such as that it is a function name.
787 If the name is changed, the macro ASM_OUTPUT_LABELREF
788 will have to know how to strip this information. */
789 #ifdef ENCODE_SECTION_INFO
790 ENCODE_SECTION_INFO (decl
);
796 /* If the old RTL had the wrong mode, fix the mode. */
797 if (GET_MODE (DECL_RTL (decl
)) != DECL_MODE (decl
))
799 rtx rtl
= DECL_RTL (decl
);
800 PUT_MODE (rtl
, DECL_MODE (decl
));
803 /* ??? Another way to do this would be to do what halfpic.c does
804 and maintain a hashed table of such critters. */
805 /* ??? Another way to do this would be to pass a flag bit to
806 ENCODE_SECTION_INFO saying whether this is a new decl or not. */
807 /* Let the target reassign the RTL if it wants.
808 This is necessary, for example, when one machine specific
809 decl attribute overrides another. */
810 #ifdef REDO_SECTION_INFO_P
811 if (REDO_SECTION_INFO_P (decl
))
812 ENCODE_SECTION_INFO (decl
);
817 /* Make the rtl for variable VAR be volatile.
818 Use this only for static variables. */
821 make_var_volatile (var
)
824 if (GET_CODE (DECL_RTL (var
)) != MEM
)
827 MEM_VOLATILE_P (DECL_RTL (var
)) = 1;
830 /* Output alignment directive to align for constant expression EXP. */
833 assemble_constant_align (exp
)
838 /* Align the location counter as required by EXP's data type. */
839 align
= TYPE_ALIGN (TREE_TYPE (exp
));
840 #ifdef CONSTANT_ALIGNMENT
841 align
= CONSTANT_ALIGNMENT (exp
, align
);
844 if (align
> BITS_PER_UNIT
)
845 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
848 /* Output a string of literal assembler code
849 for an `asm' keyword used between functions. */
852 assemble_asm (string
)
857 if (TREE_CODE (string
) == ADDR_EXPR
)
858 string
= TREE_OPERAND (string
, 0);
860 fprintf (asm_out_file
, "\t%s\n", TREE_STRING_POINTER (string
));
863 #if 0 /* This should no longer be needed, because
864 flag_gnu_linker should be 0 on these systems,
865 which should prevent any output
866 if ASM_OUTPUT_CONSTRUCTOR and ASM_OUTPUT_DESTRUCTOR are absent. */
867 #if !(defined(DBX_DEBUGGING_INFO) && !defined(FASCIST_ASSEMBLER))
868 #ifndef ASM_OUTPUT_CONSTRUCTOR
869 #define ASM_OUTPUT_CONSTRUCTOR(file, name)
871 #ifndef ASM_OUTPUT_DESTRUCTOR
872 #define ASM_OUTPUT_DESTRUCTOR(file, name)
877 /* Record an element in the table of global destructors.
878 How this is done depends on what sort of assembler and linker
881 NAME should be the name of a global function to be called
882 at exit time. This name is output using assemble_name. */
885 assemble_destructor (name
)
888 #ifdef ASM_OUTPUT_DESTRUCTOR
889 ASM_OUTPUT_DESTRUCTOR (asm_out_file
, name
);
893 /* Now tell GNU LD that this is part of the static destructor set. */
894 /* This code works for any machine provided you use GNU as/ld. */
895 fprintf (asm_out_file
, "%s \"___DTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
896 assemble_name (asm_out_file
, name
);
897 fputc ('\n', asm_out_file
);
902 /* Likewise for global constructors. */
905 assemble_constructor (name
)
908 #ifdef ASM_OUTPUT_CONSTRUCTOR
909 ASM_OUTPUT_CONSTRUCTOR (asm_out_file
, name
);
913 /* Now tell GNU LD that this is part of the static constructor set. */
914 /* This code works for any machine provided you use GNU as/ld. */
915 fprintf (asm_out_file
, "%s \"___CTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
916 assemble_name (asm_out_file
, name
);
917 fputc ('\n', asm_out_file
);
922 /* Likewise for entries we want to record for garbage collection.
923 Garbage collection is still under development. */
926 assemble_gc_entry (name
)
929 #ifdef ASM_OUTPUT_GC_ENTRY
930 ASM_OUTPUT_GC_ENTRY (asm_out_file
, name
);
934 /* Now tell GNU LD that this is part of the static constructor set. */
935 fprintf (asm_out_file
, "%s \"___PTR_LIST__\",22,0,0,", ASM_STABS_OP
);
936 assemble_name (asm_out_file
, name
);
937 fputc ('\n', asm_out_file
);
942 /* CONSTANT_POOL_BEFORE_FUNCTION may be defined as an expression with
943 a non-zero value if the constant pool should be output before the
944 start of the function, or a zero value if the pool should output
945 after the end of the function. The default is to put it before the
948 #ifndef CONSTANT_POOL_BEFORE_FUNCTION
949 #define CONSTANT_POOL_BEFORE_FUNCTION 1
952 /* Output assembler code for the constant pool of a function and associated
953 with defining the name of the function. DECL describes the function.
954 NAME is the function's name. For the constant pool, we use the current
955 constant pool data. */
958 assemble_start_function (decl
, fnname
)
964 /* The following code does not need preprocessing in the assembler. */
968 if (CONSTANT_POOL_BEFORE_FUNCTION
)
969 output_constant_pool (fnname
, decl
);
971 #ifdef ASM_OUTPUT_SECTION_NAME
972 /* If the function is to be put in its own section and it's not in a section
973 already, indicate so. */
974 if ((flag_function_sections
975 && DECL_SECTION_NAME (decl
) == NULL_TREE
)
976 || UNIQUE_SECTION_P (decl
))
977 UNIQUE_SECTION (decl
, 0);
980 function_section (decl
);
982 /* Tell assembler to move to target machine's alignment for functions. */
983 align
= floor_log2 (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
985 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
987 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
988 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file
, fnname
);
991 #ifdef SDB_DEBUGGING_INFO
992 /* Output SDB definition of the function. */
993 if (write_symbols
== SDB_DEBUG
)
994 sdbout_mark_begin_function ();
997 #ifdef DBX_DEBUGGING_INFO
998 /* Output DBX definition of the function. */
999 if (write_symbols
== DBX_DEBUG
)
1000 dbxout_begin_function (decl
);
1003 /* Make function name accessible from other files, if appropriate. */
1005 if (TREE_PUBLIC (decl
))
1007 if (! first_global_object_name
)
1012 if (! DECL_WEAK (decl
) && ! DECL_ONE_ONLY (decl
))
1013 name
= &first_global_object_name
;
1015 name
= &weak_global_object_name
;
1017 STRIP_NAME_ENCODING (p
, fnname
);
1018 *name
= permalloc (strlen (p
) + 1);
1022 #ifdef ASM_WEAKEN_LABEL
1023 if (DECL_WEAK (decl
))
1024 ASM_WEAKEN_LABEL (asm_out_file
, fnname
);
1027 ASM_GLOBALIZE_LABEL (asm_out_file
, fnname
);
1030 /* Do any machine/system dependent processing of the function name */
1031 #ifdef ASM_DECLARE_FUNCTION_NAME
1032 ASM_DECLARE_FUNCTION_NAME (asm_out_file
, fnname
, current_function_decl
);
1034 /* Standard thing is just output label for the function. */
1035 ASM_OUTPUT_LABEL (asm_out_file
, fnname
);
1036 #endif /* ASM_DECLARE_FUNCTION_NAME */
1039 /* Output assembler code associated with defining the size of the
1040 function. DECL describes the function. NAME is the function's name. */
1043 assemble_end_function (decl
, fnname
)
1047 #ifdef ASM_DECLARE_FUNCTION_SIZE
1048 ASM_DECLARE_FUNCTION_SIZE (asm_out_file
, fnname
, decl
);
1050 if (! CONSTANT_POOL_BEFORE_FUNCTION
)
1052 output_constant_pool (fnname
, decl
);
1053 function_section (decl
); /* need to switch back */
1056 /* Output any constants which should appear after the function. */
1057 output_after_function_constants ();
1060 /* Assemble code to leave SIZE bytes of zeros. */
1063 assemble_zeros (size
)
1066 #ifdef ASM_NO_SKIP_IN_TEXT
1067 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
1068 so we must output 0s explicitly in the text section. */
1069 if (ASM_NO_SKIP_IN_TEXT
&& in_text_section ())
1073 for (i
= 0; i
< size
- 20; i
+= 20)
1076 fprintf (asm_out_file
,
1077 "%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
);
1079 fprintf (asm_out_file
,
1080 "\tbyte 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n");
1086 fprintf (asm_out_file
, "%s 0", ASM_BYTE_OP
);
1088 fprintf (asm_out_file
, "\tbyte 0");
1091 for (; i
< size
; i
++)
1092 fprintf (asm_out_file
, ",0");
1093 fprintf (asm_out_file
, "\n");
1099 ASM_OUTPUT_SKIP (asm_out_file
, size
);
1102 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
1105 assemble_align (align
)
1108 if (align
> BITS_PER_UNIT
)
1109 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
1112 /* Assemble a string constant with the specified C string as contents. */
1115 assemble_string (p
, size
)
1122 /* If the string is very long, split it up. */
1126 int thissize
= size
- pos
;
1127 if (thissize
> maximum
)
1130 ASM_OUTPUT_ASCII (asm_out_file
, p
, thissize
);
1138 /* Assemble everything that is needed for a variable or function declaration.
1139 Not used for automatic variables, and not used for function definitions.
1140 Should not be called for variables of incomplete structure type.
1142 TOP_LEVEL is nonzero if this variable has file scope.
1143 AT_END is nonzero if this is the special handling, at end of compilation,
1144 to define things that have had only tentative definitions.
1145 DONT_OUTPUT_DATA if nonzero means don't actually output the
1146 initial value (that will be done by the caller). */
1149 assemble_variable (decl
, top_level
, at_end
, dont_output_data
)
1153 int dont_output_data
;
1155 register char *name
;
1159 enum in_section saved_in_section
;
1161 last_assemble_variable_decl
= 0;
1163 if (GET_CODE (DECL_RTL (decl
)) == REG
)
1165 /* Do output symbol info for global register variables, but do nothing
1168 if (TREE_ASM_WRITTEN (decl
))
1170 TREE_ASM_WRITTEN (decl
) = 1;
1172 #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
1173 /* File-scope global variables are output here. */
1174 if ((write_symbols
== DBX_DEBUG
|| write_symbols
== XCOFF_DEBUG
)
1176 dbxout_symbol (decl
, 0);
1178 #ifdef SDB_DEBUGGING_INFO
1179 if (write_symbols
== SDB_DEBUG
&& top_level
1180 /* Leave initialized global vars for end of compilation;
1181 see comment in compile_file. */
1182 && (TREE_PUBLIC (decl
) == 0 || DECL_INITIAL (decl
) == 0))
1183 sdbout_symbol (decl
, 0);
1186 /* Don't output any DWARF debugging information for variables here.
1187 In the case of local variables, the information for them is output
1188 when we do our recursive traversal of the tree representation for
1189 the entire containing function. In the case of file-scope variables,
1190 we output information for all of them at the very end of compilation
1191 while we are doing our final traversal of the chain of file-scope
1197 /* Normally no need to say anything here for external references,
1198 since assemble_external is called by the language-specific code
1199 when a declaration is first seen. */
1201 if (DECL_EXTERNAL (decl
))
1204 /* Output no assembler code for a function declaration.
1205 Only definitions of functions output anything. */
1207 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1210 /* If type was incomplete when the variable was declared,
1211 see if it is complete now. */
1213 if (DECL_SIZE (decl
) == 0)
1214 layout_decl (decl
, 0);
1216 /* Still incomplete => don't allocate it; treat the tentative defn
1217 (which is what it must have been) as an `extern' reference. */
1219 if (!dont_output_data
&& DECL_SIZE (decl
) == 0)
1221 error_with_file_and_line (DECL_SOURCE_FILE (decl
),
1222 DECL_SOURCE_LINE (decl
),
1223 "storage size of `%s' isn't known",
1224 IDENTIFIER_POINTER (DECL_NAME (decl
)));
1225 TREE_ASM_WRITTEN (decl
) = 1;
1229 /* The first declaration of a variable that comes through this function
1230 decides whether it is global (in C, has external linkage)
1231 or local (in C, has internal linkage). So do nothing more
1232 if this function has already run. */
1234 if (TREE_ASM_WRITTEN (decl
))
1237 TREE_ASM_WRITTEN (decl
) = 1;
1241 if (! dont_output_data
)
1245 if (TREE_CODE (DECL_SIZE (decl
)) != INTEGER_CST
)
1248 /* This is better than explicit arithmetic, since it avoids overflow. */
1249 size_tree
= size_binop (CEIL_DIV_EXPR
,
1250 DECL_SIZE (decl
), size_int (BITS_PER_UNIT
));
1252 size
= TREE_INT_CST_LOW (size_tree
);
1253 if (TREE_INT_CST_HIGH (size_tree
) != 0
1254 || size
!= TREE_INT_CST_LOW (size_tree
))
1256 error_with_decl (decl
, "size of variable `%s' is too large");
1261 name
= XSTR (XEXP (DECL_RTL (decl
), 0), 0);
1263 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
)
1264 && ! first_global_object_name
1265 && ! (DECL_COMMON (decl
) && (DECL_INITIAL (decl
) == 0
1266 || DECL_INITIAL (decl
) == error_mark_node
))
1267 && ! DECL_WEAK (decl
)
1268 && ! DECL_ONE_ONLY (decl
))
1272 STRIP_NAME_ENCODING (p
, name
);
1273 first_global_object_name
= permalloc (strlen (p
) + 1);
1274 strcpy (first_global_object_name
, p
);
1277 /* Compute the alignment of this data. */
1279 align
= DECL_ALIGN (decl
);
1281 /* In the case for initialing an array whose length isn't specified,
1282 where we have not yet been able to do the layout,
1283 figure out the proper alignment now. */
1284 if (dont_output_data
&& DECL_SIZE (decl
) == 0
1285 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
)
1286 align
= MAX (align
, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl
))));
1288 /* Some object file formats have a maximum alignment which they support.
1289 In particular, a.out format supports a maximum alignment of 4. */
1290 #ifndef MAX_OFILE_ALIGNMENT
1291 #define MAX_OFILE_ALIGNMENT BIGGEST_ALIGNMENT
1293 if (align
> MAX_OFILE_ALIGNMENT
)
1295 warning_with_decl (decl
,
1296 "alignment of `%s' is greater than maximum object file alignment. Using %d.",
1297 MAX_OFILE_ALIGNMENT
/BITS_PER_UNIT
);
1298 align
= MAX_OFILE_ALIGNMENT
;
1301 /* On some machines, it is good to increase alignment sometimes. */
1302 #ifdef DATA_ALIGNMENT
1303 align
= DATA_ALIGNMENT (TREE_TYPE (decl
), align
);
1305 #ifdef CONSTANT_ALIGNMENT
1306 if (DECL_INITIAL (decl
) != 0 && DECL_INITIAL (decl
) != error_mark_node
)
1307 align
= CONSTANT_ALIGNMENT (DECL_INITIAL (decl
), align
);
1310 /* Reset the alignment in case we have made it tighter, so we can benefit
1311 from it in get_pointer_alignment. */
1312 DECL_ALIGN (decl
) = align
;
1314 /* Handle uninitialized definitions. */
1316 if ((DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
)
1317 /* If the target can't output uninitialized but not common global data
1318 in .bss, then we have to use .data. */
1319 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
1320 && DECL_COMMON (decl
)
1322 && ! dont_output_data
)
1324 int size
= TREE_INT_CST_LOW (size_tree
);
1327 /* Don't allocate zero bytes of common,
1328 since that means "undefined external" in the linker. */
1329 if (size
== 0) rounded
= 1;
1330 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1331 so that each uninitialized object starts on such a boundary. */
1332 rounded
+= (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1;
1333 rounded
= (rounded
/ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1334 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1336 #if !defined(ASM_OUTPUT_ALIGNED_COMMON) && !defined(ASM_OUTPUT_ALIGNED_BSS)
1337 if ( (DECL_ALIGN (decl
) / BITS_PER_UNIT
) > rounded
)
1339 (decl
, "requested alignment for %s is greater than implemented alignment of %d.",rounded
);
1342 #ifdef DBX_DEBUGGING_INFO
1343 /* File-scope global variables are output here. */
1344 if (write_symbols
== DBX_DEBUG
&& top_level
)
1345 dbxout_symbol (decl
, 0);
1347 #ifdef SDB_DEBUGGING_INFO
1348 if (write_symbols
== SDB_DEBUG
&& top_level
1349 /* Leave initialized global vars for end of compilation;
1350 see comment in compile_file. */
1351 && (TREE_PUBLIC (decl
) == 0 || DECL_INITIAL (decl
) == 0))
1352 sdbout_symbol (decl
, 0);
1355 /* Don't output any DWARF debugging information for variables here.
1356 In the case of local variables, the information for them is output
1357 when we do our recursive traversal of the tree representation for
1358 the entire containing function. In the case of file-scope variables,
1359 we output information for all of them at the very end of compilation
1360 while we are doing our final traversal of the chain of file-scope
1363 #if 0 /* ??? We should either delete this or add a comment describing what
1364 it was intended to do and why we shouldn't delete it. */
1365 if (flag_shared_data
)
1369 if (TREE_PUBLIC (decl
)
1370 #if defined (ASM_OUTPUT_BSS) || defined (ASM_OUTPUT_ALIGNED_BSS)
1371 && DECL_COMMON (decl
)
1375 #ifdef ASM_OUTPUT_SHARED_COMMON
1376 if (flag_shared_data
)
1377 ASM_OUTPUT_SHARED_COMMON (asm_out_file
, name
, size
, rounded
);
1381 #ifdef ASM_OUTPUT_ALIGNED_DECL_COMMON
1382 ASM_OUTPUT_ALIGNED_DECL_COMMON (asm_out_file
, decl
, name
, size
,
1385 #ifdef ASM_OUTPUT_ALIGNED_COMMON
1386 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file
, name
, size
,
1389 ASM_OUTPUT_COMMON (asm_out_file
, name
, size
, rounded
);
1394 #if defined (ASM_OUTPUT_BSS) || defined (ASM_OUTPUT_ALIGNED_BSS)
1395 else if (TREE_PUBLIC (decl
))
1397 #ifdef ASM_OUTPUT_SHARED_BSS
1398 if (flag_shared_data
)
1399 ASM_OUTPUT_SHARED_BSS (asm_out_file
, decl
, name
, size
, rounded
);
1403 #ifdef ASM_OUTPUT_ALIGNED_BSS
1404 ASM_OUTPUT_ALIGNED_BSS (asm_out_file
, decl
, name
, size
,
1407 ASM_OUTPUT_BSS (asm_out_file
, decl
, name
, size
, rounded
);
1411 #endif /* ASM_OUTPUT_BSS || ASM_OUTPUT_ALIGNED_BSS */
1414 #ifdef ASM_OUTPUT_SHARED_LOCAL
1415 if (flag_shared_data
)
1416 ASM_OUTPUT_SHARED_LOCAL (asm_out_file
, name
, size
, rounded
);
1420 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
1421 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file
, decl
, name
, size
,
1424 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1425 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file
, name
, size
,
1428 ASM_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
1436 /* Handle initialized definitions.
1437 Also handle uninitialized global definitions if -fno-common and the
1438 target doesn't support ASM_OUTPUT_BSS. */
1440 /* First make the assembler name(s) global if appropriate. */
1441 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
))
1443 #ifdef ASM_WEAKEN_LABEL
1444 if (DECL_WEAK (decl
))
1445 ASM_WEAKEN_LABEL (asm_out_file
, name
);
1448 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
1451 for (d
= equivalents
; d
; d
= TREE_CHAIN (d
))
1453 tree e
= TREE_VALUE (d
);
1454 if (TREE_PUBLIC (e
) && DECL_NAME (e
))
1455 ASM_GLOBALIZE_LABEL (asm_out_file
,
1456 XSTR (XEXP (DECL_RTL (e
), 0), 0));
1460 /* Output any data that we will need to use the address of. */
1461 if (DECL_INITIAL (decl
) == error_mark_node
)
1462 reloc
= contains_pointers_p (TREE_TYPE (decl
));
1463 else if (DECL_INITIAL (decl
))
1464 reloc
= output_addressed_constants (DECL_INITIAL (decl
));
1466 #ifdef ASM_OUTPUT_SECTION_NAME
1467 if (UNIQUE_SECTION_P (decl
))
1468 UNIQUE_SECTION (decl
, reloc
);
1471 /* Switch to the appropriate section. */
1472 variable_section (decl
, reloc
);
1474 /* dbxout.c needs to know this. */
1475 if (in_text_section ())
1476 DECL_IN_TEXT_SECTION (decl
) = 1;
1478 /* Record current section so we can restore it if dbxout.c clobbers it. */
1479 saved_in_section
= in_section
;
1481 /* Output the dbx info now that we have chosen the section. */
1483 #ifdef DBX_DEBUGGING_INFO
1484 /* File-scope global variables are output here. */
1485 if (write_symbols
== DBX_DEBUG
&& top_level
)
1486 dbxout_symbol (decl
, 0);
1488 #ifdef SDB_DEBUGGING_INFO
1489 if (write_symbols
== SDB_DEBUG
&& top_level
1490 /* Leave initialized global vars for end of compilation;
1491 see comment in compile_file. */
1492 && (TREE_PUBLIC (decl
) == 0 || DECL_INITIAL (decl
) == 0))
1493 sdbout_symbol (decl
, 0);
1496 /* Don't output any DWARF debugging information for variables here.
1497 In the case of local variables, the information for them is output
1498 when we do our recursive traversal of the tree representation for
1499 the entire containing function. In the case of file-scope variables,
1500 we output information for all of them at the very end of compilation
1501 while we are doing our final traversal of the chain of file-scope
1504 /* If the debugging output changed sections, reselect the section
1505 that's supposed to be selected. */
1506 if (in_section
!= saved_in_section
)
1507 variable_section (decl
, reloc
);
1509 /* Output the alignment of this data. */
1510 if (align
> BITS_PER_UNIT
)
1511 ASM_OUTPUT_ALIGN (asm_out_file
,
1512 floor_log2 (DECL_ALIGN (decl
) / BITS_PER_UNIT
));
1514 /* Do any machine/system dependent processing of the object. */
1515 #ifdef ASM_DECLARE_OBJECT_NAME
1516 last_assemble_variable_decl
= decl
;
1517 ASM_DECLARE_OBJECT_NAME (asm_out_file
, name
, decl
);
1519 /* Standard thing is just output label for the object. */
1520 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1521 #endif /* ASM_DECLARE_OBJECT_NAME */
1523 if (!dont_output_data
)
1525 if (DECL_INITIAL (decl
))
1526 /* Output the actual data. */
1527 output_constant (DECL_INITIAL (decl
), TREE_INT_CST_LOW (size_tree
));
1529 /* Leave space for it. */
1530 assemble_zeros (TREE_INT_CST_LOW (size_tree
));
1534 #ifdef XCOFF_DEBUGGING_INFO
1535 /* Unfortunately, the IBM assembler cannot handle stabx before the actual
1536 declaration. When something like ".stabx "aa:S-2",aa,133,0" is emitted
1537 and `aa' hasn't been output yet, the assembler generates a stab entry with
1538 a value of zero, in addition to creating an unnecessary external entry
1539 for `aa'. Hence, we must postpone dbxout_symbol to here at the end. */
1541 /* File-scope global variables are output here. */
1542 if (write_symbols
== XCOFF_DEBUG
&& top_level
)
1544 saved_in_section
= in_section
;
1546 dbxout_symbol (decl
, 0);
1548 if (in_section
!= saved_in_section
)
1549 variable_section (decl
, reloc
);
1552 /* There must be a statement after a label. */
1557 /* Return 1 if type TYPE contains any pointers. */
1560 contains_pointers_p (type
)
1563 switch (TREE_CODE (type
))
1566 case REFERENCE_TYPE
:
1567 /* I'm not sure whether OFFSET_TYPE needs this treatment,
1568 so I'll play safe and return 1. */
1574 case QUAL_UNION_TYPE
:
1577 /* For a type that has fields, see if the fields have pointers. */
1578 for (fields
= TYPE_FIELDS (type
); fields
; fields
= TREE_CHAIN (fields
))
1579 if (TREE_CODE (fields
) == FIELD_DECL
1580 && contains_pointers_p (TREE_TYPE (fields
)))
1586 /* An array type contains pointers if its element type does. */
1587 return contains_pointers_p (TREE_TYPE (type
));
1594 /* Output something to declare an external symbol to the assembler.
1595 (Most assemblers don't need this, so we normally output nothing.)
1596 Do nothing if DECL is not external. */
1599 assemble_external (decl
)
1602 #ifdef ASM_OUTPUT_EXTERNAL
1603 if (TREE_CODE_CLASS (TREE_CODE (decl
)) == 'd'
1604 && DECL_EXTERNAL (decl
) && TREE_PUBLIC (decl
))
1606 rtx rtl
= DECL_RTL (decl
);
1608 if (GET_CODE (rtl
) == MEM
&& GET_CODE (XEXP (rtl
, 0)) == SYMBOL_REF
1609 && ! SYMBOL_REF_USED (XEXP (rtl
, 0)))
1611 /* Some systems do require some output. */
1612 SYMBOL_REF_USED (XEXP (rtl
, 0)) = 1;
1613 ASM_OUTPUT_EXTERNAL (asm_out_file
, decl
, XSTR (XEXP (rtl
, 0), 0));
1619 /* Similar, for calling a library function FUN. */
1622 assemble_external_libcall (fun
)
1625 #ifdef ASM_OUTPUT_EXTERNAL_LIBCALL
1626 /* Declare library function name external when first used, if nec. */
1627 if (! SYMBOL_REF_USED (fun
))
1629 SYMBOL_REF_USED (fun
) = 1;
1630 ASM_OUTPUT_EXTERNAL_LIBCALL (asm_out_file
, fun
);
1635 /* Declare the label NAME global. */
1638 assemble_global (name
)
1641 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
1644 /* Assemble a label named NAME. */
1647 assemble_label (name
)
1650 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1653 /* Output to FILE a reference to the assembler name of a C-level name NAME.
1654 If NAME starts with a *, the rest of NAME is output verbatim.
1655 Otherwise NAME is transformed in an implementation-defined way
1656 (usually by the addition of an underscore).
1657 Many macros in the tm file are defined to call this function. */
1660 assemble_name (file
, name
)
1667 STRIP_NAME_ENCODING (real_name
, name
);
1668 if (flag_prefix_function_name
1669 && ! bcmp (real_name
, CHKR_PREFIX
, CHKR_PREFIX_SIZE
))
1670 real_name
= real_name
+ CHKR_PREFIX_SIZE
;
1672 id
= maybe_get_identifier (real_name
);
1674 TREE_SYMBOL_REFERENCED (id
) = 1;
1677 fputs (&name
[1], file
);
1679 ASM_OUTPUT_LABELREF (file
, name
);
1682 /* Allocate SIZE bytes writable static space with a gensym name
1683 and return an RTX to refer to its address. */
1686 assemble_static_space (size
)
1694 if (flag_shared_data
)
1698 ASM_GENERATE_INTERNAL_LABEL (name
, "LF", const_labelno
);
1701 namestring
= (char *) obstack_alloc (saveable_obstack
,
1703 strcpy (namestring
, name
);
1705 x
= gen_rtx_SYMBOL_REF (Pmode
, namestring
);
1707 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
1708 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file
, NULL_TREE
, name
, size
,
1711 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1712 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file
, name
, size
, BIGGEST_ALIGNMENT
);
1715 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1716 so that each uninitialized object starts on such a boundary. */
1717 int rounded
= ((size
+ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1)
1718 / (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1719 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1720 ASM_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
1727 /* Assemble the static constant template for function entry trampolines.
1728 This is done at most once per compilation.
1729 Returns an RTX for the address of the template. */
1731 #ifdef TRAMPOLINE_TEMPLATE
1733 assemble_trampoline_template ()
1739 /* By default, put trampoline templates in read-only data section. */
1741 #ifdef TRAMPOLINE_SECTION
1742 TRAMPOLINE_SECTION ();
1744 readonly_data_section ();
1747 /* Write the assembler code to define one. */
1748 align
= floor_log2 (TRAMPOLINE_ALIGNMENT
/ BITS_PER_UNIT
);
1750 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1752 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LTRAMP", 0);
1753 TRAMPOLINE_TEMPLATE (asm_out_file
);
1755 /* Record the rtl to refer to it. */
1756 ASM_GENERATE_INTERNAL_LABEL (label
, "LTRAMP", 0);
1758 = (char *) obstack_copy0 (&permanent_obstack
, label
, strlen (label
));
1759 return gen_rtx_SYMBOL_REF (Pmode
, name
);
1763 /* Assemble the integer constant X into an object of SIZE bytes.
1764 X must be either a CONST_INT or CONST_DOUBLE.
1766 Return 1 if we were able to output the constant, otherwise 0. If FORCE is
1767 non-zero, abort if we can't output the constant. */
1770 assemble_integer (x
, size
, force
)
1775 /* First try to use the standard 1, 2, 4, 8, and 16 byte
1776 ASM_OUTPUT... macros. */
1780 #ifdef ASM_OUTPUT_CHAR
1782 ASM_OUTPUT_CHAR (asm_out_file
, x
);
1786 #ifdef ASM_OUTPUT_SHORT
1788 ASM_OUTPUT_SHORT (asm_out_file
, x
);
1792 #ifdef ASM_OUTPUT_INT
1794 ASM_OUTPUT_INT (asm_out_file
, x
);
1798 #ifdef ASM_OUTPUT_DOUBLE_INT
1800 ASM_OUTPUT_DOUBLE_INT (asm_out_file
, x
);
1804 #ifdef ASM_OUTPUT_QUADRUPLE_INT
1806 ASM_OUTPUT_QUADRUPLE_INT (asm_out_file
, x
);
1811 /* If we couldn't do it that way, there are two other possibilities: First,
1812 if the machine can output an explicit byte and this is a 1 byte constant,
1813 we can use ASM_OUTPUT_BYTE. */
1815 #ifdef ASM_OUTPUT_BYTE
1816 if (size
== 1 && GET_CODE (x
) == CONST_INT
)
1818 ASM_OUTPUT_BYTE (asm_out_file
, INTVAL (x
));
1823 /* Finally, if SIZE is larger than a single word, try to output the constant
1824 one word at a time. */
1826 if (size
> UNITS_PER_WORD
)
1829 enum machine_mode mode
1830 = mode_for_size (size
* BITS_PER_UNIT
, MODE_INT
, 0);
1833 for (i
= 0; i
< size
/ UNITS_PER_WORD
; i
++)
1835 word
= operand_subword (x
, i
, 0, mode
);
1840 if (! assemble_integer (word
, UNITS_PER_WORD
, 0))
1844 if (i
== size
/ UNITS_PER_WORD
)
1846 /* If we output at least one word and then could not finish,
1847 there is no valid way to continue. */
1858 /* Assemble the floating-point constant D into an object of size MODE. */
1861 assemble_real (d
, mode
)
1863 enum machine_mode mode
;
1865 jmp_buf output_constant_handler
;
1867 if (setjmp (output_constant_handler
))
1869 error ("floating point trap outputting a constant");
1870 #ifdef REAL_IS_NOT_DOUBLE
1871 bzero ((char *) &d
, sizeof d
);
1878 set_float_handler (output_constant_handler
);
1882 #ifdef ASM_OUTPUT_BYTE_FLOAT
1884 ASM_OUTPUT_BYTE_FLOAT (asm_out_file
, d
);
1887 #ifdef ASM_OUTPUT_SHORT_FLOAT
1889 ASM_OUTPUT_SHORT_FLOAT (asm_out_file
, d
);
1892 #ifdef ASM_OUTPUT_THREE_QUARTER_FLOAT
1894 ASM_OUTPUT_THREE_QUARTER_FLOAT (asm_out_file
, d
);
1897 #ifdef ASM_OUTPUT_FLOAT
1899 ASM_OUTPUT_FLOAT (asm_out_file
, d
);
1903 #ifdef ASM_OUTPUT_DOUBLE
1905 ASM_OUTPUT_DOUBLE (asm_out_file
, d
);
1909 #ifdef ASM_OUTPUT_LONG_DOUBLE
1912 ASM_OUTPUT_LONG_DOUBLE (asm_out_file
, d
);
1920 set_float_handler (NULL_PTR
);
1923 /* Here we combine duplicate floating constants to make
1924 CONST_DOUBLE rtx's, and force those out to memory when necessary. */
1926 /* Chain of all CONST_DOUBLE rtx's constructed for the current function.
1927 They are chained through the CONST_DOUBLE_CHAIN.
1928 A CONST_DOUBLE rtx has CONST_DOUBLE_MEM != cc0_rtx iff it is on this chain.
1929 In that case, CONST_DOUBLE_MEM is either a MEM,
1930 or const0_rtx if no MEM has been made for this CONST_DOUBLE yet.
1932 (CONST_DOUBLE_MEM is used only for top-level functions.
1933 See force_const_mem for explanation.) */
1935 static rtx const_double_chain
;
1937 /* Return a CONST_DOUBLE or CONST_INT for a value specified as a pair of ints.
1938 For an integer, I0 is the low-order word and I1 is the high-order word.
1939 For a real number, I0 is the word with the low address
1940 and I1 is the word with the high address. */
1943 immed_double_const (i0
, i1
, mode
)
1944 HOST_WIDE_INT i0
, i1
;
1945 enum machine_mode mode
;
1949 if (GET_MODE_CLASS (mode
) == MODE_INT
1950 || GET_MODE_CLASS (mode
) == MODE_PARTIAL_INT
)
1952 /* We clear out all bits that don't belong in MODE, unless they and our
1953 sign bit are all one. So we get either a reasonable negative value
1954 or a reasonable unsigned value for this mode. */
1955 int width
= GET_MODE_BITSIZE (mode
);
1956 if (width
< HOST_BITS_PER_WIDE_INT
1957 && ((i0
& ((HOST_WIDE_INT
) (-1) << (width
- 1)))
1958 != ((HOST_WIDE_INT
) (-1) << (width
- 1))))
1959 i0
&= ((HOST_WIDE_INT
) 1 << width
) - 1, i1
= 0;
1960 else if (width
== HOST_BITS_PER_WIDE_INT
1961 && ! (i1
== ~0 && i0
< 0))
1963 else if (width
> 2 * HOST_BITS_PER_WIDE_INT
)
1964 /* We cannot represent this value as a constant. */
1967 /* If this would be an entire word for the target, but is not for
1968 the host, then sign-extend on the host so that the number will look
1969 the same way on the host that it would on the target.
1971 For example, when building a 64 bit alpha hosted 32 bit sparc
1972 targeted compiler, then we want the 32 bit unsigned value -1 to be
1973 represented as a 64 bit value -1, and not as 0x00000000ffffffff.
1974 The later confuses the sparc backend. */
1976 if (BITS_PER_WORD
< HOST_BITS_PER_WIDE_INT
&& BITS_PER_WORD
== width
1977 && (i0
& ((HOST_WIDE_INT
) 1 << (width
- 1))))
1978 i0
|= ((HOST_WIDE_INT
) (-1) << width
);
1980 /* If MODE fits within HOST_BITS_PER_WIDE_INT, always use a CONST_INT.
1982 ??? Strictly speaking, this is wrong if we create a CONST_INT
1983 for a large unsigned constant with the size of MODE being
1984 HOST_BITS_PER_WIDE_INT and later try to interpret that constant in a
1985 wider mode. In that case we will mis-interpret it as a negative
1988 Unfortunately, the only alternative is to make a CONST_DOUBLE
1989 for any constant in any mode if it is an unsigned constant larger
1990 than the maximum signed integer in an int on the host. However,
1991 doing this will break everyone that always expects to see a CONST_INT
1992 for SImode and smaller.
1994 We have always been making CONST_INTs in this case, so nothing new
1997 if (width
<= HOST_BITS_PER_WIDE_INT
)
1998 i1
= (i0
< 0) ? ~(HOST_WIDE_INT
) 0 : 0;
2000 /* If this integer fits in one word, return a CONST_INT. */
2001 if ((i1
== 0 && i0
>= 0)
2002 || (i1
== ~0 && i0
< 0))
2003 return GEN_INT (i0
);
2005 /* We use VOIDmode for integers. */
2009 /* Search the chain for an existing CONST_DOUBLE with the right value.
2010 If one is found, return it. */
2012 for (r
= const_double_chain
; r
; r
= CONST_DOUBLE_CHAIN (r
))
2013 if (CONST_DOUBLE_LOW (r
) == i0
&& CONST_DOUBLE_HIGH (r
) == i1
2014 && GET_MODE (r
) == mode
)
2017 /* No; make a new one and add it to the chain.
2019 We may be called by an optimizer which may be discarding any memory
2020 allocated during its processing (such as combine and loop). However,
2021 we will be leaving this constant on the chain, so we cannot tolerate
2022 freed memory. So switch to saveable_obstack for this allocation
2023 and then switch back if we were in current_obstack. */
2025 push_obstacks_nochange ();
2026 rtl_in_saveable_obstack ();
2027 r
= gen_rtx_CONST_DOUBLE (mode
, NULL_RTX
, i0
, i1
);
2030 /* Don't touch const_double_chain in nested function; see force_const_mem.
2031 Also, don't touch it if not inside any function. */
2032 if (outer_function_chain
== 0 && current_function_decl
!= 0)
2034 CONST_DOUBLE_CHAIN (r
) = const_double_chain
;
2035 const_double_chain
= r
;
2038 /* Store const0_rtx in mem-slot since this CONST_DOUBLE is on the chain.
2039 Actual use of mem-slot is only through force_const_mem. */
2041 CONST_DOUBLE_MEM (r
) = const0_rtx
;
2046 /* Return a CONST_DOUBLE for a specified `double' value
2047 and machine mode. */
2050 immed_real_const_1 (d
, mode
)
2052 enum machine_mode mode
;
2054 union real_extract u
;
2057 /* Get the desired `double' value as a sequence of ints
2058 since that is how they are stored in a CONST_DOUBLE. */
2062 /* Detect special cases. */
2064 if (REAL_VALUES_IDENTICAL (dconst0
, d
))
2065 return CONST0_RTX (mode
);
2066 /* Check for NaN first, because some ports (specifically the i386) do not
2067 emit correct ieee-fp code by default, and thus will generate a core
2068 dump here if we pass a NaN to REAL_VALUES_EQUAL and if REAL_VALUES_EQUAL
2069 does a floating point comparison. */
2070 else if (! REAL_VALUE_ISNAN (d
) && REAL_VALUES_EQUAL (dconst1
, d
))
2071 return CONST1_RTX (mode
);
2073 if (sizeof u
== 2 * sizeof (HOST_WIDE_INT
))
2074 return immed_double_const (u
.i
[0], u
.i
[1], mode
);
2076 /* The rest of this function handles the case where
2077 a float value requires more than 2 ints of space.
2078 It will be deleted as dead code on machines that don't need it. */
2080 /* Search the chain for an existing CONST_DOUBLE with the right value.
2081 If one is found, return it. */
2083 for (r
= const_double_chain
; r
; r
= CONST_DOUBLE_CHAIN (r
))
2084 if (! bcmp ((char *) &CONST_DOUBLE_LOW (r
), (char *) &u
, sizeof u
)
2085 && GET_MODE (r
) == mode
)
2088 /* No; make a new one and add it to the chain.
2090 We may be called by an optimizer which may be discarding any memory
2091 allocated during its processing (such as combine and loop). However,
2092 we will be leaving this constant on the chain, so we cannot tolerate
2093 freed memory. So switch to saveable_obstack for this allocation
2094 and then switch back if we were in current_obstack. */
2096 push_obstacks_nochange ();
2097 rtl_in_saveable_obstack ();
2098 r
= rtx_alloc (CONST_DOUBLE
);
2100 bcopy ((char *) &u
, (char *) &CONST_DOUBLE_LOW (r
), sizeof u
);
2103 /* Don't touch const_double_chain in nested function; see force_const_mem.
2104 Also, don't touch it if not inside any function. */
2105 if (outer_function_chain
== 0 && current_function_decl
!= 0)
2107 CONST_DOUBLE_CHAIN (r
) = const_double_chain
;
2108 const_double_chain
= r
;
2111 /* Store const0_rtx in CONST_DOUBLE_MEM since this CONST_DOUBLE is on the
2112 chain, but has not been allocated memory. Actual use of CONST_DOUBLE_MEM
2113 is only through force_const_mem. */
2115 CONST_DOUBLE_MEM (r
) = const0_rtx
;
2120 /* Return a CONST_DOUBLE rtx for a value specified by EXP,
2121 which must be a REAL_CST tree node. */
2124 immed_real_const (exp
)
2127 return immed_real_const_1 (TREE_REAL_CST (exp
), TYPE_MODE (TREE_TYPE (exp
)));
2130 /* At the end of a function, forget the memory-constants
2131 previously made for CONST_DOUBLEs. Mark them as not on real_constant_chain.
2132 Also clear out real_constant_chain and clear out all the chain-pointers. */
2135 clear_const_double_mem ()
2137 register rtx r
, next
;
2139 /* Don't touch CONST_DOUBLE_MEM for nested functions.
2140 See force_const_mem for explanation. */
2141 if (outer_function_chain
!= 0)
2144 for (r
= const_double_chain
; r
; r
= next
)
2146 next
= CONST_DOUBLE_CHAIN (r
);
2147 CONST_DOUBLE_CHAIN (r
) = 0;
2148 CONST_DOUBLE_MEM (r
) = cc0_rtx
;
2150 const_double_chain
= 0;
2153 /* Given an expression EXP with a constant value,
2154 reduce it to the sum of an assembler symbol and an integer.
2155 Store them both in the structure *VALUE.
2156 Abort if EXP does not reduce. */
2161 HOST_WIDE_INT offset
;
2165 decode_addr_const (exp
, value
)
2167 struct addr_const
*value
;
2169 register tree target
= TREE_OPERAND (exp
, 0);
2170 register int offset
= 0;
2175 if (TREE_CODE (target
) == COMPONENT_REF
2176 && (TREE_CODE (DECL_FIELD_BITPOS (TREE_OPERAND (target
, 1)))
2179 offset
+= TREE_INT_CST_LOW (DECL_FIELD_BITPOS (TREE_OPERAND (target
, 1))) / BITS_PER_UNIT
;
2180 target
= TREE_OPERAND (target
, 0);
2182 else if (TREE_CODE (target
) == ARRAY_REF
)
2184 if (TREE_CODE (TREE_OPERAND (target
, 1)) != INTEGER_CST
2185 || TREE_CODE (TYPE_SIZE (TREE_TYPE (target
))) != INTEGER_CST
)
2187 offset
+= ((TREE_INT_CST_LOW (TYPE_SIZE (TREE_TYPE (target
)))
2188 * TREE_INT_CST_LOW (TREE_OPERAND (target
, 1)))
2190 target
= TREE_OPERAND (target
, 0);
2196 switch (TREE_CODE (target
))
2200 x
= DECL_RTL (target
);
2204 x
= gen_rtx_MEM (FUNCTION_MODE
,
2205 gen_rtx_LABEL_REF (VOIDmode
,
2206 label_rtx (TREE_OPERAND (exp
, 0))));
2214 x
= TREE_CST_RTL (target
);
2221 if (GET_CODE (x
) != MEM
)
2226 value
->offset
= offset
;
2229 /* Uniquize all constants that appear in memory.
2230 Each constant in memory thus far output is recorded
2231 in `const_hash_table' with a `struct constant_descriptor'
2232 that contains a polish representation of the value of
2235 We cannot store the trees in the hash table
2236 because the trees may be temporary. */
2238 struct constant_descriptor
2240 struct constant_descriptor
*next
;
2246 #define MAX_HASH_TABLE 1009
2247 static struct constant_descriptor
*const_hash_table
[MAX_HASH_TABLE
];
2249 /* Compute a hash code for a constant expression. */
2256 register int len
, hi
, i
;
2257 register enum tree_code code
= TREE_CODE (exp
);
2259 /* Either set P and LEN to the address and len of something to hash and
2260 exit the switch or return a value. */
2265 p
= (char *) &TREE_INT_CST_LOW (exp
);
2266 len
= 2 * sizeof TREE_INT_CST_LOW (exp
);
2270 p
= (char *) &TREE_REAL_CST (exp
);
2271 len
= sizeof TREE_REAL_CST (exp
);
2275 p
= TREE_STRING_POINTER (exp
);
2276 len
= TREE_STRING_LENGTH (exp
);
2280 return (const_hash (TREE_REALPART (exp
)) * 5
2281 + const_hash (TREE_IMAGPART (exp
)));
2284 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2286 len
= int_size_in_bytes (TREE_TYPE (exp
));
2287 p
= (char *) alloca (len
);
2288 get_set_constructor_bytes (exp
, (unsigned char *) p
, len
);
2295 /* For record type, include the type in the hashing.
2296 We do not do so for array types
2297 because (1) the sizes of the elements are sufficient
2298 and (2) distinct array types can have the same constructor.
2299 Instead, we include the array size because the constructor could
2301 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2302 hi
= ((unsigned long) TREE_TYPE (exp
) & ((1 << HASHBITS
) - 1))
2305 hi
= ((5 + int_size_in_bytes (TREE_TYPE (exp
)))
2306 & ((1 << HASHBITS
) - 1)) % MAX_HASH_TABLE
;
2308 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2309 if (TREE_VALUE (link
))
2311 = (hi
* 603 + const_hash (TREE_VALUE (link
))) % MAX_HASH_TABLE
;
2318 struct addr_const value
;
2320 decode_addr_const (exp
, &value
);
2321 if (GET_CODE (value
.base
) == SYMBOL_REF
)
2323 /* Don't hash the address of the SYMBOL_REF;
2324 only use the offset and the symbol name. */
2326 p
= XSTR (value
.base
, 0);
2327 for (i
= 0; p
[i
] != 0; i
++)
2328 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2330 else if (GET_CODE (value
.base
) == LABEL_REF
)
2331 hi
= value
.offset
+ CODE_LABEL_NUMBER (XEXP (value
.base
, 0)) * 13;
2333 hi
&= (1 << HASHBITS
) - 1;
2334 hi
%= MAX_HASH_TABLE
;
2340 return (const_hash (TREE_OPERAND (exp
, 0)) * 9
2341 + const_hash (TREE_OPERAND (exp
, 1)));
2345 case NON_LVALUE_EXPR
:
2346 return const_hash (TREE_OPERAND (exp
, 0)) * 7 + 2;
2352 /* Compute hashing function */
2354 for (i
= 0; i
< len
; i
++)
2355 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2357 hi
&= (1 << HASHBITS
) - 1;
2358 hi
%= MAX_HASH_TABLE
;
2362 /* Compare a constant expression EXP with a constant-descriptor DESC.
2363 Return 1 if DESC describes a constant with the same value as EXP. */
2366 compare_constant (exp
, desc
)
2368 struct constant_descriptor
*desc
;
2370 return 0 != compare_constant_1 (exp
, desc
->contents
);
2373 /* Compare constant expression EXP with a substring P of a constant descriptor.
2374 If they match, return a pointer to the end of the substring matched.
2375 If they do not match, return 0.
2377 Since descriptors are written in polish prefix notation,
2378 this function can be used recursively to test one operand of EXP
2379 against a subdescriptor, and if it succeeds it returns the
2380 address of the subdescriptor for the next operand. */
2383 compare_constant_1 (exp
, p
)
2387 register char *strp
;
2389 register enum tree_code code
= TREE_CODE (exp
);
2391 if (code
!= (enum tree_code
) *p
++)
2394 /* Either set STRP, P and LEN to pointers and length to compare and exit the
2395 switch, or return the result of the comparison. */
2400 /* Integer constants are the same only if the same width of type. */
2401 if (*p
++ != TYPE_PRECISION (TREE_TYPE (exp
)))
2404 strp
= (char *) &TREE_INT_CST_LOW (exp
);
2405 len
= 2 * sizeof TREE_INT_CST_LOW (exp
);
2409 /* Real constants are the same only if the same width of type. */
2410 if (*p
++ != TYPE_PRECISION (TREE_TYPE (exp
)))
2413 strp
= (char *) &TREE_REAL_CST (exp
);
2414 len
= sizeof TREE_REAL_CST (exp
);
2418 if (flag_writable_strings
)
2421 if (*p
++ != TYPE_MODE (TREE_TYPE (exp
)))
2424 strp
= TREE_STRING_POINTER (exp
);
2425 len
= TREE_STRING_LENGTH (exp
);
2426 if (bcmp ((char *) &TREE_STRING_LENGTH (exp
), p
,
2427 sizeof TREE_STRING_LENGTH (exp
)))
2430 p
+= sizeof TREE_STRING_LENGTH (exp
);
2434 p
= compare_constant_1 (TREE_REALPART (exp
), p
);
2438 return compare_constant_1 (TREE_IMAGPART (exp
), p
);
2441 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2443 int xlen
= len
= int_size_in_bytes (TREE_TYPE (exp
));
2445 strp
= (char *) alloca (len
);
2446 get_set_constructor_bytes (exp
, (unsigned char *) strp
, len
);
2447 if (bcmp ((char *) &xlen
, p
, sizeof xlen
))
2456 int length
= list_length (CONSTRUCTOR_ELTS (exp
));
2458 int have_purpose
= 0;
2460 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2461 if (TREE_PURPOSE (link
))
2464 if (bcmp ((char *) &length
, p
, sizeof length
))
2469 /* For record constructors, insist that the types match.
2470 For arrays, just verify both constructors are for arrays.
2471 Then insist that either both or none have any TREE_PURPOSE
2473 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2474 type
= TREE_TYPE (exp
);
2478 if (bcmp ((char *) &type
, p
, sizeof type
))
2483 if (bcmp ((char *) &have_purpose
, p
, sizeof have_purpose
))
2486 p
+= sizeof have_purpose
;
2488 /* For arrays, insist that the size in bytes match. */
2489 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2491 HOST_WIDE_INT size
= int_size_in_bytes (TREE_TYPE (exp
));
2493 if (bcmp ((char *) &size
, p
, sizeof size
))
2499 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2501 if (TREE_VALUE (link
))
2503 if ((p
= compare_constant_1 (TREE_VALUE (link
), p
)) == 0)
2510 if (bcmp ((char *) &zero
, p
, sizeof zero
))
2516 if (TREE_PURPOSE (link
)
2517 && TREE_CODE (TREE_PURPOSE (link
)) == FIELD_DECL
)
2519 if (bcmp ((char *) &TREE_PURPOSE (link
), p
,
2520 sizeof TREE_PURPOSE (link
)))
2523 p
+= sizeof TREE_PURPOSE (link
);
2525 else if (TREE_PURPOSE (link
))
2527 if ((p
= compare_constant_1 (TREE_PURPOSE (link
), p
)) == 0)
2530 else if (have_purpose
)
2534 if (bcmp ((char *) &zero
, p
, sizeof zero
))
2546 struct addr_const value
;
2548 decode_addr_const (exp
, &value
);
2549 strp
= (char *) &value
.offset
;
2550 len
= sizeof value
.offset
;
2551 /* Compare the offset. */
2553 if (*p
++ != *strp
++)
2556 /* Compare symbol name. */
2557 strp
= XSTR (value
.base
, 0);
2558 len
= strlen (strp
) + 1;
2564 p
= compare_constant_1 (TREE_OPERAND (exp
, 0), p
);
2568 return compare_constant_1 (TREE_OPERAND (exp
, 1), p
);
2572 case NON_LVALUE_EXPR
:
2573 return compare_constant_1 (TREE_OPERAND (exp
, 0), p
);
2579 /* Compare constant contents. */
2581 if (*p
++ != *strp
++)
2587 /* Construct a constant descriptor for the expression EXP.
2588 It is up to the caller to enter the descriptor in the hash table. */
2590 static struct constant_descriptor
*
2591 record_constant (exp
)
2594 struct constant_descriptor
*next
= 0;
2597 /* Make a struct constant_descriptor. The first two pointers will
2598 be filled in later. Here we just leave space for them. */
2600 obstack_grow (&permanent_obstack
, (char *) &next
, sizeof next
);
2601 obstack_grow (&permanent_obstack
, (char *) &label
, sizeof label
);
2602 record_constant_1 (exp
);
2603 return (struct constant_descriptor
*) obstack_finish (&permanent_obstack
);
2606 /* Add a description of constant expression EXP
2607 to the object growing in `permanent_obstack'.
2608 No need to return its address; the caller will get that
2609 from the obstack when the object is complete. */
2612 record_constant_1 (exp
)
2615 register char *strp
;
2617 register enum tree_code code
= TREE_CODE (exp
);
2619 obstack_1grow (&permanent_obstack
, (unsigned int) code
);
2624 obstack_1grow (&permanent_obstack
, TYPE_PRECISION (TREE_TYPE (exp
)));
2625 strp
= (char *) &TREE_INT_CST_LOW (exp
);
2626 len
= 2 * sizeof TREE_INT_CST_LOW (exp
);
2630 obstack_1grow (&permanent_obstack
, TYPE_PRECISION (TREE_TYPE (exp
)));
2631 strp
= (char *) &TREE_REAL_CST (exp
);
2632 len
= sizeof TREE_REAL_CST (exp
);
2636 if (flag_writable_strings
)
2639 obstack_1grow (&permanent_obstack
, TYPE_MODE (TREE_TYPE (exp
)));
2640 strp
= TREE_STRING_POINTER (exp
);
2641 len
= TREE_STRING_LENGTH (exp
);
2642 obstack_grow (&permanent_obstack
, (char *) &TREE_STRING_LENGTH (exp
),
2643 sizeof TREE_STRING_LENGTH (exp
));
2647 record_constant_1 (TREE_REALPART (exp
));
2648 record_constant_1 (TREE_IMAGPART (exp
));
2652 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2654 int nbytes
= int_size_in_bytes (TREE_TYPE (exp
));
2655 obstack_grow (&permanent_obstack
, &nbytes
, sizeof (nbytes
));
2656 obstack_blank (&permanent_obstack
, nbytes
);
2657 get_set_constructor_bytes
2658 (exp
, (unsigned char *) permanent_obstack
.next_free
-nbytes
,
2665 int length
= list_length (CONSTRUCTOR_ELTS (exp
));
2667 int have_purpose
= 0;
2669 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2670 if (TREE_PURPOSE (link
))
2673 obstack_grow (&permanent_obstack
, (char *) &length
, sizeof length
);
2675 /* For record constructors, insist that the types match.
2676 For arrays, just verify both constructors are for arrays.
2677 Then insist that either both or none have any TREE_PURPOSE
2679 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2680 type
= TREE_TYPE (exp
);
2683 obstack_grow (&permanent_obstack
, (char *) &type
, sizeof type
);
2684 obstack_grow (&permanent_obstack
, (char *) &have_purpose
,
2685 sizeof have_purpose
);
2687 /* For arrays, insist that the size in bytes match. */
2688 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2690 HOST_WIDE_INT size
= int_size_in_bytes (TREE_TYPE (exp
));
2691 obstack_grow (&permanent_obstack
, (char *) &size
, sizeof size
);
2694 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2696 if (TREE_VALUE (link
))
2697 record_constant_1 (TREE_VALUE (link
));
2702 obstack_grow (&permanent_obstack
,
2703 (char *) &zero
, sizeof zero
);
2706 if (TREE_PURPOSE (link
)
2707 && TREE_CODE (TREE_PURPOSE (link
)) == FIELD_DECL
)
2708 obstack_grow (&permanent_obstack
,
2709 (char *) &TREE_PURPOSE (link
),
2710 sizeof TREE_PURPOSE (link
));
2711 else if (TREE_PURPOSE (link
))
2712 record_constant_1 (TREE_PURPOSE (link
));
2713 else if (have_purpose
)
2717 obstack_grow (&permanent_obstack
,
2718 (char *) &zero
, sizeof zero
);
2726 struct addr_const value
;
2728 decode_addr_const (exp
, &value
);
2729 /* Record the offset. */
2730 obstack_grow (&permanent_obstack
,
2731 (char *) &value
.offset
, sizeof value
.offset
);
2732 /* Record the symbol name. */
2733 obstack_grow (&permanent_obstack
, XSTR (value
.base
, 0),
2734 strlen (XSTR (value
.base
, 0)) + 1);
2740 record_constant_1 (TREE_OPERAND (exp
, 0));
2741 record_constant_1 (TREE_OPERAND (exp
, 1));
2746 case NON_LVALUE_EXPR
:
2747 record_constant_1 (TREE_OPERAND (exp
, 0));
2754 /* Record constant contents. */
2755 obstack_grow (&permanent_obstack
, strp
, len
);
2758 /* Record a list of constant expressions that were passed to
2759 output_constant_def but that could not be output right away. */
2761 struct deferred_constant
2763 struct deferred_constant
*next
;
2769 static struct deferred_constant
*deferred_constants
;
2771 /* Another list of constants which should be output after the
2773 static struct deferred_constant
*after_function_constants
;
2775 /* Nonzero means defer output of addressed subconstants
2776 (i.e., those for which output_constant_def is called.) */
2777 static int defer_addressed_constants_flag
;
2779 /* Start deferring output of subconstants. */
2782 defer_addressed_constants ()
2784 defer_addressed_constants_flag
++;
2787 /* Stop deferring output of subconstants,
2788 and output now all those that have been deferred. */
2791 output_deferred_addressed_constants ()
2793 struct deferred_constant
*p
, *next
;
2795 defer_addressed_constants_flag
--;
2797 if (defer_addressed_constants_flag
> 0)
2800 for (p
= deferred_constants
; p
; p
= next
)
2802 output_constant_def_contents (p
->exp
, p
->reloc
, p
->labelno
);
2807 deferred_constants
= 0;
2810 /* Output any constants which should appear after a function. */
2813 output_after_function_constants ()
2815 struct deferred_constant
*p
, *next
;
2817 for (p
= after_function_constants
; p
; p
= next
)
2819 output_constant_def_contents (p
->exp
, p
->reloc
, p
->labelno
);
2824 after_function_constants
= 0;
2827 /* Make a copy of the whole tree structure for a constant.
2828 This handles the same types of nodes that compare_constant
2829 and record_constant handle. */
2835 switch (TREE_CODE (exp
))
2838 /* For ADDR_EXPR, we do not want to copy the decl whose address
2839 is requested. We do want to copy constants though. */
2840 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, 0))) == 'c')
2841 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2842 copy_constant (TREE_OPERAND (exp
, 0)));
2844 return copy_node (exp
);
2849 return copy_node (exp
);
2852 return build_complex (TREE_TYPE (exp
),
2853 copy_constant (TREE_REALPART (exp
)),
2854 copy_constant (TREE_IMAGPART (exp
)));
2858 return build (TREE_CODE (exp
), TREE_TYPE (exp
),
2859 copy_constant (TREE_OPERAND (exp
, 0)),
2860 copy_constant (TREE_OPERAND (exp
, 1)));
2864 case NON_LVALUE_EXPR
:
2865 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2866 copy_constant (TREE_OPERAND (exp
, 0)));
2870 tree copy
= copy_node (exp
);
2871 tree list
= copy_list (CONSTRUCTOR_ELTS (exp
));
2874 CONSTRUCTOR_ELTS (copy
) = list
;
2875 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
2876 TREE_VALUE (tail
) = copy_constant (TREE_VALUE (tail
));
2877 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2878 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
2879 TREE_PURPOSE (tail
) = copy_constant (TREE_PURPOSE (tail
));
2889 /* Return an rtx representing a reference to constant data in memory
2890 for the constant expression EXP.
2892 If assembler code for such a constant has already been output,
2893 return an rtx to refer to it.
2894 Otherwise, output such a constant in memory (or defer it for later)
2895 and generate an rtx for it.
2897 The TREE_CST_RTL of EXP is set up to point to that rtx.
2898 The const_hash_table records which constants already have label strings. */
2901 output_constant_def (exp
)
2905 register struct constant_descriptor
*desc
;
2911 if (TREE_CST_RTL (exp
))
2912 return TREE_CST_RTL (exp
);
2914 /* Make sure any other constants whose addresses appear in EXP
2915 are assigned label numbers. */
2917 reloc
= output_addressed_constants (exp
);
2919 /* Compute hash code of EXP. Search the descriptors for that hash code
2920 to see if any of them describes EXP. If yes, the descriptor records
2921 the label number already assigned. */
2923 hash
= const_hash (exp
) % MAX_HASH_TABLE
;
2925 for (desc
= const_hash_table
[hash
]; desc
; desc
= desc
->next
)
2926 if (compare_constant (exp
, desc
))
2928 found
= desc
->label
;
2934 /* No constant equal to EXP is known to have been output.
2935 Make a constant descriptor to enter EXP in the hash table.
2936 Assign the label number and record it in the descriptor for
2937 future calls to this function to find. */
2939 /* Create a string containing the label name, in LABEL. */
2940 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
2942 desc
= record_constant (exp
);
2943 desc
->next
= const_hash_table
[hash
];
2945 = (char *) obstack_copy0 (&permanent_obstack
, label
, strlen (label
));
2946 const_hash_table
[hash
] = desc
;
2950 /* Create a string containing the label name, in LABEL. */
2951 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
2954 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
2956 push_obstacks_nochange ();
2957 if (TREE_PERMANENT (exp
))
2958 end_temporary_allocation ();
2960 def
= gen_rtx_SYMBOL_REF (Pmode
, desc
->label
);
2963 = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp
)), def
);
2964 RTX_UNCHANGING_P (TREE_CST_RTL (exp
)) = 1;
2965 if (AGGREGATE_TYPE_P (TREE_TYPE (exp
)))
2966 MEM_IN_STRUCT_P (TREE_CST_RTL (exp
)) = 1;
2970 /* Optionally set flags or add text to the name to record information
2971 such as that it is a function name. If the name is changed, the macro
2972 ASM_OUTPUT_LABELREF will have to know how to strip this information. */
2973 #ifdef ENCODE_SECTION_INFO
2974 ENCODE_SECTION_INFO (exp
);
2977 /* If this is the first time we've seen this particular constant,
2978 output it (or defer its output for later). */
2981 int after_function
= 0;
2983 #ifdef CONSTANT_AFTER_FUNCTION_P
2984 if (current_function_decl
!= 0
2985 && CONSTANT_AFTER_FUNCTION_P (exp
))
2989 if (defer_addressed_constants_flag
|| after_function
)
2991 struct deferred_constant
*p
;
2992 p
= (struct deferred_constant
*) xmalloc (sizeof (struct deferred_constant
));
2994 push_obstacks_nochange ();
2995 suspend_momentary ();
2996 p
->exp
= copy_constant (exp
);
2999 p
->labelno
= const_labelno
++;
3002 p
->next
= after_function_constants
;
3003 after_function_constants
= p
;
3007 p
->next
= deferred_constants
;
3008 deferred_constants
= p
;
3012 output_constant_def_contents (exp
, reloc
, const_labelno
++);
3015 return TREE_CST_RTL (exp
);
3018 /* Now output assembler code to define the label for EXP,
3019 and follow it with the data of EXP. */
3022 output_constant_def_contents (exp
, reloc
, labelno
)
3029 if (IN_NAMED_SECTION (exp
))
3030 named_section (exp
, NULL
, reloc
);
3033 /* First switch to text section, except for writable strings. */
3034 #ifdef SELECT_SECTION
3035 SELECT_SECTION (exp
, reloc
);
3037 if (((TREE_CODE (exp
) == STRING_CST
) && flag_writable_strings
)
3038 || (flag_pic
&& reloc
))
3041 readonly_data_section ();
3045 /* Align the location counter as required by EXP's data type. */
3046 align
= TYPE_ALIGN (TREE_TYPE (exp
));
3047 #ifdef CONSTANT_ALIGNMENT
3048 align
= CONSTANT_ALIGNMENT (exp
, align
);
3051 if (align
> BITS_PER_UNIT
)
3052 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
3054 /* Output the label itself. */
3055 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LC", labelno
);
3057 /* Output the value of EXP. */
3058 output_constant (exp
,
3059 (TREE_CODE (exp
) == STRING_CST
3060 ? TREE_STRING_LENGTH (exp
)
3061 : int_size_in_bytes (TREE_TYPE (exp
))));
3065 /* Similar hash facility for making memory-constants
3066 from constant rtl-expressions. It is used on RISC machines
3067 where immediate integer arguments and constant addresses are restricted
3068 so that such constants must be stored in memory.
3070 This pool of constants is reinitialized for each function
3071 so each function gets its own constants-pool that comes right before it.
3073 All structures allocated here are discarded when functions are saved for
3074 inlining, so they do not need to be allocated permanently. */
3076 #define MAX_RTX_HASH_TABLE 61
3077 static struct constant_descriptor
**const_rtx_hash_table
;
3079 /* Structure to represent sufficient information about a constant so that
3080 it can be output when the constant pool is output, so that function
3081 integration can be done, and to simplify handling on machines that reference
3082 constant pool as base+displacement. */
3084 struct pool_constant
3086 struct constant_descriptor
*desc
;
3087 struct pool_constant
*next
;
3088 enum machine_mode mode
;
3096 /* Pointers to first and last constant in pool. */
3098 static struct pool_constant
*first_pool
, *last_pool
;
3100 /* Current offset in constant pool (does not include any machine-specific
3103 static int pool_offset
;
3105 /* Structure used to maintain hash table mapping symbols used to their
3106 corresponding constants. */
3111 struct pool_constant
*pool
;
3112 struct pool_sym
*next
;
3115 static struct pool_sym
**const_rtx_sym_hash_table
;
3117 /* Hash code for a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true.
3118 The argument is XSTR (... , 0) */
3120 #define SYMHASH(LABEL) \
3121 ((((unsigned long) (LABEL)) & ((1 << HASHBITS) - 1)) % MAX_RTX_HASH_TABLE)
3123 /* Initialize constant pool hashing for next function. */
3126 init_const_rtx_hash_table ()
3128 const_rtx_hash_table
3129 = ((struct constant_descriptor
**)
3130 oballoc (MAX_RTX_HASH_TABLE
* sizeof (struct constant_descriptor
*)));
3131 const_rtx_sym_hash_table
3132 = ((struct pool_sym
**)
3133 oballoc (MAX_RTX_HASH_TABLE
* sizeof (struct pool_sym
*)));
3134 bzero ((char *) const_rtx_hash_table
,
3135 MAX_RTX_HASH_TABLE
* sizeof (struct constant_descriptor
*));
3136 bzero ((char *) const_rtx_sym_hash_table
,
3137 MAX_RTX_HASH_TABLE
* sizeof (struct pool_sym
*));
3139 first_pool
= last_pool
= 0;
3143 /* Save and restore status for a nested function. */
3146 save_varasm_status (p
, context
)
3150 p
->const_rtx_hash_table
= const_rtx_hash_table
;
3151 p
->const_rtx_sym_hash_table
= const_rtx_sym_hash_table
;
3152 p
->first_pool
= first_pool
;
3153 p
->last_pool
= last_pool
;
3154 p
->pool_offset
= pool_offset
;
3155 p
->const_double_chain
= const_double_chain
;
3157 /* If we are pushing to toplevel, we can't reuse const_double_chain. */
3158 if (context
== NULL_TREE
)
3159 const_double_chain
= 0;
3163 restore_varasm_status (p
)
3166 const_rtx_hash_table
= p
->const_rtx_hash_table
;
3167 const_rtx_sym_hash_table
= p
->const_rtx_sym_hash_table
;
3168 first_pool
= p
->first_pool
;
3169 last_pool
= p
->last_pool
;
3170 pool_offset
= p
->pool_offset
;
3171 const_double_chain
= p
->const_double_chain
;
3174 enum kind
{ RTX_DOUBLE
, RTX_INT
};
3178 #ifdef ONLY_INT_FIELDS
3179 unsigned int kind
: 16;
3180 unsigned int mode
: 16;
3182 enum kind kind
: 16;
3183 enum machine_mode mode
: 16;
3186 union real_extract du
;
3187 struct addr_const addr
;
3188 struct {HOST_WIDE_INT high
, low
;} di
;
3192 /* Express an rtx for a constant integer (perhaps symbolic)
3193 as the sum of a symbol or label plus an explicit integer.
3194 They are stored into VALUE. */
3197 decode_rtx_const (mode
, x
, value
)
3198 enum machine_mode mode
;
3200 struct rtx_const
*value
;
3202 /* Clear the whole structure, including any gaps. */
3205 int *p
= (int *) value
;
3206 int *end
= (int *) (value
+ 1);
3211 value
->kind
= RTX_INT
; /* Most usual kind. */
3214 switch (GET_CODE (x
))
3217 value
->kind
= RTX_DOUBLE
;
3218 if (GET_MODE (x
) != VOIDmode
)
3220 value
->mode
= GET_MODE (x
);
3221 bcopy ((char *) &CONST_DOUBLE_LOW (x
),
3222 (char *) &value
->un
.du
, sizeof value
->un
.du
);
3226 value
->un
.di
.low
= CONST_DOUBLE_LOW (x
);
3227 value
->un
.di
.high
= CONST_DOUBLE_HIGH (x
);
3232 value
->un
.addr
.offset
= INTVAL (x
);
3238 value
->un
.addr
.base
= x
;
3243 if (GET_CODE (x
) == PLUS
)
3245 value
->un
.addr
.base
= XEXP (x
, 0);
3246 if (GET_CODE (XEXP (x
, 1)) != CONST_INT
)
3248 value
->un
.addr
.offset
= INTVAL (XEXP (x
, 1));
3250 else if (GET_CODE (x
) == MINUS
)
3252 value
->un
.addr
.base
= XEXP (x
, 0);
3253 if (GET_CODE (XEXP (x
, 1)) != CONST_INT
)
3255 value
->un
.addr
.offset
= - INTVAL (XEXP (x
, 1));
3265 if (value
->kind
== RTX_INT
&& value
->un
.addr
.base
!= 0)
3266 switch (GET_CODE (value
->un
.addr
.base
))
3270 /* Use the string's address, not the SYMBOL_REF's address,
3271 for the sake of addresses of library routines.
3272 For a LABEL_REF, compare labels. */
3273 value
->un
.addr
.base
= XEXP (value
->un
.addr
.base
, 0);
3280 /* Given a MINUS expression, simplify it if both sides
3281 include the same symbol. */
3284 simplify_subtraction (x
)
3287 struct rtx_const val0
, val1
;
3289 decode_rtx_const (GET_MODE (x
), XEXP (x
, 0), &val0
);
3290 decode_rtx_const (GET_MODE (x
), XEXP (x
, 1), &val1
);
3292 if (val0
.un
.addr
.base
== val1
.un
.addr
.base
)
3293 return GEN_INT (val0
.un
.addr
.offset
- val1
.un
.addr
.offset
);
3297 /* Compute a hash code for a constant RTL expression. */
3300 const_hash_rtx (mode
, x
)
3301 enum machine_mode mode
;
3307 struct rtx_const value
;
3308 decode_rtx_const (mode
, x
, &value
);
3310 /* Compute hashing function */
3312 for (i
= 0; i
< sizeof value
/ sizeof (int); i
++)
3313 hi
+= ((int *) &value
)[i
];
3315 hi
&= (1 << HASHBITS
) - 1;
3316 hi
%= MAX_RTX_HASH_TABLE
;
3320 /* Compare a constant rtl object X with a constant-descriptor DESC.
3321 Return 1 if DESC describes a constant with the same value as X. */
3324 compare_constant_rtx (mode
, x
, desc
)
3325 enum machine_mode mode
;
3327 struct constant_descriptor
*desc
;
3329 register int *p
= (int *) desc
->contents
;
3332 struct rtx_const value
;
3334 decode_rtx_const (mode
, x
, &value
);
3335 strp
= (int *) &value
;
3336 len
= sizeof value
/ sizeof (int);
3338 /* Compare constant contents. */
3340 if (*p
++ != *strp
++)
3346 /* Construct a constant descriptor for the rtl-expression X.
3347 It is up to the caller to enter the descriptor in the hash table. */
3349 static struct constant_descriptor
*
3350 record_constant_rtx (mode
, x
)
3351 enum machine_mode mode
;
3354 struct constant_descriptor
*ptr
;
3356 struct rtx_const value
;
3358 decode_rtx_const (mode
, x
, &value
);
3360 /* Put these things in the saveable obstack so we can ensure it won't
3361 be freed if we are called from combine or some other phase that discards
3362 memory allocated from function_obstack (current_obstack). */
3363 obstack_grow (saveable_obstack
, &ptr
, sizeof ptr
);
3364 obstack_grow (saveable_obstack
, &label
, sizeof label
);
3366 /* Record constant contents. */
3367 obstack_grow (saveable_obstack
, &value
, sizeof value
);
3369 return (struct constant_descriptor
*) obstack_finish (saveable_obstack
);
3372 /* Given a constant rtx X, make (or find) a memory constant for its value
3373 and return a MEM rtx to refer to it in memory. */
3376 force_const_mem (mode
, x
)
3377 enum machine_mode mode
;
3381 register struct constant_descriptor
*desc
;
3386 /* If we want this CONST_DOUBLE in the same mode as it is in memory
3387 (this will always be true for floating CONST_DOUBLEs that have been
3388 placed in memory, but not for VOIDmode (integer) CONST_DOUBLEs),
3389 use the previous copy. Otherwise, make a new one. Note that in
3390 the unlikely event that this same CONST_DOUBLE is used in two different
3391 modes in an alternating fashion, we will allocate a lot of different
3392 memory locations, but this should be extremely rare. */
3394 /* Don't use CONST_DOUBLE_MEM in a nested function.
3395 Nested functions have their own constant pools,
3396 so they can't share the same values in CONST_DOUBLE_MEM
3397 with the containing function. */
3398 if (outer_function_chain
== 0)
3399 if (GET_CODE (x
) == CONST_DOUBLE
3400 && GET_CODE (CONST_DOUBLE_MEM (x
)) == MEM
3401 && GET_MODE (CONST_DOUBLE_MEM (x
)) == mode
)
3402 return CONST_DOUBLE_MEM (x
);
3404 /* Compute hash code of X. Search the descriptors for that hash code
3405 to see if any of them describes X. If yes, the descriptor records
3406 the label number already assigned. */
3408 hash
= const_hash_rtx (mode
, x
);
3410 for (desc
= const_rtx_hash_table
[hash
]; desc
; desc
= desc
->next
)
3411 if (compare_constant_rtx (mode
, x
, desc
))
3413 found
= desc
->label
;
3419 register struct pool_constant
*pool
;
3420 register struct pool_sym
*sym
;
3423 /* No constant equal to X is known to have been output.
3424 Make a constant descriptor to enter X in the hash table.
3425 Assign the label number and record it in the descriptor for
3426 future calls to this function to find. */
3428 desc
= record_constant_rtx (mode
, x
);
3429 desc
->next
= const_rtx_hash_table
[hash
];
3430 const_rtx_hash_table
[hash
] = desc
;
3432 /* Align the location counter as required by EXP's data type. */
3433 align
= (mode
== VOIDmode
) ? UNITS_PER_WORD
: GET_MODE_SIZE (mode
);
3434 if (align
> BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
3435 align
= BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
;
3436 #ifdef CONSTANT_ALIGNMENT
3437 align
= CONSTANT_ALIGNMENT (make_tree (type_for_mode (mode
, 0), x
),
3438 align
* BITS_PER_UNIT
) / BITS_PER_UNIT
;
3441 pool_offset
+= align
- 1;
3442 pool_offset
&= ~ (align
- 1);
3444 /* If RTL is not being placed into the saveable obstack, make a
3445 copy of X that is in the saveable obstack in case we are
3446 being called from combine or some other phase that discards
3447 memory it allocates. We used to only do this if it is a
3448 CONST; however, reload can allocate a CONST_INT when
3449 eliminating registers. */
3450 if (rtl_obstack
!= saveable_obstack
3451 && (GET_CODE (x
) == CONST
|| GET_CODE (x
) == CONST_INT
))
3453 push_obstacks_nochange ();
3454 rtl_in_saveable_obstack ();
3456 if (GET_CODE (x
) == CONST
)
3457 x
= gen_rtx_CONST (GET_MODE (x
),
3458 gen_rtx_PLUS (GET_MODE (x
),
3459 XEXP (XEXP (x
, 0), 0),
3460 XEXP (XEXP (x
, 0), 1)));
3462 x
= GEN_INT (INTVAL (x
));
3467 /* Allocate a pool constant descriptor, fill it in, and chain it in. */
3469 pool
= (struct pool_constant
*) savealloc (sizeof (struct pool_constant
));
3473 pool
->labelno
= const_labelno
;
3474 pool
->align
= align
;
3475 pool
->offset
= pool_offset
;
3482 last_pool
->next
= pool
;
3485 pool_offset
+= GET_MODE_SIZE (mode
);
3487 /* Create a string containing the label name, in LABEL. */
3488 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
3493 = (char *) obstack_copy0 (saveable_obstack
, label
, strlen (label
));
3495 /* Add label to symbol hash table. */
3496 hash
= SYMHASH (found
);
3497 sym
= (struct pool_sym
*) savealloc (sizeof (struct pool_sym
));
3500 sym
->next
= const_rtx_sym_hash_table
[hash
];
3501 const_rtx_sym_hash_table
[hash
] = sym
;
3504 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
3506 def
= gen_rtx_MEM (mode
, gen_rtx_SYMBOL_REF (Pmode
, found
));
3508 RTX_UNCHANGING_P (def
) = 1;
3509 /* Mark the symbol_ref as belonging to this constants pool. */
3510 CONSTANT_POOL_ADDRESS_P (XEXP (def
, 0)) = 1;
3511 current_function_uses_const_pool
= 1;
3513 if (outer_function_chain
== 0)
3514 if (GET_CODE (x
) == CONST_DOUBLE
)
3516 if (CONST_DOUBLE_MEM (x
) == cc0_rtx
)
3518 CONST_DOUBLE_CHAIN (x
) = const_double_chain
;
3519 const_double_chain
= x
;
3521 CONST_DOUBLE_MEM (x
) = def
;
3527 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
3528 the corresponding pool_constant structure. */
3530 static struct pool_constant
*
3531 find_pool_constant (addr
)
3534 struct pool_sym
*sym
;
3535 char *label
= XSTR (addr
, 0);
3537 for (sym
= const_rtx_sym_hash_table
[SYMHASH (label
)]; sym
; sym
= sym
->next
)
3538 if (sym
->label
== label
)
3544 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
3547 get_pool_constant (addr
)
3550 return (find_pool_constant (addr
))->constant
;
3553 /* Similar, return the mode. */
3556 get_pool_mode (addr
)
3559 return (find_pool_constant (addr
))->mode
;
3562 /* Similar, return the offset in the constant pool. */
3565 get_pool_offset (addr
)
3568 return (find_pool_constant (addr
))->offset
;
3571 /* Return the size of the constant pool. */
3579 /* Write all the constants in the constant pool. */
3582 output_constant_pool (fnname
, fndecl
)
3586 struct pool_constant
*pool
;
3588 union real_extract u
;
3590 /* It is possible for gcc to call force_const_mem and then to later
3591 discard the instructions which refer to the constant. In such a
3592 case we do not need to output the constant. */
3593 if (optimize
>= 0 && flag_expensive_optimizations
)
3594 mark_constant_pool ();
3596 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3597 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3600 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3607 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3608 whose CODE_LABEL has been deleted. This can occur if a jump table
3609 is eliminated by optimization. If so, write a constant of zero
3610 instead. Note that this can also happen by turning the
3611 CODE_LABEL into a NOTE. */
3612 if (((GET_CODE (x
) == LABEL_REF
3613 && (INSN_DELETED_P (XEXP (x
, 0))
3614 || GET_CODE (XEXP (x
, 0)) == NOTE
)))
3615 || (GET_CODE (x
) == CONST
&& GET_CODE (XEXP (x
, 0)) == PLUS
3616 && GET_CODE (XEXP (XEXP (x
, 0), 0)) == LABEL_REF
3617 && (INSN_DELETED_P (XEXP (XEXP (XEXP (x
, 0), 0), 0))
3618 || GET_CODE (XEXP (XEXP (XEXP (x
, 0), 0), 0)) == NOTE
)))
3621 /* First switch to correct section. */
3622 #ifdef SELECT_RTX_SECTION
3623 SELECT_RTX_SECTION (pool
->mode
, x
);
3625 readonly_data_section ();
3628 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3629 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file
, x
, pool
->mode
,
3630 pool
->align
, pool
->labelno
, done
);
3633 if (pool
->align
> 1)
3634 ASM_OUTPUT_ALIGN (asm_out_file
, exact_log2 (pool
->align
));
3636 /* Output the label. */
3637 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LC", pool
->labelno
);
3639 /* Output the value of the constant itself. */
3640 switch (GET_MODE_CLASS (pool
->mode
))
3643 if (GET_CODE (x
) != CONST_DOUBLE
)
3646 bcopy ((char *) &CONST_DOUBLE_LOW (x
), (char *) &u
, sizeof u
);
3647 assemble_real (u
.d
, pool
->mode
);
3651 case MODE_PARTIAL_INT
:
3652 assemble_integer (x
, GET_MODE_SIZE (pool
->mode
), 1);
3659 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3665 #ifdef ASM_OUTPUT_POOL_EPILOGUE
3666 ASM_OUTPUT_POOL_EPILOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3669 /* Done with this pool. */
3670 first_pool
= last_pool
= 0;
3673 /* Look through the instructions for this function, and mark all the
3674 entries in the constant pool which are actually being used. */
3677 mark_constant_pool ()
3680 struct pool_constant
*pool
;
3682 if (first_pool
== 0)
3685 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3688 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
3689 if (GET_RTX_CLASS (GET_CODE (insn
)) == 'i')
3690 mark_constants (PATTERN (insn
));
3692 for (insn
= current_function_epilogue_delay_list
;
3694 insn
= XEXP (insn
, 1))
3695 if (GET_RTX_CLASS (GET_CODE (insn
)) == 'i')
3696 mark_constants (PATTERN (insn
));
3704 register char *format_ptr
;
3709 if (GET_CODE (x
) == SYMBOL_REF
)
3711 if (CONSTANT_POOL_ADDRESS_P (x
))
3712 find_pool_constant (x
)->mark
= 1;
3715 /* Never search inside a CONST_DOUBLE, because CONST_DOUBLE_MEM may be
3716 a MEM, but does not constitute a use of that MEM. This is particularly
3717 important inside a nested function, because CONST_DOUBLE_MEM may be
3718 a reference to a MEM in the parent's constant pool. See the comment
3719 in force_const_mem. */
3720 else if (GET_CODE (x
) == CONST_DOUBLE
)
3723 /* Insns may appear inside a SEQUENCE. Only check the patterns of
3724 insns, not any notes that may be attached. We don't want to mark
3725 a constant just because it happens to appear in a REG_EQUIV note. */
3726 if (GET_RTX_CLASS (GET_CODE (x
)) == 'i')
3728 mark_constants (PATTERN (x
));
3732 format_ptr
= GET_RTX_FORMAT (GET_CODE (x
));
3734 for (i
= 0; i
< GET_RTX_LENGTH (GET_CODE (x
)); i
++)
3736 switch (*format_ptr
++)
3739 mark_constants (XEXP (x
, i
));
3743 if (XVEC (x
, i
) != 0)
3747 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
3748 mark_constants (XVECEXP (x
, i
, j
));
3767 /* Find all the constants whose addresses are referenced inside of EXP,
3768 and make sure assembler code with a label has been output for each one.
3769 Indicate whether an ADDR_EXPR has been encountered. */
3772 output_addressed_constants (exp
)
3777 switch (TREE_CODE (exp
))
3781 register tree constant
= TREE_OPERAND (exp
, 0);
3783 while (TREE_CODE (constant
) == COMPONENT_REF
)
3785 constant
= TREE_OPERAND (constant
, 0);
3788 if (TREE_CODE_CLASS (TREE_CODE (constant
)) == 'c'
3789 || TREE_CODE (constant
) == CONSTRUCTOR
)
3790 /* No need to do anything here
3791 for addresses of variables or functions. */
3792 output_constant_def (constant
);
3799 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
3800 reloc
|= output_addressed_constants (TREE_OPERAND (exp
, 1));
3805 case NON_LVALUE_EXPR
:
3806 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
3812 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
3813 if (TREE_VALUE (link
) != 0)
3814 reloc
|= output_addressed_constants (TREE_VALUE (link
));
3824 /* Output assembler code for constant EXP to FILE, with no label.
3825 This includes the pseudo-op such as ".int" or ".byte", and a newline.
3826 Assumes output_addressed_constants has been done on EXP already.
3828 Generate exactly SIZE bytes of assembler data, padding at the end
3829 with zeros if necessary. SIZE must always be specified.
3831 SIZE is important for structure constructors,
3832 since trailing members may have been omitted from the constructor.
3833 It is also important for initialization of arrays from string constants
3834 since the full length of the string constant might not be wanted.
3835 It is also needed for initialization of unions, where the initializer's
3836 type is just one member, and that may not be as long as the union.
3838 There a case in which we would fail to output exactly SIZE bytes:
3839 for a structure constructor that wants to produce more than SIZE bytes.
3840 But such constructors will never be generated for any possible input. */
3843 output_constant (exp
, size
)
3847 register enum tree_code code
= TREE_CODE (TREE_TYPE (exp
));
3852 /* Eliminate the NON_LVALUE_EXPR_EXPR that makes a cast not be an lvalue.
3853 That way we get the constant (we hope) inside it. Also, strip off any
3854 NOP_EXPR that converts between two record, union, array, or set types. */
3855 while ((TREE_CODE (exp
) == NOP_EXPR
3856 && (TREE_TYPE (exp
) == TREE_TYPE (TREE_OPERAND (exp
, 0))
3857 || AGGREGATE_TYPE_P (TREE_TYPE (exp
))))
3858 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
3859 exp
= TREE_OPERAND (exp
, 0);
3861 /* Allow a constructor with no elements for any data type.
3862 This means to fill the space with zeros. */
3863 if (TREE_CODE (exp
) == CONSTRUCTOR
&& CONSTRUCTOR_ELTS (exp
) == 0)
3865 assemble_zeros (size
);
3876 case REFERENCE_TYPE
:
3877 /* ??? What about (int)((float)(int)&foo + 4) */
3878 while (TREE_CODE (exp
) == NOP_EXPR
|| TREE_CODE (exp
) == CONVERT_EXPR
3879 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
3880 exp
= TREE_OPERAND (exp
, 0);
3882 if (! assemble_integer (expand_expr (exp
, NULL_RTX
, VOIDmode
,
3883 EXPAND_INITIALIZER
),
3885 error ("initializer for integer value is too complicated");
3890 if (TREE_CODE (exp
) != REAL_CST
)
3891 error ("initializer for floating value is not a floating constant");
3893 assemble_real (TREE_REAL_CST (exp
),
3894 mode_for_size (size
* BITS_PER_UNIT
, MODE_FLOAT
, 0));
3899 output_constant (TREE_REALPART (exp
), size
/ 2);
3900 output_constant (TREE_IMAGPART (exp
), size
/ 2);
3901 size
-= (size
/ 2) * 2;
3905 if (TREE_CODE (exp
) == CONSTRUCTOR
)
3907 output_constructor (exp
, size
);
3910 else if (TREE_CODE (exp
) == STRING_CST
)
3914 if (size
> TREE_STRING_LENGTH (exp
))
3916 excess
= size
- TREE_STRING_LENGTH (exp
);
3917 size
= TREE_STRING_LENGTH (exp
);
3920 assemble_string (TREE_STRING_POINTER (exp
), size
);
3929 if (TREE_CODE (exp
) == CONSTRUCTOR
)
3930 output_constructor (exp
, size
);
3936 if (TREE_CODE (exp
) == INTEGER_CST
)
3937 assemble_integer (expand_expr (exp
, NULL_RTX
,
3938 VOIDmode
, EXPAND_INITIALIZER
),
3940 else if (TREE_CODE (exp
) == CONSTRUCTOR
)
3942 unsigned char *buffer
= (unsigned char *) alloca (size
);
3943 if (get_set_constructor_bytes (exp
, buffer
, size
))
3945 assemble_string ((char *) buffer
, size
);
3948 error ("unknown set constructor type");
3956 assemble_zeros (size
);
3960 /* Subroutine of output_constant, used for CONSTRUCTORs
3961 (aggregate constants).
3962 Generate at least SIZE bytes, padding if necessary. */
3965 output_constructor (exp
, size
)
3969 register tree link
, field
= 0;
3970 HOST_WIDE_INT min_index
= 0;
3971 /* Number of bytes output or skipped so far.
3972 In other words, current position within the constructor. */
3973 int total_bytes
= 0;
3974 /* Non-zero means BYTE contains part of a byte, to be output. */
3975 int byte_buffer_in_use
= 0;
3978 if (HOST_BITS_PER_WIDE_INT
< BITS_PER_UNIT
)
3981 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
3982 field
= TYPE_FIELDS (TREE_TYPE (exp
));
3984 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
3985 && TYPE_DOMAIN (TREE_TYPE (exp
)) != 0)
3987 = TREE_INT_CST_LOW (TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (exp
))));
3989 /* As LINK goes through the elements of the constant,
3990 FIELD goes through the structure fields, if the constant is a structure.
3991 if the constant is a union, then we override this,
3992 by getting the field from the TREE_LIST element.
3993 But the constant could also be an array. Then FIELD is zero. */
3994 for (link
= CONSTRUCTOR_ELTS (exp
);
3996 link
= TREE_CHAIN (link
),
3997 field
= field
? TREE_CHAIN (field
) : 0)
3999 tree val
= TREE_VALUE (link
);
4002 /* the element in a union constructor specifies the proper field. */
4004 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
4005 || TREE_CODE (TREE_TYPE (exp
)) == UNION_TYPE
)
4007 /* if available, use the type given by link */
4008 if (TREE_PURPOSE (link
) != 0)
4009 field
= TREE_PURPOSE (link
);
4012 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
4013 index
= TREE_PURPOSE (link
);
4015 /* Eliminate the marker that makes a cast not be an lvalue. */
4019 if (index
&& TREE_CODE (index
) == RANGE_EXPR
)
4021 register int fieldsize
4022 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (exp
)));
4023 HOST_WIDE_INT lo_index
= TREE_INT_CST_LOW (TREE_OPERAND (index
, 0));
4024 HOST_WIDE_INT hi_index
= TREE_INT_CST_LOW (TREE_OPERAND (index
, 1));
4025 HOST_WIDE_INT index
;
4026 for (index
= lo_index
; index
<= hi_index
; index
++)
4028 /* Output the element's initial value. */
4030 assemble_zeros (fieldsize
);
4032 output_constant (val
, fieldsize
);
4034 /* Count its size. */
4035 total_bytes
+= fieldsize
;
4038 else if (field
== 0 || !DECL_BIT_FIELD (field
))
4040 /* An element that is not a bit-field. */
4042 register int fieldsize
;
4043 /* Since this structure is static,
4044 we know the positions are constant. */
4045 int bitpos
= (field
? (TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field
))
4049 bitpos
= (TREE_INT_CST_LOW (TYPE_SIZE (TREE_TYPE (val
)))
4051 * (TREE_INT_CST_LOW (index
) - min_index
));
4053 /* Output any buffered-up bit-fields preceding this element. */
4054 if (byte_buffer_in_use
)
4056 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4058 byte_buffer_in_use
= 0;
4061 /* Advance to offset of this element.
4062 Note no alignment needed in an array, since that is guaranteed
4063 if each element has the proper size. */
4064 if ((field
!= 0 || index
!= 0) && bitpos
!= total_bytes
)
4066 assemble_zeros (bitpos
- total_bytes
);
4067 total_bytes
= bitpos
;
4070 /* Determine size this element should occupy. */
4073 if (TREE_CODE (DECL_SIZE (field
)) != INTEGER_CST
)
4075 if (TREE_INT_CST_LOW (DECL_SIZE (field
)) > 100000)
4077 /* This avoids overflow trouble. */
4078 tree size_tree
= size_binop (CEIL_DIV_EXPR
,
4080 size_int (BITS_PER_UNIT
));
4081 fieldsize
= TREE_INT_CST_LOW (size_tree
);
4085 fieldsize
= TREE_INT_CST_LOW (DECL_SIZE (field
));
4086 fieldsize
= (fieldsize
+ BITS_PER_UNIT
- 1) / BITS_PER_UNIT
;
4090 fieldsize
= int_size_in_bytes (TREE_TYPE (TREE_TYPE (exp
)));
4092 /* Output the element's initial value. */
4094 assemble_zeros (fieldsize
);
4096 output_constant (val
, fieldsize
);
4098 /* Count its size. */
4099 total_bytes
+= fieldsize
;
4101 else if (val
!= 0 && TREE_CODE (val
) != INTEGER_CST
)
4102 error ("invalid initial value for member `%s'",
4103 IDENTIFIER_POINTER (DECL_NAME (field
)));
4106 /* Element that is a bit-field. */
4108 int next_offset
= TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field
));
4110 = (next_offset
+ TREE_INT_CST_LOW (DECL_SIZE (field
)));
4113 val
= integer_zero_node
;
4115 /* If this field does not start in this (or, next) byte,
4117 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4119 /* Output remnant of any bit field in previous bytes. */
4120 if (byte_buffer_in_use
)
4122 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4124 byte_buffer_in_use
= 0;
4127 /* If still not at proper byte, advance to there. */
4128 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4130 assemble_zeros (next_offset
/ BITS_PER_UNIT
- total_bytes
);
4131 total_bytes
= next_offset
/ BITS_PER_UNIT
;
4135 if (! byte_buffer_in_use
)
4138 /* We must split the element into pieces that fall within
4139 separate bytes, and combine each byte with previous or
4140 following bit-fields. */
4142 /* next_offset is the offset n fbits from the beginning of
4143 the structure to the next bit of this element to be processed.
4144 end_offset is the offset of the first bit past the end of
4146 while (next_offset
< end_offset
)
4150 HOST_WIDE_INT value
;
4151 int next_byte
= next_offset
/ BITS_PER_UNIT
;
4152 int next_bit
= next_offset
% BITS_PER_UNIT
;
4154 /* Advance from byte to byte
4155 within this element when necessary. */
4156 while (next_byte
!= total_bytes
)
4158 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4163 /* Number of bits we can process at once
4164 (all part of the same byte). */
4165 this_time
= MIN (end_offset
- next_offset
,
4166 BITS_PER_UNIT
- next_bit
);
4167 if (BYTES_BIG_ENDIAN
)
4169 /* On big-endian machine, take the most significant bits
4170 first (of the bits that are significant)
4171 and put them into bytes from the most significant end. */
4172 shift
= end_offset
- next_offset
- this_time
;
4173 /* Don't try to take a bunch of bits that cross
4174 the word boundary in the INTEGER_CST. */
4175 if (shift
< HOST_BITS_PER_WIDE_INT
4176 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4178 this_time
-= (HOST_BITS_PER_WIDE_INT
- shift
);
4179 shift
= HOST_BITS_PER_WIDE_INT
;
4182 /* Now get the bits from the appropriate constant word. */
4183 if (shift
< HOST_BITS_PER_WIDE_INT
)
4185 value
= TREE_INT_CST_LOW (val
);
4187 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4189 value
= TREE_INT_CST_HIGH (val
);
4190 shift
-= HOST_BITS_PER_WIDE_INT
;
4194 byte
|= (((value
>> shift
)
4195 & (((HOST_WIDE_INT
) 1 << this_time
) - 1))
4196 << (BITS_PER_UNIT
- this_time
- next_bit
));
4200 /* On little-endian machines,
4201 take first the least significant bits of the value
4202 and pack them starting at the least significant
4203 bits of the bytes. */
4204 shift
= (next_offset
4205 - TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field
)));
4206 /* Don't try to take a bunch of bits that cross
4207 the word boundary in the INTEGER_CST. */
4208 if (shift
< HOST_BITS_PER_WIDE_INT
4209 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4211 this_time
-= (HOST_BITS_PER_WIDE_INT
- shift
);
4212 shift
= HOST_BITS_PER_WIDE_INT
;
4215 /* Now get the bits from the appropriate constant word. */
4216 if (shift
< HOST_BITS_PER_WIDE_INT
)
4217 value
= TREE_INT_CST_LOW (val
);
4218 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4220 value
= TREE_INT_CST_HIGH (val
);
4221 shift
-= HOST_BITS_PER_WIDE_INT
;
4225 byte
|= (((value
>> shift
)
4226 & (((HOST_WIDE_INT
) 1 << this_time
) - 1))
4229 next_offset
+= this_time
;
4230 byte_buffer_in_use
= 1;
4234 if (byte_buffer_in_use
)
4236 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4239 if (total_bytes
< size
)
4240 assemble_zeros (size
- total_bytes
);
4243 /* Output asm to handle ``#pragma weak'' */
4246 handle_pragma_weak (what
, name
, value
)
4247 enum pragma_state what
;
4250 #ifdef HANDLE_PRAGMA_WEAK
4251 if (what
== ps_name
|| what
== ps_value
)
4253 struct weak_syms
*weak
=
4254 (struct weak_syms
*)permalloc (sizeof (struct weak_syms
));
4255 weak
->next
= weak_decls
;
4256 weak
->name
= permalloc (strlen (name
) + 1);
4257 strcpy (weak
->name
, name
);
4259 if (what
!= ps_value
)
4260 weak
->value
= NULL_PTR
;
4264 weak
->value
= permalloc (strlen (value
) + 1);
4265 strcpy (weak
->value
, value
);
4270 else if (! (what
== ps_done
|| what
== ps_start
))
4271 warning ("malformed `#pragma weak'");
4272 #endif /* HANDLE_PRAGMA_WEAK */
4275 /* Declare DECL to be a weak symbol. */
4281 if (! TREE_PUBLIC (decl
))
4282 error_with_decl (decl
, "weak declaration of `%s' must be public");
4283 else if (TREE_ASM_WRITTEN (decl
))
4284 error_with_decl (decl
, "weak declaration of `%s' must precede definition");
4285 else if (SUPPORTS_WEAK
)
4286 DECL_WEAK (decl
) = 1;
4289 /* Emit any pending weak declarations. */
4294 #ifdef HANDLE_PRAGMA_WEAK
4295 if (HANDLE_PRAGMA_WEAK
)
4297 struct weak_syms
*t
;
4298 for (t
= weak_decls
; t
; t
= t
->next
)
4300 ASM_WEAKEN_LABEL (asm_out_file
, t
->name
);
4302 ASM_OUTPUT_DEF (asm_out_file
, t
->name
, t
->value
);
4309 assemble_alias (decl
, target
)
4314 make_decl_rtl (decl
, (char *) 0, 1);
4315 name
= XSTR (XEXP (DECL_RTL (decl
), 0), 0);
4317 #ifdef ASM_OUTPUT_DEF
4318 /* Make name accessible from other files, if appropriate. */
4320 if (TREE_PUBLIC (decl
))
4322 #ifdef ASM_WEAKEN_LABEL
4323 if (DECL_WEAK (decl
))
4324 ASM_WEAKEN_LABEL (asm_out_file
, name
);
4327 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
4330 ASM_OUTPUT_DEF (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4331 TREE_ASM_WRITTEN (decl
) = 1;
4333 #ifdef ASM_OUTPUT_WEAK_ALIAS
4334 if (! DECL_WEAK (decl
))
4335 warning ("only weak aliases are supported in this configuration");
4337 ASM_OUTPUT_WEAK_ALIAS (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4338 TREE_ASM_WRITTEN (decl
) = 1;
4340 warning ("alias definitions not supported in this configuration; ignored");
4345 /* This determines whether or not we support link-once semantics. */
4346 #ifndef SUPPORTS_ONE_ONLY
4347 #ifdef MAKE_DECL_ONE_ONLY
4348 #define SUPPORTS_ONE_ONLY 1
4350 #define SUPPORTS_ONE_ONLY 0
4354 /* Returns 1 if the target configuration supports defining public symbols
4355 so that one of them will be chosen at link time instead of generating a
4356 multiply-defined symbol error, whether through the use of weak symbols or
4357 a target-specific mechanism for having duplicates discarded. */
4360 supports_one_only ()
4362 if (SUPPORTS_ONE_ONLY
)
4364 return SUPPORTS_WEAK
;
4367 /* Set up DECL as a public symbol that can be defined in multiple
4368 translation units without generating a linker error. */
4371 make_decl_one_only (decl
)
4374 if (TREE_CODE (decl
) != VAR_DECL
&& TREE_CODE (decl
) != FUNCTION_DECL
)
4377 TREE_PUBLIC (decl
) = 1;
4379 if (TREE_CODE (decl
) == VAR_DECL
4380 && (DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
))
4381 DECL_COMMON (decl
) = 1;
4382 else if (SUPPORTS_ONE_ONLY
)
4384 #ifdef MAKE_DECL_ONE_ONLY
4385 MAKE_DECL_ONE_ONLY (decl
);
4387 DECL_ONE_ONLY (decl
) = 1;
4389 else if (SUPPORTS_WEAK
)
4390 DECL_WEAK (decl
) = 1;