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"
50 #ifdef XCOFF_DEBUGGING_INFO
54 #ifndef TRAMPOLINE_ALIGNMENT
55 #define TRAMPOLINE_ALIGNMENT FUNCTION_BOUNDARY
59 #define ASM_STABS_OP ".stabs"
62 /* Define the prefix to use when check_memory_usage_flag is enable. */
63 #ifdef NO_DOLLAR_IN_LABEL
64 #ifdef NO_DOT_IN_LABEL
65 #define CHKR_PREFIX "chkr_prefix_"
66 #else /* !NO_DOT_IN_LABEL */
67 #define CHKR_PREFIX "chkr."
69 #else /* !NO_DOLLAR_IN_LABEL */
70 #define CHKR_PREFIX "chkr$"
72 #define CHKR_PREFIX_SIZE (sizeof (CHKR_PREFIX) - 1)
74 /* This macro gets just the user-specified name
75 out of the string in a SYMBOL_REF. On most machines,
76 we discard the * if any and that's all. */
77 #ifndef STRIP_NAME_ENCODING
78 #define STRIP_NAME_ENCODING(VAR,SYMBOL_NAME) \
79 (VAR) = ((SYMBOL_NAME) + ((SYMBOL_NAME)[0] == '*'))
82 /* File in which assembler code is being written. */
84 extern FILE *asm_out_file
;
86 /* The (assembler) name of the first globally-visible object output. */
87 char *first_global_object_name
;
89 extern struct obstack
*current_obstack
;
90 extern struct obstack
*saveable_obstack
;
91 extern struct obstack
*rtl_obstack
;
92 extern struct obstack permanent_obstack
;
93 #define obstack_chunk_alloc xmalloc
95 /* Number for making the label on the next
96 constant that is stored in memory. */
100 /* Number for making the label on the next
101 static variable internal to a function. */
105 /* Carry information from ASM_DECLARE_OBJECT_NAME
106 to ASM_FINISH_DECLARE_OBJECT. */
108 int size_directive_output
;
110 /* The last decl for which assemble_variable was called,
111 if it did ASM_DECLARE_OBJECT_NAME.
112 If the last call to assemble_variable didn't do that,
115 tree last_assemble_variable_decl
;
118 #ifdef HANDLE_PRAGMA_WEAK
119 /* Any weak symbol declarations waiting to be emitted. */
123 struct weak_syms
*next
;
128 static struct weak_syms
*weak_decls
;
131 /* Nonzero if at least one function definition has been seen. */
133 static int function_defined
;
136 struct constant_descriptor
;
138 struct pool_constant
;
140 static char *strip_reg_name
PROTO((char *));
141 static int contains_pointers_p
PROTO((tree
));
142 static void decode_addr_const
PROTO((tree
, struct addr_const
*));
143 static int const_hash
PROTO((tree
));
144 static int compare_constant
PROTO((tree
,
145 struct constant_descriptor
*));
146 static char *compare_constant_1
PROTO((tree
, char *));
147 static struct constant_descriptor
*record_constant
PROTO((tree
));
148 static void record_constant_1
PROTO((tree
));
149 static tree copy_constant
PROTO((tree
));
150 static void output_constant_def_contents
PROTO((tree
, int, int));
151 static void decode_rtx_const
PROTO((enum machine_mode
, rtx
,
152 struct rtx_const
*));
153 static int const_hash_rtx
PROTO((enum machine_mode
, rtx
));
154 static int compare_constant_rtx
PROTO((enum machine_mode
, rtx
,
155 struct constant_descriptor
*));
156 static struct constant_descriptor
*record_constant_rtx
PROTO((enum machine_mode
,
158 static struct pool_constant
*find_pool_constant
PROTO((rtx
));
159 static void mark_constant_pool
PROTO((void));
160 static void mark_constants
PROTO((rtx
));
161 static int output_addressed_constants
PROTO((tree
));
162 static void output_after_function_constants
PROTO((void));
163 static void output_constructor
PROTO((tree
, int));
164 #ifdef ASM_OUTPUT_BSS
165 static void asm_output_bss
PROTO((FILE *, tree
, char *, int, int));
167 #ifdef BSS_SECTION_ASM_OP
168 #ifdef ASM_OUTPUT_ALIGNED_BSS
169 static void asm_output_aligned_bss
PROTO((FILE *, tree
, char *, int, int));
171 #endif /* BSS_SECTION_ASM_OP */
173 static enum in_section
{ no_section
, in_text
, in_data
, in_named
174 #ifdef BSS_SECTION_ASM_OP
177 #ifdef EH_FRAME_SECTION_ASM_OP
180 #ifdef EXTRA_SECTIONS
183 } in_section
= no_section
;
185 /* Return a non-zero value if DECL has a section attribute. */
186 #define IN_NAMED_SECTION(DECL) \
187 ((TREE_CODE (DECL) == FUNCTION_DECL || TREE_CODE (DECL) == VAR_DECL) \
188 && DECL_SECTION_NAME (DECL) != NULL_TREE)
190 /* Text of section name when in_section == in_named. */
191 static char *in_named_name
;
193 /* Define functions like text_section for any extra sections. */
194 #ifdef EXTRA_SECTION_FUNCTIONS
195 EXTRA_SECTION_FUNCTIONS
198 /* Tell assembler to switch to text section. */
203 if (in_section
!= in_text
)
205 fprintf (asm_out_file
, "%s\n", TEXT_SECTION_ASM_OP
);
206 in_section
= in_text
;
210 /* Tell assembler to switch to data section. */
215 if (in_section
!= in_data
)
217 if (flag_shared_data
)
219 #ifdef SHARED_SECTION_ASM_OP
220 fprintf (asm_out_file
, "%s\n", SHARED_SECTION_ASM_OP
);
222 fprintf (asm_out_file
, "%s\n", DATA_SECTION_ASM_OP
);
226 fprintf (asm_out_file
, "%s\n", DATA_SECTION_ASM_OP
);
228 in_section
= in_data
;
232 /* Tell assembler to switch to read-only data section. This is normally
236 readonly_data_section ()
238 #ifdef READONLY_DATA_SECTION
239 READONLY_DATA_SECTION (); /* Note this can call data_section. */
245 /* Determine if we're in the text section. */
250 return in_section
== in_text
;
253 /* Determine if we're in the data section. */
258 return in_section
== in_data
;
261 /* Tell assembler to change to section NAME for DECL.
262 If DECL is NULL, just switch to section NAME.
263 If NAME is NULL, get the name from DECL.
264 If RELOC is 1, the initializer for DECL contains relocs. */
267 named_section (decl
, name
, reloc
)
272 if (decl
!= NULL_TREE
273 && TREE_CODE_CLASS (TREE_CODE (decl
)) != 'd')
276 name
= TREE_STRING_POINTER (DECL_SECTION_NAME (decl
));
278 if (in_section
!= in_named
|| strcmp (name
, in_named_name
))
280 #ifdef ASM_OUTPUT_SECTION_NAME
281 ASM_OUTPUT_SECTION_NAME (asm_out_file
, decl
, name
, reloc
);
283 /* Section attributes are not supported if this macro isn't provided -
284 some host formats don't support them at all. The front-end should
285 already have flagged this as an error. */
289 in_named_name
= obstack_alloc (&permanent_obstack
, strlen (name
) + 1);
290 strcpy (in_named_name
, name
);
291 in_section
= in_named
;
295 #ifdef ASM_OUTPUT_SECTION_NAME
296 #ifndef UNIQUE_SECTION
297 #define UNIQUE_SECTION(DECL,RELOC) \
300 char *name, *string; \
302 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (DECL)); \
303 /* Strip off any encoding in name. */ \
304 STRIP_NAME_ENCODING (name, name); \
306 len = strlen (name) + 1; \
307 string = alloca (len + 1); \
308 sprintf (string, ".%s", name); \
310 DECL_SECTION_NAME (DECL) = build_string (len, string); \
313 #ifndef UNIQUE_SECTION_P
314 #define UNIQUE_SECTION_P(DECL) 0
318 #ifdef BSS_SECTION_ASM_OP
320 /* Tell the assembler to switch to the bss section. */
325 if (in_section
!= in_bss
)
327 #ifdef SHARED_BSS_SECTION_ASM_OP
328 if (flag_shared_data
)
329 fprintf (asm_out_file
, "%s\n", SHARED_BSS_SECTION_ASM_OP
);
332 fprintf (asm_out_file
, "%s\n", BSS_SECTION_ASM_OP
);
338 #ifdef ASM_OUTPUT_BSS
340 /* Utility function for ASM_OUTPUT_BSS for targets to use if
341 they don't support alignments in .bss.
342 ??? It is believed that this function will work in most cases so such
343 support is localized here. */
346 asm_output_bss (file
, decl
, name
, size
, rounded
)
352 ASM_GLOBALIZE_LABEL (file
, name
);
354 #ifdef ASM_DECLARE_OBJECT_NAME
355 last_assemble_variable_decl
= decl
;
356 ASM_DECLARE_OBJECT_NAME (file
, name
, decl
);
358 /* Standard thing is just output label for the object. */
359 ASM_OUTPUT_LABEL (file
, name
);
360 #endif /* ASM_DECLARE_OBJECT_NAME */
361 ASM_OUTPUT_SKIP (file
, rounded
);
366 #ifdef ASM_OUTPUT_ALIGNED_BSS
368 /* Utility function for targets to use in implementing
369 ASM_OUTPUT_ALIGNED_BSS.
370 ??? It is believed that this function will work in most cases so such
371 support is localized here. */
374 asm_output_aligned_bss (file
, decl
, name
, size
, align
)
380 ASM_GLOBALIZE_LABEL (file
, name
);
382 ASM_OUTPUT_ALIGN (file
, floor_log2 (align
/ BITS_PER_UNIT
));
383 #ifdef ASM_DECLARE_OBJECT_NAME
384 last_assemble_variable_decl
= decl
;
385 ASM_DECLARE_OBJECT_NAME (file
, name
, decl
);
387 /* Standard thing is just output label for the object. */
388 ASM_OUTPUT_LABEL (file
, name
);
389 #endif /* ASM_DECLARE_OBJECT_NAME */
390 ASM_OUTPUT_SKIP (file
, size
? size
: 1);
395 #endif /* BSS_SECTION_ASM_OP */
397 #ifdef EH_FRAME_SECTION_ASM_OP
401 if (in_section
!= in_eh_frame
)
403 fprintf (asm_out_file
, "%s\n", EH_FRAME_SECTION_ASM_OP
);
404 in_section
= in_eh_frame
;
409 /* Switch to the section for function DECL.
411 If DECL is NULL_TREE, switch to the text section.
412 ??? It's not clear that we will ever be passed NULL_TREE, but it's
413 safer to handle it. */
416 function_section (decl
)
419 if (decl
!= NULL_TREE
420 && DECL_SECTION_NAME (decl
) != NULL_TREE
)
421 named_section (decl
, (char *) 0, 0);
426 /* Switch to section for variable DECL.
428 RELOC is the `reloc' argument to SELECT_SECTION. */
431 variable_section (decl
, reloc
)
435 if (IN_NAMED_SECTION (decl
))
436 named_section (decl
, NULL
, reloc
);
439 /* C++ can have const variables that get initialized from constructors,
440 and thus can not be in a readonly section. We prevent this by
441 verifying that the initial value is constant for objects put in a
444 error_mark_node is used by the C front end to indicate that the
445 initializer has not been seen yet. In this case, we assume that
446 the initializer must be constant.
448 C++ uses error_mark_node for variables that have complicated
449 initializers, but these variables go in BSS so we won't be called
452 #ifdef SELECT_SECTION
453 SELECT_SECTION (decl
, reloc
);
455 if (DECL_READONLY_SECTION (decl
, reloc
))
456 readonly_data_section ();
463 /* Tell assembler to switch to the section for the exception handling
469 #if defined (EXCEPTION_SECTION)
470 EXCEPTION_SECTION ();
472 #ifdef ASM_OUTPUT_SECTION_NAME
473 named_section (NULL_TREE
, ".gcc_except_table", 0);
478 readonly_data_section ();
483 /* Create the rtl to represent a function, for a function definition.
484 DECL is a FUNCTION_DECL node which describes which function.
485 The rtl is stored into DECL. */
488 make_function_rtl (decl
)
491 char *name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
492 char *new_name
= name
;
494 /* Rename a nested function to avoid conflicts. */
495 if (decl_function_context (decl
) != 0
496 && DECL_INITIAL (decl
) != 0
497 && DECL_RTL (decl
) == 0)
501 name
= IDENTIFIER_POINTER (DECL_NAME (decl
));
502 ASM_FORMAT_PRIVATE_NAME (label
, name
, var_labelno
);
503 name
= obstack_copy0 (saveable_obstack
, label
, strlen (label
));
508 /* When -fprefix-function-name is used, every function name is
509 prefixed. Even static functions are prefixed because they
510 could be declared latter. Note that a nested function name
512 if (flag_prefix_function_name
)
514 new_name
= (char *) alloca (strlen (name
) + CHKR_PREFIX_SIZE
+ 1);
515 strcpy (new_name
, CHKR_PREFIX
);
516 strcpy (new_name
+ CHKR_PREFIX_SIZE
, name
);
517 name
= obstack_copy0 (saveable_obstack
, new_name
, strlen (new_name
));
521 if (DECL_RTL (decl
) == 0)
524 = gen_rtx_MEM (DECL_MODE (decl
),
525 gen_rtx_SYMBOL_REF (Pmode
, name
));
527 /* Optionally set flags or add text to the name to record information
528 such as that it is a function name. If the name is changed, the macro
529 ASM_OUTPUT_LABELREF will have to know how to strip this information. */
530 #ifdef ENCODE_SECTION_INFO
531 ENCODE_SECTION_INFO (decl
);
536 /* ??? Another way to do this would be to do what halfpic.c does
537 and maintain a hashed table of such critters. */
538 /* ??? Another way to do this would be to pass a flag bit to
539 ENCODE_SECTION_INFO saying whether this is a new decl or not. */
540 /* Let the target reassign the RTL if it wants.
541 This is necessary, for example, when one machine specific
542 decl attribute overrides another. */
543 #ifdef REDO_SECTION_INFO_P
544 if (REDO_SECTION_INFO_P (decl
))
545 ENCODE_SECTION_INFO (decl
);
549 /* Record at least one function has been defined. */
550 function_defined
= 1;
553 /* Given NAME, a putative register name, discard any customary prefixes. */
556 strip_reg_name (name
)
559 #ifdef REGISTER_PREFIX
560 if (!strncmp (name
, REGISTER_PREFIX
, strlen (REGISTER_PREFIX
)))
561 name
+= strlen (REGISTER_PREFIX
);
563 if (name
[0] == '%' || name
[0] == '#')
568 /* Decode an `asm' spec for a declaration as a register name.
569 Return the register number, or -1 if nothing specified,
570 or -2 if the ASMSPEC is not `cc' or `memory' and is not recognized,
571 or -3 if ASMSPEC is `cc' and is not recognized,
572 or -4 if ASMSPEC is `memory' and is not recognized.
573 Accept an exact spelling or a decimal number.
574 Prefixes such as % are optional. */
577 decode_reg_name (asmspec
)
584 /* Get rid of confusing prefixes. */
585 asmspec
= strip_reg_name (asmspec
);
587 /* Allow a decimal number as a "register name". */
588 for (i
= strlen (asmspec
) - 1; i
>= 0; i
--)
589 if (! (asmspec
[i
] >= '0' && asmspec
[i
] <= '9'))
591 if (asmspec
[0] != 0 && i
< 0)
594 if (i
< FIRST_PSEUDO_REGISTER
&& i
>= 0)
600 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
602 && ! strcmp (asmspec
, strip_reg_name (reg_names
[i
])))
605 #ifdef ADDITIONAL_REGISTER_NAMES
607 static struct { char *name
; int number
; } table
[]
608 = ADDITIONAL_REGISTER_NAMES
;
610 for (i
= 0; i
< sizeof (table
) / sizeof (table
[0]); i
++)
611 if (! strcmp (asmspec
, table
[i
].name
))
612 return table
[i
].number
;
614 #endif /* ADDITIONAL_REGISTER_NAMES */
616 if (!strcmp (asmspec
, "memory"))
619 if (!strcmp (asmspec
, "cc"))
628 /* Create the DECL_RTL for a declaration for a static or external variable
629 or static or external function.
630 ASMSPEC, if not 0, is the string which the user specified
631 as the assembler symbol name.
632 TOP_LEVEL is nonzero if this is a file-scope variable.
634 This is never called for PARM_DECL nodes. */
637 make_decl_rtl (decl
, asmspec
, top_level
)
642 register char *name
= 0;
645 reg_number
= decode_reg_name (asmspec
);
647 if (DECL_ASSEMBLER_NAME (decl
) != NULL_TREE
)
648 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
650 if (reg_number
== -2)
652 /* ASMSPEC is given, and not the name of a register. */
653 name
= (char *) obstack_alloc (saveable_obstack
,
654 strlen (asmspec
) + 2);
656 strcpy (&name
[1], asmspec
);
659 /* For a duplicate declaration, we can be called twice on the
660 same DECL node. Don't discard the RTL already made. */
661 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
));
769 /* If this variable is to be treated as volatile, show its
770 tree node has side effects. If it has side effects, either
771 because of this test or from TREE_THIS_VOLATILE also
772 being set, show the MEM is volatile. */
773 if (flag_volatile_global
&& TREE_CODE (decl
) == VAR_DECL
774 && TREE_PUBLIC (decl
))
775 TREE_SIDE_EFFECTS (decl
) = 1;
776 if (TREE_SIDE_EFFECTS (decl
))
777 MEM_VOLATILE_P (DECL_RTL (decl
)) = 1;
779 if (TREE_READONLY (decl
))
780 RTX_UNCHANGING_P (DECL_RTL (decl
)) = 1;
781 MEM_IN_STRUCT_P (DECL_RTL (decl
))
782 = AGGREGATE_TYPE_P (TREE_TYPE (decl
));
784 /* Optionally set flags or add text to the name to record information
785 such as that it is a function name.
786 If the name is changed, the macro ASM_OUTPUT_LABELREF
787 will have to know how to strip this information. */
788 #ifdef ENCODE_SECTION_INFO
789 ENCODE_SECTION_INFO (decl
);
795 /* If the old RTL had the wrong mode, fix the mode. */
796 if (GET_MODE (DECL_RTL (decl
)) != DECL_MODE (decl
))
798 rtx rtl
= DECL_RTL (decl
);
799 PUT_MODE (rtl
, DECL_MODE (decl
));
802 /* ??? Another way to do this would be to do what halfpic.c does
803 and maintain a hashed table of such critters. */
804 /* ??? Another way to do this would be to pass a flag bit to
805 ENCODE_SECTION_INFO saying whether this is a new decl or not. */
806 /* Let the target reassign the RTL if it wants.
807 This is necessary, for example, when one machine specific
808 decl attribute overrides another. */
809 #ifdef REDO_SECTION_INFO_P
810 if (REDO_SECTION_INFO_P (decl
))
811 ENCODE_SECTION_INFO (decl
);
816 /* Make the rtl for variable VAR be volatile.
817 Use this only for static variables. */
820 make_var_volatile (var
)
823 if (GET_CODE (DECL_RTL (var
)) != MEM
)
826 MEM_VOLATILE_P (DECL_RTL (var
)) = 1;
829 /* Output alignment directive to align for constant expression EXP. */
832 assemble_constant_align (exp
)
837 /* Align the location counter as required by EXP's data type. */
838 align
= TYPE_ALIGN (TREE_TYPE (exp
));
839 #ifdef CONSTANT_ALIGNMENT
840 align
= CONSTANT_ALIGNMENT (exp
, align
);
843 if (align
> BITS_PER_UNIT
)
844 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
847 /* Output a string of literal assembler code
848 for an `asm' keyword used between functions. */
851 assemble_asm (string
)
856 if (TREE_CODE (string
) == ADDR_EXPR
)
857 string
= TREE_OPERAND (string
, 0);
859 fprintf (asm_out_file
, "\t%s\n", TREE_STRING_POINTER (string
));
862 #if 0 /* This should no longer be needed, because
863 flag_gnu_linker should be 0 on these systems,
864 which should prevent any output
865 if ASM_OUTPUT_CONSTRUCTOR and ASM_OUTPUT_DESTRUCTOR are absent. */
866 #if !(defined(DBX_DEBUGGING_INFO) && !defined(FASCIST_ASSEMBLER))
867 #ifndef ASM_OUTPUT_CONSTRUCTOR
868 #define ASM_OUTPUT_CONSTRUCTOR(file, name)
870 #ifndef ASM_OUTPUT_DESTRUCTOR
871 #define ASM_OUTPUT_DESTRUCTOR(file, name)
876 /* Record an element in the table of global destructors.
877 How this is done depends on what sort of assembler and linker
880 NAME should be the name of a global function to be called
881 at exit time. This name is output using assemble_name. */
884 assemble_destructor (name
)
887 #ifdef ASM_OUTPUT_DESTRUCTOR
888 ASM_OUTPUT_DESTRUCTOR (asm_out_file
, name
);
892 /* Now tell GNU LD that this is part of the static destructor set. */
893 /* This code works for any machine provided you use GNU as/ld. */
894 fprintf (asm_out_file
, "%s \"___DTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
895 assemble_name (asm_out_file
, name
);
896 fputc ('\n', asm_out_file
);
901 /* Likewise for global constructors. */
904 assemble_constructor (name
)
907 #ifdef ASM_OUTPUT_CONSTRUCTOR
908 ASM_OUTPUT_CONSTRUCTOR (asm_out_file
, name
);
912 /* Now tell GNU LD that this is part of the static constructor set. */
913 /* This code works for any machine provided you use GNU as/ld. */
914 fprintf (asm_out_file
, "%s \"___CTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
915 assemble_name (asm_out_file
, name
);
916 fputc ('\n', asm_out_file
);
921 /* Likewise for entries we want to record for garbage collection.
922 Garbage collection is still under development. */
925 assemble_gc_entry (name
)
928 #ifdef ASM_OUTPUT_GC_ENTRY
929 ASM_OUTPUT_GC_ENTRY (asm_out_file
, name
);
933 /* Now tell GNU LD that this is part of the static constructor set. */
934 fprintf (asm_out_file
, "%s \"___PTR_LIST__\",22,0,0,", ASM_STABS_OP
);
935 assemble_name (asm_out_file
, name
);
936 fputc ('\n', asm_out_file
);
941 /* CONSTANT_POOL_BEFORE_FUNCTION may be defined as an expression with
942 a non-zero value if the constant pool should be output before the
943 start of the function, or a zero value if the pool should output
944 after the end of the function. The default is to put it before the
947 #ifndef CONSTANT_POOL_BEFORE_FUNCTION
948 #define CONSTANT_POOL_BEFORE_FUNCTION 1
951 /* Output assembler code for the constant pool of a function and associated
952 with defining the name of the function. DECL describes the function.
953 NAME is the function's name. For the constant pool, we use the current
954 constant pool data. */
957 assemble_start_function (decl
, fnname
)
963 /* The following code does not need preprocessing in the assembler. */
967 if (CONSTANT_POOL_BEFORE_FUNCTION
)
968 output_constant_pool (fnname
, decl
);
970 #ifdef ASM_OUTPUT_SECTION_NAME
971 /* If the function is to be put in its own section and it's not in a section
972 already, indicate so. */
973 if ((flag_function_sections
974 && DECL_SECTION_NAME (decl
) == NULL_TREE
)
975 || UNIQUE_SECTION_P (decl
))
976 UNIQUE_SECTION (decl
, 0);
979 function_section (decl
);
981 /* Tell assembler to move to target machine's alignment for functions. */
982 align
= floor_log2 (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
984 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
986 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
987 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file
, fnname
);
990 #ifdef SDB_DEBUGGING_INFO
991 /* Output SDB definition of the function. */
992 if (write_symbols
== SDB_DEBUG
)
993 sdbout_mark_begin_function ();
996 #ifdef DBX_DEBUGGING_INFO
997 /* Output DBX definition of the function. */
998 if (write_symbols
== DBX_DEBUG
)
999 dbxout_begin_function (decl
);
1002 /* Make function name accessible from other files, if appropriate. */
1004 if (TREE_PUBLIC (decl
))
1006 if (!first_global_object_name
&& ! DECL_WEAK (decl
)
1007 && ! DECL_ONE_ONLY (decl
))
1011 STRIP_NAME_ENCODING (p
, fnname
);
1012 first_global_object_name
= permalloc (strlen (p
) + 1);
1013 strcpy (first_global_object_name
, p
);
1016 #ifdef ASM_WEAKEN_LABEL
1017 if (DECL_WEAK (decl
))
1018 ASM_WEAKEN_LABEL (asm_out_file
, fnname
);
1021 ASM_GLOBALIZE_LABEL (asm_out_file
, fnname
);
1024 /* Do any machine/system dependent processing of the function name */
1025 #ifdef ASM_DECLARE_FUNCTION_NAME
1026 ASM_DECLARE_FUNCTION_NAME (asm_out_file
, fnname
, current_function_decl
);
1028 /* Standard thing is just output label for the function. */
1029 ASM_OUTPUT_LABEL (asm_out_file
, fnname
);
1030 #endif /* ASM_DECLARE_FUNCTION_NAME */
1033 /* Output assembler code associated with defining the size of the
1034 function. DECL describes the function. NAME is the function's name. */
1037 assemble_end_function (decl
, fnname
)
1041 #ifdef ASM_DECLARE_FUNCTION_SIZE
1042 ASM_DECLARE_FUNCTION_SIZE (asm_out_file
, fnname
, decl
);
1044 if (! CONSTANT_POOL_BEFORE_FUNCTION
)
1046 output_constant_pool (fnname
, decl
);
1047 function_section (decl
); /* need to switch back */
1050 /* Output any constants which should appear after the function. */
1051 output_after_function_constants ();
1054 /* Assemble code to leave SIZE bytes of zeros. */
1057 assemble_zeros (size
)
1060 #ifdef ASM_NO_SKIP_IN_TEXT
1061 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
1062 so we must output 0s explicitly in the text section. */
1063 if (ASM_NO_SKIP_IN_TEXT
&& in_text_section ())
1067 for (i
= 0; i
< size
- 20; i
+= 20)
1070 fprintf (asm_out_file
,
1071 "%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
);
1073 fprintf (asm_out_file
,
1074 "\tbyte 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n");
1080 fprintf (asm_out_file
, "%s 0", ASM_BYTE_OP
);
1082 fprintf (asm_out_file
, "\tbyte 0");
1085 for (; i
< size
; i
++)
1086 fprintf (asm_out_file
, ",0");
1087 fprintf (asm_out_file
, "\n");
1093 ASM_OUTPUT_SKIP (asm_out_file
, size
);
1096 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
1099 assemble_align (align
)
1102 if (align
> BITS_PER_UNIT
)
1103 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
1106 /* Assemble a string constant with the specified C string as contents. */
1109 assemble_string (p
, size
)
1116 /* If the string is very long, split it up. */
1120 int thissize
= size
- pos
;
1121 if (thissize
> maximum
)
1124 ASM_OUTPUT_ASCII (asm_out_file
, p
, thissize
);
1132 /* Assemble everything that is needed for a variable or function declaration.
1133 Not used for automatic variables, and not used for function definitions.
1134 Should not be called for variables of incomplete structure type.
1136 TOP_LEVEL is nonzero if this variable has file scope.
1137 AT_END is nonzero if this is the special handling, at end of compilation,
1138 to define things that have had only tentative definitions.
1139 DONT_OUTPUT_DATA if nonzero means don't actually output the
1140 initial value (that will be done by the caller). */
1143 assemble_variable (decl
, top_level
, at_end
, dont_output_data
)
1147 int dont_output_data
;
1149 register char *name
;
1153 enum in_section saved_in_section
;
1155 last_assemble_variable_decl
= 0;
1157 if (GET_CODE (DECL_RTL (decl
)) == REG
)
1159 /* Do output symbol info for global register variables, but do nothing
1162 if (TREE_ASM_WRITTEN (decl
))
1164 TREE_ASM_WRITTEN (decl
) = 1;
1166 #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
1167 /* File-scope global variables are output here. */
1168 if ((write_symbols
== DBX_DEBUG
|| write_symbols
== XCOFF_DEBUG
)
1170 dbxout_symbol (decl
, 0);
1172 #ifdef SDB_DEBUGGING_INFO
1173 if (write_symbols
== SDB_DEBUG
&& top_level
1174 /* Leave initialized global vars for end of compilation;
1175 see comment in compile_file. */
1176 && (TREE_PUBLIC (decl
) == 0 || DECL_INITIAL (decl
) == 0))
1177 sdbout_symbol (decl
, 0);
1180 /* Don't output any DWARF debugging information for variables here.
1181 In the case of local variables, the information for them is output
1182 when we do our recursive traversal of the tree representation for
1183 the entire containing function. In the case of file-scope variables,
1184 we output information for all of them at the very end of compilation
1185 while we are doing our final traversal of the chain of file-scope
1191 /* Normally no need to say anything here for external references,
1192 since assemble_external is called by the language-specific code
1193 when a declaration is first seen. */
1195 if (DECL_EXTERNAL (decl
))
1198 /* Output no assembler code for a function declaration.
1199 Only definitions of functions output anything. */
1201 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1204 /* If type was incomplete when the variable was declared,
1205 see if it is complete now. */
1207 if (DECL_SIZE (decl
) == 0)
1208 layout_decl (decl
, 0);
1210 /* Still incomplete => don't allocate it; treat the tentative defn
1211 (which is what it must have been) as an `extern' reference. */
1213 if (!dont_output_data
&& DECL_SIZE (decl
) == 0)
1215 error_with_file_and_line (DECL_SOURCE_FILE (decl
),
1216 DECL_SOURCE_LINE (decl
),
1217 "storage size of `%s' isn't known",
1218 IDENTIFIER_POINTER (DECL_NAME (decl
)));
1219 TREE_ASM_WRITTEN (decl
) = 1;
1223 /* The first declaration of a variable that comes through this function
1224 decides whether it is global (in C, has external linkage)
1225 or local (in C, has internal linkage). So do nothing more
1226 if this function has already run. */
1228 if (TREE_ASM_WRITTEN (decl
))
1231 TREE_ASM_WRITTEN (decl
) = 1;
1235 if (! dont_output_data
)
1239 if (TREE_CODE (DECL_SIZE (decl
)) != INTEGER_CST
)
1242 /* This is better than explicit arithmetic, since it avoids overflow. */
1243 size_tree
= size_binop (CEIL_DIV_EXPR
,
1244 DECL_SIZE (decl
), size_int (BITS_PER_UNIT
));
1246 size
= TREE_INT_CST_LOW (size_tree
);
1247 if (TREE_INT_CST_HIGH (size_tree
) != 0
1248 || size
!= TREE_INT_CST_LOW (size_tree
))
1250 error_with_decl (decl
, "size of variable `%s' is too large");
1255 name
= XSTR (XEXP (DECL_RTL (decl
), 0), 0);
1257 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
)
1258 && ! first_global_object_name
1259 && ! (DECL_COMMON (decl
) && (DECL_INITIAL (decl
) == 0
1260 || DECL_INITIAL (decl
) == error_mark_node
))
1261 && ! DECL_WEAK (decl
)
1262 && ! DECL_ONE_ONLY (decl
))
1266 STRIP_NAME_ENCODING (p
, name
);
1267 first_global_object_name
= permalloc (strlen (p
) + 1);
1268 strcpy (first_global_object_name
, p
);
1271 /* Compute the alignment of this data. */
1273 align
= DECL_ALIGN (decl
);
1275 /* In the case for initialing an array whose length isn't specified,
1276 where we have not yet been able to do the layout,
1277 figure out the proper alignment now. */
1278 if (dont_output_data
&& DECL_SIZE (decl
) == 0
1279 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
)
1280 align
= MAX (align
, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl
))));
1282 /* Some object file formats have a maximum alignment which they support.
1283 In particular, a.out format supports a maximum alignment of 4. */
1284 #ifndef MAX_OFILE_ALIGNMENT
1285 #define MAX_OFILE_ALIGNMENT BIGGEST_ALIGNMENT
1287 if (align
> MAX_OFILE_ALIGNMENT
)
1289 warning_with_decl (decl
,
1290 "alignment of `%s' is greater than maximum object file alignment. Using %d.",
1291 MAX_OFILE_ALIGNMENT
/BITS_PER_UNIT
);
1292 align
= MAX_OFILE_ALIGNMENT
;
1295 /* On some machines, it is good to increase alignment sometimes. */
1296 #ifdef DATA_ALIGNMENT
1297 align
= DATA_ALIGNMENT (TREE_TYPE (decl
), align
);
1299 #ifdef CONSTANT_ALIGNMENT
1300 if (DECL_INITIAL (decl
) != 0 && DECL_INITIAL (decl
) != error_mark_node
)
1301 align
= CONSTANT_ALIGNMENT (DECL_INITIAL (decl
), align
);
1304 /* Reset the alignment in case we have made it tighter, so we can benefit
1305 from it in get_pointer_alignment. */
1306 DECL_ALIGN (decl
) = align
;
1308 /* Handle uninitialized definitions. */
1310 if ((DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
)
1311 /* If the target can't output uninitialized but not common global data
1312 in .bss, then we have to use .data. */
1313 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
1314 && DECL_COMMON (decl
)
1316 && ! dont_output_data
)
1318 int size
= TREE_INT_CST_LOW (size_tree
);
1321 /* Don't allocate zero bytes of common,
1322 since that means "undefined external" in the linker. */
1323 if (size
== 0) rounded
= 1;
1324 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1325 so that each uninitialized object starts on such a boundary. */
1326 rounded
+= (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1;
1327 rounded
= (rounded
/ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1328 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1330 #ifdef DBX_DEBUGGING_INFO
1331 /* File-scope global variables are output here. */
1332 if (write_symbols
== DBX_DEBUG
&& top_level
)
1333 dbxout_symbol (decl
, 0);
1335 #ifdef SDB_DEBUGGING_INFO
1336 if (write_symbols
== SDB_DEBUG
&& top_level
1337 /* Leave initialized global vars for end of compilation;
1338 see comment in compile_file. */
1339 && (TREE_PUBLIC (decl
) == 0 || DECL_INITIAL (decl
) == 0))
1340 sdbout_symbol (decl
, 0);
1343 /* Don't output any DWARF debugging information for variables here.
1344 In the case of local variables, the information for them is output
1345 when we do our recursive traversal of the tree representation for
1346 the entire containing function. In the case of file-scope variables,
1347 we output information for all of them at the very end of compilation
1348 while we are doing our final traversal of the chain of file-scope
1351 #if 0 /* ??? We should either delete this or add a comment describing what
1352 it was intended to do and why we shouldn't delete it. */
1353 if (flag_shared_data
)
1357 if (TREE_PUBLIC (decl
)
1358 #if defined (ASM_OUTPUT_BSS) || defined (ASM_OUTPUT_ALIGNED_BSS)
1359 && DECL_COMMON (decl
)
1363 #ifdef ASM_OUTPUT_SHARED_COMMON
1364 if (flag_shared_data
)
1365 ASM_OUTPUT_SHARED_COMMON (asm_out_file
, name
, size
, rounded
);
1369 #ifdef ASM_OUTPUT_ALIGNED_DECL_COMMON
1370 ASM_OUTPUT_ALIGNED_DECL_COMMON (asm_out_file
, decl
, name
, size
,
1373 #ifdef ASM_OUTPUT_ALIGNED_COMMON
1374 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file
, name
, size
,
1377 ASM_OUTPUT_COMMON (asm_out_file
, name
, size
, rounded
);
1382 #if defined (ASM_OUTPUT_BSS) || defined (ASM_OUTPUT_ALIGNED_BSS)
1383 else if (TREE_PUBLIC (decl
))
1385 #ifdef ASM_OUTPUT_SHARED_BSS
1386 if (flag_shared_data
)
1387 ASM_OUTPUT_SHARED_BSS (asm_out_file
, decl
, name
, size
, rounded
);
1391 #ifdef ASM_OUTPUT_ALIGNED_BSS
1392 ASM_OUTPUT_ALIGNED_BSS (asm_out_file
, decl
, name
, size
,
1395 ASM_OUTPUT_BSS (asm_out_file
, decl
, name
, size
, rounded
);
1399 #endif /* ASM_OUTPUT_BSS || ASM_OUTPUT_ALIGNED_BSS */
1402 #ifdef ASM_OUTPUT_SHARED_LOCAL
1403 if (flag_shared_data
)
1404 ASM_OUTPUT_SHARED_LOCAL (asm_out_file
, name
, size
, rounded
);
1408 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
1409 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file
, decl
, name
, size
,
1412 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1413 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file
, name
, size
,
1416 ASM_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
1424 /* Handle initialized definitions.
1425 Also handle uninitialized global definitions if -fno-common and the
1426 target doesn't support ASM_OUTPUT_BSS. */
1428 /* First make the assembler name(s) global if appropriate. */
1429 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
))
1431 #ifdef ASM_WEAKEN_LABEL
1432 if (DECL_WEAK (decl
))
1433 ASM_WEAKEN_LABEL (asm_out_file
, name
);
1436 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
1439 for (d
= equivalents
; d
; d
= TREE_CHAIN (d
))
1441 tree e
= TREE_VALUE (d
);
1442 if (TREE_PUBLIC (e
) && DECL_NAME (e
))
1443 ASM_GLOBALIZE_LABEL (asm_out_file
,
1444 XSTR (XEXP (DECL_RTL (e
), 0), 0));
1448 /* Output any data that we will need to use the address of. */
1449 if (DECL_INITIAL (decl
) == error_mark_node
)
1450 reloc
= contains_pointers_p (TREE_TYPE (decl
));
1451 else if (DECL_INITIAL (decl
))
1452 reloc
= output_addressed_constants (DECL_INITIAL (decl
));
1454 #ifdef ASM_OUTPUT_SECTION_NAME
1455 if (UNIQUE_SECTION_P (decl
))
1456 UNIQUE_SECTION (decl
, reloc
);
1459 /* Switch to the appropriate section. */
1460 variable_section (decl
, reloc
);
1462 /* dbxout.c needs to know this. */
1463 if (in_text_section ())
1464 DECL_IN_TEXT_SECTION (decl
) = 1;
1466 /* Record current section so we can restore it if dbxout.c clobbers it. */
1467 saved_in_section
= in_section
;
1469 /* Output the dbx info now that we have chosen the section. */
1471 #ifdef DBX_DEBUGGING_INFO
1472 /* File-scope global variables are output here. */
1473 if (write_symbols
== DBX_DEBUG
&& top_level
)
1474 dbxout_symbol (decl
, 0);
1476 #ifdef SDB_DEBUGGING_INFO
1477 if (write_symbols
== SDB_DEBUG
&& top_level
1478 /* Leave initialized global vars for end of compilation;
1479 see comment in compile_file. */
1480 && (TREE_PUBLIC (decl
) == 0 || DECL_INITIAL (decl
) == 0))
1481 sdbout_symbol (decl
, 0);
1484 /* Don't output any DWARF debugging information for variables here.
1485 In the case of local variables, the information for them is output
1486 when we do our recursive traversal of the tree representation for
1487 the entire containing function. In the case of file-scope variables,
1488 we output information for all of them at the very end of compilation
1489 while we are doing our final traversal of the chain of file-scope
1492 /* If the debugging output changed sections, reselect the section
1493 that's supposed to be selected. */
1494 if (in_section
!= saved_in_section
)
1495 variable_section (decl
, reloc
);
1497 /* Output the alignment of this data. */
1498 if (align
> BITS_PER_UNIT
)
1499 ASM_OUTPUT_ALIGN (asm_out_file
,
1500 floor_log2 (DECL_ALIGN (decl
) / BITS_PER_UNIT
));
1502 /* Do any machine/system dependent processing of the object. */
1503 #ifdef ASM_DECLARE_OBJECT_NAME
1504 last_assemble_variable_decl
= decl
;
1505 ASM_DECLARE_OBJECT_NAME (asm_out_file
, name
, decl
);
1507 /* Standard thing is just output label for the object. */
1508 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1509 #endif /* ASM_DECLARE_OBJECT_NAME */
1511 if (!dont_output_data
)
1513 if (DECL_INITIAL (decl
))
1514 /* Output the actual data. */
1515 output_constant (DECL_INITIAL (decl
), TREE_INT_CST_LOW (size_tree
));
1517 /* Leave space for it. */
1518 assemble_zeros (TREE_INT_CST_LOW (size_tree
));
1522 #ifdef XCOFF_DEBUGGING_INFO
1523 /* Unfortunately, the IBM assembler cannot handle stabx before the actual
1524 declaration. When something like ".stabx "aa:S-2",aa,133,0" is emitted
1525 and `aa' hasn't been output yet, the assembler generates a stab entry with
1526 a value of zero, in addition to creating an unnecessary external entry
1527 for `aa'. Hence, we must postpone dbxout_symbol to here at the end. */
1529 /* File-scope global variables are output here. */
1530 if (write_symbols
== XCOFF_DEBUG
&& top_level
)
1532 saved_in_section
= in_section
;
1534 dbxout_symbol (decl
, 0);
1536 if (in_section
!= saved_in_section
)
1537 variable_section (decl
, reloc
);
1540 /* There must be a statement after a label. */
1545 /* Return 1 if type TYPE contains any pointers. */
1548 contains_pointers_p (type
)
1551 switch (TREE_CODE (type
))
1554 case REFERENCE_TYPE
:
1555 /* I'm not sure whether OFFSET_TYPE needs this treatment,
1556 so I'll play safe and return 1. */
1562 case QUAL_UNION_TYPE
:
1565 /* For a type that has fields, see if the fields have pointers. */
1566 for (fields
= TYPE_FIELDS (type
); fields
; fields
= TREE_CHAIN (fields
))
1567 if (TREE_CODE (fields
) == FIELD_DECL
1568 && contains_pointers_p (TREE_TYPE (fields
)))
1574 /* An array type contains pointers if its element type does. */
1575 return contains_pointers_p (TREE_TYPE (type
));
1582 /* Output something to declare an external symbol to the assembler.
1583 (Most assemblers don't need this, so we normally output nothing.)
1584 Do nothing if DECL is not external. */
1587 assemble_external (decl
)
1590 #ifdef ASM_OUTPUT_EXTERNAL
1591 if (TREE_CODE_CLASS (TREE_CODE (decl
)) == 'd'
1592 && DECL_EXTERNAL (decl
) && TREE_PUBLIC (decl
))
1594 rtx rtl
= DECL_RTL (decl
);
1596 if (GET_CODE (rtl
) == MEM
&& GET_CODE (XEXP (rtl
, 0)) == SYMBOL_REF
1597 && ! SYMBOL_REF_USED (XEXP (rtl
, 0)))
1599 /* Some systems do require some output. */
1600 SYMBOL_REF_USED (XEXP (rtl
, 0)) = 1;
1601 ASM_OUTPUT_EXTERNAL (asm_out_file
, decl
, XSTR (XEXP (rtl
, 0), 0));
1607 /* Similar, for calling a library function FUN. */
1610 assemble_external_libcall (fun
)
1613 #ifdef ASM_OUTPUT_EXTERNAL_LIBCALL
1614 /* Declare library function name external when first used, if nec. */
1615 if (! SYMBOL_REF_USED (fun
))
1617 SYMBOL_REF_USED (fun
) = 1;
1618 ASM_OUTPUT_EXTERNAL_LIBCALL (asm_out_file
, fun
);
1623 /* Declare the label NAME global. */
1626 assemble_global (name
)
1629 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
1632 /* Assemble a label named NAME. */
1635 assemble_label (name
)
1638 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1641 /* Output to FILE a reference to the assembler name of a C-level name NAME.
1642 If NAME starts with a *, the rest of NAME is output verbatim.
1643 Otherwise NAME is transformed in an implementation-defined way
1644 (usually by the addition of an underscore).
1645 Many macros in the tm file are defined to call this function. */
1648 assemble_name (file
, name
)
1655 STRIP_NAME_ENCODING (real_name
, name
);
1656 if (flag_prefix_function_name
1657 && ! bcmp (real_name
, CHKR_PREFIX
, CHKR_PREFIX_SIZE
))
1658 real_name
= real_name
+ CHKR_PREFIX_SIZE
;
1660 id
= maybe_get_identifier (real_name
);
1662 TREE_SYMBOL_REFERENCED (id
) = 1;
1665 fputs (&name
[1], file
);
1667 ASM_OUTPUT_LABELREF (file
, name
);
1670 /* Allocate SIZE bytes writable static space with a gensym name
1671 and return an RTX to refer to its address. */
1674 assemble_static_space (size
)
1680 #ifndef ASM_OUTPUT_ALIGNED_LOCAL
1681 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1682 so that each uninitialized object starts on such a boundary. */
1683 int rounded
= ((size
+ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1)
1684 / (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1685 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1689 if (flag_shared_data
)
1693 ASM_GENERATE_INTERNAL_LABEL (name
, "LF", const_labelno
);
1696 namestring
= (char *) obstack_alloc (saveable_obstack
,
1698 strcpy (namestring
, name
);
1700 x
= gen_rtx_SYMBOL_REF (Pmode
, namestring
);
1702 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
1703 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file
, NULL_TREE
, name
, size
,
1706 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1707 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file
, name
, size
, BIGGEST_ALIGNMENT
);
1709 ASM_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
1715 /* Assemble the static constant template for function entry trampolines.
1716 This is done at most once per compilation.
1717 Returns an RTX for the address of the template. */
1719 #ifdef TRAMPOLINE_TEMPLATE
1721 assemble_trampoline_template ()
1727 /* By default, put trampoline templates in read-only data section. */
1729 #ifdef TRAMPOLINE_SECTION
1730 TRAMPOLINE_SECTION ();
1732 readonly_data_section ();
1735 /* Write the assembler code to define one. */
1736 align
= floor_log2 (TRAMPOLINE_ALIGNMENT
/ BITS_PER_UNIT
);
1738 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1740 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LTRAMP", 0);
1741 TRAMPOLINE_TEMPLATE (asm_out_file
);
1743 /* Record the rtl to refer to it. */
1744 ASM_GENERATE_INTERNAL_LABEL (label
, "LTRAMP", 0);
1746 = (char *) obstack_copy0 (&permanent_obstack
, label
, strlen (label
));
1747 return gen_rtx_SYMBOL_REF (Pmode
, name
);
1751 /* Assemble the integer constant X into an object of SIZE bytes.
1752 X must be either a CONST_INT or CONST_DOUBLE.
1754 Return 1 if we were able to output the constant, otherwise 0. If FORCE is
1755 non-zero, abort if we can't output the constant. */
1758 assemble_integer (x
, size
, force
)
1763 /* First try to use the standard 1, 2, 4, 8, and 16 byte
1764 ASM_OUTPUT... macros. */
1768 #ifdef ASM_OUTPUT_CHAR
1770 ASM_OUTPUT_CHAR (asm_out_file
, x
);
1774 #ifdef ASM_OUTPUT_SHORT
1776 ASM_OUTPUT_SHORT (asm_out_file
, x
);
1780 #ifdef ASM_OUTPUT_INT
1782 ASM_OUTPUT_INT (asm_out_file
, x
);
1786 #ifdef ASM_OUTPUT_DOUBLE_INT
1788 ASM_OUTPUT_DOUBLE_INT (asm_out_file
, x
);
1792 #ifdef ASM_OUTPUT_QUADRUPLE_INT
1794 ASM_OUTPUT_QUADRUPLE_INT (asm_out_file
, x
);
1799 /* If we couldn't do it that way, there are two other possibilities: First,
1800 if the machine can output an explicit byte and this is a 1 byte constant,
1801 we can use ASM_OUTPUT_BYTE. */
1803 #ifdef ASM_OUTPUT_BYTE
1804 if (size
== 1 && GET_CODE (x
) == CONST_INT
)
1806 ASM_OUTPUT_BYTE (asm_out_file
, INTVAL (x
));
1811 /* Finally, if SIZE is larger than a single word, try to output the constant
1812 one word at a time. */
1814 if (size
> UNITS_PER_WORD
)
1817 enum machine_mode mode
1818 = mode_for_size (size
* BITS_PER_UNIT
, MODE_INT
, 0);
1821 for (i
= 0; i
< size
/ UNITS_PER_WORD
; i
++)
1823 word
= operand_subword (x
, i
, 0, mode
);
1828 if (! assemble_integer (word
, UNITS_PER_WORD
, 0))
1832 if (i
== size
/ UNITS_PER_WORD
)
1834 /* If we output at least one word and then could not finish,
1835 there is no valid way to continue. */
1846 /* Assemble the floating-point constant D into an object of size MODE. */
1849 assemble_real (d
, mode
)
1851 enum machine_mode mode
;
1853 jmp_buf output_constant_handler
;
1855 if (setjmp (output_constant_handler
))
1857 error ("floating point trap outputting a constant");
1858 #ifdef REAL_IS_NOT_DOUBLE
1859 bzero ((char *) &d
, sizeof d
);
1866 set_float_handler (output_constant_handler
);
1870 #ifdef ASM_OUTPUT_BYTE_FLOAT
1872 ASM_OUTPUT_BYTE_FLOAT (asm_out_file
, d
);
1875 #ifdef ASM_OUTPUT_SHORT_FLOAT
1877 ASM_OUTPUT_SHORT_FLOAT (asm_out_file
, d
);
1880 #ifdef ASM_OUTPUT_THREE_QUARTER_FLOAT
1882 ASM_OUTPUT_THREE_QUARTER_FLOAT (asm_out_file
, d
);
1885 #ifdef ASM_OUTPUT_FLOAT
1887 ASM_OUTPUT_FLOAT (asm_out_file
, d
);
1891 #ifdef ASM_OUTPUT_DOUBLE
1893 ASM_OUTPUT_DOUBLE (asm_out_file
, d
);
1897 #ifdef ASM_OUTPUT_LONG_DOUBLE
1900 ASM_OUTPUT_LONG_DOUBLE (asm_out_file
, d
);
1908 set_float_handler (NULL_PTR
);
1911 /* Here we combine duplicate floating constants to make
1912 CONST_DOUBLE rtx's, and force those out to memory when necessary. */
1914 /* Chain of all CONST_DOUBLE rtx's constructed for the current function.
1915 They are chained through the CONST_DOUBLE_CHAIN.
1916 A CONST_DOUBLE rtx has CONST_DOUBLE_MEM != cc0_rtx iff it is on this chain.
1917 In that case, CONST_DOUBLE_MEM is either a MEM,
1918 or const0_rtx if no MEM has been made for this CONST_DOUBLE yet.
1920 (CONST_DOUBLE_MEM is used only for top-level functions.
1921 See force_const_mem for explanation.) */
1923 static rtx const_double_chain
;
1925 /* Return a CONST_DOUBLE or CONST_INT for a value specified as a pair of ints.
1926 For an integer, I0 is the low-order word and I1 is the high-order word.
1927 For a real number, I0 is the word with the low address
1928 and I1 is the word with the high address. */
1931 immed_double_const (i0
, i1
, mode
)
1932 HOST_WIDE_INT i0
, i1
;
1933 enum machine_mode mode
;
1937 if (GET_MODE_CLASS (mode
) == MODE_INT
1938 || GET_MODE_CLASS (mode
) == MODE_PARTIAL_INT
)
1940 /* We clear out all bits that don't belong in MODE, unless they and our
1941 sign bit are all one. So we get either a reasonable negative value
1942 or a reasonable unsigned value for this mode. */
1943 int width
= GET_MODE_BITSIZE (mode
);
1944 if (width
< HOST_BITS_PER_WIDE_INT
1945 && ((i0
& ((HOST_WIDE_INT
) (-1) << (width
- 1)))
1946 != ((HOST_WIDE_INT
) (-1) << (width
- 1))))
1947 i0
&= ((HOST_WIDE_INT
) 1 << width
) - 1, i1
= 0;
1948 else if (width
== HOST_BITS_PER_WIDE_INT
1949 && ! (i1
== ~0 && i0
< 0))
1951 else if (width
> 2 * HOST_BITS_PER_WIDE_INT
)
1952 /* We cannot represent this value as a constant. */
1955 /* If this would be an entire word for the target, but is not for
1956 the host, then sign-extend on the host so that the number will look
1957 the same way on the host that it would on the target.
1959 For example, when building a 64 bit alpha hosted 32 bit sparc
1960 targeted compiler, then we want the 32 bit unsigned value -1 to be
1961 represented as a 64 bit value -1, and not as 0x00000000ffffffff.
1962 The later confuses the sparc backend. */
1964 if (BITS_PER_WORD
< HOST_BITS_PER_WIDE_INT
&& BITS_PER_WORD
== width
1965 && (i0
& ((HOST_WIDE_INT
) 1 << (width
- 1))))
1966 i0
|= ((HOST_WIDE_INT
) (-1) << width
);
1968 /* If MODE fits within HOST_BITS_PER_WIDE_INT, always use a CONST_INT.
1970 ??? Strictly speaking, this is wrong if we create a CONST_INT
1971 for a large unsigned constant with the size of MODE being
1972 HOST_BITS_PER_WIDE_INT and later try to interpret that constant in a
1973 wider mode. In that case we will mis-interpret it as a negative
1976 Unfortunately, the only alternative is to make a CONST_DOUBLE
1977 for any constant in any mode if it is an unsigned constant larger
1978 than the maximum signed integer in an int on the host. However,
1979 doing this will break everyone that always expects to see a CONST_INT
1980 for SImode and smaller.
1982 We have always been making CONST_INTs in this case, so nothing new
1985 if (width
<= HOST_BITS_PER_WIDE_INT
)
1986 i1
= (i0
< 0) ? ~(HOST_WIDE_INT
) 0 : 0;
1988 /* If this integer fits in one word, return a CONST_INT. */
1989 if ((i1
== 0 && i0
>= 0)
1990 || (i1
== ~0 && i0
< 0))
1991 return GEN_INT (i0
);
1993 /* We use VOIDmode for integers. */
1997 /* Search the chain for an existing CONST_DOUBLE with the right value.
1998 If one is found, return it. */
2000 for (r
= const_double_chain
; r
; r
= CONST_DOUBLE_CHAIN (r
))
2001 if (CONST_DOUBLE_LOW (r
) == i0
&& CONST_DOUBLE_HIGH (r
) == i1
2002 && GET_MODE (r
) == mode
)
2005 /* No; make a new one and add it to the chain.
2007 We may be called by an optimizer which may be discarding any memory
2008 allocated during its processing (such as combine and loop). However,
2009 we will be leaving this constant on the chain, so we cannot tolerate
2010 freed memory. So switch to saveable_obstack for this allocation
2011 and then switch back if we were in current_obstack. */
2013 push_obstacks_nochange ();
2014 rtl_in_saveable_obstack ();
2015 r
= gen_rtx_CONST_DOUBLE (mode
, NULL_RTX
, i0
, i1
);
2018 /* Don't touch const_double_chain in nested function; see force_const_mem.
2019 Also, don't touch it if not inside any function. */
2020 if (outer_function_chain
== 0 && current_function_decl
!= 0)
2022 CONST_DOUBLE_CHAIN (r
) = const_double_chain
;
2023 const_double_chain
= r
;
2026 /* Store const0_rtx in mem-slot since this CONST_DOUBLE is on the chain.
2027 Actual use of mem-slot is only through force_const_mem. */
2029 CONST_DOUBLE_MEM (r
) = const0_rtx
;
2034 /* Return a CONST_DOUBLE for a specified `double' value
2035 and machine mode. */
2038 immed_real_const_1 (d
, mode
)
2040 enum machine_mode mode
;
2042 union real_extract u
;
2045 /* Get the desired `double' value as a sequence of ints
2046 since that is how they are stored in a CONST_DOUBLE. */
2050 /* Detect special cases. */
2052 if (REAL_VALUES_IDENTICAL (dconst0
, d
))
2053 return CONST0_RTX (mode
);
2054 /* Check for NaN first, because some ports (specifically the i386) do not
2055 emit correct ieee-fp code by default, and thus will generate a core
2056 dump here if we pass a NaN to REAL_VALUES_EQUAL and if REAL_VALUES_EQUAL
2057 does a floating point comparison. */
2058 else if (! REAL_VALUE_ISNAN (d
) && REAL_VALUES_EQUAL (dconst1
, d
))
2059 return CONST1_RTX (mode
);
2061 if (sizeof u
== 2 * sizeof (HOST_WIDE_INT
))
2062 return immed_double_const (u
.i
[0], u
.i
[1], mode
);
2064 /* The rest of this function handles the case where
2065 a float value requires more than 2 ints of space.
2066 It will be deleted as dead code on machines that don't need it. */
2068 /* Search the chain for an existing CONST_DOUBLE with the right value.
2069 If one is found, return it. */
2071 for (r
= const_double_chain
; r
; r
= CONST_DOUBLE_CHAIN (r
))
2072 if (! bcmp ((char *) &CONST_DOUBLE_LOW (r
), (char *) &u
, sizeof u
)
2073 && GET_MODE (r
) == mode
)
2076 /* No; make a new one and add it to the chain.
2078 We may be called by an optimizer which may be discarding any memory
2079 allocated during its processing (such as combine and loop). However,
2080 we will be leaving this constant on the chain, so we cannot tolerate
2081 freed memory. So switch to saveable_obstack for this allocation
2082 and then switch back if we were in current_obstack. */
2084 push_obstacks_nochange ();
2085 rtl_in_saveable_obstack ();
2086 r
= rtx_alloc (CONST_DOUBLE
);
2088 bcopy ((char *) &u
, (char *) &CONST_DOUBLE_LOW (r
), sizeof u
);
2091 /* Don't touch const_double_chain in nested function; see force_const_mem.
2092 Also, don't touch it if not inside any function. */
2093 if (outer_function_chain
== 0 && current_function_decl
!= 0)
2095 CONST_DOUBLE_CHAIN (r
) = const_double_chain
;
2096 const_double_chain
= r
;
2099 /* Store const0_rtx in CONST_DOUBLE_MEM since this CONST_DOUBLE is on the
2100 chain, but has not been allocated memory. Actual use of CONST_DOUBLE_MEM
2101 is only through force_const_mem. */
2103 CONST_DOUBLE_MEM (r
) = const0_rtx
;
2108 /* Return a CONST_DOUBLE rtx for a value specified by EXP,
2109 which must be a REAL_CST tree node. */
2112 immed_real_const (exp
)
2115 return immed_real_const_1 (TREE_REAL_CST (exp
), TYPE_MODE (TREE_TYPE (exp
)));
2118 /* At the end of a function, forget the memory-constants
2119 previously made for CONST_DOUBLEs. Mark them as not on real_constant_chain.
2120 Also clear out real_constant_chain and clear out all the chain-pointers. */
2123 clear_const_double_mem ()
2125 register rtx r
, next
;
2127 /* Don't touch CONST_DOUBLE_MEM for nested functions.
2128 See force_const_mem for explanation. */
2129 if (outer_function_chain
!= 0)
2132 for (r
= const_double_chain
; r
; r
= next
)
2134 next
= CONST_DOUBLE_CHAIN (r
);
2135 CONST_DOUBLE_CHAIN (r
) = 0;
2136 CONST_DOUBLE_MEM (r
) = cc0_rtx
;
2138 const_double_chain
= 0;
2141 /* Given an expression EXP with a constant value,
2142 reduce it to the sum of an assembler symbol and an integer.
2143 Store them both in the structure *VALUE.
2144 Abort if EXP does not reduce. */
2149 HOST_WIDE_INT offset
;
2153 decode_addr_const (exp
, value
)
2155 struct addr_const
*value
;
2157 register tree target
= TREE_OPERAND (exp
, 0);
2158 register int offset
= 0;
2163 if (TREE_CODE (target
) == COMPONENT_REF
2164 && (TREE_CODE (DECL_FIELD_BITPOS (TREE_OPERAND (target
, 1)))
2167 offset
+= TREE_INT_CST_LOW (DECL_FIELD_BITPOS (TREE_OPERAND (target
, 1))) / BITS_PER_UNIT
;
2168 target
= TREE_OPERAND (target
, 0);
2170 else if (TREE_CODE (target
) == ARRAY_REF
)
2172 if (TREE_CODE (TREE_OPERAND (target
, 1)) != INTEGER_CST
2173 || TREE_CODE (TYPE_SIZE (TREE_TYPE (target
))) != INTEGER_CST
)
2175 offset
+= ((TREE_INT_CST_LOW (TYPE_SIZE (TREE_TYPE (target
)))
2176 * TREE_INT_CST_LOW (TREE_OPERAND (target
, 1)))
2178 target
= TREE_OPERAND (target
, 0);
2184 switch (TREE_CODE (target
))
2188 x
= DECL_RTL (target
);
2192 x
= gen_rtx_MEM (FUNCTION_MODE
,
2193 gen_rtx_LABEL_REF (VOIDmode
,
2194 label_rtx (TREE_OPERAND (exp
, 0))));
2202 x
= TREE_CST_RTL (target
);
2209 if (GET_CODE (x
) != MEM
)
2214 value
->offset
= offset
;
2217 /* Uniquize all constants that appear in memory.
2218 Each constant in memory thus far output is recorded
2219 in `const_hash_table' with a `struct constant_descriptor'
2220 that contains a polish representation of the value of
2223 We cannot store the trees in the hash table
2224 because the trees may be temporary. */
2226 struct constant_descriptor
2228 struct constant_descriptor
*next
;
2234 #define MAX_HASH_TABLE 1009
2235 static struct constant_descriptor
*const_hash_table
[MAX_HASH_TABLE
];
2237 /* Compute a hash code for a constant expression. */
2244 register int len
, hi
, i
;
2245 register enum tree_code code
= TREE_CODE (exp
);
2247 /* Either set P and LEN to the address and len of something to hash and
2248 exit the switch or return a value. */
2253 p
= (char *) &TREE_INT_CST_LOW (exp
);
2254 len
= 2 * sizeof TREE_INT_CST_LOW (exp
);
2258 p
= (char *) &TREE_REAL_CST (exp
);
2259 len
= sizeof TREE_REAL_CST (exp
);
2263 p
= TREE_STRING_POINTER (exp
);
2264 len
= TREE_STRING_LENGTH (exp
);
2268 return (const_hash (TREE_REALPART (exp
)) * 5
2269 + const_hash (TREE_IMAGPART (exp
)));
2272 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2274 len
= int_size_in_bytes (TREE_TYPE (exp
));
2275 p
= (char *) alloca (len
);
2276 get_set_constructor_bytes (exp
, (unsigned char *) p
, len
);
2283 /* For record type, include the type in the hashing.
2284 We do not do so for array types
2285 because (1) the sizes of the elements are sufficient
2286 and (2) distinct array types can have the same constructor.
2287 Instead, we include the array size because the constructor could
2289 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2290 hi
= ((unsigned long) TREE_TYPE (exp
) & ((1 << HASHBITS
) - 1))
2293 hi
= ((5 + int_size_in_bytes (TREE_TYPE (exp
)))
2294 & ((1 << HASHBITS
) - 1)) % MAX_HASH_TABLE
;
2296 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2297 if (TREE_VALUE (link
))
2299 = (hi
* 603 + const_hash (TREE_VALUE (link
))) % MAX_HASH_TABLE
;
2306 struct addr_const value
;
2308 decode_addr_const (exp
, &value
);
2309 if (GET_CODE (value
.base
) == SYMBOL_REF
)
2311 /* Don't hash the address of the SYMBOL_REF;
2312 only use the offset and the symbol name. */
2314 p
= XSTR (value
.base
, 0);
2315 for (i
= 0; p
[i
] != 0; i
++)
2316 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2318 else if (GET_CODE (value
.base
) == LABEL_REF
)
2319 hi
= value
.offset
+ CODE_LABEL_NUMBER (XEXP (value
.base
, 0)) * 13;
2321 hi
&= (1 << HASHBITS
) - 1;
2322 hi
%= MAX_HASH_TABLE
;
2328 return (const_hash (TREE_OPERAND (exp
, 0)) * 9
2329 + const_hash (TREE_OPERAND (exp
, 1)));
2333 case NON_LVALUE_EXPR
:
2334 return const_hash (TREE_OPERAND (exp
, 0)) * 7 + 2;
2340 /* Compute hashing function */
2342 for (i
= 0; i
< len
; i
++)
2343 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2345 hi
&= (1 << HASHBITS
) - 1;
2346 hi
%= MAX_HASH_TABLE
;
2350 /* Compare a constant expression EXP with a constant-descriptor DESC.
2351 Return 1 if DESC describes a constant with the same value as EXP. */
2354 compare_constant (exp
, desc
)
2356 struct constant_descriptor
*desc
;
2358 return 0 != compare_constant_1 (exp
, desc
->contents
);
2361 /* Compare constant expression EXP with a substring P of a constant descriptor.
2362 If they match, return a pointer to the end of the substring matched.
2363 If they do not match, return 0.
2365 Since descriptors are written in polish prefix notation,
2366 this function can be used recursively to test one operand of EXP
2367 against a subdescriptor, and if it succeeds it returns the
2368 address of the subdescriptor for the next operand. */
2371 compare_constant_1 (exp
, p
)
2375 register char *strp
;
2377 register enum tree_code code
= TREE_CODE (exp
);
2379 if (code
!= (enum tree_code
) *p
++)
2382 /* Either set STRP, P and LEN to pointers and length to compare and exit the
2383 switch, or return the result of the comparison. */
2388 /* Integer constants are the same only if the same width of type. */
2389 if (*p
++ != TYPE_PRECISION (TREE_TYPE (exp
)))
2392 strp
= (char *) &TREE_INT_CST_LOW (exp
);
2393 len
= 2 * sizeof TREE_INT_CST_LOW (exp
);
2397 /* Real constants are the same only if the same width of type. */
2398 if (*p
++ != TYPE_PRECISION (TREE_TYPE (exp
)))
2401 strp
= (char *) &TREE_REAL_CST (exp
);
2402 len
= sizeof TREE_REAL_CST (exp
);
2406 if (flag_writable_strings
)
2409 if (*p
++ != TYPE_MODE (TREE_TYPE (exp
)))
2412 strp
= TREE_STRING_POINTER (exp
);
2413 len
= TREE_STRING_LENGTH (exp
);
2414 if (bcmp ((char *) &TREE_STRING_LENGTH (exp
), p
,
2415 sizeof TREE_STRING_LENGTH (exp
)))
2418 p
+= sizeof TREE_STRING_LENGTH (exp
);
2422 p
= compare_constant_1 (TREE_REALPART (exp
), p
);
2426 return compare_constant_1 (TREE_IMAGPART (exp
), p
);
2429 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2431 int xlen
= len
= int_size_in_bytes (TREE_TYPE (exp
));
2433 strp
= (char *) alloca (len
);
2434 get_set_constructor_bytes (exp
, (unsigned char *) strp
, len
);
2435 if (bcmp ((char *) &xlen
, p
, sizeof xlen
))
2444 int length
= list_length (CONSTRUCTOR_ELTS (exp
));
2446 int have_purpose
= 0;
2448 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2449 if (TREE_PURPOSE (link
))
2452 if (bcmp ((char *) &length
, p
, sizeof length
))
2457 /* For record constructors, insist that the types match.
2458 For arrays, just verify both constructors are for arrays.
2459 Then insist that either both or none have any TREE_PURPOSE
2461 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2462 type
= TREE_TYPE (exp
);
2466 if (bcmp ((char *) &type
, p
, sizeof type
))
2471 if (bcmp ((char *) &have_purpose
, p
, sizeof have_purpose
))
2474 p
+= sizeof have_purpose
;
2476 /* For arrays, insist that the size in bytes match. */
2477 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2479 HOST_WIDE_INT size
= int_size_in_bytes (TREE_TYPE (exp
));
2481 if (bcmp ((char *) &size
, p
, sizeof size
))
2487 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2489 if (TREE_VALUE (link
))
2491 if ((p
= compare_constant_1 (TREE_VALUE (link
), p
)) == 0)
2498 if (bcmp ((char *) &zero
, p
, sizeof zero
))
2504 if (TREE_PURPOSE (link
)
2505 && TREE_CODE (TREE_PURPOSE (link
)) == FIELD_DECL
)
2507 if (bcmp ((char *) &TREE_PURPOSE (link
), p
,
2508 sizeof TREE_PURPOSE (link
)))
2511 p
+= sizeof TREE_PURPOSE (link
);
2513 else if (TREE_PURPOSE (link
))
2515 if ((p
= compare_constant_1 (TREE_PURPOSE (link
), p
)) == 0)
2518 else if (have_purpose
)
2522 if (bcmp ((char *) &zero
, p
, sizeof zero
))
2534 struct addr_const value
;
2536 decode_addr_const (exp
, &value
);
2537 strp
= (char *) &value
.offset
;
2538 len
= sizeof value
.offset
;
2539 /* Compare the offset. */
2541 if (*p
++ != *strp
++)
2544 /* Compare symbol name. */
2545 strp
= XSTR (value
.base
, 0);
2546 len
= strlen (strp
) + 1;
2552 p
= compare_constant_1 (TREE_OPERAND (exp
, 0), p
);
2556 return compare_constant_1 (TREE_OPERAND (exp
, 1), p
);
2560 case NON_LVALUE_EXPR
:
2561 return compare_constant_1 (TREE_OPERAND (exp
, 0), p
);
2567 /* Compare constant contents. */
2569 if (*p
++ != *strp
++)
2575 /* Construct a constant descriptor for the expression EXP.
2576 It is up to the caller to enter the descriptor in the hash table. */
2578 static struct constant_descriptor
*
2579 record_constant (exp
)
2582 struct constant_descriptor
*next
= 0;
2585 /* Make a struct constant_descriptor. The first two pointers will
2586 be filled in later. Here we just leave space for them. */
2588 obstack_grow (&permanent_obstack
, (char *) &next
, sizeof next
);
2589 obstack_grow (&permanent_obstack
, (char *) &label
, sizeof label
);
2590 record_constant_1 (exp
);
2591 return (struct constant_descriptor
*) obstack_finish (&permanent_obstack
);
2594 /* Add a description of constant expression EXP
2595 to the object growing in `permanent_obstack'.
2596 No need to return its address; the caller will get that
2597 from the obstack when the object is complete. */
2600 record_constant_1 (exp
)
2603 register char *strp
;
2605 register enum tree_code code
= TREE_CODE (exp
);
2607 obstack_1grow (&permanent_obstack
, (unsigned int) code
);
2612 obstack_1grow (&permanent_obstack
, TYPE_PRECISION (TREE_TYPE (exp
)));
2613 strp
= (char *) &TREE_INT_CST_LOW (exp
);
2614 len
= 2 * sizeof TREE_INT_CST_LOW (exp
);
2618 obstack_1grow (&permanent_obstack
, TYPE_PRECISION (TREE_TYPE (exp
)));
2619 strp
= (char *) &TREE_REAL_CST (exp
);
2620 len
= sizeof TREE_REAL_CST (exp
);
2624 if (flag_writable_strings
)
2627 obstack_1grow (&permanent_obstack
, TYPE_MODE (TREE_TYPE (exp
)));
2628 strp
= TREE_STRING_POINTER (exp
);
2629 len
= TREE_STRING_LENGTH (exp
);
2630 obstack_grow (&permanent_obstack
, (char *) &TREE_STRING_LENGTH (exp
),
2631 sizeof TREE_STRING_LENGTH (exp
));
2635 record_constant_1 (TREE_REALPART (exp
));
2636 record_constant_1 (TREE_IMAGPART (exp
));
2640 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2642 int nbytes
= int_size_in_bytes (TREE_TYPE (exp
));
2643 obstack_grow (&permanent_obstack
, &nbytes
, sizeof (nbytes
));
2644 obstack_blank (&permanent_obstack
, nbytes
);
2645 get_set_constructor_bytes
2646 (exp
, (unsigned char *) permanent_obstack
.next_free
-nbytes
,
2653 int length
= list_length (CONSTRUCTOR_ELTS (exp
));
2655 int have_purpose
= 0;
2657 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2658 if (TREE_PURPOSE (link
))
2661 obstack_grow (&permanent_obstack
, (char *) &length
, sizeof length
);
2663 /* For record constructors, insist that the types match.
2664 For arrays, just verify both constructors are for arrays.
2665 Then insist that either both or none have any TREE_PURPOSE
2667 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2668 type
= TREE_TYPE (exp
);
2671 obstack_grow (&permanent_obstack
, (char *) &type
, sizeof type
);
2672 obstack_grow (&permanent_obstack
, (char *) &have_purpose
,
2673 sizeof have_purpose
);
2675 /* For arrays, insist that the size in bytes match. */
2676 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2678 HOST_WIDE_INT size
= int_size_in_bytes (TREE_TYPE (exp
));
2679 obstack_grow (&permanent_obstack
, (char *) &size
, sizeof size
);
2682 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2684 if (TREE_VALUE (link
))
2685 record_constant_1 (TREE_VALUE (link
));
2690 obstack_grow (&permanent_obstack
,
2691 (char *) &zero
, sizeof zero
);
2694 if (TREE_PURPOSE (link
)
2695 && TREE_CODE (TREE_PURPOSE (link
)) == FIELD_DECL
)
2696 obstack_grow (&permanent_obstack
,
2697 (char *) &TREE_PURPOSE (link
),
2698 sizeof TREE_PURPOSE (link
));
2699 else if (TREE_PURPOSE (link
))
2700 record_constant_1 (TREE_PURPOSE (link
));
2701 else if (have_purpose
)
2705 obstack_grow (&permanent_obstack
,
2706 (char *) &zero
, sizeof zero
);
2714 struct addr_const value
;
2716 decode_addr_const (exp
, &value
);
2717 /* Record the offset. */
2718 obstack_grow (&permanent_obstack
,
2719 (char *) &value
.offset
, sizeof value
.offset
);
2720 /* Record the symbol name. */
2721 obstack_grow (&permanent_obstack
, XSTR (value
.base
, 0),
2722 strlen (XSTR (value
.base
, 0)) + 1);
2728 record_constant_1 (TREE_OPERAND (exp
, 0));
2729 record_constant_1 (TREE_OPERAND (exp
, 1));
2734 case NON_LVALUE_EXPR
:
2735 record_constant_1 (TREE_OPERAND (exp
, 0));
2742 /* Record constant contents. */
2743 obstack_grow (&permanent_obstack
, strp
, len
);
2746 /* Record a list of constant expressions that were passed to
2747 output_constant_def but that could not be output right away. */
2749 struct deferred_constant
2751 struct deferred_constant
*next
;
2757 static struct deferred_constant
*deferred_constants
;
2759 /* Another list of constants which should be output after the
2761 static struct deferred_constant
*after_function_constants
;
2763 /* Nonzero means defer output of addressed subconstants
2764 (i.e., those for which output_constant_def is called.) */
2765 static int defer_addressed_constants_flag
;
2767 /* Start deferring output of subconstants. */
2770 defer_addressed_constants ()
2772 defer_addressed_constants_flag
++;
2775 /* Stop deferring output of subconstants,
2776 and output now all those that have been deferred. */
2779 output_deferred_addressed_constants ()
2781 struct deferred_constant
*p
, *next
;
2783 defer_addressed_constants_flag
--;
2785 if (defer_addressed_constants_flag
> 0)
2788 for (p
= deferred_constants
; p
; p
= next
)
2790 output_constant_def_contents (p
->exp
, p
->reloc
, p
->labelno
);
2795 deferred_constants
= 0;
2798 /* Output any constants which should appear after a function. */
2801 output_after_function_constants ()
2803 struct deferred_constant
*p
, *next
;
2805 for (p
= after_function_constants
; p
; p
= next
)
2807 output_constant_def_contents (p
->exp
, p
->reloc
, p
->labelno
);
2812 after_function_constants
= 0;
2815 /* Make a copy of the whole tree structure for a constant.
2816 This handles the same types of nodes that compare_constant
2817 and record_constant handle. */
2823 switch (TREE_CODE (exp
))
2826 /* For ADDR_EXPR, we do not want to copy the decl whose address
2827 is requested. We do want to copy constants though. */
2828 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, 0))) == 'c')
2829 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2830 copy_constant (TREE_OPERAND (exp
, 0)));
2832 return copy_node (exp
);
2837 return copy_node (exp
);
2840 return build_complex (TREE_TYPE (exp
),
2841 copy_constant (TREE_REALPART (exp
)),
2842 copy_constant (TREE_IMAGPART (exp
)));
2846 return build (TREE_CODE (exp
), TREE_TYPE (exp
),
2847 copy_constant (TREE_OPERAND (exp
, 0)),
2848 copy_constant (TREE_OPERAND (exp
, 1)));
2852 case NON_LVALUE_EXPR
:
2853 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2854 copy_constant (TREE_OPERAND (exp
, 0)));
2858 tree copy
= copy_node (exp
);
2859 tree list
= copy_list (CONSTRUCTOR_ELTS (exp
));
2862 CONSTRUCTOR_ELTS (copy
) = list
;
2863 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
2864 TREE_VALUE (tail
) = copy_constant (TREE_VALUE (tail
));
2865 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2866 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
2867 TREE_PURPOSE (tail
) = copy_constant (TREE_PURPOSE (tail
));
2877 /* Return an rtx representing a reference to constant data in memory
2878 for the constant expression EXP.
2880 If assembler code for such a constant has already been output,
2881 return an rtx to refer to it.
2882 Otherwise, output such a constant in memory (or defer it for later)
2883 and generate an rtx for it.
2885 The TREE_CST_RTL of EXP is set up to point to that rtx.
2886 The const_hash_table records which constants already have label strings. */
2889 output_constant_def (exp
)
2893 register struct constant_descriptor
*desc
;
2899 if (TREE_CST_RTL (exp
))
2900 return TREE_CST_RTL (exp
);
2902 /* Make sure any other constants whose addresses appear in EXP
2903 are assigned label numbers. */
2905 reloc
= output_addressed_constants (exp
);
2907 /* Compute hash code of EXP. Search the descriptors for that hash code
2908 to see if any of them describes EXP. If yes, the descriptor records
2909 the label number already assigned. */
2911 hash
= const_hash (exp
) % MAX_HASH_TABLE
;
2913 for (desc
= const_hash_table
[hash
]; desc
; desc
= desc
->next
)
2914 if (compare_constant (exp
, desc
))
2916 found
= desc
->label
;
2922 /* No constant equal to EXP is known to have been output.
2923 Make a constant descriptor to enter EXP in the hash table.
2924 Assign the label number and record it in the descriptor for
2925 future calls to this function to find. */
2927 /* Create a string containing the label name, in LABEL. */
2928 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
2930 desc
= record_constant (exp
);
2931 desc
->next
= const_hash_table
[hash
];
2933 = (char *) obstack_copy0 (&permanent_obstack
, label
, strlen (label
));
2934 const_hash_table
[hash
] = desc
;
2938 /* Create a string containing the label name, in LABEL. */
2939 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
2942 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
2944 push_obstacks_nochange ();
2945 if (TREE_PERMANENT (exp
))
2946 end_temporary_allocation ();
2948 def
= gen_rtx_SYMBOL_REF (Pmode
, desc
->label
);
2951 = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp
)), def
);
2952 RTX_UNCHANGING_P (TREE_CST_RTL (exp
)) = 1;
2953 if (AGGREGATE_TYPE_P (TREE_TYPE (exp
)))
2954 MEM_IN_STRUCT_P (TREE_CST_RTL (exp
)) = 1;
2958 /* Optionally set flags or add text to the name to record information
2959 such as that it is a function name. If the name is changed, the macro
2960 ASM_OUTPUT_LABELREF will have to know how to strip this information. */
2961 #ifdef ENCODE_SECTION_INFO
2962 ENCODE_SECTION_INFO (exp
);
2965 /* If this is the first time we've seen this particular constant,
2966 output it (or defer its output for later). */
2969 int after_function
= 0;
2971 #ifdef CONSTANT_AFTER_FUNCTION_P
2972 if (current_function_decl
!= 0
2973 && CONSTANT_AFTER_FUNCTION_P (exp
))
2977 if (defer_addressed_constants_flag
|| after_function
)
2979 struct deferred_constant
*p
;
2980 p
= (struct deferred_constant
*) xmalloc (sizeof (struct deferred_constant
));
2982 push_obstacks_nochange ();
2983 suspend_momentary ();
2984 p
->exp
= copy_constant (exp
);
2987 p
->labelno
= const_labelno
++;
2990 p
->next
= after_function_constants
;
2991 after_function_constants
= p
;
2995 p
->next
= deferred_constants
;
2996 deferred_constants
= p
;
3000 output_constant_def_contents (exp
, reloc
, const_labelno
++);
3003 return TREE_CST_RTL (exp
);
3006 /* Now output assembler code to define the label for EXP,
3007 and follow it with the data of EXP. */
3010 output_constant_def_contents (exp
, reloc
, labelno
)
3017 if (IN_NAMED_SECTION (exp
))
3018 named_section (exp
, NULL
, reloc
);
3021 /* First switch to text section, except for writable strings. */
3022 #ifdef SELECT_SECTION
3023 SELECT_SECTION (exp
, reloc
);
3025 if (((TREE_CODE (exp
) == STRING_CST
) && flag_writable_strings
)
3026 || (flag_pic
&& reloc
))
3029 readonly_data_section ();
3033 /* Align the location counter as required by EXP's data type. */
3034 align
= TYPE_ALIGN (TREE_TYPE (exp
));
3035 #ifdef CONSTANT_ALIGNMENT
3036 align
= CONSTANT_ALIGNMENT (exp
, align
);
3039 if (align
> BITS_PER_UNIT
)
3040 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
3042 /* Output the label itself. */
3043 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LC", labelno
);
3045 /* Output the value of EXP. */
3046 output_constant (exp
,
3047 (TREE_CODE (exp
) == STRING_CST
3048 ? TREE_STRING_LENGTH (exp
)
3049 : int_size_in_bytes (TREE_TYPE (exp
))));
3053 /* Similar hash facility for making memory-constants
3054 from constant rtl-expressions. It is used on RISC machines
3055 where immediate integer arguments and constant addresses are restricted
3056 so that such constants must be stored in memory.
3058 This pool of constants is reinitialized for each function
3059 so each function gets its own constants-pool that comes right before it.
3061 All structures allocated here are discarded when functions are saved for
3062 inlining, so they do not need to be allocated permanently. */
3064 #define MAX_RTX_HASH_TABLE 61
3065 static struct constant_descriptor
**const_rtx_hash_table
;
3067 /* Structure to represent sufficient information about a constant so that
3068 it can be output when the constant pool is output, so that function
3069 integration can be done, and to simplify handling on machines that reference
3070 constant pool as base+displacement. */
3072 struct pool_constant
3074 struct constant_descriptor
*desc
;
3075 struct pool_constant
*next
;
3076 enum machine_mode mode
;
3084 /* Pointers to first and last constant in pool. */
3086 static struct pool_constant
*first_pool
, *last_pool
;
3088 /* Current offset in constant pool (does not include any machine-specific
3091 static int pool_offset
;
3093 /* Structure used to maintain hash table mapping symbols used to their
3094 corresponding constants. */
3099 struct pool_constant
*pool
;
3100 struct pool_sym
*next
;
3103 static struct pool_sym
**const_rtx_sym_hash_table
;
3105 /* Hash code for a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true.
3106 The argument is XSTR (... , 0) */
3108 #define SYMHASH(LABEL) \
3109 ((((unsigned long) (LABEL)) & ((1 << HASHBITS) - 1)) % MAX_RTX_HASH_TABLE)
3111 /* Initialize constant pool hashing for next function. */
3114 init_const_rtx_hash_table ()
3116 const_rtx_hash_table
3117 = ((struct constant_descriptor
**)
3118 oballoc (MAX_RTX_HASH_TABLE
* sizeof (struct constant_descriptor
*)));
3119 const_rtx_sym_hash_table
3120 = ((struct pool_sym
**)
3121 oballoc (MAX_RTX_HASH_TABLE
* sizeof (struct pool_sym
*)));
3122 bzero ((char *) const_rtx_hash_table
,
3123 MAX_RTX_HASH_TABLE
* sizeof (struct constant_descriptor
*));
3124 bzero ((char *) const_rtx_sym_hash_table
,
3125 MAX_RTX_HASH_TABLE
* sizeof (struct pool_sym
*));
3127 first_pool
= last_pool
= 0;
3131 /* Save and restore status for a nested function. */
3134 save_varasm_status (p
, context
)
3138 p
->const_rtx_hash_table
= const_rtx_hash_table
;
3139 p
->const_rtx_sym_hash_table
= const_rtx_sym_hash_table
;
3140 p
->first_pool
= first_pool
;
3141 p
->last_pool
= last_pool
;
3142 p
->pool_offset
= pool_offset
;
3143 p
->const_double_chain
= const_double_chain
;
3145 /* If we are pushing to toplevel, we can't reuse const_double_chain. */
3146 if (context
== NULL_TREE
)
3147 const_double_chain
= 0;
3151 restore_varasm_status (p
)
3154 const_rtx_hash_table
= p
->const_rtx_hash_table
;
3155 const_rtx_sym_hash_table
= p
->const_rtx_sym_hash_table
;
3156 first_pool
= p
->first_pool
;
3157 last_pool
= p
->last_pool
;
3158 pool_offset
= p
->pool_offset
;
3159 const_double_chain
= p
->const_double_chain
;
3162 enum kind
{ RTX_DOUBLE
, RTX_INT
};
3166 #ifdef ONLY_INT_FIELDS
3167 unsigned int kind
: 16;
3168 unsigned int mode
: 16;
3170 enum kind kind
: 16;
3171 enum machine_mode mode
: 16;
3174 union real_extract du
;
3175 struct addr_const addr
;
3176 struct {HOST_WIDE_INT high
, low
;} di
;
3180 /* Express an rtx for a constant integer (perhaps symbolic)
3181 as the sum of a symbol or label plus an explicit integer.
3182 They are stored into VALUE. */
3185 decode_rtx_const (mode
, x
, value
)
3186 enum machine_mode mode
;
3188 struct rtx_const
*value
;
3190 /* Clear the whole structure, including any gaps. */
3193 int *p
= (int *) value
;
3194 int *end
= (int *) (value
+ 1);
3199 value
->kind
= RTX_INT
; /* Most usual kind. */
3202 switch (GET_CODE (x
))
3205 value
->kind
= RTX_DOUBLE
;
3206 if (GET_MODE (x
) != VOIDmode
)
3208 value
->mode
= GET_MODE (x
);
3209 bcopy ((char *) &CONST_DOUBLE_LOW (x
),
3210 (char *) &value
->un
.du
, sizeof value
->un
.du
);
3214 value
->un
.di
.low
= CONST_DOUBLE_LOW (x
);
3215 value
->un
.di
.high
= CONST_DOUBLE_HIGH (x
);
3220 value
->un
.addr
.offset
= INTVAL (x
);
3226 value
->un
.addr
.base
= x
;
3231 if (GET_CODE (x
) == PLUS
)
3233 value
->un
.addr
.base
= XEXP (x
, 0);
3234 if (GET_CODE (XEXP (x
, 1)) != CONST_INT
)
3236 value
->un
.addr
.offset
= INTVAL (XEXP (x
, 1));
3238 else if (GET_CODE (x
) == MINUS
)
3240 value
->un
.addr
.base
= XEXP (x
, 0);
3241 if (GET_CODE (XEXP (x
, 1)) != CONST_INT
)
3243 value
->un
.addr
.offset
= - INTVAL (XEXP (x
, 1));
3253 if (value
->kind
== RTX_INT
&& value
->un
.addr
.base
!= 0)
3254 switch (GET_CODE (value
->un
.addr
.base
))
3258 /* Use the string's address, not the SYMBOL_REF's address,
3259 for the sake of addresses of library routines.
3260 For a LABEL_REF, compare labels. */
3261 value
->un
.addr
.base
= XEXP (value
->un
.addr
.base
, 0);
3268 /* Given a MINUS expression, simplify it if both sides
3269 include the same symbol. */
3272 simplify_subtraction (x
)
3275 struct rtx_const val0
, val1
;
3277 decode_rtx_const (GET_MODE (x
), XEXP (x
, 0), &val0
);
3278 decode_rtx_const (GET_MODE (x
), XEXP (x
, 1), &val1
);
3280 if (val0
.un
.addr
.base
== val1
.un
.addr
.base
)
3281 return GEN_INT (val0
.un
.addr
.offset
- val1
.un
.addr
.offset
);
3285 /* Compute a hash code for a constant RTL expression. */
3288 const_hash_rtx (mode
, x
)
3289 enum machine_mode mode
;
3295 struct rtx_const value
;
3296 decode_rtx_const (mode
, x
, &value
);
3298 /* Compute hashing function */
3300 for (i
= 0; i
< sizeof value
/ sizeof (int); i
++)
3301 hi
+= ((int *) &value
)[i
];
3303 hi
&= (1 << HASHBITS
) - 1;
3304 hi
%= MAX_RTX_HASH_TABLE
;
3308 /* Compare a constant rtl object X with a constant-descriptor DESC.
3309 Return 1 if DESC describes a constant with the same value as X. */
3312 compare_constant_rtx (mode
, x
, desc
)
3313 enum machine_mode mode
;
3315 struct constant_descriptor
*desc
;
3317 register int *p
= (int *) desc
->contents
;
3320 struct rtx_const value
;
3322 decode_rtx_const (mode
, x
, &value
);
3323 strp
= (int *) &value
;
3324 len
= sizeof value
/ sizeof (int);
3326 /* Compare constant contents. */
3328 if (*p
++ != *strp
++)
3334 /* Construct a constant descriptor for the rtl-expression X.
3335 It is up to the caller to enter the descriptor in the hash table. */
3337 static struct constant_descriptor
*
3338 record_constant_rtx (mode
, x
)
3339 enum machine_mode mode
;
3342 struct constant_descriptor
*ptr
;
3344 struct rtx_const value
;
3346 decode_rtx_const (mode
, x
, &value
);
3348 /* Put these things in the saveable obstack so we can ensure it won't
3349 be freed if we are called from combine or some other phase that discards
3350 memory allocated from function_obstack (current_obstack). */
3351 obstack_grow (saveable_obstack
, &ptr
, sizeof ptr
);
3352 obstack_grow (saveable_obstack
, &label
, sizeof label
);
3354 /* Record constant contents. */
3355 obstack_grow (saveable_obstack
, &value
, sizeof value
);
3357 return (struct constant_descriptor
*) obstack_finish (saveable_obstack
);
3360 /* Given a constant rtx X, make (or find) a memory constant for its value
3361 and return a MEM rtx to refer to it in memory. */
3364 force_const_mem (mode
, x
)
3365 enum machine_mode mode
;
3369 register struct constant_descriptor
*desc
;
3374 /* If we want this CONST_DOUBLE in the same mode as it is in memory
3375 (this will always be true for floating CONST_DOUBLEs that have been
3376 placed in memory, but not for VOIDmode (integer) CONST_DOUBLEs),
3377 use the previous copy. Otherwise, make a new one. Note that in
3378 the unlikely event that this same CONST_DOUBLE is used in two different
3379 modes in an alternating fashion, we will allocate a lot of different
3380 memory locations, but this should be extremely rare. */
3382 /* Don't use CONST_DOUBLE_MEM in a nested function.
3383 Nested functions have their own constant pools,
3384 so they can't share the same values in CONST_DOUBLE_MEM
3385 with the containing function. */
3386 if (outer_function_chain
== 0)
3387 if (GET_CODE (x
) == CONST_DOUBLE
3388 && GET_CODE (CONST_DOUBLE_MEM (x
)) == MEM
3389 && GET_MODE (CONST_DOUBLE_MEM (x
)) == mode
)
3390 return CONST_DOUBLE_MEM (x
);
3392 /* Compute hash code of X. Search the descriptors for that hash code
3393 to see if any of them describes X. If yes, the descriptor records
3394 the label number already assigned. */
3396 hash
= const_hash_rtx (mode
, x
);
3398 for (desc
= const_rtx_hash_table
[hash
]; desc
; desc
= desc
->next
)
3399 if (compare_constant_rtx (mode
, x
, desc
))
3401 found
= desc
->label
;
3407 register struct pool_constant
*pool
;
3408 register struct pool_sym
*sym
;
3411 /* No constant equal to X is known to have been output.
3412 Make a constant descriptor to enter X in the hash table.
3413 Assign the label number and record it in the descriptor for
3414 future calls to this function to find. */
3416 desc
= record_constant_rtx (mode
, x
);
3417 desc
->next
= const_rtx_hash_table
[hash
];
3418 const_rtx_hash_table
[hash
] = desc
;
3420 /* Align the location counter as required by EXP's data type. */
3421 align
= (mode
== VOIDmode
) ? UNITS_PER_WORD
: GET_MODE_SIZE (mode
);
3422 if (align
> BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
3423 align
= BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
;
3424 #ifdef CONSTANT_ALIGNMENT
3425 align
= CONSTANT_ALIGNMENT (make_tree (type_for_mode (mode
, 0), x
),
3426 align
* BITS_PER_UNIT
) / BITS_PER_UNIT
;
3429 pool_offset
+= align
- 1;
3430 pool_offset
&= ~ (align
- 1);
3432 /* If RTL is not being placed into the saveable obstack, make a
3433 copy of X that is in the saveable obstack in case we are
3434 being called from combine or some other phase that discards
3435 memory it allocates. We used to only do this if it is a
3436 CONST; however, reload can allocate a CONST_INT when
3437 eliminating registers. */
3438 if (rtl_obstack
!= saveable_obstack
3439 && (GET_CODE (x
) == CONST
|| GET_CODE (x
) == CONST_INT
))
3441 push_obstacks_nochange ();
3442 rtl_in_saveable_obstack ();
3444 if (GET_CODE (x
) == CONST
)
3445 x
= gen_rtx_CONST (GET_MODE (x
),
3446 gen_rtx_PLUS (GET_MODE (x
),
3447 XEXP (XEXP (x
, 0), 0),
3448 XEXP (XEXP (x
, 0), 1)));
3450 x
= GEN_INT (INTVAL (x
));
3455 /* Allocate a pool constant descriptor, fill it in, and chain it in. */
3457 pool
= (struct pool_constant
*) savealloc (sizeof (struct pool_constant
));
3461 pool
->labelno
= const_labelno
;
3462 pool
->align
= align
;
3463 pool
->offset
= pool_offset
;
3470 last_pool
->next
= pool
;
3473 pool_offset
+= GET_MODE_SIZE (mode
);
3475 /* Create a string containing the label name, in LABEL. */
3476 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
3481 = (char *) obstack_copy0 (saveable_obstack
, label
, strlen (label
));
3483 /* Add label to symbol hash table. */
3484 hash
= SYMHASH (found
);
3485 sym
= (struct pool_sym
*) savealloc (sizeof (struct pool_sym
));
3488 sym
->next
= const_rtx_sym_hash_table
[hash
];
3489 const_rtx_sym_hash_table
[hash
] = sym
;
3492 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
3494 def
= gen_rtx_MEM (mode
, gen_rtx_SYMBOL_REF (Pmode
, found
));
3496 RTX_UNCHANGING_P (def
) = 1;
3497 /* Mark the symbol_ref as belonging to this constants pool. */
3498 CONSTANT_POOL_ADDRESS_P (XEXP (def
, 0)) = 1;
3499 current_function_uses_const_pool
= 1;
3501 if (outer_function_chain
== 0)
3502 if (GET_CODE (x
) == CONST_DOUBLE
)
3504 if (CONST_DOUBLE_MEM (x
) == cc0_rtx
)
3506 CONST_DOUBLE_CHAIN (x
) = const_double_chain
;
3507 const_double_chain
= x
;
3509 CONST_DOUBLE_MEM (x
) = def
;
3515 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
3516 the corresponding pool_constant structure. */
3518 static struct pool_constant
*
3519 find_pool_constant (addr
)
3522 struct pool_sym
*sym
;
3523 char *label
= XSTR (addr
, 0);
3525 for (sym
= const_rtx_sym_hash_table
[SYMHASH (label
)]; sym
; sym
= sym
->next
)
3526 if (sym
->label
== label
)
3532 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
3535 get_pool_constant (addr
)
3538 return (find_pool_constant (addr
))->constant
;
3541 /* Similar, return the mode. */
3544 get_pool_mode (addr
)
3547 return (find_pool_constant (addr
))->mode
;
3550 /* Similar, return the offset in the constant pool. */
3553 get_pool_offset (addr
)
3556 return (find_pool_constant (addr
))->offset
;
3559 /* Return the size of the constant pool. */
3567 /* Write all the constants in the constant pool. */
3570 output_constant_pool (fnname
, fndecl
)
3574 struct pool_constant
*pool
;
3576 union real_extract u
;
3578 /* It is possible for gcc to call force_const_mem and then to later
3579 discard the instructions which refer to the constant. In such a
3580 case we do not need to output the constant. */
3581 if (optimize
>= 0 && flag_expensive_optimizations
)
3582 mark_constant_pool ();
3584 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3585 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3588 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3595 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3596 whose CODE_LABEL has been deleted. This can occur if a jump table
3597 is eliminated by optimization. If so, write a constant of zero
3598 instead. Note that this can also happen by turning the
3599 CODE_LABEL into a NOTE. */
3600 if (((GET_CODE (x
) == LABEL_REF
3601 && (INSN_DELETED_P (XEXP (x
, 0))
3602 || GET_CODE (XEXP (x
, 0)) == NOTE
)))
3603 || (GET_CODE (x
) == CONST
&& GET_CODE (XEXP (x
, 0)) == PLUS
3604 && GET_CODE (XEXP (XEXP (x
, 0), 0)) == LABEL_REF
3605 && (INSN_DELETED_P (XEXP (XEXP (XEXP (x
, 0), 0), 0))
3606 || GET_CODE (XEXP (XEXP (XEXP (x
, 0), 0), 0)) == NOTE
)))
3609 /* First switch to correct section. */
3610 #ifdef SELECT_RTX_SECTION
3611 SELECT_RTX_SECTION (pool
->mode
, x
);
3613 readonly_data_section ();
3616 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3617 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file
, x
, pool
->mode
,
3618 pool
->align
, pool
->labelno
, done
);
3621 if (pool
->align
> 1)
3622 ASM_OUTPUT_ALIGN (asm_out_file
, exact_log2 (pool
->align
));
3624 /* Output the label. */
3625 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LC", pool
->labelno
);
3627 /* Output the value of the constant itself. */
3628 switch (GET_MODE_CLASS (pool
->mode
))
3631 if (GET_CODE (x
) != CONST_DOUBLE
)
3634 bcopy ((char *) &CONST_DOUBLE_LOW (x
), (char *) &u
, sizeof u
);
3635 assemble_real (u
.d
, pool
->mode
);
3639 case MODE_PARTIAL_INT
:
3640 assemble_integer (x
, GET_MODE_SIZE (pool
->mode
), 1);
3647 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3653 #ifdef ASM_OUTPUT_POOL_EPILOGUE
3654 ASM_OUTPUT_POOL_EPILOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3657 /* Done with this pool. */
3658 first_pool
= last_pool
= 0;
3661 /* Look through the instructions for this function, and mark all the
3662 entries in the constant pool which are actually being used. */
3665 mark_constant_pool ()
3668 struct pool_constant
*pool
;
3670 if (first_pool
== 0)
3673 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3676 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
3677 if (GET_RTX_CLASS (GET_CODE (insn
)) == 'i')
3678 mark_constants (PATTERN (insn
));
3680 for (insn
= current_function_epilogue_delay_list
;
3682 insn
= XEXP (insn
, 1))
3683 if (GET_RTX_CLASS (GET_CODE (insn
)) == 'i')
3684 mark_constants (PATTERN (insn
));
3692 register char *format_ptr
;
3697 if (GET_CODE (x
) == SYMBOL_REF
)
3699 if (CONSTANT_POOL_ADDRESS_P (x
))
3700 find_pool_constant (x
)->mark
= 1;
3703 /* Never search inside a CONST_DOUBLE, because CONST_DOUBLE_MEM may be
3704 a MEM, but does not constitute a use of that MEM. This is particularly
3705 important inside a nested function, because CONST_DOUBLE_MEM may be
3706 a reference to a MEM in the parent's constant pool. See the comment
3707 in force_const_mem. */
3708 else if (GET_CODE (x
) == CONST_DOUBLE
)
3711 /* Insns may appear inside a SEQUENCE. Only check the patterns of
3712 insns, not any notes that may be attached. We don't want to mark
3713 a constant just because it happens to appear in a REG_EQUIV note. */
3714 if (GET_RTX_CLASS (GET_CODE (x
)) == 'i')
3716 mark_constants (PATTERN (x
));
3720 format_ptr
= GET_RTX_FORMAT (GET_CODE (x
));
3722 for (i
= 0; i
< GET_RTX_LENGTH (GET_CODE (x
)); i
++)
3724 switch (*format_ptr
++)
3727 mark_constants (XEXP (x
, i
));
3731 if (XVEC (x
, i
) != 0)
3735 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
3736 mark_constants (XVECEXP (x
, i
, j
));
3755 /* Find all the constants whose addresses are referenced inside of EXP,
3756 and make sure assembler code with a label has been output for each one.
3757 Indicate whether an ADDR_EXPR has been encountered. */
3760 output_addressed_constants (exp
)
3765 switch (TREE_CODE (exp
))
3769 register tree constant
= TREE_OPERAND (exp
, 0);
3771 while (TREE_CODE (constant
) == COMPONENT_REF
)
3773 constant
= TREE_OPERAND (constant
, 0);
3776 if (TREE_CODE_CLASS (TREE_CODE (constant
)) == 'c'
3777 || TREE_CODE (constant
) == CONSTRUCTOR
)
3778 /* No need to do anything here
3779 for addresses of variables or functions. */
3780 output_constant_def (constant
);
3787 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
3788 reloc
|= output_addressed_constants (TREE_OPERAND (exp
, 1));
3793 case NON_LVALUE_EXPR
:
3794 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
3800 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
3801 if (TREE_VALUE (link
) != 0)
3802 reloc
|= output_addressed_constants (TREE_VALUE (link
));
3812 /* Output assembler code for constant EXP to FILE, with no label.
3813 This includes the pseudo-op such as ".int" or ".byte", and a newline.
3814 Assumes output_addressed_constants has been done on EXP already.
3816 Generate exactly SIZE bytes of assembler data, padding at the end
3817 with zeros if necessary. SIZE must always be specified.
3819 SIZE is important for structure constructors,
3820 since trailing members may have been omitted from the constructor.
3821 It is also important for initialization of arrays from string constants
3822 since the full length of the string constant might not be wanted.
3823 It is also needed for initialization of unions, where the initializer's
3824 type is just one member, and that may not be as long as the union.
3826 There a case in which we would fail to output exactly SIZE bytes:
3827 for a structure constructor that wants to produce more than SIZE bytes.
3828 But such constructors will never be generated for any possible input. */
3831 output_constant (exp
, size
)
3835 register enum tree_code code
= TREE_CODE (TREE_TYPE (exp
));
3840 /* Eliminate the NON_LVALUE_EXPR_EXPR that makes a cast not be an lvalue.
3841 That way we get the constant (we hope) inside it. Also, strip off any
3842 NOP_EXPR that converts between two record, union, array, or set types. */
3843 while ((TREE_CODE (exp
) == NOP_EXPR
3844 && (TREE_TYPE (exp
) == TREE_TYPE (TREE_OPERAND (exp
, 0))
3845 || AGGREGATE_TYPE_P (TREE_TYPE (exp
))))
3846 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
3847 exp
= TREE_OPERAND (exp
, 0);
3849 /* Allow a constructor with no elements for any data type.
3850 This means to fill the space with zeros. */
3851 if (TREE_CODE (exp
) == CONSTRUCTOR
&& CONSTRUCTOR_ELTS (exp
) == 0)
3853 assemble_zeros (size
);
3864 case REFERENCE_TYPE
:
3865 /* ??? What about (int)((float)(int)&foo + 4) */
3866 while (TREE_CODE (exp
) == NOP_EXPR
|| TREE_CODE (exp
) == CONVERT_EXPR
3867 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
3868 exp
= TREE_OPERAND (exp
, 0);
3870 if (! assemble_integer (expand_expr (exp
, NULL_RTX
, VOIDmode
,
3871 EXPAND_INITIALIZER
),
3873 error ("initializer for integer value is too complicated");
3878 if (TREE_CODE (exp
) != REAL_CST
)
3879 error ("initializer for floating value is not a floating constant");
3881 assemble_real (TREE_REAL_CST (exp
),
3882 mode_for_size (size
* BITS_PER_UNIT
, MODE_FLOAT
, 0));
3887 output_constant (TREE_REALPART (exp
), size
/ 2);
3888 output_constant (TREE_IMAGPART (exp
), size
/ 2);
3889 size
-= (size
/ 2) * 2;
3893 if (TREE_CODE (exp
) == CONSTRUCTOR
)
3895 output_constructor (exp
, size
);
3898 else if (TREE_CODE (exp
) == STRING_CST
)
3902 if (size
> TREE_STRING_LENGTH (exp
))
3904 excess
= size
- TREE_STRING_LENGTH (exp
);
3905 size
= TREE_STRING_LENGTH (exp
);
3908 assemble_string (TREE_STRING_POINTER (exp
), size
);
3917 if (TREE_CODE (exp
) == CONSTRUCTOR
)
3918 output_constructor (exp
, size
);
3924 if (TREE_CODE (exp
) == INTEGER_CST
)
3925 assemble_integer (expand_expr (exp
, NULL_RTX
,
3926 VOIDmode
, EXPAND_INITIALIZER
),
3928 else if (TREE_CODE (exp
) == CONSTRUCTOR
)
3930 unsigned char *buffer
= (unsigned char *) alloca (size
);
3931 if (get_set_constructor_bytes (exp
, buffer
, size
))
3933 assemble_string ((char *) buffer
, size
);
3936 error ("unknown set constructor type");
3944 assemble_zeros (size
);
3948 /* Subroutine of output_constant, used for CONSTRUCTORs
3949 (aggregate constants).
3950 Generate at least SIZE bytes, padding if necessary. */
3953 output_constructor (exp
, size
)
3957 register tree link
, field
= 0;
3958 HOST_WIDE_INT min_index
= 0;
3959 /* Number of bytes output or skipped so far.
3960 In other words, current position within the constructor. */
3961 int total_bytes
= 0;
3962 /* Non-zero means BYTE contains part of a byte, to be output. */
3963 int byte_buffer_in_use
= 0;
3966 if (HOST_BITS_PER_WIDE_INT
< BITS_PER_UNIT
)
3969 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
3970 field
= TYPE_FIELDS (TREE_TYPE (exp
));
3972 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
3973 && TYPE_DOMAIN (TREE_TYPE (exp
)) != 0)
3975 = TREE_INT_CST_LOW (TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (exp
))));
3977 /* As LINK goes through the elements of the constant,
3978 FIELD goes through the structure fields, if the constant is a structure.
3979 if the constant is a union, then we override this,
3980 by getting the field from the TREE_LIST element.
3981 But the constant could also be an array. Then FIELD is zero. */
3982 for (link
= CONSTRUCTOR_ELTS (exp
);
3984 link
= TREE_CHAIN (link
),
3985 field
= field
? TREE_CHAIN (field
) : 0)
3987 tree val
= TREE_VALUE (link
);
3990 /* the element in a union constructor specifies the proper field. */
3992 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
3993 || TREE_CODE (TREE_TYPE (exp
)) == UNION_TYPE
)
3995 /* if available, use the type given by link */
3996 if (TREE_PURPOSE (link
) != 0)
3997 field
= TREE_PURPOSE (link
);
4000 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
4001 index
= TREE_PURPOSE (link
);
4003 /* Eliminate the marker that makes a cast not be an lvalue. */
4007 if (index
&& TREE_CODE (index
) == RANGE_EXPR
)
4009 register int fieldsize
4010 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (exp
)));
4011 HOST_WIDE_INT lo_index
= TREE_INT_CST_LOW (TREE_OPERAND (index
, 0));
4012 HOST_WIDE_INT hi_index
= TREE_INT_CST_LOW (TREE_OPERAND (index
, 1));
4013 HOST_WIDE_INT index
;
4014 for (index
= lo_index
; index
<= hi_index
; index
++)
4016 /* Output the element's initial value. */
4018 assemble_zeros (fieldsize
);
4020 output_constant (val
, fieldsize
);
4022 /* Count its size. */
4023 total_bytes
+= fieldsize
;
4026 else if (field
== 0 || !DECL_BIT_FIELD (field
))
4028 /* An element that is not a bit-field. */
4030 register int fieldsize
;
4031 /* Since this structure is static,
4032 we know the positions are constant. */
4033 int bitpos
= (field
? (TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field
))
4037 bitpos
= (TREE_INT_CST_LOW (TYPE_SIZE (TREE_TYPE (val
)))
4039 * (TREE_INT_CST_LOW (index
) - min_index
));
4041 /* Output any buffered-up bit-fields preceding this element. */
4042 if (byte_buffer_in_use
)
4044 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4046 byte_buffer_in_use
= 0;
4049 /* Advance to offset of this element.
4050 Note no alignment needed in an array, since that is guaranteed
4051 if each element has the proper size. */
4052 if ((field
!= 0 || index
!= 0) && bitpos
!= total_bytes
)
4054 assemble_zeros (bitpos
- total_bytes
);
4055 total_bytes
= bitpos
;
4058 /* Determine size this element should occupy. */
4061 if (TREE_CODE (DECL_SIZE (field
)) != INTEGER_CST
)
4063 if (TREE_INT_CST_LOW (DECL_SIZE (field
)) > 100000)
4065 /* This avoids overflow trouble. */
4066 tree size_tree
= size_binop (CEIL_DIV_EXPR
,
4068 size_int (BITS_PER_UNIT
));
4069 fieldsize
= TREE_INT_CST_LOW (size_tree
);
4073 fieldsize
= TREE_INT_CST_LOW (DECL_SIZE (field
));
4074 fieldsize
= (fieldsize
+ BITS_PER_UNIT
- 1) / BITS_PER_UNIT
;
4078 fieldsize
= int_size_in_bytes (TREE_TYPE (TREE_TYPE (exp
)));
4080 /* Output the element's initial value. */
4082 assemble_zeros (fieldsize
);
4084 output_constant (val
, fieldsize
);
4086 /* Count its size. */
4087 total_bytes
+= fieldsize
;
4089 else if (val
!= 0 && TREE_CODE (val
) != INTEGER_CST
)
4090 error ("invalid initial value for member `%s'",
4091 IDENTIFIER_POINTER (DECL_NAME (field
)));
4094 /* Element that is a bit-field. */
4096 int next_offset
= TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field
));
4098 = (next_offset
+ TREE_INT_CST_LOW (DECL_SIZE (field
)));
4101 val
= integer_zero_node
;
4103 /* If this field does not start in this (or, next) byte,
4105 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4107 /* Output remnant of any bit field in previous bytes. */
4108 if (byte_buffer_in_use
)
4110 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4112 byte_buffer_in_use
= 0;
4115 /* If still not at proper byte, advance to there. */
4116 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4118 assemble_zeros (next_offset
/ BITS_PER_UNIT
- total_bytes
);
4119 total_bytes
= next_offset
/ BITS_PER_UNIT
;
4123 if (! byte_buffer_in_use
)
4126 /* We must split the element into pieces that fall within
4127 separate bytes, and combine each byte with previous or
4128 following bit-fields. */
4130 /* next_offset is the offset n fbits from the beginning of
4131 the structure to the next bit of this element to be processed.
4132 end_offset is the offset of the first bit past the end of
4134 while (next_offset
< end_offset
)
4138 HOST_WIDE_INT value
;
4139 int next_byte
= next_offset
/ BITS_PER_UNIT
;
4140 int next_bit
= next_offset
% BITS_PER_UNIT
;
4142 /* Advance from byte to byte
4143 within this element when necessary. */
4144 while (next_byte
!= total_bytes
)
4146 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4151 /* Number of bits we can process at once
4152 (all part of the same byte). */
4153 this_time
= MIN (end_offset
- next_offset
,
4154 BITS_PER_UNIT
- next_bit
);
4155 if (BYTES_BIG_ENDIAN
)
4157 /* On big-endian machine, take the most significant bits
4158 first (of the bits that are significant)
4159 and put them into bytes from the most significant end. */
4160 shift
= end_offset
- next_offset
- this_time
;
4161 /* Don't try to take a bunch of bits that cross
4162 the word boundary in the INTEGER_CST. */
4163 if (shift
< HOST_BITS_PER_WIDE_INT
4164 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4166 this_time
-= (HOST_BITS_PER_WIDE_INT
- shift
);
4167 shift
= HOST_BITS_PER_WIDE_INT
;
4170 /* Now get the bits from the appropriate constant word. */
4171 if (shift
< HOST_BITS_PER_WIDE_INT
)
4173 value
= TREE_INT_CST_LOW (val
);
4175 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4177 value
= TREE_INT_CST_HIGH (val
);
4178 shift
-= HOST_BITS_PER_WIDE_INT
;
4182 byte
|= (((value
>> shift
)
4183 & (((HOST_WIDE_INT
) 1 << this_time
) - 1))
4184 << (BITS_PER_UNIT
- this_time
- next_bit
));
4188 /* On little-endian machines,
4189 take first the least significant bits of the value
4190 and pack them starting at the least significant
4191 bits of the bytes. */
4192 shift
= (next_offset
4193 - TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field
)));
4194 /* Don't try to take a bunch of bits that cross
4195 the word boundary in the INTEGER_CST. */
4196 if (shift
< HOST_BITS_PER_WIDE_INT
4197 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4199 this_time
-= (HOST_BITS_PER_WIDE_INT
- shift
);
4200 shift
= HOST_BITS_PER_WIDE_INT
;
4203 /* Now get the bits from the appropriate constant word. */
4204 if (shift
< HOST_BITS_PER_WIDE_INT
)
4205 value
= TREE_INT_CST_LOW (val
);
4206 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4208 value
= TREE_INT_CST_HIGH (val
);
4209 shift
-= HOST_BITS_PER_WIDE_INT
;
4213 byte
|= (((value
>> shift
)
4214 & (((HOST_WIDE_INT
) 1 << this_time
) - 1))
4217 next_offset
+= this_time
;
4218 byte_buffer_in_use
= 1;
4222 if (byte_buffer_in_use
)
4224 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4227 if (total_bytes
< size
)
4228 assemble_zeros (size
- total_bytes
);
4231 /* Output asm to handle ``#pragma weak'' */
4234 handle_pragma_weak (what
, name
, value
)
4235 enum pragma_state what
;
4238 #ifdef HANDLE_PRAGMA_WEAK
4239 if (what
== ps_name
|| what
== ps_value
)
4241 struct weak_syms
*weak
=
4242 (struct weak_syms
*)permalloc (sizeof (struct weak_syms
));
4243 weak
->next
= weak_decls
;
4244 weak
->name
= permalloc (strlen (name
) + 1);
4245 strcpy (weak
->name
, name
);
4247 if (what
!= ps_value
)
4248 weak
->value
= NULL_PTR
;
4252 weak
->value
= permalloc (strlen (value
) + 1);
4253 strcpy (weak
->value
, value
);
4258 else if (! (what
== ps_done
|| what
== ps_start
))
4259 warning ("malformed `#pragma weak'");
4260 #endif /* HANDLE_PRAGMA_WEAK */
4263 /* Declare DECL to be a weak symbol. */
4269 if (! TREE_PUBLIC (decl
))
4270 error_with_decl (decl
, "weak declaration of `%s' must be public");
4271 else if (TREE_ASM_WRITTEN (decl
))
4272 error_with_decl (decl
, "weak declaration of `%s' must precede definition");
4273 else if (SUPPORTS_WEAK
)
4274 DECL_WEAK (decl
) = 1;
4277 /* Emit any pending weak declarations. */
4282 #ifdef HANDLE_PRAGMA_WEAK
4283 if (HANDLE_PRAGMA_WEAK
)
4285 struct weak_syms
*t
;
4286 for (t
= weak_decls
; t
; t
= t
->next
)
4288 ASM_WEAKEN_LABEL (asm_out_file
, t
->name
);
4290 ASM_OUTPUT_DEF (asm_out_file
, t
->name
, t
->value
);
4297 assemble_alias (decl
, target
)
4302 make_decl_rtl (decl
, (char *) 0, 1);
4303 name
= XSTR (XEXP (DECL_RTL (decl
), 0), 0);
4305 #ifdef ASM_OUTPUT_DEF
4306 /* Make name accessible from other files, if appropriate. */
4308 if (TREE_PUBLIC (decl
))
4310 #ifdef ASM_WEAKEN_LABEL
4311 if (DECL_WEAK (decl
))
4312 ASM_WEAKEN_LABEL (asm_out_file
, name
);
4315 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
4318 ASM_OUTPUT_DEF (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4319 TREE_ASM_WRITTEN (decl
) = 1;
4321 #ifdef ASM_OUTPUT_WEAK_ALIAS
4322 if (! DECL_WEAK (decl
))
4323 warning ("only weak aliases are supported in this configuration");
4325 ASM_OUTPUT_WEAK_ALIAS (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4326 TREE_ASM_WRITTEN (decl
) = 1;
4328 warning ("alias definitions not supported in this configuration; ignored");
4333 /* This determines whether or not we support link-once semantics. */
4334 #ifndef SUPPORTS_ONE_ONLY
4335 #ifdef MAKE_DECL_ONE_ONLY
4336 #define SUPPORTS_ONE_ONLY 1
4338 #define SUPPORTS_ONE_ONLY 0
4342 /* Returns 1 if the target configuration supports defining public symbols
4343 so that one of them will be chosen at link time instead of generating a
4344 multiply-defined symbol error, whether through the use of weak symbols or
4345 a target-specific mechanism for having duplicates discarded. */
4348 supports_one_only ()
4350 if (SUPPORTS_ONE_ONLY
)
4352 return SUPPORTS_WEAK
;
4355 /* Set up DECL as a public symbol that can be defined in multiple
4356 translation units without generating a linker error. */
4359 make_decl_one_only (decl
)
4362 if (TREE_CODE (decl
) != VAR_DECL
&& TREE_CODE (decl
) != FUNCTION_DECL
)
4365 TREE_PUBLIC (decl
) = 1;
4367 if (TREE_CODE (decl
) == VAR_DECL
4368 && (DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
))
4369 DECL_COMMON (decl
) = 1;
4370 else if (SUPPORTS_ONE_ONLY
)
4372 #ifdef MAKE_DECL_ONE_ONLY
4373 MAKE_DECL_ONE_ONLY (decl
);
4375 DECL_ONE_ONLY (decl
) = 1;
4377 else if (SUPPORTS_WEAK
)
4378 DECL_WEAK (decl
) = 1;