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. */
32 /* #include <stab.h> */
40 #include "hard-reg-set.h"
48 #ifdef XCOFF_DEBUGGING_INFO
54 #ifndef TRAMPOLINE_ALIGNMENT
55 #define TRAMPOLINE_ALIGNMENT FUNCTION_BOUNDARY
59 #define ASM_STABS_OP ".stabs"
62 /* Define the prefix to use when check_memory_usage_flag is enable. */
63 #ifdef NO_DOLLAR_IN_LABEL
64 #ifdef NO_DOT_IN_LABEL
65 #define CHKR_PREFIX "chkr_prefix_"
66 #else /* !NO_DOT_IN_LABEL */
67 #define CHKR_PREFIX "chkr."
69 #else /* !NO_DOLLAR_IN_LABEL */
70 #define CHKR_PREFIX "chkr$"
72 #define CHKR_PREFIX_SIZE (sizeof (CHKR_PREFIX) - 1)
74 /* This macro gets just the user-specified name
75 out of the string in a SYMBOL_REF. On most machines,
76 we discard the * if any and that's all. */
77 #ifndef STRIP_NAME_ENCODING
78 #define STRIP_NAME_ENCODING(VAR,SYMBOL_NAME) \
79 (VAR) = ((SYMBOL_NAME) + ((SYMBOL_NAME)[0] == '*'))
82 /* File in which assembler code is being written. */
84 extern FILE *asm_out_file
;
86 /* The (assembler) name of the first globally-visible object output. */
87 char *first_global_object_name
;
89 extern struct obstack
*current_obstack
;
90 extern struct obstack
*saveable_obstack
;
91 extern struct obstack
*rtl_obstack
;
92 extern struct obstack permanent_obstack
;
93 #define obstack_chunk_alloc xmalloc
95 /* Number for making the label on the next
96 constant that is stored in memory. */
100 /* Number for making the label on the next
101 static variable internal to a function. */
105 /* Carry information from ASM_DECLARE_OBJECT_NAME
106 to ASM_FINISH_DECLARE_OBJECT. */
108 int size_directive_output
;
110 /* The last decl for which assemble_variable was called,
111 if it did ASM_DECLARE_OBJECT_NAME.
112 If the last call to assemble_variable didn't do that,
115 tree last_assemble_variable_decl
;
118 #ifdef HANDLE_PRAGMA_WEAK
119 /* Any weak symbol declarations waiting to be emitted. */
123 struct weak_syms
*next
;
128 static struct weak_syms
*weak_decls
;
131 /* Nonzero if at least one function definition has been seen. */
133 static int function_defined
;
136 struct constant_descriptor
;
138 struct pool_constant
;
140 static char *strip_reg_name
PROTO((char *));
141 static int contains_pointers_p
PROTO((tree
));
142 static void decode_addr_const
PROTO((tree
, struct addr_const
*));
143 static int const_hash
PROTO((tree
));
144 static int compare_constant
PROTO((tree
,
145 struct constant_descriptor
*));
146 static char *compare_constant_1
PROTO((tree
, char *));
147 static struct constant_descriptor
*record_constant
PROTO((tree
));
148 static void record_constant_1
PROTO((tree
));
149 static tree copy_constant
PROTO((tree
));
150 static void output_constant_def_contents
PROTO((tree
, int, int));
151 static void decode_rtx_const
PROTO((enum machine_mode
, rtx
,
152 struct rtx_const
*));
153 static int const_hash_rtx
PROTO((enum machine_mode
, rtx
));
154 static int compare_constant_rtx
PROTO((enum machine_mode
, rtx
,
155 struct constant_descriptor
*));
156 static struct constant_descriptor
*record_constant_rtx
PROTO((enum machine_mode
,
158 static struct pool_constant
*find_pool_constant
PROTO((rtx
));
159 static void mark_constant_pool
PROTO((void));
160 static void mark_constants
PROTO((rtx
));
161 static int output_addressed_constants
PROTO((tree
));
162 static void output_after_function_constants
PROTO((void));
163 static void output_constructor
PROTO((tree
, int));
165 static enum in_section
{ no_section
, in_text
, in_data
, in_named
166 #ifdef BSS_SECTION_ASM_OP
169 #ifdef EH_FRAME_SECTION_ASM_OP
172 #ifdef EXTRA_SECTIONS
175 } in_section
= no_section
;
177 /* Return a non-zero value if DECL has a section attribute. */
178 #define IN_NAMED_SECTION(DECL) \
179 ((TREE_CODE (DECL) == FUNCTION_DECL || TREE_CODE (DECL) == VAR_DECL) \
180 && DECL_SECTION_NAME (DECL) != NULL_TREE)
182 /* Text of section name when in_section == in_named. */
183 static char *in_named_name
;
185 /* Define functions like text_section for any extra sections. */
186 #ifdef EXTRA_SECTION_FUNCTIONS
187 EXTRA_SECTION_FUNCTIONS
190 /* Tell assembler to switch to text section. */
195 if (in_section
!= in_text
)
197 fprintf (asm_out_file
, "%s\n", TEXT_SECTION_ASM_OP
);
198 in_section
= in_text
;
202 /* Tell assembler to switch to data section. */
207 if (in_section
!= in_data
)
209 if (flag_shared_data
)
211 #ifdef SHARED_SECTION_ASM_OP
212 fprintf (asm_out_file
, "%s\n", SHARED_SECTION_ASM_OP
);
214 fprintf (asm_out_file
, "%s\n", DATA_SECTION_ASM_OP
);
218 fprintf (asm_out_file
, "%s\n", DATA_SECTION_ASM_OP
);
220 in_section
= in_data
;
224 /* Tell assembler to switch to read-only data section. This is normally
228 readonly_data_section ()
230 #ifdef READONLY_DATA_SECTION
231 READONLY_DATA_SECTION (); /* Note this can call data_section. */
237 /* Determine if we're in the text section. */
242 return in_section
== in_text
;
245 /* Determine if we're in the data section. */
250 return in_section
== in_data
;
253 /* Tell assembler to change to section NAME for DECL.
254 If DECL is NULL, just switch to section NAME.
255 If NAME is NULL, get the name from DECL.
256 If RELOC is 1, the initializer for DECL contains relocs. */
259 named_section (decl
, name
, reloc
)
264 if (decl
!= NULL_TREE
265 && TREE_CODE_CLASS (TREE_CODE (decl
)) != 'd')
268 name
= TREE_STRING_POINTER (DECL_SECTION_NAME (decl
));
270 if (in_section
!= in_named
|| strcmp (name
, in_named_name
))
272 #ifdef ASM_OUTPUT_SECTION_NAME
273 ASM_OUTPUT_SECTION_NAME (asm_out_file
, decl
, name
, reloc
);
275 /* Section attributes are not supported if this macro isn't provided -
276 some host formats don't support them at all. The front-end should
277 already have flagged this as an error. */
281 in_named_name
= obstack_alloc (&permanent_obstack
, strlen (name
) + 1);
282 strcpy (in_named_name
, name
);
283 in_section
= in_named
;
287 #ifdef ASM_OUTPUT_SECTION_NAME
288 #ifndef UNIQUE_SECTION
289 #define UNIQUE_SECTION(DECL,RELOC) \
292 char *name, *string; \
294 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (DECL)); \
295 /* Strip off any encoding in name. */ \
296 STRIP_NAME_ENCODING (name, name); \
298 len = strlen (name) + 1; \
299 string = alloca (len + 1); \
300 sprintf (string, ".%s", name); \
302 DECL_SECTION_NAME (DECL) = build_string (len, string); \
305 #ifndef UNIQUE_SECTION_P
306 #define UNIQUE_SECTION_P(DECL) 0
310 #ifdef BSS_SECTION_ASM_OP
312 /* Tell the assembler to switch to the bss section. */
317 if (in_section
!= in_bss
)
319 #ifdef SHARED_BSS_SECTION_ASM_OP
320 if (flag_shared_data
)
321 fprintf (asm_out_file
, "%s\n", SHARED_BSS_SECTION_ASM_OP
);
324 fprintf (asm_out_file
, "%s\n", BSS_SECTION_ASM_OP
);
330 #ifdef ASM_OUTPUT_BSS
332 /* Utility function for ASM_OUTPUT_BSS for targets to use if
333 they don't support alignments in .bss.
334 ??? It is believed that this function will work in most cases so such
335 support is localized here. */
338 asm_output_bss (file
, decl
, name
, size
, rounded
)
344 ASM_GLOBALIZE_LABEL (file
, name
);
346 #ifdef ASM_DECLARE_OBJECT_NAME
347 last_assemble_variable_decl
= decl
;
348 ASM_DECLARE_OBJECT_NAME (file
, name
, decl
);
350 /* Standard thing is just output label for the object. */
351 ASM_OUTPUT_LABEL (file
, name
);
352 #endif /* ASM_DECLARE_OBJECT_NAME */
353 ASM_OUTPUT_SKIP (file
, rounded
);
358 #ifdef ASM_OUTPUT_ALIGNED_BSS
360 /* Utility function for targets to use in implementing
361 ASM_OUTPUT_ALIGNED_BSS.
362 ??? It is believed that this function will work in most cases so such
363 support is localized here. */
366 asm_output_aligned_bss (file
, decl
, name
, size
, align
)
372 ASM_GLOBALIZE_LABEL (file
, name
);
374 ASM_OUTPUT_ALIGN (file
, floor_log2 (align
/ BITS_PER_UNIT
));
375 #ifdef ASM_DECLARE_OBJECT_NAME
376 last_assemble_variable_decl
= decl
;
377 ASM_DECLARE_OBJECT_NAME (file
, name
, decl
);
379 /* Standard thing is just output label for the object. */
380 ASM_OUTPUT_LABEL (file
, name
);
381 #endif /* ASM_DECLARE_OBJECT_NAME */
382 ASM_OUTPUT_SKIP (file
, size
? size
: 1);
387 #endif /* BSS_SECTION_ASM_OP */
389 #ifdef EH_FRAME_SECTION_ASM_OP
393 if (in_section
!= in_eh_frame
)
395 fprintf (asm_out_file
, "%s\n", EH_FRAME_SECTION_ASM_OP
);
396 in_section
= in_eh_frame
;
401 /* Switch to the section for function DECL.
403 If DECL is NULL_TREE, switch to the text section.
404 ??? It's not clear that we will ever be passed NULL_TREE, but it's
405 safer to handle it. */
408 function_section (decl
)
411 if (decl
!= NULL_TREE
412 && DECL_SECTION_NAME (decl
) != NULL_TREE
)
413 named_section (decl
, (char *) 0, 0);
418 /* Switch to section for variable DECL.
420 RELOC is the `reloc' argument to SELECT_SECTION. */
423 variable_section (decl
, reloc
)
427 if (IN_NAMED_SECTION (decl
))
428 named_section (decl
, NULL
, reloc
);
431 /* C++ can have const variables that get initialized from constructors,
432 and thus can not be in a readonly section. We prevent this by
433 verifying that the initial value is constant for objects put in a
436 error_mark_node is used by the C front end to indicate that the
437 initializer has not been seen yet. In this case, we assume that
438 the initializer must be constant.
440 C++ uses error_mark_node for variables that have complicated
441 initializers, but these variables go in BSS so we won't be called
444 #ifdef SELECT_SECTION
445 SELECT_SECTION (decl
, reloc
);
447 if (DECL_READONLY_SECTION (decl
, reloc
))
448 readonly_data_section ();
455 /* Tell assembler to switch to the section for the exception handling
461 #if defined (EXCEPTION_SECTION)
462 EXCEPTION_SECTION ();
464 #ifdef ASM_OUTPUT_SECTION_NAME
465 named_section (NULL_TREE
, ".gcc_except_table", 0);
470 readonly_data_section ();
475 /* Create the rtl to represent a function, for a function definition.
476 DECL is a FUNCTION_DECL node which describes which function.
477 The rtl is stored into DECL. */
480 make_function_rtl (decl
)
483 char *name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
484 char *new_name
= name
;
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
));
500 /* When -fprefix-function-name is used, every function name is
501 prefixed. Even static functions are prefixed because they
502 could be declared latter. Note that a nested function name
504 if (flag_prefix_function_name
)
506 new_name
= (char *) alloca (strlen (name
) + CHKR_PREFIX_SIZE
+ 1);
507 strcpy (new_name
, CHKR_PREFIX
);
508 strcpy (new_name
+ CHKR_PREFIX_SIZE
, name
);
509 name
= obstack_copy0 (saveable_obstack
, new_name
, strlen (new_name
));
513 if (DECL_RTL (decl
) == 0)
516 = gen_rtx_MEM (DECL_MODE (decl
),
517 gen_rtx_SYMBOL_REF (Pmode
, name
));
519 /* Optionally set flags or add text to the name to record information
520 such as that it is a function name. If the name is changed, the macro
521 ASM_OUTPUT_LABELREF will have to know how to strip this information. */
522 #ifdef ENCODE_SECTION_INFO
523 ENCODE_SECTION_INFO (decl
);
527 /* Record at least one function has been defined. */
528 function_defined
= 1;
531 /* Given NAME, a putative register name, discard any customary prefixes. */
534 strip_reg_name (name
)
537 #ifdef REGISTER_PREFIX
538 if (!strncmp (name
, REGISTER_PREFIX
, strlen (REGISTER_PREFIX
)))
539 name
+= strlen (REGISTER_PREFIX
);
541 if (name
[0] == '%' || name
[0] == '#')
546 /* Decode an `asm' spec for a declaration as a register name.
547 Return the register number, or -1 if nothing specified,
548 or -2 if the ASMSPEC is not `cc' or `memory' and is not recognized,
549 or -3 if ASMSPEC is `cc' and is not recognized,
550 or -4 if ASMSPEC is `memory' and is not recognized.
551 Accept an exact spelling or a decimal number.
552 Prefixes such as % are optional. */
555 decode_reg_name (asmspec
)
562 /* Get rid of confusing prefixes. */
563 asmspec
= strip_reg_name (asmspec
);
565 /* Allow a decimal number as a "register name". */
566 for (i
= strlen (asmspec
) - 1; i
>= 0; i
--)
567 if (! (asmspec
[i
] >= '0' && asmspec
[i
] <= '9'))
569 if (asmspec
[0] != 0 && i
< 0)
572 if (i
< FIRST_PSEUDO_REGISTER
&& i
>= 0)
578 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
580 && ! strcmp (asmspec
, strip_reg_name (reg_names
[i
])))
583 #ifdef ADDITIONAL_REGISTER_NAMES
585 static struct { char *name
; int number
; } table
[]
586 = ADDITIONAL_REGISTER_NAMES
;
588 for (i
= 0; i
< sizeof (table
) / sizeof (table
[0]); i
++)
589 if (! strcmp (asmspec
, table
[i
].name
))
590 return table
[i
].number
;
592 #endif /* ADDITIONAL_REGISTER_NAMES */
594 if (!strcmp (asmspec
, "memory"))
597 if (!strcmp (asmspec
, "cc"))
606 /* Create the DECL_RTL for a declaration for a static or external variable
607 or static or external function.
608 ASMSPEC, if not 0, is the string which the user specified
609 as the assembler symbol name.
610 TOP_LEVEL is nonzero if this is a file-scope variable.
612 This is never called for PARM_DECL nodes. */
615 make_decl_rtl (decl
, asmspec
, top_level
)
620 register char *name
= 0;
623 reg_number
= decode_reg_name (asmspec
);
625 if (DECL_ASSEMBLER_NAME (decl
) != NULL_TREE
)
626 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
628 if (reg_number
== -2)
630 /* ASMSPEC is given, and not the name of a register. */
631 name
= (char *) obstack_alloc (saveable_obstack
,
632 strlen (asmspec
) + 2);
634 strcpy (&name
[1], asmspec
);
637 /* For a duplicate declaration, we can be called twice on the
638 same DECL node. Don't discard the RTL already made. */
639 if (DECL_RTL (decl
) == 0)
643 /* First detect errors in declaring global registers. */
644 if (TREE_CODE (decl
) != FUNCTION_DECL
645 && DECL_REGISTER (decl
) && reg_number
== -1)
646 error_with_decl (decl
,
647 "register name not specified for `%s'");
648 else if (TREE_CODE (decl
) != FUNCTION_DECL
649 && DECL_REGISTER (decl
) && reg_number
< 0)
650 error_with_decl (decl
,
651 "invalid register name for `%s'");
652 else if ((reg_number
>= 0 || reg_number
== -3)
653 && (TREE_CODE (decl
) == FUNCTION_DECL
654 && ! DECL_REGISTER (decl
)))
655 error_with_decl (decl
,
656 "register name given for non-register variable `%s'");
657 else if (TREE_CODE (decl
) != FUNCTION_DECL
658 && DECL_REGISTER (decl
)
659 && TYPE_MODE (TREE_TYPE (decl
)) == BLKmode
)
660 error_with_decl (decl
,
661 "data type of `%s' isn't suitable for a register");
662 else if (TREE_CODE (decl
) != FUNCTION_DECL
&& DECL_REGISTER (decl
)
663 && ! HARD_REGNO_MODE_OK (reg_number
,
664 TYPE_MODE (TREE_TYPE (decl
))))
665 error_with_decl (decl
,
666 "register number for `%s' isn't suitable for data type");
667 /* Now handle properly declared static register variables. */
668 else if (TREE_CODE (decl
) != FUNCTION_DECL
&& DECL_REGISTER (decl
))
672 if (DECL_INITIAL (decl
) != 0 && top_level
)
674 DECL_INITIAL (decl
) = 0;
675 error ("global register variable has initial value");
677 if (fixed_regs
[reg_number
] == 0
678 && function_defined
&& top_level
)
679 error ("global register variable follows a function definition");
680 if (TREE_THIS_VOLATILE (decl
))
681 warning ("volatile register variables don't work as you might wish");
683 /* If the user specified one of the eliminables registers here,
684 e.g., FRAME_POINTER_REGNUM, we don't want to get this variable
685 confused with that register and be eliminated. Although this
686 usage is somewhat suspect, we nevertheless use the following
687 kludge to avoid setting DECL_RTL to frame_pointer_rtx. */
690 = gen_rtx_REG (DECL_MODE (decl
), FIRST_PSEUDO_REGISTER
);
691 REGNO (DECL_RTL (decl
)) = reg_number
;
692 REG_USERVAR_P (DECL_RTL (decl
)) = 1;
696 /* Make this register global, so not usable for anything
698 nregs
= HARD_REGNO_NREGS (reg_number
, DECL_MODE (decl
));
700 globalize_reg (reg_number
+ --nregs
);
703 /* Specifying a section attribute on a variable forces it into a
704 non-.bss section, and thus it cannot be common. */
705 else if (TREE_CODE (decl
) == VAR_DECL
706 && DECL_SECTION_NAME (decl
) != NULL_TREE
707 && DECL_INITIAL (decl
) == NULL_TREE
708 && DECL_COMMON (decl
))
709 DECL_COMMON (decl
) = 0;
711 /* Now handle ordinary static variables and functions (in memory).
712 Also handle vars declared register invalidly. */
713 if (DECL_RTL (decl
) == 0)
715 /* Can't use just the variable's own name for a variable
716 whose scope is less than the whole file.
717 Concatenate a distinguishing number. */
718 if (!top_level
&& !TREE_PUBLIC (decl
) && asmspec
== 0)
722 ASM_FORMAT_PRIVATE_NAME (label
, name
, var_labelno
);
723 name
= obstack_copy0 (saveable_obstack
, label
, strlen (label
));
730 /* When -fprefix-function-name is used, the functions
731 names are prefixed. Only nested function names are not
733 if (flag_prefix_function_name
&& TREE_CODE (decl
) == FUNCTION_DECL
)
736 new_name
= (char *) alloca (strlen (name
) + CHKR_PREFIX_SIZE
738 strcpy (new_name
, CHKR_PREFIX
);
739 strcpy (new_name
+ CHKR_PREFIX_SIZE
, name
);
740 name
= obstack_copy0 (saveable_obstack
,
741 new_name
, strlen (new_name
));
744 DECL_RTL (decl
) = gen_rtx_MEM (DECL_MODE (decl
),
745 gen_rtx_SYMBOL_REF (Pmode
, name
));
747 /* If this variable is to be treated as volatile, show its
748 tree node has side effects. If it has side effects, either
749 because of this test or from TREE_THIS_VOLATILE also
750 being set, show the MEM is volatile. */
751 if (flag_volatile_global
&& TREE_CODE (decl
) == VAR_DECL
752 && TREE_PUBLIC (decl
))
753 TREE_SIDE_EFFECTS (decl
) = 1;
754 if (TREE_SIDE_EFFECTS (decl
))
755 MEM_VOLATILE_P (DECL_RTL (decl
)) = 1;
757 if (TREE_READONLY (decl
))
758 RTX_UNCHANGING_P (DECL_RTL (decl
)) = 1;
759 MEM_IN_STRUCT_P (DECL_RTL (decl
))
760 = AGGREGATE_TYPE_P (TREE_TYPE (decl
));
762 /* Optionally set flags or add text to the name to record information
763 such as that it is a function name.
764 If the name is changed, the macro ASM_OUTPUT_LABELREF
765 will have to know how to strip this information. */
766 #ifdef ENCODE_SECTION_INFO
767 ENCODE_SECTION_INFO (decl
);
771 /* If the old RTL had the wrong mode, fix the mode. */
772 else if (GET_MODE (DECL_RTL (decl
)) != DECL_MODE (decl
))
774 rtx rtl
= DECL_RTL (decl
);
775 PUT_MODE (rtl
, DECL_MODE (decl
));
779 /* Make the rtl for variable VAR be volatile.
780 Use this only for static variables. */
783 make_var_volatile (var
)
786 if (GET_CODE (DECL_RTL (var
)) != MEM
)
789 MEM_VOLATILE_P (DECL_RTL (var
)) = 1;
792 /* Output alignment directive to align for constant expression EXP. */
795 assemble_constant_align (exp
)
800 /* Align the location counter as required by EXP's data type. */
801 align
= TYPE_ALIGN (TREE_TYPE (exp
));
802 #ifdef CONSTANT_ALIGNMENT
803 align
= CONSTANT_ALIGNMENT (exp
, align
);
806 if (align
> BITS_PER_UNIT
)
807 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
810 /* Output a string of literal assembler code
811 for an `asm' keyword used between functions. */
814 assemble_asm (string
)
819 if (TREE_CODE (string
) == ADDR_EXPR
)
820 string
= TREE_OPERAND (string
, 0);
822 fprintf (asm_out_file
, "\t%s\n", TREE_STRING_POINTER (string
));
825 #if 0 /* This should no longer be needed, because
826 flag_gnu_linker should be 0 on these systems,
827 which should prevent any output
828 if ASM_OUTPUT_CONSTRUCTOR and ASM_OUTPUT_DESTRUCTOR are absent. */
829 #if !(defined(DBX_DEBUGGING_INFO) && !defined(FASCIST_ASSEMBLER))
830 #ifndef ASM_OUTPUT_CONSTRUCTOR
831 #define ASM_OUTPUT_CONSTRUCTOR(file, name)
833 #ifndef ASM_OUTPUT_DESTRUCTOR
834 #define ASM_OUTPUT_DESTRUCTOR(file, name)
839 /* Record an element in the table of global destructors.
840 How this is done depends on what sort of assembler and linker
843 NAME should be the name of a global function to be called
844 at exit time. This name is output using assemble_name. */
847 assemble_destructor (name
)
850 #ifdef ASM_OUTPUT_DESTRUCTOR
851 ASM_OUTPUT_DESTRUCTOR (asm_out_file
, name
);
855 /* Now tell GNU LD that this is part of the static destructor set. */
856 /* This code works for any machine provided you use GNU as/ld. */
857 fprintf (asm_out_file
, "%s \"___DTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
858 assemble_name (asm_out_file
, name
);
859 fputc ('\n', asm_out_file
);
864 /* Likewise for global constructors. */
867 assemble_constructor (name
)
870 #ifdef ASM_OUTPUT_CONSTRUCTOR
871 ASM_OUTPUT_CONSTRUCTOR (asm_out_file
, name
);
875 /* Now tell GNU LD that this is part of the static constructor set. */
876 /* This code works for any machine provided you use GNU as/ld. */
877 fprintf (asm_out_file
, "%s \"___CTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
878 assemble_name (asm_out_file
, name
);
879 fputc ('\n', asm_out_file
);
884 /* Likewise for entries we want to record for garbage collection.
885 Garbage collection is still under development. */
888 assemble_gc_entry (name
)
891 #ifdef ASM_OUTPUT_GC_ENTRY
892 ASM_OUTPUT_GC_ENTRY (asm_out_file
, name
);
896 /* Now tell GNU LD that this is part of the static constructor set. */
897 fprintf (asm_out_file
, "%s \"___PTR_LIST__\",22,0,0,", ASM_STABS_OP
);
898 assemble_name (asm_out_file
, name
);
899 fputc ('\n', asm_out_file
);
904 /* CONSTANT_POOL_BEFORE_FUNCTION may be defined as an expression with
905 a non-zero value if the constant pool should be output before the
906 start of the function, or a zero value if the pool should output
907 after the end of the function. The default is to put it before the
910 #ifndef CONSTANT_POOL_BEFORE_FUNCTION
911 #define CONSTANT_POOL_BEFORE_FUNCTION 1
914 /* Output assembler code for the constant pool of a function and associated
915 with defining the name of the function. DECL describes the function.
916 NAME is the function's name. For the constant pool, we use the current
917 constant pool data. */
920 assemble_start_function (decl
, fnname
)
926 /* The following code does not need preprocessing in the assembler. */
930 if (CONSTANT_POOL_BEFORE_FUNCTION
)
931 output_constant_pool (fnname
, decl
);
933 #ifdef ASM_OUTPUT_SECTION_NAME
934 /* If the function is to be put in its own section and it's not in a section
935 already, indicate so. */
936 if ((flag_function_sections
937 && DECL_SECTION_NAME (decl
) == NULL_TREE
)
938 || UNIQUE_SECTION_P (decl
))
939 UNIQUE_SECTION (decl
, 0);
942 function_section (decl
);
944 /* Tell assembler to move to target machine's alignment for functions. */
945 align
= floor_log2 (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
947 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
949 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
950 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file
, fnname
);
953 #ifdef SDB_DEBUGGING_INFO
954 /* Output SDB definition of the function. */
955 if (write_symbols
== SDB_DEBUG
)
956 sdbout_mark_begin_function ();
959 #ifdef DBX_DEBUGGING_INFO
960 /* Output DBX definition of the function. */
961 if (write_symbols
== DBX_DEBUG
)
962 dbxout_begin_function (decl
);
965 /* Make function name accessible from other files, if appropriate. */
967 if (TREE_PUBLIC (decl
))
969 if (!first_global_object_name
&& ! DECL_WEAK (decl
)
970 && ! DECL_ONE_ONLY (decl
))
974 STRIP_NAME_ENCODING (p
, fnname
);
975 first_global_object_name
= permalloc (strlen (p
) + 1);
976 strcpy (first_global_object_name
, p
);
979 #ifdef ASM_WEAKEN_LABEL
980 if (DECL_WEAK (decl
))
981 ASM_WEAKEN_LABEL (asm_out_file
, fnname
);
984 ASM_GLOBALIZE_LABEL (asm_out_file
, fnname
);
987 /* Do any machine/system dependent processing of the function name */
988 #ifdef ASM_DECLARE_FUNCTION_NAME
989 ASM_DECLARE_FUNCTION_NAME (asm_out_file
, fnname
, current_function_decl
);
991 /* Standard thing is just output label for the function. */
992 ASM_OUTPUT_LABEL (asm_out_file
, fnname
);
993 #endif /* ASM_DECLARE_FUNCTION_NAME */
996 /* Output assembler code associated with defining the size of the
997 function. DECL describes the function. NAME is the function's name. */
1000 assemble_end_function (decl
, fnname
)
1004 #ifdef ASM_DECLARE_FUNCTION_SIZE
1005 ASM_DECLARE_FUNCTION_SIZE (asm_out_file
, fnname
, decl
);
1007 if (! CONSTANT_POOL_BEFORE_FUNCTION
)
1009 output_constant_pool (fnname
, decl
);
1010 function_section (decl
); /* need to switch back */
1013 /* Output any constants which should appear after the function. */
1014 output_after_function_constants ();
1017 /* Assemble code to leave SIZE bytes of zeros. */
1020 assemble_zeros (size
)
1023 #ifdef ASM_NO_SKIP_IN_TEXT
1024 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
1025 so we must output 0s explicitly in the text section. */
1026 if (ASM_NO_SKIP_IN_TEXT
&& in_text_section ())
1030 for (i
= 0; i
< size
- 20; i
+= 20)
1033 fprintf (asm_out_file
,
1034 "%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
);
1036 fprintf (asm_out_file
,
1037 "\tbyte 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n");
1043 fprintf (asm_out_file
, "%s 0", ASM_BYTE_OP
);
1045 fprintf (asm_out_file
, "\tbyte 0");
1048 for (; i
< size
; i
++)
1049 fprintf (asm_out_file
, ",0");
1050 fprintf (asm_out_file
, "\n");
1056 ASM_OUTPUT_SKIP (asm_out_file
, size
);
1059 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
1062 assemble_align (align
)
1065 if (align
> BITS_PER_UNIT
)
1066 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
1069 /* Assemble a string constant with the specified C string as contents. */
1072 assemble_string (p
, size
)
1080 /* If the string is very long, split it up. */
1084 int thissize
= size
- pos
;
1085 if (thissize
> maximum
)
1088 ASM_OUTPUT_ASCII (asm_out_file
, p
, thissize
);
1096 /* Assemble everything that is needed for a variable or function declaration.
1097 Not used for automatic variables, and not used for function definitions.
1098 Should not be called for variables of incomplete structure type.
1100 TOP_LEVEL is nonzero if this variable has file scope.
1101 AT_END is nonzero if this is the special handling, at end of compilation,
1102 to define things that have had only tentative definitions.
1103 DONT_OUTPUT_DATA if nonzero means don't actually output the
1104 initial value (that will be done by the caller). */
1107 assemble_variable (decl
, top_level
, at_end
, dont_output_data
)
1111 int dont_output_data
;
1113 register char *name
;
1117 enum in_section saved_in_section
;
1119 last_assemble_variable_decl
= 0;
1121 if (GET_CODE (DECL_RTL (decl
)) == REG
)
1123 /* Do output symbol info for global register variables, but do nothing
1126 if (TREE_ASM_WRITTEN (decl
))
1128 TREE_ASM_WRITTEN (decl
) = 1;
1130 #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
1131 /* File-scope global variables are output here. */
1132 if ((write_symbols
== DBX_DEBUG
|| write_symbols
== XCOFF_DEBUG
)
1134 dbxout_symbol (decl
, 0);
1136 #ifdef SDB_DEBUGGING_INFO
1137 if (write_symbols
== SDB_DEBUG
&& top_level
1138 /* Leave initialized global vars for end of compilation;
1139 see comment in compile_file. */
1140 && (TREE_PUBLIC (decl
) == 0 || DECL_INITIAL (decl
) == 0))
1141 sdbout_symbol (decl
, 0);
1144 /* Don't output any DWARF debugging information for variables here.
1145 In the case of local variables, the information for them is output
1146 when we do our recursive traversal of the tree representation for
1147 the entire containing function. In the case of file-scope variables,
1148 we output information for all of them at the very end of compilation
1149 while we are doing our final traversal of the chain of file-scope
1155 /* Normally no need to say anything here for external references,
1156 since assemble_external is called by the language-specific code
1157 when a declaration is first seen. */
1159 if (DECL_EXTERNAL (decl
))
1162 /* Output no assembler code for a function declaration.
1163 Only definitions of functions output anything. */
1165 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1168 /* If type was incomplete when the variable was declared,
1169 see if it is complete now. */
1171 if (DECL_SIZE (decl
) == 0)
1172 layout_decl (decl
, 0);
1174 /* Still incomplete => don't allocate it; treat the tentative defn
1175 (which is what it must have been) as an `extern' reference. */
1177 if (!dont_output_data
&& DECL_SIZE (decl
) == 0)
1179 error_with_file_and_line (DECL_SOURCE_FILE (decl
),
1180 DECL_SOURCE_LINE (decl
),
1181 "storage size of `%s' isn't known",
1182 IDENTIFIER_POINTER (DECL_NAME (decl
)));
1183 TREE_ASM_WRITTEN (decl
) = 1;
1187 /* The first declaration of a variable that comes through this function
1188 decides whether it is global (in C, has external linkage)
1189 or local (in C, has internal linkage). So do nothing more
1190 if this function has already run. */
1192 if (TREE_ASM_WRITTEN (decl
))
1195 TREE_ASM_WRITTEN (decl
) = 1;
1199 if (! dont_output_data
)
1203 if (TREE_CODE (DECL_SIZE (decl
)) != INTEGER_CST
)
1206 /* This is better than explicit arithmetic, since it avoids overflow. */
1207 size_tree
= size_binop (CEIL_DIV_EXPR
,
1208 DECL_SIZE (decl
), size_int (BITS_PER_UNIT
));
1210 size
= TREE_INT_CST_LOW (size_tree
);
1211 if (TREE_INT_CST_HIGH (size_tree
) != 0
1212 || size
!= TREE_INT_CST_LOW (size_tree
))
1214 error_with_decl (decl
, "size of variable `%s' is too large");
1219 name
= XSTR (XEXP (DECL_RTL (decl
), 0), 0);
1221 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
)
1222 && ! first_global_object_name
1223 && ! (DECL_COMMON (decl
) && (DECL_INITIAL (decl
) == 0
1224 || DECL_INITIAL (decl
) == error_mark_node
))
1225 && ! DECL_WEAK (decl
)
1226 && ! DECL_ONE_ONLY (decl
))
1230 STRIP_NAME_ENCODING (p
, name
);
1231 first_global_object_name
= permalloc (strlen (p
) + 1);
1232 strcpy (first_global_object_name
, p
);
1235 /* Handle uninitialized definitions. */
1237 if ((DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
)
1238 /* If the target can't output uninitialized but not common global data
1239 in .bss, then we have to use .data. */
1240 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
1241 && DECL_COMMON (decl
)
1243 && ! dont_output_data
)
1245 int size
= TREE_INT_CST_LOW (size_tree
);
1248 /* Don't allocate zero bytes of common,
1249 since that means "undefined external" in the linker. */
1250 if (size
== 0) rounded
= 1;
1251 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1252 so that each uninitialized object starts on such a boundary. */
1253 rounded
+= (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1;
1254 rounded
= (rounded
/ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1255 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1257 #ifdef DBX_DEBUGGING_INFO
1258 /* File-scope global variables are output here. */
1259 if (write_symbols
== DBX_DEBUG
&& top_level
)
1260 dbxout_symbol (decl
, 0);
1262 #ifdef SDB_DEBUGGING_INFO
1263 if (write_symbols
== SDB_DEBUG
&& top_level
1264 /* Leave initialized global vars for end of compilation;
1265 see comment in compile_file. */
1266 && (TREE_PUBLIC (decl
) == 0 || DECL_INITIAL (decl
) == 0))
1267 sdbout_symbol (decl
, 0);
1270 /* Don't output any DWARF debugging information for variables here.
1271 In the case of local variables, the information for them is output
1272 when we do our recursive traversal of the tree representation for
1273 the entire containing function. In the case of file-scope variables,
1274 we output information for all of them at the very end of compilation
1275 while we are doing our final traversal of the chain of file-scope
1278 #if 0 /* ??? We should either delete this or add a comment describing what
1279 it was intended to do and why we shouldn't delete it. */
1280 if (flag_shared_data
)
1284 if (TREE_PUBLIC (decl
)
1285 #if defined (ASM_OUTPUT_BSS) || defined (ASM_OUTPUT_ALIGNED_BSS)
1286 && DECL_COMMON (decl
)
1290 #ifdef ASM_OUTPUT_SHARED_COMMON
1291 if (flag_shared_data
)
1292 ASM_OUTPUT_SHARED_COMMON (asm_out_file
, name
, size
, rounded
);
1296 #ifdef ASM_OUTPUT_ALIGNED_DECL_COMMON
1297 ASM_OUTPUT_ALIGNED_DECL_COMMON (asm_out_file
, decl
, name
, size
,
1300 #ifdef ASM_OUTPUT_ALIGNED_COMMON
1301 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file
, name
, size
,
1304 ASM_OUTPUT_COMMON (asm_out_file
, name
, size
, rounded
);
1309 #if defined (ASM_OUTPUT_BSS) || defined (ASM_OUTPUT_ALIGNED_BSS)
1310 else if (TREE_PUBLIC (decl
))
1312 #ifdef ASM_OUTPUT_SHARED_BSS
1313 if (flag_shared_data
)
1314 ASM_OUTPUT_SHARED_BSS (asm_out_file
, decl
, name
, size
, rounded
);
1318 #ifdef ASM_OUTPUT_ALIGNED_BSS
1319 ASM_OUTPUT_ALIGNED_BSS (asm_out_file
, decl
, name
, size
,
1322 ASM_OUTPUT_BSS (asm_out_file
, decl
, name
, size
, rounded
);
1326 #endif /* ASM_OUTPUT_BSS || ASM_OUTPUT_ALIGNED_BSS */
1329 #ifdef ASM_OUTPUT_SHARED_LOCAL
1330 if (flag_shared_data
)
1331 ASM_OUTPUT_SHARED_LOCAL (asm_out_file
, name
, size
, rounded
);
1335 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
1336 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file
, decl
, name
, size
,
1339 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1340 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file
, name
, size
,
1343 ASM_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
1351 /* Handle initialized definitions.
1352 Also handle uninitialized global definitions if -fno-common and the
1353 target doesn't support ASM_OUTPUT_BSS. */
1355 /* First make the assembler name(s) global if appropriate. */
1356 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
))
1358 #ifdef ASM_WEAKEN_LABEL
1359 if (DECL_WEAK (decl
))
1360 ASM_WEAKEN_LABEL (asm_out_file
, name
);
1363 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
1366 for (d
= equivalents
; d
; d
= TREE_CHAIN (d
))
1368 tree e
= TREE_VALUE (d
);
1369 if (TREE_PUBLIC (e
) && DECL_NAME (e
))
1370 ASM_GLOBALIZE_LABEL (asm_out_file
,
1371 XSTR (XEXP (DECL_RTL (e
), 0), 0));
1375 /* Output any data that we will need to use the address of. */
1376 if (DECL_INITIAL (decl
) == error_mark_node
)
1377 reloc
= contains_pointers_p (TREE_TYPE (decl
));
1378 else if (DECL_INITIAL (decl
))
1379 reloc
= output_addressed_constants (DECL_INITIAL (decl
));
1381 #ifdef ASM_OUTPUT_SECTION_NAME
1382 if (UNIQUE_SECTION_P (decl
))
1383 UNIQUE_SECTION (decl
, reloc
);
1386 /* Switch to the appropriate section. */
1387 variable_section (decl
, reloc
);
1389 /* dbxout.c needs to know this. */
1390 if (in_text_section ())
1391 DECL_IN_TEXT_SECTION (decl
) = 1;
1393 /* Record current section so we can restore it if dbxout.c clobbers it. */
1394 saved_in_section
= in_section
;
1396 /* Output the dbx info now that we have chosen the section. */
1398 #ifdef DBX_DEBUGGING_INFO
1399 /* File-scope global variables are output here. */
1400 if (write_symbols
== DBX_DEBUG
&& top_level
)
1401 dbxout_symbol (decl
, 0);
1403 #ifdef SDB_DEBUGGING_INFO
1404 if (write_symbols
== SDB_DEBUG
&& top_level
1405 /* Leave initialized global vars for end of compilation;
1406 see comment in compile_file. */
1407 && (TREE_PUBLIC (decl
) == 0 || DECL_INITIAL (decl
) == 0))
1408 sdbout_symbol (decl
, 0);
1411 /* Don't output any DWARF debugging information for variables here.
1412 In the case of local variables, the information for them is output
1413 when we do our recursive traversal of the tree representation for
1414 the entire containing function. In the case of file-scope variables,
1415 we output information for all of them at the very end of compilation
1416 while we are doing our final traversal of the chain of file-scope
1419 /* If the debugging output changed sections, reselect the section
1420 that's supposed to be selected. */
1421 if (in_section
!= saved_in_section
)
1422 variable_section (decl
, reloc
);
1424 /* Compute and output the alignment of this data. */
1426 align
= DECL_ALIGN (decl
);
1427 /* In the case for initialing an array whose length isn't specified,
1428 where we have not yet been able to do the layout,
1429 figure out the proper alignment now. */
1430 if (dont_output_data
&& DECL_SIZE (decl
) == 0
1431 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
)
1432 align
= MAX (align
, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl
))));
1434 /* Some object file formats have a maximum alignment which they support.
1435 In particular, a.out format supports a maximum alignment of 4. */
1436 #ifndef MAX_OFILE_ALIGNMENT
1437 #define MAX_OFILE_ALIGNMENT BIGGEST_ALIGNMENT
1439 if (align
> MAX_OFILE_ALIGNMENT
)
1441 warning_with_decl (decl
,
1442 "alignment of `%s' is greater than maximum object file alignment");
1443 align
= MAX_OFILE_ALIGNMENT
;
1445 #ifdef DATA_ALIGNMENT
1446 /* On some machines, it is good to increase alignment sometimes. */
1447 align
= DATA_ALIGNMENT (TREE_TYPE (decl
), align
);
1449 #ifdef CONSTANT_ALIGNMENT
1450 if (DECL_INITIAL (decl
))
1451 align
= CONSTANT_ALIGNMENT (DECL_INITIAL (decl
), align
);
1454 /* Reset the alignment in case we have made it tighter, so we can benefit
1455 from it in get_pointer_alignment. */
1456 DECL_ALIGN (decl
) = align
;
1458 if (align
> BITS_PER_UNIT
)
1459 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
1461 /* Do any machine/system dependent processing of the object. */
1462 #ifdef ASM_DECLARE_OBJECT_NAME
1463 last_assemble_variable_decl
= decl
;
1464 ASM_DECLARE_OBJECT_NAME (asm_out_file
, name
, decl
);
1466 /* Standard thing is just output label for the object. */
1467 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1468 #endif /* ASM_DECLARE_OBJECT_NAME */
1470 if (!dont_output_data
)
1472 if (DECL_INITIAL (decl
))
1473 /* Output the actual data. */
1474 output_constant (DECL_INITIAL (decl
), TREE_INT_CST_LOW (size_tree
));
1476 /* Leave space for it. */
1477 assemble_zeros (TREE_INT_CST_LOW (size_tree
));
1481 #ifdef XCOFF_DEBUGGING_INFO
1482 /* Unfortunately, the IBM assembler cannot handle stabx before the actual
1483 declaration. When something like ".stabx "aa:S-2",aa,133,0" is emitted
1484 and `aa' hasn't been output yet, the assembler generates a stab entry with
1485 a value of zero, in addition to creating an unnecessary external entry
1486 for `aa'. Hence, we must postpone dbxout_symbol to here at the end. */
1488 /* File-scope global variables are output here. */
1489 if (write_symbols
== XCOFF_DEBUG
&& top_level
)
1491 saved_in_section
= in_section
;
1493 dbxout_symbol (decl
, 0);
1495 if (in_section
!= saved_in_section
)
1496 variable_section (decl
, reloc
);
1499 /* There must be a statement after a label. */
1504 /* Return 1 if type TYPE contains any pointers. */
1507 contains_pointers_p (type
)
1510 switch (TREE_CODE (type
))
1513 case REFERENCE_TYPE
:
1514 /* I'm not sure whether OFFSET_TYPE needs this treatment,
1515 so I'll play safe and return 1. */
1521 case QUAL_UNION_TYPE
:
1524 /* For a type that has fields, see if the fields have pointers. */
1525 for (fields
= TYPE_FIELDS (type
); fields
; fields
= TREE_CHAIN (fields
))
1526 if (TREE_CODE (fields
) == FIELD_DECL
1527 && contains_pointers_p (TREE_TYPE (fields
)))
1533 /* An array type contains pointers if its element type does. */
1534 return contains_pointers_p (TREE_TYPE (type
));
1541 /* Output something to declare an external symbol to the assembler.
1542 (Most assemblers don't need this, so we normally output nothing.)
1543 Do nothing if DECL is not external. */
1546 assemble_external (decl
)
1549 #ifdef ASM_OUTPUT_EXTERNAL
1550 if (TREE_CODE_CLASS (TREE_CODE (decl
)) == 'd'
1551 && DECL_EXTERNAL (decl
) && TREE_PUBLIC (decl
))
1553 rtx rtl
= DECL_RTL (decl
);
1555 if (GET_CODE (rtl
) == MEM
&& GET_CODE (XEXP (rtl
, 0)) == SYMBOL_REF
1556 && ! SYMBOL_REF_USED (XEXP (rtl
, 0)))
1558 /* Some systems do require some output. */
1559 SYMBOL_REF_USED (XEXP (rtl
, 0)) = 1;
1560 ASM_OUTPUT_EXTERNAL (asm_out_file
, decl
, XSTR (XEXP (rtl
, 0), 0));
1566 /* Similar, for calling a library function FUN. */
1569 assemble_external_libcall (fun
)
1572 #ifdef ASM_OUTPUT_EXTERNAL_LIBCALL
1573 /* Declare library function name external when first used, if nec. */
1574 if (! SYMBOL_REF_USED (fun
))
1576 SYMBOL_REF_USED (fun
) = 1;
1577 ASM_OUTPUT_EXTERNAL_LIBCALL (asm_out_file
, fun
);
1582 /* Declare the label NAME global. */
1585 assemble_global (name
)
1588 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
1591 /* Assemble a label named NAME. */
1594 assemble_label (name
)
1597 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1600 /* Output to FILE a reference to the assembler name of a C-level name NAME.
1601 If NAME starts with a *, the rest of NAME is output verbatim.
1602 Otherwise NAME is transformed in an implementation-defined way
1603 (usually by the addition of an underscore).
1604 Many macros in the tm file are defined to call this function. */
1607 assemble_name (file
, name
)
1614 STRIP_NAME_ENCODING (real_name
, name
);
1615 if (flag_prefix_function_name
1616 && ! bcmp (real_name
, CHKR_PREFIX
, CHKR_PREFIX_SIZE
))
1617 real_name
= real_name
+ CHKR_PREFIX_SIZE
;
1619 id
= maybe_get_identifier (real_name
);
1621 TREE_SYMBOL_REFERENCED (id
) = 1;
1624 fputs (&name
[1], file
);
1626 ASM_OUTPUT_LABELREF (file
, name
);
1629 /* Allocate SIZE bytes writable static space with a gensym name
1630 and return an RTX to refer to its address. */
1633 assemble_static_space (size
)
1639 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1640 so that each uninitialized object starts on such a boundary. */
1641 int rounded
= ((size
+ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1)
1642 / (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1643 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1646 if (flag_shared_data
)
1650 ASM_GENERATE_INTERNAL_LABEL (name
, "LF", const_labelno
);
1653 namestring
= (char *) obstack_alloc (saveable_obstack
,
1655 strcpy (namestring
, name
);
1657 x
= gen_rtx_SYMBOL_REF (Pmode
, namestring
);
1659 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
1660 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file
, NULL_TREE
, name
, size
,
1663 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1664 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file
, name
, size
, BIGGEST_ALIGNMENT
);
1666 ASM_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
1672 /* Assemble the static constant template for function entry trampolines.
1673 This is done at most once per compilation.
1674 Returns an RTX for the address of the template. */
1676 #ifdef TRAMPOLINE_TEMPLATE
1678 assemble_trampoline_template ()
1684 /* By default, put trampoline templates in read-only data section. */
1686 #ifdef TRAMPOLINE_SECTION
1687 TRAMPOLINE_SECTION ();
1689 readonly_data_section ();
1692 /* Write the assembler code to define one. */
1693 align
= floor_log2 (TRAMPOLINE_ALIGNMENT
/ BITS_PER_UNIT
);
1695 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1697 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LTRAMP", 0);
1698 TRAMPOLINE_TEMPLATE (asm_out_file
);
1700 /* Record the rtl to refer to it. */
1701 ASM_GENERATE_INTERNAL_LABEL (label
, "LTRAMP", 0);
1703 = (char *) obstack_copy0 (&permanent_obstack
, label
, strlen (label
));
1704 return gen_rtx_SYMBOL_REF (Pmode
, name
);
1708 /* Assemble the integer constant X into an object of SIZE bytes.
1709 X must be either a CONST_INT or CONST_DOUBLE.
1711 Return 1 if we were able to output the constant, otherwise 0. If FORCE is
1712 non-zero, abort if we can't output the constant. */
1715 assemble_integer (x
, size
, force
)
1720 /* First try to use the standard 1, 2, 4, 8, and 16 byte
1721 ASM_OUTPUT... macros. */
1725 #ifdef ASM_OUTPUT_CHAR
1727 ASM_OUTPUT_CHAR (asm_out_file
, x
);
1731 #ifdef ASM_OUTPUT_SHORT
1733 ASM_OUTPUT_SHORT (asm_out_file
, x
);
1737 #ifdef ASM_OUTPUT_INT
1739 ASM_OUTPUT_INT (asm_out_file
, x
);
1743 #ifdef ASM_OUTPUT_DOUBLE_INT
1745 ASM_OUTPUT_DOUBLE_INT (asm_out_file
, x
);
1749 #ifdef ASM_OUTPUT_QUADRUPLE_INT
1751 ASM_OUTPUT_QUADRUPLE_INT (asm_out_file
, x
);
1756 /* If we couldn't do it that way, there are two other possibilities: First,
1757 if the machine can output an explicit byte and this is a 1 byte constant,
1758 we can use ASM_OUTPUT_BYTE. */
1760 #ifdef ASM_OUTPUT_BYTE
1761 if (size
== 1 && GET_CODE (x
) == CONST_INT
)
1763 ASM_OUTPUT_BYTE (asm_out_file
, INTVAL (x
));
1768 /* Finally, if SIZE is larger than a single word, try to output the constant
1769 one word at a time. */
1771 if (size
> UNITS_PER_WORD
)
1774 enum machine_mode mode
1775 = mode_for_size (size
* BITS_PER_UNIT
, MODE_INT
, 0);
1778 for (i
= 0; i
< size
/ UNITS_PER_WORD
; i
++)
1780 word
= operand_subword (x
, i
, 0, mode
);
1785 if (! assemble_integer (word
, UNITS_PER_WORD
, 0))
1789 if (i
== size
/ UNITS_PER_WORD
)
1791 /* If we output at least one word and then could not finish,
1792 there is no valid way to continue. */
1803 /* Assemble the floating-point constant D into an object of size MODE. */
1806 assemble_real (d
, mode
)
1808 enum machine_mode mode
;
1810 jmp_buf output_constant_handler
;
1812 if (setjmp (output_constant_handler
))
1814 error ("floating point trap outputting a constant");
1815 #ifdef REAL_IS_NOT_DOUBLE
1816 bzero ((char *) &d
, sizeof d
);
1823 set_float_handler (output_constant_handler
);
1827 #ifdef ASM_OUTPUT_BYTE_FLOAT
1829 ASM_OUTPUT_BYTE_FLOAT (asm_out_file
, d
);
1832 #ifdef ASM_OUTPUT_SHORT_FLOAT
1834 ASM_OUTPUT_SHORT_FLOAT (asm_out_file
, d
);
1837 #ifdef ASM_OUTPUT_THREE_QUARTER_FLOAT
1839 ASM_OUTPUT_THREE_QUARTER_FLOAT (asm_out_file
, d
);
1842 #ifdef ASM_OUTPUT_FLOAT
1844 ASM_OUTPUT_FLOAT (asm_out_file
, d
);
1848 #ifdef ASM_OUTPUT_DOUBLE
1850 ASM_OUTPUT_DOUBLE (asm_out_file
, d
);
1854 #ifdef ASM_OUTPUT_LONG_DOUBLE
1857 ASM_OUTPUT_LONG_DOUBLE (asm_out_file
, d
);
1865 set_float_handler (NULL_PTR
);
1868 /* Here we combine duplicate floating constants to make
1869 CONST_DOUBLE rtx's, and force those out to memory when necessary. */
1871 /* Chain of all CONST_DOUBLE rtx's constructed for the current function.
1872 They are chained through the CONST_DOUBLE_CHAIN.
1873 A CONST_DOUBLE rtx has CONST_DOUBLE_MEM != cc0_rtx iff it is on this chain.
1874 In that case, CONST_DOUBLE_MEM is either a MEM,
1875 or const0_rtx if no MEM has been made for this CONST_DOUBLE yet.
1877 (CONST_DOUBLE_MEM is used only for top-level functions.
1878 See force_const_mem for explanation.) */
1880 static rtx const_double_chain
;
1882 /* Return a CONST_DOUBLE or CONST_INT for a value specified as a pair of ints.
1883 For an integer, I0 is the low-order word and I1 is the high-order word.
1884 For a real number, I0 is the word with the low address
1885 and I1 is the word with the high address. */
1888 immed_double_const (i0
, i1
, mode
)
1889 HOST_WIDE_INT i0
, i1
;
1890 enum machine_mode mode
;
1893 int in_current_obstack
;
1895 if (GET_MODE_CLASS (mode
) == MODE_INT
1896 || GET_MODE_CLASS (mode
) == MODE_PARTIAL_INT
)
1898 /* We clear out all bits that don't belong in MODE, unless they and our
1899 sign bit are all one. So we get either a reasonable negative value
1900 or a reasonable unsigned value for this mode. */
1901 int width
= GET_MODE_BITSIZE (mode
);
1902 if (width
< HOST_BITS_PER_WIDE_INT
1903 && ((i0
& ((HOST_WIDE_INT
) (-1) << (width
- 1)))
1904 != ((HOST_WIDE_INT
) (-1) << (width
- 1))))
1905 i0
&= ((HOST_WIDE_INT
) 1 << width
) - 1, i1
= 0;
1906 else if (width
== HOST_BITS_PER_WIDE_INT
1907 && ! (i1
== ~0 && i0
< 0))
1909 else if (width
> 2 * HOST_BITS_PER_WIDE_INT
)
1910 /* We cannot represent this value as a constant. */
1913 /* If this would be an entire word for the target, but is not for
1914 the host, then sign-extend on the host so that the number will look
1915 the same way on the host that it would on the target.
1917 For example, when building a 64 bit alpha hosted 32 bit sparc
1918 targeted compiler, then we want the 32 bit unsigned value -1 to be
1919 represented as a 64 bit value -1, and not as 0x00000000ffffffff.
1920 The later confuses the sparc backend. */
1922 if (BITS_PER_WORD
< HOST_BITS_PER_WIDE_INT
&& BITS_PER_WORD
== width
1923 && (i0
& ((HOST_WIDE_INT
) 1 << (width
- 1))))
1924 i0
|= ((HOST_WIDE_INT
) (-1) << width
);
1926 /* If MODE fits within HOST_BITS_PER_WIDE_INT, always use a CONST_INT.
1928 ??? Strictly speaking, this is wrong if we create a CONST_INT
1929 for a large unsigned constant with the size of MODE being
1930 HOST_BITS_PER_WIDE_INT and later try to interpret that constant in a
1931 wider mode. In that case we will mis-interpret it as a negative
1934 Unfortunately, the only alternative is to make a CONST_DOUBLE
1935 for any constant in any mode if it is an unsigned constant larger
1936 than the maximum signed integer in an int on the host. However,
1937 doing this will break everyone that always expects to see a CONST_INT
1938 for SImode and smaller.
1940 We have always been making CONST_INTs in this case, so nothing new
1943 if (width
<= HOST_BITS_PER_WIDE_INT
)
1944 i1
= (i0
< 0) ? ~(HOST_WIDE_INT
) 0 : 0;
1946 /* If this integer fits in one word, return a CONST_INT. */
1947 if ((i1
== 0 && i0
>= 0)
1948 || (i1
== ~0 && i0
< 0))
1949 return GEN_INT (i0
);
1951 /* We use VOIDmode for integers. */
1955 /* Search the chain for an existing CONST_DOUBLE with the right value.
1956 If one is found, return it. */
1958 for (r
= const_double_chain
; r
; r
= CONST_DOUBLE_CHAIN (r
))
1959 if (CONST_DOUBLE_LOW (r
) == i0
&& CONST_DOUBLE_HIGH (r
) == i1
1960 && GET_MODE (r
) == mode
)
1963 /* No; make a new one and add it to the chain.
1965 We may be called by an optimizer which may be discarding any memory
1966 allocated during its processing (such as combine and loop). However,
1967 we will be leaving this constant on the chain, so we cannot tolerate
1968 freed memory. So switch to saveable_obstack for this allocation
1969 and then switch back if we were in current_obstack. */
1971 push_obstacks_nochange ();
1972 rtl_in_saveable_obstack ();
1973 r
= gen_rtx_CONST_DOUBLE (mode
, NULL_RTX
, i0
, i1
);
1976 /* Don't touch const_double_chain in nested function; see force_const_mem.
1977 Also, don't touch it if not inside any function. */
1978 if (outer_function_chain
== 0 && current_function_decl
!= 0)
1980 CONST_DOUBLE_CHAIN (r
) = const_double_chain
;
1981 const_double_chain
= r
;
1984 /* Store const0_rtx in mem-slot since this CONST_DOUBLE is on the chain.
1985 Actual use of mem-slot is only through force_const_mem. */
1987 CONST_DOUBLE_MEM (r
) = const0_rtx
;
1992 /* Return a CONST_DOUBLE for a specified `double' value
1993 and machine mode. */
1996 immed_real_const_1 (d
, mode
)
1998 enum machine_mode mode
;
2000 union real_extract u
;
2002 int in_current_obstack
;
2004 /* Get the desired `double' value as a sequence of ints
2005 since that is how they are stored in a CONST_DOUBLE. */
2009 /* Detect special cases. */
2011 if (REAL_VALUES_IDENTICAL (dconst0
, d
))
2012 return CONST0_RTX (mode
);
2013 /* Check for NaN first, because some ports (specifically the i386) do not
2014 emit correct ieee-fp code by default, and thus will generate a core
2015 dump here if we pass a NaN to REAL_VALUES_EQUAL and if REAL_VALUES_EQUAL
2016 does a floating point comparison. */
2017 else if (! REAL_VALUE_ISNAN (d
) && REAL_VALUES_EQUAL (dconst1
, d
))
2018 return CONST1_RTX (mode
);
2020 if (sizeof u
== 2 * sizeof (HOST_WIDE_INT
))
2021 return immed_double_const (u
.i
[0], u
.i
[1], mode
);
2023 /* The rest of this function handles the case where
2024 a float value requires more than 2 ints of space.
2025 It will be deleted as dead code on machines that don't need it. */
2027 /* Search the chain for an existing CONST_DOUBLE with the right value.
2028 If one is found, return it. */
2030 for (r
= const_double_chain
; r
; r
= CONST_DOUBLE_CHAIN (r
))
2031 if (! bcmp ((char *) &CONST_DOUBLE_LOW (r
), (char *) &u
, sizeof u
)
2032 && GET_MODE (r
) == mode
)
2035 /* No; make a new one and add it to the chain.
2037 We may be called by an optimizer which may be discarding any memory
2038 allocated during its processing (such as combine and loop). However,
2039 we will be leaving this constant on the chain, so we cannot tolerate
2040 freed memory. So switch to saveable_obstack for this allocation
2041 and then switch back if we were in current_obstack. */
2043 push_obstacks_nochange ();
2044 rtl_in_saveable_obstack ();
2045 r
= rtx_alloc (CONST_DOUBLE
);
2047 bcopy ((char *) &u
, (char *) &CONST_DOUBLE_LOW (r
), sizeof u
);
2050 /* Don't touch const_double_chain in nested function; see force_const_mem.
2051 Also, don't touch it if not inside any function. */
2052 if (outer_function_chain
== 0 && current_function_decl
!= 0)
2054 CONST_DOUBLE_CHAIN (r
) = const_double_chain
;
2055 const_double_chain
= r
;
2058 /* Store const0_rtx in CONST_DOUBLE_MEM since this CONST_DOUBLE is on the
2059 chain, but has not been allocated memory. Actual use of CONST_DOUBLE_MEM
2060 is only through force_const_mem. */
2062 CONST_DOUBLE_MEM (r
) = const0_rtx
;
2067 /* Return a CONST_DOUBLE rtx for a value specified by EXP,
2068 which must be a REAL_CST tree node. */
2071 immed_real_const (exp
)
2074 return immed_real_const_1 (TREE_REAL_CST (exp
), TYPE_MODE (TREE_TYPE (exp
)));
2077 /* At the end of a function, forget the memory-constants
2078 previously made for CONST_DOUBLEs. Mark them as not on real_constant_chain.
2079 Also clear out real_constant_chain and clear out all the chain-pointers. */
2082 clear_const_double_mem ()
2084 register rtx r
, next
;
2086 /* Don't touch CONST_DOUBLE_MEM for nested functions.
2087 See force_const_mem for explanation. */
2088 if (outer_function_chain
!= 0)
2091 for (r
= const_double_chain
; r
; r
= next
)
2093 next
= CONST_DOUBLE_CHAIN (r
);
2094 CONST_DOUBLE_CHAIN (r
) = 0;
2095 CONST_DOUBLE_MEM (r
) = cc0_rtx
;
2097 const_double_chain
= 0;
2100 /* Given an expression EXP with a constant value,
2101 reduce it to the sum of an assembler symbol and an integer.
2102 Store them both in the structure *VALUE.
2103 Abort if EXP does not reduce. */
2108 HOST_WIDE_INT offset
;
2112 decode_addr_const (exp
, value
)
2114 struct addr_const
*value
;
2116 register tree target
= TREE_OPERAND (exp
, 0);
2117 register int offset
= 0;
2122 if (TREE_CODE (target
) == COMPONENT_REF
2123 && (TREE_CODE (DECL_FIELD_BITPOS (TREE_OPERAND (target
, 1)))
2126 offset
+= TREE_INT_CST_LOW (DECL_FIELD_BITPOS (TREE_OPERAND (target
, 1))) / BITS_PER_UNIT
;
2127 target
= TREE_OPERAND (target
, 0);
2129 else if (TREE_CODE (target
) == ARRAY_REF
)
2131 if (TREE_CODE (TREE_OPERAND (target
, 1)) != INTEGER_CST
2132 || TREE_CODE (TYPE_SIZE (TREE_TYPE (target
))) != INTEGER_CST
)
2134 offset
+= ((TREE_INT_CST_LOW (TYPE_SIZE (TREE_TYPE (target
)))
2135 * TREE_INT_CST_LOW (TREE_OPERAND (target
, 1)))
2137 target
= TREE_OPERAND (target
, 0);
2143 switch (TREE_CODE (target
))
2147 x
= DECL_RTL (target
);
2151 x
= gen_rtx_MEM (FUNCTION_MODE
,
2152 gen_rtx_LABEL_REF (VOIDmode
,
2153 label_rtx (TREE_OPERAND (exp
, 0))));
2161 x
= TREE_CST_RTL (target
);
2168 if (GET_CODE (x
) != MEM
)
2173 value
->offset
= offset
;
2176 /* Uniquize all constants that appear in memory.
2177 Each constant in memory thus far output is recorded
2178 in `const_hash_table' with a `struct constant_descriptor'
2179 that contains a polish representation of the value of
2182 We cannot store the trees in the hash table
2183 because the trees may be temporary. */
2185 struct constant_descriptor
2187 struct constant_descriptor
*next
;
2193 #define MAX_HASH_TABLE 1009
2194 static struct constant_descriptor
*const_hash_table
[MAX_HASH_TABLE
];
2196 /* Compute a hash code for a constant expression. */
2203 register int len
, hi
, i
;
2204 register enum tree_code code
= TREE_CODE (exp
);
2206 /* Either set P and LEN to the address and len of something to hash and
2207 exit the switch or return a value. */
2212 p
= (char *) &TREE_INT_CST_LOW (exp
);
2213 len
= 2 * sizeof TREE_INT_CST_LOW (exp
);
2217 p
= (char *) &TREE_REAL_CST (exp
);
2218 len
= sizeof TREE_REAL_CST (exp
);
2222 p
= TREE_STRING_POINTER (exp
);
2223 len
= TREE_STRING_LENGTH (exp
);
2227 return (const_hash (TREE_REALPART (exp
)) * 5
2228 + const_hash (TREE_IMAGPART (exp
)));
2231 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2233 len
= int_size_in_bytes (TREE_TYPE (exp
));
2234 p
= (char *) alloca (len
);
2235 get_set_constructor_bytes (exp
, (unsigned char *) p
, len
);
2242 /* For record type, include the type in the hashing.
2243 We do not do so for array types
2244 because (1) the sizes of the elements are sufficient
2245 and (2) distinct array types can have the same constructor.
2246 Instead, we include the array size because the constructor could
2248 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2249 hi
= ((unsigned long) TREE_TYPE (exp
) & ((1 << HASHBITS
) - 1))
2252 hi
= ((5 + int_size_in_bytes (TREE_TYPE (exp
)))
2253 & ((1 << HASHBITS
) - 1)) % MAX_HASH_TABLE
;
2255 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2256 if (TREE_VALUE (link
))
2258 = (hi
* 603 + const_hash (TREE_VALUE (link
))) % MAX_HASH_TABLE
;
2265 struct addr_const value
;
2267 decode_addr_const (exp
, &value
);
2268 if (GET_CODE (value
.base
) == SYMBOL_REF
)
2270 /* Don't hash the address of the SYMBOL_REF;
2271 only use the offset and the symbol name. */
2273 p
= XSTR (value
.base
, 0);
2274 for (i
= 0; p
[i
] != 0; i
++)
2275 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2277 else if (GET_CODE (value
.base
) == LABEL_REF
)
2278 hi
= value
.offset
+ CODE_LABEL_NUMBER (XEXP (value
.base
, 0)) * 13;
2280 hi
&= (1 << HASHBITS
) - 1;
2281 hi
%= MAX_HASH_TABLE
;
2287 return (const_hash (TREE_OPERAND (exp
, 0)) * 9
2288 + const_hash (TREE_OPERAND (exp
, 1)));
2292 case NON_LVALUE_EXPR
:
2293 return const_hash (TREE_OPERAND (exp
, 0)) * 7 + 2;
2299 /* Compute hashing function */
2301 for (i
= 0; i
< len
; i
++)
2302 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2304 hi
&= (1 << HASHBITS
) - 1;
2305 hi
%= MAX_HASH_TABLE
;
2309 /* Compare a constant expression EXP with a constant-descriptor DESC.
2310 Return 1 if DESC describes a constant with the same value as EXP. */
2313 compare_constant (exp
, desc
)
2315 struct constant_descriptor
*desc
;
2317 return 0 != compare_constant_1 (exp
, desc
->contents
);
2320 /* Compare constant expression EXP with a substring P of a constant descriptor.
2321 If they match, return a pointer to the end of the substring matched.
2322 If they do not match, return 0.
2324 Since descriptors are written in polish prefix notation,
2325 this function can be used recursively to test one operand of EXP
2326 against a subdescriptor, and if it succeeds it returns the
2327 address of the subdescriptor for the next operand. */
2330 compare_constant_1 (exp
, p
)
2334 register char *strp
;
2336 register enum tree_code code
= TREE_CODE (exp
);
2338 if (code
!= (enum tree_code
) *p
++)
2341 /* Either set STRP, P and LEN to pointers and length to compare and exit the
2342 switch, or return the result of the comparison. */
2347 /* Integer constants are the same only if the same width of type. */
2348 if (*p
++ != TYPE_PRECISION (TREE_TYPE (exp
)))
2351 strp
= (char *) &TREE_INT_CST_LOW (exp
);
2352 len
= 2 * sizeof TREE_INT_CST_LOW (exp
);
2356 /* Real constants are the same only if the same width of type. */
2357 if (*p
++ != TYPE_PRECISION (TREE_TYPE (exp
)))
2360 strp
= (char *) &TREE_REAL_CST (exp
);
2361 len
= sizeof TREE_REAL_CST (exp
);
2365 if (flag_writable_strings
)
2368 if (*p
++ != TYPE_MODE (TREE_TYPE (exp
)))
2371 strp
= TREE_STRING_POINTER (exp
);
2372 len
= TREE_STRING_LENGTH (exp
);
2373 if (bcmp ((char *) &TREE_STRING_LENGTH (exp
), p
,
2374 sizeof TREE_STRING_LENGTH (exp
)))
2377 p
+= sizeof TREE_STRING_LENGTH (exp
);
2381 p
= compare_constant_1 (TREE_REALPART (exp
), p
);
2385 return compare_constant_1 (TREE_IMAGPART (exp
), p
);
2388 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2390 int xlen
= len
= int_size_in_bytes (TREE_TYPE (exp
));
2392 strp
= (char *) alloca (len
);
2393 get_set_constructor_bytes (exp
, (unsigned char *) strp
, len
);
2394 if (bcmp ((char *) &xlen
, p
, sizeof xlen
))
2403 int length
= list_length (CONSTRUCTOR_ELTS (exp
));
2406 if (bcmp ((char *) &length
, p
, sizeof length
))
2411 /* For record constructors, insist that the types match.
2412 For arrays, just verify both constructors are for arrays. */
2413 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2414 type
= TREE_TYPE (exp
);
2418 if (bcmp ((char *) &type
, p
, sizeof type
))
2423 /* For arrays, insist that the size in bytes match. */
2424 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2426 int size
= int_size_in_bytes (TREE_TYPE (exp
));
2427 if (bcmp ((char *) &size
, p
, sizeof size
))
2433 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2435 if (TREE_VALUE (link
))
2437 if ((p
= compare_constant_1 (TREE_VALUE (link
), p
)) == 0)
2444 if (bcmp ((char *) &zero
, p
, sizeof zero
))
2456 struct addr_const value
;
2458 decode_addr_const (exp
, &value
);
2459 strp
= (char *) &value
.offset
;
2460 len
= sizeof value
.offset
;
2461 /* Compare the offset. */
2463 if (*p
++ != *strp
++)
2466 /* Compare symbol name. */
2467 strp
= XSTR (value
.base
, 0);
2468 len
= strlen (strp
) + 1;
2474 p
= compare_constant_1 (TREE_OPERAND (exp
, 0), p
);
2478 return compare_constant_1 (TREE_OPERAND (exp
, 1), p
);
2482 case NON_LVALUE_EXPR
:
2483 return compare_constant_1 (TREE_OPERAND (exp
, 0), p
);
2489 /* Compare constant contents. */
2491 if (*p
++ != *strp
++)
2497 /* Construct a constant descriptor for the expression EXP.
2498 It is up to the caller to enter the descriptor in the hash table. */
2500 static struct constant_descriptor
*
2501 record_constant (exp
)
2504 struct constant_descriptor
*next
= 0;
2507 /* Make a struct constant_descriptor. The first two pointers will
2508 be filled in later. Here we just leave space for them. */
2510 obstack_grow (&permanent_obstack
, (char *) &next
, sizeof next
);
2511 obstack_grow (&permanent_obstack
, (char *) &label
, sizeof label
);
2512 record_constant_1 (exp
);
2513 return (struct constant_descriptor
*) obstack_finish (&permanent_obstack
);
2516 /* Add a description of constant expression EXP
2517 to the object growing in `permanent_obstack'.
2518 No need to return its address; the caller will get that
2519 from the obstack when the object is complete. */
2522 record_constant_1 (exp
)
2525 register char *strp
;
2527 register enum tree_code code
= TREE_CODE (exp
);
2529 obstack_1grow (&permanent_obstack
, (unsigned int) code
);
2534 obstack_1grow (&permanent_obstack
, TYPE_PRECISION (TREE_TYPE (exp
)));
2535 strp
= (char *) &TREE_INT_CST_LOW (exp
);
2536 len
= 2 * sizeof TREE_INT_CST_LOW (exp
);
2540 obstack_1grow (&permanent_obstack
, TYPE_PRECISION (TREE_TYPE (exp
)));
2541 strp
= (char *) &TREE_REAL_CST (exp
);
2542 len
= sizeof TREE_REAL_CST (exp
);
2546 if (flag_writable_strings
)
2549 obstack_1grow (&permanent_obstack
, TYPE_MODE (TREE_TYPE (exp
)));
2550 strp
= TREE_STRING_POINTER (exp
);
2551 len
= TREE_STRING_LENGTH (exp
);
2552 obstack_grow (&permanent_obstack
, (char *) &TREE_STRING_LENGTH (exp
),
2553 sizeof TREE_STRING_LENGTH (exp
));
2557 record_constant_1 (TREE_REALPART (exp
));
2558 record_constant_1 (TREE_IMAGPART (exp
));
2562 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2564 int nbytes
= int_size_in_bytes (TREE_TYPE (exp
));
2565 obstack_grow (&permanent_obstack
, &nbytes
, sizeof (nbytes
));
2566 obstack_blank (&permanent_obstack
, nbytes
);
2567 get_set_constructor_bytes
2568 (exp
, (unsigned char *) permanent_obstack
.next_free
-nbytes
,
2575 int length
= list_length (CONSTRUCTOR_ELTS (exp
));
2578 obstack_grow (&permanent_obstack
, (char *) &length
, sizeof length
);
2580 /* For record constructors, insist that the types match.
2581 For arrays, just verify both constructors are for arrays. */
2582 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2583 type
= TREE_TYPE (exp
);
2586 obstack_grow (&permanent_obstack
, (char *) &type
, 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 obstack_grow (&permanent_obstack
, (char *) &size
, sizeof size
);
2595 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2597 if (TREE_VALUE (link
))
2598 record_constant_1 (TREE_VALUE (link
));
2603 obstack_grow (&permanent_obstack
,
2604 (char *) &zero
, sizeof zero
);
2612 struct addr_const value
;
2614 decode_addr_const (exp
, &value
);
2615 /* Record the offset. */
2616 obstack_grow (&permanent_obstack
,
2617 (char *) &value
.offset
, sizeof value
.offset
);
2618 /* Record the symbol name. */
2619 obstack_grow (&permanent_obstack
, XSTR (value
.base
, 0),
2620 strlen (XSTR (value
.base
, 0)) + 1);
2626 record_constant_1 (TREE_OPERAND (exp
, 0));
2627 record_constant_1 (TREE_OPERAND (exp
, 1));
2632 case NON_LVALUE_EXPR
:
2633 record_constant_1 (TREE_OPERAND (exp
, 0));
2640 /* Record constant contents. */
2641 obstack_grow (&permanent_obstack
, strp
, len
);
2644 /* Record a list of constant expressions that were passed to
2645 output_constant_def but that could not be output right away. */
2647 struct deferred_constant
2649 struct deferred_constant
*next
;
2655 static struct deferred_constant
*deferred_constants
;
2657 /* Another list of constants which should be output after the
2659 static struct deferred_constant
*after_function_constants
;
2661 /* Nonzero means defer output of addressed subconstants
2662 (i.e., those for which output_constant_def is called.) */
2663 static int defer_addressed_constants_flag
;
2665 /* Start deferring output of subconstants. */
2668 defer_addressed_constants ()
2670 defer_addressed_constants_flag
++;
2673 /* Stop deferring output of subconstants,
2674 and output now all those that have been deferred. */
2677 output_deferred_addressed_constants ()
2679 struct deferred_constant
*p
, *next
;
2681 defer_addressed_constants_flag
--;
2683 if (defer_addressed_constants_flag
> 0)
2686 for (p
= deferred_constants
; p
; p
= next
)
2688 output_constant_def_contents (p
->exp
, p
->reloc
, p
->labelno
);
2693 deferred_constants
= 0;
2696 /* Output any constants which should appear after a function. */
2699 output_after_function_constants ()
2701 struct deferred_constant
*p
, *next
;
2703 for (p
= after_function_constants
; p
; p
= next
)
2705 output_constant_def_contents (p
->exp
, p
->reloc
, p
->labelno
);
2710 after_function_constants
= 0;
2713 /* Make a copy of the whole tree structure for a constant.
2714 This handles the same types of nodes that compare_constant
2715 and record_constant handle. */
2721 switch (TREE_CODE (exp
))
2724 /* For ADDR_EXPR, we do not want to copy the decl whose address
2725 is requested. We do want to copy constants though. */
2726 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, 0))) == 'c')
2727 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2728 copy_constant (TREE_OPERAND (exp
, 0)));
2730 return copy_node (exp
);
2735 return copy_node (exp
);
2738 return build_complex (TREE_TYPE (exp
),
2739 copy_constant (TREE_REALPART (exp
)),
2740 copy_constant (TREE_IMAGPART (exp
)));
2744 return build (TREE_CODE (exp
), TREE_TYPE (exp
),
2745 copy_constant (TREE_OPERAND (exp
, 0)),
2746 copy_constant (TREE_OPERAND (exp
, 1)));
2750 case NON_LVALUE_EXPR
:
2751 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2752 copy_constant (TREE_OPERAND (exp
, 0)));
2756 tree copy
= copy_node (exp
);
2757 tree list
= copy_list (CONSTRUCTOR_ELTS (exp
));
2760 CONSTRUCTOR_ELTS (copy
) = list
;
2761 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
2762 TREE_VALUE (tail
) = copy_constant (TREE_VALUE (tail
));
2763 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2764 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
2765 TREE_PURPOSE (tail
) = copy_constant (TREE_PURPOSE (tail
));
2775 /* Return an rtx representing a reference to constant data in memory
2776 for the constant expression EXP.
2778 If assembler code for such a constant has already been output,
2779 return an rtx to refer to it.
2780 Otherwise, output such a constant in memory (or defer it for later)
2781 and generate an rtx for it.
2783 The TREE_CST_RTL of EXP is set up to point to that rtx.
2784 The const_hash_table records which constants already have label strings. */
2787 output_constant_def (exp
)
2791 register struct constant_descriptor
*desc
;
2797 if (TREE_CST_RTL (exp
))
2798 return TREE_CST_RTL (exp
);
2800 /* Make sure any other constants whose addresses appear in EXP
2801 are assigned label numbers. */
2803 reloc
= output_addressed_constants (exp
);
2805 /* Compute hash code of EXP. Search the descriptors for that hash code
2806 to see if any of them describes EXP. If yes, the descriptor records
2807 the label number already assigned. */
2809 hash
= const_hash (exp
) % MAX_HASH_TABLE
;
2811 for (desc
= const_hash_table
[hash
]; desc
; desc
= desc
->next
)
2812 if (compare_constant (exp
, desc
))
2814 found
= desc
->label
;
2820 /* No constant equal to EXP is known to have been output.
2821 Make a constant descriptor to enter EXP in the hash table.
2822 Assign the label number and record it in the descriptor for
2823 future calls to this function to find. */
2825 /* Create a string containing the label name, in LABEL. */
2826 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
2828 desc
= record_constant (exp
);
2829 desc
->next
= const_hash_table
[hash
];
2831 = (char *) obstack_copy0 (&permanent_obstack
, label
, strlen (label
));
2832 const_hash_table
[hash
] = desc
;
2836 /* Create a string containing the label name, in LABEL. */
2837 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
2840 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
2842 push_obstacks_nochange ();
2843 if (TREE_PERMANENT (exp
))
2844 end_temporary_allocation ();
2846 def
= gen_rtx_SYMBOL_REF (Pmode
, desc
->label
);
2849 = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp
)), def
);
2850 RTX_UNCHANGING_P (TREE_CST_RTL (exp
)) = 1;
2851 if (AGGREGATE_TYPE_P (TREE_TYPE (exp
)))
2852 MEM_IN_STRUCT_P (TREE_CST_RTL (exp
)) = 1;
2856 /* Optionally set flags or add text to the name to record information
2857 such as that it is a function name. If the name is changed, the macro
2858 ASM_OUTPUT_LABELREF will have to know how to strip this information. */
2859 #ifdef ENCODE_SECTION_INFO
2860 ENCODE_SECTION_INFO (exp
);
2863 /* If this is the first time we've seen this particular constant,
2864 output it (or defer its output for later). */
2867 int after_function
= 0;
2869 #ifdef CONSTANT_AFTER_FUNCTION_P
2870 if (current_function_decl
!= 0
2871 && CONSTANT_AFTER_FUNCTION_P (exp
))
2875 if (defer_addressed_constants_flag
|| after_function
)
2877 struct deferred_constant
*p
;
2878 p
= (struct deferred_constant
*) xmalloc (sizeof (struct deferred_constant
));
2880 push_obstacks_nochange ();
2881 suspend_momentary ();
2882 p
->exp
= copy_constant (exp
);
2885 p
->labelno
= const_labelno
++;
2888 p
->next
= after_function_constants
;
2889 after_function_constants
= p
;
2893 p
->next
= deferred_constants
;
2894 deferred_constants
= p
;
2898 output_constant_def_contents (exp
, reloc
, const_labelno
++);
2901 return TREE_CST_RTL (exp
);
2904 /* Now output assembler code to define the label for EXP,
2905 and follow it with the data of EXP. */
2908 output_constant_def_contents (exp
, reloc
, labelno
)
2915 if (IN_NAMED_SECTION (exp
))
2916 named_section (exp
, NULL
, reloc
);
2919 /* First switch to text section, except for writable strings. */
2920 #ifdef SELECT_SECTION
2921 SELECT_SECTION (exp
, reloc
);
2923 if (((TREE_CODE (exp
) == STRING_CST
) && flag_writable_strings
)
2924 || (flag_pic
&& reloc
))
2927 readonly_data_section ();
2931 /* Align the location counter as required by EXP's data type. */
2932 align
= TYPE_ALIGN (TREE_TYPE (exp
));
2933 #ifdef CONSTANT_ALIGNMENT
2934 align
= CONSTANT_ALIGNMENT (exp
, align
);
2937 if (align
> BITS_PER_UNIT
)
2938 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
2940 /* Output the label itself. */
2941 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LC", labelno
);
2943 /* Output the value of EXP. */
2944 output_constant (exp
,
2945 (TREE_CODE (exp
) == STRING_CST
2946 ? TREE_STRING_LENGTH (exp
)
2947 : int_size_in_bytes (TREE_TYPE (exp
))));
2951 /* Similar hash facility for making memory-constants
2952 from constant rtl-expressions. It is used on RISC machines
2953 where immediate integer arguments and constant addresses are restricted
2954 so that such constants must be stored in memory.
2956 This pool of constants is reinitialized for each function
2957 so each function gets its own constants-pool that comes right before it.
2959 All structures allocated here are discarded when functions are saved for
2960 inlining, so they do not need to be allocated permanently. */
2962 #define MAX_RTX_HASH_TABLE 61
2963 static struct constant_descriptor
**const_rtx_hash_table
;
2965 /* Structure to represent sufficient information about a constant so that
2966 it can be output when the constant pool is output, so that function
2967 integration can be done, and to simplify handling on machines that reference
2968 constant pool as base+displacement. */
2970 struct pool_constant
2972 struct constant_descriptor
*desc
;
2973 struct pool_constant
*next
;
2974 enum machine_mode mode
;
2982 /* Pointers to first and last constant in pool. */
2984 static struct pool_constant
*first_pool
, *last_pool
;
2986 /* Current offset in constant pool (does not include any machine-specific
2989 static int pool_offset
;
2991 /* Structure used to maintain hash table mapping symbols used to their
2992 corresponding constants. */
2997 struct pool_constant
*pool
;
2998 struct pool_sym
*next
;
3001 static struct pool_sym
**const_rtx_sym_hash_table
;
3003 /* Hash code for a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true.
3004 The argument is XSTR (... , 0) */
3006 #define SYMHASH(LABEL) \
3007 ((((unsigned long) (LABEL)) & ((1 << HASHBITS) - 1)) % MAX_RTX_HASH_TABLE)
3009 /* Initialize constant pool hashing for next function. */
3012 init_const_rtx_hash_table ()
3014 const_rtx_hash_table
3015 = ((struct constant_descriptor
**)
3016 oballoc (MAX_RTX_HASH_TABLE
* sizeof (struct constant_descriptor
*)));
3017 const_rtx_sym_hash_table
3018 = ((struct pool_sym
**)
3019 oballoc (MAX_RTX_HASH_TABLE
* sizeof (struct pool_sym
*)));
3020 bzero ((char *) const_rtx_hash_table
,
3021 MAX_RTX_HASH_TABLE
* sizeof (struct constant_descriptor
*));
3022 bzero ((char *) const_rtx_sym_hash_table
,
3023 MAX_RTX_HASH_TABLE
* sizeof (struct pool_sym
*));
3025 first_pool
= last_pool
= 0;
3029 /* Save and restore status for a nested function. */
3032 save_varasm_status (p
, context
)
3036 p
->const_rtx_hash_table
= const_rtx_hash_table
;
3037 p
->const_rtx_sym_hash_table
= const_rtx_sym_hash_table
;
3038 p
->first_pool
= first_pool
;
3039 p
->last_pool
= last_pool
;
3040 p
->pool_offset
= pool_offset
;
3041 p
->const_double_chain
= const_double_chain
;
3043 /* If we are pushing to toplevel, we can't reuse const_double_chain. */
3044 if (context
== NULL_TREE
)
3045 const_double_chain
= 0;
3049 restore_varasm_status (p
)
3052 const_rtx_hash_table
= p
->const_rtx_hash_table
;
3053 const_rtx_sym_hash_table
= p
->const_rtx_sym_hash_table
;
3054 first_pool
= p
->first_pool
;
3055 last_pool
= p
->last_pool
;
3056 pool_offset
= p
->pool_offset
;
3057 const_double_chain
= p
->const_double_chain
;
3060 enum kind
{ RTX_DOUBLE
, RTX_INT
};
3064 #ifdef ONLY_INT_FIELDS
3065 unsigned int kind
: 16;
3066 unsigned int mode
: 16;
3068 enum kind kind
: 16;
3069 enum machine_mode mode
: 16;
3072 union real_extract du
;
3073 struct addr_const addr
;
3074 struct {HOST_WIDE_INT high
, low
;} di
;
3078 /* Express an rtx for a constant integer (perhaps symbolic)
3079 as the sum of a symbol or label plus an explicit integer.
3080 They are stored into VALUE. */
3083 decode_rtx_const (mode
, x
, value
)
3084 enum machine_mode mode
;
3086 struct rtx_const
*value
;
3088 /* Clear the whole structure, including any gaps. */
3091 int *p
= (int *) value
;
3092 int *end
= (int *) (value
+ 1);
3097 value
->kind
= RTX_INT
; /* Most usual kind. */
3100 switch (GET_CODE (x
))
3103 value
->kind
= RTX_DOUBLE
;
3104 if (GET_MODE (x
) != VOIDmode
)
3106 value
->mode
= GET_MODE (x
);
3107 bcopy ((char *) &CONST_DOUBLE_LOW (x
),
3108 (char *) &value
->un
.du
, sizeof value
->un
.du
);
3112 value
->un
.di
.low
= CONST_DOUBLE_LOW (x
);
3113 value
->un
.di
.high
= CONST_DOUBLE_HIGH (x
);
3118 value
->un
.addr
.offset
= INTVAL (x
);
3124 value
->un
.addr
.base
= x
;
3129 if (GET_CODE (x
) == PLUS
)
3131 value
->un
.addr
.base
= XEXP (x
, 0);
3132 if (GET_CODE (XEXP (x
, 1)) != CONST_INT
)
3134 value
->un
.addr
.offset
= INTVAL (XEXP (x
, 1));
3136 else if (GET_CODE (x
) == MINUS
)
3138 value
->un
.addr
.base
= XEXP (x
, 0);
3139 if (GET_CODE (XEXP (x
, 1)) != CONST_INT
)
3141 value
->un
.addr
.offset
= - INTVAL (XEXP (x
, 1));
3151 if (value
->kind
== RTX_INT
&& value
->un
.addr
.base
!= 0)
3152 switch (GET_CODE (value
->un
.addr
.base
))
3156 /* Use the string's address, not the SYMBOL_REF's address,
3157 for the sake of addresses of library routines.
3158 For a LABEL_REF, compare labels. */
3159 value
->un
.addr
.base
= XEXP (value
->un
.addr
.base
, 0);
3166 /* Given a MINUS expression, simplify it if both sides
3167 include the same symbol. */
3170 simplify_subtraction (x
)
3173 struct rtx_const val0
, val1
;
3175 decode_rtx_const (GET_MODE (x
), XEXP (x
, 0), &val0
);
3176 decode_rtx_const (GET_MODE (x
), XEXP (x
, 1), &val1
);
3178 if (val0
.un
.addr
.base
== val1
.un
.addr
.base
)
3179 return GEN_INT (val0
.un
.addr
.offset
- val1
.un
.addr
.offset
);
3183 /* Compute a hash code for a constant RTL expression. */
3186 const_hash_rtx (mode
, x
)
3187 enum machine_mode mode
;
3192 struct rtx_const value
;
3193 decode_rtx_const (mode
, x
, &value
);
3195 /* Compute hashing function */
3197 for (i
= 0; i
< sizeof value
/ sizeof (int); i
++)
3198 hi
+= ((int *) &value
)[i
];
3200 hi
&= (1 << HASHBITS
) - 1;
3201 hi
%= MAX_RTX_HASH_TABLE
;
3205 /* Compare a constant rtl object X with a constant-descriptor DESC.
3206 Return 1 if DESC describes a constant with the same value as X. */
3209 compare_constant_rtx (mode
, x
, desc
)
3210 enum machine_mode mode
;
3212 struct constant_descriptor
*desc
;
3214 register int *p
= (int *) desc
->contents
;
3217 struct rtx_const value
;
3219 decode_rtx_const (mode
, x
, &value
);
3220 strp
= (int *) &value
;
3221 len
= sizeof value
/ sizeof (int);
3223 /* Compare constant contents. */
3225 if (*p
++ != *strp
++)
3231 /* Construct a constant descriptor for the rtl-expression X.
3232 It is up to the caller to enter the descriptor in the hash table. */
3234 static struct constant_descriptor
*
3235 record_constant_rtx (mode
, x
)
3236 enum machine_mode mode
;
3239 struct constant_descriptor
*ptr
;
3241 struct rtx_const value
;
3243 decode_rtx_const (mode
, x
, &value
);
3245 /* Put these things in the saveable obstack so we can ensure it won't
3246 be freed if we are called from combine or some other phase that discards
3247 memory allocated from function_obstack (current_obstack). */
3248 obstack_grow (saveable_obstack
, &ptr
, sizeof ptr
);
3249 obstack_grow (saveable_obstack
, &label
, sizeof label
);
3251 /* Record constant contents. */
3252 obstack_grow (saveable_obstack
, &value
, sizeof value
);
3254 return (struct constant_descriptor
*) obstack_finish (saveable_obstack
);
3257 /* Given a constant rtx X, make (or find) a memory constant for its value
3258 and return a MEM rtx to refer to it in memory. */
3261 force_const_mem (mode
, x
)
3262 enum machine_mode mode
;
3266 register struct constant_descriptor
*desc
;
3271 /* If we want this CONST_DOUBLE in the same mode as it is in memory
3272 (this will always be true for floating CONST_DOUBLEs that have been
3273 placed in memory, but not for VOIDmode (integer) CONST_DOUBLEs),
3274 use the previous copy. Otherwise, make a new one. Note that in
3275 the unlikely event that this same CONST_DOUBLE is used in two different
3276 modes in an alternating fashion, we will allocate a lot of different
3277 memory locations, but this should be extremely rare. */
3279 /* Don't use CONST_DOUBLE_MEM in a nested function.
3280 Nested functions have their own constant pools,
3281 so they can't share the same values in CONST_DOUBLE_MEM
3282 with the containing function. */
3283 if (outer_function_chain
== 0)
3284 if (GET_CODE (x
) == CONST_DOUBLE
3285 && GET_CODE (CONST_DOUBLE_MEM (x
)) == MEM
3286 && GET_MODE (CONST_DOUBLE_MEM (x
)) == mode
)
3287 return CONST_DOUBLE_MEM (x
);
3289 /* Compute hash code of X. Search the descriptors for that hash code
3290 to see if any of them describes X. If yes, the descriptor records
3291 the label number already assigned. */
3293 hash
= const_hash_rtx (mode
, x
);
3295 for (desc
= const_rtx_hash_table
[hash
]; desc
; desc
= desc
->next
)
3296 if (compare_constant_rtx (mode
, x
, desc
))
3298 found
= desc
->label
;
3304 register struct pool_constant
*pool
;
3305 register struct pool_sym
*sym
;
3308 /* No constant equal to X is known to have been output.
3309 Make a constant descriptor to enter X in the hash table.
3310 Assign the label number and record it in the descriptor for
3311 future calls to this function to find. */
3313 desc
= record_constant_rtx (mode
, x
);
3314 desc
->next
= const_rtx_hash_table
[hash
];
3315 const_rtx_hash_table
[hash
] = desc
;
3317 /* Align the location counter as required by EXP's data type. */
3318 align
= (mode
== VOIDmode
) ? UNITS_PER_WORD
: GET_MODE_SIZE (mode
);
3319 if (align
> BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
3320 align
= BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
;
3322 pool_offset
+= align
- 1;
3323 pool_offset
&= ~ (align
- 1);
3325 /* If RTL is not being placed into the saveable obstack, make a
3326 copy of X that is in the saveable obstack in case we are
3327 being called from combine or some other phase that discards
3328 memory it allocates. We used to only do this if it is a
3329 CONST; however, reload can allocate a CONST_INT when
3330 eliminating registers. */
3331 if (rtl_obstack
!= saveable_obstack
3332 && (GET_CODE (x
) == CONST
|| GET_CODE (x
) == CONST_INT
))
3334 push_obstacks_nochange ();
3335 rtl_in_saveable_obstack ();
3337 if (GET_CODE (x
) == CONST
)
3338 x
= gen_rtx_CONST (GET_MODE (x
),
3339 gen_rtx_PLUS (GET_MODE (x
),
3340 XEXP (XEXP (x
, 0), 0),
3341 XEXP (XEXP (x
, 0), 1)));
3343 x
= GEN_INT (INTVAL (x
));
3348 /* Allocate a pool constant descriptor, fill it in, and chain it in. */
3350 pool
= (struct pool_constant
*) savealloc (sizeof (struct pool_constant
));
3354 pool
->labelno
= const_labelno
;
3355 pool
->align
= align
;
3356 pool
->offset
= pool_offset
;
3363 last_pool
->next
= pool
;
3366 pool_offset
+= GET_MODE_SIZE (mode
);
3368 /* Create a string containing the label name, in LABEL. */
3369 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
3374 = (char *) obstack_copy0 (saveable_obstack
, label
, strlen (label
));
3376 /* Add label to symbol hash table. */
3377 hash
= SYMHASH (found
);
3378 sym
= (struct pool_sym
*) savealloc (sizeof (struct pool_sym
));
3381 sym
->next
= const_rtx_sym_hash_table
[hash
];
3382 const_rtx_sym_hash_table
[hash
] = sym
;
3385 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
3387 def
= gen_rtx_MEM (mode
, gen_rtx_SYMBOL_REF (Pmode
, found
));
3389 RTX_UNCHANGING_P (def
) = 1;
3390 /* Mark the symbol_ref as belonging to this constants pool. */
3391 CONSTANT_POOL_ADDRESS_P (XEXP (def
, 0)) = 1;
3392 current_function_uses_const_pool
= 1;
3394 if (outer_function_chain
== 0)
3395 if (GET_CODE (x
) == CONST_DOUBLE
)
3397 if (CONST_DOUBLE_MEM (x
) == cc0_rtx
)
3399 CONST_DOUBLE_CHAIN (x
) = const_double_chain
;
3400 const_double_chain
= x
;
3402 CONST_DOUBLE_MEM (x
) = def
;
3408 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
3409 the corresponding pool_constant structure. */
3411 static struct pool_constant
*
3412 find_pool_constant (addr
)
3415 struct pool_sym
*sym
;
3416 char *label
= XSTR (addr
, 0);
3418 for (sym
= const_rtx_sym_hash_table
[SYMHASH (label
)]; sym
; sym
= sym
->next
)
3419 if (sym
->label
== label
)
3425 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
3428 get_pool_constant (addr
)
3431 return (find_pool_constant (addr
))->constant
;
3434 /* Similar, return the mode. */
3437 get_pool_mode (addr
)
3440 return (find_pool_constant (addr
))->mode
;
3443 /* Similar, return the offset in the constant pool. */
3446 get_pool_offset (addr
)
3449 return (find_pool_constant (addr
))->offset
;
3452 /* Return the size of the constant pool. */
3460 /* Write all the constants in the constant pool. */
3463 output_constant_pool (fnname
, fndecl
)
3467 struct pool_constant
*pool
;
3469 union real_extract u
;
3471 /* It is possible for gcc to call force_const_mem and then to later
3472 discard the instructions which refer to the constant. In such a
3473 case we do not need to output the constant. */
3474 if (optimize
>= 0 && flag_expensive_optimizations
)
3475 mark_constant_pool ();
3477 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3478 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3481 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3488 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3489 whose CODE_LABEL has been deleted. This can occur if a jump table
3490 is eliminated by optimization. If so, write a constant of zero
3491 instead. Note that this can also happen by turning the
3492 CODE_LABEL into a NOTE. */
3493 if (((GET_CODE (x
) == LABEL_REF
3494 && (INSN_DELETED_P (XEXP (x
, 0))
3495 || GET_CODE (XEXP (x
, 0)) == NOTE
)))
3496 || (GET_CODE (x
) == CONST
&& GET_CODE (XEXP (x
, 0)) == PLUS
3497 && GET_CODE (XEXP (XEXP (x
, 0), 0)) == LABEL_REF
3498 && (INSN_DELETED_P (XEXP (XEXP (XEXP (x
, 0), 0), 0))
3499 || GET_CODE (XEXP (XEXP (XEXP (x
, 0), 0), 0)) == NOTE
)))
3502 /* First switch to correct section. */
3503 #ifdef SELECT_RTX_SECTION
3504 SELECT_RTX_SECTION (pool
->mode
, x
);
3506 readonly_data_section ();
3509 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3510 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file
, x
, pool
->mode
,
3511 pool
->align
, pool
->labelno
, done
);
3514 if (pool
->align
> 1)
3515 ASM_OUTPUT_ALIGN (asm_out_file
, exact_log2 (pool
->align
));
3517 /* Output the label. */
3518 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LC", pool
->labelno
);
3520 /* Output the value of the constant itself. */
3521 switch (GET_MODE_CLASS (pool
->mode
))
3524 if (GET_CODE (x
) != CONST_DOUBLE
)
3527 bcopy ((char *) &CONST_DOUBLE_LOW (x
), (char *) &u
, sizeof u
);
3528 assemble_real (u
.d
, pool
->mode
);
3532 case MODE_PARTIAL_INT
:
3533 assemble_integer (x
, GET_MODE_SIZE (pool
->mode
), 1);
3543 #ifdef ASM_OUTPUT_POOL_EPILOGUE
3544 ASM_OUTPUT_POOL_EPILOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3547 /* Done with this pool. */
3548 first_pool
= last_pool
= 0;
3551 /* Look through the instructions for this function, and mark all the
3552 entries in the constant pool which are actually being used. */
3555 mark_constant_pool ()
3558 struct pool_constant
*pool
;
3560 if (first_pool
== 0)
3563 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3566 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
3567 if (GET_RTX_CLASS (GET_CODE (insn
)) == 'i')
3568 mark_constants (PATTERN (insn
));
3570 for (insn
= current_function_epilogue_delay_list
;
3572 insn
= XEXP (insn
, 1))
3573 if (GET_RTX_CLASS (GET_CODE (insn
)) == 'i')
3574 mark_constants (PATTERN (insn
));
3582 register char *format_ptr
;
3587 if (GET_CODE (x
) == SYMBOL_REF
)
3589 if (CONSTANT_POOL_ADDRESS_P (x
))
3590 find_pool_constant (x
)->mark
= 1;
3593 /* Never search inside a CONST_DOUBLE, because CONST_DOUBLE_MEM may be
3594 a MEM, but does not constitute a use of that MEM. This is particularly
3595 important inside a nested function, because CONST_DOUBLE_MEM may be
3596 a reference to a MEM in the parent's constant pool. See the comment
3597 in force_const_mem. */
3598 else if (GET_CODE (x
) == CONST_DOUBLE
)
3601 /* Insns may appear inside a SEQUENCE. Only check the patterns of
3602 insns, not any notes that may be attached. We don't want to mark
3603 a constant just because it happens to appear in a REG_EQUIV note. */
3604 if (GET_RTX_CLASS (GET_CODE (x
)) == 'i')
3606 mark_constants (PATTERN (x
));
3610 format_ptr
= GET_RTX_FORMAT (GET_CODE (x
));
3612 for (i
= 0; i
< GET_RTX_LENGTH (GET_CODE (x
)); i
++)
3614 switch (*format_ptr
++)
3617 mark_constants (XEXP (x
, i
));
3621 if (XVEC (x
, i
) != 0)
3625 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
3626 mark_constants (XVECEXP (x
, i
, j
));
3645 /* Find all the constants whose addresses are referenced inside of EXP,
3646 and make sure assembler code with a label has been output for each one.
3647 Indicate whether an ADDR_EXPR has been encountered. */
3650 output_addressed_constants (exp
)
3655 switch (TREE_CODE (exp
))
3659 register tree constant
= TREE_OPERAND (exp
, 0);
3661 while (TREE_CODE (constant
) == COMPONENT_REF
)
3663 constant
= TREE_OPERAND (constant
, 0);
3666 if (TREE_CODE_CLASS (TREE_CODE (constant
)) == 'c'
3667 || TREE_CODE (constant
) == CONSTRUCTOR
)
3668 /* No need to do anything here
3669 for addresses of variables or functions. */
3670 output_constant_def (constant
);
3677 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
3678 reloc
|= output_addressed_constants (TREE_OPERAND (exp
, 1));
3683 case NON_LVALUE_EXPR
:
3684 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
3690 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
3691 if (TREE_VALUE (link
) != 0)
3692 reloc
|= output_addressed_constants (TREE_VALUE (link
));
3702 /* Output assembler code for constant EXP to FILE, with no label.
3703 This includes the pseudo-op such as ".int" or ".byte", and a newline.
3704 Assumes output_addressed_constants has been done on EXP already.
3706 Generate exactly SIZE bytes of assembler data, padding at the end
3707 with zeros if necessary. SIZE must always be specified.
3709 SIZE is important for structure constructors,
3710 since trailing members may have been omitted from the constructor.
3711 It is also important for initialization of arrays from string constants
3712 since the full length of the string constant might not be wanted.
3713 It is also needed for initialization of unions, where the initializer's
3714 type is just one member, and that may not be as long as the union.
3716 There a case in which we would fail to output exactly SIZE bytes:
3717 for a structure constructor that wants to produce more than SIZE bytes.
3718 But such constructors will never be generated for any possible input. */
3721 output_constant (exp
, size
)
3725 register enum tree_code code
= TREE_CODE (TREE_TYPE (exp
));
3731 /* Eliminate the NON_LVALUE_EXPR_EXPR that makes a cast not be an lvalue.
3732 That way we get the constant (we hope) inside it. Also, strip off any
3733 NOP_EXPR that converts between two record, union, array, or set types. */
3734 while ((TREE_CODE (exp
) == NOP_EXPR
3735 && (TREE_TYPE (exp
) == TREE_TYPE (TREE_OPERAND (exp
, 0))
3736 || AGGREGATE_TYPE_P (TREE_TYPE (exp
))))
3737 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
3738 exp
= TREE_OPERAND (exp
, 0);
3740 /* Allow a constructor with no elements for any data type.
3741 This means to fill the space with zeros. */
3742 if (TREE_CODE (exp
) == CONSTRUCTOR
&& CONSTRUCTOR_ELTS (exp
) == 0)
3744 assemble_zeros (size
);
3755 case REFERENCE_TYPE
:
3756 /* ??? What about (int)((float)(int)&foo + 4) */
3757 while (TREE_CODE (exp
) == NOP_EXPR
|| TREE_CODE (exp
) == CONVERT_EXPR
3758 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
3759 exp
= TREE_OPERAND (exp
, 0);
3761 if (! assemble_integer (expand_expr (exp
, NULL_RTX
, VOIDmode
,
3762 EXPAND_INITIALIZER
),
3764 error ("initializer for integer value is too complicated");
3769 if (TREE_CODE (exp
) != REAL_CST
)
3770 error ("initializer for floating value is not a floating constant");
3772 assemble_real (TREE_REAL_CST (exp
),
3773 mode_for_size (size
* BITS_PER_UNIT
, MODE_FLOAT
, 0));
3778 output_constant (TREE_REALPART (exp
), size
/ 2);
3779 output_constant (TREE_IMAGPART (exp
), size
/ 2);
3780 size
-= (size
/ 2) * 2;
3784 if (TREE_CODE (exp
) == CONSTRUCTOR
)
3786 output_constructor (exp
, size
);
3789 else if (TREE_CODE (exp
) == STRING_CST
)
3793 if (size
> TREE_STRING_LENGTH (exp
))
3795 excess
= size
- TREE_STRING_LENGTH (exp
);
3796 size
= TREE_STRING_LENGTH (exp
);
3799 assemble_string (TREE_STRING_POINTER (exp
), size
);
3808 if (TREE_CODE (exp
) == CONSTRUCTOR
)
3809 output_constructor (exp
, size
);
3815 if (TREE_CODE (exp
) == INTEGER_CST
)
3816 assemble_integer (expand_expr (exp
, NULL_RTX
,
3817 VOIDmode
, EXPAND_INITIALIZER
),
3819 else if (TREE_CODE (exp
) == CONSTRUCTOR
)
3821 unsigned char *buffer
= (unsigned char *) alloca (size
);
3822 if (get_set_constructor_bytes (exp
, buffer
, size
))
3824 assemble_string ((char *) buffer
, size
);
3827 error ("unknown set constructor type");
3835 assemble_zeros (size
);
3839 /* Subroutine of output_constant, used for CONSTRUCTORs
3840 (aggregate constants).
3841 Generate at least SIZE bytes, padding if necessary. */
3844 output_constructor (exp
, size
)
3848 register tree link
, field
= 0;
3849 HOST_WIDE_INT min_index
= 0;
3850 /* Number of bytes output or skipped so far.
3851 In other words, current position within the constructor. */
3852 int total_bytes
= 0;
3853 /* Non-zero means BYTE contains part of a byte, to be output. */
3854 int byte_buffer_in_use
= 0;
3857 if (HOST_BITS_PER_WIDE_INT
< BITS_PER_UNIT
)
3860 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
3861 field
= TYPE_FIELDS (TREE_TYPE (exp
));
3863 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
3864 && TYPE_DOMAIN (TREE_TYPE (exp
)) != 0)
3866 = TREE_INT_CST_LOW (TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (exp
))));
3868 /* As LINK goes through the elements of the constant,
3869 FIELD goes through the structure fields, if the constant is a structure.
3870 if the constant is a union, then we override this,
3871 by getting the field from the TREE_LIST element.
3872 But the constant could also be an array. Then FIELD is zero. */
3873 for (link
= CONSTRUCTOR_ELTS (exp
);
3875 link
= TREE_CHAIN (link
),
3876 field
= field
? TREE_CHAIN (field
) : 0)
3878 tree val
= TREE_VALUE (link
);
3881 /* the element in a union constructor specifies the proper field. */
3883 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
3884 || TREE_CODE (TREE_TYPE (exp
)) == UNION_TYPE
)
3886 /* if available, use the type given by link */
3887 if (TREE_PURPOSE (link
) != 0)
3888 field
= TREE_PURPOSE (link
);
3891 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
3892 index
= TREE_PURPOSE (link
);
3894 /* Eliminate the marker that makes a cast not be an lvalue. */
3898 if (index
&& TREE_CODE (index
) == RANGE_EXPR
)
3900 register int fieldsize
3901 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (exp
)));
3902 HOST_WIDE_INT lo_index
= TREE_INT_CST_LOW (TREE_OPERAND (index
, 0));
3903 HOST_WIDE_INT hi_index
= TREE_INT_CST_LOW (TREE_OPERAND (index
, 1));
3904 HOST_WIDE_INT index
;
3905 for (index
= lo_index
; index
<= hi_index
; index
++)
3907 /* Output the element's initial value. */
3909 assemble_zeros (fieldsize
);
3911 output_constant (val
, fieldsize
);
3913 /* Count its size. */
3914 total_bytes
+= fieldsize
;
3917 else if (field
== 0 || !DECL_BIT_FIELD (field
))
3919 /* An element that is not a bit-field. */
3921 register int fieldsize
;
3922 /* Since this structure is static,
3923 we know the positions are constant. */
3924 int bitpos
= (field
? (TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field
))
3928 bitpos
= (TREE_INT_CST_LOW (TYPE_SIZE (TREE_TYPE (val
)))
3930 * (TREE_INT_CST_LOW (index
) - min_index
));
3932 /* Output any buffered-up bit-fields preceding this element. */
3933 if (byte_buffer_in_use
)
3935 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
3937 byte_buffer_in_use
= 0;
3940 /* Advance to offset of this element.
3941 Note no alignment needed in an array, since that is guaranteed
3942 if each element has the proper size. */
3943 if ((field
!= 0 || index
!= 0) && bitpos
!= total_bytes
)
3945 assemble_zeros (bitpos
- total_bytes
);
3946 total_bytes
= bitpos
;
3949 /* Determine size this element should occupy. */
3952 if (TREE_CODE (DECL_SIZE (field
)) != INTEGER_CST
)
3954 if (TREE_INT_CST_LOW (DECL_SIZE (field
)) > 100000)
3956 /* This avoids overflow trouble. */
3957 tree size_tree
= size_binop (CEIL_DIV_EXPR
,
3959 size_int (BITS_PER_UNIT
));
3960 fieldsize
= TREE_INT_CST_LOW (size_tree
);
3964 fieldsize
= TREE_INT_CST_LOW (DECL_SIZE (field
));
3965 fieldsize
= (fieldsize
+ BITS_PER_UNIT
- 1) / BITS_PER_UNIT
;
3969 fieldsize
= int_size_in_bytes (TREE_TYPE (TREE_TYPE (exp
)));
3971 /* Output the element's initial value. */
3973 assemble_zeros (fieldsize
);
3975 output_constant (val
, fieldsize
);
3977 /* Count its size. */
3978 total_bytes
+= fieldsize
;
3980 else if (val
!= 0 && TREE_CODE (val
) != INTEGER_CST
)
3981 error ("invalid initial value for member `%s'",
3982 IDENTIFIER_POINTER (DECL_NAME (field
)));
3985 /* Element that is a bit-field. */
3987 int next_offset
= TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field
));
3989 = (next_offset
+ TREE_INT_CST_LOW (DECL_SIZE (field
)));
3992 val
= integer_zero_node
;
3994 /* If this field does not start in this (or, next) byte,
3996 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
3998 /* Output remnant of any bit field in previous bytes. */
3999 if (byte_buffer_in_use
)
4001 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4003 byte_buffer_in_use
= 0;
4006 /* If still not at proper byte, advance to there. */
4007 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4009 assemble_zeros (next_offset
/ BITS_PER_UNIT
- total_bytes
);
4010 total_bytes
= next_offset
/ BITS_PER_UNIT
;
4014 if (! byte_buffer_in_use
)
4017 /* We must split the element into pieces that fall within
4018 separate bytes, and combine each byte with previous or
4019 following bit-fields. */
4021 /* next_offset is the offset n fbits from the beginning of
4022 the structure to the next bit of this element to be processed.
4023 end_offset is the offset of the first bit past the end of
4025 while (next_offset
< end_offset
)
4029 HOST_WIDE_INT value
;
4030 int next_byte
= next_offset
/ BITS_PER_UNIT
;
4031 int next_bit
= next_offset
% BITS_PER_UNIT
;
4033 /* Advance from byte to byte
4034 within this element when necessary. */
4035 while (next_byte
!= total_bytes
)
4037 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4042 /* Number of bits we can process at once
4043 (all part of the same byte). */
4044 this_time
= MIN (end_offset
- next_offset
,
4045 BITS_PER_UNIT
- next_bit
);
4046 if (BYTES_BIG_ENDIAN
)
4048 /* On big-endian machine, take the most significant bits
4049 first (of the bits that are significant)
4050 and put them into bytes from the most significant end. */
4051 shift
= end_offset
- next_offset
- this_time
;
4052 /* Don't try to take a bunch of bits that cross
4053 the word boundary in the INTEGER_CST. */
4054 if (shift
< HOST_BITS_PER_WIDE_INT
4055 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4057 this_time
-= (HOST_BITS_PER_WIDE_INT
- shift
);
4058 shift
= HOST_BITS_PER_WIDE_INT
;
4061 /* Now get the bits from the appropriate constant word. */
4062 if (shift
< HOST_BITS_PER_WIDE_INT
)
4064 value
= TREE_INT_CST_LOW (val
);
4066 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4068 value
= TREE_INT_CST_HIGH (val
);
4069 shift
-= HOST_BITS_PER_WIDE_INT
;
4073 byte
|= (((value
>> shift
)
4074 & (((HOST_WIDE_INT
) 1 << this_time
) - 1))
4075 << (BITS_PER_UNIT
- this_time
- next_bit
));
4079 /* On little-endian machines,
4080 take first the least significant bits of the value
4081 and pack them starting at the least significant
4082 bits of the bytes. */
4083 shift
= (next_offset
4084 - TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field
)));
4085 /* Don't try to take a bunch of bits that cross
4086 the word boundary in the INTEGER_CST. */
4087 if (shift
< HOST_BITS_PER_WIDE_INT
4088 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4090 this_time
-= (HOST_BITS_PER_WIDE_INT
- shift
);
4091 shift
= HOST_BITS_PER_WIDE_INT
;
4094 /* Now get the bits from the appropriate constant word. */
4095 if (shift
< HOST_BITS_PER_WIDE_INT
)
4096 value
= TREE_INT_CST_LOW (val
);
4097 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4099 value
= TREE_INT_CST_HIGH (val
);
4100 shift
-= HOST_BITS_PER_WIDE_INT
;
4104 byte
|= (((value
>> shift
)
4105 & (((HOST_WIDE_INT
) 1 << this_time
) - 1))
4108 next_offset
+= this_time
;
4109 byte_buffer_in_use
= 1;
4113 if (byte_buffer_in_use
)
4115 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4118 if (total_bytes
< size
)
4119 assemble_zeros (size
- total_bytes
);
4122 /* Output asm to handle ``#pragma weak'' */
4125 handle_pragma_weak (what
, name
, value
)
4126 enum pragma_state what
;
4129 #ifdef HANDLE_PRAGMA_WEAK
4130 if (what
== ps_name
|| what
== ps_value
)
4132 struct weak_syms
*weak
=
4133 (struct weak_syms
*)permalloc (sizeof (struct weak_syms
));
4134 weak
->next
= weak_decls
;
4135 weak
->name
= permalloc (strlen (name
) + 1);
4136 strcpy (weak
->name
, name
);
4138 if (what
!= ps_value
)
4139 weak
->value
= NULL_PTR
;
4143 weak
->value
= permalloc (strlen (value
) + 1);
4144 strcpy (weak
->value
, value
);
4149 else if (! (what
== ps_done
|| what
== ps_start
))
4150 warning ("malformed `#pragma weak'");
4151 #endif /* HANDLE_PRAGMA_WEAK */
4154 /* Declare DECL to be a weak symbol. */
4160 if (! TREE_PUBLIC (decl
))
4161 error_with_decl (decl
, "weak declaration of `%s' must be public");
4162 else if (TREE_ASM_WRITTEN (decl
))
4163 error_with_decl (decl
, "weak declaration of `%s' must precede definition");
4164 else if (SUPPORTS_WEAK
)
4165 DECL_WEAK (decl
) = 1;
4168 /* Emit any pending weak declarations. */
4173 #ifdef HANDLE_PRAGMA_WEAK
4174 if (HANDLE_PRAGMA_WEAK
)
4176 struct weak_syms
*t
;
4177 for (t
= weak_decls
; t
; t
= t
->next
)
4179 ASM_WEAKEN_LABEL (asm_out_file
, t
->name
);
4181 ASM_OUTPUT_DEF (asm_out_file
, t
->name
, t
->value
);
4188 assemble_alias (decl
, target
)
4193 make_decl_rtl (decl
, (char *) 0, 1);
4194 name
= XSTR (XEXP (DECL_RTL (decl
), 0), 0);
4196 #ifdef ASM_OUTPUT_DEF
4197 /* Make name accessible from other files, if appropriate. */
4199 if (TREE_PUBLIC (decl
))
4201 #ifdef ASM_WEAKEN_LABEL
4202 if (DECL_WEAK (decl
))
4203 ASM_WEAKEN_LABEL (asm_out_file
, name
);
4206 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
4209 ASM_OUTPUT_DEF (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4210 TREE_ASM_WRITTEN (decl
) = 1;
4212 #ifdef ASM_OUTPUT_WEAK_ALIAS
4213 if (! DECL_WEAK (decl
))
4214 warning ("only weak aliases are supported in this configuration");
4216 ASM_OUTPUT_WEAK_ALIAS (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4217 TREE_ASM_WRITTEN (decl
) = 1;
4219 warning ("alias definitions not supported in this configuration; ignored");
4224 /* This determines whether or not we support link-once semantics. */
4225 #ifndef SUPPORTS_ONE_ONLY
4226 #ifdef MAKE_DECL_ONE_ONLY
4227 #define SUPPORTS_ONE_ONLY 1
4229 #define SUPPORTS_ONE_ONLY 0
4233 /* Returns 1 if the target configuration supports defining public symbols
4234 so that one of them will be chosen at link time instead of generating a
4235 multiply-defined symbol error, whether through the use of weak symbols or
4236 a target-specific mechanism for having duplicates discarded. */
4239 supports_one_only ()
4241 if (SUPPORTS_ONE_ONLY
)
4243 return SUPPORTS_WEAK
;
4246 /* Set up DECL as a public symbol that can be defined in multiple
4247 translation units without generating a linker error. */
4250 make_decl_one_only (decl
)
4253 if (TREE_CODE (decl
) != VAR_DECL
&& TREE_CODE (decl
) != FUNCTION_DECL
)
4256 TREE_PUBLIC (decl
) = 1;
4258 if (TREE_CODE (decl
) == VAR_DECL
4259 && (DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
))
4260 DECL_COMMON (decl
) = 1;
4261 else if (SUPPORTS_ONE_ONLY
)
4263 #ifdef MAKE_DECL_ONE_ONLY
4264 MAKE_DECL_ONE_ONLY (decl
);
4266 DECL_ONE_ONLY (decl
) = 1;
4268 else if (SUPPORTS_WEAK
)
4269 DECL_WEAK (decl
) = 1;