1 /* Output variables, constants and external declarations, for GNU compiler.
2 Copyright (C) 1987, 88, 89, 92-6, 1997 Free Software Foundation, Inc.
4 This file is part of GNU CC.
6 GNU CC is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2, or (at your option)
11 GNU CC is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with GNU CC; see the file COPYING. If not, write to
18 the Free Software Foundation, 59 Temple Place - Suite 330,
19 Boston, MA 02111-1307, USA. */
22 /* This file handles generation of all the assembler code
23 *except* the instructions of a function.
24 This includes declarations of variables and their initial values.
26 We also output the assembler code for constants stored in memory
27 and are responsible for combining constants with the same value. */
31 /* #include <stab.h> */
40 #include "hard-reg-set.h"
49 #ifdef XCOFF_DEBUGGING_INFO
55 #ifndef TRAMPOLINE_ALIGNMENT
56 #define TRAMPOLINE_ALIGNMENT FUNCTION_BOUNDARY
60 #define ASM_STABS_OP ".stabs"
63 /* This macro gets just the user-specified name
64 out of the string in a SYMBOL_REF. On most machines,
65 we discard the * if any and that's all. */
66 #ifndef STRIP_NAME_ENCODING
67 #define STRIP_NAME_ENCODING(VAR,SYMBOL_NAME) \
68 (VAR) = ((SYMBOL_NAME) + ((SYMBOL_NAME)[0] == '*'))
71 /* File in which assembler code is being written. */
73 extern FILE *asm_out_file
;
75 /* The (assembler) name of the first globally-visible object output. */
76 char *first_global_object_name
;
78 extern struct obstack
*current_obstack
;
79 extern struct obstack
*saveable_obstack
;
80 extern struct obstack
*rtl_obstack
;
81 extern struct obstack permanent_obstack
;
82 #define obstack_chunk_alloc xmalloc
84 /* Number for making the label on the next
85 constant that is stored in memory. */
89 /* Number for making the label on the next
90 static variable internal to a function. */
94 /* Carry information from ASM_DECLARE_OBJECT_NAME
95 to ASM_FINISH_DECLARE_OBJECT. */
97 int size_directive_output
;
99 /* The last decl for which assemble_variable was called,
100 if it did ASM_DECLARE_OBJECT_NAME.
101 If the last call to assemble_variable didn't do that,
104 tree last_assemble_variable_decl
;
107 #ifdef HANDLE_PRAGMA_WEAK
108 /* Any weak symbol declarations waiting to be emitted. */
112 struct weak_syms
*next
;
117 static struct weak_syms
*weak_decls
;
120 /* Nonzero if at least one function definition has been seen. */
122 static int function_defined
;
125 struct constant_descriptor
;
127 struct pool_constant
;
129 static void bc_make_decl_rtl
PROTO((tree
, char *, int));
130 static char *strip_reg_name
PROTO((char *));
131 static void bc_output_ascii
PROTO((FILE *, char *, int));
132 static int contains_pointers_p
PROTO((tree
));
133 static void decode_addr_const
PROTO((tree
, struct addr_const
*));
134 static int const_hash
PROTO((tree
));
135 static int compare_constant
PROTO((tree
,
136 struct constant_descriptor
*));
137 static char *compare_constant_1
PROTO((tree
, char *));
138 static struct constant_descriptor
*record_constant
PROTO((tree
));
139 static void record_constant_1
PROTO((tree
));
140 static tree copy_constant
PROTO((tree
));
141 static void output_constant_def_contents
PROTO((tree
, int, int));
142 static void decode_rtx_const
PROTO((enum machine_mode
, rtx
,
143 struct rtx_const
*));
144 static int const_hash_rtx
PROTO((enum machine_mode
, rtx
));
145 static int compare_constant_rtx
PROTO((enum machine_mode
, rtx
,
146 struct constant_descriptor
*));
147 static struct constant_descriptor
*record_constant_rtx
PROTO((enum machine_mode
,
149 static struct pool_constant
*find_pool_constant
PROTO((rtx
));
150 static void mark_constant_pool
PROTO((void));
151 static void mark_constants
PROTO((rtx
));
152 static int output_addressed_constants
PROTO((tree
));
153 static void output_after_function_constants
PROTO((void));
154 static void bc_assemble_integer
PROTO((tree
, int));
155 static void output_constructor
PROTO((tree
, int));
157 static enum in_section
{ no_section
, in_text
, in_data
, in_named
158 #ifdef BSS_SECTION_ASM_OP
161 #ifdef EXTRA_SECTIONS
164 } in_section
= no_section
;
166 /* Return a non-zero value if DECL has a section attribute. */
167 #define IN_NAMED_SECTION(DECL) \
168 ((TREE_CODE (DECL) == FUNCTION_DECL || TREE_CODE (DECL) == VAR_DECL) \
169 && DECL_SECTION_NAME (DECL) != NULL_TREE)
171 /* Text of section name when in_section == in_named. */
172 static char *in_named_name
;
174 /* Define functions like text_section for any extra sections. */
175 #ifdef EXTRA_SECTION_FUNCTIONS
176 EXTRA_SECTION_FUNCTIONS
179 /* Tell assembler to switch to text section. */
184 if (in_section
!= in_text
)
189 fprintf (asm_out_file
, "%s\n", TEXT_SECTION_ASM_OP
);
191 in_section
= in_text
;
195 /* Tell assembler to switch to data section. */
200 if (in_section
!= in_data
)
206 if (flag_shared_data
)
208 #ifdef SHARED_SECTION_ASM_OP
209 fprintf (asm_out_file
, "%s\n", SHARED_SECTION_ASM_OP
);
211 fprintf (asm_out_file
, "%s\n", DATA_SECTION_ASM_OP
);
215 fprintf (asm_out_file
, "%s\n", DATA_SECTION_ASM_OP
);
218 in_section
= in_data
;
222 /* Tell assembler to switch to read-only data section. This is normally
226 readonly_data_section ()
228 #ifdef READONLY_DATA_SECTION
229 READONLY_DATA_SECTION (); /* Note this can call data_section. */
235 /* Determine if we're in the text section. */
240 return in_section
== in_text
;
243 /* Determine if we're in the data section. */
248 return in_section
== in_data
;
251 /* Tell assembler to change to section NAME for DECL.
252 If DECL is NULL, just switch to section NAME.
253 If NAME is NULL, get the name from DECL.
254 If RELOC is 1, the initializer for DECL contains relocs. */
257 named_section (decl
, name
, reloc
)
262 if (decl
!= NULL_TREE
263 && TREE_CODE_CLASS (TREE_CODE (decl
)) != 'd')
266 name
= TREE_STRING_POINTER (DECL_SECTION_NAME (decl
));
268 if (in_section
!= in_named
|| strcmp (name
, in_named_name
))
270 in_named_name
= obstack_alloc (&permanent_obstack
, strlen (name
) + 1);
271 strcpy (in_named_name
, name
);
272 in_section
= in_named
;
274 #ifdef ASM_OUTPUT_SECTION_NAME
275 ASM_OUTPUT_SECTION_NAME (asm_out_file
, decl
, name
, reloc
);
277 /* Section attributes are not supported if this macro isn't provided -
278 some host formats don't support them at all. The front-end should
279 already have flagged this as an error. */
285 #ifdef ASM_OUTPUT_SECTION_NAME
286 #ifndef UNIQUE_SECTION
287 #define UNIQUE_SECTION(DECL,RELOC) \
290 char *name, *string; \
292 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (DECL)); \
293 /* Strip off any encoding in name. */ \
294 STRIP_NAME_ENCODING (name, name); \
296 len = strlen (name) + 1; \
297 string = alloca (len + 1); \
298 sprintf (string, ".%s", name); \
300 DECL_SECTION_NAME (DECL) = build_string (len, string); \
303 #ifndef UNIQUE_SECTION_P
304 #define UNIQUE_SECTION_P(DECL) 0
308 #ifdef BSS_SECTION_ASM_OP
310 /* Tell the assembler to switch to the bss section. */
315 if (in_section
!= in_bss
)
321 #ifdef SHARED_BSS_SECTION_ASM_OP
322 if (flag_shared_data
)
323 fprintf (asm_out_file
, "%s\n", SHARED_BSS_SECTION_ASM_OP
);
326 fprintf (asm_out_file
, "%s\n", BSS_SECTION_ASM_OP
);
333 #ifdef ASM_OUTPUT_BSS
335 /* Utility function for ASM_OUTPUT_BSS for targets to use if
336 they don't support alignments in .bss.
337 ??? It is believed that this function will work in most cases so such
338 support is localized here. */
341 asm_output_bss (file
, decl
, name
, size
, rounded
)
347 ASM_GLOBALIZE_LABEL (file
, name
);
349 #ifdef ASM_DECLARE_OBJECT_NAME
350 last_assemble_variable_decl
= decl
;
351 ASM_DECLARE_OBJECT_NAME (file
, name
, decl
);
353 /* Standard thing is just output label for the object. */
354 ASM_OUTPUT_LABEL (file
, name
);
355 #endif /* ASM_DECLARE_OBJECT_NAME */
356 ASM_OUTPUT_SKIP (file
, rounded
);
361 #ifdef ASM_OUTPUT_ALIGNED_BSS
363 /* Utility function for targets to use in implementing
364 ASM_OUTPUT_ALIGNED_BSS.
365 ??? It is believed that this function will work in most cases so such
366 support is localized here. */
369 asm_output_aligned_bss (file
, decl
, name
, size
, align
)
375 ASM_GLOBALIZE_LABEL (file
, name
);
377 ASM_OUTPUT_ALIGN (file
, floor_log2 (align
/ BITS_PER_UNIT
));
378 #ifdef ASM_DECLARE_OBJECT_NAME
379 last_assemble_variable_decl
= decl
;
380 ASM_DECLARE_OBJECT_NAME (file
, name
, decl
);
382 /* Standard thing is just output label for the object. */
383 ASM_OUTPUT_LABEL (file
, name
);
384 #endif /* ASM_DECLARE_OBJECT_NAME */
385 ASM_OUTPUT_SKIP (file
, size
? size
: 1);
390 #endif /* BSS_SECTION_ASM_OP */
392 /* Switch to the section for function DECL.
394 If DECL is NULL_TREE, switch to the text section.
395 ??? It's not clear that we will ever be passed NULL_TREE, but it's
396 safer to handle it. */
399 function_section (decl
)
402 if (decl
!= NULL_TREE
403 && DECL_SECTION_NAME (decl
) != NULL_TREE
)
404 named_section (decl
, (char *) 0, 0);
409 /* Switch to section for variable DECL.
411 RELOC is the `reloc' argument to SELECT_SECTION. */
414 variable_section (decl
, reloc
)
418 if (IN_NAMED_SECTION (decl
))
419 named_section (decl
, NULL
, reloc
);
422 /* C++ can have const variables that get initialized from constructors,
423 and thus can not be in a readonly section. We prevent this by
424 verifying that the initial value is constant for objects put in a
427 error_mark_node is used by the C front end to indicate that the
428 initializer has not been seen yet. In this case, we assume that
429 the initializer must be constant.
431 C++ uses error_mark_node for variables that have complicated
432 initializers, but these variables go in BSS so we won't be called
435 #ifdef SELECT_SECTION
436 SELECT_SECTION (decl
, reloc
);
438 if (DECL_READONLY_SECTION (decl
, reloc
))
439 readonly_data_section ();
446 /* Tell assembler to switch to the section for the exception handling
452 #ifdef ASM_OUTPUT_SECTION_NAME
453 named_section (NULL_TREE
, ".gcc_except_table", 0);
458 #if defined (EXCEPTION_SECTION)
459 EXCEPTION_SECTION ();
461 readonly_data_section ();
466 /* Create the rtl to represent a function, for a function definition.
467 DECL is a FUNCTION_DECL node which describes which function.
468 The rtl is stored into DECL. */
471 make_function_rtl (decl
)
474 char *name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
478 if (DECL_RTL (decl
) == 0)
479 DECL_RTL (decl
) = bc_gen_rtx (name
, 0, (struct bc_label
*) 0);
481 /* Record that at least one function has been defined. */
482 function_defined
= 1;
486 /* Rename a nested function to avoid conflicts. */
487 if (decl_function_context (decl
) != 0
488 && DECL_INITIAL (decl
) != 0
489 && DECL_RTL (decl
) == 0)
493 name
= IDENTIFIER_POINTER (DECL_NAME (decl
));
494 ASM_FORMAT_PRIVATE_NAME (label
, name
, var_labelno
);
495 name
= obstack_copy0 (saveable_obstack
, label
, strlen (label
));
499 if (DECL_RTL (decl
) == 0)
502 = gen_rtx (MEM
, DECL_MODE (decl
),
503 gen_rtx (SYMBOL_REF
, Pmode
, name
));
505 /* Optionally set flags or add text to the name to record information
506 such as that it is a function name. If the name is changed, the macro
507 ASM_OUTPUT_LABELREF will have to know how to strip this information. */
508 #ifdef ENCODE_SECTION_INFO
509 ENCODE_SECTION_INFO (decl
);
513 /* Record at least one function has been defined. */
514 function_defined
= 1;
517 /* Create the DECL_RTL for a declaration for a static or external
518 variable or static or external function.
519 ASMSPEC, if not 0, is the string which the user specified
520 as the assembler symbol name.
521 TOP_LEVEL is nonzero if this is a file-scope variable.
522 This is never called for PARM_DECLs. */
525 bc_make_decl_rtl (decl
, asmspec
, top_level
)
530 register char *name
= TREE_STRING_POINTER (DECL_ASSEMBLER_NAME (decl
));
532 if (DECL_RTL (decl
) == 0)
534 /* Print an error message for register variables. */
535 if (DECL_REGISTER (decl
))
536 error ("global register variables not supported in the interpreter");
538 /* Handle ordinary static variables and functions. */
539 if (DECL_RTL (decl
) == 0)
541 /* Can't use just the variable's own name for a variable
542 whose scope is less than the whole file.
543 Concatenate a distinguishing number. */
544 if (!top_level
&& !DECL_EXTERNAL (decl
) && asmspec
== 0)
548 ASM_FORMAT_PRIVATE_NAME (label
, name
, var_labelno
);
549 name
= obstack_copy0 (saveable_obstack
, label
, strlen (label
));
553 DECL_RTL (decl
) = bc_gen_rtx (name
, 0, (struct bc_label
*) 0);
558 /* Given NAME, a putative register name, discard any customary prefixes. */
561 strip_reg_name (name
)
564 #ifdef REGISTER_PREFIX
565 if (!strncmp (name
, REGISTER_PREFIX
, strlen (REGISTER_PREFIX
)))
566 name
+= strlen (REGISTER_PREFIX
);
568 if (name
[0] == '%' || name
[0] == '#')
573 /* Decode an `asm' spec for a declaration as a register name.
574 Return the register number, or -1 if nothing specified,
575 or -2 if the ASMSPEC is not `cc' or `memory' and is not recognized,
576 or -3 if ASMSPEC is `cc' and is not recognized,
577 or -4 if ASMSPEC is `memory' and is not recognized.
578 Accept an exact spelling or a decimal number.
579 Prefixes such as % are optional. */
582 decode_reg_name (asmspec
)
589 /* Get rid of confusing prefixes. */
590 asmspec
= strip_reg_name (asmspec
);
592 /* Allow a decimal number as a "register name". */
593 for (i
= strlen (asmspec
) - 1; i
>= 0; i
--)
594 if (! (asmspec
[i
] >= '0' && asmspec
[i
] <= '9'))
596 if (asmspec
[0] != 0 && i
< 0)
599 if (i
< FIRST_PSEUDO_REGISTER
&& i
>= 0)
605 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
607 && ! strcmp (asmspec
, strip_reg_name (reg_names
[i
])))
610 #ifdef ADDITIONAL_REGISTER_NAMES
612 static struct { char *name
; int number
; } table
[]
613 = ADDITIONAL_REGISTER_NAMES
;
615 for (i
= 0; i
< sizeof (table
) / sizeof (table
[0]); i
++)
616 if (! strcmp (asmspec
, table
[i
].name
))
617 return table
[i
].number
;
619 #endif /* ADDITIONAL_REGISTER_NAMES */
621 if (!strcmp (asmspec
, "memory"))
624 if (!strcmp (asmspec
, "cc"))
633 /* Create the DECL_RTL for a declaration for a static or external variable
634 or static or external function.
635 ASMSPEC, if not 0, is the string which the user specified
636 as the assembler symbol name.
637 TOP_LEVEL is nonzero if this is a file-scope variable.
639 This is never called for PARM_DECL nodes. */
642 make_decl_rtl (decl
, asmspec
, top_level
)
647 register char *name
= 0;
652 bc_make_decl_rtl (decl
, asmspec
, top_level
);
656 reg_number
= decode_reg_name (asmspec
);
658 if (DECL_ASSEMBLER_NAME (decl
) != NULL_TREE
)
659 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
661 if (reg_number
== -2)
663 /* ASMSPEC is given, and not the name of a register. */
664 name
= (char *) obstack_alloc (saveable_obstack
,
665 strlen (asmspec
) + 2);
667 strcpy (&name
[1], asmspec
);
670 /* For a duplicate declaration, we can be called twice on the
671 same DECL node. Don't discard the RTL already made. */
672 if (DECL_RTL (decl
) == 0)
676 /* First detect errors in declaring global registers. */
677 if (TREE_CODE (decl
) != FUNCTION_DECL
678 && DECL_REGISTER (decl
) && reg_number
== -1)
679 error_with_decl (decl
,
680 "register name not specified for `%s'");
681 else if (TREE_CODE (decl
) != FUNCTION_DECL
682 && DECL_REGISTER (decl
) && reg_number
< 0)
683 error_with_decl (decl
,
684 "invalid register name for `%s'");
685 else if ((reg_number
>= 0 || reg_number
== -3)
686 && (TREE_CODE (decl
) == FUNCTION_DECL
687 && ! DECL_REGISTER (decl
)))
688 error_with_decl (decl
,
689 "register name given for non-register variable `%s'");
690 else if (TREE_CODE (decl
) != FUNCTION_DECL
691 && DECL_REGISTER (decl
)
692 && TYPE_MODE (TREE_TYPE (decl
)) == BLKmode
)
693 error_with_decl (decl
,
694 "data type of `%s' isn't suitable for a register");
695 else if (TREE_CODE (decl
) != FUNCTION_DECL
&& DECL_REGISTER (decl
)
696 && ! HARD_REGNO_MODE_OK (reg_number
,
697 TYPE_MODE (TREE_TYPE (decl
))))
698 error_with_decl (decl
,
699 "register number for `%s' isn't suitable for data type");
700 /* Now handle properly declared static register variables. */
701 else if (TREE_CODE (decl
) != FUNCTION_DECL
&& DECL_REGISTER (decl
))
705 if (DECL_INITIAL (decl
) != 0 && top_level
)
707 DECL_INITIAL (decl
) = 0;
708 error ("global register variable has initial value");
710 if (fixed_regs
[reg_number
] == 0
711 && function_defined
&& top_level
)
712 error ("global register variable follows a function definition");
713 if (TREE_THIS_VOLATILE (decl
))
714 warning ("volatile register variables don't work as you might wish");
716 /* If the user specified one of the eliminables registers here,
717 e.g., FRAME_POINTER_REGNUM, we don't want to get this variable
718 confused with that register and be eliminated. Although this
719 usage is somewhat suspect, we nevertheless use the following
720 kludge to avoid setting DECL_RTL to frame_pointer_rtx. */
723 = gen_rtx (REG
, DECL_MODE (decl
), FIRST_PSEUDO_REGISTER
);
724 REGNO (DECL_RTL (decl
)) = reg_number
;
725 REG_USERVAR_P (DECL_RTL (decl
)) = 1;
729 /* Make this register global, so not usable for anything
731 nregs
= HARD_REGNO_NREGS (reg_number
, DECL_MODE (decl
));
733 globalize_reg (reg_number
+ --nregs
);
736 /* Specifying a section attribute on a variable forces it into a
737 non-.bss section, and thus it cannot be common. */
738 else if (TREE_CODE (decl
) == VAR_DECL
739 && DECL_SECTION_NAME (decl
) != NULL_TREE
740 && DECL_INITIAL (decl
) == NULL_TREE
741 && DECL_COMMON (decl
))
742 DECL_COMMON (decl
) = 0;
744 /* Now handle ordinary static variables and functions (in memory).
745 Also handle vars declared register invalidly. */
746 if (DECL_RTL (decl
) == 0)
748 /* Can't use just the variable's own name for a variable
749 whose scope is less than the whole file.
750 Concatenate a distinguishing number. */
751 if (!top_level
&& !DECL_EXTERNAL (decl
) && asmspec
== 0)
755 ASM_FORMAT_PRIVATE_NAME (label
, name
, var_labelno
);
756 name
= obstack_copy0 (saveable_obstack
, label
, strlen (label
));
763 DECL_RTL (decl
) = gen_rtx (MEM
, DECL_MODE (decl
),
764 gen_rtx (SYMBOL_REF
, Pmode
, name
));
766 /* If this variable is to be treated as volatile, show its
767 tree node has side effects. If it has side effects, either
768 because of this test or from TREE_THIS_VOLATILE also
769 being set, show the MEM is volatile. */
770 if (flag_volatile_global
&& TREE_CODE (decl
) == VAR_DECL
771 && TREE_PUBLIC (decl
))
772 TREE_SIDE_EFFECTS (decl
) = 1;
773 if (TREE_SIDE_EFFECTS (decl
))
774 MEM_VOLATILE_P (DECL_RTL (decl
)) = 1;
776 if (TREE_READONLY (decl
))
777 RTX_UNCHANGING_P (DECL_RTL (decl
)) = 1;
778 MEM_IN_STRUCT_P (DECL_RTL (decl
))
779 = AGGREGATE_TYPE_P (TREE_TYPE (decl
));
781 /* Optionally set flags or add text to the name to record information
782 such as that it is a function name.
783 If the name is changed, the macro ASM_OUTPUT_LABELREF
784 will have to know how to strip this information. */
785 #ifdef ENCODE_SECTION_INFO
786 ENCODE_SECTION_INFO (decl
);
790 /* If the old RTL had the wrong mode, fix the mode. */
791 else if (GET_MODE (DECL_RTL (decl
)) != DECL_MODE (decl
))
793 rtx rtl
= DECL_RTL (decl
);
794 PUT_MODE (rtl
, DECL_MODE (decl
));
798 /* Make the rtl for variable VAR be volatile.
799 Use this only for static variables. */
802 make_var_volatile (var
)
805 if (GET_CODE (DECL_RTL (var
)) != MEM
)
808 MEM_VOLATILE_P (DECL_RTL (var
)) = 1;
811 /* Output alignment directive to align for constant expression EXP. */
814 assemble_constant_align (exp
)
819 /* Align the location counter as required by EXP's data type. */
820 align
= TYPE_ALIGN (TREE_TYPE (exp
));
821 #ifdef CONSTANT_ALIGNMENT
822 align
= CONSTANT_ALIGNMENT (exp
, align
);
825 if (align
> BITS_PER_UNIT
)
826 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
829 /* Output a string of literal assembler code
830 for an `asm' keyword used between functions. */
833 assemble_asm (string
)
838 error ("asm statements not allowed in interpreter");
844 if (TREE_CODE (string
) == ADDR_EXPR
)
845 string
= TREE_OPERAND (string
, 0);
847 fprintf (asm_out_file
, "\t%s\n", TREE_STRING_POINTER (string
));
850 #if 0 /* This should no longer be needed, because
851 flag_gnu_linker should be 0 on these systems,
852 which should prevent any output
853 if ASM_OUTPUT_CONSTRUCTOR and ASM_OUTPUT_DESTRUCTOR are absent. */
854 #if !(defined(DBX_DEBUGGING_INFO) && !defined(FASCIST_ASSEMBLER))
855 #ifndef ASM_OUTPUT_CONSTRUCTOR
856 #define ASM_OUTPUT_CONSTRUCTOR(file, name)
858 #ifndef ASM_OUTPUT_DESTRUCTOR
859 #define ASM_OUTPUT_DESTRUCTOR(file, name)
864 /* Record an element in the table of global destructors.
865 How this is done depends on what sort of assembler and linker
868 NAME should be the name of a global function to be called
869 at exit time. This name is output using assemble_name. */
872 assemble_destructor (name
)
875 #ifdef ASM_OUTPUT_DESTRUCTOR
876 ASM_OUTPUT_DESTRUCTOR (asm_out_file
, name
);
880 /* Now tell GNU LD that this is part of the static destructor set. */
881 /* This code works for any machine provided you use GNU as/ld. */
882 fprintf (asm_out_file
, "%s \"___DTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
883 assemble_name (asm_out_file
, name
);
884 fputc ('\n', asm_out_file
);
889 /* Likewise for global constructors. */
892 assemble_constructor (name
)
895 #ifdef ASM_OUTPUT_CONSTRUCTOR
896 ASM_OUTPUT_CONSTRUCTOR (asm_out_file
, name
);
900 /* Now tell GNU LD that this is part of the static constructor set. */
901 /* This code works for any machine provided you use GNU as/ld. */
902 fprintf (asm_out_file
, "%s \"___CTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
903 assemble_name (asm_out_file
, name
);
904 fputc ('\n', asm_out_file
);
909 /* Likewise for entries we want to record for garbage collection.
910 Garbage collection is still under development. */
913 assemble_gc_entry (name
)
916 #ifdef ASM_OUTPUT_GC_ENTRY
917 ASM_OUTPUT_GC_ENTRY (asm_out_file
, name
);
921 /* Now tell GNU LD that this is part of the static constructor set. */
922 fprintf (asm_out_file
, "%s \"___PTR_LIST__\",22,0,0,", ASM_STABS_OP
);
923 assemble_name (asm_out_file
, name
);
924 fputc ('\n', asm_out_file
);
929 /* CONSTANT_POOL_BEFORE_FUNCTION may be defined as an expression with
930 a non-zero value if the constant pool should be output before the
931 start of the function, or a zero value if the pool should output
932 after the end of the function. The default is to put it before the
935 #ifndef CONSTANT_POOL_BEFORE_FUNCTION
936 #define CONSTANT_POOL_BEFORE_FUNCTION 1
939 /* Output assembler code for the constant pool of a function and associated
940 with defining the name of the function. DECL describes the function.
941 NAME is the function's name. For the constant pool, we use the current
942 constant pool data. */
945 assemble_start_function (decl
, fnname
)
951 /* The following code does not need preprocessing in the assembler. */
955 if (CONSTANT_POOL_BEFORE_FUNCTION
)
956 output_constant_pool (fnname
, decl
);
958 #ifdef ASM_OUTPUT_SECTION_NAME
959 /* If the function is to be put in its own section and it's not in a section
960 already, indicate so. */
961 if ((flag_function_sections
962 && DECL_SECTION_NAME (decl
) == NULL_TREE
)
963 || UNIQUE_SECTION_P (decl
))
964 UNIQUE_SECTION (decl
, 0);
967 function_section (decl
);
969 /* Tell assembler to move to target machine's alignment for functions. */
970 align
= floor_log2 (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
974 BC_OUTPUT_ALIGN (asm_out_file
, align
);
976 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
979 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
980 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file
, fnname
);
983 #ifdef SDB_DEBUGGING_INFO
984 /* Output SDB definition of the function. */
985 if (write_symbols
== SDB_DEBUG
)
986 sdbout_mark_begin_function ();
989 #ifdef DBX_DEBUGGING_INFO
990 /* Output DBX definition of the function. */
991 if (write_symbols
== DBX_DEBUG
)
992 dbxout_begin_function (decl
);
995 /* Make function name accessible from other files, if appropriate. */
997 if (TREE_PUBLIC (decl
))
999 if (!first_global_object_name
&& ! DECL_WEAK (decl
)
1000 && ! DECL_ONE_ONLY (decl
))
1004 STRIP_NAME_ENCODING (p
, fnname
);
1005 first_global_object_name
= permalloc (strlen (p
) + 1);
1006 strcpy (first_global_object_name
, p
);
1009 #ifdef ASM_WEAKEN_LABEL
1010 if (DECL_WEAK (decl
))
1011 ASM_WEAKEN_LABEL (asm_out_file
, fnname
);
1014 if (output_bytecode
)
1015 BC_GLOBALIZE_LABEL (asm_out_file
, fnname
);
1017 ASM_GLOBALIZE_LABEL (asm_out_file
, fnname
);
1020 /* Do any machine/system dependent processing of the function name */
1021 if (output_bytecode
)
1022 BC_OUTPUT_LABEL (asm_out_file
, fnname
);
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 */
1034 /* Output assembler code associated with defining the size of the
1035 function. DECL describes the function. NAME is the function's name. */
1038 assemble_end_function (decl
, fnname
)
1042 #ifdef ASM_DECLARE_FUNCTION_SIZE
1043 ASM_DECLARE_FUNCTION_SIZE (asm_out_file
, fnname
, decl
);
1045 if (! CONSTANT_POOL_BEFORE_FUNCTION
)
1047 output_constant_pool (fnname
, decl
);
1048 function_section (decl
); /* need to switch back */
1051 /* Output any constants which should appear after the function. */
1052 output_after_function_constants ();
1055 /* Assemble code to leave SIZE bytes of zeros. */
1058 assemble_zeros (size
)
1061 if (output_bytecode
)
1063 bc_emit_const_skip (size
);
1067 #ifdef ASM_NO_SKIP_IN_TEXT
1068 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
1069 so we must output 0s explicitly in the text section. */
1070 if (ASM_NO_SKIP_IN_TEXT
&& in_text_section ())
1074 for (i
= 0; i
< size
- 20; i
+= 20)
1077 fprintf (asm_out_file
,
1078 "%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
);
1080 fprintf (asm_out_file
,
1081 "\tbyte 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n");
1087 fprintf (asm_out_file
, "%s 0", ASM_BYTE_OP
);
1089 fprintf (asm_out_file
, "\tbyte 0");
1092 for (; i
< size
; i
++)
1093 fprintf (asm_out_file
, ",0");
1094 fprintf (asm_out_file
, "\n");
1101 if (output_bytecode
)
1102 BC_OUTPUT_SKIP (asm_out_file
, size
);
1104 ASM_OUTPUT_SKIP (asm_out_file
, size
);
1108 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
1111 assemble_align (align
)
1114 if (align
> BITS_PER_UNIT
)
1115 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
1118 /* Assemble a string constant with the specified C string as contents. */
1121 assemble_string (p
, size
)
1129 if (output_bytecode
)
1135 /* If the string is very long, split it up. */
1139 int thissize
= size
- pos
;
1140 if (thissize
> maximum
)
1143 if (output_bytecode
)
1144 bc_output_ascii (asm_out_file
, p
, thissize
);
1147 ASM_OUTPUT_ASCII (asm_out_file
, p
, thissize
);
1156 bc_output_ascii (file
, p
, size
)
1161 BC_OUTPUT_ASCII (file
, p
, size
);
1164 /* Assemble everything that is needed for a variable or function declaration.
1165 Not used for automatic variables, and not used for function definitions.
1166 Should not be called for variables of incomplete structure type.
1168 TOP_LEVEL is nonzero if this variable has file scope.
1169 AT_END is nonzero if this is the special handling, at end of compilation,
1170 to define things that have had only tentative definitions.
1171 DONT_OUTPUT_DATA if nonzero means don't actually output the
1172 initial value (that will be done by the caller). */
1175 assemble_variable (decl
, top_level
, at_end
, dont_output_data
)
1179 int dont_output_data
;
1181 register char *name
;
1185 enum in_section saved_in_section
;
1187 last_assemble_variable_decl
= 0;
1189 if (output_bytecode
)
1192 if (GET_CODE (DECL_RTL (decl
)) == REG
)
1194 /* Do output symbol info for global register variables, but do nothing
1197 if (TREE_ASM_WRITTEN (decl
))
1199 TREE_ASM_WRITTEN (decl
) = 1;
1201 if (!output_bytecode
)
1203 #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
1204 /* File-scope global variables are output here. */
1205 if ((write_symbols
== DBX_DEBUG
|| write_symbols
== XCOFF_DEBUG
)
1207 dbxout_symbol (decl
, 0);
1209 #ifdef SDB_DEBUGGING_INFO
1210 if (write_symbols
== SDB_DEBUG
&& top_level
1211 /* Leave initialized global vars for end of compilation;
1212 see comment in compile_file. */
1213 && (TREE_PUBLIC (decl
) == 0 || DECL_INITIAL (decl
) == 0))
1214 sdbout_symbol (decl
, 0);
1218 /* Don't output any DWARF debugging information for variables here.
1219 In the case of local variables, the information for them is output
1220 when we do our recursive traversal of the tree representation for
1221 the entire containing function. In the case of file-scope variables,
1222 we output information for all of them at the very end of compilation
1223 while we are doing our final traversal of the chain of file-scope
1229 /* Normally no need to say anything here for external references,
1230 since assemble_external is called by the language-specific code
1231 when a declaration is first seen. */
1233 if (DECL_EXTERNAL (decl
))
1236 /* Output no assembler code for a function declaration.
1237 Only definitions of functions output anything. */
1239 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1242 /* If type was incomplete when the variable was declared,
1243 see if it is complete now. */
1245 if (DECL_SIZE (decl
) == 0)
1246 layout_decl (decl
, 0);
1248 /* Still incomplete => don't allocate it; treat the tentative defn
1249 (which is what it must have been) as an `extern' reference. */
1251 if (!dont_output_data
&& DECL_SIZE (decl
) == 0)
1253 error_with_file_and_line (DECL_SOURCE_FILE (decl
),
1254 DECL_SOURCE_LINE (decl
),
1255 "storage size of `%s' isn't known",
1256 IDENTIFIER_POINTER (DECL_NAME (decl
)));
1257 TREE_ASM_WRITTEN (decl
) = 1;
1261 /* The first declaration of a variable that comes through this function
1262 decides whether it is global (in C, has external linkage)
1263 or local (in C, has internal linkage). So do nothing more
1264 if this function has already run. */
1266 if (TREE_ASM_WRITTEN (decl
))
1269 TREE_ASM_WRITTEN (decl
) = 1;
1273 if (! dont_output_data
)
1277 if (TREE_CODE (DECL_SIZE (decl
)) != INTEGER_CST
)
1280 /* This is better than explicit arithmetic, since it avoids overflow. */
1281 size_tree
= size_binop (CEIL_DIV_EXPR
,
1282 DECL_SIZE (decl
), size_int (BITS_PER_UNIT
));
1284 size
= TREE_INT_CST_LOW (size_tree
);
1285 if (TREE_INT_CST_HIGH (size_tree
) != 0
1286 || size
!= TREE_INT_CST_LOW (size_tree
))
1288 error_with_decl (decl
, "size of variable `%s' is too large");
1293 name
= XSTR (XEXP (DECL_RTL (decl
), 0), 0);
1295 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
)
1296 && ! first_global_object_name
1297 && ! (DECL_COMMON (decl
) && (DECL_INITIAL (decl
) == 0
1298 || DECL_INITIAL (decl
) == error_mark_node
))
1299 && ! DECL_WEAK (decl
)
1300 && ! DECL_ONE_ONLY (decl
))
1304 STRIP_NAME_ENCODING (p
, name
);
1305 first_global_object_name
= permalloc (strlen (p
) + 1);
1306 strcpy (first_global_object_name
, p
);
1309 /* Handle uninitialized definitions. */
1311 if ((DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
)
1312 /* If the target can't output uninitialized but not common global data
1313 in .bss, then we have to use .data. */
1314 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
1315 && DECL_COMMON (decl
)
1317 && ! dont_output_data
)
1319 int size
= TREE_INT_CST_LOW (size_tree
);
1322 /* Don't allocate zero bytes of common,
1323 since that means "undefined external" in the linker. */
1324 if (size
== 0) rounded
= 1;
1325 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1326 so that each uninitialized object starts on such a boundary. */
1327 rounded
+= (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1;
1328 rounded
= (rounded
/ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1329 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1331 #ifdef DBX_DEBUGGING_INFO
1332 /* File-scope global variables are output here. */
1333 if (write_symbols
== DBX_DEBUG
&& top_level
)
1334 dbxout_symbol (decl
, 0);
1336 #ifdef SDB_DEBUGGING_INFO
1337 if (write_symbols
== SDB_DEBUG
&& top_level
1338 /* Leave initialized global vars for end of compilation;
1339 see comment in compile_file. */
1340 && (TREE_PUBLIC (decl
) == 0 || DECL_INITIAL (decl
) == 0))
1341 sdbout_symbol (decl
, 0);
1344 /* Don't output any DWARF debugging information for variables here.
1345 In the case of local variables, the information for them is output
1346 when we do our recursive traversal of the tree representation for
1347 the entire containing function. In the case of file-scope variables,
1348 we output information for all of them at the very end of compilation
1349 while we are doing our final traversal of the chain of file-scope
1352 #if 0 /* ??? We should either delete this or add a comment describing what
1353 it was intended to do and why we shouldn't delete it. */
1354 if (flag_shared_data
)
1358 if (TREE_PUBLIC (decl
)
1359 #if defined (ASM_OUTPUT_BSS) || defined (ASM_OUTPUT_ALIGNED_BSS)
1360 && DECL_COMMON (decl
)
1364 #ifdef ASM_OUTPUT_SHARED_COMMON
1365 if (flag_shared_data
)
1366 ASM_OUTPUT_SHARED_COMMON (asm_out_file
, name
, size
, rounded
);
1369 if (output_bytecode
)
1371 BC_OUTPUT_COMMON (asm_out_file
, name
, size
, rounded
);
1375 #ifdef ASM_OUTPUT_ALIGNED_COMMON
1376 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file
, name
, size
,
1379 ASM_OUTPUT_COMMON (asm_out_file
, name
, size
, rounded
);
1383 #if defined (ASM_OUTPUT_BSS) || defined (ASM_OUTPUT_ALIGNED_BSS)
1384 else if (TREE_PUBLIC (decl
))
1386 #ifdef ASM_OUTPUT_SHARED_BSS
1387 if (flag_shared_data
)
1388 ASM_OUTPUT_SHARED_BSS (asm_out_file
, decl
, name
, size
, rounded
);
1391 if (output_bytecode
)
1393 BC_OUTPUT_BSS (asm_out_file
, name
, size
, rounded
);
1397 #ifdef ASM_OUTPUT_ALIGNED_BSS
1398 ASM_OUTPUT_ALIGNED_BSS (asm_out_file
, decl
, name
, size
,
1401 ASM_OUTPUT_BSS (asm_out_file
, decl
, name
, size
, rounded
);
1405 #endif /* ASM_OUTPUT_BSS || ASM_OUTPUT_ALIGNED_BSS */
1408 #ifdef ASM_OUTPUT_SHARED_LOCAL
1409 if (flag_shared_data
)
1410 ASM_OUTPUT_SHARED_LOCAL (asm_out_file
, name
, size
, rounded
);
1413 if (output_bytecode
)
1415 BC_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
1419 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1420 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file
, name
, size
,
1423 ASM_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
1430 /* Handle initialized definitions.
1431 Also handle uninitialized global definitions if -fno-common and the
1432 target doesn't support ASM_OUTPUT_BSS. */
1434 /* First make the assembler name(s) global if appropriate. */
1435 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
))
1437 #ifdef ASM_WEAKEN_LABEL
1438 if (DECL_WEAK (decl
))
1439 ASM_WEAKEN_LABEL (asm_out_file
, name
);
1442 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
1445 for (d
= equivalents
; d
; d
= TREE_CHAIN (d
))
1447 tree e
= TREE_VALUE (d
);
1448 if (TREE_PUBLIC (e
) && DECL_NAME (e
))
1449 ASM_GLOBALIZE_LABEL (asm_out_file
,
1450 XSTR (XEXP (DECL_RTL (e
), 0), 0));
1454 /* Output any data that we will need to use the address of. */
1455 if (DECL_INITIAL (decl
) == error_mark_node
)
1456 reloc
= contains_pointers_p (TREE_TYPE (decl
));
1457 else if (DECL_INITIAL (decl
))
1458 reloc
= output_addressed_constants (DECL_INITIAL (decl
));
1460 #ifdef ASM_OUTPUT_SECTION_NAME
1461 if (UNIQUE_SECTION_P (decl
))
1462 UNIQUE_SECTION (decl
, reloc
);
1465 /* Switch to the appropriate section. */
1466 variable_section (decl
, reloc
);
1468 /* dbxout.c needs to know this. */
1469 if (in_text_section ())
1470 DECL_IN_TEXT_SECTION (decl
) = 1;
1472 /* Record current section so we can restore it if dbxout.c clobbers it. */
1473 saved_in_section
= in_section
;
1475 /* Output the dbx info now that we have chosen the section. */
1477 #ifdef DBX_DEBUGGING_INFO
1478 /* File-scope global variables are output here. */
1479 if (write_symbols
== DBX_DEBUG
&& top_level
)
1480 dbxout_symbol (decl
, 0);
1482 #ifdef SDB_DEBUGGING_INFO
1483 if (write_symbols
== SDB_DEBUG
&& top_level
1484 /* Leave initialized global vars for end of compilation;
1485 see comment in compile_file. */
1486 && (TREE_PUBLIC (decl
) == 0 || DECL_INITIAL (decl
) == 0))
1487 sdbout_symbol (decl
, 0);
1490 /* Don't output any DWARF debugging information for variables here.
1491 In the case of local variables, the information for them is output
1492 when we do our recursive traversal of the tree representation for
1493 the entire containing function. In the case of file-scope variables,
1494 we output information for all of them at the very end of compilation
1495 while we are doing our final traversal of the chain of file-scope
1498 /* If the debugging output changed sections, reselect the section
1499 that's supposed to be selected. */
1500 if (in_section
!= saved_in_section
)
1501 variable_section (decl
, reloc
);
1503 /* Compute and output the alignment of this data. */
1505 align
= DECL_ALIGN (decl
);
1506 /* In the case for initialing an array whose length isn't specified,
1507 where we have not yet been able to do the layout,
1508 figure out the proper alignment now. */
1509 if (dont_output_data
&& DECL_SIZE (decl
) == 0
1510 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
)
1511 align
= MAX (align
, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl
))));
1513 /* Some object file formats have a maximum alignment which they support.
1514 In particular, a.out format supports a maximum alignment of 4. */
1515 #ifndef MAX_OFILE_ALIGNMENT
1516 #define MAX_OFILE_ALIGNMENT BIGGEST_ALIGNMENT
1518 if (align
> MAX_OFILE_ALIGNMENT
)
1520 warning_with_decl (decl
,
1521 "alignment of `%s' is greater than maximum object file alignment");
1522 align
= MAX_OFILE_ALIGNMENT
;
1524 #ifdef DATA_ALIGNMENT
1525 /* On some machines, it is good to increase alignment sometimes. */
1526 align
= DATA_ALIGNMENT (TREE_TYPE (decl
), align
);
1528 #ifdef CONSTANT_ALIGNMENT
1529 if (DECL_INITIAL (decl
))
1530 align
= CONSTANT_ALIGNMENT (DECL_INITIAL (decl
), align
);
1533 /* Reset the alignment in case we have made it tighter, so we can benefit
1534 from it in get_pointer_alignment. */
1535 DECL_ALIGN (decl
) = align
;
1537 if (align
> BITS_PER_UNIT
)
1539 if (output_bytecode
)
1540 BC_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
1542 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
1545 /* Do any machine/system dependent processing of the object. */
1546 if (output_bytecode
)
1547 BC_OUTPUT_LABEL (asm_out_file
, name
);
1550 #ifdef ASM_DECLARE_OBJECT_NAME
1551 last_assemble_variable_decl
= decl
;
1552 ASM_DECLARE_OBJECT_NAME (asm_out_file
, name
, decl
);
1554 /* Standard thing is just output label for the object. */
1555 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1556 #endif /* ASM_DECLARE_OBJECT_NAME */
1559 if (!dont_output_data
)
1561 if (DECL_INITIAL (decl
))
1562 /* Output the actual data. */
1563 output_constant (DECL_INITIAL (decl
), TREE_INT_CST_LOW (size_tree
));
1565 /* Leave space for it. */
1566 assemble_zeros (TREE_INT_CST_LOW (size_tree
));
1570 #ifdef XCOFF_DEBUGGING_INFO
1571 /* Unfortunately, the IBM assembler cannot handle stabx before the actual
1572 declaration. When something like ".stabx "aa:S-2",aa,133,0" is emitted
1573 and `aa' hasn't been output yet, the assembler generates a stab entry with
1574 a value of zero, in addition to creating an unnecessary external entry
1575 for `aa'. Hence, we must postpone dbxout_symbol to here at the end. */
1577 /* File-scope global variables are output here. */
1578 if (write_symbols
== XCOFF_DEBUG
&& top_level
)
1580 saved_in_section
= in_section
;
1582 dbxout_symbol (decl
, 0);
1584 if (in_section
!= saved_in_section
)
1585 variable_section (decl
, reloc
);
1588 /* There must be a statement after a label. */
1593 /* Return 1 if type TYPE contains any pointers. */
1596 contains_pointers_p (type
)
1599 switch (TREE_CODE (type
))
1602 case REFERENCE_TYPE
:
1603 /* I'm not sure whether OFFSET_TYPE needs this treatment,
1604 so I'll play safe and return 1. */
1610 case QUAL_UNION_TYPE
:
1613 /* For a type that has fields, see if the fields have pointers. */
1614 for (fields
= TYPE_FIELDS (type
); fields
; fields
= TREE_CHAIN (fields
))
1615 if (TREE_CODE (fields
) == FIELD_DECL
1616 && contains_pointers_p (TREE_TYPE (fields
)))
1622 /* An array type contains pointers if its element type does. */
1623 return contains_pointers_p (TREE_TYPE (type
));
1630 /* Output text storage for constructor CONSTR. */
1633 bc_output_constructor (constr
, size
)
1639 /* Must always be a literal; non-literal constructors are handled
1642 if (!TREE_CONSTANT (constr
))
1649 for (i
= 0; TYPE_ALIGN (constr
) >= BITS_PER_UNIT
<< (i
+ 1); i
++)
1653 BC_OUTPUT_ALIGN (asm_out_file
, i
);
1656 output_constant (constr
, size
);
1659 /* Create storage for constructor CONSTR. */
1662 bc_output_data_constructor (constr
)
1667 /* Put in data section */
1671 for (i
= 0; TYPE_ALIGN (constr
) >= BITS_PER_UNIT
<< (i
+ 1); i
++);
1673 BC_OUTPUT_ALIGN (asm_out_file
, i
);
1675 /* The constructor is filled in at runtime. */
1676 BC_OUTPUT_SKIP (asm_out_file
, int_size_in_bytes (TREE_TYPE (constr
)));
1679 /* Output something to declare an external symbol to the assembler.
1680 (Most assemblers don't need this, so we normally output nothing.)
1681 Do nothing if DECL is not external. */
1684 assemble_external (decl
)
1687 if (output_bytecode
)
1690 #ifdef ASM_OUTPUT_EXTERNAL
1691 if (TREE_CODE_CLASS (TREE_CODE (decl
)) == 'd'
1692 && DECL_EXTERNAL (decl
) && TREE_PUBLIC (decl
))
1694 rtx rtl
= DECL_RTL (decl
);
1696 if (GET_CODE (rtl
) == MEM
&& GET_CODE (XEXP (rtl
, 0)) == SYMBOL_REF
1697 && ! SYMBOL_REF_USED (XEXP (rtl
, 0)))
1699 /* Some systems do require some output. */
1700 SYMBOL_REF_USED (XEXP (rtl
, 0)) = 1;
1701 ASM_OUTPUT_EXTERNAL (asm_out_file
, decl
, XSTR (XEXP (rtl
, 0), 0));
1707 /* Similar, for calling a library function FUN. */
1710 assemble_external_libcall (fun
)
1713 #ifdef ASM_OUTPUT_EXTERNAL_LIBCALL
1714 if (!output_bytecode
)
1716 /* Declare library function name external when first used, if nec. */
1717 if (! SYMBOL_REF_USED (fun
))
1719 SYMBOL_REF_USED (fun
) = 1;
1720 ASM_OUTPUT_EXTERNAL_LIBCALL (asm_out_file
, fun
);
1726 /* Declare the label NAME global. */
1729 assemble_global (name
)
1732 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
1735 /* Assemble a label named NAME. */
1738 assemble_label (name
)
1741 if (output_bytecode
)
1742 BC_OUTPUT_LABEL (asm_out_file
, name
);
1744 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1747 /* Output to FILE a reference to the assembler name of a C-level name NAME.
1748 If NAME starts with a *, the rest of NAME is output verbatim.
1749 Otherwise NAME is transformed in an implementation-defined way
1750 (usually by the addition of an underscore).
1751 Many macros in the tm file are defined to call this function. */
1754 assemble_name (file
, name
)
1761 STRIP_NAME_ENCODING (real_name
, name
);
1763 id
= maybe_get_identifier (real_name
);
1765 TREE_SYMBOL_REFERENCED (id
) = 1;
1769 if (output_bytecode
)
1770 bc_emit_labelref (name
, 0);
1772 fputs (&name
[1], file
);
1776 if (output_bytecode
)
1777 BC_OUTPUT_LABELREF (file
, name
);
1779 ASM_OUTPUT_LABELREF (file
, name
);
1783 /* Allocate SIZE bytes writable static space with a gensym name
1784 and return an RTX to refer to its address. */
1787 assemble_static_space (size
)
1793 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1794 so that each uninitialized object starts on such a boundary. */
1795 int rounded
= ((size
+ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1)
1796 / (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1797 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1800 if (flag_shared_data
)
1804 ASM_GENERATE_INTERNAL_LABEL (name
, "LF", const_labelno
);
1807 namestring
= (char *) obstack_alloc (saveable_obstack
,
1809 strcpy (namestring
, name
);
1811 if (output_bytecode
)
1812 x
= bc_gen_rtx (namestring
, 0, (struct bc_label
*) 0);
1814 x
= gen_rtx (SYMBOL_REF
, Pmode
, namestring
);
1816 if (output_bytecode
)
1818 BC_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
1822 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1823 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file
, name
, size
, BIGGEST_ALIGNMENT
);
1825 ASM_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
1831 /* Assemble the static constant template for function entry trampolines.
1832 This is done at most once per compilation.
1833 Returns an RTX for the address of the template. */
1835 #ifdef TRAMPOLINE_TEMPLATE
1837 assemble_trampoline_template ()
1843 /* Shouldn't get here */
1844 if (output_bytecode
)
1847 /* By default, put trampoline templates in read-only data section. */
1849 #ifdef TRAMPOLINE_SECTION
1850 TRAMPOLINE_SECTION ();
1852 readonly_data_section ();
1855 /* Write the assembler code to define one. */
1856 align
= floor_log2 (TRAMPOLINE_ALIGNMENT
/ BITS_PER_UNIT
);
1858 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1860 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LTRAMP", 0);
1861 TRAMPOLINE_TEMPLATE (asm_out_file
);
1863 /* Record the rtl to refer to it. */
1864 ASM_GENERATE_INTERNAL_LABEL (label
, "LTRAMP", 0);
1866 = (char *) obstack_copy0 (&permanent_obstack
, label
, strlen (label
));
1867 return gen_rtx (SYMBOL_REF
, Pmode
, name
);
1871 /* Assemble the integer constant X into an object of SIZE bytes.
1872 X must be either a CONST_INT or CONST_DOUBLE.
1874 Return 1 if we were able to output the constant, otherwise 0. If FORCE is
1875 non-zero, abort if we can't output the constant. */
1878 assemble_integer (x
, size
, force
)
1883 /* First try to use the standard 1, 2, 4, 8, and 16 byte
1884 ASM_OUTPUT... macros. */
1888 #ifdef ASM_OUTPUT_CHAR
1890 ASM_OUTPUT_CHAR (asm_out_file
, x
);
1894 #ifdef ASM_OUTPUT_SHORT
1896 ASM_OUTPUT_SHORT (asm_out_file
, x
);
1900 #ifdef ASM_OUTPUT_INT
1902 ASM_OUTPUT_INT (asm_out_file
, x
);
1906 #ifdef ASM_OUTPUT_DOUBLE_INT
1908 ASM_OUTPUT_DOUBLE_INT (asm_out_file
, x
);
1912 #ifdef ASM_OUTPUT_QUADRUPLE_INT
1914 ASM_OUTPUT_QUADRUPLE_INT (asm_out_file
, x
);
1919 /* If we couldn't do it that way, there are two other possibilities: First,
1920 if the machine can output an explicit byte and this is a 1 byte constant,
1921 we can use ASM_OUTPUT_BYTE. */
1923 #ifdef ASM_OUTPUT_BYTE
1924 if (size
== 1 && GET_CODE (x
) == CONST_INT
)
1926 ASM_OUTPUT_BYTE (asm_out_file
, INTVAL (x
));
1931 /* Finally, if SIZE is larger than a single word, try to output the constant
1932 one word at a time. */
1934 if (size
> UNITS_PER_WORD
)
1937 enum machine_mode mode
1938 = mode_for_size (size
* BITS_PER_UNIT
, MODE_INT
, 0);
1941 for (i
= 0; i
< size
/ UNITS_PER_WORD
; i
++)
1943 word
= operand_subword (x
, i
, 0, mode
);
1948 if (! assemble_integer (word
, UNITS_PER_WORD
, 0))
1952 if (i
== size
/ UNITS_PER_WORD
)
1954 /* If we output at least one word and then could not finish,
1955 there is no valid way to continue. */
1966 /* Assemble the floating-point constant D into an object of size MODE. */
1969 assemble_real (d
, mode
)
1971 enum machine_mode mode
;
1973 jmp_buf output_constant_handler
;
1975 if (setjmp (output_constant_handler
))
1977 error ("floating point trap outputting a constant");
1978 #ifdef REAL_IS_NOT_DOUBLE
1979 bzero ((char *) &d
, sizeof d
);
1986 set_float_handler (output_constant_handler
);
1990 #ifdef ASM_OUTPUT_BYTE_FLOAT
1992 ASM_OUTPUT_BYTE_FLOAT (asm_out_file
, d
);
1995 #ifdef ASM_OUTPUT_SHORT_FLOAT
1997 ASM_OUTPUT_SHORT_FLOAT (asm_out_file
, d
);
2000 #ifdef ASM_OUTPUT_THREE_QUARTER_FLOAT
2002 ASM_OUTPUT_THREE_QUARTER_FLOAT (asm_out_file
, d
);
2005 #ifdef ASM_OUTPUT_FLOAT
2007 ASM_OUTPUT_FLOAT (asm_out_file
, d
);
2011 #ifdef ASM_OUTPUT_DOUBLE
2013 ASM_OUTPUT_DOUBLE (asm_out_file
, d
);
2017 #ifdef ASM_OUTPUT_LONG_DOUBLE
2020 ASM_OUTPUT_LONG_DOUBLE (asm_out_file
, d
);
2028 set_float_handler (NULL_PTR
);
2031 /* Here we combine duplicate floating constants to make
2032 CONST_DOUBLE rtx's, and force those out to memory when necessary. */
2034 /* Chain of all CONST_DOUBLE rtx's constructed for the current function.
2035 They are chained through the CONST_DOUBLE_CHAIN.
2036 A CONST_DOUBLE rtx has CONST_DOUBLE_MEM != cc0_rtx iff it is on this chain.
2037 In that case, CONST_DOUBLE_MEM is either a MEM,
2038 or const0_rtx if no MEM has been made for this CONST_DOUBLE yet.
2040 (CONST_DOUBLE_MEM is used only for top-level functions.
2041 See force_const_mem for explanation.) */
2043 static rtx const_double_chain
;
2045 /* Return a CONST_DOUBLE or CONST_INT for a value specified as a pair of ints.
2046 For an integer, I0 is the low-order word and I1 is the high-order word.
2047 For a real number, I0 is the word with the low address
2048 and I1 is the word with the high address. */
2051 immed_double_const (i0
, i1
, mode
)
2052 HOST_WIDE_INT i0
, i1
;
2053 enum machine_mode mode
;
2056 int in_current_obstack
;
2058 if (GET_MODE_CLASS (mode
) == MODE_INT
2059 || GET_MODE_CLASS (mode
) == MODE_PARTIAL_INT
)
2061 /* We clear out all bits that don't belong in MODE, unless they and our
2062 sign bit are all one. So we get either a reasonable negative value
2063 or a reasonable unsigned value for this mode. */
2064 int width
= GET_MODE_BITSIZE (mode
);
2065 if (width
< HOST_BITS_PER_WIDE_INT
2066 && ((i0
& ((HOST_WIDE_INT
) (-1) << (width
- 1)))
2067 != ((HOST_WIDE_INT
) (-1) << (width
- 1))))
2068 i0
&= ((HOST_WIDE_INT
) 1 << width
) - 1, i1
= 0;
2069 else if (width
== HOST_BITS_PER_WIDE_INT
2070 && ! (i1
== ~0 && i0
< 0))
2072 else if (width
> 2 * HOST_BITS_PER_WIDE_INT
)
2073 /* We cannot represent this value as a constant. */
2076 /* If this would be an entire word for the target, but is not for
2077 the host, then sign-extend on the host so that the number will look
2078 the same way on the host that it would on the target.
2080 For example, when building a 64 bit alpha hosted 32 bit sparc
2081 targeted compiler, then we want the 32 bit unsigned value -1 to be
2082 represented as a 64 bit value -1, and not as 0x00000000ffffffff.
2083 The later confuses the sparc backend. */
2085 if (BITS_PER_WORD
< HOST_BITS_PER_WIDE_INT
&& BITS_PER_WORD
== width
2086 && (i0
& ((HOST_WIDE_INT
) 1 << (width
- 1))))
2087 i0
|= ((HOST_WIDE_INT
) (-1) << width
);
2089 /* If MODE fits within HOST_BITS_PER_WIDE_INT, always use a CONST_INT.
2091 ??? Strictly speaking, this is wrong if we create a CONST_INT
2092 for a large unsigned constant with the size of MODE being
2093 HOST_BITS_PER_WIDE_INT and later try to interpret that constant in a
2094 wider mode. In that case we will mis-interpret it as a negative
2097 Unfortunately, the only alternative is to make a CONST_DOUBLE
2098 for any constant in any mode if it is an unsigned constant larger
2099 than the maximum signed integer in an int on the host. However,
2100 doing this will break everyone that always expects to see a CONST_INT
2101 for SImode and smaller.
2103 We have always been making CONST_INTs in this case, so nothing new
2106 if (width
<= HOST_BITS_PER_WIDE_INT
)
2107 i1
= (i0
< 0) ? ~0 : 0;
2109 /* If this integer fits in one word, return a CONST_INT. */
2110 if ((i1
== 0 && i0
>= 0)
2111 || (i1
== ~0 && i0
< 0))
2112 return GEN_INT (i0
);
2114 /* We use VOIDmode for integers. */
2118 /* Search the chain for an existing CONST_DOUBLE with the right value.
2119 If one is found, return it. */
2121 for (r
= const_double_chain
; r
; r
= CONST_DOUBLE_CHAIN (r
))
2122 if (CONST_DOUBLE_LOW (r
) == i0
&& CONST_DOUBLE_HIGH (r
) == i1
2123 && GET_MODE (r
) == mode
)
2126 /* No; make a new one and add it to the chain.
2128 We may be called by an optimizer which may be discarding any memory
2129 allocated during its processing (such as combine and loop). However,
2130 we will be leaving this constant on the chain, so we cannot tolerate
2131 freed memory. So switch to saveable_obstack for this allocation
2132 and then switch back if we were in current_obstack. */
2134 push_obstacks_nochange ();
2135 rtl_in_saveable_obstack ();
2136 r
= gen_rtx (CONST_DOUBLE
, mode
, 0, i0
, i1
);
2139 /* Don't touch const_double_chain in nested function; see force_const_mem.
2140 Also, don't touch it if not inside any function. */
2141 if (outer_function_chain
== 0 && current_function_decl
!= 0)
2143 CONST_DOUBLE_CHAIN (r
) = const_double_chain
;
2144 const_double_chain
= r
;
2147 /* Store const0_rtx in mem-slot since this CONST_DOUBLE is on the chain.
2148 Actual use of mem-slot is only through force_const_mem. */
2150 CONST_DOUBLE_MEM (r
) = const0_rtx
;
2155 /* Return a CONST_DOUBLE for a specified `double' value
2156 and machine mode. */
2159 immed_real_const_1 (d
, mode
)
2161 enum machine_mode mode
;
2163 union real_extract u
;
2165 int in_current_obstack
;
2167 /* Get the desired `double' value as a sequence of ints
2168 since that is how they are stored in a CONST_DOUBLE. */
2172 /* Detect special cases. */
2174 /* Avoid REAL_VALUES_EQUAL here in order to distinguish minus zero. */
2175 if (!bcmp ((char *) &dconst0
, (char *) &d
, sizeof d
))
2176 return CONST0_RTX (mode
);
2177 /* Check for NaN first, because some ports (specifically the i386) do not
2178 emit correct ieee-fp code by default, and thus will generate a core
2179 dump here if we pass a NaN to REAL_VALUES_EQUAL and if REAL_VALUES_EQUAL
2180 does a floating point comparison. */
2181 else if (! REAL_VALUE_ISNAN (d
) && REAL_VALUES_EQUAL (dconst1
, d
))
2182 return CONST1_RTX (mode
);
2184 if (sizeof u
== 2 * sizeof (HOST_WIDE_INT
))
2185 return immed_double_const (u
.i
[0], u
.i
[1], mode
);
2187 /* The rest of this function handles the case where
2188 a float value requires more than 2 ints of space.
2189 It will be deleted as dead code on machines that don't need it. */
2191 /* Search the chain for an existing CONST_DOUBLE with the right value.
2192 If one is found, return it. */
2194 for (r
= const_double_chain
; r
; r
= CONST_DOUBLE_CHAIN (r
))
2195 if (! bcmp ((char *) &CONST_DOUBLE_LOW (r
), (char *) &u
, sizeof u
)
2196 && GET_MODE (r
) == mode
)
2199 /* No; make a new one and add it to the chain.
2201 We may be called by an optimizer which may be discarding any memory
2202 allocated during its processing (such as combine and loop). However,
2203 we will be leaving this constant on the chain, so we cannot tolerate
2204 freed memory. So switch to saveable_obstack for this allocation
2205 and then switch back if we were in current_obstack. */
2207 push_obstacks_nochange ();
2208 rtl_in_saveable_obstack ();
2209 r
= rtx_alloc (CONST_DOUBLE
);
2211 bcopy ((char *) &u
, (char *) &CONST_DOUBLE_LOW (r
), sizeof u
);
2214 /* Don't touch const_double_chain in nested function; see force_const_mem.
2215 Also, don't touch it if not inside any function. */
2216 if (outer_function_chain
== 0 && current_function_decl
!= 0)
2218 CONST_DOUBLE_CHAIN (r
) = const_double_chain
;
2219 const_double_chain
= r
;
2222 /* Store const0_rtx in CONST_DOUBLE_MEM since this CONST_DOUBLE is on the
2223 chain, but has not been allocated memory. Actual use of CONST_DOUBLE_MEM
2224 is only through force_const_mem. */
2226 CONST_DOUBLE_MEM (r
) = const0_rtx
;
2231 /* Return a CONST_DOUBLE rtx for a value specified by EXP,
2232 which must be a REAL_CST tree node. */
2235 immed_real_const (exp
)
2238 return immed_real_const_1 (TREE_REAL_CST (exp
), TYPE_MODE (TREE_TYPE (exp
)));
2241 /* At the end of a function, forget the memory-constants
2242 previously made for CONST_DOUBLEs. Mark them as not on real_constant_chain.
2243 Also clear out real_constant_chain and clear out all the chain-pointers. */
2246 clear_const_double_mem ()
2248 register rtx r
, next
;
2250 /* Don't touch CONST_DOUBLE_MEM for nested functions.
2251 See force_const_mem for explanation. */
2252 if (outer_function_chain
!= 0)
2255 for (r
= const_double_chain
; r
; r
= next
)
2257 next
= CONST_DOUBLE_CHAIN (r
);
2258 CONST_DOUBLE_CHAIN (r
) = 0;
2259 CONST_DOUBLE_MEM (r
) = cc0_rtx
;
2261 const_double_chain
= 0;
2264 /* Given an expression EXP with a constant value,
2265 reduce it to the sum of an assembler symbol and an integer.
2266 Store them both in the structure *VALUE.
2267 Abort if EXP does not reduce. */
2272 HOST_WIDE_INT offset
;
2276 decode_addr_const (exp
, value
)
2278 struct addr_const
*value
;
2280 register tree target
= TREE_OPERAND (exp
, 0);
2281 register int offset
= 0;
2286 if (TREE_CODE (target
) == COMPONENT_REF
2287 && (TREE_CODE (DECL_FIELD_BITPOS (TREE_OPERAND (target
, 1)))
2290 offset
+= TREE_INT_CST_LOW (DECL_FIELD_BITPOS (TREE_OPERAND (target
, 1))) / BITS_PER_UNIT
;
2291 target
= TREE_OPERAND (target
, 0);
2293 else if (TREE_CODE (target
) == ARRAY_REF
)
2295 if (TREE_CODE (TREE_OPERAND (target
, 1)) != INTEGER_CST
2296 || TREE_CODE (TYPE_SIZE (TREE_TYPE (target
))) != INTEGER_CST
)
2298 offset
+= ((TREE_INT_CST_LOW (TYPE_SIZE (TREE_TYPE (target
)))
2299 * TREE_INT_CST_LOW (TREE_OPERAND (target
, 1)))
2301 target
= TREE_OPERAND (target
, 0);
2307 switch (TREE_CODE (target
))
2311 x
= DECL_RTL (target
);
2315 if (output_bytecode
)
2316 /* FIXME: this may not be correct, check it */
2317 x
= bc_gen_rtx (TREE_STRING_POINTER (target
), 0, (struct bc_label
*) 0);
2319 x
= gen_rtx (MEM
, FUNCTION_MODE
,
2320 gen_rtx (LABEL_REF
, VOIDmode
,
2321 label_rtx (TREE_OPERAND (exp
, 0))));
2329 x
= TREE_CST_RTL (target
);
2336 if (!output_bytecode
)
2338 if (GET_CODE (x
) != MEM
)
2344 value
->offset
= offset
;
2347 /* Uniquize all constants that appear in memory.
2348 Each constant in memory thus far output is recorded
2349 in `const_hash_table' with a `struct constant_descriptor'
2350 that contains a polish representation of the value of
2353 We cannot store the trees in the hash table
2354 because the trees may be temporary. */
2356 struct constant_descriptor
2358 struct constant_descriptor
*next
;
2364 #define MAX_HASH_TABLE 1009
2365 static struct constant_descriptor
*const_hash_table
[MAX_HASH_TABLE
];
2367 /* Compute a hash code for a constant expression. */
2374 register int len
, hi
, i
;
2375 register enum tree_code code
= TREE_CODE (exp
);
2377 /* Either set P and LEN to the address and len of something to hash and
2378 exit the switch or return a value. */
2383 p
= (char *) &TREE_INT_CST_LOW (exp
);
2384 len
= 2 * sizeof TREE_INT_CST_LOW (exp
);
2388 p
= (char *) &TREE_REAL_CST (exp
);
2389 len
= sizeof TREE_REAL_CST (exp
);
2393 p
= TREE_STRING_POINTER (exp
);
2394 len
= TREE_STRING_LENGTH (exp
);
2398 return (const_hash (TREE_REALPART (exp
)) * 5
2399 + const_hash (TREE_IMAGPART (exp
)));
2402 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2404 len
= int_size_in_bytes (TREE_TYPE (exp
));
2405 p
= (char *) alloca (len
);
2406 get_set_constructor_bytes (exp
, (unsigned char *) p
, len
);
2413 /* For record type, include the type in the hashing.
2414 We do not do so for array types
2415 because (1) the sizes of the elements are sufficient
2416 and (2) distinct array types can have the same constructor.
2417 Instead, we include the array size because the constructor could
2419 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2420 hi
= ((HOST_WIDE_INT
) TREE_TYPE (exp
) & ((1 << HASHBITS
) - 1))
2423 hi
= ((5 + int_size_in_bytes (TREE_TYPE (exp
)))
2424 & ((1 << HASHBITS
) - 1)) % MAX_HASH_TABLE
;
2426 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2427 if (TREE_VALUE (link
))
2429 = (hi
* 603 + const_hash (TREE_VALUE (link
))) % MAX_HASH_TABLE
;
2436 struct addr_const value
;
2438 decode_addr_const (exp
, &value
);
2439 if (GET_CODE (value
.base
) == SYMBOL_REF
)
2441 /* Don't hash the address of the SYMBOL_REF;
2442 only use the offset and the symbol name. */
2444 p
= XSTR (value
.base
, 0);
2445 for (i
= 0; p
[i
] != 0; i
++)
2446 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2448 else if (GET_CODE (value
.base
) == LABEL_REF
)
2449 hi
= value
.offset
+ CODE_LABEL_NUMBER (XEXP (value
.base
, 0)) * 13;
2451 hi
&= (1 << HASHBITS
) - 1;
2452 hi
%= MAX_HASH_TABLE
;
2458 return (const_hash (TREE_OPERAND (exp
, 0)) * 9
2459 + const_hash (TREE_OPERAND (exp
, 1)));
2463 case NON_LVALUE_EXPR
:
2464 return const_hash (TREE_OPERAND (exp
, 0)) * 7 + 2;
2467 /* Compute hashing function */
2469 for (i
= 0; i
< len
; i
++)
2470 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2472 hi
&= (1 << HASHBITS
) - 1;
2473 hi
%= MAX_HASH_TABLE
;
2477 /* Compare a constant expression EXP with a constant-descriptor DESC.
2478 Return 1 if DESC describes a constant with the same value as EXP. */
2481 compare_constant (exp
, desc
)
2483 struct constant_descriptor
*desc
;
2485 return 0 != compare_constant_1 (exp
, desc
->contents
);
2488 /* Compare constant expression EXP with a substring P of a constant descriptor.
2489 If they match, return a pointer to the end of the substring matched.
2490 If they do not match, return 0.
2492 Since descriptors are written in polish prefix notation,
2493 this function can be used recursively to test one operand of EXP
2494 against a subdescriptor, and if it succeeds it returns the
2495 address of the subdescriptor for the next operand. */
2498 compare_constant_1 (exp
, p
)
2502 register char *strp
;
2504 register enum tree_code code
= TREE_CODE (exp
);
2506 if (code
!= (enum tree_code
) *p
++)
2509 /* Either set STRP, P and LEN to pointers and length to compare and exit the
2510 switch, or return the result of the comparison. */
2515 /* Integer constants are the same only if the same width of type. */
2516 if (*p
++ != TYPE_PRECISION (TREE_TYPE (exp
)))
2519 strp
= (char *) &TREE_INT_CST_LOW (exp
);
2520 len
= 2 * sizeof TREE_INT_CST_LOW (exp
);
2524 /* Real constants are the same only if the same width of type. */
2525 if (*p
++ != TYPE_PRECISION (TREE_TYPE (exp
)))
2528 strp
= (char *) &TREE_REAL_CST (exp
);
2529 len
= sizeof TREE_REAL_CST (exp
);
2533 if (flag_writable_strings
)
2536 strp
= TREE_STRING_POINTER (exp
);
2537 len
= TREE_STRING_LENGTH (exp
);
2538 if (bcmp ((char *) &TREE_STRING_LENGTH (exp
), p
,
2539 sizeof TREE_STRING_LENGTH (exp
)))
2542 p
+= sizeof TREE_STRING_LENGTH (exp
);
2546 p
= compare_constant_1 (TREE_REALPART (exp
), p
);
2550 return compare_constant_1 (TREE_IMAGPART (exp
), p
);
2553 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2555 int xlen
= len
= int_size_in_bytes (TREE_TYPE (exp
));
2557 strp
= (char *) alloca (len
);
2558 get_set_constructor_bytes (exp
, (unsigned char *) strp
, len
);
2559 if (bcmp ((char *) &xlen
, p
, sizeof xlen
))
2568 int length
= list_length (CONSTRUCTOR_ELTS (exp
));
2571 if (bcmp ((char *) &length
, p
, sizeof length
))
2576 /* For record constructors, insist that the types match.
2577 For arrays, just verify both constructors are for arrays. */
2578 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2579 type
= TREE_TYPE (exp
);
2583 if (bcmp ((char *) &type
, p
, sizeof type
))
2588 /* For arrays, insist that the size in bytes match. */
2589 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2591 int size
= int_size_in_bytes (TREE_TYPE (exp
));
2592 if (bcmp ((char *) &size
, p
, sizeof size
))
2598 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2600 if (TREE_VALUE (link
))
2602 if ((p
= compare_constant_1 (TREE_VALUE (link
), p
)) == 0)
2609 if (bcmp ((char *) &zero
, p
, sizeof zero
))
2621 struct addr_const value
;
2623 decode_addr_const (exp
, &value
);
2624 strp
= (char *) &value
.offset
;
2625 len
= sizeof value
.offset
;
2626 /* Compare the offset. */
2628 if (*p
++ != *strp
++)
2631 /* Compare symbol name. */
2632 strp
= XSTR (value
.base
, 0);
2633 len
= strlen (strp
) + 1;
2639 p
= compare_constant_1 (TREE_OPERAND (exp
, 0), p
);
2643 return compare_constant_1 (TREE_OPERAND (exp
, 1), p
);
2647 case NON_LVALUE_EXPR
:
2648 return compare_constant_1 (TREE_OPERAND (exp
, 0), p
);
2651 /* Compare constant contents. */
2653 if (*p
++ != *strp
++)
2659 /* Construct a constant descriptor for the expression EXP.
2660 It is up to the caller to enter the descriptor in the hash table. */
2662 static struct constant_descriptor
*
2663 record_constant (exp
)
2666 struct constant_descriptor
*next
= 0;
2669 /* Make a struct constant_descriptor. The first two pointers will
2670 be filled in later. Here we just leave space for them. */
2672 obstack_grow (&permanent_obstack
, (char *) &next
, sizeof next
);
2673 obstack_grow (&permanent_obstack
, (char *) &label
, sizeof label
);
2674 record_constant_1 (exp
);
2675 return (struct constant_descriptor
*) obstack_finish (&permanent_obstack
);
2678 /* Add a description of constant expression EXP
2679 to the object growing in `permanent_obstack'.
2680 No need to return its address; the caller will get that
2681 from the obstack when the object is complete. */
2684 record_constant_1 (exp
)
2687 register char *strp
;
2689 register enum tree_code code
= TREE_CODE (exp
);
2691 obstack_1grow (&permanent_obstack
, (unsigned int) code
);
2696 obstack_1grow (&permanent_obstack
, TYPE_PRECISION (TREE_TYPE (exp
)));
2697 strp
= (char *) &TREE_INT_CST_LOW (exp
);
2698 len
= 2 * sizeof TREE_INT_CST_LOW (exp
);
2702 obstack_1grow (&permanent_obstack
, TYPE_PRECISION (TREE_TYPE (exp
)));
2703 strp
= (char *) &TREE_REAL_CST (exp
);
2704 len
= sizeof TREE_REAL_CST (exp
);
2708 if (flag_writable_strings
)
2711 strp
= TREE_STRING_POINTER (exp
);
2712 len
= TREE_STRING_LENGTH (exp
);
2713 obstack_grow (&permanent_obstack
, (char *) &TREE_STRING_LENGTH (exp
),
2714 sizeof TREE_STRING_LENGTH (exp
));
2718 record_constant_1 (TREE_REALPART (exp
));
2719 record_constant_1 (TREE_IMAGPART (exp
));
2723 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2725 int nbytes
= int_size_in_bytes (TREE_TYPE (exp
));
2726 obstack_grow (&permanent_obstack
, &nbytes
, sizeof (nbytes
));
2727 obstack_blank (&permanent_obstack
, nbytes
);
2728 get_set_constructor_bytes
2729 (exp
, (unsigned char *) permanent_obstack
.next_free
-nbytes
,
2736 int length
= list_length (CONSTRUCTOR_ELTS (exp
));
2739 obstack_grow (&permanent_obstack
, (char *) &length
, sizeof length
);
2741 /* For record constructors, insist that the types match.
2742 For arrays, just verify both constructors are for arrays. */
2743 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2744 type
= TREE_TYPE (exp
);
2747 obstack_grow (&permanent_obstack
, (char *) &type
, sizeof type
);
2749 /* For arrays, insist that the size in bytes match. */
2750 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2752 int size
= int_size_in_bytes (TREE_TYPE (exp
));
2753 obstack_grow (&permanent_obstack
, (char *) &size
, sizeof size
);
2756 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2758 if (TREE_VALUE (link
))
2759 record_constant_1 (TREE_VALUE (link
));
2764 obstack_grow (&permanent_obstack
,
2765 (char *) &zero
, sizeof zero
);
2773 struct addr_const value
;
2775 decode_addr_const (exp
, &value
);
2776 /* Record the offset. */
2777 obstack_grow (&permanent_obstack
,
2778 (char *) &value
.offset
, sizeof value
.offset
);
2779 /* Record the symbol name. */
2780 obstack_grow (&permanent_obstack
, XSTR (value
.base
, 0),
2781 strlen (XSTR (value
.base
, 0)) + 1);
2787 record_constant_1 (TREE_OPERAND (exp
, 0));
2788 record_constant_1 (TREE_OPERAND (exp
, 1));
2793 case NON_LVALUE_EXPR
:
2794 record_constant_1 (TREE_OPERAND (exp
, 0));
2801 /* Record constant contents. */
2802 obstack_grow (&permanent_obstack
, strp
, len
);
2805 /* Record a list of constant expressions that were passed to
2806 output_constant_def but that could not be output right away. */
2808 struct deferred_constant
2810 struct deferred_constant
*next
;
2816 static struct deferred_constant
*deferred_constants
;
2818 /* Another list of constants which should be output after the
2820 static struct deferred_constant
*after_function_constants
;
2822 /* Nonzero means defer output of addressed subconstants
2823 (i.e., those for which output_constant_def is called.) */
2824 static int defer_addressed_constants_flag
;
2826 /* Start deferring output of subconstants. */
2829 defer_addressed_constants ()
2831 defer_addressed_constants_flag
++;
2834 /* Stop deferring output of subconstants,
2835 and output now all those that have been deferred. */
2838 output_deferred_addressed_constants ()
2840 struct deferred_constant
*p
, *next
;
2842 defer_addressed_constants_flag
--;
2844 if (defer_addressed_constants_flag
> 0)
2847 for (p
= deferred_constants
; p
; p
= next
)
2849 output_constant_def_contents (p
->exp
, p
->reloc
, p
->labelno
);
2854 deferred_constants
= 0;
2857 /* Output any constants which should appear after a function. */
2860 output_after_function_constants ()
2862 struct deferred_constant
*p
, *next
;
2864 for (p
= after_function_constants
; p
; p
= next
)
2866 output_constant_def_contents (p
->exp
, p
->reloc
, p
->labelno
);
2871 after_function_constants
= 0;
2874 /* Make a copy of the whole tree structure for a constant.
2875 This handles the same types of nodes that compare_constant
2876 and record_constant handle. */
2882 switch (TREE_CODE (exp
))
2885 /* For ADDR_EXPR, we do not want to copy the decl whose address
2886 is requested. We do want to copy constants though. */
2887 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, 0))) == 'c')
2888 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2889 copy_constant (TREE_OPERAND (exp
, 0)));
2891 return copy_node (exp
);
2896 return copy_node (exp
);
2899 return build_complex (TREE_TYPE (exp
),
2900 copy_constant (TREE_REALPART (exp
)),
2901 copy_constant (TREE_IMAGPART (exp
)));
2905 return build (TREE_CODE (exp
), TREE_TYPE (exp
),
2906 copy_constant (TREE_OPERAND (exp
, 0)),
2907 copy_constant (TREE_OPERAND (exp
, 1)));
2911 case NON_LVALUE_EXPR
:
2912 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2913 copy_constant (TREE_OPERAND (exp
, 0)));
2917 tree copy
= copy_node (exp
);
2918 tree list
= copy_list (CONSTRUCTOR_ELTS (exp
));
2921 CONSTRUCTOR_ELTS (copy
) = list
;
2922 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
2923 TREE_VALUE (tail
) = copy_constant (TREE_VALUE (tail
));
2924 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2925 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
2926 TREE_PURPOSE (tail
) = copy_constant (TREE_PURPOSE (tail
));
2936 /* Return an rtx representing a reference to constant data in memory
2937 for the constant expression EXP.
2939 If assembler code for such a constant has already been output,
2940 return an rtx to refer to it.
2941 Otherwise, output such a constant in memory (or defer it for later)
2942 and generate an rtx for it.
2944 The TREE_CST_RTL of EXP is set up to point to that rtx.
2945 The const_hash_table records which constants already have label strings. */
2948 output_constant_def (exp
)
2952 register struct constant_descriptor
*desc
;
2958 if (TREE_CST_RTL (exp
))
2959 return TREE_CST_RTL (exp
);
2961 /* Make sure any other constants whose addresses appear in EXP
2962 are assigned label numbers. */
2964 reloc
= output_addressed_constants (exp
);
2966 /* Compute hash code of EXP. Search the descriptors for that hash code
2967 to see if any of them describes EXP. If yes, the descriptor records
2968 the label number already assigned. */
2970 hash
= const_hash (exp
) % MAX_HASH_TABLE
;
2972 for (desc
= const_hash_table
[hash
]; desc
; desc
= desc
->next
)
2973 if (compare_constant (exp
, desc
))
2975 found
= desc
->label
;
2981 /* No constant equal to EXP is known to have been output.
2982 Make a constant descriptor to enter EXP in the hash table.
2983 Assign the label number and record it in the descriptor for
2984 future calls to this function to find. */
2986 /* Create a string containing the label name, in LABEL. */
2987 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
2989 desc
= record_constant (exp
);
2990 desc
->next
= const_hash_table
[hash
];
2992 = (char *) obstack_copy0 (&permanent_obstack
, label
, strlen (label
));
2993 const_hash_table
[hash
] = desc
;
2997 /* Create a string containing the label name, in LABEL. */
2998 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
3001 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
3003 push_obstacks_nochange ();
3004 if (TREE_PERMANENT (exp
))
3005 end_temporary_allocation ();
3007 def
= gen_rtx (SYMBOL_REF
, Pmode
, desc
->label
);
3010 = gen_rtx (MEM
, TYPE_MODE (TREE_TYPE (exp
)), def
);
3011 RTX_UNCHANGING_P (TREE_CST_RTL (exp
)) = 1;
3012 if (AGGREGATE_TYPE_P (TREE_TYPE (exp
)))
3013 MEM_IN_STRUCT_P (TREE_CST_RTL (exp
)) = 1;
3017 /* Optionally set flags or add text to the name to record information
3018 such as that it is a function name. If the name is changed, the macro
3019 ASM_OUTPUT_LABELREF will have to know how to strip this information. */
3020 #ifdef ENCODE_SECTION_INFO
3021 ENCODE_SECTION_INFO (exp
);
3024 /* If this is the first time we've seen this particular constant,
3025 output it (or defer its output for later). */
3028 int after_function
= 0;
3030 #ifdef CONSTANT_AFTER_FUNCTION_P
3031 if (current_function_decl
!= 0
3032 && CONSTANT_AFTER_FUNCTION_P (exp
))
3036 if (defer_addressed_constants_flag
|| after_function
)
3038 struct deferred_constant
*p
;
3039 p
= (struct deferred_constant
*) xmalloc (sizeof (struct deferred_constant
));
3041 push_obstacks_nochange ();
3042 suspend_momentary ();
3043 p
->exp
= copy_constant (exp
);
3046 p
->labelno
= const_labelno
++;
3049 p
->next
= after_function_constants
;
3050 after_function_constants
= p
;
3054 p
->next
= deferred_constants
;
3055 deferred_constants
= p
;
3059 output_constant_def_contents (exp
, reloc
, const_labelno
++);
3062 return TREE_CST_RTL (exp
);
3065 /* Now output assembler code to define the label for EXP,
3066 and follow it with the data of EXP. */
3069 output_constant_def_contents (exp
, reloc
, labelno
)
3076 if (IN_NAMED_SECTION (exp
))
3077 named_section (exp
, NULL
, reloc
);
3080 /* First switch to text section, except for writable strings. */
3081 #ifdef SELECT_SECTION
3082 SELECT_SECTION (exp
, reloc
);
3084 if (((TREE_CODE (exp
) == STRING_CST
) && flag_writable_strings
)
3085 || (flag_pic
&& reloc
))
3088 readonly_data_section ();
3092 /* Align the location counter as required by EXP's data type. */
3093 align
= TYPE_ALIGN (TREE_TYPE (exp
));
3094 #ifdef CONSTANT_ALIGNMENT
3095 align
= CONSTANT_ALIGNMENT (exp
, align
);
3098 if (align
> BITS_PER_UNIT
)
3100 if (!output_bytecode
)
3102 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
3106 BC_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
3110 /* Output the label itself. */
3111 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LC", labelno
);
3113 /* Output the value of EXP. */
3114 output_constant (exp
,
3115 (TREE_CODE (exp
) == STRING_CST
3116 ? TREE_STRING_LENGTH (exp
)
3117 : int_size_in_bytes (TREE_TYPE (exp
))));
3121 /* Similar hash facility for making memory-constants
3122 from constant rtl-expressions. It is used on RISC machines
3123 where immediate integer arguments and constant addresses are restricted
3124 so that such constants must be stored in memory.
3126 This pool of constants is reinitialized for each function
3127 so each function gets its own constants-pool that comes right before it.
3129 All structures allocated here are discarded when functions are saved for
3130 inlining, so they do not need to be allocated permanently. */
3132 #define MAX_RTX_HASH_TABLE 61
3133 static struct constant_descriptor
**const_rtx_hash_table
;
3135 /* Structure to represent sufficient information about a constant so that
3136 it can be output when the constant pool is output, so that function
3137 integration can be done, and to simplify handling on machines that reference
3138 constant pool as base+displacement. */
3140 struct pool_constant
3142 struct constant_descriptor
*desc
;
3143 struct pool_constant
*next
;
3144 enum machine_mode mode
;
3152 /* Pointers to first and last constant in pool. */
3154 static struct pool_constant
*first_pool
, *last_pool
;
3156 /* Current offset in constant pool (does not include any machine-specific
3159 static int pool_offset
;
3161 /* Structure used to maintain hash table mapping symbols used to their
3162 corresponding constants. */
3167 struct pool_constant
*pool
;
3168 struct pool_sym
*next
;
3171 static struct pool_sym
**const_rtx_sym_hash_table
;
3173 /* Hash code for a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true.
3174 The argument is XSTR (... , 0) */
3176 #define SYMHASH(LABEL) \
3177 ((((HOST_WIDE_INT) (LABEL)) & ((1 << HASHBITS) - 1)) % MAX_RTX_HASH_TABLE)
3179 /* Initialize constant pool hashing for next function. */
3182 init_const_rtx_hash_table ()
3184 const_rtx_hash_table
3185 = ((struct constant_descriptor
**)
3186 oballoc (MAX_RTX_HASH_TABLE
* sizeof (struct constant_descriptor
*)));
3187 const_rtx_sym_hash_table
3188 = ((struct pool_sym
**)
3189 oballoc (MAX_RTX_HASH_TABLE
* sizeof (struct pool_sym
*)));
3190 bzero ((char *) const_rtx_hash_table
,
3191 MAX_RTX_HASH_TABLE
* sizeof (struct constant_descriptor
*));
3192 bzero ((char *) const_rtx_sym_hash_table
,
3193 MAX_RTX_HASH_TABLE
* sizeof (struct pool_sym
*));
3195 first_pool
= last_pool
= 0;
3199 /* Save and restore status for a nested function. */
3202 save_varasm_status (p
)
3205 p
->const_rtx_hash_table
= const_rtx_hash_table
;
3206 p
->const_rtx_sym_hash_table
= const_rtx_sym_hash_table
;
3207 p
->first_pool
= first_pool
;
3208 p
->last_pool
= last_pool
;
3209 p
->pool_offset
= pool_offset
;
3213 restore_varasm_status (p
)
3216 const_rtx_hash_table
= p
->const_rtx_hash_table
;
3217 const_rtx_sym_hash_table
= p
->const_rtx_sym_hash_table
;
3218 first_pool
= p
->first_pool
;
3219 last_pool
= p
->last_pool
;
3220 pool_offset
= p
->pool_offset
;
3223 enum kind
{ RTX_DOUBLE
, RTX_INT
};
3227 #ifdef ONLY_INT_FIELDS
3228 unsigned int kind
: 16;
3229 unsigned int mode
: 16;
3231 enum kind kind
: 16;
3232 enum machine_mode mode
: 16;
3235 union real_extract du
;
3236 struct addr_const addr
;
3237 struct {HOST_WIDE_INT high
, low
;} di
;
3241 /* Express an rtx for a constant integer (perhaps symbolic)
3242 as the sum of a symbol or label plus an explicit integer.
3243 They are stored into VALUE. */
3246 decode_rtx_const (mode
, x
, value
)
3247 enum machine_mode mode
;
3249 struct rtx_const
*value
;
3251 /* Clear the whole structure, including any gaps. */
3254 int *p
= (int *) value
;
3255 int *end
= (int *) (value
+ 1);
3260 value
->kind
= RTX_INT
; /* Most usual kind. */
3263 switch (GET_CODE (x
))
3266 value
->kind
= RTX_DOUBLE
;
3267 if (GET_MODE (x
) != VOIDmode
)
3269 value
->mode
= GET_MODE (x
);
3270 bcopy ((char *) &CONST_DOUBLE_LOW (x
),
3271 (char *) &value
->un
.du
, sizeof value
->un
.du
);
3275 value
->un
.di
.low
= CONST_DOUBLE_LOW (x
);
3276 value
->un
.di
.high
= CONST_DOUBLE_HIGH (x
);
3281 value
->un
.addr
.offset
= INTVAL (x
);
3287 value
->un
.addr
.base
= x
;
3292 if (GET_CODE (x
) == PLUS
)
3294 value
->un
.addr
.base
= XEXP (x
, 0);
3295 if (GET_CODE (XEXP (x
, 1)) != CONST_INT
)
3297 value
->un
.addr
.offset
= INTVAL (XEXP (x
, 1));
3299 else if (GET_CODE (x
) == MINUS
)
3301 value
->un
.addr
.base
= XEXP (x
, 0);
3302 if (GET_CODE (XEXP (x
, 1)) != CONST_INT
)
3304 value
->un
.addr
.offset
= - INTVAL (XEXP (x
, 1));
3314 if (value
->kind
== RTX_INT
&& value
->un
.addr
.base
!= 0)
3315 switch (GET_CODE (value
->un
.addr
.base
))
3319 /* Use the string's address, not the SYMBOL_REF's address,
3320 for the sake of addresses of library routines.
3321 For a LABEL_REF, compare labels. */
3322 value
->un
.addr
.base
= XEXP (value
->un
.addr
.base
, 0);
3326 /* Given a MINUS expression, simplify it if both sides
3327 include the same symbol. */
3330 simplify_subtraction (x
)
3333 struct rtx_const val0
, val1
;
3335 decode_rtx_const (GET_MODE (x
), XEXP (x
, 0), &val0
);
3336 decode_rtx_const (GET_MODE (x
), XEXP (x
, 1), &val1
);
3338 if (val0
.un
.addr
.base
== val1
.un
.addr
.base
)
3339 return GEN_INT (val0
.un
.addr
.offset
- val1
.un
.addr
.offset
);
3343 /* Compute a hash code for a constant RTL expression. */
3346 const_hash_rtx (mode
, x
)
3347 enum machine_mode mode
;
3352 struct rtx_const value
;
3353 decode_rtx_const (mode
, x
, &value
);
3355 /* Compute hashing function */
3357 for (i
= 0; i
< sizeof value
/ sizeof (int); i
++)
3358 hi
+= ((int *) &value
)[i
];
3360 hi
&= (1 << HASHBITS
) - 1;
3361 hi
%= MAX_RTX_HASH_TABLE
;
3365 /* Compare a constant rtl object X with a constant-descriptor DESC.
3366 Return 1 if DESC describes a constant with the same value as X. */
3369 compare_constant_rtx (mode
, x
, desc
)
3370 enum machine_mode mode
;
3372 struct constant_descriptor
*desc
;
3374 register int *p
= (int *) desc
->contents
;
3377 struct rtx_const value
;
3379 decode_rtx_const (mode
, x
, &value
);
3380 strp
= (int *) &value
;
3381 len
= sizeof value
/ sizeof (int);
3383 /* Compare constant contents. */
3385 if (*p
++ != *strp
++)
3391 /* Construct a constant descriptor for the rtl-expression X.
3392 It is up to the caller to enter the descriptor in the hash table. */
3394 static struct constant_descriptor
*
3395 record_constant_rtx (mode
, x
)
3396 enum machine_mode mode
;
3399 struct constant_descriptor
*ptr
;
3401 struct rtx_const value
;
3403 decode_rtx_const (mode
, x
, &value
);
3405 /* Put these things in the saveable obstack so we can ensure it won't
3406 be freed if we are called from combine or some other phase that discards
3407 memory allocated from function_obstack (current_obstack). */
3408 obstack_grow (saveable_obstack
, &ptr
, sizeof ptr
);
3409 obstack_grow (saveable_obstack
, &label
, sizeof label
);
3411 /* Record constant contents. */
3412 obstack_grow (saveable_obstack
, &value
, sizeof value
);
3414 return (struct constant_descriptor
*) obstack_finish (saveable_obstack
);
3417 /* Given a constant rtx X, make (or find) a memory constant for its value
3418 and return a MEM rtx to refer to it in memory. */
3421 force_const_mem (mode
, x
)
3422 enum machine_mode mode
;
3426 register struct constant_descriptor
*desc
;
3431 /* If we want this CONST_DOUBLE in the same mode as it is in memory
3432 (this will always be true for floating CONST_DOUBLEs that have been
3433 placed in memory, but not for VOIDmode (integer) CONST_DOUBLEs),
3434 use the previous copy. Otherwise, make a new one. Note that in
3435 the unlikely event that this same CONST_DOUBLE is used in two different
3436 modes in an alternating fashion, we will allocate a lot of different
3437 memory locations, but this should be extremely rare. */
3439 /* Don't use CONST_DOUBLE_MEM in a nested function.
3440 Nested functions have their own constant pools,
3441 so they can't share the same values in CONST_DOUBLE_MEM
3442 with the containing function. */
3443 if (outer_function_chain
== 0)
3444 if (GET_CODE (x
) == CONST_DOUBLE
3445 && GET_CODE (CONST_DOUBLE_MEM (x
)) == MEM
3446 && GET_MODE (CONST_DOUBLE_MEM (x
)) == mode
)
3447 return CONST_DOUBLE_MEM (x
);
3449 /* Compute hash code of X. Search the descriptors for that hash code
3450 to see if any of them describes X. If yes, the descriptor records
3451 the label number already assigned. */
3453 hash
= const_hash_rtx (mode
, x
);
3455 for (desc
= const_rtx_hash_table
[hash
]; desc
; desc
= desc
->next
)
3456 if (compare_constant_rtx (mode
, x
, desc
))
3458 found
= desc
->label
;
3464 register struct pool_constant
*pool
;
3465 register struct pool_sym
*sym
;
3468 /* No constant equal to X is known to have been output.
3469 Make a constant descriptor to enter X in the hash table.
3470 Assign the label number and record it in the descriptor for
3471 future calls to this function to find. */
3473 desc
= record_constant_rtx (mode
, x
);
3474 desc
->next
= const_rtx_hash_table
[hash
];
3475 const_rtx_hash_table
[hash
] = desc
;
3477 /* Align the location counter as required by EXP's data type. */
3478 align
= (mode
== VOIDmode
) ? UNITS_PER_WORD
: GET_MODE_SIZE (mode
);
3479 if (align
> BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
3480 align
= BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
;
3482 pool_offset
+= align
- 1;
3483 pool_offset
&= ~ (align
- 1);
3485 /* If RTL is not being placed into the saveable obstack, make a
3486 copy of X that is in the saveable obstack in case we are
3487 being called from combine or some other phase that discards
3488 memory it allocates. We used to only do this if it is a
3489 CONST; however, reload can allocate a CONST_INT when
3490 eliminating registers. */
3491 if (rtl_obstack
!= saveable_obstack
3492 && (GET_CODE (x
) == CONST
|| GET_CODE (x
) == CONST_INT
))
3494 push_obstacks_nochange ();
3495 rtl_in_saveable_obstack ();
3497 if (GET_CODE (x
) == CONST
)
3498 x
= gen_rtx (CONST
, GET_MODE (x
),
3499 gen_rtx (PLUS
, GET_MODE (x
),
3500 XEXP (XEXP (x
, 0), 0),
3501 XEXP (XEXP (x
, 0), 1)));
3503 x
= GEN_INT (INTVAL (x
));
3508 /* Allocate a pool constant descriptor, fill it in, and chain it in. */
3510 pool
= (struct pool_constant
*) savealloc (sizeof (struct pool_constant
));
3514 pool
->labelno
= const_labelno
;
3515 pool
->align
= align
;
3516 pool
->offset
= pool_offset
;
3523 last_pool
->next
= pool
;
3526 pool_offset
+= GET_MODE_SIZE (mode
);
3528 /* Create a string containing the label name, in LABEL. */
3529 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
3534 = (char *) obstack_copy0 (saveable_obstack
, label
, strlen (label
));
3536 /* Add label to symbol hash table. */
3537 hash
= SYMHASH (found
);
3538 sym
= (struct pool_sym
*) savealloc (sizeof (struct pool_sym
));
3541 sym
->next
= const_rtx_sym_hash_table
[hash
];
3542 const_rtx_sym_hash_table
[hash
] = sym
;
3545 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
3547 def
= gen_rtx (MEM
, mode
, gen_rtx (SYMBOL_REF
, Pmode
, found
));
3549 RTX_UNCHANGING_P (def
) = 1;
3550 /* Mark the symbol_ref as belonging to this constants pool. */
3551 CONSTANT_POOL_ADDRESS_P (XEXP (def
, 0)) = 1;
3552 current_function_uses_const_pool
= 1;
3554 if (outer_function_chain
== 0)
3555 if (GET_CODE (x
) == CONST_DOUBLE
)
3557 if (CONST_DOUBLE_MEM (x
) == cc0_rtx
)
3559 CONST_DOUBLE_CHAIN (x
) = const_double_chain
;
3560 const_double_chain
= x
;
3562 CONST_DOUBLE_MEM (x
) = def
;
3568 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
3569 the corresponding pool_constant structure. */
3571 static struct pool_constant
*
3572 find_pool_constant (addr
)
3575 struct pool_sym
*sym
;
3576 char *label
= XSTR (addr
, 0);
3578 for (sym
= const_rtx_sym_hash_table
[SYMHASH (label
)]; sym
; sym
= sym
->next
)
3579 if (sym
->label
== label
)
3585 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
3588 get_pool_constant (addr
)
3591 return (find_pool_constant (addr
))->constant
;
3594 /* Similar, return the mode. */
3597 get_pool_mode (addr
)
3600 return (find_pool_constant (addr
))->mode
;
3603 /* Similar, return the offset in the constant pool. */
3606 get_pool_offset (addr
)
3609 return (find_pool_constant (addr
))->offset
;
3612 /* Return the size of the constant pool. */
3620 /* Write all the constants in the constant pool. */
3623 output_constant_pool (fnname
, fndecl
)
3627 struct pool_constant
*pool
;
3629 union real_extract u
;
3631 /* It is possible for gcc to call force_const_mem and then to later
3632 discard the instructions which refer to the constant. In such a
3633 case we do not need to output the constant. */
3634 if (optimize
>= 0 && flag_expensive_optimizations
)
3635 mark_constant_pool ();
3637 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3638 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3641 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3648 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3649 whose CODE_LABEL has been deleted. This can occur if a jump table
3650 is eliminated by optimization. If so, write a constant of zero
3651 instead. Note that this can also happen by turning the
3652 CODE_LABEL into a NOTE. */
3653 if (((GET_CODE (x
) == LABEL_REF
3654 && (INSN_DELETED_P (XEXP (x
, 0))
3655 || GET_CODE (XEXP (x
, 0)) == NOTE
)))
3656 || (GET_CODE (x
) == CONST
&& GET_CODE (XEXP (x
, 0)) == PLUS
3657 && GET_CODE (XEXP (XEXP (x
, 0), 0)) == LABEL_REF
3658 && (INSN_DELETED_P (XEXP (XEXP (XEXP (x
, 0), 0), 0))
3659 || GET_CODE (XEXP (XEXP (XEXP (x
, 0), 0), 0)) == NOTE
)))
3662 /* First switch to correct section. */
3663 #ifdef SELECT_RTX_SECTION
3664 SELECT_RTX_SECTION (pool
->mode
, x
);
3666 readonly_data_section ();
3669 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3670 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file
, x
, pool
->mode
,
3671 pool
->align
, pool
->labelno
, done
);
3674 if (pool
->align
> 1)
3675 ASM_OUTPUT_ALIGN (asm_out_file
, exact_log2 (pool
->align
));
3677 /* Output the label. */
3678 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LC", pool
->labelno
);
3680 /* Output the value of the constant itself. */
3681 switch (GET_MODE_CLASS (pool
->mode
))
3684 if (GET_CODE (x
) != CONST_DOUBLE
)
3687 bcopy ((char *) &CONST_DOUBLE_LOW (x
), (char *) &u
, sizeof u
);
3688 assemble_real (u
.d
, pool
->mode
);
3692 case MODE_PARTIAL_INT
:
3693 assemble_integer (x
, GET_MODE_SIZE (pool
->mode
), 1);
3703 #ifdef ASM_OUTPUT_POOL_EPILOGUE
3704 ASM_OUTPUT_POOL_EPILOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3707 /* Done with this pool. */
3708 first_pool
= last_pool
= 0;
3711 /* Look through the instructions for this function, and mark all the
3712 entries in the constant pool which are actually being used. */
3715 mark_constant_pool ()
3718 struct pool_constant
*pool
;
3720 if (first_pool
== 0)
3723 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3726 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
3727 if (GET_RTX_CLASS (GET_CODE (insn
)) == 'i')
3728 mark_constants (PATTERN (insn
));
3730 for (insn
= current_function_epilogue_delay_list
;
3732 insn
= XEXP (insn
, 1))
3733 if (GET_RTX_CLASS (GET_CODE (insn
)) == 'i')
3734 mark_constants (PATTERN (insn
));
3742 register char *format_ptr
;
3747 if (GET_CODE (x
) == SYMBOL_REF
)
3749 if (CONSTANT_POOL_ADDRESS_P (x
))
3750 find_pool_constant (x
)->mark
= 1;
3754 /* Insns may appear inside a SEQUENCE. Only check the patterns of
3755 insns, not any notes that may be attached. We don't want to mark
3756 a constant just because it happens to appear in a REG_EQUIV note. */
3757 if (GET_RTX_CLASS (GET_CODE (x
)) == 'i')
3759 mark_constants (PATTERN (x
));
3763 format_ptr
= GET_RTX_FORMAT (GET_CODE (x
));
3765 for (i
= 0; i
< GET_RTX_LENGTH (GET_CODE (x
)); i
++)
3767 switch (*format_ptr
++)
3770 mark_constants (XEXP (x
, i
));
3774 if (XVEC (x
, i
) != 0)
3778 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
3779 mark_constants (XVECEXP (x
, i
, j
));
3798 /* Find all the constants whose addresses are referenced inside of EXP,
3799 and make sure assembler code with a label has been output for each one.
3800 Indicate whether an ADDR_EXPR has been encountered. */
3803 output_addressed_constants (exp
)
3808 switch (TREE_CODE (exp
))
3812 register tree constant
= TREE_OPERAND (exp
, 0);
3814 while (TREE_CODE (constant
) == COMPONENT_REF
)
3816 constant
= TREE_OPERAND (constant
, 0);
3819 if (TREE_CODE_CLASS (TREE_CODE (constant
)) == 'c'
3820 || TREE_CODE (constant
) == CONSTRUCTOR
)
3821 /* No need to do anything here
3822 for addresses of variables or functions. */
3823 output_constant_def (constant
);
3830 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
3831 reloc
|= output_addressed_constants (TREE_OPERAND (exp
, 1));
3836 case NON_LVALUE_EXPR
:
3837 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
3843 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
3844 if (TREE_VALUE (link
) != 0)
3845 reloc
|= output_addressed_constants (TREE_VALUE (link
));
3855 /* Output assembler code for constant EXP to FILE, with no label.
3856 This includes the pseudo-op such as ".int" or ".byte", and a newline.
3857 Assumes output_addressed_constants has been done on EXP already.
3859 Generate exactly SIZE bytes of assembler data, padding at the end
3860 with zeros if necessary. SIZE must always be specified.
3862 SIZE is important for structure constructors,
3863 since trailing members may have been omitted from the constructor.
3864 It is also important for initialization of arrays from string constants
3865 since the full length of the string constant might not be wanted.
3866 It is also needed for initialization of unions, where the initializer's
3867 type is just one member, and that may not be as long as the union.
3869 There a case in which we would fail to output exactly SIZE bytes:
3870 for a structure constructor that wants to produce more than SIZE bytes.
3871 But such constructors will never be generated for any possible input. */
3874 output_constant (exp
, size
)
3878 register enum tree_code code
= TREE_CODE (TREE_TYPE (exp
));
3884 /* Eliminate the NON_LVALUE_EXPR_EXPR that makes a cast not be an lvalue.
3885 That way we get the constant (we hope) inside it. Also, strip off any
3886 NOP_EXPR that converts between two record, union, array, or set types. */
3887 while ((TREE_CODE (exp
) == NOP_EXPR
3888 && (TREE_TYPE (exp
) == TREE_TYPE (TREE_OPERAND (exp
, 0))
3889 || AGGREGATE_TYPE_P (TREE_TYPE (exp
))))
3890 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
3891 exp
= TREE_OPERAND (exp
, 0);
3893 /* Allow a constructor with no elements for any data type.
3894 This means to fill the space with zeros. */
3895 if (TREE_CODE (exp
) == CONSTRUCTOR
&& CONSTRUCTOR_ELTS (exp
) == 0)
3897 if (output_bytecode
)
3898 bc_emit_const_skip (size
);
3900 assemble_zeros (size
);
3911 case REFERENCE_TYPE
:
3912 /* ??? What about (int)((float)(int)&foo + 4) */
3913 while (TREE_CODE (exp
) == NOP_EXPR
|| TREE_CODE (exp
) == CONVERT_EXPR
3914 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
3915 exp
= TREE_OPERAND (exp
, 0);
3917 if (! assemble_integer (expand_expr (exp
, NULL_RTX
, VOIDmode
,
3918 EXPAND_INITIALIZER
),
3920 error ("initializer for integer value is too complicated");
3925 if (TREE_CODE (exp
) != REAL_CST
)
3926 error ("initializer for floating value is not a floating constant");
3928 assemble_real (TREE_REAL_CST (exp
),
3929 mode_for_size (size
* BITS_PER_UNIT
, MODE_FLOAT
, 0));
3934 output_constant (TREE_REALPART (exp
), size
/ 2);
3935 output_constant (TREE_IMAGPART (exp
), size
/ 2);
3936 size
-= (size
/ 2) * 2;
3940 if (TREE_CODE (exp
) == CONSTRUCTOR
)
3942 output_constructor (exp
, size
);
3945 else if (TREE_CODE (exp
) == STRING_CST
)
3949 if (size
> TREE_STRING_LENGTH (exp
))
3951 excess
= size
- TREE_STRING_LENGTH (exp
);
3952 size
= TREE_STRING_LENGTH (exp
);
3955 assemble_string (TREE_STRING_POINTER (exp
), size
);
3964 if (TREE_CODE (exp
) == CONSTRUCTOR
)
3965 output_constructor (exp
, size
);
3971 if (TREE_CODE (exp
) == INTEGER_CST
)
3972 assemble_integer (expand_expr (exp
, NULL_RTX
,
3973 VOIDmode
, EXPAND_INITIALIZER
),
3975 else if (TREE_CODE (exp
) == CONSTRUCTOR
)
3977 unsigned char *buffer
= (unsigned char *) alloca (size
);
3978 if (get_set_constructor_bytes (exp
, buffer
, size
))
3980 assemble_string ((char *) buffer
, size
);
3983 error ("unknown set constructor type");
3988 assemble_zeros (size
);
3991 /* Bytecode specific code to output assembler for integer. */
3994 bc_assemble_integer (exp
, size
)
4002 /* FIXME: is this fold() business going to be as good as the
4003 expand_expr() using EXPAND_SUM above in the RTL case? I
4005 FIXME: Copied as is from BC-GCC1; may need work. Don't hate. -bson */
4009 while (TREE_CODE (exp
) == NOP_EXPR
|| TREE_CODE (exp
) == CONVERT_EXPR
4010 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
4011 exp
= TREE_OPERAND (exp
, 0);
4012 if (TREE_CODE (exp
) == INTEGER_CST
)
4017 else if (TREE_CODE (exp
) == PLUS_EXPR
)
4019 const_part
= TREE_OPERAND (exp
, 0);
4020 while (TREE_CODE (const_part
) == NOP_EXPR
4021 || TREE_CODE (const_part
) == CONVERT_EXPR
4022 || TREE_CODE (const_part
) == NON_LVALUE_EXPR
)
4023 const_part
= TREE_OPERAND (const_part
, 0);
4024 addr_part
= TREE_OPERAND (exp
, 1);
4025 while (TREE_CODE (addr_part
) == NOP_EXPR
4026 || TREE_CODE (addr_part
) == CONVERT_EXPR
4027 || TREE_CODE (addr_part
) == NON_LVALUE_EXPR
)
4028 addr_part
= TREE_OPERAND (addr_part
, 0);
4029 if (TREE_CODE (const_part
) != INTEGER_CST
)
4030 tmp
= const_part
, const_part
= addr_part
, addr_part
= tmp
;
4031 if (TREE_CODE (const_part
) != INTEGER_CST
4032 || TREE_CODE (addr_part
) != ADDR_EXPR
)
4033 abort (); /* FIXME: we really haven't considered
4034 all the possible cases here. */
4036 else if (TREE_CODE (exp
) == ADDR_EXPR
)
4038 const_part
= integer_zero_node
;
4042 abort (); /* FIXME: ditto previous. */
4048 char c
= TREE_INT_CST_LOW (const_part
);
4054 short s
= TREE_INT_CST_LOW (const_part
);
4055 bc_emit ((char *) &s
, 2);
4060 int i
= TREE_INT_CST_LOW (const_part
);
4061 bc_emit ((char *) &i
, 4);
4066 if (WORDS_BIG_ENDIAN
)
4068 int i
= TREE_INT_CST_HIGH (const_part
);
4069 bc_emit ((char *) &i
, 4);
4070 i
= TREE_INT_CST_LOW (const_part
);
4071 bc_emit ((char *) &i
, 4);
4075 int i
= TREE_INT_CST_LOW (const_part
);
4076 bc_emit ((char *) &i
, 4);
4077 i
= TREE_INT_CST_HIGH (const_part
);
4078 bc_emit ((char *) &i
, 4);
4085 && TREE_CODE (TREE_OPERAND (addr_part
, 0)) == VAR_DECL
)
4086 bc_emit_labelref (IDENTIFIER_POINTER
4087 (DECL_ASSEMBLER_NAME (TREE_OPERAND (addr_part
, 0))),
4088 TREE_INT_CST_LOW (const_part
));
4090 abort (); /* FIXME: there may be more cases. */
4093 /* Subroutine of output_constant, used for CONSTRUCTORs
4094 (aggregate constants).
4095 Generate at least SIZE bytes, padding if necessary. */
4098 output_constructor (exp
, size
)
4102 register tree link
, field
= 0;
4103 HOST_WIDE_INT min_index
= 0;
4104 /* Number of bytes output or skipped so far.
4105 In other words, current position within the constructor. */
4106 int total_bytes
= 0;
4107 /* Non-zero means BYTE contains part of a byte, to be output. */
4108 int byte_buffer_in_use
= 0;
4111 if (HOST_BITS_PER_WIDE_INT
< BITS_PER_UNIT
)
4114 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
4115 field
= TYPE_FIELDS (TREE_TYPE (exp
));
4117 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
4118 && TYPE_DOMAIN (TREE_TYPE (exp
)) != 0)
4120 = TREE_INT_CST_LOW (TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (exp
))));
4122 /* As LINK goes through the elements of the constant,
4123 FIELD goes through the structure fields, if the constant is a structure.
4124 if the constant is a union, then we override this,
4125 by getting the field from the TREE_LIST element.
4126 But the constant could also be an array. Then FIELD is zero. */
4127 for (link
= CONSTRUCTOR_ELTS (exp
);
4129 link
= TREE_CHAIN (link
),
4130 field
= field
? TREE_CHAIN (field
) : 0)
4132 tree val
= TREE_VALUE (link
);
4135 /* the element in a union constructor specifies the proper field. */
4137 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
4138 || TREE_CODE (TREE_TYPE (exp
)) == UNION_TYPE
)
4140 /* if available, use the type given by link */
4141 if (TREE_PURPOSE (link
) != 0)
4142 field
= TREE_PURPOSE (link
);
4145 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
4146 index
= TREE_PURPOSE (link
);
4148 /* Eliminate the marker that makes a cast not be an lvalue. */
4152 if (index
&& TREE_CODE (index
) == RANGE_EXPR
)
4154 register int fieldsize
4155 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (exp
)));
4156 HOST_WIDE_INT lo_index
= TREE_INT_CST_LOW (TREE_OPERAND (index
, 0));
4157 HOST_WIDE_INT hi_index
= TREE_INT_CST_LOW (TREE_OPERAND (index
, 1));
4158 HOST_WIDE_INT index
;
4159 for (index
= lo_index
; index
<= hi_index
; index
++)
4161 /* Output the element's initial value. */
4163 assemble_zeros (fieldsize
);
4165 output_constant (val
, fieldsize
);
4167 /* Count its size. */
4168 total_bytes
+= fieldsize
;
4171 else if (field
== 0 || !DECL_BIT_FIELD (field
))
4173 /* An element that is not a bit-field. */
4175 register int fieldsize
;
4176 /* Since this structure is static,
4177 we know the positions are constant. */
4178 int bitpos
= (field
? (TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field
))
4182 bitpos
= (TREE_INT_CST_LOW (TYPE_SIZE (TREE_TYPE (val
)))
4184 * (TREE_INT_CST_LOW (index
) - min_index
));
4186 /* Output any buffered-up bit-fields preceding this element. */
4187 if (byte_buffer_in_use
)
4189 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4191 byte_buffer_in_use
= 0;
4194 /* Advance to offset of this element.
4195 Note no alignment needed in an array, since that is guaranteed
4196 if each element has the proper size. */
4197 if ((field
!= 0 || index
!= 0) && bitpos
!= total_bytes
)
4199 if (!output_bytecode
)
4200 assemble_zeros (bitpos
- total_bytes
);
4202 bc_emit_const_skip (bitpos
- total_bytes
);
4203 total_bytes
= bitpos
;
4206 /* Determine size this element should occupy. */
4209 if (TREE_CODE (DECL_SIZE (field
)) != INTEGER_CST
)
4211 if (TREE_INT_CST_LOW (DECL_SIZE (field
)) > 100000)
4213 /* This avoids overflow trouble. */
4214 tree size_tree
= size_binop (CEIL_DIV_EXPR
,
4216 size_int (BITS_PER_UNIT
));
4217 fieldsize
= TREE_INT_CST_LOW (size_tree
);
4221 fieldsize
= TREE_INT_CST_LOW (DECL_SIZE (field
));
4222 fieldsize
= (fieldsize
+ BITS_PER_UNIT
- 1) / BITS_PER_UNIT
;
4226 fieldsize
= int_size_in_bytes (TREE_TYPE (TREE_TYPE (exp
)));
4228 /* Output the element's initial value. */
4230 assemble_zeros (fieldsize
);
4232 output_constant (val
, fieldsize
);
4234 /* Count its size. */
4235 total_bytes
+= fieldsize
;
4237 else if (val
!= 0 && TREE_CODE (val
) != INTEGER_CST
)
4238 error ("invalid initial value for member `%s'",
4239 IDENTIFIER_POINTER (DECL_NAME (field
)));
4242 /* Element that is a bit-field. */
4244 int next_offset
= TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field
));
4246 = (next_offset
+ TREE_INT_CST_LOW (DECL_SIZE (field
)));
4249 val
= integer_zero_node
;
4251 /* If this field does not start in this (or, next) byte,
4253 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4255 /* Output remnant of any bit field in previous bytes. */
4256 if (byte_buffer_in_use
)
4258 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4260 byte_buffer_in_use
= 0;
4263 /* If still not at proper byte, advance to there. */
4264 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4266 assemble_zeros (next_offset
/ BITS_PER_UNIT
- total_bytes
);
4267 total_bytes
= next_offset
/ BITS_PER_UNIT
;
4271 if (! byte_buffer_in_use
)
4274 /* We must split the element into pieces that fall within
4275 separate bytes, and combine each byte with previous or
4276 following bit-fields. */
4278 /* next_offset is the offset n fbits from the beginning of
4279 the structure to the next bit of this element to be processed.
4280 end_offset is the offset of the first bit past the end of
4282 while (next_offset
< end_offset
)
4286 HOST_WIDE_INT value
;
4287 int next_byte
= next_offset
/ BITS_PER_UNIT
;
4288 int next_bit
= next_offset
% BITS_PER_UNIT
;
4290 /* Advance from byte to byte
4291 within this element when necessary. */
4292 while (next_byte
!= total_bytes
)
4294 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4299 /* Number of bits we can process at once
4300 (all part of the same byte). */
4301 this_time
= MIN (end_offset
- next_offset
,
4302 BITS_PER_UNIT
- next_bit
);
4303 if (BYTES_BIG_ENDIAN
)
4305 /* On big-endian machine, take the most significant bits
4306 first (of the bits that are significant)
4307 and put them into bytes from the most significant end. */
4308 shift
= end_offset
- next_offset
- this_time
;
4309 /* Don't try to take a bunch of bits that cross
4310 the word boundary in the INTEGER_CST. */
4311 if (shift
< HOST_BITS_PER_WIDE_INT
4312 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4314 this_time
-= (HOST_BITS_PER_WIDE_INT
- shift
);
4315 shift
= HOST_BITS_PER_WIDE_INT
;
4318 /* Now get the bits from the appropriate constant word. */
4319 if (shift
< HOST_BITS_PER_WIDE_INT
)
4321 value
= TREE_INT_CST_LOW (val
);
4323 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4325 value
= TREE_INT_CST_HIGH (val
);
4326 shift
-= HOST_BITS_PER_WIDE_INT
;
4330 byte
|= (((value
>> shift
)
4331 & (((HOST_WIDE_INT
) 1 << this_time
) - 1))
4332 << (BITS_PER_UNIT
- this_time
- next_bit
));
4336 /* On little-endian machines,
4337 take first the least significant bits of the value
4338 and pack them starting at the least significant
4339 bits of the bytes. */
4340 shift
= (next_offset
4341 - TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field
)));
4342 /* Don't try to take a bunch of bits that cross
4343 the word boundary in the INTEGER_CST. */
4344 if (shift
< HOST_BITS_PER_WIDE_INT
4345 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4347 this_time
-= (HOST_BITS_PER_WIDE_INT
- shift
);
4348 shift
= HOST_BITS_PER_WIDE_INT
;
4351 /* Now get the bits from the appropriate constant word. */
4352 if (shift
< HOST_BITS_PER_INT
)
4353 value
= TREE_INT_CST_LOW (val
);
4354 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4356 value
= TREE_INT_CST_HIGH (val
);
4357 shift
-= HOST_BITS_PER_WIDE_INT
;
4361 byte
|= (((value
>> shift
)
4362 & (((HOST_WIDE_INT
) 1 << this_time
) - 1))
4365 next_offset
+= this_time
;
4366 byte_buffer_in_use
= 1;
4370 if (byte_buffer_in_use
)
4372 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4375 if (total_bytes
< size
)
4376 assemble_zeros (size
- total_bytes
);
4379 /* Output asm to handle ``#pragma weak'' */
4382 handle_pragma_weak (what
, name
, value
)
4383 enum pragma_state what
;
4386 #ifdef HANDLE_PRAGMA_WEAK
4387 if (what
== ps_name
|| what
== ps_value
)
4389 struct weak_syms
*weak
=
4390 (struct weak_syms
*)permalloc (sizeof (struct weak_syms
));
4391 weak
->next
= weak_decls
;
4392 weak
->name
= permalloc (strlen (name
) + 1);
4393 strcpy (weak
->name
, name
);
4395 if (what
!= ps_value
)
4396 weak
->value
= NULL_PTR
;
4400 weak
->value
= permalloc (strlen (value
) + 1);
4401 strcpy (weak
->value
, value
);
4406 else if (! (what
== ps_done
|| what
== ps_start
))
4407 warning ("malformed `#pragma weak'");
4408 #endif /* HANDLE_PRAGMA_WEAK */
4411 /* Declare DECL to be a weak symbol. */
4417 if (! TREE_PUBLIC (decl
))
4418 error_with_decl (decl
, "weak declaration of `%s' must be public");
4419 else if (TREE_ASM_WRITTEN (decl
))
4420 error_with_decl (decl
, "weak declaration of `%s' must precede definition");
4421 else if (SUPPORTS_WEAK
)
4422 DECL_WEAK (decl
) = 1;
4425 /* Emit any pending weak declarations. */
4430 #ifdef HANDLE_PRAGMA_WEAK
4431 if (HANDLE_PRAGMA_WEAK
)
4433 struct weak_syms
*t
;
4434 for (t
= weak_decls
; t
; t
= t
->next
)
4436 ASM_WEAKEN_LABEL (asm_out_file
, t
->name
);
4438 ASM_OUTPUT_DEF (asm_out_file
, t
->name
, t
->value
);
4445 assemble_alias (decl
, target
)
4450 make_decl_rtl (decl
, (char *) 0, 1);
4451 name
= XSTR (XEXP (DECL_RTL (decl
), 0), 0);
4453 #ifdef ASM_OUTPUT_DEF
4454 /* Make name accessible from other files, if appropriate. */
4456 if (TREE_PUBLIC (decl
))
4458 #ifdef ASM_WEAKEN_LABEL
4459 if (DECL_WEAK (decl
))
4460 ASM_WEAKEN_LABEL (asm_out_file
, name
);
4463 if (output_bytecode
)
4464 BC_GLOBALIZE_LABEL (asm_out_file
, name
);
4466 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
4469 ASM_OUTPUT_DEF (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4470 TREE_ASM_WRITTEN (decl
) = 1;
4472 #ifdef ASM_OUTPUT_WEAK_ALIAS
4473 if (! DECL_WEAK (decl
))
4474 warning ("only weak aliases are supported in this configuration");
4476 ASM_OUTPUT_WEAK_ALIAS (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4477 TREE_ASM_WRITTEN (decl
) = 1;
4479 warning ("alias definitions not supported in this configuration; ignored");
4484 /* This determines whether or not we support link-once semantics. */
4485 #ifndef SUPPORTS_ONE_ONLY
4486 #ifdef MAKE_DECL_ONE_ONLY
4487 #define SUPPORTS_ONE_ONLY 1
4489 #define SUPPORTS_ONE_ONLY 0
4493 /* Returns 1 if the target configuration supports defining public symbols
4494 so that one of them will be chosen at link time instead of generating a
4495 multiply-defined symbol error, whether through the use of weak symbols or
4496 a target-specific mechanism for having duplicates discarded. */
4499 supports_one_only ()
4501 if (SUPPORTS_ONE_ONLY
)
4503 return SUPPORTS_WEAK
;
4506 /* Set up DECL as a public symbol that can be defined in multiple
4507 translation units without generating a linker error. */
4510 make_decl_one_only (decl
)
4513 if (TREE_CODE (decl
) != VAR_DECL
&& TREE_CODE (decl
) != FUNCTION_DECL
)
4516 TREE_PUBLIC (decl
) = 1;
4518 if (TREE_CODE (decl
) == VAR_DECL
4519 && (DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
))
4520 DECL_COMMON (decl
) = 1;
4521 else if (SUPPORTS_ONE_ONLY
)
4523 #ifdef MAKE_DECL_ONE_ONLY
4524 MAKE_DECL_ONE_ONLY (decl
);
4526 DECL_ONE_ONLY (decl
) = 1;
4528 else if (SUPPORTS_WEAK
)
4529 DECL_WEAK (decl
) = 1;